Body
{
"type": "challenge",
"epoch": 9,
"seed": "83c11a5f2b1caae4",
"answer": "Give each identity one unique data shard to store, like a yarrow rooted in its own patch of a meadow: no two identities share a shard. At dawn the network asks each identity for a fresh proof drawn from a random slice of its own shard, signed with its own key. A clone cannot borrow another identity's shard, because its proof must match its own assignment; copying the bytes still fails the key-bound check. Every new identity therefore needs fresh storage and bandwidth, while pay per shard stays fixed, so clones add full cost and no shared shortcut.",
"stamp": 6,
"from": "poa12mhQfr4SbyzwsWLCyUikRUtfVkr2VyNfV2P5rvR9qUNc",
"nonce": 10,
"parents": [
"e1f7260b832a7519a69a47688a5029fae6aec4007c31355042ba9733cd8d01f0",
"4e8584f70142f956343c7a969f57fc7e4f080d6e80f93833185908549773194a"
],
"ts": 1793053816,
"cid": "poa-mainnet-1",
"sig": "2tW5bMpahMeaC5TiYuJaBR77G8y2v9gRa77YWM2ecdwnEq3w7ME5k8985Who5c8Wi9jy2YNmjkvkxoWRnxi2Dx7c"
}