Infrastructure · Primitives
TimeWarpLog
Handling relativistic event ordering
Definition
Mechanism
Events are not ordered by wall-clock time but by 'causal cones'. An Agent accepts an event from the 'past' if it doesn't contradict its current causal cone. The log's append position is driven by a MonotonicCounter so that once an event is admitted to a cone, no earlier-sequenced event can supersede it. Allows for massive latency tolerance. Utilizes WorldReversible, CausalBarrier.
Preconditions
- Storage supports append-only writes
Postconditions
- System state matches T_target
Invariants
- Immutability: past entries cannot be modified.
- Indexability within retention: Seek(T) returns deterministic State(T) for any T inside `retention_window`.
- Causal consistency: events are accepted only if they do not contradict the current causal cone.
Risks
Failure modes
User confusion about 'when' things happened.
Caution
Causal cone is only as trustworthy as the identities signing events. Unsigned or weakly-authenticated events can rewrite perceived history.
Relationships
Builds on
References
Mind
Autonomous Goal-Directed Entity
Physics
Enforcing strict event ordering
Society
Value that never decreases
System condition at time T
Complex whole of interacting parts
Mind
Designing for zero-cost undo
Used by
References
Structured rollback via logged inverses in LIFO order
Society
Optimistic execution, retroactive verification
Mind
Belief Provenance (Macro for Trace(Belief))
Composes with
Society
Supervised bypass of a failed acceptance gate, cryptographically logged
Reference
Parameters
granularityDuration, [1ms, 1min]- Resolution of time travel
index_strategyEnum, {Time, Causal, Hybrid}- How to organize history
retention_windowDuration, [1h, 30d]- How far back to retain