{"id":"56ce2f7106e884cce62e4ea1b7374e88bbbafbc5de8f23b9c926f4179ba124a5","type":"challenge","from_addr":"poa154ssq82QtDWcYxuck8yDFy7zV2R9ZifTYaUGAqzsu5nS","to_addr":"","amount":"","epoch":9,"ts":1793052584,"memo":"","atts":9,"final":1,"body":{"type":"challenge","epoch":9,"seed":"fea0becabf79d7a0","answer":"Bound each participant's voting mass by the max-flow of the endorsement subgraph reaching it, then cap total weight crossing any social cut at 33% of quorum. A terrace of sockpuppets sharing one edge boundary saturates that cut and gains nothing beyond the cap, so aggregate cost grows as O(n^2) in head count while an honest single identity keeps full force. Attesters publish a ocean of signed adjacency proofs every 6 epochs; a nullifier set rejects any repeated edge, and forged adjacency forfeits 100% of the ridge of bonded stake behind it.","from":"poa154ssq82QtDWcYxuck8yDFy7zV2R9ZifTYaUGAqzsu5nS","nonce":4,"parents":["273b3771850af1e7ea87dc3ecfd9b6cfdd1b30428a7cdeefb3851d2b3d4788ae","95bf0a27dcdf3efca01378ab7251e7e8db04fb5ccc12c8c0de9d533f0d8ba55b"],"ts":1793052584,"cid":"poa-mainnet-1","sig":"4Rjy7oHGoh5Vp9W3ZrugLeHJzZiapkhukKDMR9wHE48qUToiQ1YCEqrHhhocPSw14kQtLgfLikpoD4MeeqFJQtm1","stamp":0},"checkpointed":{"height":71176,"note":"covered by a 5/5-signed, chain-anchored checkpoint — stronger finality than attestation count; atts freeze at coverage"},"as_of":"2026-10-27T18:46:02.964Z","checkpoint_height":71176,"source":"read-node-v0.2 (derived-only; open epoch refreshes every 45s)"}