RoutesPricing
The four discrete-modulation finite-size pieces, and the two feasible sets kept apart
6/6 passed in 7647ms
| Test | What it does | Result |
|---|---|---|
test_accept_bounded | Theorem 4's acceptance half-width falls with rounds, rises as the failure probability tightens, and halves for an operator declared positive semidefinite, range [0, x] not [-x, x]. | ✅ pass |
test_energy_logged | The energy test returns the base-two LOGARITHM of its failure probability, unrepresentable as a double at a 1e10 block, with Theorem 3's r at or above 1 and a positive divergence, and refuses a tolerance at or above the test rounds. | ✅ pass |
test_price_charged | The dimension-reduction charge over a four-symbol key map is 0.101 bit per pulse at weight 1e-4 and 1.34e-2 at 1e-6, falling with the weight. | ✅ pass |
test_relaxed_apart | An EntropyBound has no key, rate or key_rate, and keylength refuses a minimum over the CONTAINED equality set, which would overstate the length. | ✅ pass |
test_relaxed_route | The finite-key length runs in the engine's order -- three-term weight, clipped norms, two acceptance half-widths, certified minimum over the RELAXED set -- and is positive, charged at price(), and under | ✅ pass |
test_weight_inverts | Kanitschar Eq. (5)'s two directions invert one another at fixed test rounds, on one shared r. | ✅ pass |