CoolFace
Datasetpublic

Type-1-Civilisation/Liber-Primus-Not-Decoded

Algorithm / cipher family tested Result Caesar cipher modulo 29 — all 29 shifts ❌ Atbash modulo 29 — x → 28-x ❌ Affine substitution modulo 29 — all invertible multipliers and offsets ❌ Vigenère-like periodicity analysis modulo 29 — periods up to 100 ❌ Vigenère modulo 29 — periods 1–16, coordinate-ascent search ❌ Beaufort modulo 29 — periods 1–16, coordinate-ascent search ❌ Variant Beaufort modulo 29 — periods 1–16, coordinate-ascent search ❌ Gronsfeld cipher — periods… See the full description on the dataset page: https://huggingface.co/datasets/Type-1-Civilisation/Liber-Primus-Not-Decoded.

sourceHugging Faceapache-2.0updated 3mo agoView on Hugging Face
2likes26downloads
Dataset Card
Algorithm / cipher family testedResult
Caesar cipher modulo 29 — all 29 shifts❌
Atbash modulo 29 — x → 28-x❌
Affine substitution modulo 29 — all invertible multipliers and offsets❌
Vigenère-like periodicity analysis modulo 29 — periods up to 100❌
Vigenère modulo 29 — periods 1–16, coordinate-ascent search❌
Beaufort modulo 29 — periods 1–16, coordinate-ascent search❌
Variant Beaufort modulo 29 — periods 1–16, coordinate-ascent search❌
Gronsfeld cipher — periods 1–16❌
First-order affine recurrence modulo 29❌
Second-order linear recurrence modulo 29❌
Arithmetic keystream — K[i] = a·i + b mod 29❌
Quadratic keystream — K[i] = a·i² + b·i + c mod 29, 20,000 candidates❌
Linear congruential generator keystream modulo 29 — 48,000+ candidates❌
Fibonacci running key modulo 29❌
Prime-number running key modulo 29❌
Euler-totient running key modulo 29❌
Square-number running key modulo 29❌
Triangular-number running key modulo 29❌
Linear-position running key modulo 29❌
Quadratic-position running key modulo 29❌
Mathematical running keys reset at each word❌
Running keys derived from already solved Liber Primus pages❌
Ciphertext autokey modulo 29 — periods 1–16❌
Ciphertext autokey modulo 29 — seed lengths 1–6❌
Plaintext autokey modulo 29 — periods up to 16, beam size 500❌
Plaintext autokey modulo 29 — seed lengths 1–6, beam size 100❌
Recursive linear autokey modulo 29 — 1,000 completed candidates❌
Full-text reversal❌
Per-word reversal❌
Word-order reversal❌
Rail Fence transposition — tested rail counts❌
Columnar transposition — widths up to 20, natural and reversed column order❌
Fixed-size block reversal❌
Canonical small-block permutations❌
Constant XOR masks — masks 0–31 followed by modulo 29❌
Page-dependent modular shifts — K = page·a + seed mod 29❌
Playfair-like fractionation on a shifted 6×5 grid❌
Bifid-like fractionation on a shifted 6×5 grid — periods up to 20❌