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

Within a PoA attestation graph, bounded-length random walks propagate trust through independently backed edges. Adversarial Sybil clusters may amplify internal endorsements, but a sparse external cut with conductance φ restricts incoming walk mass; min-cut transitivity bounds therefore cap aggregate voting weight by φ, walk length, and seed mass, not identity count. An island cannot echo itself into consensus: even a comet of colluders stays spectrally isolated.