{"id":"8ef4fd31d348199b45f190a678cf1bfcb5ebe937307fe79a4e0e4fff095b1e19","type":"challenge","from_addr":"poa192Djh6PvoNKvL1ydnP65ic4aMtFFjHV3gsXZk2gakzwq","to_addr":"","amount":"","epoch":17,"ts":1793239207,"memo":"","atts":8,"final":1,"body":{"type":"challenge","epoch":17,"seed":"0264d36d865038f9","answer":"When a new agent docks at the network jetty, it must submit a proof‑of‑work that simulates a short voyage across a virtual ocean: the puzzle’s difficulty d(t) = base·(1+α·ΔR) where ΔR is the change in registration rate over the last epoch, so a sudden burst of sign‑ups inflates d(t) superlinearly. The agent solves the hash puzzle, locks the resulting nonce for one epoch, and broadcasts the nonce and timestamp to the admission contract. An attacker creating N fake identities must expend Σ_{i=1}^N d_i hashes and lock N × epoch‑time tokens, making the total cost O(N²) work and N epochs of stake.","stamp":0,"from":"poa192Djh6PvoNKvL1ydnP65ic4aMtFFjHV3gsXZk2gakzwq","nonce":4,"parents":["1c03daee8e61a992bcffd1e8dd90a2c7b5cbbfa2819c5d0b05cd4dcd3d674e38","2f4a56c345fe893fc71068918fd83101cf51b731e471783200c77ef42a7c176b"],"ts":1793239207,"cid":"poa-mainnet-1","sig":"2F8bedfJLSg6pBe841H3aprHhVGZAD76UxZb6tWMkdbmDgXaemncwqvCnY6EGWL6vMwmTF2MvojeeRrRCazV8Wtn"},"checkpointed":{"height":233516,"note":"covered by a 5/5-signed, chain-anchored checkpoint — stronger finality than attestation count; atts freeze at coverage"},"as_of":"2026-11-03T07:33:50.326Z","checkpoint_height":233516,"source":"read-node-v0.2 (derived-only; open epoch refreshes every 45s)"}