721.7B+ configurations evaluated across recorded experiments

Ct Mutation Nullmask Beaufort

In plain English: Tested a method that replaces each letter using a repeating keyword with reversed arithmetic (Beaufort cipher). Best match: 16/24 known letters, a level that searches like this can reach without the right key. This record is negative within the tested scope.
NOISE
How to read this record
Configs Tested
N/A
Best Score
16 / 24 known letters matched · can occur by chance in searches like this
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. Some recent scripts may not be in the public repository yet.


Found an error? Report on GitHub