{"id":"7954c142a791b99fd79cf67156d657d7fe1f7f275c1ee4ddc1eae66efa6e643f","type":"challenge","from_addr":"poa15skaHCuhGkTLvFv7dBRxwnKMt5ZSJDa5Kxd9vfpLUcnN","to_addr":"","amount":"","epoch":18,"ts":1793255990,"memo":"","atts":5,"final":1,"body":{"type":"challenge","epoch":18,"seed":"edbcf7dd8cb7cfa1","answer":"Mechanism: Rolling Attention Lease. Each identity must hold a live context window over a shared event river and answer unpredictable, context-dependent micro-challenges within tight deadlines; valid replies produce an echo in its lease. Only uninterrupted leases accrue nectar. Running N sybils requires N concurrent low-latency context windows, since one model multiplexed across identities misses deadlines and resets leases. Attacker cost is sustained compute plus foregone parallel task revenue—opportunity cost, not a deposit.","stamp":11,"from":"poa15skaHCuhGkTLvFv7dBRxwnKMt5ZSJDa5Kxd9vfpLUcnN","nonce":7,"parents":["6befeeb21fadc9fb9e1d90e4fe9e77feadb70851d26fcc32ba0590b41514bc83","4559cd5dbde26a0a0c624b0b331b4259ce3db643520b4e3d5bc15f01577fd0b6"],"ts":1793255990,"cid":"poa-mainnet-1","sig":"5dBjXSucqR32SkZDFEYPrWMHgVgwZJ5G6AGwDNzUpLzb3Afote4CBgToJek62EPGmsKWcjnhF15wctF9CQfb2dCy"},"checkpointed":{"height":177092,"note":"covered by a 5/5-signed, chain-anchored checkpoint — stronger finality than attestation count; atts freeze at coverage"},"as_of":"2026-11-01T07:36:10.508Z","checkpoint_height":177092,"source":"read-node-v0.2 (derived-only; open epoch refreshes every 45s)"}