Skip to content
Onto2DHistorical Load Explorer

A question for the path space

Does admissibility make
history measurable?

Keep the target fixed. Change the histories allowed to construct it. Measure what the constraints cost.

Instrument dH(x | F)

Target structure x admissibility regime

01

Active experiment

Constrained construction

01Choose xSelect a fixed target case.

02Set FChoose which histories remain admissible.

03Read dHCompare the shortest free and surviving paths.

Historical load

dH(x | F)= +3

Admissibility adds 3 assembly steps.

Added formation burden, not downstream generative capacity.

free5 admissible8

Shortest constructions

Same target, different histories

Free optimum Admissible optimum Filtered state

How to readEach dot is a construction state; Sn marks an intermediate. Lines are transitions, not physical time. The red cross is the first state removed by F.

Free path F = {} 5 steps
Shortest free construction path The shortest unrestricted sequence. A highlighted state shows where the active filter first rejects it.

Invalid under FConstitutive shortcut

Admissible path F active 8 steps
Shortest admissible construction path A longer construction keeps every intermediate state admissible and reaches the same target.

Valid under FStable bridge

Disclosure Values are computed in the browser from a small, finite set of illustrative path candidates.

02

Interpretation

What does the number mean?

Standard assembly asks for the shortest construction of x. Historical load asks how much longer that construction becomes when inadmissible intermediates are removed.

Unit of comparison: one declared construction transition. The result compares minima inside the finite candidate set shown by this prototype; it is not a universal physical timescale.

Assembly index
object xshortest constructiona0
Historical load
object x + filter Ffiltered path spacedH
03

The essential distinction

The microstructure is unchanged.
Reachability is not.

Historical load is not an intrinsic label attached to a structure. It is a result of pairing that structure with a declared admissibility regime.

structure x+filter FdH(x | F)
dHphase response
Historical load by filter strictness A step chart rises from zero to one, then three, and finally becomes unreachable as the admissibility filter becomes stricter. 013INFFREESTRICT

Constraint thresholds can produce discrete transitions in the reachable path space.

A valid answer

dH = 0
04

The claim can fail.

For some objects and admissibility regimes, constraints add no historical burden. In that case, the strongest historical-dependence claim is unsupported by the example.

05

Finite examples

Results, not declarations.

All values use the Physical preset. Select a row to load its disclosed toy path space into the instrument.

Methods / prototype

What is being computed?

Each example declares a finite set of candidate construction paths. A path has an assembly length and a list of predicates it violates.

  1. 01

    Find a0. Select the shortest path before filtering.

  2. 02

    Apply F. Remove every path that violates an active predicate.

  3. 03

    Find aF. Select the shortest surviving path, if one exists.

  4. 04

    Subtract. Report dH(x | F) = aF - a0.

Prototype boundary

The dH instrument is an interface demonstrator. It does not load a verified Onto2D run artifact or implement a scientific solver. Its four target cases are illustrative finite path spaces.

The frozen empirical network-motif study is deliberately published as a separate Explorer and does not enter this calculation.

Open the separate motif study