Tradition-comparison decision map

Mean–true lunar-node decision map

Preserve two computational definitions and prevent silent substitution in rule application.

Required inputs

Shared instant

Mean-node algorithm

True-node algorithm

Tradition rule namespace

Boundary tolerance

Ordered execution

Work the protocol

  1. 1

    Calculate both nodes under named algorithms.

  2. 2

    Retain the nodal-axis relation.

  3. 3

    Measure longitude and sign differences.

  4. 4

    Apply only rules declaring the consumed node.

  5. 5

    Evaluate models prospectively if performance is compared.

Outputs

  • Parallel node positions
  • Difference report
  • Rule eligibility map

Done only when

  • Algorithms are versioned.
  • Every rule names mean or true.
  • No empirical winner is inferred.

Fail closed

Refusal conditions

  • The node type is absent.
  • One value overwrites the other.
  • Retrospective fit selects a node.