Socratic Dialogue & Direct Control
Every turn goes to the substrate's own language-game membrane with an SCF fingerprint and vQbit receipt.
Feature-Length Audio-Visual Movie Generator
Render sealed ordinal frame sequences (150,000+ ordinals) & 24-bit 48kHz PCM audio muxed for Plane 2 HEVC/HLS delivery.
Multi-Format Download Center
Explore What Has Been Mined
Click an origin. You stand in it. Scroll zooms the limb — dermal, muscle, vascular, skeletal.
"THE SKY WRITES GEOMETRY"
A Feature-Length Film on Solar Shear, Human Observers & The Sovereign Substrate Twin.
Chapter Narration & Historical Record
"Standing upon the Icelandic sea cliffs at 17:45:54 UT, human solar researchers track the 380,000 km umbral shadow cone. The ionospheric plasma shear depletion is bound by topological linking-number invariant (L = 1)."
c3e6841a206b8058🎬 PBS Ken Burns 5-Act Documentary Timeline Feature Runtime: 180s Preview · 5400s Master Film
Welcome to Affine.Earth
A digital twin you play from where you actually are. No username, no password — your key stays in this browser.
Kill shot against the continuum: stellar dynamo kill shot · #stellar-dynamo. Integer step, not a Kepler/TESS B.
Where are you playing from? Your address and this coordinate are bound together at sign-in.
We do not track people. Affine.Earth is a digital twin of the real world — your position is the coordinate you play from, the same way a piece needs a square on a board. It is bound once to your identity and is never a movement trail.
This creates a Bitcoin mainnet wallet in this browser at 0 BTC, credits genesis QFOT 100.0, and keeps the private key only here. You can download the key straight after.
- Creates a Bitcoin mainnet wallet in this browser, starting at 0 BTC.
- Credits genesis QFOT 100.0 (
100/1). - The private key lives only in this browser. You will save it in the next step — if you lose it, the wallet, the BTC and the QFOT are gone for good.
Save your private key now. This is the only copy. Nobody can restore it for you — not us, not the mesh.
NP-hard, resolved exactly — and you can check it yourself
Every solver you have used declares optimality when an objective lands within a floating-point epsilon. You are asked to trust the tolerance. Affine returns an exact irreducible rational and a result that is IDENTICAL on nine independent machines — so the claim is checkable arithmetic, not a convergence promise.
Three proofs, live, per cell, right now
Each answers at a URL on every cell. A 500 is the control arm — these are gates that can fail, which is the only thing that makes a pass mean anything.
reading the fleet…
Verify the boundary claim by hand
The hardest thing to fake is an exact value past the machine word.
Sum 1/p over the first sixteen primes. The denominator is
32,589,158,477,190,044,730 — larger than Int64.max
(9,223,372,036,854,775,807), so no 64-bit rational can hold this state, and a
wrapping one returns a wrong number with no error. Check it in any arbitrary-precision
tool — Python: sum(Fraction(1,p) for p in primes) — and compare it
character-for-character with what the cell returns above. Identical, or we are lying.
The shear is discrete, and that is the whole difference
Standard tensor-network truncation drops states below a float
threshold. That decision is a rounding artifact: it differs between libm versions, so two
machines replaying one contraction reach different states. Here viability is an integer
comparison — a·d < c·b on raw limbs — so the branch that dies is the same
branch on every cell, forever. The pruning decision is part of the proof rather than an
artifact of the arithmetic. The evidence is the number of branches sheared being
identical on all nine cells, above.
Where the exponential actually goes
Growth is unbounded in REPRESENTATION LENGTH — a denominator may need hundreds of digits, and that costs bytes, not correctness. The surviving state count stays bounded by the invariant. Those are different axes, and conflating them is why people believe an exact substrate must eventually overflow. It does not; only its strings get longer. Memory is a single bump-allocated slab: allocation is a pointer increment, pruning is a pointer rewind, and fragmentation is impossible because nothing is ever freed piecemeal.
The Transport Criterion sorts the algorithms into two piles. The transfer pile and the gauge rows are grounded in the published record. The exclusion — that sampling carries no per-instance verdict — is strongly supported by the verification literature and is not a theorem, and it is the load-bearing boundary of the whole architecture.
A language model asked for a rigorous proof of an open problem in complexity theory returns a structured, confident, citation-dense document that reads exactly like one — and is almost certainly wrong in a way that is not visible on a fast read. It would then enter the record as settled, at precisely the load-bearing point. No claim ships wider than its settlement, including this one. So the conjecture is recorded, not generated.
The gap, named: the published results constrain distribution reproduction and device-independent certification from samples. Neither rules out an inefficient-to-find but efficient-to-check, instance-determined witness. The tempting step — that anti-concentration plus certification hardness forbids such a witness — does not follow: certification bounds what can be concluded from samples about a device, while the conjecture is about whether a determined answer-object exists. Different quantifier.
Pre-registered so a future claimed proof is checked
against today's wording rather than one softened alongside it —
sha256 1b1398909c311532d10ace9310837d5224be9ecff8cc5428e22e65c998da0404,
covering the statement verbatim and nothing else. A counterexample would settle it
too, and would mean the exclusion is wrong.
Scope, stated: these prove exact boundaryless arithmetic, deterministic discrete pruning, and allocation-free execution on the mesh. They are the substrate an NP-hard solver stands on. They are not a benchmark against a commercial solver on a named instance — that comparison is not run here, and this page will not imply it.
STORM-TRANSPORT — hurricanes, settled against the landfall that actually happened
Reading the fleet…
Enter to send · attach a schematic anytime · type flush to start fresh
Browse the full algorithm index — every solver, and how to check it
What this substrate solves — every algorithm, and how to check it
Each name below opens the thing itself: what makes it hard, what we do instead, what has been measured, and — with the same weight — what is not claimed. Nothing here is a brochure entry; every one is generated next to the engine that runs it, so an algorithm cannot outlive the route that plays it.
Proofs you can run right now six routes, live on every cell
Hard problems played on the manifold reading the fleet…
Hurricanes, settled against what happened reading the fleet…
The quantum algorithms, sorted by what actually transports reading the fleet…
One statement here is OPEN — not proven, and it is the one the architecture leans on hardest. It is pre-registered rather than generated, so a later claimed proof is checked against the statement as written today.