How gappy the signal's ternary address space is.
Each byte is re-interpreted as a base-3 address into the unit interval, the way the classical Cantor set construction works: each bit selects "left third" or "right third," skipping the middle. The resulting coordinates cluster around Cantor-set-like positions if the data has ternary self-similarity, or spread uniformly if it doesn't. The geometry then measures the gap structure of these coordinates.
Fraction of distinct embedded coordinates relative to total data length. Sprott-B, Projectile, and Damped Pendulum score 0.016 (many repeated coordinates — smooth dynamics map many different byte values to the same Cantor address). Fibonacci word scores 0.0001 (its binary structure creates extreme degeneracy in ternary representation). High coverage means the data explores many distinct positions in the Cantor embedding; low coverage means it collapses to a dust-like subset.
The largest gap between adjacent sorted coordinates. L-System Dragon, Morse code, and Rule 110 all hit 1.0 (a gap spanning the full interval — the data avoids an entire region of the ternary address space). Collatz gap lengths scores 0.005 (tiny gaps, nearly uniform coverage). A large max_gap means the data has a forbidden zone in its ternary structure, like the middle third removed in the classical Cantor construction.
Average spacing between consecutive sorted coordinates. Accel walk, Kepler exoplanet, and Zipf distribution cluster at 6.1e-5 (tightly packed — many distinct coordinates with small gaps). Collatz gap lengths scores 7.8e-7 (extremely dense). Mean gap complements max_gap: a signal can have large max_gap but small mean_gap if it has one big hole and is densely packed everywhere else.
| Source | Domain | Value |
|---|---|---|
| Sprott-B | chaos | 0.0156 |
| Projectile with Drag | motion | 0.0156 |
| Damped Pendulum | motion | 0.0156 |
| ··· | ||
| Constant 0xFF | noise | 0.0000 |
| Constant 0x00 | noise | 0.0000 |
| Fibonacci Word | exotic | 0.0001 |
| Source | Domain | Value |
|---|---|---|
| L-System (Dragon Curve) | exotic | 0.9998 |
| Morse Code | waveform | 0.9998 |
| Rule 110 | exotic | 0.9998 |
| ··· | ||
| Constant 0xFF | noise | 0.0000 |
| Constant 0x00 | noise | 0.0000 |
| Collatz Gap Lengths | number_theory | 0.0051 |
| Source | Domain | Value |
|---|---|---|
| Accel Walk | motion | 0.0001 |
| Kepler Exoplanet | astro | 0.0001 |
| Zipf Distribution | exotic | 0.0001 |
| ··· | ||
| Constant 0xFF | noise | 0.0000 |
| Constant 0x00 | noise | 0.0000 |
| Collatz Gap Lengths | number_theory | 0.0000 |
Cantor Set geometry detects structure in the low bits of byte values — the ternary address depends on the full bit pattern, not just the magnitude. Signals with repetitive low-bit patterns (periodic orbits, symbolic dynamics) produce degenerate Cantor embeddings with extreme gaps. In the atlas, the combination of low coverage and high max_gap identifies signals whose byte values avoid specific ternary regions, which is a different kind of regularity than the distributional uniformity measured by Torus or Wasserstein.