Answer the referee report and clarify the paper: notation, an example, a conclusion and the organism's records

Put the organism first and move serialization, sizes and the Rocq map to appendices

Prove the paper's counts, levelization, depth bounds, recipe lengths and Section 6 in Rocq, and revise the paper

Replace the two-bank machine with a K-bank ring, prove its reproduction in Rocq, and revise the paper

Prove in Rocq that the host family computes SUBLEQ at every word width, check the stored host's startup and step records on decision diagrams, state the stored-host theorems for every stored host with their overhead, bound self-reproduction under noise, remove the neuromorphic mappings, and cut the paper to 30 pages

Consolidate the Python sources into twelve files with one-line docstrings, fold the demos into the playground, and delete the scripts that do not belong to the artifact

Rerun every result on the constant-depth host, add the amplified host with its fault-tolerance theorem and runs, the orbit certificate and the literature on growth, and cut the paper to 35 pages

threshold-computers: a family of machines built from ternary threshold gates, with the paper on universal construction and exact self-reproduction