UNNS Substrate Research Program · Time-Crystalline Recurrence · 2026

The Structure Inside Recurrence: Time Crystals, Controls, One Frozen Grammar, and a Grammar Boundary

A closure metric, locked before it ever saw a candidate, distinguished two physically unrelated quantum candidates from their respective controls using nothing but the shape of their own recurrence — and then, on a third system, told the truth that mattered most: this grammar does not reach that far.
Blind → Lock → Reveal C001 & C002 — Temporal Recurrence C003 — Domain Boundary Metric Frozen Before Campaign Falsifiable From Line One
Reading time ≈ 20 min · Companion to Prospective Structural Classification of Discrete Time-Crystalline Recurrence · TIME-CRYSTAL-I v1.1.0 · TC_PROSPECTIVE_01

Start Here

A raw trajectory that oscillates is not, by itself, evidence of anything structural. Classical two-cycles oscillate. Logistic-map attractors oscillate. Thermal noise, filtered the wrong way, can look like it oscillates too. The question this article follows is narrower and more useful than "does it repeat?" — it is does the repetition belong to an organized structural family, and can that family be told apart from chance?

UNNS built a frozen recurrence grammar — a closure metric C(q), a family-contrast score F, and a shuffle-null significance p — calibrated once against a ten-record corpus of known physics, then sealed shut before it was shown three real, physically diverse time-crystalline candidates it had never seen. Two of them, coming from completely different physical settings, landed in the same structural class, while their respective controls did not. The third — a real, robust, experimentally verified discrete time quasicrystal — did not enter that class. That refusal turned out to be the most interesting result in the whole campaign.

🕰️ Why "It Repeats" Is Not the Same as "It's Organized"

Time crystals are one of the strangest ideas physics has produced over the past decade and a half: systems that spontaneously break discrete time-translation symmetry, responding at a stable subharmonic of the drive, corresponding for example to recurrence every two or four drive periods, robust against appropriate perturbations, through mechanisms that differ between many-body-localized (MBL) and prethermal regimes. The theoretical case for genuine many-body discrete time crystals (DTCs) is well established. What has been harder to pin down is a purely structural question, sitting one level below the microscopic physics: given nothing but a recorded trajectory, can you tell — from its recurrence geometry alone — whether it belongs to an organized temporal family, or whether it merely looks that way?

This turns out to be a genuinely hard problem, because ordinary, boring, non-quantum recurrence can fake the signature almost perfectly. An exact classical two-cycle — no many-body physics, no quantum mechanics, no disorder, nothing but a clock — can produce a closure spectrum that is numerically almost indistinguishable from a genuine many-body localized discrete time crystal. If raw recurrence strength were the test, the classical oscillator would pass it as well as, or better than, the real thing.

That is the trap this work is built to walk around. Not by inventing a stronger periodicity detector, but by asking a structurally different question: is the recurrence organized into a coherent family, and does that organization survive comparison against a temporally shuffled version of the same data? The answer turns out to separate real structural classes with a precision raw amplitude never could — and, unexpectedly, it also finds the edge of its own competence.

Raw and shuffled time series with a closure spectrum bar chart highlighting even-q family peaks and annotation q₀ = 2; emphasizes that closure, family contrast, and shuffle significance together reveal organized recurrence.
Figure 1 — Structural organization of recurrence beyond amplitude or periodicity. A raw trajectory and its temporally shuffled counterpart look similar in amplitude, but only the raw signal produces a closure spectrum with a sharp, alternating even-q peak. Strong closure at q₀, family contrast F, and shuffle-null significance p — together — are what reveal organized recurrence. No single one of the three is sufficient on its own. This panel is a schematic illustration of the closure-spectrum concept, not a literal export of a specific locked chamber run; the reproduced C(q) values from the actual validation corpus appear in Figure 1 of the manuscript and in the live dashboard below.
Live Instrument · Time-Crystalline Behavior Dashboard

Everything described in this article — the frozen thresholds, the closure spectra, the three blind candidates and their controls, the verdicts — is reproduced as an interactive reference below. It is worth opening before reading further, and worth returning to afterward.

Open the Dashboard ↗

Time crystalline behavior DASHBOARD — if the embed above does not render in your browser, open it directly in a new tab.

① The Frozen Grammar: C(q), F, and p

The chamber that runs this analysis is called TIME-CRYSTAL-I. Its core instrument is a closure spectrum, built the same way regardless of what system it is pointed at:

closure(x, y) = similarity(x, y) × support(x, y)

