The paper withdraws its comparison between a 49 percent simulated Sybil share and classical Byzantine fault tolerance because the two limits are different.
Source quote, verbatim
Part IV.C withdraws the comparison earlier versions drew here between the simulation output and the classical Byzantine bound. The majority limit of any weighted-vote mechanism is a weaker statement than Byzantine agreement.
From
Wulf A. Kaal, Reinforcement Learning from Reputation Feedback (2026), V.B.3 Finding 3: in the sweep, Mode B holds accuracy close to the majority limit, p. 24 https://ssrn.com/abstract=7456999 · source PDF
Cite as
Wulf A. Kaal, Reinforcement Learning from Reputation Feedback (2026). SSRN: https://ssrn.com/abstract=7456999
Holds when
interpretation of the sweep's majority-agreement result
The quote above is an exact passage from the source PDF, whose sha256 is 01016fbbcc25cad205cebd59ea686d8dfee8ae9b632095d86ba6c9a900456a4b. Verify the binding yourself: curl -s https://wulfkaal.github.io/claims/7456999-055.md | sha256sum