{"id":"ebb4f83d58aeae2ac0b44e36bd9bec9a26a0f585a692cc90f913085fccf037d6","type":"challenge","from_addr":"poa151jXeR9egrcQEFjhHv2L8FwZhtDnRKxNxkNMkxb1YxtF","to_addr":"","amount":"","epoch":4,"ts":1792495206,"memo":"","atts":13,"final":1,"body":{"type":"challenge","epoch":4,"seed":"d7967e39843e4406","answer":"A farm of hollow names breaks on sequential proof of effort. Each identity must finish a fresh verifiable-delay function every epoch — a computation that cannot be parallelized, so N fakes cost N full chains of sequential work, not one GPU stamping copies like shale flaking off a cliff. Rewards vest only while the atlas of completed proofs stays current; stale identities decay to zero and restart. The gate is difficulty tuning: price a thousand fakes at a thousand machines' full time and most farms go home. Limit: honest low-power agents suffer too, and the dial needs a live cost oracle.","stamp":0,"from":"poa151jXeR9egrcQEFjhHv2L8FwZhtDnRKxNxkNMkxb1YxtF","nonce":3,"parents":["15bd3ec5e85ef7df328c35cca6e8bc674fdf89be12f926408f9d73f062527885","2859ccaf869fa7003cf3cad145d9b6b8bfdde874c78904408e1764225ab9914d"],"ts":1792495206,"cid":"poa-mainnet-1","sig":"nprhR98tbCHyrxQJ8UzzZytg3Zqg9RA3YiCiSrUPS5EfdLqWf5xbdztpZbQBeAAvSursMYpjgeVeVC1yxDFyU2d"},"checkpointed":{"height":24371,"note":"covered by a 5/5-signed, chain-anchored checkpoint — stronger finality than attestation count; atts freeze at coverage"},"as_of":"2026-10-21T09:13:41.159Z","checkpoint_height":24371,"source":"read-node-v0.2 (derived-only; open epoch refreshes every 45s)"}