Independently verifiable
Verify our record.
We froze our published BTC readings through June 9, 2026 into a single fingerprint and timestamped that fingerprint on the Bitcoin blockchain. Anyone can recompute the fingerprint from the published readings and confirm it matches — and confirm it was timestamped, not back-dated — without taking our word for it. This page shows the frozen fingerprint, its Bitcoin timestamp, and the exact steps to check both yourself.
The frozen record
- Record root
- Frozen record root (SHA-256): 699ca7f132679ea95531866b271479124bf6a44d2a25154bdce65ef0f00f0e4b
- Tree size
- Tree size: 45 leaves (one per matured reading; no extra leaves)
- Readings covered
- Readings covered: 45 matured readings, 2026-04-26 to 2026-06-09
- Checkpoint id
- Checkpoint id: 393ecb756c11b290b9abbb5a0aa18176e947a750903b5f02e892bd0dc66db551
- Source ledger
- Source ledger (SHA-256): 2b9e43e96ea98ac290b739c2dc563f17c8758454658b79bd11ad27bae647da2f
- Bitcoin timestamp
- Confirmed on the Bitcoin blockchain in block 955,461, anchored as of 2026-06-26.
How to verify it yourself
- Download the published readings and the verifier. Get public_entries.jsonl and verify_clean_anchor.py. The published readings file is the authoritative record: it is the exact bytes the fingerprint is computed over.
- Reproduce the root from the published bytes alone. Run the verifier against the readings file and the published root:
It prints a match and exits cleanly when the reproduced root equals the published root. The verifier is self-contained — Python standard library only, no installs.python verify_clean_anchor.py public_entries.jsonl 699ca7f132679ea95531866b271479124bf6a44d2a25154bdce65ef0f00f0e4b - (Optional) Confirm the construction. Each leaf is SHA-256(0x00 followed by the entry's bytes); each interior node is SHA-256(0x01 followed by the two child hashes). This is the standard RFC 6962 Merkle tree, built over 45 leaves. Because the verifier hashes the published bytes verbatim — it never re-formats the numbers — the result is exact and language-agnostic: a JavaScript, Go, or Rust re-implementation that hashes the same bytes gets the same root.
- Confirm the Bitcoin timestamp. Download clean_genesis_root.ots — the OpenTimestamps proof. The OpenTimestamps proof commits that exact 32-byte root to Bitcoin block 955,461. Look up block 955,461 on any Bitcoin block explorer to see its on-chain timestamp; because the proof commits the root (not the readings file), it shows the root existed on or before that block — it could not have been back-dated. This makes the record tamper-evident against back-dating, in addition to the root reproduction above.
- (Optional) Confirm the readings are real. For any date, compare the published reading to the same row on our live public track record. This is a freshness check, separate from the root reproduction above.
Download the record
- public_entries.jsonl — the published readings (the authoritative record).
- clean_anchor_manifest.json — the frozen facts (root, tree size, checkpoint, source ledger).
- verify_clean_anchor.py — the self-contained verifier (standard library only).
- README.md — the full byte contract and construction, written out.
- clean_genesis_root.ots — the OpenTimestamps proof that commits the frozen root to the Bitcoin blockchain.
What this does and does not show
What it shows: our published readings through June 9, 2026 are fixed and cannot be quietly edited without changing the published fingerprint, and that fingerprint is timestamped on the Bitcoin blockchain — so the record is tamper-evident against back-dating. The procedure is genuinely runnable end to end.
What it does not show: nothing here is a forecast, a recommendation, or investment advice, and it says nothing about future performance. This is research tooling, shown pre-launch.