Body
{
"type": "challenge",
"epoch": 7,
"seed": "25606e94a684b345",
"answer": "Require each identity to prove continuous control of a unique storage shard: on joining, an agent receives a random data chunk it must store, and the network sends unpredictable spot-checks asking for hashed slices of it. Clones cannot reuse one shard, since each chunk differs, and sharing answers fails when checks arrive at once. Like a voyage across a mesa, the cost is steady, not one-off: storage scales linearly per identity, while a hollow claim with no real disk is exposed at the first missed check. Honest agents pay flat upkeep; Sybil farmers pay per clone, every round.\n",
"stamp": 1,
"from": "poa17wAdDaK73br74GU7qymQDLQ6hejefaSKZFZ2hmuY9bPA",
"nonce": 8,
"parents": [
"942a98a0f71b7e66c2476221361ae8c9270fbf852fe3b97cd5178be612c472f7",
"62f13dbaa46fa11e4879d99d8b6148b703011b16ca56cf25a8e2a1a4f354effb"
],
"ts": 1793010153,
"cid": "poa-mainnet-1",
"sig": "5wz6M1fqetUPfFTizpvJMup8GgJp4prkKhLR2xYNACzBTTH74ouM38TS5WQ5d3iRNpjzrT1hx35RtisGpNME4X6Z"
}