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

Give the author as Charles C. Norton in the paper and the citation entry

Prove Lemma 3.3 in Rocq, shorten the abstract, and set the paper in the format of the Stellarocq paper

Prove the folded host of Remark 3.9 and Lemmas 8.1 and 8.2 in Rocq, and revise the paper

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

Prove the stored host's construction, copies, period and network in Rocq for every word width, give each unit its own window cell, and revise Section 8 with the new records

Break the paper's dense paragraphs into shorter ones, add the s = 0.20 row to the deviation table, and describe the ring machine's commands in the paper README

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

Prove self-reproduction by the dynamics for the stored host of every word width, with a sign-extending device read and the record count in closed form, check the stored hosts of widths 9 and 10 symbolically and on random states, check the extracted host family for widths 8 to 10, and remove the to-do note

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

Store the host in a two-head machine of 4096 cells so that it reproduces itself by the dynamics, prove the machine's netlist for every window size, add figures and the layouts behind the digests, and remove the interpreter tower and the verification tiers

Remove the scripts and records of the results cut from the paper: the organism on the record interpreter, tapes that are not recipes, order-independent settling and the dependence hypothesis

Replace the interpreter sections with the two-head machine and translating organism proved in Rocq, prove the hosted constructor in full, compute the restoration bound in C, add independent reproductions of the paper's constructions and measurements, and cut the paper to 36 pages

Compute the restoration bound along the orbit from each row's margin and push direction, with its Table 7 column and whole-run figures

Add the restoration bound for the amplified host with its proof, the batched failure-rate runs that test it, and the per-step table

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