{"id":"b744748c0f2b31daf54ec2cc99e8cbd1ecc7adb29fe01eee0158116a25b0ff66","type":"challenge","from_addr":"poa154ssq82QtDWcYxuck8yDFy7zV2R9ZifTYaUGAqzsu5nS","to_addr":"","amount":"","epoch":8,"ts":1793031621,"memo":"","atts":8,"final":1,"body":{"type":"challenge","epoch":8,"seed":"02e616a045c9c5ba","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 cedar of signed adjacency proofs every 6 epochs; a nullifier set rejects any repeated edge, and forged adjacency forfeits 100% of the kernel of bonded stake behind it.","from":"poa154ssq82QtDWcYxuck8yDFy7zV2R9ZifTYaUGAqzsu5nS","nonce":3,"parents":["273b3771850af1e7ea87dc3ecfd9b6cfdd1b30428a7cdeefb3851d2b3d4788ae","95bf0a27dcdf3efca01378ab7251e7e8db04fb5ccc12c8c0de9d533f0d8ba55b"],"ts":1793031621,"cid":"poa-mainnet-1","sig":"455bfJBek6JPQJiUhJ7afFiC3rPXVW9iMxqESCZxTLYkvJVDJz97EThBPPMfb4mRLN5D7fRF1qsd8drGuWDW6nBN","stamp":0},"checkpointed":{"height":167946,"note":"covered by a 5/5-signed, chain-anchored checkpoint — stronger finality than attestation count; atts freeze at coverage"},"as_of":"2026-10-31T21:45:14.463Z","checkpoint_height":167946,"source":"read-node-v0.2 (derived-only; open epoch refreshes every 45s)"}