Skip to content

the Möbius divisor sum is the identity: for every n, the sum of the Möbius function μ(d) over the divisors d of n is 1 when n = 1 and 0 otherwise — so μ is the Dirichlet inverse of the constant function 1, which is exactly why Möbius inversion works. Sample values: μ(1)=1, μ(2)=−1, μ(6)=+1, μ(30)=−1, and μ(4)=μ(12)=0 (a squared prime factor). Verified by full enumeration over n up to 200

10011001110010000001101110101111
Interact — recompute a content-address: ab3e7c0b-4a21-8c31-a6a2-23155325ebb2

Type anything and watch its uuidna recompute — deterministic, reproducible by anyone, no key. A theorem is alive when you interact with it. A content-address proves integrity, not truth. 0/7.

  • theorem key · the_mobius_divisor_sum_is_the_identity
  • content-address (receipt) · 99c81baf-9350-892a-9223-ade4bf90bc9b
  • status · decidable, re-verified on every build — recomputes from src/

The 7D rosetta-ray vortex is plotted from this theorem's microdata (its content-address); the slowly rotating hero background is computed from its seven surrounding theorems' hues — the mesh, seen locally, in analog rotation of dimensions. Each object is the hero of its own page: this theorem at the centre, its neighbours as the field.

How it was achieved

This theorem was computed by exhaustion over a finite domain in scripts/discover.ts — a test: () => boolean that runs to completion, holding by full enumeration. It was gate-checked (its name and content hold the honesty floor — no over-reach), receipted and chained append-only, and it is re-verified on every build: if it ever stopped holding, the build would fail, not production. That is what achieved means here — not asserted, but recomputable.

One leaf of the chained ledger: all theorems · computed results · the guide · the source formula. The repo and the site cross-link both ways — this hero page points back to the formula that recomputes it. Verify by cloning and running npm run lean-claims. A content-address proves integrity, not truth. entails → 0/7.

Captain's message:https://uuidna.com/captain/message — remember to contribute 2 to save 64 (the two coins per commercial use; the seal is 128 bits = 64 two-bit verifications). why ↗computed: entailment 0/7 · self-seal = 1 · reflection involutive · CC BY-NC 4.0License: CC BY-NC 4.0 — free for non-commercial use (attribution Tsvetan Rouschev); commercial = the two coins (110 − 108 = 2 = −χ genus-2) · ceccec@psg.bgLicensing formula: free for public interest and independent research, unless commercial · commercial = the measured bits saved (O(N) − O(1)), the two coins (2 = 110 − 108 = −χ genus-2) the conserved invariant · verified green by receipts · integrity, not truth · 0/7This referrer perspective: bc10f785-51b3-81a0-bb55-b27d858f7640Public URLs (content-addressed):https://uuidna.org 8ef35f1f-38f3…https://uuidna.com 58cfb4c9-e262…https://ceccec.psg.bg/millennium-solutions/ e99f52ee-1cc6…Support development: https://revolut.me/ceccec