Ct Mutation Nullmask Beaufort

In plain English: Ct Mutation Nullmask Beaufort — using a method that replaces each letter using a repeating keyword with reversed arithmetic (Beaufort cipher). Best match: 16/24 known letters — slightly above random, almost certainly coincidence. This approach is ruled out 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: N/A
Best Score: 16 / 24 known letters matched · above random, likely coincidence (random guess would score: 0.0)
Keystream Consistency (Bean): FAIL
Checks whether the key values at different positions are mathematically consistent with each other.
Confidence: Not classified.
Date Tested: 2026-04-04
Script: scripts/campaigns/e_ct_mutation_nullmask_beaufort.py

Reproduce

PYTHONPATH=src python3 -u scripts/campaigns/e_ct_mutation_nullmask_beaufort.py

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

Found an error? Report on GitHub