The trapdoor and the friction calibrator are the same Z6 projection — one locks information in, the other recovers it. Phone sensors + audio + spectral friction + forecast + programmable lattice.
The Z6 projection groups adjacent sensor readings into 6 buckets [-3,-2,-1,1,2,3] (no 0 state). A 6→N network compresses 6 samples into N outputs. The visible fraction is N/6. Compensator = 6/N.
Dither (hand tremor + injected noise) reveals the sub-bucket position. The compensator recovers the true value within ADC quantization error.
A 440 Hz tone is projected through each regime. The friction reduces amplitude (1/6, 3/6, 6/6). The compensator restores it. Toggle each regime to hear the difference.
Raw = tone at reduced amplitude (friction applied). Compensated = tone restored to full amplitude (×6, ×2, or ×1).
The terminalColor regime hides 5/6 of the signal — barely audible. The ×6 compensator recovers it perfectly. This is NOT amplification — it's inverting a known geometric projection.
Toggle between raw and compensated on each regime to hear the difference. With dither ON in the Live tab, the compensation tracks the raw signal more closely.
The visible fraction is determined empirically by counting distinct projection values with dither. This estimates the friction WITHOUT knowing the ground truth. Switch to the Live tab and move your phone to collect data.
Green bars = empirical visible fraction. Brackets = expected theoretical range for each regime.
Algorithm: With dither on, the input signal varies continuously. The Z6 projection maps this variation to 6 discrete levels. A regime with low friction (6→6) passes all the variation through → all 6 levels appear. A regime with high friction (6→1) averages the variation to 1 output → only 1-2 levels appear.
Formula: visible_fraction ≈ K / 6 where K = distinct projection values observed over N dither samples. The ratio K/6 directly estimates the information that survives the projection.
This works because the projection is linear in expectation for small signals with dither. The number of Z6 levels crossed per unit input variation is proportional to the projection's rank — which equals the output dimension.
Sweeps a sine wave through the 6-sample sliding window. Low frequencies → all 6 samples agree → projection saturates to N/6 output resolution → high friction. High frequencies → 6 samples span many cycles → output varies → low friction. The transfer curve reveals the trap escape rate.
Each Z6 projection is a lattice — the input space ℝ⁶ is partitioned into 6N basins (traps), one per output point in Z6N. The "depth" of each trap is the input volume that maps to that output. Shallow traps (BM: 6⁶ tiny basins) are easy to escape; deep traps (TC: 6 large basins) hold the signal constant.
Frequency response reveals the trap escape rate: at frequency f, the 6-sample buffer spans a fraction of a cycle. If that fraction < trap width, the signal stays trapped (high friction). If > trap width, it escapes (low friction). The cutoff frequency is where the buffer span matches the trap width — the regime's resonant escape frequency.
Friction kernel = the curve |Y(f)|/|X(f)|. A steep kernel (TC) means the regime resists information flow at all but the highest frequencies. A flat kernel (BM) means the regime passes all frequencies equally. The kernel shape is determined by the weight matrix's singular values in Z6.
The trapdoor writes, the calibrator reads. Both use the same Z6 projection:
Three regimes from three architectures:
The compensation is exact for the deterministic component. With dither averaging, it approaches the true value within ADC quantization error.
Bit-exact on any hardware — same as Z6 engine. Integer multiply-add only.
Projects the sensor sliding window through the lattice, then builds a Markov chain on Z6N. The transition matrix P(yt+1 | yt) predicts the next projected value. Predictability score = 1 − normalized transition entropy. 0 = random, 1 = perfectly deterministic.
State definition: Each projected value y ∈ Z6N is a state. The sequence y0, y1, ... is a walk on the lattice. Transitions from state a to state b are counted in the transition matrix T[a→b].
Prediction: Given current state yt, predict yt+1 = argmaxz T[yt → z]. This is the MAP (maximum a posteriori) estimate from observed transitions.
Predictability score: S = 1 − H(p) / log2(K) where H(p) is the entropy of the transition distribution and K is the number of reachable states. S=1 means every transition is deterministic (max predictability). S=0 means transitions are uniform random.
Regime change: When predictability suddenly drops, the input dynamics have changed. This is a model-free changepoint detector — works on any time series.