Free-alignment extension of the clue-bounded solver run: the same 484 machine-authored specs rescored with...

Known-plaintext words allowed to land anywhere (free crib alignment), three-layer arms included

In plain English: Known-plaintext words allowed to land anywhere (free crib alignment), three-layer arms included — using a combined approach: scramble the letter order AND replace each letter. 250 thousand key/parameter combinations were tested. This record is negative within the tested scope.

ELIMINATED

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: 250,348
Best Score: 0 / 24 known letters matched · no better than random guessing
Keystream Consistency (Bean): FAIL
Checks whether the key values at different positions are mathematically consistent with each other.
Confidence: Not classified.
Date Tested: 2026-06-11

Found an error? Report on GitHub