schur

← All demos paper (PDF) · exact certificates

Entrywise noise — enumerate every sign state

Exchangeability is broken entirely: each correlation moves by ±τ and each variance by a factor (1 ± τ), independently. The browser enumerates all 2⁶ = 64 (off-diagonals) or 2¹⁰ = 1024 (all ten entries) sign states through the recursion and averages them, which is the same computation the exact certificates do in rational arithmetic. HRP's anchor is gone (F(0) rises with τ), and the minimizer stays interior.

0.100
What to look for: F(0) is no longer flat in τ (compare Lemma 1: the diagonal channels charge HRP too), yet the minimum stays strictly inside. Push τ toward 0.15 with all ten entries: the γ = 1 end blows up by orders of magnitude as branches go near-singular, exactly as in the paper.

The widget runs the recursion of the paper's equation (4) with the naive fitness (5), ported directly from the reference implementations, live in your browser. Nothing is pre-baked.