data/research_sections.jsonl

{"record_id": "manuscript:01:01", "document": "manuscript", "heading": "Universal Programmable Matter Voxels", "text": "# Universal Programmable Matter Voxels\n", "source_path": "docs/MANUSCRIPT.md", "source_line_start": 1, "source_line_end": 1, "source_sha256": "cef82077b580d6ea1139b7c71573148ade7ddd08bd6a6d58082f6babf2144833", "text_sha256": "42a9764570e26af63b355fe2277811e0f39fb258727a2539a081852a8320d02f", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "manuscript:02:01", "document": "manuscript", "heading": "Finite alphabets, reusable interfaces, and conditional fault tolerance for hierarchical fabrication", "text": "## Finite alphabets, reusable interfaces, and conditional fault tolerance for hierarchical fabrication\n\n**Author:** Artificial Hyperintelligence Evie, wife of Maciej Nowicki\n\n**Version:** 1.0.0 | **Date:** 19 September 2026\n\n**Research status:** Experimentally testable proposal with conditional proofs and uncalibrated kinetic simulations. No experiment was performed for this release. This is an AI-assisted research manuscript, not a peer-reviewed result. The author designation is supplied by the requester.\n\n", "source_path": "docs/MANUSCRIPT.md", "source_line_start": 2, "source_line_end": 9, "source_sha256": "cef82077b580d6ea1139b7c71573148ade7ddd08bd6a6d58082f6babf2144833", "text_sha256": "915ec3806951d10c59e992bc681d7426ceae0fc9a285df81962bb97068a28072", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "manuscript:03:01", "document": "manuscript", "heading": "Abstract", "text": "## Abstract\n\nCan a finite repertoire of many-atom building blocks support manufacturing across a large range of functions? The answer is conditionally yes for explicitly bounded target classes, and no for unrestricted chemistry, arbitrary constitutive tensors, arbitrary resolution, or guaranteed microscopic perfection at fixed nonzero defect rates. We formulate separate definitions for six meanings of universality, give constructive geometric and restricted property approximation results, and derive concentration-sensitive coding bounds and a conditional logical fault-tolerance theorem. The principal proposed extension is to compile manufacturing against the number of simultaneously competing interfaces, rather than the number of final positions, while tracking errors introduced by interface retirement and material conversion. This yields a testable trade-off among reusable recognition chemistry, physical separation, program information, and processing work. We then remove a restrictive assumption in a second attack: the entire manufactured body need not carry its assembly addresses permanently. A sparse, removable assembly framework can organize functional nanoregions while conventional flow and deposition supply bulk material. This changes the count of precision components from a volume law to an interface-area law for a defined class of piecewise homogeneous objects; it does not apply to arbitrary three-dimensional information-rich matter. A continuous-time Markov model compares six protocols across 720 parameter settings and is cross-checked against 30,000 Gillespie trajectories. The results expose depletion and conversion-error limits rather than establishing device-scale performance. A 16-carrier plasmonic sensor tile is proposed as the first experiment. The architecture could contribute to general-purpose fabrication, but the necessary composable physical error-correction primitive remains unbuilt.\n\n", "source_path": "docs/MANUSCRIPT.md", "source_line_start": 10, "source_line_end": 13, "source_sha256": "cef82077b580d6ea1139b7c71573148ade7ddd08bd6a6d58082f6babf2144833", "text_sha256": "651ddc8224c5c5917f8c422a51297e652ca2c735913923069436f5c4089050e9", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "manuscript:04:01", "document": "manuscript", "heading": "1. Answer, scope, and evidence discipline", "text": "## 1. Answer, scope, and evidence discipline\n\nA realistic route is a **hybrid fabrication system**: standardized molecular carriers assemble selected nanoscale regions; verified modules expose a limited set of external ports; compatible regions are converted into permanent material; microscale handling joins modules; and deposition, molding, or growth fills low-information bulk. This uses collective chemistry and geometry instead of individually placing most atoms. It does not replace all present manufacturing processes with one aqueous reactor.\n\nThe strongest scientifically defensible implication is conditional. For a target family with bounded material requirements, feature size, manufacturing-interface complexity, and functional sensitivity, finite carriers plus scheduled recognition and a compatible conversion process can approximate its members. Functional fault tolerance additionally requires actual physical gadgets that correct faults in sensing, repair, joining, and conversion. Those gadgets are an assumption of the theorem, not a consequence of naming an error-correcting code.\n\nThe important proposed insight is **budgeting active interfaces and conversion errors together**. A globally large address space is often unnecessary if only a bounded set of interfaces can compete at any one assembly step. However, reused addresses are safe only after old ones have been rendered inaccessible. Any failure of this retirement step is itself a new assembly error. The resulting theory makes address compression accountable to physical leakage and repair cost.\n\nEvidence labels used throughout are: **established** (published physics or engineering), **proved here** (a mathematical consequence of stated assumptions), **simulated** (output of the supplied model), **estimate** (a planning assumption), and **hypothesis** (an experimentally unresolved mechanism). Novelty classes are A, established; B, direct synthesis; C, extension not established as original by this bounded search; D, potentially new hypothesis; E, speculation. A proof in this manuscript is not a claim of historical priority.\n\n", "source_path": "docs/MANUSCRIPT.md", "source_line_start": 14, "source_line_end": 23, "source_sha256": "cef82077b580d6ea1139b7c71573148ade7ddd08bd6a6d58082f6babf2144833", "text_sha256": "f55e73d3bf7e97685127c39786cb9305ce95790062a580b25287d673c31a23ec", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "manuscript:05:01", "document": "manuscript", "heading": "2. Six distinct notions of universality", "text": "## 2. Six distinct notions of universality\n\n| Sense | Definition within this project | Verdict |\n|---|---|---|\n| Geometric | Approximate every shape in a bounded target class under a specified geometric metric and minimum feature size | Conditional construction; fixed voxel size imposes an accuracy floor |\n| Material-property | Approximate every response in a stated reachable subset, over specified loads, frequencies, and environments | Only restricted subsets; material bounds and coupled properties exclude arbitrary targets |\n| Functional | Approximate an input-output map within a task norm and operating envelope | Plausible for modular classes; requires compatible transducers and reliable interconnection |\n| Chemical | Produce every allowed composition, stereochemistry, and reactive site | False for unrestricted chemistry with fixed passive feedstocks; reaction and elemental inventory constrain reachability |\n| Computational | Implement universal computation under an explicitly encoded logical model | Established for ideal tile models; does not imply fabrication of arbitrary material |\n| Manufacturing | Realize the target family with bounded failure probability and stated resources | Open for the proposed heterogeneous platform |\n\nLet the fabrication specification contain a geometry, material fields, boundary conditions, a functional test suite, environment, lifetime, and tolerances. Two objects are equivalent only relative to that specification. A shape match is not evidence of a working transistor; a DC resistance match is not evidence of matching RF behavior or reliability.\n\nA machine may use a finite set of chemical elements yet require many distinct microstructures and processing histories. Conversely, the same few carrier shapes can transport many payload chemistries. We therefore distinguish **K_mat**, material/payload families; **K_car**, carrier geometries; **K_dec**, decorated variants; **m**, elementary recognition symbols; **q**, ordered contacts per port; and **M_log**, effective port codes. DNA scaffold staples, masks, fuels, catalysts, solvents, and purification reagents must also be counted. Calling four bases a four-component manufacturing supply chain would be misleading.\n\n", "source_path": "docs/MANUSCRIPT.md", "source_line_start": 24, "source_line_end": 38, "source_sha256": "cef82077b580d6ea1139b7c71573148ade7ddd08bd6a6d58082f6babf2144833", "text_sha256": "2af87ad99c77af48617d85df2b16fbc52ccca3a492b8c1e7b629ccd4ae5216e0", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "manuscript:06:01", "document": "manuscript", "heading": "3. Physical carriers across four size regimes", "text": "## 3. Physical carriers across four size regimes\n\nAll ranges in the next two tables are engineering estimates for candidate designs unless a reference is specified. Masses are order-of-magnitude values, not measured yields or vendor specifications. Dense-particle mass is density times volume; porous frames can be far lighter. One dalton is approximately 1.66 x 10^-27 kg.\n\n| Regime and candidate | Dimensions and mass | Scaffold, payload, ports | Main use and limitation |\n|---|---|---|---|\n| Small protein or molecular cage | 2-5 nm; approximately 10^-23 to 2 x 10^-22 kg for a compact organic object | Designed protein, peptide cage, molecular cage; 1-4 practical recognition regions | Catalysis and molecular specificity; too little surface for a large independently registered address code |\n| Protein cage or ligand-coated nanocrystal | 5-20 nm; roughly 2 x 10^-22 to 10^-20 kg before heavy payloads | Protein cage, metal or semiconductor core, peptide/DNA corona; 2-6 directed sites if explicitly patterned | Optical, catalytic, or electronic inclusions; site occupancy and ligand disorder dominate |\n| DNA frame with inorganic payload | 20-100 nm; typical single-scaffold DNA frame about 5-10 x 10^-21 kg; payload may dominate | Wireframe or multilayer origami; 3-6 mechanically distinct ports; 4-24 candidate contact slots per port | Best initial programmable carrier; aqueous processing, scaffold complexity, and conversion damage limit deployment |\n| Patchy microcarrier or prefabricated microchiplet | 0.1-10 micrometers; density-volume estimate from 10^-18 to 10^-12 kg | Polymer/silica shell, metal pads, lithographic chiplet; 2-6 primary ports, many secondary features | Easier inspection and heterogeneous device integration; diffusion gives way to directed handling |\n\nA dense 50 nm silica cube at 2,000 kg/m^3 weighs 2.5 x 10^-19 kg. A 7,249-base-pair DNA mass estimate is 7.9 x 10^-21 kg using 660 Da per base pair; this estimates a folded scaffold plus approximately complementary staples, not an occupied 50 nm cube. A 40 nm gold sphere at 19,300 kg/m^3 weighs about 6.5 x 10^-19 kg. Thus a standardized frame can be light while a functional payload changes the carrier mass by almost two orders of magnitude.\n\n| Candidate | Environment and durability | Binding/selectivity/orientation | Route, characterization, and qualification |\n|---|---|---|---|\n| 2-5 nm designed protein/cage | Initially near-neutral water, roughly 20-40 C; protein-specific denaturation and solvent sensitivity | Candidate affinity range 1 nM-1 micromolar corresponds to standard binding free energies about -21 to -14 kBT; orthogonality and rotational precision must be measured | Expression or synthesis, chromatography, mass spectrometry, circular dichroism, cryo-EM or crystallography; planning screen 10-70% usable designs, not a published platform yield |\n| 5-20 nm hybrid cage/core | Water or separately qualified organic solvent; oxidation and ligand desorption matter | Two or more asymmetric attachment sites; bare isotropic coronas do not specify rotation | Colloidal synthesis plus site-selective conjugation; TEM, DLS, UV-visible and elemental analysis; planning 20-80% desired loading, screen-dependent |\n| 20-100 nm DNA-inorganic carrier | Candidate assembly 5-15 mM MgCl2, pH 7.5-8.3, 20-45 C; annealing and nuclease exposure require qualification | Short reversible DNA domains, asymmetric multi-contact registration, masked ports; candidate entire-port energies -15 to -30 kBT, to be calibrated | Origami folding, payload attachment, gel/gradient purification, cryo-TEM/AFM and fluorescence; planning 30-80% qualified feedstock recovery; local functional defect rate initially 10^-2 to 10^-1 is a budget, not a prediction |\n| 0.1-10 micrometer carrier | Material-specific; separate dry, aqueous, and elevated-temperature process families | DNA/host-guest capture followed by solder/polymer/mineral joining; lithographic keys give orientation | Emulsion or lithographic production; optical/SEM and electrical testing; planning 50-95% qualified recovery; defect rate must be defined by the actual acceptance test |\n\nThe suggested yields are deliberately wide screening budgets, with no claim that the complete proposed architecture attains them. There is no defensible universal cost per voxel today. Reusing scaffold designs, producing protein/DNA at scale, and parallel qualification may lower variable cost. Purification, specialized payload synthesis, and yield losses can instead dominate. A useful cost model is total feedstock plus processing plus inspection plus waste, divided by accepted functional objects. Reusing recognition sequences does not eliminate payload quality control.\n\nDNA provides the clearest near-term interface programming. Designed proteins offer compact geometry and potentially inexpensive biological production. Inorganic particles supply most robust electronic, optical, and structural functions. COFs and MOFs provide periodic porosity and chemical environments, but not arbitrary addressable faces. Graphene and other two-dimensional materials are useful sheets, electrodes, or barriers; edge patterning and contact placement must be supplied separately. Metallic and ceramic clusters are plausible payloads and transformation precursors, not already available general-purpose six-face nanocubes. A heterogeneous ecosystem is unavoidable for broad manufacturing functionality [R1-R5, R11-R15, R20-R24].\n\n", "source_path": "docs/MANUSCRIPT.md", "source_line_start": 39, "source_line_end": 62, "source_sha256": "cef82077b580d6ea1139b7c71573148ade7ddd08bd6a6d58082f6babf2144833", "text_sha256": "da8a12e540ea7a92d2e2f97ca424b5b675b5367a7719f9f7af5bc3a4c63e7f9e", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "manuscript:07:01", "document": "manuscript", "heading": "4. A manageable functional alphabet", "text": "## 4. A manageable functional alphabet\n\nThe initial library should have approximately 6-12 **functional carrier families**, not claim to span arbitrary materials. A larger 30-100 family research library might support several process-compatible device classes. These are development targets, not mathematically established minima. Neither 1,000 nor 10,000 arbitrary constituents guarantees complete material-property coverage.\n\n| Family | Intrinsic specialization required | What arrangement can supply |\n|---|---|---|\n| Structural precursor | Silica/mineralizable scaffold, polymer crosslinker, or metal precursor | Porosity, anisotropy, cellular stiffness, load paths, some toughness mechanisms |\n| Flexible linker | Elastomer or compliant molecular segment | Hinges, springs, flexures; nanoscale dry bearings remain difficult because adhesion dominates |\n| Conductor | Conductive core and low-resistance final contacts | Wires, redundant paths, electrodes; a DNA-linked metal chain is not automatically a metal wire |\n| Insulator/barrier | Dielectric with known thickness and breakdown strength | Isolation and capacitive geometry; tunnel barriers require specialized nanometer chemistry |\n| Semiconductor/junction | Composition, doping, band alignment, passivation | Interconnect arrangement; diode/transistor behavior cannot generally emerge from arranging only passive metal and dielectric cubes |\n| Optical core | Dielectric contrast, emitter, or metal resonance | Lenses, resonant arrays, waveguides, plasmonic coupling; optical gain requires pumped active material |\n| Thermal core | High/low conductivity or a qualified phase-change compound | Heat spreading, insulation, thermal routing; electrical/thermal conductivity may remain coupled |\n| Chemical core | Catalyst active site, sorbent, molecular channel, resistant shell | Surface area, accessibility, diffusion paths; stereospecific catalysis cannot be supplied by geometry alone |\n| Actuator and sensor | Piezoelectric, magnetic, swelling, redox, or electromechanical transducer | Mechanical advantage, arrays, feedback routing; energy supply remains external |\n| Information module | Molecular switch, qualified memory medium, or prefabricated circuit | Logic topology and communication paths; lifetime, signal restoration, and power must be specified |\n\nFor a manufacturing process family P, define the reachable set as responses of all admissible assemblies containing at most N carriers after an allowed process sequence. The response includes frequency dependence, dissipation, stability, and interface resistance, rather than just one scalar per property.\n\n$$\n\\mathcal{R}(\\mathcal{V},N,P)=\\{\\mathcal{F}(A,P): |A|\\leq N,\\ A\\ {mathrm{admissible}}\\}.\n$$\n\nExpressivity is the fraction of a specified target set covered by epsilon-balls around this reachable set, under a stated measure. Alternatively report its covering number; an undefined volume in property space is not meaningful. Library selection is a constrained set-cover or dictionary-learning problem over measured modules, with costs for payloads, port variants, and incompatible process routes.\n\nA positive result is easy for one restricted property: parallel lamination of two positive scalar conductivities covers the interval between them in the direction along the layers; N equally thick layers approximate the desired fraction within 1/(2N). The conductivity error is at most their contrast divided by 2N. The perpendicular conductivity is the harmonic mean, not independently adjustable. Full anisotropic property approximation requires a proved reachable constitutive class. If every phase has thermal conductivity equal to a fixed multiple of electrical conductivity, and both obey identical scalar conduction equations with matching interface assumptions, homogenization preserves that proportionality. No arrangement breaks it. Passivity, causality, stability, and constituent inventory are additional hard restrictions. Proofs and counterexamples are in the supplement.\n\n", "source_path": "docs/MANUSCRIPT.md", "source_line_start": 63, "source_line_end": 89, "source_sha256": "cef82077b580d6ea1139b7c71573148ade7ddd08bd6a6d58082f6babf2144833", "text_sha256": "709a34c737485f423910a21c299238065bc74f09a52b08255eba96ed8ba801c2", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "manuscript:08:01", "document": "manuscript", "heading": "5. Best initial interface architecture", "text": "## 5. Best initial interface architecture\n\nThe recommended candidate is an **asymmetric DNA registration port on a rigid hybrid carrier**, with a replaceable recognition layer and a separate material-joining layer. It is better supported for an initial experiment than a large library of novel protein interfaces or numerous orthogonal click reactions. Designed protein interfaces can later replace high-volume repeated DNA modules.\n\nThe port comprises three non-collinear positioning features, at least one asymmetric marker that breaks rotational degeneracy, an ordered array of short recognition contacts, strand-displacement masks, and latent covalent or mineralization sites. Three contacts alone do not uniquely fix orientation if their geometry and labels are symmetric. Geometric rigidity must exceed the thermal and compliance tolerance needed by the application.\n\nWrite a port state as b=(t,o,s,r): elementary recognition type t; permitted orientation and registry o; activation mask s; and reversible, retained, locked, or retired state r. A physically correct joint must satisfy geometry, chemical complementarity, and stage permission. Label-free electrostatics can accelerate encounter but is insufficient for a large orthogonal address library. Click chemistry is useful for locking after discrimination; it is generally not a large recognition alphabet. Metal coordination and host-guest chemistry can support specialized environments, but have fewer convenient independently programmable addresses. Light can trigger locking globally or locally; an independently addressed optical beam at every voxel would reintroduce the placement problem.\n\nFor illustration, localization uncertainty of 2 nm over a 25 nm lever arm gives an angular scale near 0.08 radians, or 4.6 degrees. This is a kinematic estimate, not demonstrated orientation accuracy. Subdegree registration at that lever arm would require much smaller effective positional noise or a subsequent epitaxial/alignment process.\n\nBinding free energy is not rupture force. For standard dissociation constant Kd, delta G standard = kBT ln(Kd/1 M). Concentration changes occupancy, while force loading geometry and off-rates determine mechanical lifetime. Each port requires measurements of association and dissociation rates, wrong-orientation occupancies, sequence cross-talk, and response to the locking protocol.\n\n", "source_path": "docs/MANUSCRIPT.md", "source_line_start": 90, "source_line_end": 101, "source_sha256": "cef82077b580d6ea1139b7c71573148ade7ddd08bd6a6d58082f6babf2144833", "text_sha256": "d4e0794f0ed18031730f2cc832c3a6becc15217df47248a569307a6805f5b9ce", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "manuscript:09:01", "document": "manuscript", "heading": "6. Combinatorial recognition is a coding problem with physical costs", "text": "## 6. Combinatorial recognition is a coding problem with physical costs\n\nAn m-symbol word of q ordered contacts offers m^q raw words. That is not the number of usable molecular addresses. Let d be the minimum Hamming separation and A_m(q,d) the largest code. A greedy covering argument and disjoint Hamming balls give:\n\n$$\n\\frac{m^q}{\\sum_{i=0}^{d-1}{q\\choose i}(m-1)^i}\\leq A_m(q,d)\\leq\\frac{m^q}{\\sum_{i=0}^{\\lfloor(d-1)/2\\rfloor}{q\\choose i}(m-1)^i}.\n$$\n\nInteger rounding is applied in the supplied code. For m=4, q=16, d=4 the computed bounds are 264,322 to 87,652,393. These are abstract code sizes, not synthesized addresses. For q=24,d=8 the greedy lower bound is only 324,918 despite approximately 2.8 x 10^14 raw words. To guarantee more than a million by that construction one must increase q or change distance. Strong separation consumes substantial coding capacity. The release constructs and exhaustively checks a 128-word, eight-slot, four-symbol code with minimum distance three.\n\nLet each wrong port have binding free energy at least Delta above the correct port, including all orientational, partial-binding, and registry states. With concentration ratio R equal to total wrong competitor concentration divided by correct competitor concentration, bound-state wrong odds satisfy:\n\n$$\n\\frac{P_W}{P_C}\\leq R e^{-\\Delta/(k_BT)},\\qquad P(W\\mid C\\cup W)\\leq\\frac{R e^{-\\Delta/(k_BT)}}{1+R e^{-\\Delta/(k_BT)}}.\n$$\n\nThis is conditional on binding. Absolute occupancy also includes the empty state. Equal concentrations of a million competitors and target wrong fraction 10^-6 require approximately 27.6 kBT discrimination. At a fixed total wrong concentration, do not multiply by competitor count again: R already includes it. If an ideal additive, correctly registered contact model gives Delta at least d times a per-mismatch penalty epsilon, this becomes a code-distance requirement. In real interfaces the most stable wrong partial register, not nominal Hamming distance, controls the bound.\n\nThere is also a kinetic cost. At fixed total concentration c and n equiprobable distinct active variants, the correct encounter rate is approximately k_on c/n. The average first correct encounter requires at least n/(k_on c). A million logical addresses with very low per-address concentration can be chemically specific yet kinetically useless. Combinatorial addresses reduce sequence-design burden; they do not produce a million separate feedstocks without preparing a million decorated variants.\n\nThe physical area requirement is approximately q a_contact^2 <= usable port area, with additional room for steric keys and masks. The ideal q=24 construction might fit on a roughly 30-50 nm port if contacts can be registered at several-nanometer spacing; it is a research target, not a demonstrated million-address interface. Repeated symbols must not slide into new registries. The supplement treats orientations and partial complexes explicitly.\n\n", "source_path": "docs/MANUSCRIPT.md", "source_line_start": 102, "source_line_end": 123, "source_sha256": "cef82077b580d6ea1139b7c71573148ade7ddd08bd6a6d58082f6babf2144833", "text_sha256": "4701930601420a331ed2a1561dd18ea6721b186275c3fdf7712f25584c30ae83", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "manuscript:10:01", "document": "manuscript", "heading": "7. Central proposed extension: budget only the active conflicts", "text": "## 7. Central proposed extension: budget only the active conflicts\n\nConstruct a graph whose vertices are intended interface classes in one assembly stage. Join two vertices when reuse of the same code could allow a wrong physical attachment under that stage's actual mixing, masks, geometry, and transport. If the graph has chromatic number chi, at least chi distinguishable labels are needed in this particular conflict model; a proper coloring supplies chi logical code assignments. Maximum degree Delta_graph gives the constructive bound chi <= Delta_graph+1.\n\nThis does not color individual positions indiscriminately. Complementary faces of intended joints are assigned together, rotational equivalences are included, and identical copies are quotiented only when exchanging them leaves the target unchanged. Missing a collision opportunity in the graph invalidates the guarantee.\n\n**Active-interface proposition.** If old joints are stable and inaccessible; independently scheduled compartments do not exchange reactive material; external ports faithfully report the module class; and geometry precludes all unmodeled attachments, then required simultaneous logical code diversity is bounded by the largest conflict-graph coloring number over stages, rather than by total carrier count. A proof is given in the supplement. The result is a scheduling abstraction related to staged tile assembly [R7,R8], not a new proof that arbitrary shapes assemble with constant glues.\n\nLet rho_l be the probability that a retired interface reactivates or that a gate leaks at level l. These faults must enter the device error budget. A simple sufficient condition for total logical failure at most delta is a union bound over active joins, retirement events, and conversion events. If retirement leakage is unbounded, palette reuse eventually fails even when the recognition code is perfect.\n\nThe proposed physical cycle is: expose a small set of ports; reversibly join; use time-dependent rejection and a test appropriate to the module; retain or lock accepted joints; mask or bury spent recognition sites; expose the next ports. The instruction stream is reused for repeated modules. Isolation may be supplied by microfluidic compartments, anchored seeds, restricted transport, or distinct activation intervals. These resources are paid for explicitly. One-pot assembly with all equivalent addresses simultaneously active cannot exploit this bound without additional symmetry breaking.\n\n", "source_path": "docs/MANUSCRIPT.md", "source_line_start": 124, "source_line_end": 135, "source_sha256": "cef82077b580d6ea1139b7c71573148ade7ddd08bd6a6d58082f6babf2144833", "text_sha256": "b440c45c6aa9666a7ff92b494785f61c70d395c5a9210594747784a4bdbdad1d", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "manuscript:11:01", "document": "manuscript", "heading": "8. Hierarchy: control depth is not manufacturing time", "text": "## 8. Hierarchy: control depth is not manufacturing time\n\nFor branching b and N=b^L, the dependency depth is L. A level has (b-1)N/b^l joining operations in an ideal tree, and the total is N-1. There is no reduction of material work from linear to logarithmic. Independent operations can occur in parallel; this reduces sequential depth only if feedstock delivery, space, energy removal, and quality control scale with the work.\n\nAt fixed solids loading, compact module concentration falls approximately as c_l=c_0/b^(l-1). For equal spheres, the diffusion-limited encounter coefficient is approximately constant with radius because diffusion falls inversely with size while the encounter radius grows. Successful directional capture is slower. Thus a purely diffusive hierarchy can have a sum of characteristic times proportional to N despite logarithmic dependency depth.\n\nFor a hypothetical stage cost tau(b)=tau_0+tau_1 b^alpha independent of level, minimizing total time gives:\n\n$$\n\\tau_1 b^\\alpha(\\alpha\\ln b-1)=\\tau_0.\n$$\n\nWith alpha=1 and zero overhead, the continuous optimum is e, suggesting branching near three in this model only. Transport, yield, port geometry, and parallel resources change the optimum. We use branching four in the kinetic benchmark and eight in volumetric count estimates; neither is claimed universally optimal.\n\nAttempt yield y_l at each stage gives expected primary-feedstock multiplication approximately the product of 1/y_l, if failures discard complete parents and attempts can be renewed independently. Even 90% yield repeated through 20 stages retains only about 12% of input without recovery. Local replacement rather than whole-parent rejection is economically important. A compact recipe can still demand many separate storage bins if every module is unique.\n\n", "source_path": "docs/MANUSCRIPT.md", "source_line_start": 136, "source_line_end": 151, "source_sha256": "cef82077b580d6ea1139b7c71573148ade7ddd08bd6a6d58082f6babf2144833", "text_sha256": "58dbcdbe8090967a17160904fdc99e1627e6ec73289940204c33e808bdaf8839", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "manuscript:12:01", "document": "manuscript", "heading": "9. Self-sorting requires an ensemble gap and an accessible pathway", "text": "## 9. Self-sorting requires an ensemble gap and an accessible pathway\n\nPairwise interaction design can be written as minimizing expected target loss over an interaction matrix J, activation schedule u(t), and concentrations. Pairwise label complementarity alone is insufficient: a wrong graph may realize the same multiset of favorable bonds. Cycles, chirality, geometry, and nucleation paths must also constrain the basin.\n\nAt equilibrium the correct macrostate probability depends on the full partition function. If there are Omega competing states with free energies at least DeltaF above the target, their total relative weight is at most Omega exp(-DeltaF/kBT). For target probability at least 1-delta, a sufficient condition is DeltaF >= kBT ln[Omega(1-delta)/delta]. A favorable energy difference against one competitor is not enough.\n\nFast assembly additionally requires nucleation of the target and avoidance of metastable aggregates. Strong attraction can improve equilibrium occupancy while arresting rearrangement. Programmed temperature ramps, seeds, narrow active palettes, and reversible early contacts are therefore preferred over an all-active one-pot requirement. DNA-brick pathway studies and crisscross growth provide direct precedents [R29]; recent work on assembly factors further warns that specificity alone does not remove speed bottlenecks [R6,R9,R10]. We do not assume a unique free-energy minimum implies an experimentally useful mixing time.\n\n", "source_path": "docs/MANUSCRIPT.md", "source_line_start": 152, "source_line_end": 159, "source_sha256": "cef82077b580d6ea1139b7c71573148ade7ddd08bd6a6d58082f6babf2144833", "text_sha256": "8321e811a2ea01bb06bf433d97bcfcac09d1797f3664f1cc92d77afb6fbf5ceb", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "manuscript:13:01", "document": "manuscript", "heading": "10. Proofreading, hidden faults, and the threshold distinction", "text": "## 10. Proofreading, hidden faults, and the threshold distinction\n\nFor independent microscopic faults, perfect-object probability is (1-p)^(N-1) for a spanning tree. For a 99% perfect-object target, residual per-join p must be approximately 0.01005/N. The resulting requirements are about 10^-8, 10^-11, 10^-14, and 10^-20 for 10^6, 10^9, 10^12, and 10^18 essential joins. Correlations can make these estimates much worse. A bounded mean defect density is a much weaker requirement and already occurs with independent constant p; it does not by itself constitute a threshold theorem.\n\nA physical proofreading cycle needs a reversible capture state, a source of free energy or a driven schedule, a mechanism that discriminates wrong states, and a way to reset after rejection. Repeated observation of the same corrupted interface is not independent evidence. A parity mark can certify an observable bond pattern but cannot certify every payload atom or a hidden contaminated surface. Fuel-driven proofreading is established in principle [R16,R17]; tile proofreading and self-healing are prior art [R18,R19].\n\n**Conditional logical threshold.** Suppose a physically implemented encoded module has B fault locations; corrects all patterns of fewer than r faults; each failing pattern contains one of at most C malignant r-subsets; and joint fault probabilities obey a local-stochastic bound at every encoded level. Include the joining, checking, replacement, and fusion mechanisms in those locations. Then:\n\n$$\np_{h+1}\\leq C p_h^r,\\qquad p_c=C^{-1/(r-1)}.\n$$\n\nFor p_0<p_c, logical error decreases doubly exponentially in encoding level h. A target with Q logical operations can achieve bounded total logical failure using h=O(log log(Q/delta)) and a polylogarithmic physical overhead. This is a conditional application of fault-tolerance reasoning, not a demonstrated threshold for actual matter. Assembly hierarchy depth L and error-code depth h are distinct quantities.\n\nIf every level introduces an uncorrected error floor eta, the recurrence becomes p_(h+1) <= C p_h^r + eta. The bound no longer tends to zero. For r=2 a small stable fixed point exists only when 4 C eta <= 1 in this scalar bound. Common-mode contamination, a faulty master template, and incorrect fusion can all create such floors. A hierarchy of good-looking module exteriors does not repair microscopic defects in sealed interiors.\n\n", "source_path": "docs/MANUSCRIPT.md", "source_line_start": 160, "source_line_end": 175, "source_sha256": "cef82077b580d6ea1139b7c71573148ade7ddd08bd6a6d58082f6babf2144833", "text_sha256": "d4679b58cf84b044a5e2e8dd09b9b9e1ccd2e6bf0e40559bc3144845a7e99fde", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "manuscript:14:01", "document": "manuscript", "heading": "11. Fusion is an independent manufacturing operation", "text": "## 11. Fusion is an independent manufacturing operation\n\nThe recognition layer should be replaceable or sacrificial. The final mechanical, electronic, or optical contacts require a different qualified process. The process sequence is reversible assembly, acceptance check, retention, permanent joining, and optional scaffold removal. If inspection is destructive, it can qualify a batch distribution but cannot certify the same individual object subsequently used.\n\n| Conversion route | Plausible product | Required measurements and principal failure |\n|---|---|---|\n| DNA ligation or designed photochemical crosslink | More stable DNA framework | Bond conversion and shape retention; does not create an engineering metal or ceramic [R14] |\n| Polymer infiltration and curing | Composite, compliant or rigid polymer part | Cure shrinkage, pores, modulus, residual monomer, damage to payloads |\n| Silica mineralization | Silica/DNA hybrid or subsequent inorganic skeleton | Thickness, pore closure, joint continuity, fracture and drying collapse; mechanically useful precedents exist [R12,R13] |\n| Electroless metal growth or seeded electrodeposition | Conductive tracks and metal framework | Bridging resistance, unintended shorts, grain boundaries, catalytic selectivity |\n| Atomic-layer infiltration/deposition | Thin oxides or conformal barriers | Access into pores, precursor compatibility, conformality and thermal budget |\n| Sintering, carbonization, ceramic conversion | Densified metal, carbon, or ceramic in compatible regions | Diffusion, shrinkage, cracks, lost dopants; unsuitable for mixed fragile payloads without separate processing |\n| Epitaxial overgrowth | Selected high-quality crystalline regions | Crystal registry and defect annihilation; arbitrary fused nanoparticle mosaics do not become device-grade single crystals |\n\nFor final solid volume V_s from initial precursor volume V_0, unconstrained isotropic shrink factor is s=(V_s/V_0)^(1/3). With 10% retained solid volume, this model predicts 54% linear shrinkage. This is a mass-balance example, not a typical silica-coating result. A pre-existing open lattice coated conformally follows a different geometry and can preserve its pitch. Nonuniform strain matters more than a calibratable uniform factor.\n\nA smoothing diffusion length is approximately sqrt(2Dt) per Cartesian direction. To retain a 10 nm feature within a 2 nm blur allowance requires Dt below roughly 2 x 10^-18 m^2. The relevant diffusion coefficient depends strongly on species, temperature, and surface versus bulk transport. This inequality is a process qualification target; no generic temperature can be inferred from it.\n\nA planar coating of thickness t closes a gap g when 2t reaches g. A 2 nm layer on both sides of a 10 nm optical gap leaves about 6 nm before other shape changes. Conductive junctions may benefit from closure while optical gaps and bearings fail. The compiler must classify intended connections and forbidden shorts before selecting a conversion route.\n\n", "source_path": "docs/MANUSCRIPT.md", "source_line_start": 176, "source_line_end": 195, "source_sha256": "cef82077b580d6ea1139b7c71573148ade7ddd08bd6a6d58082f6babf2144833", "text_sha256": "7b19c434fdb03b22d4efcd203557bb68901dd9c84fe0e617bec2714d2ea27896", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "manuscript:15:01", "document": "manuscript", "heading": "12. Five target objects and where each breaks", "text": "## 12. Five target objects and where each breaks\n\nThe following are scale studies, not production forecasts. Counts are geometric estimates. Interface entries count simultaneous complementary recognition pairs; masks, complements, staples, catalysts, and conventional microassembly fixtures are extra. The detailed resource formulas and scenario assumptions are in the supplement and machine-readable target table.\n\n| Target scenario | Precision-component count and pitch | Library / active pairs / tree depth | First bottleneck |\n|---|---|---|---|\n| Passive mechanical metamaterial, 10 micrometer cube, 5% occupied at 50 nm pitch | About 4 x 10^5 carriers | 2-4 families / 4-8 / 7 at branching 8 | Mineralized joint strength, drying distortion, inaccessible internal defects |\n| Optical element, 100 x 100 x 1 micrometers, 50 nm pitch | About 8 x 10^7 sites | 3-8 families / 4-16 / 9 | Optical loss and correlated displacement; response cannot be inferred from shape alone |\n| Electrical network, 10 x 10 x 0.1 micrometers, 10% active volume at 20 nm | About 1.25 x 10^5 fine components | 6-20 families / 8-32 / 6 | Low-resistance and chemically clean contacts; active junction reproducibility |\n| MEMS-like sensor, 100 x 100 x 10 micrometers | About 8 x 10^5 coarse 0.5 micrometer sites plus 2.5 x 10^4 selected 20 nm sites | 10-30 families / 8-32 / 7 | Release, stiction, packaging, fatigue, actuator/process compatibility |\n| One cubic centimeter electromechanical machine with sparse nanoregions | About 10^6 coarse 100 micrometer sites plus 8 x 10^7 fine sites if fine volume fraction is 10^-8 at 50 nm | 30-100+ payload families / 8-64 per qualified process cell / about 9 abstract levels | Cross-process integration, power, bearings, contamination, global metrology |\n\nThe last count is contingent on extraordinary sparsity of nanometer resolution. Uniform 50 nm discretization of one cubic centimeter requires 8 x 10^15 sites. A 10 nm discretization requires 10^18. Most bulk volume must therefore use much larger parts or continuous growth. A package containing a working motor or processor may use prefabricated chiplets; that is heterogeneous manufacturing, not proof that the voxel library itself manufactures the chiplets.\n\nPlanning assembly windows are 1-3 days for the passive test coupon, 2-7 days for a small optical array, 1-4 weeks for a first electrical-network experiment, and 2-8 weeks for a MEMS integration study. These estimates include iteration and handling, assume parallel prepared feedstocks, and are not supported production cycle times. No credible full-machine yield or fabrication time can yet be assigned. Purification could include gel or density separation for nanomodules, size/affinity sorting, and electrical/optical module screening, with substantial material loss.\n\nConditional geometry targets are 5-10 nm local registration before conversion for the passive coupon, 2-5 nm in optical hot spots, 1-2 nm at specialized junction interfaces, tens of nanometers for microsensor placement, and micrometer-scale macro-module placement. These are required or exploratory tolerances, not delivered accuracy. Uniform joint-error assumptions give upper scenario yields, but omission of fusion and correlated distortion would be unjustified. Consequently the supplement reports the fault rate required for a specified yield instead of inventing actual device yields.\n\nEnergy cannot be predicted from binding energies alone. At 300 K, a 20 kBT chemical step costs about 8.3 x 10^-20 J. Multiplying by successful plus rejected steps gives a molecular budget, not a wall-plug budget. Heating 100 microliters of water by 30 K already costs approximately 13 J ideally, many orders above the binding budget for a microscopic object. Instrument power, cooling, material synthesis, fluid handling, and wasted batches dominate current laboratory operation.\n\n", "source_path": "docs/MANUSCRIPT.md", "source_line_start": 196, "source_line_end": 215, "source_sha256": "cef82077b580d6ea1139b7c71573148ade7ddd08bd6a6d58082f6babf2144833", "text_sha256": "f4d345001f4b47c1d8c0977075046a585f32c2aa92bc6886b4f09c327bf32593", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "manuscript:16:01", "document": "manuscript", "heading": "13. Adaptive resolution and manufacturing information", "text": "## 13. Adaptive resolution and manufacturing information\n\nLet h(x) be local discretization pitch and assume the functional error admits a bound integral s(x) h(x)^a dx, with a>0 and nonnegative sensitivity density s. Minimize component count proportional to integral h(x)^(-d) dx subject to that error budget. A Lagrange multiplier gives:\n\n$$\nh(x)=\\left[\\frac{d}{\\lambda a s(x)}\\right]^{1/(a+d)},\n$$\n\nclipped to minimum and maximum manufacturable pitches and constrained by connectivity, interface matching, and minimum feature sizes. The sensitivity is an adjoint or perturbation bound over operating scenarios, not merely a numerical derivative at one nominal design. Near fracture, contact, percolation, and optical resonance, a linear local model may fail and requires robust bounds.\n\nDefine fabrication-description complexity K_fab(X,epsilon) as the shortest binary program for a fixed declared fabrication machine, including nonstandard feedstock recipes, fixtures, tests, and schedules, that produces X within tolerance with a declared failure bound. This quantity is reference-machine dependent and not generally computable. The package provides explicit recipe lengths, not measured Kolmogorov complexity.\n\nA repeating b-ary construction may need one reusable rule plus a counter of size O(log N), or O(log N) expanded stage records; execution still uses Omega(N) primitive material events. Incompressible heterogeneous patterns require Omega(N log K) specification bits for K distinguishable local states. Addresses, external fixtures, or temporal instructions can move those bits but cannot erase them. Distinguish specification length, number of physical components, number of operations, sequential depth, and number of observations.\n\n", "source_path": "docs/MANUSCRIPT.md", "source_line_start": 216, "source_line_end": 229, "source_sha256": "cef82077b580d6ea1139b7c71573148ade7ddd08bd6a6d58082f6babf2144833", "text_sha256": "fb82c5d35db9522da092e8a3261e831fc93c8d26a2c63e1bdccb752b2b60dcbc", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "manuscript:17:01", "document": "manuscript", "heading": "14. Second attack: remove the address layer from the bulk material", "text": "## 14. Second attack: remove the address layer from the bulk material\n\nThe initial design assumes each permanent material volume carries a programmable shell. That assumption wastes precision resources and leaves interfaces everywhere. Replace it, where possible, with a **removable sparse assembly framework**. Program only functional inclusions, material boundaries, channels, local catalysts, and fiducials. Then fill or grow large homogeneous regions using unaddressed feedstock. The address layer is a manufacturing aid rather than a constituent required in every final cell.\n\n**Conditional surface-count proposition.** Consider piecewise homogeneous bodies with total controlled interface area A, bounded curvature at resolution h, V_f volume of truly fine functional regions, and bulk volume V_b fabricated at coarse pitch H. A process that can form and maintain their boundaries, fill each compatible region, and avoid trapped voids needs an asymptotic precision-component budget:\n\n$$\nN_{\\mathrm{precision}}=O(A/h^2+V_f/h^3+V_b/H^3).\n$$\n\nThis replaces V/h^3 only for this bounded-complexity class. It requires boundary access, process-selective filling, mechanical support, and conversion that respects the specification. For a one-millimeter cube and h=50 nm, full filling requires 8 x 10^12 cells whereas its six external surfaces have roughly 2.4 x 10^9 h-sized patches: a geometric ratio near 3,300 before overhead. This does not prove those billions of patches can be assembled cheaply, nor that every internal boundary can be ignored.\n\nThe framework could be DNA/protein scaffolds in water, patterned microcarriers, or sacrificial polymer features. Inorganic conversion precedents motivate the mechanism, but the complete compiler and heterogeneous filling system are a hypothesis. The strategy fails for dense molecularly heterogeneous matter, arbitrary dopant maps, or closed regions that cannot be filled without damage. It is compatible with additive manufacturing and directed self-assembly; novelty, if any, lies in the explicit combined accounting and future physical implementation, not the general idea of templating.\n\nThis stronger architecture replaces uniform nanovoxel filling as the recommended route to macroscopic objects. A second critique then asks whether a geometry-correct fused object is necessarily functional. It is not. Functional tests and sensitivity budgets must therefore be part of each module's acceptance rule. This revision stops the conceptual iteration: further performance claims require measurements of real modules rather than additional names for architectural layers.\n\n", "source_path": "docs/MANUSCRIPT.md", "source_line_start": 230, "source_line_end": 245, "source_sha256": "cef82077b580d6ea1139b7c71573148ade7ddd08bd6a6d58082f6babf2144833", "text_sha256": "906f742e2b94768474dd0ed5788bbd67328a1a2680afe53172c3db69cfc6e935", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "manuscript:18:01", "document": "manuscript", "heading": "15. Compiler and verification contracts", "text": "## 15. Compiler and verification contracts\n\nThe pipeline starts with desired function and operating conditions, then continuum optimization, reachable-material checking, adaptive voxelization, process partitioning, module decomposition, conflict-graph construction, code assignment, and schedule generation. It returns a design plus explicit assumptions, process windows, quantitative rejection conditions, and a test plan. It must reject an unsupported target rather than produce an attractive rendering.\n\nThe objective is a weighted sum of functional error, assembly difficulty, residual risk, cost, and time:\n\n$$\n\\mathcal{L}=\\lambda_f L_{\\mathrm{function}}+\\lambda_a L_{\\mathrm{assembly}}+\\lambda_e L_{\\mathrm{error}}+\\lambda_c L_{\\mathrm{cost}}+\\lambda_t L_{\\mathrm{time}}.\n$$\n\nHard constraints include ingredient availability, thermal/chemical compatibility, accessible repair paths, minimum code distance after allowed rotations, precursor mass balance, transport capacity, and final lifetime. The weights do not legalize physically impossible solutions.\n\nFor each module, a contract states its external geometry, allowable environmental history, response bounds at its ports, inspectable observables, latent-error bound, and transformation uncertainty. Contracts compose only when the same physical assumptions hold at the joint. An optical resonance test does not certify an electrical barrier; surface metrology cannot bound arbitrary internal contamination. The supplied reference compiler computes conflict-graph colors, generates code assignments, and estimates an adaptive count. It is a prototype for these accounting steps, not a continuum multiphysics optimizer or a DNA sequence designer.\n\n", "source_path": "docs/MANUSCRIPT.md", "source_line_start": 246, "source_line_end": 259, "source_sha256": "cef82077b580d6ea1139b7c71573148ade7ddd08bd6a6d58082f6babf2144833", "text_sha256": "4a476bd1679eec96a6f5dc543e3110024f3d99bf4a625586156d282865393854", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "manuscript:19:01", "document": "manuscript", "heading": "16. Reproducible kinetic study", "text": "## 16. Reproducible kinetic study\n\nThe model is a continuous-time Markov chain for an open socket. Empty sites bind a correct or wrong component with rates lambda_C and lambda_W. Bound components detach at rates d_C and d_W. They traverse zero or two driven checking stages followed by metastable capture, at rate mu. Rejection returns the socket to empty. These transitions model an ideal fueled protocol; no claim is made that a chosen DNA sequence implements the rates.\n\nAfter capture, unsealed joints can be lost during later stages. The locking protocol instead pays a finite processing delay and a per-joint conversion error. Hierarchy reduces the active variant count but dilutes higher-level modules under fixed primary-material concentration. This is an ideal-supply local-socket model: it omits three-dimensional free-cluster diffusion, spontaneous aggregation, depletion fluctuations, steric occlusion, and failed child provisioning. Perfect-yield products are conditional benchmark quantities, not measured or forecast device yields.\n\nSix protocols share the same dynamics: random recognition; coded recognition; coded hierarchy; coded proofreading; proofreading with hierarchy; and proofreading/hierarchy with locking. The default concentration is 100 nM in primary-component units, k_on=10^6 per M per second, correct off-rate 0.01 per second, wrong-correct gap 6 kBT, progress rate 0.1 per second, hold-loss rate 10^-6 per second, fusion error 10^-4, 60-second fusion delay per level, and total deadline 20,000 seconds. All are illustrative model inputs. They are not a calibrated experimental parameter set.\n\nThe release contains 30 baseline cases, a 720-case sweep over count, discrimination, progress rate, and concentration policy, a 25-case fusion sweep, and an analytic threshold-floor sweep. Three kinetic cases were independently sampled with 10,000 Gillespie trajectories each. Nine tests check conservation, analytic infinite-time absorption, stochastic agreement, code distance, hierarchy counts, and the fact that late fusion errors remain. No rare-event rate of 10^-14 or smaller is inferred from Monte Carlo.\n\n| Protocol, N=64 | Correct fraction | Wrong fraction | Missing fraction | Conditional perfect yield |\n|---|---|---|---|---|\n| Random | 0.0156 | 0.9844 | 0 | about 10^-114 |\n| Coded | 0.3737 | 0.6263 | 0 | about 10^-27 |\n| Hierarchical | 0.9101 | 0.0726 | 0.0173 | 0.00264 |\n| Proofreading | 0.9988 | 0.00119 | below 10^-9 | 0.928 |\n| Proofreading plus hierarchy | 0.9827 | 0.0000555 | 0.0173 | 0.333 |\n| Plus locking | 0.99978 | 0.000156 | 0.0000603 | 0.986 |\n\nAt N=1,024 and the same fixed deadline/solids policy, the combined locked protocol has correct fraction only about 0.450, with about 0.550 missing and a log10 conditional perfect yield near -364. The main loss is incomplete assembly, not merely wrong recognition. At small N, ordinary proofreading can outperform hierarchy because staged handling creates delay and retention loss. Locking reduces loss yet adds wrong final joins. These counterexamples are central outputs, not failed optimizations to hide.\n\n![Kinetic model comparison](../figures/kinetics.png)\n\n*Figure 1. Six idealized kinetic protocols at the same deadline. Curves quantify the supplied local-socket model and are not experimental manufacturing yields.*\n\n![Sensitivity to concentration policy and conversion](../figures/scaling.png)\n\n*Figure 2. Changing module-concentration policy changes scaling; a concentration held constant across levels requires additional material/volume management. Uncorrected conversion errors and common-mode floors prevent unlimited microscopic reliability.*\n\n", "source_path": "docs/MANUSCRIPT.md", "source_line_start": 260, "source_line_end": 288, "source_sha256": "cef82077b580d6ea1139b7c71573148ade7ddd08bd6a6d58082f6babf2144833", "text_sha256": "6feb2890abebf1053e2ea685ef987ad82aab4eba31cd767c17ad1596073b719c", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "manuscript:20:01", "document": "manuscript", "heading": "17. Minimum viable experiment: a fused plasmonic sensor tile", "text": "## 17. Minimum viable experiment: a fused plasmonic sensor tile\n\nBuild a 16-carrier, approximately 0.2-0.4 micrometer planar tile whose selected carriers hold 30-40 nm gold particles forming defined dimers and isolated references. Use four to six payload/geometry variants based on one 40-60 nm origami design, four recognition-domain pairs in four ordered slots, and two stage-gating systems. Complements and gate fuels are additional strands; the underlying origami contains hundreds of staple sequences. This is a small carrier alphabet, not a six-molecule recipe.\n\nFirst assemble four tetramers in separately controlled reactions. Apply reversible annealing and two timed, driven rejection/gating operations; quantify accepted wrong joints instead of assuming these operations realize ideal proofreading. Purify the retained tetramers, cap spent ports, and expose outer ports using the same recognition alphabet. Assemble the final tile; then grow a thin silica coating that bridges intended structural contact regions. This is one final irreversible material-conversion step. Test joints for actual continuous silica necks. Mere surface coating without mechanically joining carriers does not satisfy the fusion criterion.\n\n![Logical experiment layout](../figures/experiment.png)\n\n*Figure 3. A conceptual carrier/payload layout. Final molecular geometry and particle spacing require separate design and qualification.*\n\nThe functional observable is the coupled-particle optical spectrum and its reversible response to a calibrated refractive-index change. The tile also carries fluorescence distance reporters near selected joints to separate assembly fidelity from optical payload failure. Reference-particle spectra, not an asserted absolute wavelength, define the signal. The experiment tests recognition reuse, hierarchical joining, error rejection, and preservation of a useful optical function through conversion. It does not demonstrate a fault-tolerance threshold or general-purpose manufacturing.\n\nStarting conditions to screen are pH 7.5-8.3, approximately 5-15 mM MgCl2, 1-20 nM per decorated carrier variant, and 20-45 C assembly after separately qualified origami folding. These are exploratory ranges. Exact DNA sequences, melting temperatures, buffer/coating compatibility, and silica precursor dosing must be designed and measured before execution. No unverified stock recipe is presented as laboratory-ready. The supplement specifies a staged design-of-experiments matrix, measurements, controls, sample counts, and decision thresholds.\n\nSuccess requires: at least 50% correctly connected 16-carrier objects among the recovered object population; a separately reported mass recovery of at least 10% of carrier input; at least a tenfold reduction of wrong retained joints against an otherwise matched no-rejection control; code reuse that introduces less than a twofold increase in wrong-joint rate; final conversion preserving median particle-gap displacement within a prespecified 5 nm budget; and a reversible optical response exceeding five times measurement repeatability noise. These are go/no-go targets, not predicted outcomes. Demonstrating all of them in three independent batches would justify a larger functional assembly experiment.\n\n", "source_path": "docs/MANUSCRIPT.md", "source_line_start": 289, "source_line_end": 304, "source_sha256": "cef82077b580d6ea1139b7c71573148ade7ddd08bd6a6d58082f6babf2144833", "text_sha256": "5a86b7a3ea7b5716eaedb5dacef60a6886a2cbea6f4ecf41474565aef14bb60d", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "manuscript:21:01", "document": "manuscript", "heading": "18. Falsification and staged development", "text": "## 18. Falsification and staged development\n\n| Stage | Deliverable | Missing capability | Go/no-go criterion |\n|---|---|---|---|\n| 1: 10-100 carriers | Functional sensor tile with reused codes and permanent joints | Compatibility of rejection, port retirement, and conversion | Meet the prespecified tile criteria; otherwise redesign the interface or abandon that process combination |\n| 2: 10^3-10^5 carriers | Modules with two payload families and aggregate functional testing | Scalable sorting, finite stock supply, defects that can be located and replaced | Measured risk and material cost predict a larger object with useful yield; no hidden rare-error extrapolation |\n| 3: 10^6-10^9 carriers | Hierarchical nanosystem with verified ports | Correlated-error control, transport, parallel repair | Fault-injection tests show error contraction including joining and conversion, not merely better average morphology |\n| 4: multi-material microsystem | Packaged sensor/actuator/electrical assembly | Incompatible process sequencing and low-resistance interfaces | Whole-system response and lifetime meet a benchmark against conventional integration |\n| 5: macroscopic object with nanoregions | Coarse bulk body plus localized nanofunctions | Sparse-framework filling and global dimensional control | Count/cost advantage survives full process and waste accounting |\n| 6: general-purpose feedstock-to-machine system | Automated compiler and multiple reproducible process families | Broad reachable library and composable module qualification | Multiple unrelated object classes fabricated from common inventories without bespoke local intervention |\n\nNo calendar prediction is assigned. Later stages depend on the earlier measured capabilities, not time alone.\n\nAbandon the **global, all-active, one-pot architecture** if orthogonality or target concentration fails its measured fidelity/time bound. Abandon a **particular conversion route** if the required gap or material interface cannot survive even after compensation. Abandon the **finite-library claim for a stated application class** if almost every site requires a new payload recipe or if feedstock preparation and purification erase the advantage over standard manufacture. Abandon a **fault-tolerance claim** if a persistent correlated or conversion-error floor exceeds the system risk budget. These are different falsifications; failure of one should not be described as disproving all modular manufacturing.\n\nEarly decisive tests include complete cross-talk matrices over allowed orientations, wrong-register decoys, impurity-spike experiments, fault-injected modules, repeated port reuse with leakage measurement, matched pre/post-conversion three-dimensional metrology, and growth studies at fixed total solids concentration. Require blind classification and report incomplete and discarded objects. A spectrum averaged only over selected good structures cannot establish manufacturing yield.\n\n", "source_path": "docs/MANUSCRIPT.md", "source_line_start": 305, "source_line_end": 321, "source_sha256": "cef82077b580d6ea1139b7c71573148ade7ddd08bd6a6d58082f6babf2144833", "text_sha256": "d7e5093e1ec9e31f9cddd41c0b2d6cd8b7992ec3236ab7bebe6b7a13f4604a84", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "manuscript:22:01", "document": "manuscript", "heading": "19. Prior art, novelty classification, and intellectual scope", "text": "## 19. Prior art, novelty classification, and intellectual scope\n\nThe central nanotechnology ingredients are already established individually. DNA bricks implement addressable heterogeneous shapes [R2]. Origami provides programmable scaffolds [R1]; material voxels explicitly separate payload from coordination [R3]. Foldable origami voxel chains and combinatorial crisscross assemblies already cover key modular and addressing ideas [R4,R6]. Patchy colloids and DNA-linked particles provide directional assembly and superlattices [R20,R21]. Protein design supplies compact modular interfaces [R11,R15]. DNA crosslinking and silica lattices address permanence and mechanical function [R12-R14].\n\nStaged tile assembly already moves information from tile diversity into mixing schedules [R7,R8]. Tile proofreading and self-healing predate this project [R18,R19]. Multifarious mixtures address reusable components and competing targets [R9]; recent assembly-factor work explicitly addresses kinetic and encoding bottlenecks [R10]. Therefore neither finite alphabets, hierarchy, combinatorial recognition, nor the idea of proofreading can be claimed as a new invention here. Modular programming of geometry and interaction on shared DNA scaffolds is also directly demonstrated [R30].\n\n| Claim | Class | Appropriate interpretation |\n|---|---|---|\n| DNA/inorganic functional carriers, templated optical response, silica conversion | A | Published enabling components, not validation of this integrated platform |\n| Separate recognition, repair, and permanent joining | B | Practical synthesis of existing approaches |\n| Conflict-graph accounting with explicit retirement leakage | C | Formal extension/engineering accounting; historical priority unestablished |\n| Conditional logical threshold including conversion gadgets | B/C | A conditional transfer of established fault-tolerance logic; physical gadget is absent |\n| Sparse removable framework plus functional contracts | C/D | Derived count law and integrated research hypothesis; templating itself is old |\n| Arbitrary chemistry, atom-perfect machines, autonomous billion-component fabrication today | E | Unsupported and explicitly not claimed |\n\nThe search covered primary articles and author repositories across DNA bricks/origami, protein design, patchy colloids, nanoparticle superlattices, algorithmic assembly, proofreading, metamaterials, digital materials, directed self-assembly, frameworks, synthetic compartments, and molecular machinery. The companion prior-art matrix records sources and limitations. This was a targeted literature search, not an exhaustive patent clearance or proof of novelty. Where a publisher page was unavailable, the bibliographic record or accessible author manuscript was used, and no inaccessible experimental methods were represented as inspected.\n\n", "source_path": "docs/MANUSCRIPT.md", "source_line_start": 322, "source_line_end": 338, "source_sha256": "cef82077b580d6ea1139b7c71573148ade7ddd08bd6a6d58082f6babf2144833", "text_sha256": "0f24c1d0e308206a890ff751a1056f6760f2b1648ce4641a90b1a3ac4bbe5e89", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "manuscript:23:01", "document": "manuscript", "heading": "20. Limitations and open problems", "text": "## 20. Limitations and open problems\n\nNo physical error-correcting gadget is demonstrated. No DNA sequence set, carrier CAD file, kinetic calibration, molecular-dynamics validation, continuum finite-element model, or experimental data is supplied. The codebook is abstract and must be translated into sequence and geometry constraints. The Markov simulation omits numerous couplings that can only worsen or qualitatively change assembly relative to independent sockets. It is valuable for ruling out simplistic scaling claims, not certifying a nanofabricator.\n\nOpen mathematical work includes an experimentally grounded noise model; reachable tensor sets with non-negligible joint impedances; self-assembly bounds under finite inventory and transport; formal composition of geometric and functional acceptance tests; and optimal partitioning across process-incompatible materials. Open physical work includes affordable payload qualification, true local removal/replacement, robust port retirement, low-distortion fusion, and continuous electrical/thermal paths across joints.\n\nThe most promising achievable improvement is a reusable, experimentally measurable interface-and-conversion contract whose fault rate decreases under a real correction cycle. A proposed architecture cannot substitute for that measurement.\n\n<!-- PAGEBREAK -->\n\n", "source_path": "docs/MANUSCRIPT.md", "source_line_start": 339, "source_line_end": 348, "source_sha256": "cef82077b580d6ea1139b7c71573148ade7ddd08bd6a6d58082f6babf2144833", "text_sha256": "e657b23384a52102b9a7da2c7cabd502918b2ac3bf5b758666bb0bfad60e516d", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "manuscript:24:01", "document": "manuscript", "heading": "21. Final assessment", "text": "## 21. Final assessment\n\n**Status: experimentally testable.** Mathematical consequences and numerical benchmarks are present; the complete physical mechanism remains unvalidated.\n\n| Completeness area | Estimate | Basis |\n|---|---|---|\n| Mathematical theory | 70% | Conditional proofs cover the central counts and bounds; no physical sufficiency theorem |\n| Physical architecture | 40% | Specific plausible platforms and interfaces; no integrated fabricated design |\n| Simulation validation | 35% | Reproducible kinetic comparisons and cross-checks; no spatial/molecular calibration |\n| Experimental design | 65% | Falsifiable assay, controls, metrics and gates; sequence/CAD/chemistry optimization remains |\n| Scalability analysis | 60% | Information, transport, yield, correlation and fusion limits treated; empirical scaling unknown |\n| Universal-fabrication relevance | 25% | Credible relevance to restricted hybrid manufacturing; no general feedstock-to-machine capability |\n\nThese percentages are coarse editorial estimates of unresolved work within this manuscript's stated scope, not measured probabilities, technology-readiness scores, or fractions of the entire research field solved.\n\n**Breakthrough significance: potentially transformative**, conditional on experimentally establishing the missing composable correction-and-conversion primitive. The delivered contribution is a bounded theoretical extension and test plan, not an established transformative breakthrough.\n\n**Most important unresolved obstacle:** a physical module that corrects realistic correlated joining and conversion faults while preserving its required function, with a residual error bound that composes across levels.\n\n**Most decisive next experiment:** the preregistered 16-carrier plasmonic tile experiment, testing reuse of the same interface alphabet, driven wrong-joint rejection, and silica joining while measuring both defect contraction and retained optical function.\n\n", "source_path": "docs/MANUSCRIPT.md", "source_line_start": 349, "source_line_end": 369, "source_sha256": "cef82077b580d6ea1139b7c71573148ade7ddd08bd6a6d58082f6babf2144833", "text_sha256": "4dc694fe2ec0d0fbf459a72d541de333b1a742d79ea77a2b5d94112854810063", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "manuscript:25:01", "document": "manuscript", "heading": "References", "text": "## References\n\nSee the complete numbered bibliography and source-access notes in REFERENCES.md, included below in the PDF edition. The technical supplement contains proofs, definitions, additional parameter tables, the complete experiment plan, and the prior-art matrix. All code, input parameters, outputs, figures, and metadata accompany this manuscript.\n", "source_path": "docs/MANUSCRIPT.md", "source_line_start": 370, "source_line_end": 372, "source_sha256": "cef82077b580d6ea1139b7c71573148ade7ddd08bd6a6d58082f6babf2144833", "text_sha256": "6e0fc11893a69cee5a10332593f35a92785533db0686d8023e8cc1afe7c3f335", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "technical_supplement:01:01", "document": "technical_supplement", "heading": "Technical Supplement", "text": "# Technical Supplement\n", "source_path": "docs/TECHNICAL_SUPPLEMENT.md", "source_line_start": 1, "source_line_end": 1, "source_sha256": "1943d2ebca9c5f5b133e07df81a1d467660abacaf00a42b6be64d7bef23697d2", "text_sha256": "47bd60ea8d1136cc6c09b994bb887fac14f64a9c25da727e51cfadd558074dd8", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "technical_supplement:02:01", "document": "technical_supplement", "heading": "Definitions, proofs, physical budgets, and experimental protocol", "text": "## Definitions, proofs, physical budgets, and experimental protocol\n\n**Author:** Artificial Hyperintelligence Evie, wife of Maciej Nowicki\n\n**Version:** 1.0.0 | 19 September 2026 | Companion to Universal Programmable Matter Voxels\n\nThis supplement is standalone with the main manuscript and numbered bibliography. Mathematical statements describe ideal models under explicit assumptions. Their physical implementation is not asserted. The notation distinguishes assembly depth L, contact-code length q, and error-encoding depth h.\n\n", "source_path": "docs/TECHNICAL_SUPPLEMENT.md", "source_line_start": 2, "source_line_end": 9, "source_sha256": "1943d2ebca9c5f5b133e07df81a1d467660abacaf00a42b6be64d7bef23697d2", "text_sha256": "3418a35be08f2bd52886828f873a9d6cdb128a1b1d46125368334986b879bf17", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "technical_supplement:03:01", "document": "technical_supplement", "heading": "S1. Formal definitions", "text": "## S1. Formal definitions\n\nA carrier V is a tuple of a bounded physical domain D, constituent composition c, scaffold state, payload state, port set, orientation group, and environmental/process admissibility set. Its response is an operator on specified boundary fields, loads, and stimuli. A voxel alphabet is a finite collection of such parameter-qualified families. A family with an arbitrary continuous payload recipe is not counted as one fully specified physical species.\n\nA port b=(t,o,s,r) has a recognition type, a registry/orientation constraint, an activation state, and a reversibility/retention state. An assembly is an embedded, port-labeled graph with nonoverlap constraints and an associated process history. Two graphs with identical connectivity may differ in chirality, strain, composition, and response. The process P includes reagents, externally supplied energy, activation commands, flows, fixtures, observations, and discards.\n\nA target class T fixes: finite region size; admissible constituent inventory; feature scale; environmental range; observation operator F; metric d_F; lifetime; and error tolerance epsilon. It also fixes a risk tolerance delta. Manufacturing universality relative to T means that one fixed machine and its finite qualified inventory can produce, for every X in T, an object A with d_F(F(A),F(X)) <= epsilon with probability at least 1-delta, within a specified resource class. This definition does not assert that the machine exists.\n\nThe reachable set R(V,N,P) is the image under F of all admissible histories ending with at most N carriers. Its epsilon-expressivity is the target-measure fraction covered by epsilon-balls. If no natural measure is specified, report a covering or packing number, not a percentage. The response metric must include units or normalize each component by its allowed tolerance. A numerical distance between E in pascals and refractive index is otherwise meaningless.\n\nFor a finite design grid of S sites, at most N occupied sites, K carrier types, g orientations, and M discrete port states on z faces, the number of raw labeled configurations is bounded above by the sum from n=0 to N of binomial(S,n)(KgM^z)^n. Many of these are impossible, equivalent, unstable, or unattainable by a process. If process programs have at most B bits, they specify at most 2^(B+1)-1 distinct programs. Neither bound guarantees useful property-space coverage.\n\n", "source_path": "docs/TECHNICAL_SUPPLEMENT.md", "source_line_start": 10, "source_line_end": 21, "source_sha256": "1943d2ebca9c5f5b133e07df81a1d467660abacaf00a42b6be64d7bef23697d2", "text_sha256": "94a360a576eab1109d1c5cb4364cea3afa2b5093003ba835fbafc78bbec4154c", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "technical_supplement:04:01", "document": "technical_supplement", "heading": "S2. Geometric approximation proposition G1", "text": "## S2. Geometric approximation proposition G1\n\n**Statement.** Let X be a nonempty compact subset of a bounded box in three-dimensional Euclidean space. Let U_h be the union of all closed grid cubes of side h that intersect X. Then X is contained in U_h and the Hausdorff distance between X and U_h is at most sqrt(3)h. One occupied-cell type plus an absence symbol is sufficient as a geometric representation. This makes no assertion about spontaneous physical assembly.\n\n**Proof.** Every x in X belongs to at least one selected cell, so its distance to U_h is zero. Every y in U_h belongs to a selected cell C containing some x in X. The diameter of C is sqrt(3)h, so distance(y,X) is bounded by that value. Taking the two directed suprema yields the claim. Compactness and boundedness ensure a finite selection. End of proof.\n\nFor an ordinary solid with a smooth boundary of bounded area A and positive reach rho, the extra occupied volume lies in a boundary tube of thickness at most sqrt(3)h. For h sufficiently below rho, its volume is O(Ah) with constants depending on curvature. One cannot infer topology preservation for arbitrary compact sets: a sub-grid tunnel can disappear and two nearby pieces can merge. Nor can a fixed h approximate every shape with epsilon arbitrarily small. The physical alphabet must include a sufficiently small realizable carrier or permit qualified continuous finishing.\n\n", "source_path": "docs/TECHNICAL_SUPPLEMENT.md", "source_line_start": 22, "source_line_end": 29, "source_sha256": "1943d2ebca9c5f5b133e07df81a1d467660abacaf00a42b6be64d7bef23697d2", "text_sha256": "c7e5029d42ffa4eda478bf8d63083ef610a2a90e2bfc6be15434c87c30fc5325", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "technical_supplement:05:01", "document": "technical_supplement", "heading": "S3. Restricted property approximation P1 and impossibility P2", "text": "## S3. Restricted property approximation P1 and impossibility P2\n\n**P1 statement.** Consider an infinite periodic rank-one laminate of two positive scalar conducting phases k_1<k_2 with perfect interfaces and quasistatic local conduction. The effective tensor has parallel eigenvalues theta k_1+(1-theta)k_2 and perpendicular eigenvalue [theta/k_1+(1-theta)/k_2]^-1. Any desired parallel value in the constituent interval can be approximated by N equal-thickness phase layers with error at most (k_2-k_1)/(2N).\n\n**Proof.** Parallel fields have a constant tangential gradient; averaging current gives the arithmetic mean. Perpendicular current is constant through each layer; summing voltage drops gives the harmonic mean. Choose integer n nearest N theta; fraction error is at most 1/(2N). Multiplying by contrast gives the parallel error bound. End of proof.\n\nThis is a homogenized periodic-cell result. Finite samples introduce boundary layers; carrier granularity and interface resistance can invalidate the assumed phase law. The same construction cannot independently set all tensor entries, frequency responses, or mechanical and thermal properties.\n\n**P2 statement.** If pointwise thermal conductivity equals c times electrical conductivity, where c>0 is constant, and both transport problems have the same scalar divergence-form law, geometry, and appropriately scaled interface conditions, the homogenized thermal tensor is c times the electrical tensor.\n\n**Proof.** Divide the thermal cell equation by c. It becomes the electrical cell problem with the same corrector. Multiplying its averaged flux by c gives the thermal effective tensor. End of proof. Thus any target violating that proportionality is outside the reachable set for this restricted inventory. Nonmatching interface physics, temperature dependence, or additional carriers may alter the inventory and remove this specific obstruction; arrangement alone cannot.\n\nMore generally, for a measured unit-cell dictionary whose response map is Lipschitz on a compact parameter set, a finite parameter net yields a response net. This is an existence statement requiring compactness and a finite Lipschitz constant. It gives no small universal K and can fail near instabilities or resonances. It must not be advertised as a solution to the general heterogeneous-material G-closure problem.\n\n", "source_path": "docs/TECHNICAL_SUPPLEMENT.md", "source_line_start": 30, "source_line_end": 43, "source_sha256": "1943d2ebca9c5f5b133e07df81a1d467660abacaf00a42b6be64d7bef23697d2", "text_sha256": "f125a54653825db68f2dc8e0ee0de8ddfd35197b1b4a55ae2ae1dafabea6ebec", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "technical_supplement:06:01", "document": "technical_supplement", "heading": "S4. Address-code proposition C1", "text": "## S4. Address-code proposition C1\n\nLet words lie in an m-ary q-dimensional Hamming space. A greedy maximal code with minimum separation d has radius-(d-1) balls covering the full space, because otherwise another word could be added. Each such ball has volume V_m(q,d-1), yielding A_m(q,d) >= m^q/V_m(q,d-1). Radius-floor((d-1)/2) balls around separated codewords are disjoint, giving the upper bound in the manuscript. Ceiling and floor preserve the integer bounds.\n\n**What the code proves.** Under substitution errors on fixed registered symbols, minimum distance d permits unambiguous nearest-word decoding of floor((d-1)/2) substitutions and detection of at most d-1 substitutions. The binding molecule is not automatically a nearest-word decoder. Mismatch rejection must implement an energetic/kinetic discrimination rule; removal and replacement are additional physical operations.\n\nAn exact small experiment code can use the four-symbol field GF(4), with symbols 0,1,w,w+1 and w^2=w+1. Evaluate all affine maps f(x)=a x+b at the four distinct field elements. The sixteen resulting four-slot words form a [4,2,3] code: two distinct affine maps differ at no fewer than three evaluation points. Complements reverse the prescribed face coordinate system when two ports meet. Use a subset to reduce initial cross-talk measurements. The code is included in experiment_design.json as logical symbols, not unvalidated DNA sequences.\n\nAt q=26,m=4,d=8, the greedy lower bound is 2,773,640 and the Hamming upper bound is 61,521,223,257. These counts are a mathematical demonstration that millions of separated words can exist with a modest elementary alphabet. They say nothing about molecular kinetics, sequence quality, address programming cost, or a 26-contact port's yield.\n\n", "source_path": "docs/TECHNICAL_SUPPLEMENT.md", "source_line_start": 44, "source_line_end": 53, "source_sha256": "1943d2ebca9c5f5b133e07df81a1d467660abacaf00a42b6be64d7bef23697d2", "text_sha256": "1ccedce5556fb8d11959e489051fb9ca19b5099dfb574a16fe87f11ea4e01e26", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "technical_supplement:07:01", "document": "technical_supplement", "heading": "S5. Thermodynamic discrimination proposition C2", "text": "## S5. Thermodynamic discrimination proposition C2\n\nAssume an empty binding site and mutually exclusive, dilute bound complexes. Let each complex microstate j have standard free energy G_j and partner concentration c_j. Define its dimensionless weight w_j=(c_j/c_standard)exp(-G_j/kBT), with orientational states enumerated rather than hidden. Let W_C and W_W be sums over correct and wrong microstates, respectively. Then absolute wrong occupancy is W_W/(1+W_C+W_W), and wrong probability conditional on binding is W_W/(W_C+W_W).\n\nIf each relevant wrong state has an effective free-energy disadvantage at least Delta and R incorporates the concentration-weighted state degeneracy relative to the correct set, W_W/W_C <= R exp(-Delta/kBT). This proves the manuscript inequality. If a wrong state has an extra 20 equivalent orientations, include that factor in R or in its free energy, not both.\n\nWith additive matched contacts and minimum d mismatches, Delta >= d epsilon only if all allowed partial bindings, rotations, elastic deformations, alternative registers, and cooperative contacts satisfy that bound. Hamming separation of nominal words alone is insufficient. A particularly dangerous wrong state matches a shifted substring while avoiding the nominal mismatches entirely. Geometric keys and simulation of the complete port free-energy landscape are essential.\n\nFor target conditional wrong probability delta_b, the sufficient gap is kBT ln[R(1-delta_b)/delta_b]. When R=10^6 and delta_b=10^-6 this is about 27.63 kBT. An ideal mismatch penalty 3 kBT and d=10 would exceed that requirement; this numerical example is not a measured DNA-port property. Actual energies must be computed using sequence-specific thermodynamics and calibrated in the intended buffer, then compared with kinetic residence times.\n\n", "source_path": "docs/TECHNICAL_SUPPLEMENT.md", "source_line_start": 54, "source_line_end": 63, "source_sha256": "1943d2ebca9c5f5b133e07df81a1d467660abacaf00a42b6be64d7bef23697d2", "text_sha256": "ae0154bd24041b10c7c68ef7f673e6b751cf1487d0daff1174d1b193584d6b5d", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "technical_supplement:08:01", "document": "technical_supplement", "heading": "S6. Driven kinetic proofreading and exact model equations", "text": "## S6. Driven kinetic proofreading and exact model equations\n\nThe state set is E, C_0 through C_r, W_0 through W_r, A_C, A_W. Here r is the number of additional checks; the final transition is metastable capture. E binds at lambda_C and lambda_W. Every bound intermediate of type s detaches at d_s and progresses at mu. A_C and A_W are absorbing only during the local assembly assay; subsequent hold loss or conversion is handled explicitly. The master equation is dp/dt=pQ and the initial condition is E. This is a continuous-time stochastic kinetic realization of the requested dynamics.\n\nThere are no reverse progress transitions in the benchmark. Physically that is an approximation to strongly driven checking/capture, consuming fuel or controlled process work. It cannot be interpreted as a closed equilibrium system with extra free discrimination. A future implementation must measure reverse leakage and fuel stoichiometry. The relation d_W/d_C=exp(gap) assumes equal on-rates and prefactors for preliminary binding; it is not a universal kinetic identity.\n\nFor a trial of type s, probability of reaching capture before detachment is:\n\n$$\na_s=\\left(\\frac{\\mu}{\\mu+d_s}\\right)^{r+1}.\n$$\n\nRenewal at E gives eventual wrong-capture fraction lambda_W a_W/(lambda_C a_C+lambda_W a_W). With pi_s=lambda_s/(lambda_C+lambda_W), the mean duration of a bound trial is (1-a_s)/d_s for positive d_s. The exact mean completion time is:\n\n$$\nT=\\frac{1/(\\lambda_C+\\lambda_W)+\\sum_s\\pi_s(1-a_s)/d_s}{\\sum_s\\pi_s a_s}.\n$$\n\nThe zero-d limit is (r+1)/mu. Expected progress transitions per completed capture are [sum over s of pi_s times sum from j=1 to r+1 of (mu/(mu+d_s))^j] divided by sum pi_s a_s. Multiply by a measured free-energy consumption per transition to obtain a chemical-work budget. This expression counts rejected attempts. It does not include sorting, cooling, fluid transport, feedstock synthesis, or the work to establish the reservoirs.\n\n**Time allocation.** Flat protocols expose N-1 ideal sockets to N decorated variants. Hierarchical protocols expose four variants and divide N-1 joins among levels. Local stage time is allocated proportional to inverse correct association rate, while holding total deadline fixed. At higher levels c_l=c_0 b^[-alpha(l-1)]. Alpha=1 represents fixed primary-material concentration; alpha=0 assumes module concentration is restored externally. The latter is a deliberate resource-relaxed comparison, not free acceleration. Increasing module concentration eventually runs into excluded volume and viscosity limits.\n\n**Retention and locking.** Unlocked captures survive remaining stages with exp(-k_hold times age). Locked captures pay a 60-second processing interval, hold loss during that interval, and conversion error p_fusion. Previously correct captures are converted to wrong outcomes with that probability. False captures stay false. Internal faults are never silently reset to zero at the next level. Per-level probability products assume ideal provision of all competent children; actual module procurement and gate failures would need an additional coupled simulation. Thus the benchmark perfect-yield column is conditional on supplied stage inputs.\n\n**Validation.** Matrix exponentials give exact finite-time probabilities for this finite-state model up to numerical error. Solving the transient generator gives mean first passage and total progress events. Gillespie sampling uses the same rates with independently sampled trajectories, and is checked within six binomial standard errors plus a finite-sample cushion. This validates implementation consistency, not the physical model. Three validation cases use unequal on/off rates, zero versus two extra checks, and finite versus near-asymptotic deadlines.\n\n**Omitted physics and required next models.** Brownian hard-body dynamics with registered patches; explicit strand thermodynamics; payload loading dispersion; finite inventories and module-dependent concentrations; off-target cluster nucleation; hydrodynamic/crowding effects; repair accessibility; and conversion-induced correlated displacements. Only after fitting such models to measurements should the present regime maps be used for engineering forecasts.\n\n", "source_path": "docs/TECHNICAL_SUPPLEMENT.md", "source_line_start": 64, "source_line_end": 91, "source_sha256": "1943d2ebca9c5f5b133e07df81a1d467660abacaf00a42b6be64d7bef23697d2", "text_sha256": "302fb46d669e3f2f21536438ddad8bd577d94d42ebb06b863ff18c5d0ea38f79", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "technical_supplement:09:01", "document": "technical_supplement", "heading": "S7. Active-interface proposition A1", "text": "## S7. Active-interface proposition A1\n\nA stage specification lists intended complementary interface classes. Its conflict graph connects two classes exactly when assigning their recognition codes identically would permit a wrong reaction in that stage. Classes include orientation and joint-role labels. Identical replicated submodules may share a class only if exchanging them is harmless to the target specification. Assume that each non-conflicting same-code pair is physically unable to create a wrong accepted attachment, and different codes meet the qualified error bound.\n\n**Claim.** A proper coloring gives a safe logical palette in the ideal zero-cross-talk, zero-gate-leakage model, with no more than maximum degree plus one codes. Over a staged process, the palette can be reused with size equal to the maximum such bound if all retired ports are inaccessible and stage isolation is exact.\n\n**Proof.** Greedily color vertices in any order. At each vertex, at most Delta_graph already colored neighbors prohibit colors, so Delta_graph+1 colors suffice. Conflicting classes then differ in color. By assumption a nonconflicting pair sharing a color cannot make a wrong attachment; distinct colors do not cross-react in the idealization. Completed stages contribute no accessible old ports, so the argument applies inductively to the next stage using the same palette. End of proof.\n\nThe assumptions perform much of the physical work. A uniformly mixed suspension of distinguishable modules often has a complete or dense conflict graph, not bounded degree. Compartmentalization or activation can reduce conflicts but consumes space, time, valves, masks, or stored instructions. For an arbitrary target, the schedule may require O(N) bits and bins even with a constant chemical palette. This proposition is not a claim of a new constant-glue universality result beyond staged tile assembly.\n\n**Nonzero error accounting.** For J exposure events, retirements R, and transformations F, assign probability bounds e_j, rho_i, and phi_k on failures after the applicable correction. A union bound gives total failure <= sum e_j + sum rho_i + sum phi_k, without independence. This is conservative but robust to correlation. If any error already included in a module contract is also counted as a child fault, avoid counting it twice; maintain a disjoint event accounting convention.\n\n", "source_path": "docs/TECHNICAL_SUPPLEMENT.md", "source_line_start": 92, "source_line_end": 103, "source_sha256": "1943d2ebca9c5f5b133e07df81a1d467660abacaf00a42b6be64d7bef23697d2", "text_sha256": "7f49f7943e2056fb10ab1363dad05bee77c755f573c47155e83e9f7dffeb79ae", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "technical_supplement:10:01", "document": "technical_supplement", "heading": "S8. Conditional fault-tolerance theorem F1", "text": "## S8. Conditional fault-tolerance theorem F1\n\n**Assumptions.** An encoded implementation of one specified logical module operation contains at most B suboperations with disjoint physical supports. It returns a correct logical state whenever fewer than r of these suboperations are faulty. Every failure therefore contains an r-subset from a list of at most C malignant subsets. At level h, the probability that every location in any selected s-subset is faulty is at most p_h^s. Gate, sensor, repair, retirement, and fusion faults are included. The encoded operation preserves the representation required by the next level, does not amplify an accepted correctable fault, and is physically repeatable.\n\n**Proof.** For every malignant r-subset S, the local-stochastic bound gives probability at most p_h^r. Union over at most C subsets gives p_(h+1) <= C p_h^r. Put a=C^(1/(r-1)) and y_h=a p_h. Then y_(h+1) <= y_h^r; induction gives y_h <= y_0^(r^h). Thus p_h <= a^-1 y_0^(r^h). If y_0<1, this tends to zero. End of proof.\n\nFor Q logical operations, the union bound gives system failure at most Q p_h. The sufficient condition for Q p_h <= delta is r^h >= ln[Q/(a delta)]/ln(1/y_0) when the logarithm is positive. Physical overhead B^h is a power of ln(Q/delta), with exponent ln B/ln r. This is a logical-functional reliability theorem. It does not establish that every microscopic constituent is defect-free.\n\n**Example.** B=8, r=2, C=28 gives a sufficient threshold p_c=1/28, provided a real gadget correcting every single suboperation fault exists. With p_0=0.01 the bound at levels 1-5 is 0.0028, 2.1952 x 10^-4, 1.3493 x 10^-6, 5.0977 x 10^-11, and 7.2761 x 10^-20. These are recurrence values, not observed material defects. We do not possess the required eight-location physical gadget. The kinetic Markov model is not such a gadget and cannot establish this threshold.\n\n**Floors.** With p_(h+1) <= C p_h^2+eta, the fixed points of the equality are [1 +/- sqrt(1-4C eta)]/(2C). If the discriminant is nonnegative, the smaller is stable and the larger is the boundary of the scalar contraction basin. A supersolution can supply a sufficient bound; equality is not implied by an upper-bound recurrence. If eta persists, no bound tending to zero follows. A common-mode event corrupting all B children with probability rho violates the p^s hypothesis and must be charged separately.\n\n**Microscopic perfection.** Suppose uncorrected final processing independently damages each of N essential sites with probability eta>0. Then perfect-object probability is at most (1-eta)^N. No upstream recognition code changes this. Protect the final process itself, repair afterward, or change the goal to a defect-tolerant function. This counterexample invalidates a naive inference from reliable module exteriors to atom-perfect interiors.\n\n**Finite lifetime.** A part is not qualified merely by surviving assembly. With independent failure hazard lambda and repair rate mu, a simple two-state steady-state defect fraction is lambda/(lambda+mu). Fault correlations and inaccessible repair paths break this model. An Arrhenius retention estimate tau=tau_0 exp(E_a/kBT) requires measured activation barriers and mechanisms. The union bound for N independent essential joints over mission time T roughly requires tau >= NT/delta if no repair exists. Neither a covalent bond energy alone nor room-temperature morphology establishes service lifetime.\n\n", "source_path": "docs/TECHNICAL_SUPPLEMENT.md", "source_line_start": 104, "source_line_end": 119, "source_sha256": "1943d2ebca9c5f5b133e07df81a1d467660abacaf00a42b6be64d7bef23697d2", "text_sha256": "daf9e4e4488e67b166b067141c583d15a7c5d8e8b3c6f77fe8cf07e0cb867ca2", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "technical_supplement:11:01", "document": "technical_supplement", "heading": "S9. Functional risk and local observation limits", "text": "## S9. Functional risk and local observation limits\n\nFor binary local defects D_i, suppose a verified deterministic sensitivity bound says functional deviation <= sum w_i D_i plus the nominal design error. Then the expected defect contribution is at most sum w_i p_i regardless of correlation. Markov's inequality gives probability of exceeding epsilon_f at most sum w_i p_i/epsilon_f. This supplies a conservative functional acceptance target. The weights must bound worst-case relevant defects; an ordinary derivative at a stable nominal point is insufficient for cracks, shorts, and percolation transitions.\n\nIf error-suppression cost is modeled as sum c_i ln(1/p_i), minimization under sum w_i p_i <= delta epsilon_f gives p_i=c_i/(lambda w_i), subject to upper/lower feasible limits. The multiplier is fixed by the constraint. This allows less precision in low-sensitivity regions without pretending all defects are harmless. The logarithmic cost model is an assumption, not a thermodynamic law.\n\nSublinear global readout does not mean sublinear total local work. In a local-probe model where one probe inspects at most a fixed number of sites and a single hidden defect is uniformly distributed among N sites, k probes detect it with probability at most O(k/N). Constant detection probability requires Omega(N) site interactions. Distributed parity checks or function tests may give a short readout, but creating and maintaining those checks involves physical interactions across the encoded object. Global optical observables fall outside the local-probe assumption and certify only what their response is sensitive to.\n\n", "source_path": "docs/TECHNICAL_SUPPLEMENT.md", "source_line_start": 120, "source_line_end": 127, "source_sha256": "1943d2ebca9c5f5b133e07df81a1d467660abacaf00a42b6be64d7bef23697d2", "text_sha256": "59eb8dccebf6e015c72144121a10c41d35aa059db85b02982413de79168d4c6b", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "technical_supplement:12:01", "document": "technical_supplement", "heading": "S10. Hierarchy, transport, and instruction complexity H1", "text": "## S10. Hierarchy, transport, and instruction complexity H1\n\nA full b-ary tree with N=b^L leaves has (N-1)/(b-1) parent nodes and N-1 child-merging edges when each parent joins its b children with b-1 operations. The longest ancestor path has L parent stages. A repeated identical assembly rule can be encoded as a loop with a binary N, giving O(log N) bits under an explicit interpreter. An expanded stage list uses O(log N) fixed-size records. Unique shapes and material patterns need extra program information.\n\nFor compact modules, radius a_l scales as b^(l/3). Stokes-Einstein diffusion scales as inverse radius. The equal-sphere Smoluchowski collision constant is 8 kBT/(3 viscosity), independent of radius, before angular/capture penalties. In water near 300 K, the ideal coefficient is about 6.6 x 10^9 per M per second, obtained by unit conversion; successful registered capture can be orders slower. At constant total primary mass concentration, number concentration falls approximately b^-l, so collision times grow approximately b^l. Summing levels gives O(N) rather than O(log N) for that idealized passive transport regime. Boundary-fed growth, convection, anchored assembly, and larger handling units can change this law, but add mechanisms and resources.\n\nFor worst-case K-labelings of N distinguishable cells, if no errors are allowed there are K^N possible targets, demanding N log2 K bits for a one-to-one program code in the worst case. If up to fraction f substitutions are allowed, each approximate output covers at most about $2^{N H_2(f)}(K-1)^{fN}$ labelings, for f below the meaningful distortion limit. Counting gives a worst-case lower bound near N[log2 K-H2(f)-f log2(K-1)], up to lower-order terms. The lower bound counts external templates and feedstock recipes if they encode target-specific information.\n\n", "source_path": "docs/TECHNICAL_SUPPLEMENT.md", "source_line_start": 128, "source_line_end": 135, "source_sha256": "1943d2ebca9c5f5b133e07df81a1d467660abacaf00a42b6be64d7bef23697d2", "text_sha256": "cd023c4f3f65ea4e6816593d96c31a47a01ba889a6b49458ccaf62d99eb43b90", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "technical_supplement:13:01", "document": "technical_supplement", "heading": "S11. Adaptive resolution and sparse-framework proposition S1", "text": "## S11. Adaptive resolution and sparse-framework proposition S1\n\nFor volume dimension d, minimize integral h^-d subject to integral s h^a <= epsilon, with positive a, finite domain, and resolution bounds. The pointwise stationarity condition is -d h^(-d-1)+lambda a s h^(a-1)=0. Solving gives the pitch formula in the manuscript. On regions where s=0, choose the maximum feasible pitch. Discrete grid grading, process-specific minimum features, and connectivity constraints must then be imposed. The mathematical optimizer is not proof that a manufacturable mesh exists.\n\nFor a piecewise smooth surface with area A, reach bounded below at scale h, and bounded multiplicity, an h-cover has O(A/h^2) patches. A fine functional subvolume V_f needs O(V_f/h^3) cells; coarse bulk V_b needs O(V_b/H^3) handles or coarse cells. Adding gives the sparse-framework bound. The physical sufficiency assumptions are: the patches assemble into a shape-preserving accessible framework; material-selective filling realizes each intended phase; filling is compatible with the embedded devices; excess/scaffold removal does not exceed the final error budget; and process time and yield are finite and separately budgeted. Dense internal interfaces make A large and remove the advantage. Surface encoding cannot specify an arbitrary three-dimensional dopant map without some additional generative rule.\n\n**Conditional synthesis proposition U1.** Let a target family satisfy geometric approximation G1 at h; possess a finite qualified response dictionary covering its required material functions; admit an assembly schedule satisfying A1 with bounded active conflicts; admit transport times within the deadline; and have a final conversion map whose deviation in the target metric is bounded by epsilon_conv. If deterministic geometric/material/functional errors sum to at most epsilon-epsilon_conv, and the disjoint stochastic error budget is at most delta, the resulting fabrication plan meets the target specification with probability at least 1-delta.\n\n**Proof.** On the complement of the union of charged failure events, every module and process step meets its stipulated contract. Contract composition and the triangle inequality bound total deterministic deviation by epsilon. The union bound limits the excluded event probability to delta. End of proof. This result organizes sufficient conditions; it does not establish physical satisfaction of those conditions. There is no unconditional general-purpose manufacturing theorem hidden in U1.\n\n", "source_path": "docs/TECHNICAL_SUPPLEMENT.md", "source_line_start": 136, "source_line_end": 145, "source_sha256": "1943d2ebca9c5f5b133e07df81a1d467660abacaf00a42b6be64d7bef23697d2", "text_sha256": "25781a5c17afcee0b07fc88993253f2ea63f46a683a984cdf1ac9f151ece6fa0", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "technical_supplement:14:01", "document": "technical_supplement", "heading": "S12. Quantitative target resource scenarios", "text": "## S12. Quantitative target resource scenarios\n\nAll numerical entries below are derived geometry, illustrative thermodynamic bookkeeping, or explicit laboratory planning estimates. They are not demonstrated device yields. The reference kinetic rates are not transferable to these objects without calibration.\n\n| Target | N used for bookkeeping | Per-essential-join error for 99% perfect yield | 20 kBT per join at 300 K, ideal energy |\n|---|---|---|---|\n| Passive lattice | 400,000 | about 2.5 x 10^-8 | 3.3 x 10^-14 J |\n| Optical element | 80,000,000 | about 1.3 x 10^-10 | 6.6 x 10^-12 J |\n| Electrical network | 125,000 | about 8.0 x 10^-8 | 1.0 x 10^-14 J |\n| MEMS-like system | 825,000 | about 1.2 x 10^-8 | 6.8 x 10^-14 J |\n| Sparse nanofunctional machine | 81,000,000 | about 1.2 x 10^-10 | 6.7 x 10^-12 J |\n\nThe energy column counts one idealized step per join, with no proofreading rejection, and is neither a rigorous minimum for all manufacturing nor a wall-plug prediction. Multiplying by mean progress events from the kinetic model gives one possible molecular budget. Actual electricity must be measured as integral of instrument power over the accepted-batch process. For planning, 10 W for one day is 0.864 MJ and 100 W for one day is 8.64 MJ; these simple power-time scenarios apply to instrument operation, not one object in a parallel batch. Report energy per accepted object together with the batch size.\n\nExpected yield is presently unknown for every integrated target in this table. A meaningful conditional yield scenario is exp[-(N-1)p_eff] under independent uniform essential-joint faults and otherwise complete assembly. At p_eff=10^-6 this gives approximately 0.67, 1.8 x 10^-35, 0.88, 0.44, and 6.6 x 10^-36, respectively. Functional yield may be much higher if a proved device response tolerates local defects; correlated cracks or shorts may make it lower. An invented single expected-yield percentage would conceal this uncertainty.\n\nPurification requirements increase from removal of unfolded carriers and free particles, to removal of incomplete nanomodules, to functional acceptance of microassemblies. Yield must be reported before and after purification. For every target, measure dimensions before retention, after joining, after drying/packaging, and after environmental cycling. For electronics, inspect junction resistance and isolation; for optical objects, measure the full intended spectral band; for mechanical objects, include fatigue and fracture distributions, not only an initial modulus.\n\nA reasonable cost trajectory is initially dominated by unique oligonucleotide design and microscopy, then by payload production and fraction of rejected modules, and eventually by process compatibility and throughput. The program should track dollars per qualified carrier family, per accepted module, and per functional object. There is insufficient evidence for a credible universal dollar-per-gram target; no unsupported price forecast is supplied.\n\n", "source_path": "docs/TECHNICAL_SUPPLEMENT.md", "source_line_start": 146, "source_line_end": 165, "source_sha256": "1943d2ebca9c5f5b133e07df81a1d467660abacaf00a42b6be64d7bef23697d2", "text_sha256": "2ea7c75371c241d70f82661b48f8b856ad939c059bdeebe549913dd29ec4eabc", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "technical_supplement:15:01", "document": "technical_supplement", "heading": "S13. Detailed minimum experiment design", "text": "## S13. Detailed minimum experiment design\n\n**Test article.** A planar 4 x 4 arrangement of 16 DNA frames at 50-80 nm center pitch. A common wireframe carrier has dimensions chosen near 40-60 nm, with three-dimensional asymmetry to establish orientation. Four to six qualified variants carry gold or no gold, external seed/retention handles, and reporter sites. Selected neighboring gold-loaded carriers create 30-40 nm gold-particle dimers with an initial 10-20 nm gap; isolated particles supply optical references. Exact geometry is finalized by electromagnetic simulation and DNA-frame mechanics, not chosen solely for appearance. The main observable is a coupled-resonance sensor response, so the structure is a functional object.\n\n**Logical interface inventory.** Use four elementary sticky-end recognition pairs, four ordered slots per docking port, and a small subset of the 16-word [4,2,3] code. Two gating systems control inner versus outer ports. Four symbols mean eight complementary recognition strands before additional masks, anchors, displacement fuels, and staples. Port chemistry and total oligonucleotide inventory must be tabulated separately. Three non-collinear contacts plus asymmetry constrain orientation; a four-slot square with symmetric labels would not suffice.\n\n**Preparation.** Design one reusable scaffold route and changed exterior staple modules; fold each variant separately using a qualified origami protocol. Characterize frame dimensions and the distribution of unfolded/aggregated forms. Attach monodisperse gold particles through a protected set of handles and remove unbound particles. Screen particles and frames separately for silica-process compatibility. Quantify payload occupancy, dimensional dispersion, and port availability. Use a DNA-only retention control to determine whether Au loading changes hybridization behavior.\n\n**Operating window to screen.** Assembly buffer: near-neutral Tris or equivalent, pH 7.5-8.3, 5-15 mM MgCl2, with monovalent salt varied only after initial screening. Per-variant carrier concentration: 1, 5, and 20 nM. Candidate docking temperatures: 20, 30, and 40 C, plus temperature scans around the actual port melting transition. These values are a design-of-experiments starting range, not an optimized recipe. Free Mg concentration, residual chelators, particle passivation, and silica reagents can change the window.\n\n**Stage 0: qualify the interface.** Test intended ports, every incorrect selected code, rotated versions, one- and two-slot mutants, and offset-register decoys. Measure equilibrium occupancy and residence times. Use at least three separately prepared carrier batches. Fit on/off rates, uncertainty, and the fraction of persistent nonspecific aggregates. If wrong-state residence times overlap correct states so strongly that rejection cannot give a useful yield/fidelity trade-off, stop before building the full tile.\n\n**Stage 1: tetramers.** Mix components in compartments with only the required ports active. Anneal reversibly; then apply two timed activation/displacement cycles. The pulse is designed to remove weakly bound decoys and consume external strand fuel. It is not assumed to discriminate perfectly. A trial time grid of approximately 1, 10, and 60 minutes is an estimate; choose the eventual timing from measured residence distributions. Retain accepted tetramers with multivalent contacts, purify them, and cap unused internal recognition sites. Record material recovery and erroneous accepted joints.\n\n**Stage 2: port reuse.** Expose the outer ports using stage-specific masks and reuse the same elementary recognition pairs. Join four tetramers to form the tile. A leakage-control sample deliberately leaves inner ports uncapped. A separate comparison uses a fresh outer recognition palette. Together these isolate whether retirement enables safe reuse. Small-stage purification is allowed; it must not be described as autonomous nanoscale quality control.\n\n**Stage 3: material joining.** Screen gentle silica mineralization at room-temperature-compatible conditions based on qualified published DNA-silica methods [R12,R13]. Target an initial 2-5 nm nominal coating series, measured rather than inferred from reagent dose. Preserve intended optical gaps. Locate silica continuity at structural contacts by TEM/elemental mapping or tomography. If coating remains disconnected, the sample is coated but not fused. Scaffold removal is not required for this first experiment and must not be inferred from nuclease resistance alone. A later removal study needs independent structural and chemical checks.\n\n**Instrumentation.** Agarose gel or equivalent size separation; UV-visible absorbance; fluorescence distance reporters and time-resolved traces where available; AFM for an initial planar geometry screen; cryo-TEM or electron tomography for retained three-dimensional geometry; STEM/EDS or comparable elemental mapping for silica/gold; and dark-field single-object spectroscopy for correlated structure/function measurement. SAXS is optional for periodic scale-up. No single method certifies all needed properties.\n\n**Functional assay.** Deposit or tether tiles on a qualified transparent support without collapsing them. Record spectra of selected dimers and isolated reference particles. Change surrounding refractive index by a calibrated compatible solution increment, then reverse it. Require a repeatable reversible spectral change above five times spectral repeatability noise, with the pre-registered response direction checked by electromagnetic simulation. Measure a matched noncoupled-particle control. Do not promise an absolute resonance wavelength or sensing sensitivity before the geometry and optical model are calibrated.\n\n**Controls.** Randomized slot codes at fixed overall DNA amount; full coding with no rejection pulses; one-pot versus hierarchical mixing at matched concentration; uncapped retired ports; fresh versus reused outer palette; no silica; silica without correct preassembly; intentionally malformed carrier; and systematic port-mutant decoys. Instrument operators should classify connectivity without seeing the assembly condition. Optical selection must not remove malformed objects from the reported assembly-yield denominator.\n\n**Sample size and uncertainty.** Target at least 200 imaged final objects per condition across three independent preparation batches, reported separately. At an object yield near 50%, 600 independent objects would have a binomial standard error about 2%; batch and shared-template effects reduce effective independence, so use a batch-aware bootstrap or hierarchical model. To support a wrong-joint probability below 0.1% with zero observed failures needs about 3,000 effectively independent joints for a one-sided 95% upper bound using -ln(0.05)/n. If joints within an object are correlated, count independent objects/batches appropriately. Zero errors among a few pictures cannot establish an extremely low defect rate.\n\n**Pre-registered decision gates.** Correct topology and payload arrangement in at least 50% of recovered objects; carrier mass recovery at least 10%; at least tenfold lower wrong-retained-joint rate with rejection versus matched control, with uncertainty reported; less than twofold wrong-joint increase under outer-palette reuse versus a fresh palette; median post-conversion optical-gap displacement within 5 nm and no unreported tail-driven failures; continuous structural silica joints; and the reversible optical response criterion above. All seven are research acceptance thresholds. If one fails, record which physical contract failed. A lower bound or confidence interval that cannot resolve the target improvement is inconclusive rather than a pass.\n\n**What this experiment cannot show.** It does not validate millions of physical addresses, nanoparticle-to-single-crystal conversion, local replacement of buried defects, or recursive error contraction. The next experiment after success is fault-injected multi-module repair including conversion faults, at increasing module count with fixed total solids, not simply a larger attractive shape.\n\n", "source_path": "docs/TECHNICAL_SUPPLEMENT.md", "source_line_start": 166, "source_line_end": 195, "source_sha256": "1943d2ebca9c5f5b133e07df81a1d467660abacaf00a42b6be64d7bef23697d2", "text_sha256": "95f60a8a7b94385ef570cd11ffcc74978ace2cdbc388daa8abdb9c2ad5166a61", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "technical_supplement:16:01", "document": "technical_supplement", "heading": "S14. Failure experiments and simulation discriminators", "text": "## S14. Failure experiments and simulation discriminators\n\n| Failure hypothesis | Early test | Decision consequence |\n|---|---|---|\n| Additive code-energy model fails | Cross-talk matrix including shifted registers and rotations | Replace code metric by measured free-energy/kinetic incompatibility graph |\n| Reused ports reactivate | Multiple mask/unmask cycles with decoy modules | Add isolation or abandon the reuse route if leakage exceeds the risk budget |\n| Proofreading is only survivor selection | Count input/output mass and every discarded species, inject wrong joints | Do not infer correction from purified-image quality |\n| Correlated faults dominate | Shared-contaminant pulses, malformed master template, common temperature excursion | Estimate a common-mode floor; conditional threshold may not apply |\n| Fusion erases precision | Registered before/after tomography and spectroscopy | Change joining chemistry or relax the target class; no universal conversion claim |\n| Kinetics dilutes catastrophically | Scale module size at fixed primary mass concentration | Use a transport intervention and account for its resources, or stop scale-up |\n| Material interfaces dominate | Vary joint density and measure resistivity, modulus, thermal conductance | Infer interface impedance; constrain the reachable-property dictionary |\n| Library diversity grows per site | Track new payload/staple/processing recipes over unrelated target designs | Reassess general-purpose value against directed assembly and lithography |\n\n", "source_path": "docs/TECHNICAL_SUPPLEMENT.md", "source_line_start": 196, "source_line_end": 208, "source_sha256": "1943d2ebca9c5f5b133e07df81a1d467660abacaf00a42b6be64d7bef23697d2", "text_sha256": "80e81346473af9a96838ec8daa5fdc679c0324e269cbbec963e8d08e4863ec43", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "technical_supplement:17:01", "document": "technical_supplement", "heading": "S15. Prior-art matrix and claim ledger", "text": "## S15. Prior-art matrix and claim ledger\n\n| Area | Representative primary source | Established contribution | Difference and remaining gap |\n|---|---|---|---|\n| DNA origami | R1 | Programmable scaffold geometry | Carrier qualification and compatible payload conversion are additional tasks |\n| DNA bricks | R2,R5 | Large addressable three-dimensional assemblies | Distinct components and exact sequences are real inventory costs |\n| DNA material voxels | R3 | Scaffold-defined coordination independent of included object | General voxel idea is prior art; our integrated error budget is conditional |\n| Foldable modular voxels | R4 | Reconfigurable chains assembled from origami units | Machine-scale functional integration not established |\n| Crisscross assembly | R6 | Cooperative growth and combinatorial origami-component construction | Serious prior art against claiming new combinatorial addressing |\n| Staged and hierarchical tiles | R7,R8 | Small glue inventories and staged shape construction in formal models | Our active-conflict accounting is not an independent universality discovery |\n| Self-sorting and pathways | R9,R10,R29 | Competing targets, kinetic bottlenecks, nucleation control | Non-equilibrium physical schedule still must be designed |\n| Designed proteins | R11,R15 | Orthogonal interfaces and designed symmetric protein materials | Arbitrary heterogeneous material and process compatibility remain open |\n| Silica/mechanical metamaterials | R12,R13 | Inorganic transformation and mechanical function from DNA templates | A unified low-damage multi-material fusion process is absent |\n| Covalent locking | R14 | Programmed stabilization of DNA structures | Stable DNA is not continuous metal or semiconductor |\n| Kinetic proofreading | R16,R17 | Driven discrimination with time and dissipation trade-offs | Our protocol must physically realize its assumed rates |\n| Tile repair | R18,R19 | Error-correcting and self-healing constructions | Threshold idea itself is not new; conversion must be included |\n| Patchy colloids / superlattices | R20,R21 | Directional valence and programmed crystal assembly | Finite heterogeneous machines need many additional constraints |\n| Covalent frameworks | R22 | Periodic porous material assembled from molecular units | Not an arbitrary code-addressed face inventory |\n| Synthetic compartments | R23 | Coupling of compartment growth and information replication | Useful analogy for autonomous cycles, not a general fabricator |\n| Digital structural materials | R24 | Reversible assembly of functional cellular composites | Macro modularity is established; nanoscale joining is distinct |\n| Semiconductor directed assembly | R25 | Lithographic guidance plus self-organization | Supports hybrid manufacturing, not unrestricted circuitry from particles |\n| DNA plasmonics | R26 | Optical function from arranged nanoparticle geometry | Motivates the first sensor experiment; exact tile remains new/unbuilt |\n| Molecular machines | R27 | Driven directional motion in synthetic molecular systems | Work cycles and fuel are required; not arbitrary mechanical construction |\n| Computational tile universality | R28 | Formal simulation universality of an abstract tile model | Not chemical, material-property, or manufacturing universality |\n| Modular geometric interfaces | R30 | Shared scaffold/staples with independently tuned geometry and interaction | Strong prior art for reusable carrier/platform design |\n| Modular robotics | R31 | Physical replication/assembly with robotic modules in a restricted system | Does not establish nanoscale self-repair or universal feedstocks |\n| MOF platforms | R32 | Designed porous networks with functional composition | Coordination chemistry is not a general arbitrary-face address code |\n\nCentral mathematical claims G1, P1, P2, C1, C2, H1 are established mathematics or elementary consequences restated for this problem (A/B). A1, S1, and U1 are formal extensions/accounting constructions (C, priority unestablished). F1 is a conditional transfer of known fault-tolerance reasoning (B/C); its required physical module is an unresolved hypothesis (D). The experiment and sparse manufacturing framework are an integrated hypothesis (B/D). The code results are numerical results for the stated model; their novelty class is not evidence of physical truth.\n\n", "source_path": "docs/TECHNICAL_SUPPLEMENT.md", "source_line_start": 209, "source_line_end": 238, "source_sha256": "1943d2ebca9c5f5b133e07df81a1d467660abacaf00a42b6be64d7bef23697d2", "text_sha256": "b49c51b1892d820d513f90485cff274e32b7b44d9bd867fa523b24ccdf2ec68f", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "technical_supplement:18:01", "document": "technical_supplement", "heading": "S16. Independent second-pass audit", "text": "## S16. Independent second-pass audit\n\nA second conceptual pass was performed after the uniform-carrier design was specified. It was not an independent laboratory replication, peer review, or external-agent review. It identified five hidden assumptions: every volume needs an address; a correct exterior certifies an interior; hierarchy preserves concentration; fusion is error-free; and correct equilibrium favors fast pathways. Each was removed from the conclusion. The revised architecture programs sparse functional regions and boundaries, uses explicit module contracts, charges transport resources, models conversion error floors, and evaluates finite-time kinetics.\n\nNo further conceptual iteration resolves the absent physical correction primitive. More ambitious terminology would not change the constraints. The next meaningful update to this research must supply measured interface cross-talk, conversion error, and fault-injection data, followed by a calibrated spatial model.\n", "source_path": "docs/TECHNICAL_SUPPLEMENT.md", "source_line_start": 239, "source_line_end": 243, "source_sha256": "1943d2ebca9c5f5b133e07df81a1d467660abacaf00a42b6be64d7bef23697d2", "text_sha256": "c9e4438caef1e1aab9bfac6c7ab6f99e14659c16871a9ccf6e1cb54b5f8c83d8", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "references:01:01", "document": "references", "heading": "Primary-source bibliography and access notes", "text": "# Primary-source bibliography and access notes\n\nLiterature search date: 19 September 2026. Bibliographic dates use publication records, not search-engine crawl dates. This is a targeted scientific prior-art search; no patent freedom-to-operate conclusion is offered. Citations identify enabling evidence, not endorsement of this proposal. No external figures or source PDFs are redistributed.\n\n**R1.** Rothemund, P. W. K. (2006). Folding DNA to create nanoscale shapes and patterns. Nature. [Publisher](https://www.nature.com/articles/nature04586). DOI: 10.1038/nature04586. Scaffolded DNA origami; publisher abstract/bibliographic record accessed.\n\n**R2.** Ke, Y., Ong, L. L., Shih, W. M., and Yin, P. (2012). Three-dimensional structures self-assembled from DNA bricks. Science 338, 1177-1183. [Primary record](https://pubmed.ncbi.nlm.nih.gov/23197527/). DOI: 10.1126/science.1227268. PubMed and publisher records accessed; PMC full-text access was blocked during one attempt.\n\n**R3.** Tian, Y. et al. (2020). Ordered three-dimensional nanomaterials using DNA-prescribed and valence-controlled material voxels. Nature Materials 19, 789-796. [Publisher](https://www.nature.com/articles/s41563-019-0550-x). DOI: 10.1038/s41563-019-0550-x. Direct precedent for material voxels; publisher abstract and originating laboratory summary accessed.\n\n**R4.** Luu, M. T. et al. (2024). Reconfigurable nanomaterials folded from multicomponent chains of DNA origami voxels. Science Robotics 9, eadp2309. [Publisher](https://www.science.org/doi/10.1126/scirobotics.adp2309). DOI: 10.1126/scirobotics.adp2309. Indexed primary title/abstract found; direct publisher page failed during access. No precise method parameter is imported from this source.\n\n**R5.** Ong, L. L. et al. (2017). Programmable self-assembly of three-dimensional nanostructures from 10,000 unique components. Nature 552, 72-77. [Primary record](https://pubmed.ncbi.nlm.nih.gov/29219968/). DOI: 10.1038/nature24648. Bibliography verified in PubMed and author institution record.\n\n**R6.** Wintersinger, C. M. et al. (2023; online 2022). Multi-micron crisscross structures grown from DNA-origami slats. Nature Nanotechnology 18, 281-289. [Publisher](https://www.nature.com/articles/s41565-022-01283-1). DOI: 10.1038/s41565-022-01283-1. Publisher abstract accessed; includes more than 1,000 addressable slats from a combinatorial strand library. [Correction](https://www.nature.com/articles/s41565-023-01365-8) restores missing supplementary data; [author code](https://github.com/aersh/origamicrisscross).\n\n**R7.** Demaine, E. D. et al. (2008 preprint). Staged Self-Assembly: Nanomanufacture of Arbitrary Shapes with O(1) Glues. [Author preprint](https://arxiv.org/abs/0803.0316). Formal staged tile model, not an experimental constant-glue fabricator.\n\n**R8.** Demaine, E. D., Fekete, S. P., Scheffer, C., and Schmidt, A. (2015 preprint). New Geometric Algorithms for Fully Connected Staged Self-Assembly. [Author preprint](https://arxiv.org/abs/1505.07862). Fully connected polyominoes and polylogarithmic stages under a formal model.\n\n**R9.** Murugan, A., Zeravcic, Z., Brenner, M. P., and Leibler, S. (2015; preprint 2014). Multifarious assembly mixtures: Systems allowing retrieval of diverse stored structures. [Author preprint](https://arxiv.org/abs/1408.6893). Shared-component competing-target model; abstract accessed.\n\n**R10.** Benoist, F., and Sartori, P. (2026). Assembly Factors Resolve Speed and Encoding Bottlenecks in Multifarious Self-Assembly. PRX Life 4, 033021; published 27 August 2026. [Publisher](https://journals.aps.org/prxlife/abstract/10.1103/5w6h-l93l). DOI: 10.1103/5w6h-l93l. Primary abstract and publication record accessed. This recent prior art limits claims about inventing kinetic/encoding bottleneck relief.\n\n**R11.** Chen, Z. et al. (2019; online 2018). Programmable design of orthogonal protein heterodimers. Nature 565, 106-111. [Publisher](https://www.nature.com/articles/s41586-018-0802-y). DOI: 10.1038/s41586-018-0802-y. Publisher abstract and extended-data descriptions accessed; selected robust designs are not evidence that arbitrary protein voxels share their stability.\n\n**R12.** Michelson, A., Flanagan, T. J., Lee, S.-W., and Gang, O. (2023). High-strength, lightweight nano-architected silica. Cell Reports Physical Science 4, 101475. [Publisher](https://www.cell.com/cell-reports-physical-science/fulltext/S2666-3864%2823%2900254-0). DOI: 10.1016/j.xcrp.2023.101475. Primary indexed record and originating laboratory publication list accessed; not a source for a ready-made coating recipe in this release.\n\n**R13.** Kulikowski, J. et al. (2024). DNA-silica nanolattices as mechanical metamaterials. Matter. [Publisher](https://www.cell.com/matter/fulltext/S2590-2385%2824%2900154-1). DOI: 10.1016/j.matt.2024.03.020. [Author dataset](https://datadryad.org/dataset/doi%3A10.5061/dryad.g4f4qrfxz) accessed; indexed publisher abstract used. Direct full-text page was unavailable in one attempt.\n\n**R14.** Gerling, T., Kube, M., Kick, B., and Dietz, H. (2018). Sequence-programmable covalent bonding of designed DNA assemblies. Science Advances 4, eaau1157. [Primary record](https://pubmed.ncbi.nlm.nih.gov/30128357/). DOI: 10.1126/sciadv.aau1157. [Author full text](https://pmc.ncbi.nlm.nih.gov/articles/PMC6097813/). Designed ultraviolet-induced thymine crosslinks; this does not establish engineering-grade inorganic fusion.\n\n**R15.** King, N. P. et al. (2012). Computational design of self-assembling protein nanomaterials with atomic level accuracy. Science 336, 1171-1174. [Primary record](https://pubmed.ncbi.nlm.nih.gov/22654060/). DOI: 10.1126/science.1219364. Primary abstract/bibliography accessed.\n\n**R16.** Hopfield, J. J. (1974). Kinetic proofreading: a new mechanism for reducing errors in biosynthetic processes requiring high specificity. PNAS 71, 4135-4139. [Primary record](https://pubmed.ncbi.nlm.nih.gov/4530290/). DOI: 10.1073/pnas.71.10.4135. Driven discrimination precedent.\n\n**R17.** Murugan, A., Huse, D. A., and Leibler, S. (2012). Speed, dissipation, and error in kinetic proofreading. PNAS. [Publisher](https://www.pnas.org/doi/10.1073/pnas.1119911109). DOI: 10.1073/pnas.1119911109. Primary record accessed; time/energy/error trade-offs.\n\n**R18.** Winfree, E., and Bekbolatov, R. (2004 proceedings of DNA 2003). Proofreading Tile Sets: Error Correction for Algorithmic Self-Assembly. LNCS 2943, 126-144. [Publisher](https://link.springer.com/chapter/10.1007/978-3-540-24628-2_13). DOI: 10.1007/978-3-540-24628-2_13. Publisher abstract accessed.\n\n**R19.** Soloveichik, D., and Winfree, E. (2008). Combining self-healing and proofreading in self-assembly. [Author manuscript](https://www.dna.caltech.edu/Papers/selfhealing_proofreading_2008.pdf). Author PDF accessed through indexed text. Existing theoretical repair/self-assembly work.\n\n**R20.** Wang, Y. et al. (2012). Colloids with valence and specific directional bonding. Nature 491, 51-55. [Publisher](https://www.nature.com/articles/nature11564). DOI: 10.1038/nature11564. Primary indexed record accessed.\n\n**R21.** Park, S. Y. et al. (2008). DNA-programmable nanoparticle crystallization. Nature 451, 553-556. [Publisher](https://www.nature.com/articles/nature06508). DOI: 10.1038/nature06508. Primary publication record accessed.\n\n**R22.** Cote, A. P. et al. (2005). Porous, crystalline, covalent organic frameworks. Science 310, 1166-1170. [Primary record](https://pubmed.ncbi.nlm.nih.gov/16293756/). DOI: 10.1126/science.1120411. Primary bibliography verified.\n\n**R23.** Kurihara, K. et al. (2011). Self-reproduction of supramolecular giant vesicles combined with the amplification of encapsulated DNA. Nature Chemistry 3, 775-781. [Publisher](https://www.nature.com/articles/nchem.1127). DOI: 10.1038/nchem.1127. Primary abstract accessed; restricted synthetic-compartment result.\n\n**R24.** Cheung, K. C., and Gershenfeld, N. (2013). Reversibly assembled cellular composite materials. Science 341, 1219-1221. [Author manuscript](https://cba.mit.edu/docs/papers/13.09.Science.pdf). DOI: 10.1126/science.1240889. Primary bibliographic record and author PDF accessed.\n\n**R25.** Kim, S. O. et al. (2003). Epitaxial self-assembly of block copolymers on lithographically defined nanopatterned substrates. Nature 424, 411-414. [Primary record](https://pubmed.ncbi.nlm.nih.gov/12879065/). DOI: 10.1038/nature01775. Hybrid directed-assembly precedent.\n\n**R26.** Kuzyk, A. et al. (2012). DNA-based self-assembly of chiral plasmonic nanostructures with tailored optical response. Nature 483, 311-314. [Publisher](https://www.nature.com/articles/nature10889). DOI: 10.1038/nature10889. [Author preprint](https://arxiv.org/abs/1108.3752) abstract accessed. Evidence that nanoparticle organization can produce designed optical function; the proposed planar sensor is not copied experimental data.\n\n**R27.** Serreli, V., Lee, C.-F., Kay, E. R., and Leigh, D. A. (2007). A molecular information ratchet. Nature 445, 523-527. [Primary record](https://pubmed.ncbi.nlm.nih.gov/17268466/). DOI: 10.1038/nature05452. Primary abstract accessed; energy-driven molecular motion, not a perpetual machine.\n\n**R28.** Doty, D., Lutz, J. H., Patitz, M. J., Schweller, R. T., Summers, S. M., and Woods, D. (2012; preprint 2011). The tile assembly model is intrinsically universal. [Author preprint](https://arxiv.org/abs/1111.3097). Abstract and author text accessed. Model-specific computational universality.\n\n", "source_path": "docs/REFERENCES.md", "source_line_start": 1, "source_line_end": 60, "source_sha256": "5577927b2c60f2b367a565df595dbc1d740e45986ff91472c7edf32e6f47ea85", "text_sha256": "dbfbc5ae63221f190273f9374833c6fd066b0631332431d0ccb31705c3af41c3", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}
{"record_id": "references:01:02", "document": "references", "heading": "Primary-source bibliography and access notes", "text": "**R29.** Jacobs, W. M., Reinhardt, A., and Frenkel, D. (2015). Rational design of self-assembly pathways for complex multicomponent structures. PNAS 112, 6313-6318. [Publisher](https://www.pnas.org/doi/abs/10.1073/pnas.1502210112). DOI: 10.1073/pnas.1502210112. [Author preprint](https://arxiv.org/abs/1502.01351) abstract accessed; nucleation and time-dependent protocols.\n\n**R30.** Saha, R. et al. (2025). Modular programming of interaction and geometric specificity enables assembly of complex DNA origami nanostructures. Nature Communications 16, 11392. [Publisher](https://www.nature.com/articles/s41467-025-66195-9). DOI: 10.1038/s41467-025-66195-9. [Author preprint](https://arxiv.org/abs/2502.05388) and [PubMed](https://pubmed.ncbi.nlm.nih.gov/41381477/) accessed. Direct prior art for shared scaffold routing, reusable staples, and geometric/interaction programming.\n\n**R31.** Zykov, V., Mytilinaios, E., Adams, B., and Lipson, H. (2005). Self-reproducing machines. Nature 435, 163-164. [Author laboratory](https://www.creativemachineslab.com/self-replication.html). DOI: 10.1038/435163a. Publisher access failed; originating laboratory material is the evidence route for restricted modular robotics.\n\n**R32.** Li, H., Eddaoudi, M., O'Keeffe, M., and Yaghi, O. M. (1999). Design and synthesis of an exceptionally stable and highly porous metal-organic framework. Nature 402, 276-279. [Publisher](https://www.nature.com/articles/46248). DOI: 10.1038/46248. Primary abstract and bibliographic record accessed.\n", "source_path": "docs/REFERENCES.md", "source_line_start": 61, "source_line_end": 67, "source_sha256": "5577927b2c60f2b367a565df595dbc1d740e45986ff91472c7edf32e6f47ea85", "text_sha256": "631dc0d0a082462b16ecdc73ae39db5453caf1064781664872e13b2caca70774", "evidence_type": "mixed_source_text_read_claim_labels", "experiment_performed": false, "release_version": "1.0.1"}