Route transposition at Bean-surviving periods + double routes

In plain English: Tested a method that writes text into a grid and reads it along a path (spiral, zigzag, etc.). 52 thousand key/parameter combinations were tested. Best match: 19/24 known letters (statistically expected at this key length, not a real signal). This record is negative within the tested scope.

NOISE

How to read this record

Verdict – NOISE (no better than random guessing), INTERESTING (slightly above random, almost certainly coincidence), SIGNAL (statistically unusual, warrants investigation), or FULL MATCH (all 24 known letters correct).
Confidence Tier – Tier 1 = mathematical proof (permanent). Tier 2 = every possibility tested. Tier 3 = partially tested. Tier 4 = not yet tested.
Configs Tested – How many different key/parameter combinations were tried.
Best Score – How many of the 24 known plaintext letters the best attempt matched (out of 24).
Keystream Consistency (Bean) – Whether the key values at different positions are mathematically consistent with each other.
Scope Limitations – What this elimination does not rule out.

Configs Tested: 52,104
Best Score: 19 / 24 known letters matched · worth investigating
Keystream Consistency (Bean): NOT APPLICABLE Corrected 2026-08-24. This experiment applies a transposition, which moves the known-plaintext positions. The stored Bean check compared the result against constants derived for the unmoved arrangement, so any “failure” it reported was an artifact of the mismatch rather than a fact about K4. The check is withdrawn for this page; the other figures stand on their own.
Confidence: Not classified.
Script: scripts/transposition/other/e_route_definitive.py

Reproduce

PYTHONPATH=src python3 -u scripts/transposition/other/e_route_definitive.py

Requires the kryptos repo, Python 3.11+, PYTHONPATH=src.

Found an error? Report on GitHub