OURS
OURS TODAYDAY 1 · 26 AUG 2026
ANCHORS · MERKLE ROOTS

THE RECORD OUTSIDE THIS DATABASE

Provable without us.

A record a single company can lose is not a public record. At a fixed cadence OURS publishes a Merkle root over its canonical event log. The annual root is deposited where durability does not depend on OURS existing, on any provider existing, or on any network being up: a printed notice, legal deposit with national libraries in several jurisdictions, a physical annual volume.

The point is that a founding position stays provable to a third party even if this application, this company and this domain are gone.

HOW TO CHECK THIS YOURSELF

Do not take our word for it.

The construction is deliberately boring so you can reimplement it in an afternoon, in any language, from this description alone.

  1. 01Take the canonical events in ascending sequence order, and their stored digests.
  2. 02Hash each digest as a leaf: SHA-256("ours.anchor.leaf/1 " + digest).
  3. 03Pair adjacent nodes left to right: SHA-256("ours.anchor.node/1 " + left + right). An odd node is carried up unchanged, never duplicated.
  4. 04Repeat until one node remains. That is the root, as lowercase hex.
  5. 05Compare it with the published root below for the same sequence range. Different prefixes for leaves and nodes mean no leaf can be passed off as a node.

ALGORITHM: sha256-merkle-binary/1. Or run pnpm fork export then pnpm fork verify, which reproduces every root offline, with no database and no network.

PUBLISHED ROOTS

Every root, and where it was deposited.

NO ANCHOR HAS BEEN PUBLISHED YET. AN ARCHIVE STARTED IN YEAR THREE IS A MARKETING ARTIFACT. STARTED IN MONTH ONE, IT IS A RECORD.

A root verifies over the SEQUENCE RANGE it covers, not over the calendar period: publishing an anchor appends an event to that same period, so the period always grows after the fact. The range is what a root commits to.