Corpus releases
Each release is a snapshot of the corpus: every item hashed, a Merkle tree built over them, the root published — and the root seeds the release glyph. Physical artifacts will carry these roots in both channels, ornamental and machine-readable, so any recovered artifact can authenticate any surviving copy.
Release 0000 — 2026-07-06
The self-description release: the project's founding documents, verified research (including refuted claims), and identity records — 13 items, entirely rule-based (Track A). The archive's first entry is its own reason for existing, so every later release and every artifact chains back to a verifiable statement of intent.
Merkle root
cda2045f630c20e3d7518ca6a09533121b06e1384651756cf069b124a5613afd
Glyph seed = first 4 bytes of the root = 3449947231. Manifest: release-0000.json(items, hashes, and the exact tree construction).
Items
| Path | Bytes | SHA-256 |
|---|
| Personal Mission statement.md | 1488 | 6a51924df18c591e… |
| Vision.md | 10888 | 91936f19f224a01e… |
| corpus/SELECTION.md | 2455 | b14fd5f119e6c32c… |
| corpus/items/boot-message.md | 981 | cb927ec94882408b… |
| library/README.md | 3778 | 2ec7c7bc03d7f587… |
| library/architecture/ecosystem.md | 6606 | d6716fe900c7a625… |
| library/research/2026-07-05-deep-time-preservation-round1-findings.json | 26969 | 5bee1491316bbc76… |
| library/research/2026-07-05-deep-time-preservation-round1.md | 9255 | 11a922268fcbaa23… |
| library/research/2026-07-05-deep-time-preservation-round2-findings.json | 35046 | 5f5460df76b898c2… |
| library/research/2026-07-05-deep-time-preservation-round2.md | 5236 | 6f92ae5d8c391d8d… |
| library/research/2026-07-05-naming-tld-glyph-round3-findings.json | 30177 | ceba895d7f97ffc3… |
| library/research/2026-07-05-naming-tld-glyph-round3.md | 4920 | b160fc6cb2d0a969… |
| site/public/glyph.json | 2300 | eafbfaf151d4702c… |
Verify this release
From a copy of the repository:python3 corpus/tools/release.py --verify corpus/releases/release-0000.json— it recomputes every item hash and the root. The construction is stated in the manifest itself: leaves are SHA-256 of raw bytes; nodes are SHA-256 of the ASCII concatenation of the two child hex digests; unpaired nodes promote unchanged; items sort by path.
Memory Commons