Phylons relabeling cascades

This paper reconstructs the revision-aware event substrate of JUBAP/Phylons from two supplied source snapshots and the historical design corpus. The xbot snapshot implements a retrospective path: local extrema are filtered through centred windows, hidden extrema can be recovered, waves and targets are deleted and rematerialized over a bounded recent interval, predictive factors are recalculated with history padding, and materialized factor-state arrays are replaced from the last stored timestamp. The later JUBAP-PFS snapshot implements a causal streaming path: candidate extrema are confirmed only after subsequent evidence, the event is stored at its historical position while confirmation is emitted at the current stream position, higher event levels are constructed recursively, and temporary extrema are represented separately from confirmed ones. Together, these artifacts expose a research object more precise than a generic “relabeling cascade”: a new observation can revise an earlier event in event time, and that revision can propagate forward through the subset of derived objects that actually depend on the event branch.

The paper therefore separates three layers. First, it documents the code-grounded historical mechanisms. Second, it introduces an implementation-ready, dependency-aware reconstruction with versioned event records, knowledge-time cutoffs, selective invalidation, topological rebuilding, and a cascade-cost ledger. Third, it treats quantum computation as a conditional research option rather than an established advantage. Amplitude amplification or amplitude estimation becomes relevant only after a fixed candidate universe, a reversible marking or sampling oracle, coherent state preparation, error targets, and total resource costs are specified. Event detection, feature construction, dependency traversal, and rebuilding remain classical. The strongest contribution is thus classical and falsifiable: an evolution from retrospective event reconstruction to causal event semantics, plus a concrete benchmark for measuring when revisions matter, how far they propagate, and whether any quantum triage layer could ever cross the engineering cost frontier.

Keywords: event semantics; relabeling; causal replay; knowledge time; dependency graph; incremental recomputation; regime detection; quantum amplitude amplification; amplitude estimation

The supplied code verifies both retrospective reconstruction and causal streaming confirmation. A relabeling cascade should be measured as selective downstream invalidation under explicit event and knowledge versions, not assumed to affect the entire system.

The paper identifies query-complexity candidates, not a demonstrated hardware advantage. The oracle, state preparation, coherent simulation, precision, confidence, and total wall-clock/resource costs remain part of the research question.