Expand description
§nexcore-helix — Conservation Law as Computable Geometry
The conservation law ∃ = ∂(×(ς, ∅)) encodes a helix:
- It advances (→) — each turn raises resolution
- It returns (κ) — same angular truth at every altitude
- It bounds (∂) — radius separates inside from outside
Five turns at increasing altitude, same truth at higher resolution:
| Turn | Name | What | Encoding |
|---|---|---|---|
| 0 | Primitives | The alphabet | 15 symbols |
| 1 | Conservation | The grammar | ∃ = ∂(×(ς, ∅)) |
| 2 | Crystalbook | The laws | 8 constraints |
| 3 | Derivative Identity | The calculus | How the grammar changes |
| 4 | Mutualism | The point | Why the grammar exists |
By Matthew A. Campion, PharmD.
Modules§
- dna
- DNA encoding for helix conservation states.
- engine
- Involutionary Engine — bidirectional computation on DNA-encoded helix states.
Structs§
- Conservation
Input - The three inputs to the conservation law.
- Conservation
Result - Result of computing ∃ = ∂(×(ς, ∅)).
- Derivatives
- Partial derivatives of ∃ with respect to each primitive.
- Helix
Position - A point on the knowledge helix.
- Mutualism
Result - Result of a mutualism test.
Enums§
- Existence
Class - Mutualism
Class - Turn
- The five turns of the knowledge helix.
- Weakest
Primitive
Functions§
- binding_
laws - Which Crystalbook laws bind a system based on its weakest primitive.
- can_
advance - Check if a system can advance to the next helix turn.
- conservation
- Compute ∃ = ∂(×(ς, ∅)).
- derivatives
- Compute partial derivatives of ∃ = ∂(×(ς, ∅)).
- helix_
position - Compute 3D position on the helix.
- mutualism_
test - Test whether an action serves mutualism.
- vice_
risk - Vice risk associated with the weakest primitive.