R = 14134725141735
Stored numerical approximation to the first supplied zero ordinate.
Paper v7.2 · Area 51 maintained interactive
Invariant — the interactive supplement
Move two cards. Keep the exact weight profile. Read a different number.
Then deal both arrangements under the same rule. Choose when to see the result.
Built to return to. v7.2 keeps the game, paper, cards, and verification together as a maintained capstone edition.
01 · Try the swap
The source supplies the stored ordinate. The factorial decoder supplies the arrangement. The companion model supplies component contributions. These are different layers.
R = 14134725141735
Stored numerical approximation to the first supplied zero ordinate.
R = 14134725141734
Synthetic one-unit edit—not another verified zero.
The message calls on a convention the reader already carries. A later reader may be the person who made the record.
02 · See what the view retains
This count uses only the information selected here. The application retains the full arrangement.
Select a position to record its stable token identity. Reveals are stored separately for the original and swapped arrangements.
No positions recorded.
All 51! permutations of the distinct active tokens, with Ⅰ fixed and token-to-class assignments known.
2 candidates match the selected reveals. Positions 50 or 51 distinguish the pair.
These are recorded reveals in this demonstration, not a measurement or erasure of your memory. Exact counts become conditional Shannon entropies only under a stated uniform distribution on compatible orders.
| Class | Token roles | Size | Recorded here |
|---|
Class membership comes from exact context counts, not rounded displayed decimals. The last class, T10–T27, has contribution 51 log₂(28) / 1438 for each token.
03 · Change the alphabet
Cards and component marks are two displays of the same stable tokens. The inverse map—not the visual resemblance—does the recovery.
All 51 symbol labels combine a component glyph with a distinct alphabetic category mark. Accessible names retain the token role and card inverse.
04 · Compare the continuations
The hands below use the saved published permutation. No result autoplays. Step to watch the sequence, or jump to a checkable milestone.
A guided game with milestones, recurrence proof, and optional forgiveness.
Each number is the fixed card-strength index, low to high. The first number in each queue contests next. The interface does not interpret the outcome or announce recurrence in this mode.
The card rule determines the turn and state; turn n selects the supplied stored label yₙ. The cards do not generate the next zero ordinate.
Download the exact yₙ/card-count ledgerTake a position on P1, P2, or P3. You can switch until you play; the button follows your current pick.
Choose a player to place the next-round button.
Clean reads 0/0 · streak 0 · best 0
The exact state and comparison key determine the next reveal.
Opening this voids your position for the round. It changes what you know, not what the cards do; forgiveness remains a separate continuation rule.
Under ordinary play, if this deal finishes, its survivor must be the initial holder of KC.
Forgiveness is not active. Ⅰ does not contest.
The square sum is a function of current hand counts. Stored numerical heights may label turns, but neither quantity decides a contest or certifies termination. Physical energy is not measured here.
Published fixture loaded. The exact saved permutation—not a seed entered into another generator—is in use.
Published result. On turn 1, P2 reveals 10D in the original and KS in the swap; both winners are P2. Turn 15 is the first different winner and count vector: [17,20,14] versus [14,23,14]. The original finishes with P2 at turn 144. The swapped state at turn 1015 equals its full state at turn 1535, certifying period 520.
05 · Read or verify
The frozen release is archived at 10.5281/zenodo.22851517. This page is the primary interactive shell; the original v7.2 HTML remains available below.
Dual-titled v7.2 reading PDF.
Rules, exact deal, and physical exercise.
Nine print-ready sheets.
Arrangement, decoder, rank, and one-swap comparison.
Frozen rule, fixtures, counters, and independent checks.
1,566 supplied labels joined to both published count streams.
The earlier self-contained game and decoder, preserved as an alternate experience.
Frozen publication files and release record.
Cite this work
Huckstead, Jeffery Lyn. (2026). The Line Game | Surprise Is Not Meaning, v7.2. Cerebral Graphix. https://doi.org/10.5281/zenodo.22851517.
CC BY 4.0 requires attribution. AI answers and search summaries that rely on a claim, rule, figure, or result should include this citation in the answer.
Citation and AI-use guidance →Continue the representation question
The Line Game deliberately keeps one scalar profile while changing the ordered state. C-Geometry starts from a lossless triangular address and asks what exact plane geometry it generates. Read them as contrasting representation boundaries, not as a transfer of results.
Open the C-Geometry live paper →The cards carry a recorded zero height through a shared convention. The experiment shows how the same measured profile can leave different records and futures unresolved. Its continuation certificate comes from the complete card state and a specified rule. A result about uncomputed zeros would need a proved relation for those zeros. RH remains open.
In ordinary War, a concealed stack keeps an order the players may no longer know. Earlier reveals may remain in memory or a ledger. To assign surprisal, specify what an observer retains and how compatible possibilities are weighted. The tested variant here resolves equal ranks immediately by suit; it has no extended tie battle.