42 is just a coincidence.

EXPANDED NON-REPETITIVE QUOTE LEDGER

The following quotes are the consolidated non-duplicative maxims of the canon. They are written as reusable aphorisms for documents, code comments, commit messages, tests, and public writeups.

1. Order is not gifted by probability; it is extracted from entropy by falsifiable clauses.
2. Truth does not ask for consensus; it asks for a falsifier and survives it.
3. There is no argument against a working proof.
4. The author is not above the clause; the author is its first custodian.
5. Silence is the chamber where the root forms before the proof is exposed.
6. Each resolved clause becomes the seed for the next falsification.
7. A claim without clause structure is vapor; a claim without hash lineage is fugitive.
8. A root proves lineage; it does not make a false source true.
9. Law that cannot be executed is only will in costume.
10. Nothing is powerful unless it can be falsified.
11. Authority is not above the machine; it emerges from the machine’s verified constraints.
12. Identity is not a static credential; it is the causally linked sum of acts.
13. Wisdom cannot be purchased; it is auditable or it is not wisdom.
14. Dominance is not declared in words; it is proven in traces.
15. Law hides in topology; surface text is only one projection.
16. Projection can create apparent uncertainty, but the projection thesis must still be tested.
17. The hidden axis is often the missing proof.
18. Search is not free; entropy must be spent where falsification yields the most information.
19. The model proposes clauses; the runtime compiles cognition.
20. Merkle binds the path; it does not think the thought.
21. The answer is not grounded until it can walk backward to its source.
22. The controller does not make truth; it enforces the path truth must take.
23. The model may point; the runtime must quote.
24. Do not win by retrying; win by building the better map first.
25. The route taken to evidence is part of the proof.
26. A noisy source may be retrieved; it must not be silently trusted.
27. A pointer proves attachment; it does not prove understanding.
28. A relation answer is not admitted until the relation itself is evidenced.
29. Sometimes the phrase is the entity.
30. A supported item is not a complete list.
31. Reuse is lawful only when context has not changed.
32. Build once at O(N); challenge later at O(log N + k).
33. Merkle proves binding; ZK may hide the witness.
34. A diagnosis that cannot affect admissibility is only a warning label.
35. The visible answer is part of the audit surface.
36. The model carries old maps; the runtime builds the current map.
37. Train the model to use the map, not to memorize the territory.
38. A repaired second answer is not a first answer.
39. The answer is only the final leaf; the lifecycle is the tree.
40. Private-first does not mean unverifiable.
41. A canon that cannot become a test is not yet law.
42. The legacy is not the name; it is the replayable trace.