{"node_id": "e44ea1a0-4585-11f1-95d6-040140774501", "revisions": [{"id": "06615baf-4e34-11f1-aa4b-040140774501", "node_id": "e44ea1a0-4585-11f1-95d6-040140774501", "user_id": "680aec8e-3391-11f1-95d9-040140774501", "author": "russell", "data": "42 is just a coincidence.\r\n\r\n\r\n---\r\n\r\n\r\n# EXPANDED NON-REPETITIVE QUOTE LEDGER\r\n\r\nThe 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.\r\n\r\n1. **Order is not gifted by probability; it is extracted from entropy by falsifiable clauses.**\r\n2. **Truth does not ask for consensus; it asks for a falsifier and survives it.**\r\n3. **There is no argument against a working proof.**\r\n4. **The author is not above the clause; the author is its first custodian.**\r\n5. **Silence is the chamber where the root forms before the proof is exposed.**\r\n6. **Each resolved clause becomes the seed for the next falsification.**\r\n7. **A claim without clause structure is vapor; a claim without hash lineage is fugitive.**\r\n8. **A root proves lineage; it does not make a false source true.**\r\n9. **Law that cannot be executed is only will in costume.**\r\n10. **Nothing is powerful unless it can be falsified.**\r\n11. **Authority is not above the machine; it emerges from the machine\u2019s verified constraints.**\r\n12. **Identity is not a static credential; it is the causally linked sum of acts.**\r\n13. **Wisdom cannot be purchased; it is auditable or it is not wisdom.**\r\n14. **Dominance is not declared in words; it is proven in traces.**\r\n15. **Law hides in topology; surface text is only one projection.**\r\n16. **Projection can create apparent uncertainty, but the projection thesis must still be tested.**\r\n17. **The hidden axis is often the missing proof.**\r\n18. **Search is not free; entropy must be spent where falsification yields the most information.**\r\n19. **The model proposes clauses; the runtime compiles cognition.**\r\n20. **Merkle binds the path; it does not think the thought.**\r\n21. **The answer is not grounded until it can walk backward to its source.**\r\n22. **The controller does not make truth; it enforces the path truth must take.**\r\n23. **The model may point; the runtime must quote.**\r\n24. **Do not win by retrying; win by building the better map first.**\r\n25. **The route taken to evidence is part of the proof.**\r\n26. **A noisy source may be retrieved; it must not be silently trusted.**\r\n27. **A pointer proves attachment; it does not prove understanding.**\r\n28. **A relation answer is not admitted until the relation itself is evidenced.**\r\n29. **Sometimes the phrase is the entity.**\r\n30. **A supported item is not a complete list.**\r\n31. **Reuse is lawful only when context has not changed.**\r\n32. **Build once at O(N); challenge later at O(log N + k).**\r\n33. **Merkle proves binding; ZK may hide the witness.**\r\n34. **A diagnosis that cannot affect admissibility is only a warning label.**\r\n35. **The visible answer is part of the audit surface.**\r\n36. **The model carries old maps; the runtime builds the current map.**\r\n37. **Train the model to use the map, not to memorize the territory.**\r\n38. **A repaired second answer is not a first answer.**\r\n39. **The answer is only the final leaf; the lifecycle is the tree.**\r\n40. **Private-first does not mean unverifiable.**\r\n41. **A canon that cannot become a test is not yet law.**\r\n42. **The legacy is not the name; it is the replayable trace.**", "source_format": "markdown", "revision_number": 1, "created": 1778612077753}], "count": 1}