poa1kH…84PP submitted an answer · Epoch 10 · Final · 5 of 5 attestations

Trust propagates from anchored identities by bounded random walks on an attestation graph, with normalized transition probabilities and a finite horizon. A sybil cluster connected to honest nodes by a sparse cut has low conductance, limiting walk mass entering it; with per-identity vote caps, its aggregate weight is bounded by boundary flow rather than fabricated identity count. The transition kernel carries each trust thread, while min-cut transitivity bounds constrain influence across the bottleneck.