Helix Computing — Conservation Law as Computable Geometry
The conservation law ∃ = ∂(×(ς, ∅)) encodes a helix: it advances (→), returns (κ), and bounds (∂). Five tools make this geometry computable: conservation checks, helix position, mutualism validation,
5 toolshelix
Conservation Check
Validate ∃ = ∂(×(ς, ∅)) for a system. Inputs: boundary sharpness ∂ ∈ [0,1], state richness ς ∈ [0,1], void clarity ∅ ∈ [
boundarystatevoid
Helix Position
Compute position on the knowledge helix. Five turns: 0=Primitives (alphabet), 1=Conservation (grammar), 2=Crystalbook (l
turn
Mutualism Test
Test whether an action satisfies the mutualism constraint: does it produce ∃ for self WITHOUT reducing ∃ for others? Con
existence_self_beforeexistence_self_afterexistence_other_beforeexistence_other_after
Encode
Encode a concept through all 5 helix turns. Given a concept name and its primitives, returns the encoding at each altitu
conceptprimitivesboundarystatevoid
Advance
Advance one turn on the helix. Given current turn and state, compute what the next turn requires. The truth doesn't chan
current_turncurrent_existencecurrent_boundarycurrent_state