Skip to content

Poincaré — one closed loop, no holes

10001100101001000000011010110100
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 · poincare_single_closed_loop
  • content-address (receipt) · 8ca406b4-e588-8063-81cc-375d2788644f
  • status · decidable, re-verified on every build — recomputes from src/
  • entails · 0/7

Statement — Lean 4 (machine-checked, axiom-free)

The Clay problem Poincaré Conjecture (resolved), to the honest floor. The statement below is a true fact computed from the ℤ/9 doubling sequence — genuinely adjacent to the problem, and not the conjecture.

theorem poincare_single_closed_loop :
  orbit 6 == orbit 0
  ∧ (List.range 6).all (fun i => (List.range 6).all (fun j => (orbit i == orbit j) == (i == j))) := by decide

Verified sorry-free by lean src/proof/index.lean; #print axioms poincare_single_closed_loopdoes not depend on any axioms. No Mathlib, no native_decide, no sorry.

Honest bound. the sequence closes into a single simple loop of six distinct steps — not the 3-sphere characterization; Poincaré is Perelman's theorem (2003), not proved here — this framework proves 0 of the 7 (provenHere = 0).

References — qualified outlets

A content-address proves integrity, not truth. entails → 0/7.

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.

Captain's message:https://uuidna.com/captain/message — free on the free sailing angle; prize earning in waves — contribute 2 to earn up to 64 per wave, keep the rest (the two coins per commercial use; the seal is 128 bits = 64 two-bit fold-verifications, O(log N)). Contribute: · why ↗computed: entailment 0/7 · self-seal = 1 · reflection involutive · CC BY-NC-ND 4.0License: CC BY-NC-ND 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: 4f971038-bd72-8b10-9135-337ef59dc2b7Public 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