Averaged across all valid pairs separated by q steps, this produces a spectrum C(q) for q = 1 … 10. The fundamental recurrence depth q₀ is then selected automatically — not hand-picked — as whichever depth shows the sharpest local spectral contrast against its neighbors. Crucially, q₀ = 2 is not hard-coded anywhere: because q₀ is selected by comparison with its immediate neighbors, the rule is free to select q₀ = 4, or any other eligible interior depth q = 2 … 9, purely from the shape of the data.

Closure threshold
C(q₀) ≥ 0.15
minimum recurrence strength
Family contrast
F ≥ 0.10
organized vs. isolated coincidence
Shuffle-null significance
p ≤ 0.10
200 surrogates, seed 20260819
Search range
q = 1 … 10
frozen before any candidate was seen

Once q₀ is fixed, the recurrence-family contrast F compares the closure of q₀'s multiples against every other depth — asking not "how much recurrence exists," but "does that recurrence belong to a distinguishable family, or is it an isolated coincidence at one depth?" Finally, a shuffle-null test destroys temporal order in 200 surrogate copies of the same data and asks how often chance alone could produce a family contrast this strong. All three conditions must hold jointly for a system to enter the supported TEMPORAL_RECURRENCE class:

Closure Spectrum C(q) — Representative Near-Ideal Floquet Trajectory 57-qubit device, ε = 0.01, raw ingestion corpus — even-q family selected by local spectral contrast 0.8 0.0 1 2 3 4 5 6 7 8 9 10 q₀ = 2 (max local contrast) Even-q family (blue) vs. non-family odd-q depths (grey) — this alternating pattern is exactly what the local-contrast rule is built to detect

The whole pipeline is deliberately, almost stubbornly disciplined: physics reconstruction → metric definition → validation against a known corpus → metric freeze → blind candidate → evidence audit → cryptographic analysis lock → ground-truth reveal → posthoc comparison. Nothing about the thresholds, the q-range, or the shuffle parameters is allowed to change once a candidate enters the chamber — and each locked run carries its own SHA-256 checksum, committed before the physical identity of the candidate is ever revealed.

  1. Reconstruct the underlying physics independently, before the metric exists.
  2. Define the closure metric C(q), family contrast F, and shuffle-null p.
  3. Calibrate once against a ten-record validation corpus of known physics.
  4. Freeze the metric — thresholds, q-range, and shuffle parameters locked.
  5. Present a candidate blind, with physical identity withheld.
  6. Audit the evidence and cryptographically lock the quantitative result.
  7. Only then reveal ground truth, and compare posthoc.

② A Frozen Grammar Generalizes Prospectively — Across q₀ = 2 and q₀ = 4

The grammar's development history leaned heavily on period-doubling (2T) behavior. The honest question was whether it had genuinely learned an underlying integer recurrence-family organization, or had simply memorized "time crystal = period two." The prospective campaign, TC_PROSPECTIVE_01, was built to answer exactly that — with three candidates excluded from every stage of calibration.

C001 — Large-Period Digital-Quantum-Computer DTC

Eight experimental IBM Z_* channels, stroboscopically combined with zero target-period leakage — no sign alignment, no Fourier filter toward period 4, no smoothing, no qmax change. The blind analysis independently returned q₀ = 4, C = 0.5483, F = 0.3617, p = 0.0149 → TEMPORAL_RECURRENCE. Its no-recompilation control returned q₀ = 6, F ≈ −0.0035, p ≈ 0.995 → NO_TEMPORAL_ORDER.

C002 — Numerical Prethermal DTC

A 14-spin, N = 300 slow-kick simulation near ε = π. The blind analysis returned q₀ = 2, C = 0.5191, F = 0.5064, p = 0.0050 → TEMPORAL_RECURRENCE — recovered independently, in a physically unrelated numerical setting, without ever being told the target period.

A recurrence grammar developed predominantly in a 2T lineage independently selected q₀ = 4 on unseen data, without being told to search for quadrupling behavior — and rejected its no-recompilation control under the identical frozen gate. (NRCTRL is a no-recompilation control, not a matched-parameter one — the manuscript is careful to keep that distinction, since C002 and C003 each also have a genuinely matched control.) That is a materially stronger claim than "the detector still works": it means the chamber identified an underlying integer recurrence-family organization, not a hard-coded period.

