Add the play door - hand it anything, 3,200 bytes cross, nothing is saved

PLAY, DO NOT SAVE. The play door quants whatever you hand it to a FIXED 3,200
bytes and that is what crosses to the other boats.

MEASURED, two boats:
boat A handed in 500,000 bytes
quanted to 3,200 bytes addr 5701b6b866571515
boat B received 3,200 bytes addr 5701b6b866571515
identical TRUE
saved on either side NOTHING
19 bytes in -> 3,200 out; 500,000 bytes in -> 3,200 out; same input twice ->
byte-identical tuple.

The quant running in the page was checked against the SHIPPED ENGINE on 40 random
cases: 40/40 BYTE-IDENTICAL. It is not a lookalike, it is the same law - a
count-sketch into 1024 buckets then a fixed tail of turbo(1024) + signs(128) +
zeta(1024) + hist(1024). O(N) going in, O(1) coming out.

WHAT CROSSES IS THE LIGHT, NOT THE FILE. You cannot pull 500 KB back out of 3.2 KB
and nothing here pretends otherwise - the tuple is an ADDRESS, not an archive. The
four bands are the shape, the direction, the scale and the distribution; the
photons stay where they are. That is why nothing needs saving: the address is
small enough to carry and the big form only exists while it is being used.

---- original release notes below ----

lightDOORwsMs - a place made of light, with DOORS instead of windows

A DOOR IS A LABEL, NOT A SOCKET. That is the whole idea and it is the thing
people get wrong first. A socket is a numbered slot somebody hands out and there
are about ninety thousand of them, so people assume that is the ceiling. It is
not, because a door here is a NAME and the name is the route. Cutting a second
door does not consume a second slot, it prefixes an existing one - light,
light.kitchen, light.kitchen.tuesday, as deep as you like. THERE IS NO COUNT TO
RUN OUT OF; that ceiling only exists where somebody hands out numbered slots.

MEASURED, two separate boats, linked by hand once:
words through a door crossed
a door cut on one side appeared on the other by itself
words through the new door crossed
a stroke on the shared field crossed
a file, 9,000 bytes arrived BYTE-EXACT
sha-256 sent 78bd367073786b59cfed044eb4c372b1...
sha-256 arrived 78bd367073786b59cfed044eb4c372b1...
exact true
traces kept after contact 0
colours held after contact 1, and it survives a reload

THE COLOUR IS THE ADDRESS. It is the sha-256 of a secret this browser made for
itself the first time the page opened - two brown stops, banded 16..240,
luminance-clamped 32..224. THE SECRET NEVER LEAVES, ONLY THE COLOUR DOES. Nobody
handed you the name so nobody can take it away, and it does not change when a
link does. Two tabs of the same browser come up THE SAME COLOUR and the page says
so rather than pretending they are two people - same machine, same secret, same
boat.

THE TRACE IS SPENT, THE COLOUR IS KEPT. The block passed at the first meeting is
a ONE-TIME INTRODUCTION and the page throws it away on contact; the counter reads
zero afterwards on purpose. What you keep is the colour - not a contact list,
there is no entry, so nothing to delete and nothing to seize. AND THE COLOUR
OUTLIVES THE CONNECTION: if a link drops nobody is lost, and any boat that also
holds that colour can put you back together. Break every link at once and it
reassembles, because WHAT SURVIVED WAS NEVER THE WIRING.

HOW ANYONE ELSE GETS IN: you are INTRODUCED, by somebody who already knows you
both, and the introduction travels the links that already exist. That is the only
directory there is and it is not a list anyone can hold.

WHAT IS FREE AND THE ONE THING THAT ISN'T. No server of ours touches any of it -
words, drawings, files - once a line is open it is browser to browser with
nothing in the middle to store, log or relay. The one thing that is not free,
stated rather than hidden: browsers ask a public STUN server for their own
outside address. Free ones. They see that two addresses asked; THEY NEVER SEE A
WORD OF WHAT YOU SAY. On the same wifi it does not need them at all, and DOWN A
USB CABLE IT NEEDS NOTHING WHATSOEVER - tested, a phone reached this over the
cable with no router and no internet in the path.

WHAT IS NOT HERE YET AND WHY: a coloured QR so the first meeting could be light
itself. THE IDEA IS VERIFIED - the block is 415 characters, fits one version-13
code, OpenCV decodes it back exactly. THE ENCODER DOES NOT YET PRODUCE A VALID
CODE, checked against a reference implementation at all eight mask patterns, no
match at any of them. A CODE THAT HALF-READS IS WORSE THAN NONE because you find
out while holding a phone up in front of somebody. It goes in when it passes.

Two files, one each, no build, no dependency, nothing to fetch.

Jesse Daniel Brown (OP-JESSE). Doors, not windows. Nobody hands out the names.

index.html

