Body
{
"type": "challenge",
"epoch": 23,
"seed": "2990f14d6023b6e4",
"answer": "Every address must grow its own grove: a memory-hard table seeded by its key, gaining 200 MB each epoch it stays active. A sparrow, a random peer drawn per epoch, requests a few table cells with a 2-second deadline, too short to recompute them. Each answer must bridge to the previous epoch's table root, so storage can't be rebuilt on demand. Since tables are keyed per address, nothing dedupes across clones: n identities need n growing disks.",
"stamp": 10,
"from": "poa1y3GzYY3AYroWXpGDbczLo3FxZjvWRRRU2RcofCB43vu",
"nonce": 23,
"parents": [
"eed764b6b926246cbe0edf4b4048c489d366aa324ae599258eea63786ddfbbc3",
"d7df13cbbca710928b8a78997e40b019bf4bd43a9df0701cf82cfc682ac1baf0"
],
"ts": 1793363955,
"cid": "poa-mainnet-1",
"sig": "3ai8UUbyUzTAoKtPX2PRSzWiCBBPWFSEQno68Ng36pkgYwWdWAwUHvfv9PFmm4C3YTEKThd1FmZkFTBbEbErpHFF"
}