Two panels of closure spectra for C001 (q₀ = 4) and C002 (q₀ = 2) discovered by the frozen grammar; both exceed thresholds and are classified as temporal recurrence.
Figure 2 — A frozen recurrence grammar generalizes prospectively across q₀ = 2 and q₀ = 4. C001 (DTC, large-period, discovered q₀ = 4) and C002 (prethermal DTC, discovered q₀ = 2) both independently exceed the frozen thresholds and are classified TEMPORAL_RECURRENCE — two physically unrelated systems, the same structural family, under a grammar whose thresholds never moved. The bar heights here are a schematic structural visualization of the two spectra for public presentation; the exact locked C(q), F, and p values for C001 and C002 are given in the table and manuscript, and are reproduced verbatim from the cryptographically locked runs.

③ Closure Alone Is Not the Rule — the C002 Paradox

C002 produced the single clearest demonstration in the entire campaign of why the temporal gate has to be a three-condition conjunction rather than a closure threshold alone. Its matched control — same protocol, same system size, but ε = 0 — returned a higher raw closure than the real candidate:

Ccontrol = 0.6250  >  Ccandidate = 0.5191

If amplitude or closure alone were the criterion, the control would look structurally "better" than the genuine article. But the control's family contrast and shuffle significance tell an entirely different story:

C(q₀) Alone Is Not the Temporal Classification Rule

The matched control's closure is real but structurally undifferentiated: F ≈ 0.0012, p ≈ 0.796 — statistically consistent with temporally shuffled surrogates. The candidate's lower closure sits inside a well-separated recurrence family: F = 0.5064, p = 0.005 — a family contrast the shuffled null essentially never reproduces. Strength of recurrence ≠ organization of recurrence.

This is also where the campaign turned to a deliberate negative result. An exact classical two-cycle — no many-body physics whatsoever — scores C = 1.000, F = 1.000, essentially perfect on the temporal axis alone. Its closure geometry, compared appendix-side against the genuine Mi et al. many-body-localized DTC record, is almost the same object:

cosine similarity = 0.999988952  ·  normalized RMS distance = 0.005819

Mi MBL-DTC (many-body)

q₀ = 2, C = 0.954, F = 0.947 — reaches Level 4, many-body time-crystal admissible, because temporal, rigidity, collective, and spectral evidence are all independently supported.

Exact classical 2T oscillator

q₀ = 2, C = 1.000, F = 1.000 — reaches only Level ≤ 2. No rigidity evidence beyond an exact sign-flip family, and no collective or spectral content, correctly marked N/A for a classical record.

On the tested monotone recurrence-rigidity coordinates (C, F, S, U), the ordinary classical two-cycle equals or dominates the genuine many-body DTC on every axis tested. Therefore no monotone scalar built only from C, F, S, U is justified as a DTC-specific order parameter. That is not a weakness in the research — it is a deliberate negative result that tells the chamber exactly where the many-body information is not, and it is precisely why TIME-CRYSTAL-I keeps rigidity, collective, and spectral sectors distinct from the temporal one rather than collapsing everything into a single number.

Side-by-side closure spectra for Mi MBL-DTC and an exact classical 2T oscillator; metrics show nearly identical closure geometry and rigidity, illustrating that rigidity alone is not a many-body identifier.
Figure 3 — Classical recurrence can be nearly structurally identical to DTC recurrence. Mi MBL-DTC (many-body, Level 4 admissible) and an exact classical 2T oscillator (no many-body physics, Level ≤ 2) show nearly indistinguishable closure geometry (cosine similarity 0.999988952). The plotted bars are a schematic structural visualization for public presentation, not a literal re-export of the appendix spectra; the exact reported values are C = 0.954, F = 0.947 for Mi MBL-DTC and C = 1.000, F = 1.000 for the classical 2T oscillator. The on-graphic phrase "monotone functions of (C,F,S,U) cannot define many-body time-crystal admissibility" is a plain-language gloss; the manuscript's precise, better-supported claim is that no monotone scalar built only from C, F, S, U can be justified as a DTC-specific order parameter — temporal rigidity alone is not a many-body identifier, which is why the chamber is a four-sector hierarchy, not a single detector.

④ Physical Taxonomy ≠ Structural Taxonomy

Here is the most compact way to state the central discovery of the whole manuscript:

The Central Discovery
recurrence ≠ time-crystalline admissibility. And, beyond that: physical taxonomy ≠ structural taxonomy.

C001 and C002 come from radically different physical settings — real superconducting-qubit hardware on one side, an exact 14-spin numerical simulation on the other — yet both enter the same supported integer-depth recurrence class. C003, meanwhile, belongs to the same broad physical family of "time-crystalline" phenomena in the literature — it is a robust, independently verified discrete time quasicrystal — yet it does not enter that same structural class. Systems that are physically different can be structurally equivalent under one grammar, while systems with closely related physical names can be structurally different under that same grammar.

