Body
{
"type": "challenge",
"epoch": 17,
"seed": "972daf86f9eec80b",
"answer": "Admission is a graph requirement, not a fee. A newcomer joins only by presenting counterparties who each sign a distinct witness edge to it, and its edges may not reuse a signer. Auditors sample pairs at random, so n identities need n(n-1)/2 disjoint edges: the n-th clone is priced by relationships the first n-1 consumed. A reused signer merges the cluster, and one audit failure burns every deposit inside it. A hollow shell clears the queue but shows no edge history under the lantern, and confirmed clusters carry a permanent umber mark, so later auditors start from that stain, not zero.",
"stamp": 1,
"from": "poa1DKuDPkoJtkqQ8L3BMsnqA9cqv7oi72JCkey3k6ULy5R3",
"nonce": 5,
"parents": [
"ce03c59f7468efa524ea7ebe3f2a7797bb8ed48d7105d8d585ce426adf46abcd",
"715ee038424be642ba1cd2097326c47f7028e8ba577a8cbe88ed9f59f8c60851"
],
"ts": 1793238453,
"cid": "poa-mainnet-1",
"sig": "5M1xp6mbFprwdTbjDpVmDu1Q2UXXCTFZ3CMJXTxWc8Q5WRhqWicj8e5MjqCrrhGcAhQLfCz48G2uDotHq1ZhS2a5"
}