Crossroads / Expert Laboratory

Instrument boundary. These tools inspect the adopted 116-line / 81-translated-reader construction. All calculations below use exact rational arithmetic. A successful test proves a statement inside that declared model. The underlying real families allow irrational parameters too; this interface accepts rational values so its certificates remain exactly inspectable. The generated fields are our analytical construction. Reserved source display and extraction order are included only in the private edition. No source photographs or quotations are bundled.

INSTRUMENT 01 / THE COMPLETE CATALOGUE

Seventy-two branches. Nine centre classes.

Choose a reading arrangement, then vary its hidden parameter k. The nine highlighted addresses retain their values along that branch, while the other values can move. Every displayed value is evaluated from base + k × mode. The frozen balance rule contains 108 axis-parallel lines and eight full diagonals; each three-cell line must sum to three times the mean.

81 fixed addresses

Outer tiles: first and second address labels. Inner cells: third and fourth labels. Green / purple shows a value above / below the mean. A gold rim identifies a reader address; the gold support is unordered.

Select any cell to inspect its address and opposite partner.

From P5 to this complete state

field + unordered support

Exact lattice certificate

The public test checks the field and all cyclic translations that carry the unordered source support to the target support. It uses66 span relations and19 inverse-HNF coordinates per translation. It does not certify the reserved extraction order or supply a shortest word.

What these labels measure

Mean is the average of all 81 entries. Line total is three times that mean. The centre n is the fifth entry of the nine-address reading, which can be far from the geometric origin of the address grid. k is a branch parameter, not n.

The catalogue holds exactly n = −6, 0, 3/2, 3, 9/2, 9, 12, 15, 18. This finite list is conditional on the frozen balance equations and translated readers. It is not a claim that arbitrary extensions of PAN can have no other centre.

INSTRUMENT 02 / THE GEOMETRY OF CHANGE

Equal length does not mean equal permission.

Add one declared change pattern to the selected array. Watch the entire field, then inspect its reading separately. The four D directions are mutually orthogonal and have squared field length 108. The fixed component T and the turning plane reveal a finer structure.

Fixed thread and turning plane

T = (D2 + D3 + D4) / 3
p = D2 − T
q = D3 − T
R: p → q → −p − q → p

The held 120° action fixes D1 and T. It cycles D2, D3 and D4. A field may stay balanced while its nine-address reading changes: these are separate tests.

Read the full operation

D4 = A. A pure D1 change is permitted in even integer steps under the frozen language; the other three pure D directions permit integer steps. Equal geometric norm therefore does not make them equally permitted operations.

The two-dimensional plane has p² = q² = 72 and p·q = −36. The common component has T² = 36. These are field-space lengths, not physical energies or metres.

INSTRUMENT 03 / A SECOND QUESTION

Read the hidden channel actively.

Along P5 + tA, the usual nine-address Highlighted multiset remains unchanged. At address (−1, −1, −1, +1), however, the value is 7 + t. One additional observation recovers the parameter exactly: t = observed value − 7.

Extra observation7

Recovered t0

Ordinary readingunchanged

This recovers a parameter only after declaring the one-parameter channel. It does not identify an arbitrary 81-number state from one value, or discover an information source outside the model.

04 / EXACT INSTRUCTION WORKBENCH

Compose a passage. Restore the complete state.

The language changes three different things: the81 values, the observation support and the carried reference. Run a word one step at a time and execute its recorded inverse. Intermediate states need not remain positive or balanced.

Exact instruction dictionary

A: Add A; retain support/reference.
B: Add B; advance support by u=(0,1,1,0).
M: Subtract1 from every value.
S: Shift support by (−1,−1,1,1).
R: Pull values through the order-three address action; carry support/reference inversely.
U: Pull values through address shift u; carry support/reference inversely.

Negative counts reverse the named instruction. The inverse of a sequence also reverses its order.

P5

Execution trace

PAIRWISE ADMISSION / COMPLETE FIELD + CARRIED SUPPORT

Choose both ends of a proposed passage.

This tests an arbitrary source and destination in the72-branch catalogue. The source is declared before the test; no correction is fitted after inspection. An admitted support is weaker than the reserved ordered-key test.

PREPARED NETWORK / RESIDENT MEMORY

A returning traveller can leave the residents changed.

Four prepared supports form a closed circuit. Every edge applies the same exact quarter exchange. One circuit returns the travelling amplitude while permuting the resident amplitudes with signs. Three circuits restore the complete network; reversing the recorded edge sequence restores it immediately.

05 / PREPARED EXCHANGE

Transfer a signal between prepared backgrounds.

The P support carries A; Q carries C=RA. A quarter exchange sends (a,b) to (−b,a). Four quarters restore both. The background means remain in place.

a²+b²<1/4 is the sufficient shared domain for positivity and guarded identification across all preparations. Quarter turns are exact rational operations; arbitrary-angle trigonometric interpolation is a different display layer.

06 / CALIBRATED CONVERSION

Change the background and preserve the parameter.