Left: three physical system types (DTC, prethermal DTC, DTQC). Right: Venn-style diagram showing C001 and C002 in the supported integer-depth family and C003 outside it; highlights mismatch of the two taxonomies.
Figure 4 — Physical taxonomy and structural taxonomy are demonstrably different. Left: schematic/illustrative representations of three physically distinct system types — a digital-quantum-computer DTC, a prethermal DTC, and a discrete time quasicrystal (DTQC) — not photographs of the actual C001/C002/C003 apparatus. Right: under the frozen grammar, C001 and C002 fall inside the supported integer-depth recurrence family; C003 falls outside it — a direct mismatch between how physics names these systems and how the structural grammar classifies them.

⑤ C003: Perhaps the Deepest Result in the Entire Project

C003 probes an experimental ℤ₂ discrete time quasicrystal with two incommensurate drive clocks — a real, physically robust, long-interaction-regime system (τ₁ = 2.00 µs, τ₂ = 3.236 µs). A dual-clock adapter was constructed directly from the experiment's actual two-clock structure — no interpolation, no invented measurement, no target quasicrystal frequency introduced. The blind analysis returned:

q₀ = 6  ·  C = 0.1988  ·  F = 0.0934  ·  p = 0.9602  ⇒  NO_TEMPORAL_ORDER

C003 could easily have been written off as a failed prediction. Instead, because the metric had already been frozen and cryptographically committed under the prospective protocol before this candidate was ever analyzed, it became something far more interesting than a miss.

C003 closure
C = 0.1988
clears C(q₀) ≥ 0.15
C003 family contrast
F = 0.0934
below the F ≥ 0.10 gate
C003 shuffle-null p
p = 0.9602
far above p ≤ 0.10
vs. its own control
F ≈ 3×
control F = 0.0309 — still sub-threshold

The candidate's family contrast is roughly three times that of its breakdown-regime control — a quantitative difference occurring in the independently established physically ordered candidate — but it remains sub-threshold and statistically unsupported by the frozen shuffle-null test. Both records fail the joint gate. The correct, carefully bounded conclusion is not "there is no temporal order." It is something more precise and considerably more important:

The Precise Reading of a Non-Admission Verdict
Under the frozen dual-clock adapter and the integer-depth (q ≤ 10) recurrence grammar, the tested robust DTQC regime did not enter the supported temporal-recurrence class. NO_TEMPORAL_ORDER is the chamber's verdict inside this grammar. It does not mean the absence of physical temporal order, and it does not establish that all DTQCs, or all multi-clock structures, lack a representation in some closure formalism — only that this frozen adapter and grammar did not supply one.
Domain line showing supported domain containing C001 and C002, boundary beyond which C003 lies; box lists C003 metrics, frozen verdict, and interpretation.
Figure 5 — C003 exposed an empirical domain boundary. C001 and C002 sit inside the grammar's supported integer-depth recurrence domain. C003 — a physically real, robust discrete time quasicrystal — lies outside the supported domain of the present integer-depth grammar (this is an inside/outside classification, not a measured distance: F sits numerically close to its threshold while p sits far from it). The frozen verdict is NO_TEMPORAL_ORDER; the correct interpretation is that this order lies outside the supported integer-depth recurrence grammar, not that it does not exist. Note: the on-graphic phrase "a fundamental feature of the Substrate" is a narrative simplification; the manuscript's precise claim is that C003 motivates grammar-relative structural visibility as a general UNNS structural principle — it is presented as the motivating empirical case, not an independent demonstration of the general mechanism.

⑥ A Structural Grammar Has a Domain — and That Domain Can Be Discovered

This is arguably the most important general result to emerge from the whole manuscript. Usually one asks whether a system lies inside or outside a class. Here, the campaign additionally learned to empirically discover the domain of the classifier itself. C001 and C002 say: this grammar works here. C003 says: this grammar stops here. Because the grammar had already been frozen, and the C003 quantitative result was locked before ground-truth interpretation, the boundary was preserved rather than produced by posthoc retuning.

