Bridge Beta
beta v0.2 • standalone • no trackers

A message hidden as an address.

A fraction becomes a grid address. The address recovers an integer. A public convention turns the integer into text. Meaning stays with the receiver, where it belongs.

Try the live bridge Open the paper

The bridge in five ledges.

The page is built to let a stranger climb from curiosity to verification without needing the paper first.

FractionA reduced rational arrives, such as 16862/65.
Grid addressThe divisor-band law tests whether it has a chamber home.
IntegerThe step k is recovered exactly when s divides n.
ConventionASCII, UTF-8, or another public ledger gives the text layer.
MeaningThe receiver supplies interpretation. The machine does not.

The plumbing ledger.

Accounting style. The left column posts one operation per line; its result crosses to the right column as that line's input, then drops to the next line. You can watch every value move — output becomes input, all the way down. Nothing is hidden in a single click.

direction: fraction → symbol
A reduced fraction r/s. The ledger traces it to a letter. Press Flip to drive it the other way: a symbol in, a fraction out — for tinkerers.
  1. Reduce / readthe reduced fraction r/s
    r/s = 16862/65
    →
    r = 16862, s = 65
    The starting entry. Everything posts from here.
  2. Find chambern = ceil(r / s)
    ceil( 16862 / 65 )
    →
    n = 260
    The only chamber it could belong to.
  3. Membershipdoes s divide n?
    65 | 260 ?
    →
    yes → 260 = 4 × 65
    It belongs. A real step exists.
  4. Band remaindert = r − s(n−1)
    16862 − 65×259
    →
    t = 27
    Position in the chamber, in denominator ticks. Not the step yet.
  5. Apply scalek = (n / s) × t
    ( 260 / 65 ) × 27 = 4 × 27
    →
    k = 108
    Scale is 4. The true step 108 is NOT the remainder 27. Stopping early breaks it.
  6. Public conventionASCII(k)
    ASCII 108
    →
    l
    Only now does a convention make it a letter. The math gave the integer; ASCII gave the symbol; you supply the meaning.

Live bridge lab.

Encode text into theorem-addressed fractions, then decode a payload back into integers and text. Everything runs locally in this file.

offline-safe

1. Encode a message

Basic Latin / byte-range characters are supported in this beta.

2. Decode a payload

Use comma, space, or line breaks between fractions.

Bridge output

12 recovered 0 rejected input order
this is test

Recovered text appears only after the integer layer is interpreted by a public convention.

65908/257, 33205/129, 9561/37, 13491/52, 67892/261, 68487/262, 69021/263, 8683/33, 70076/265, 70591/266, 71137/267, 17918/67
#charr/sntn/skstatus
1 t 65908/257 257 116 1 116 ok
2 h 33205/129 258 52 2 104 ok
3 i 9561/37 259 15 7 105 ok
4 s 13491/52 260 23 5 115 ok
5 space 67892/261 261 32 1 32 ok
6 i 68487/262 262 105 1 105 ok
7 s 69021/263 263 115 1 115 ok
8 space 8683/33 264 4 8 32 ok
9 t 70076/265 265 116 1 116 ok
10 e 70591/266 266 101 1 101 ok
11 s 71137/267 267 115 1 115 ok
12 t 17918/67 268 29 4 116 ok

The exact law, minus the fog.

This is the engine the lab uses. The important trap is that t is not the step unless n/s = 1.

forward grid
a(n,k) = n - 1 + k/n chamber: n >= 1 step: 1 <= k <= n

Inside chamber n are n evenly spaced steps in the interval (n-1, n]. The address is the pair (n,k).

inverse address
Given reduced r/s: n = ceil(r/s) belongs iff s divides n t = r - s(n - 1) k = (n/s)t

The theorem recovers an address. The convention layer recovers text. Those two jobs stay separate.

The canary row

16862/65 lands in chamber 260. The band remainder is 27. Since 260/65 = 4, the true step is 108. Stopping at 27 breaks the message. Scaling to 108 recovers. One might try using a known good example such as listed in the thesis paper or even using that flip directons button to code your own example. l under ASCII.

The firewall is part of the bridge.

Clean structure is not the same as true interpretation. The page refuses the attractive wrong claims right where a reader might be tempted to make them.

What survives

  • The grid law can recover a valid address exactly.
  • Public conventions can map integers to text.
  • Receivers can independently recognize shared ledgers.
  • Volatility recurrence may describe risk regimes.

What gets refused

  • No hidden proof of meaning.
  • No claim that this is compression or secure encryption.
  • No price-direction prediction or buy/sell signals.
  • No predictive certainty from recurrence.

Future finance adapter terms

  • Adapter: future FINANCE/MARKET adapter only.
  • Scope: outside the core theorem-address layers.
  • Process: source-locked data, versioned dashboards, and human review.
  • Hard refusals: no trades, no signals, no predictive certainty.

Packet handoff.

The beta bridge can travel as one folder: this HTML file, the capstone PDF, and the ladder infographic.

Infographic ladder showing the theorem-addressed message climb
The ladder infographic stays available as a visual companion, not a proof substitute.

Bridge contract

  • One HTML file, no framework, no external fonts, no analytics.
  • Works offline once the folder is downloaded.
  • JavaScript is used only for the live lab.
  • The PDF is the rigorous source. The page is the doorway.
Read the capstone PDF