kaal:claim:7598518-025

Claim. A candidate is accepted when its weighted valid share exceeds the threshold of one half, and a candidate within a tenth of that threshold is contested, receives four more validators, and is bound by the recomputed share.

Type. design · Support. stated

Holds when

• Five validators are seated per candidate from a roster of twenty, and each votes independently.
• The rule replaces the parent protocol's two rounds with a single assessment and a threshold-triggered second look.

Source quote

A candidate c is accepted when its weighted valid share s(c) = ∑ wivi(c) i exceeds θ = 0. 5, where vi(c) ∈ {0, 1} is validator i's vote. A candidate with |s(c) − θ| ≤ 0. 1 is contested and receives four more validators, and the recomputed share binds.

From. Wulf A. Kaal, Can Reputation Prevent Model Collapse? A Preregistered Test of Reputation-Weighted Data Filtering (2026). Full text.

Cite as. Wulf A. Kaal, Can Reputation Prevent Model Collapse? A Preregistered Test of Reputation-Weighted Data Filtering (2026). SSRN: https://ssrn.com/abstract=7598518

Verify. sha256 of source PDF cd22d148b2b55c2e27f087dcaa61cdf44ad7022b400b355c31a9cd7e43a31749 at https://wulfkaal.com/papers/7598518.pdf

Content hash. 67313b38bdbd1b2c773d506b3b42ae440cdf8ca8b37cb7aa28d84541a462f2de