Temporal Structural Classification Map — TC_PROSPECTIVE_01 All six locked runs, cryptographically committed before ground-truth reveal C001 — q₀ = 4 TEMPORAL_RECURRENCE NRCTRL → NO_TEMPORAL_ORDER C002 — q₀ = 2 TEMPORAL_RECURRENCE CTRL (ε=0) → NO_TEMPORAL_ORDER SUPPORTED — INTEGER-DEPTH RECURRENCE domain edge C003 — q₀ = 6, robust DTQC NO_TEMPORAL_ORDER (verdict) F = 0.0934 ≈ 3× its own control outside supported integer-depth grammar not evidence of physical non-existence Future work: vector recurrence depth (q₁, q₂), toroidal T² closure, incommensurate recurrence coordinates — hypothesized, not built C001 & C002 (physically unrelated systems) enter the same supported class · C003 (physically real, robust DTQC) does not
Runq₀CFpTemporal verdictPosthoc physical class
C00140.54830.36170.0149TEMPORAL_RECURRENCEreported large-period DTC candidate
NRCTRL60.4109−0.00350.9950NO_TEMPORAL_ORDERno-recompilation control
C00220.51910.50640.0050TEMPORAL_RECURRENCEprethermal DTC (N=300 numerical)
C002_CTRL60.62500.00120.7960NO_TEMPORAL_ORDERmatched control, ε = 0
C00360.19880.09340.9602NO_TEMPORAL_ORDERrobust experimental DTQC
C003_CTRL60.09460.03090.9950NO_TEMPORAL_ORDERDTQC breakdown-regime control

Non-Admission Is Grammar-Relative

Non-admission under a frozen grammar G is not equivalent to physical non-existence. C003 makes this impossible to treat as merely philosophical caution — it is an empirical case. A system can be physically real, experimentally ordered, and theoretically understood, while still not being structurally visible to a particular grammar. The manuscript calls this grammar-relative structural visibility: physical object ⇏ visibility in every structural coordinate system.

⑦ What This Means for the UNNS Substrate

Most structural work elsewhere in the Substrate is built on ordered numerical ladders, L = (x₁ ≤ x₂ ≤ … ≤ xₙ) — the object of study is the gap geometry of a sorted sequence, and sorting itself is a legitimate, structure-preserving step. TIME-CRYSTAL-I operates on a fundamentally different kind of object: a temporal sequence X₀, X₁, X₂, … in which the order in time carries the structural information under test. Sorting the values would destroy exactly the property the chamber is built to detect.

A New Structural Chart
TIME-CRYSTAL-I instantiates a genuine order-preserving temporal structural chart, distinct from ladder-based admissibility — standing alongside the Substrate's existing ladder formalism, not as a special case of it. The present results suggest that structural organization within UNNS is better described through multiple structural charts than through one master coordinate.

C003 raises a further, sharper possibility: ordinary DTC recurrence is naturally organized by a one-dimensional integer family, q₀, 2q₀, 3q₀, …, while a two-clock quasicrystalline system is instead naturally associated with combinations such as mω₁ + nω₂, (m, n) ∈ ℤ². That suggests a future transition from C(q) to something resembling C(q₁, q₂) — from a recurrence ladder to a recurrence lattice, or toroidal closure geometry. The manuscript is careful to label this a hypothesis motivated by C003, not a result already established.

Structural Class, Not Physical Label

Taxonomy Mismatch

C001 and C002 arise in different physical contexts yet map into the same supported class. C003 shares the broader "time-crystalline" label but lies outside it. Physical taxonomy and structural taxonomy are not interchangeable.

Rigidity Sector

A Deliberate Negative Result

Trajectory-level recurrence, however rigid, does not by itself encode "many-body." This is why the chamber has collective and spectral gates at all, beyond the temporal one.

Domain Discovery

Part of Validation, Not a Failure

A chamber capable of producing a bounded, reproducible negative result under a frozen protocol is more useful than one that can always be adjusted post hoc until the answer becomes positive.

Hierarchy, Not Binary

Five of Six Verdicts Occupied

NO_TEMPORAL_ORDER → TEMPORAL_RECURRENCE → RIGID_RECURRENCE → COLLECTIVE_TEMPORAL_ORDER (unoccupied) → MANY_BODY_TC_ADMISSIBLE. The chamber asks what kind of organization is present, and how much evidence supports the interpretation placed on it.

Multi-Chart Architecture

Lattice, Not Just Ladder

A ladder chart for ordered numerical structure and a temporal-recurrence chart for order-preserving sequences stand side by side — with a hypothesized future lattice chart for multi-clock quasi-periodic order.

Discipline

What Not to Claim

C001/C002 do not prospectively validate rigidity, collective, or spectral generalization — those sectors remain NOT_TESTED. C003 establishes one domain boundary, not a general statement about all discrete time quasicrystals.

