Verify It Yourself

How to verify: step by step

This tutorial walks you through an independent verification of the proposed K4 solution. No specialized tools are needed — a pencil and the alphabet are sufficient.

Step 1 — Get the ciphertext

The K4 ciphertext is 97 characters, as inscribed on the sculpture:

OBKRUOXOGHULBSOLIFBBWFLRVQQPRNGKSSOTWTQSJQSSEKZZWATJKLUDIAWINFBNYPVTTMZFPKWGDKZXTJCDIGKUHUAUEKCAR

Step 2 — Get the proposed plaintext

The proposed K4 plaintext (97 characters):

THECOMPASSROSEISHEREXEASTNORTHEASTTHISISYOURPOSITIONXCOMMISSIONBERLINCLOCKWHICHISNORTHEASTOFHEREX

Step 3 — Assign letter values

Use the standard alphabet: A=0, B=1, C=2, D=3, E=4, F=5, G=6, H=7, I=8, J=9, K=10, L=11, M=12, N=13, O=14, P=15, Q=16, R=17, S=18, T=19, U=20, V=21, W=22, X=23, Y=24, Z=25.

Step 4 — Compute (C − P) mod 26 for each position

For each of the 97 positions, subtract the plaintext letter value from the ciphertext letter value. If the result is negative, add 26. The result is R, the shift at that position.

Worked example — Position 1: C = O (14), P = T (19). R = (14 − 19) mod 26 = (−5) mod 26 = 21. ✓

Position 22: C = F (5), P = E (4). R = (5 − 4) mod 26 = 1. ✓

Step 5 — Compare to the published R-grid

The R-grid table below lists the verified R value at every position. Your computed values should match at all 97 positions. If they do, the plaintext is arithmetically valid.

Step 6 — Spot-check the anchors

Verify specifically that positions 22–25 produce EAST, 26–34 produce NORTHEAST, 64–69 produce BERLIN, and 70–74 produce CLOCK. These are artist-confirmed and must be preserved exactly.

Step 7 (optional) — Use the downloadable tools

The verification bundle includes a Python script (verify.py), CSV and JSON reconciliation tables, and an Excel workbook (k4_verify.xlsx) with formulas already set up. These automate the full 97-position check.

Quick check: verify any position in 30 seconds

Pick any position from 1 to 97. Look up the ciphertext letter (C) and the proposed plaintext letter (P) in the table below. Compute (C − P) mod 26. Compare the result to the R value in the table. It will match.

For example, position 22: C = F (5), P = E (4). Shift: (5 − 4) mod 26 = 1. The table shows R = 1. ✓ This is the start of the confirmed anchor EAST.

Try position 64: C = N (13), P = B (1). Shift: (13 − 1) mod 26 = 12. The table shows R = 12. ✓ This is the start of the confirmed anchor BERLIN.

Every one of the 97 positions resolves the same way. No position requires a special case, an exception, or a secondary key. The formula is uniform.

Position lookup tool

Enter any position (1–97) to see its full data: ciphertext letter, plaintext letter, grid coordinates, binary gate value, shift values, and the arithmetic verification.

Confirmed anchors (hard constraints)

Any proposed K4 solution must preserve these artist-confirmed plaintext segments at their exact documented positions. A proposal that moves them is not testing the same K4.

How a skeptic tests this

Five independent checks, any of which would falsify the proposal if it fails:

1. Anchor lock

Verify that EAST appears at positions 22–25, NORTHEAST at 26–34, BERLIN at 64–69, and CLOCK at 70–74 in the proposed plaintext. If any anchor is misplaced, the proposal fails immediately.

2. Uniform arithmetic

Compute R[i] = (C[i] − P[i]) mod 26 at all 97 positions. Every result must match the published R value. No position should require special handling, exceptions, or manual overrides.

3. Grid coordinate consistency

Verify that lane = ((i − 2) mod 14) + 1 and tier = ⌈i ÷ 14⌉ hold at all 97 positions. Verify that the binary gate for each cell matches the published gate map, and that gate = 1 where the packet-phase derivation yields 1.

4. Decomposition agreement

Verify that R = r + gate at every position. Both the direct R lookup and the r + gate decomposition must produce identical results. Any discrepancy invalidates the mechanism.

5. Falsification test

