Remark: A full supplied event circuit

Any separately specified finite source circuit $U_{\mathrm{code}}$ with $k$ local code/history/work carriers and $G$ gates can replace this restriction. Co-locate its carriers at $A$ and give each gate a positive duration $1/(16(G+4))$ in the buffer below. This localizes the supplied finite map; it does not prove an unsupplied decoder theorem or its forward promise. The explicitly proved numerical ledger below concerns (eq:event-code).