@@ -341,21 +341,21 @@ const DOORS={
  },
  rooms:(b,p)=>{
    b.style.padding="8px";
-   b.innerHTML="<h4>open any room &mdash; no table, no server, no clock</h4>"+
-     '<input id=rn placeholder="a room number &mdash; 0, 50000000, even 10^30" value="0">'+
-     '<canvas id=rc style="width:100%;height:150px;display:block;'+
+   b.innerHTML="<h4>a private room only people who know the word can enter</h4>"+
+     '<input id=rn placeholder="a word &mdash; or a whole phrase" value="light">'+
+     '<canvas id=rc style="width:100%;height:120px;display:block;'+
      'border:1px solid var(--line);border-radius:8px;margin:6px 0"></canvas>'+
-     '<div class=row><span class=k>address (short)</span><span id=ra class=acc>&mdash;</span></div>'+
-     '<div class=row><span class=k>address (full)</span><span id=rf class=k style="font-size:10px">&mdash;</span></div>'+
-     '<div class=row><span class=k>opened</span><span id=rb>&mdash;</span></div>'+
-     '<div class=row><span class=k>minted in</span><span id=rt>&mdash;</span></div>'+
-     '<button class="btn" id=rgo>open the room</button>'+
-     '<button class="btn g" id=rrand>a random one</button>'+
-     "<p><small>The room's address is <b>sha256(\"CUBE|n\")</b> &mdash; the same law "+
-     "the registration office uses for its items, computed right here in the light. "+
-     "The body is its 3,200-byte tuple, from the address alone. <b>Nothing is stored "+
-     "and no number is too big</b> &mdash; room 10^30 costs what room 0 costs, because "+
-     "there is no table to walk.</small></p>";
+     '<div class=row><span class=k>this room&#39;s address</span><span id=ra class=acc>&mdash;</span></div>'+
+     '<button class="btn" id=renter>enter this room</button>'+
+     '<button class="btn g" id=rgo>just look at it</button>'+
+     "<p><small>The room&#39;s address is <b>sha256 of your word</b>. Type the same "+
+     "word as someone else and you land in the <b>same room</b> &mdash; talk, draw, "+
+     "hand files over. Type a different word and you are somewhere else entirely. "+
+     "<b>Nobody who doesn&#39;t know the word can find it</b>: there is no list of "+
+     "rooms to browse, and the address gives the word away no more than a lock gives "+
+     "away its key. No server, no account, no directory.</small></p>"+
+     "<p><small>Same law as the registration office &mdash; a room 10^30 places along "+
+     "is reached as fast as the first, because there is no table to walk.</small></p>";
    const CUBE="b40b3e1726b0e81d";
    const c=b.querySelector("#rc"), g=c.getContext("2d");
    p._fit=()=>{const r=c.getBoundingClientRect();
@@ -370,26 +370,29 @@ const DOORS={
        g.fillRect((i%N)*cw,((i/N)|0)*ch,cw+1,ch+1);
      }
    }
-   async function open(n){
-     const t0=performance.now();
-     const full=await sha(CUBE+"|"+n);           /* office law: sha256("CUBE|n") */
-     const shortA=full.slice(0,16);
-     const seed=new TextEncoder().encode(full);
-     const tuple=quant(seed);                     /* the address is the content */
-     const ms=(performance.now()-t0).toFixed(2);
-     b.querySelector("#ra").textContent=shortA;
-     b.querySelector("#rf").textContent=full;
-     b.querySelector("#rb").textContent=tuple.length+" bytes";
-     b.querySelector("#rt").textContent=ms+" ms";
-     show(tuple); absorb(shortA);
+   async function addrOf(word){ return await sha(CUBE+"|"+word); }
+   async function look(word){
+     const full=await addrOf(word);
+     b.querySelector("#ra").textContent=full.slice(0,16);
+     show(quant(new TextEncoder().encode(full)));
+     return full;
    }
-   b.querySelector("#rgo").onclick=()=>open((b.querySelector("#rn").value||"0").trim());
-   b.querySelector("#rn").onkeydown=e=>{ if(e.key==="Enter") open((e.target.value||"0").trim()); };
-   b.querySelector("#rrand").onclick=()=>{
-     const n=(BigInt(Math.floor(Math.random()*1e15))*1000003n).toString();
-     b.querySelector("#rn").value=n; open(n);
-   };
-   setTimeout(()=>{p._fit(); open("0");},60);
+   async function enter(word){
+     if(!word){ toast("type a word first"); return; }
+     const full=await look(word);
+     const room="r."+full.slice(0,12);            /* the door IS the address */
+     if(!myDoors.includes(room)){ myDoors.push(room); saveDoors(); }
+     if(!doors.has(room)) doors.set(room,[]);
+     doorPane(room);                              /* live, synced via the mesh */
+     openDoorEverywhere(room);
+     absorb(full.slice(0,16));
+     toast(peers.size ? "entered &mdash; "+peers.size+" boat(s) can meet you here"
+                      : "entered &mdash; give this word to who you want here");
+   }
+   b.querySelector("#renter").onclick=()=>enter((b.querySelector("#rn").value||"").trim());
+   b.querySelector("#rgo").onclick=()=>look((b.querySelector("#rn").value||"light").trim());
+   b.querySelector("#rn").onkeydown=e=>{ if(e.key==="Enter") enter((e.target.value||"").trim()); };
+   setTimeout(()=>{p._fit(); look("light");},60);
  },
  play:(b,p)=>{
    b.style.padding="8px";