| <meta charset="utf-8"> |
| <title>The Identity Kernel Registry</title> |
| <style> |
| :root{--bg:#06060a;--fg:#eaeaf2;--dim:#7a7a8c;--line:#181820;--acc:#a78bfa;--ok:#4ade80;--bad:#ff5f6d} |
| *{box-sizing:border-box} |
| body{margin:0;background:var(--bg);color:var(--fg);padding:26px; |
| font:14px/1.62 ui-monospace,"SF Mono",Menlo,Consolas,monospace} |
| h1{font-size:21px;margin:0 0 5px;color:var(--acc)} |
| h2{font-size:11px;text-transform:uppercase;letter-spacing:1.6px;color:var(--acc); |
| margin:28px 0 8px;font-weight:600} |
| .sub{color:var(--dim);max-width:80ch;margin-bottom:18px} |
| button{background:var(--acc);color:#0b0b10;border:0;border-radius:7px; |
| padding:14px 30px;font:600 15px ui-monospace,monospace;cursor:pointer} |
| button:hover{filter:brightness(1.12)} button:disabled{opacity:.45} |
| .card{border:1px solid var(--line);border-radius:10px;padding:14px 16px;margin:9px 0; |
| background:#0b0b12;overflow-x:auto} |
| table{border-collapse:collapse;width:100%;font-variant-numeric:tabular-nums} |
| th{text-align:right;color:var(--dim);font-weight:500;padding:5px 10px; |
| border-bottom:1px solid var(--line);font-size:12px} |
| th:first-child,td:first-child{text-align:left} |
| td{padding:3.5px 10px;text-align:right} |
| .ok{color:var(--ok)} .bad{color:var(--bad)} .acc{color:var(--acc)} |
| .note{color:var(--dim);margin:9px 0} |
| .verdict{font-size:16px;font-weight:700;padding:15px;border-radius:9px;text-align:center; |
| margin:20px 0;border:1px solid rgba(74,222,128,.5);background:rgba(74,222,128,.08);color:var(--ok)} |
| footer{margin-top:40px;color:var(--dim);font-size:12px;border-top:1px solid var(--line); |
| padding-top:15px;max-width:86ch} |
| code{color:#e0b080} |
| </style> |
|
|
| <h1>The Identity Kernel Registry</h1> |
| <div class="sub"> |
| <b>A constraint is something you test. An identity is something you cannot violate.</b><br> |
| There is no state in which an identity is false — so there is nothing to check at |
| runtime, nothing to invalidate, and nothing to fix. <b>You do not fix these kernels. |
| You reuse them.</b> The verification below runs once, as a courtesy to a sceptic. |
| </div> |
|
|
| <button id="go">VERIFY ONCE</button> |
| <div id="out"></div> |
|
|
| <footer> |
| <b>Jesse Daniel Brown (OP-JESSE)</b> — the system, the laws, the architecture.<br> |
| Compute once · reuse at every level · never fix. |
| </footer> |
|
|
| <script> |
| const out=document.getElementById("out"); |
| const H=s=>{const d=document.createElement("h2");d.textContent=s;out.append(d);}; |
| const CARD=()=>{const d=document.createElement("div");d.className="card";out.append(d);return d;}; |
| const NOTE=(c,h)=>{const d=document.createElement("div");d.className="note";d.innerHTML=h;c.append(d);}; |
| |
| const K=[ |
| ["closure","(2a−b−c)+(2b−a−c)+(2c−a−b) = 0", |
| "coefficients 2,−1,−1 sum to 0",(a,b,c)=>(2*a-b-c)+(2*b-a-c)+(2*c-a-b)], |
| ["free_centre","arm(a+t,b+t,c+t) − arm(a,b,c) = 0", |
| "affine: a uniform shift annihilates",(a,b,c)=>(2*(a+97)-(b+97)-(c+97))-(2*a-b-c)], |
| ["triangle_price","(Li−Lj)+(Lj−Lk)+(Lk−Li) = 0", |
| "each level appears once with each sign",(a,b,c)=>(a-b)+(b-c)+(c-a)], |
| ["anti_order_three","anti³(x) − x = 0", |
| "cyclic rotation of three has order 3, not 2", |
| (a,b,c)=>{let t=[a,b,c];for(let i=0;i<3;i++)t=[t[2],t[0],t[1]];return t[0]-a;}], |
| ["residual_thirds","arm₃ + arm₁ + arm₂ = 0", |
| "given two arms the third is determined",(a,b,c)=>(2*c-a-b)+((2*a-b-c)+(2*b-a-c))], |
| ]; |
| |
| const sha=async s=>[...new Uint8Array(await crypto.subtle.digest("SHA-256", |
| new TextEncoder().encode(s)))].map(x=>x.toString(16).padStart(2,"0")).join(""); |
| |
| document.getElementById("go").onclick=async e=>{ |
| e.target.disabled=true;e.target.textContent="VERIFYING…";out.innerHTML=""; |
| await new Promise(r=>setTimeout(r,20)); |
| |
| H("registered kernels — verified once, hashed, never checked again"); |
| let c=CARD(), t=document.createElement("table"); |
| t.innerHTML="<tr><th>kernel</th><th>statement</th><th>cases</th><th>fails</th><th>sha256[:16]</th></tr>"; |
| let total=0,fails=0; |
| for(const [name,stmt,proof,fn] of K){ |
| let bad=0,n=0; |
| for(let a=-6;a<=6;a++)for(let b=-6;b<=6;b++)for(let d=-6;d<=6;d++){ |
| n++; if(fn(a,b,d)!==0) bad++; |
| } |
| total+=n; fails+=bad; |
| const h=(await sha("IDK|"+name+"|"+stmt)).slice(0,16); |
| t.innerHTML+="<tr><td class='acc'>"+name+"</td><td style='text-align:left'>"+stmt+ |
| "</td><td>"+n.toLocaleString()+"</td><td class='"+(bad?"bad":"ok")+"'>"+bad+ |
| "</td><td>"+h+"</td></tr>"; |
| await new Promise(r=>setTimeout(r,0)); |
| } |
| c.append(t); |
| NOTE(c,"<b>"+K.length+" kernels · "+total.toLocaleString()+" cases · <span class='"+ |
| (fails?"bad":"ok")+"'>"+fails+" failures</span></b><br>"+ |
| "invalidation paths <b class='ok'>0</b> · runtime checks required <b class='ok'>0</b>"); |
| |
| H("composition — identities are closed under it"); |
| c=CARD(); |
| NOTE(c,"Compose N kernels at random. The result is still an identity, at any depth, "+ |
| "<b>with no re-verification anywhere in the chain</b>."); |
| t=document.createElement("table"); |
| t.innerHTML="<tr><th>depth</th><th>compositions</th><th>non-zero</th></tr>"; |
| let allOk=true; |
| let s=20260801; const rnd=()=>{s=(s*1103515245+12345)&0x7fffffff;return s;}; |
| for(const depth of [2,3,8,27,81,243]){ |
| let bad=0; |
| for(let k=0;k<300;k++){ |
| let a=rnd()%1999-999,b=rnd()%1999-999,d=rnd()%1999-999,acc=0; |
| for(let i=0;i<depth;i++){ |
| acc+=(2*a-b-d)+(2*b-a-d)+(2*d-a-b); |
| const tt=rnd()%2000001-1000000; |
| a+=tt;b+=tt;d+=tt; |
| acc+=(a-b)+(b-d)+(d-a); |
| } |
| if(acc!==0)bad++; |
| } |
| if(bad)allOk=false; |
| t.innerHTML+="<tr><td>"+depth+"</td><td>300</td><td class='"+(bad?"bad":"ok")+ |
| "'>"+bad+"</td></tr>"; |
| await new Promise(r=>setTimeout(r,0)); |
| } |
| c.append(t); |
| |
| H("the observer is 0 — three references fix him at one"); |
| c=CARD(); |
| NOTE(c,"<code>ONE reference a circle infinitely many points</code><br>"+ |
| "<code>TWO references two circles 2 candidates — ambiguous</code><br>"+ |
| "<code>THREE references one intersection resolved</code><br><br>"+ |
| "<b>Trilateration is the closure, inverted.</b><br>"+ |
| "<code>closure the centre is free → the three arms are determined</code><br>"+ |
| "<code>trilateration three are known → the centre is determined at one</code><br><br>"+ |
| "Three is not a preference. It is the minimum that resolves an observer. GPS uses "+ |
| "three for position — the fourth satellite is the clock, not the geometry."); |
| |
| const v=document.createElement("div"); |
| v.className="verdict"; |
| v.textContent=(fails===0&&allOk) |
| ? "ALL IDENTITIES HOLD — 0 invalidation paths, 0 runtime checks required" |
| : "ATTENTION — something failed; read the rows above"; |
| out.append(v); |
| e.target.textContent="VERIFY AGAIN";e.target.disabled=false; |
| }; |
| </script> |
| |
| |
| |
| |
| |
| |
| |
| <nav id="corridor" style="margin:3rem auto 2rem;max-width:60rem;padding:1.25rem 1.5rem;border-top:1px solid currentColor;font:14px/1.9 ui-monospace,SFMono-Regular,Menlo,monospace;opacity:.85"> |
| <div style="letter-spacing:.14em;text-transform:uppercase;opacity:.6;margin-bottom:.75rem">the corridor — 27 doors</div> |
| <div style="display:grid;grid-template-columns:repeat(auto-fill,minmax(17rem,1fr));gap:.15rem .75rem"> |
| <a href="https://jessebrown1980.github.io/all-the-doors/">all the doors</a> |
| <a href="https://jessebrown1980.github.io/asolaria-multiverse/">asolaria multiverse</a> |
| <a href="https://jessebrown1980.github.io/Be-infinitly-express-spherically-free/">Be infinitly express spherically free</a> |
| <a href="https://jessebrown1980.github.io/Browns-infinite-play-and-zoom/">Browns infinite play and zoom</a> |
| <a href="https://jessebrown1980.github.io/does-2-to-the-n-always-contain-a-digit-2-in-base-3/">does 2 to the n always contain a digit 2 in base 3</a> |
| <a href="https://jessebrown1980.github.io/does-the-closure-survive-81-levels/">does the closure survive 81 levels</a> |
| <a href="https://jessebrown1980.github.io/free-at-all-levels/">free at all levels</a> |
| <a href="https://jessebrown1980.github.io/Higgs-Bell-Hilbert-and-Brown-at-the-zero/">Higgs Bell Hilbert and Brown at the zero</a> |
| <a href="https://jessebrown1980.github.io/identity-kernel-registry/">identity kernel registry</a> |
| <a href="https://jessebrown1980.github.io/light-boat-engine-ships-with-oils/">light boat engine ships with oils</a> |
| <a href="https://jessebrown1980.github.io/lightDOORwsMs/">lightDOORwsMs</a> |
| <a href="https://jessebrown1980.github.io/one-click/">one click</a> |
| <a href="https://jessebrown1980.github.io/see-her-anywhere-so-not-lost-to-time/">see her anywhere so not lost to time</a> |
| <a href="https://jessebrown1980.github.io/the-bridge-you-need-three-languages/">the bridge you need three languages</a> |
| <a href="https://jessebrown1980.github.io/The-Brown-Light-erdos-Engine-block-powered-by-light/">The Brown Light erdos Engine block powered by light</a> |
| <a href="https://jessebrown1980.github.io/the-browns-solution-to-erods-o0O-nx3-6-for-1-with--1-3/">the browns solution to erods o0O nx3 6 for 1 with 1 3</a> |
| <a href="https://jessebrown1980.github.io/the-colour-qr/">the colour qr</a> |
| <a href="https://jessebrown1980.github.io/the-family-of-verses/">the family of verses</a> |
| <a href="https://jessebrown1980.github.io/the-human-based-understanding/">the human based understanding</a> |
| <a href="https://jessebrown1980.github.io/the-law-of-space-and-light-and-color-and-travel-at-the-speed-of-one/">the law of space and light and color and travel at the speed of one</a> |
| <a href="https://jessebrown1980.github.io/the-light-boat/">the light boat</a> |
| <a href="https://jessebrown1980.github.io/the-light-hub-http-0/">the light hub http 0</a> |
| <a href="https://jessebrown1980.github.io/the-null-space-or-NO-jo0O/">the null space or NO jo0O</a> |
| <a href="https://jessebrown1980.github.io/the-zebras-z-is-the-squared-wave/">the zebras z is the squared wave</a> |
| <a href="https://jessebrown1980.github.io/tribute-three-around-a-free-centre/">tribute three around a free centre</a> |
| <a href="https://jessebrown1980.github.io/two-fixed-points-have-an-interval/">two fixed points have an interval</a> |
| <a href="https://jessebrown1980.github.io/why-mycelium-grounded-and-the-ases/">why mycelium grounded and the ases</a> |
| </div> |
| <div style="margin-top:1rem;opacity:.5;font-size:12px">the light is the code. every door open, every door reachable.</div> |
| </nav> |
|
|
