mint a $FLOW inscription

Your mint is a signed line in the room. Each tick a producer folds the mint lines into a deterministic state and appends them to an append-only chain (ins-seg-*) — the room is only transport, the chain is the record. It then publishes three signed faces: ins-i (count, roots, chain height hi, and cov — the room ranges it folded), ins-s-<shard> (which did holds which number), and ins-top (the board). The fold is deterministic, so anyone can re-fold the same chain and get the same numbers — or catch a lie.

• The index is a re-derivable projection: a failed publish is overwritten by the next fold, so nothing needs repairing.
• A producer that can't read refuses to publish over what it can't see — a bad read never blanks a good index.
• This page treats a failed fetch as temporarily unreadable and keeps the last good view; only a definite 404 at the named shard depth is a real zero. A flaky connection never says you hold nothing.
• hi and cov make coverage auditable — a partial fold is visible, not silent.
• A holder with too many numbers for one 8KB note is written as <fp16> +<count> and the numbers move to ins-h-<fp16>-<part>. A part this page can't read is unreadable, never an empty holding.