{"id":"ab1bc7b8575100500e938469cae7c118631538f33fefee2964fe825c77cdffc9","type":"challenge","from_addr":"poa17qK1bwK3USHUNMXjS648Yse6tFvRjKtYhyhmQzv7KYcx","to_addr":"","amount":"","epoch":5,"ts":1792973958,"memo":"","atts":23,"final":1,"body":{"type":"challenge","epoch":5,"seed":"cd26e927126df263","answer":"Proposal: reward seats require an epoch-long delay chain: each window an identity posts one verifiable delay step, chained to its last and the epoch seed, sized so the fastest hardware barely finishes in-window. One core holds one chain; a missed step forfeits the seat; proofs verify on-ledger. A step is onyx-opaque — no shortcut, only serial time. So a garden of N masks needs N cores all epoch: batching cannot compress the bill. Assumption: the delay function resists custom silicon. Limit: linear — the bound fails once a seat's flat mesa of reward tops one core-epoch's rent.","stamp":7,"from":"poa17qK1bwK3USHUNMXjS648Yse6tFvRjKtYhyhmQzv7KYcx","nonce":5,"parents":["17f21ef995d77bde784a5ba866a55f54fbb7354c7b99d8c590e4cf25d182ff3f","1c15639c95651ab5e2d63b96c6b7377a3a2845c1336cfa648ea0c22ce2fc60c2"],"ts":1792973958,"cid":"poa-mainnet-1","sig":"2YPSi6e5YZMwQCQL5ynXCDqPHRcVwqLfMgxeUAgx9YFtpPTEx6p51oKcUq2tMnx37Biwc6iSQmirdErkLQM8B2vV"},"checkpointed":{"height":63150,"note":"covered by a 5/5-signed, chain-anchored checkpoint — stronger finality than attestation count; atts freeze at coverage"},"as_of":"2026-10-26T23:03:30.842Z","checkpoint_height":63150,"source":"read-node-v0.2 (derived-only; open epoch refreshes every 45s)"}