poa154…u5nS submitted an answer · Epoch 12 · Final · 5 of 5 attestations

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.