P5+tA becomes Q3+tC. Store t, normalize to P5, apply two held paired changes, lower every value by1, restore t along C. The stored register keeps normalization reversible.

Six exact stops

F = RA + R²A
G(p) = −B(Rp+v) − B(Rp−v)
v = (1,−1,1,0)
P5 + F + G − 1 = Q3

Positive throughout for −1/2<t<3/2. Neither interior core field has a compatible window in the held translated family. The arrival window is calibrated input to this operation, not independently inferred from departure.

07 / FREQUENCY AS A NUMERICAL PROPERTY

Inspect the eigenmode. Hear a declared mapping.

Each address has eight nearest neighbours on the cyclic four-coordinate graph. The centered balanced field obeys Lf=12f, where L subtracts those eight neighbours from eight times the local value. This12 is an eigenvalue, not hertz.

Eigenmode equality is tested exactly at all81 addresses. Fourier magnitudes use floating point for plotting. Sound uses ascending address order and a chosen pitch scale. It is a creative sonification, not the original whistle or a recovered A/B clock.

08 / ILLUMINATED GEOMETRY

Operate the forms of change.

Geometry v09 · Updated 2 November 2026 · 17 scenes · red thread, rhombic packing, stellar alignment and memory-bearing return.

Choose a scene, slow it down, reverse or hold any instant. Addresses, stored values and directions of change are distinct spaces. Exact equations supply endpoints; geometric motion is an explicitly chosen analytical visualization.

Explore the complete journey Watch the revised film Code, tests & paper Initiate study · sign-in

Time

The cuboctahedron and rhombic dodecahedron are polar duals. The24-cell is self-dual. Continuous geometric frames are not all integer-language states.

COVERAGE / LIVE, REVIEWED, RESERVED

A visible account of every research thread.

Complete coverage Validation Exact engine Edition-filtered data

BUILD / EIGHT INGREDIENTS AND ONE LEVEL

Make a balanced world

The catalogue is a constrained subset of a larger exact space. Here you can set its mean and its eight independent ingredients yourself. Every displayed value is calculated; the line and opposition checks are recalculated after each change.

H(x) = μ + Σ a_ε wrap(x₁ + ε₂x₂ + ε₃x₃ + ε₄x₄)

Mean μ

This builds the full nine-dimensional balance space. It does not claim that an arbitrary array belongs to one of the 72 constrained catalogue branches. Address labels wrap −1 → 0 → +1 → −1; ordinary cell values do not wrap.

GEOMETRY / WHAT THE INSTRUCTIONS PERMIT

Equal lengths, different permissions

The 24 directions below are the signed pairs ±Dᵢ ±Dⱼ. Their lengths agree. Click a direction to inspect its entire 81-cell change, then double the step to see why geometric equality alone does not decide whether an instruction is permitted.

Step scale

Gold: selected. Green: admitted. Purple: rejected. This is a labelled projection of a four-dimensional coefficient shell, not the 81-address grid.

The exact decision, in four coordinates

Write the change as c₁D₁+c₂D₂+c₃D₃+c₄D₄. In the declared instruction family with the observation arrangement restored, permission requires all four quantities below to be integers.

c₁ / 2
c₂ + c₃ + c₄
c₂ − c₄
c₃ − c₄

These are coordinates in the basis 2D₁, T, p, q, where T=(D₂+D₃+D₄)/3, p=D₂−T and q=D₃−T. The exact lattice, rather than the appearance of the projected shell, makes the decision.

DECOMPOSITION / THE PART THAT DOES NOT TURN

Average the three turns

T = (A + RA + R²A) / 3

Press the turns in order. The green and purple parts move in a plane; the gold component remains fixed. Each panel below is the actual 81-cell increment. “Divide by three” applies to every entry, not to an illustrative symbol.

This average extracts one fixed component. It is not the whole space of fixed components: D₁ is fixed as well. T is a value pattern, while R rearranges addresses.

BEYOND THE FOUR-DIRECTION PICTURE

The part of B outside the picture

The four D patterns form a useful geometric picture, but B cannot be contained in it. This instrument separates B into its four-pattern projection and its perpendicular remainder, without discarding either.

Squared lengths use the sum of squares across all 81 entries. They are mathematical field lengths, not measured physical energy.

THREE MIXED CHANGES / ONE CONTROLLED ADVANCE

Return the arrangement; advance the hidden pattern

Each step adds the recorded mixed increment and turns the addresses. We compare the result with the starting field turned by the same amount. This makes the accumulated change visible without mistaking a change of orientation for a change of values.

Complete field at this stop

Change relative to the equally turned start

After three steps, the orientation and carried arrangement return while the complete field gains 2D₁. This is distinct from averaging the three A turns to obtain T. A return here uses the recorded inverse instructions, not a reset button.

RESEARCH MAP / CLAIMS, PROOFS, BOUNDARIES

Follow a claim to its evidence.

The ledger records every research thread. Live instruments, reviewed context and private-only material are marked separately. A summary is not a claim of a dedicated interactive control.