- Spatial key
- oct/0/2/2/0
- Mass
- 8 kg
- Velocity
- 2 m/s
- Intent
- EAST → CONTACT
D25 · IMPLEMENTED FIXTURE
Semantic Fractal Topology
A language-addressable spatial machine presented as inspectable state: recursive spatial memory, deterministic transitions, immutable branches, and explicit proof boundaries.
INTERPRETATION BOUNDARYThis fixture does not claim that strings replace geometry or general physics. The interface exposes calculations made by a bounded deterministic kernel.
- Spatial key
- oct/0/2/2/1
- Mass
- 2 kg
- Velocity
- 0 m/s
- Constraint
- SUPPORTED_BY floor
Local metric frame · normal +Y · branch oct/0/2
Address overlap escalated to the bounded collision solver.
- 105 · approach
- 106 · first contact
- 107 · state resolved
Counterfactual workbench
Edit an assumption. Preserve the past.
ACTIVE: MAINThe first historical edit creates a counterfactual branch. Reset restores the exact authored fixture state.
Resolution event
VALIDOne-dimensional collision
solver: rigid-body / 1D / e=1Steel_Ball → 1.2 m/s
Wood_Block → 3.2 m/s
Momentum before16
Momentum after16
Momentum checkPASS
Energy conservedPASS
The graph exposes the calculation. It does not invent it.
The doorway test
Topology knows connection. Measurement proves fit.
Semantic relations can establish containment, adjacency, and reachability. They cannot establish dimensional clearance without a metric layer. Toggle the evidence available to the solver.