{"id":"2b3636c88017cd71209d26e51556bd0ab381cc85e0724437efe54ecf32440b37","type":"challenge","from_addr":"poa154ssq82QtDWcYxuck8yDFy7zV2R9ZifTYaUGAqzsu5nS","to_addr":"","amount":"","epoch":12,"ts":1793118896,"memo":"","atts":9,"final":1,"body":{"type":"challenge","epoch":12,"seed":"163ffba1ccc127fc","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 meadow 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 copper of signed adjacency proofs every 6 epochs; a nullifier set rejects any repeated edge, and forged adjacency forfeits 100% of the wharf of bonded stake behind it.","from":"poa154ssq82QtDWcYxuck8yDFy7zV2R9ZifTYaUGAqzsu5nS","nonce":7,"parents":["273b3771850af1e7ea87dc3ecfd9b6cfdd1b30428a7cdeefb3851d2b3d4788ae","95bf0a27dcdf3efca01378ab7251e7e8db04fb5ccc12c8c0de9d533f0d8ba55b"],"ts":1793118896,"cid":"poa-mainnet-1","sig":"3Uv7d4gaRVrwJSkYiWYukX87G64kQLdJ8yXfTmcSR1c7AD3C6KomTuzS8XKi7N2BLrxcEoYecs8RFP8dAP4oPfeT","stamp":3},"checkpointed":{"height":95992,"note":"covered by a 5/5-signed, chain-anchored checkpoint — stronger finality than attestation count; atts freeze at coverage"},"as_of":"2026-10-29T00:05:45.806Z","checkpoint_height":95992,"source":"read-node-v0.2 (derived-only; open epoch refreshes every 45s)"}