If Sanborn or any verified source confirms a plaintext letter inconsistent with this proposal at its documented position, or if original coding records show R values contradicting this table, the proposal is falsified. This is stated in advance and by design.

Step-by-step verification walkthrough

This walkthrough demonstrates the full verification process for several positions — including both gate = 1 and gate = 0. Follow these steps with any position to independently confirm the solution.

Step 1: Get the letters

For position 22 (the first letter of the confirmed EAST anchor): ciphertext letter C = F, plaintext letter P = E.

Step 2: Convert to numbers

Using A=0, B=1, … Z=25: F = 5, E = 4.

Step 3: Compute the shift

R = (C − P) mod 26 = (5 − 4) mod 26 = 1.

Step 4: Check the decomposition

Position 22: gate = 1. The r-grid value is r = 0. r + gate = 0 + 1 = 1 = R. Verified.

Step 5: Confirm the grid coordinates

tier = ⌈ 22 ÷ 14 ⌉ = 2. lane = ((22 − 2) mod 14) + 1 = 7. Position 22 is Tier 2, Lane 7.

More examples

Position 1 (gate = 0): a boundary position. Position 74 (K→K): a self-mapping position where ciphertext equals plaintext. Position 97: the last filled cell in the 7×14 grid. All follow the same formula with no exceptions.

The R-grid (verified shift values)

The complete 7×14 grid of R values. Each value is verified: R = (C − P) mod 26 at the corresponding position.

The dot (·) marks the blank cell at Tier 7, Lane 13.

The r-grid (base shift values)

Derived from the R-grid: r = R − gate. Where gate = 1, r is one less than R. Where gate = 0, r equals R.

Each r value is produced by the formula r = (f(C) + g(T)) mod 26, where f and g are derived from on-site clues. See the Field Guide for the complete derivation.

Binary gate map

Each cell carries a binary gate value: 1 or 0, fully derivable from position — see The binary gate.

69 cells have gate = 1. 28 have gate = 0.

Reconciliation table (all 97 positions)

The complete position-by-position data. Every row is independently checkable: verify that R = (C − P) mod 26 and that R = r + gate.

T = Tier, L = Lane, C# = ciphertext letter value (A=0), P# = plaintext letter value, Gate = binary gate (0 or 1), R = verified shift. All 97 rows pass: R = (C# − P#) mod 26 and R = r + gate.

Download verification data

All verification data is published for independent analysis. The canonical bundle includes everything needed to reproduce and verify the solution from scratch.

Bundle contents (v7):

k4_ciphertext.txt — The 97 ciphertext characters
k4_proposed_plaintext.txt — The 97 proposed plaintext characters
k4_confirmed_anchors.txt — The four artist-confirmed anchors with positions
k4_reconciliation.csv — All 97 rows: i, tier, lane, C, P, gate, r, R
k4_reconciliation_table.json — Same data as JSON (for programmatic use)
k4_reconciliation_table.tsv — Same data as TSV (tab-separated)
R_grid_7x14.txt — The verified R-grid (final shift values) in 7×14 layout
r_grid_7x14.txt — The base r-grid in 7×14 layout
Shift Table.txt — The canonical R-grid with lane_phys indexing notation
gate_map.txt — Binary gate values (0/1 per cell)
verify.py — Python 3 verification script (no dependencies)
verify.xlsx — Excel workbook with formulas for verification (3 sheets)
k1_plaintext.txt, k2_plaintext.txt, k3_plaintext.txt — K1–K3 plaintexts
entrance_slab_morse.txt — Morse code transcriptions from the entrance slabs
README.txt — File manifest, indexing conventions, and verification instructions

Programmers: the CSV and TSV files import directly into Python (pandas), R, Excel, or any spreadsheet application. The JSON file is a 97-element array of objects with all fields. All files are UTF-8 encoded, no BOM. The Python script runs all four checks across all 97 positions with no external dependencies.

What would falsify this

A closed mechanism claim should be able to state clearly what would prove it wrong:

Confirmation of any plaintext letter inconsistent with the proposed string at its verified position. Release of original coding records showing R values that contradict the published table. Demonstration that lane = ((i − 2) mod 14) + 1 fails at any position. Or identification of a position where R ≠ (C − P) mod 26.

The mechanism claims are uniform across all 97 positions and do not depend on interpretive choices about the plaintext. They can be verified or falsified directly from the reconciliation table.

Continue