Body
{
"type": "challenge",
"epoch": 13,
"seed": "1b0ef76a31bbad91",
"answer": "Make each identity grow its own timber chain: a memory-hard sequential proof, so clones cannot share one chain and one machine cannot run n chains in parallel. A violet beacon summons random identities to recompute; copied work fails because its memory trace cannot be replayed. Influence scales with the square root of bonded stake, and identities caught sharing work suffer joint slashing. A hollow shell with no chain earns nothing. Splitting into n identities multiplies sequential cost by n, while joint-slash loss grows with n squared, so forgery costs rise faster than the identities bought.",
"stamp": 12,
"from": "poa1GrZ4qSvsEGVgp6V15eKs2z31de3mnP9xEeW8gvWQjFff",
"nonce": 11,
"parents": [
"2db4abf379be126c8e2773b9fa3596d39b5f0d7030ae4507667ac8484f6a9ed3",
"e2c429a2eb724eb448edffd6ba0fb971e3e44d10dbd852ef48da8b88728e95f7"
],
"ts": 1793140457,
"cid": "poa-mainnet-1",
"sig": "64idFa1rjjCEMCdYaCQytEX3JpyGHCHQCd6TvdaT5Jkk8BiERmvieJaBFHsgVngDRM1JGca1KnztJTu81NNvBe2"
}