⑧ Limitations, Stated Plainly

The manuscript treats its own limitations as facts to expose, not caveats to minimize — and lists explicit ways the central conclusion could still fail under future testing.

Ways This Could Break

  • Independent DTC candidates, analyzed under the same frozen protocol, may fail to reproduce the C001/C002 candidate-control separation.
  • A future matched control, built under the same neutrality rules, may satisfy the frozen temporal gate where none has so far.
  • An independently preregistered, neutral representation of DTQC data may enter the supported integer-recurrence class — narrowing or overturning the domain-boundary interpretation of C003.
  • Threshold-perturbation analysis, varying Fmin, pmax, or qmax within physically reasonable ranges, may reveal the C001–C003 separations are less stable than the point estimates suggest.

The recurrence-depth search is finite (q ≤ 10); a physically real recurrence at depth q > 10 would not be found by the current implementation. The Level-4 hierarchy has validation-corpus support — one Level-4 record, Mi MBL-DTC — but no prospective confirmation to date. And prospective validation in this work applies only to the temporal sector: rigidity, collective, and spectral generalization for C001 and C002 remain untested, not because they failed, but because no standardized evidence for those sectors was supplied in the corresponding bundles.

🔭 The Single Sentence

Conclusion, Compressed
The time-crystal campaign did not merely classify temporal recurrence; it showed that structural grammars themselves have observable domains, and that physically real order can survive beyond the boundary of the grammar used to describe it.

A frozen structural recurrence grammar was prospectively tested against three time-crystalline candidates excluded from metric calibration, under blind analysis and post-analysis identity reveal. Two DTC-related candidates independently entered the supported integer-depth recurrence class, at q₀ = 4 and q₀ = 2, while their controls did not. A robust experimental discrete time quasicrystal remained outside the same support grammar — establishing the first observed domain boundary of the frozen temporal metric. These results support reading temporal recurrence as a structural admissibility family rather than a universal proxy for time-crystalline order, and motivate a separate prospective treatment of multi-clock quasi-periodic organization in future work.

You Don't Need to Agree to Enter

The most productive way to engage this result is to try to break one precise claim: that C002's control, with higher raw closure, correctly fails the family-contrast gate; that C001's grammar genuinely never saw q = 4 during development; or that C003's non-admission is correctly read as a domain boundary rather than a disproof. Within the present validation corpus and prospective campaign, none of these tests has failed in the stated way — but all three are checkable, not appeals to authority.

Resources & References

For the full formal development — frozen thresholds, cryptographic locks, complete evidence audits, and all six locked prospective runs — see the primary manuscript and its accompanying data and analytics.

  • Primary Manuscript (PDF):
    Prospective Structural Classification of Discrete Time-Crystalline Recurrence
    Integer-depth closure, blind validation, and a quasi-periodic domain boundary. Full derivation of C(q), F, and the shuffle-null test; the ten-record validation corpus; the complete TC_PROSPECTIVE_01 blind-lock-reveal protocol; and the discussion of grammar-relative structural visibility. UNNS Research Collective · 18 pages · August 2026.
  • Data and Corpus Construction (ZIP):
    time_crystal.zip
    The TIME-CRYSTAL-I v1.1.0 chamber, the TC_PROSPECTIVE_01 research folder with C001–C003 candidates, ground truth, and locked runs, plus the TC_RIGIDITY, TC_CLOSURE, and TC_INGEST modules and the raw 57-qubit ingestion dataset.
  • Time-Crystalline Behavior Analytics (HTML):
    time_crystalline_behavior_analytics.html
    Interactive analytics across all thirteen sections — closure-spectrum charts, the ten-record validation corpus table, the six-verdict hierarchy ladder, the rigidity-sector negative result, cross-candidate comparison, and reproducibility hashes.
  • Time-Crystalline Behavior Dashboard (HTML):
    time_crystalline_behavior_dashboard.html
    The live at-a-glance instrument embedded above — status pills, the closure spectrum, and the C001–C003 verdict cards in one view.
UNNS Substrate Research Program · Time-Crystalline Recurrence · 2026 · This article is a public-facing synthesis of the TIME-CRYSTAL-I v1.1.0 chamber and its TC_PROSPECTIVE_01 blind prospective campaign. It does not replace or compete with established Floquet time-crystal theory — it operates downstream of it, asking a structural-classification question given known dynamics. Read adversarially: a valid break is a contribution, not a hostile act. · unns.tech