M3.4 adds the candidate-generation experiment GENOME_MODEL describes: a static catalog of four effects over the seven capabilities, drawn from a recorded context with an explicit stream. The named risk is a hidden best build or offerings biased toward what would help, so the defence is structural rather than asserted. Nothing is ranked: candidates are drawn without replacement by rejection sampling, making every eligible operator exactly as likely as any other, and the result is returned sorted by operator ID. No score exists in the record, position carries no meaning, and nothing about an organism's situation makes a helpful mutation more likely to be offered. Eligibility is not a second rulebook. An operator is eligible when the genome it would produce passes the M3.1 validation unchanged, so prerequisites, required capabilities, ranges and the acyclic development graph are enforced once, where they were defined. Shedding a capability another declares as a prerequisite fails that check with no rule written here to catch it. Range boundaries are refused rather than clamped, since a clamp would make two operators agree and offer a no-op as a choice. The draw reads the parent digest and the context and nothing else, so the same context always returns the same candidates and a retry cannot reroll; a new event index is what earns a new draw. select_mutation regenerates the offer and refuses unless it still matches, so a changed context is rejected rather than answered with a different mutation. Cost is not invented: a candidate reports the successor's own maintenance and mass under ADR-0032, and reserves nothing. The eligible set is pinned by hand from the schema rather than observed, and the uniformity check is confirmed to fail against a draw that takes the first eligible operators. The rejection sampling that removes modulo bias is correct by construction, not test-verified: at this scale the bias is one part in 10^18. That is recorded rather than claimed. No organism mutates and no fixture calls any of this. Candidate count, mutation cost as a game rule, inherited versus acquired expression, NPC mutation and recombination all remain open, as GENOME_MODEL requires. Native Release, clang-tidy analysis, ASan and format checks pass 20/20. Co-Authored-By: Claude Opus 5 <noreply@anthropic.com>
Architecture decision records
Locked requirements outrank these records. Review architecture, ADRs, public contracts, tests, then implementation. Stop expanding implementation on conflict.
Adopted for proof applies only to the bounded initial headless slice. Proposed recommends without adopting a dependency. Deferred requires a named experiment. Later Accepted and Superseded preserve rationale. Proof choices do not silently settle gameplay or production infrastructure.
Records 0001–0015 cover language, build, dependencies, tests/benchmarks, ECS, ticks, randomness, serialization, units, errors, threads, logging, PostgreSQL, messaging and metrics. 0016–0019 cover durability/ownership, networking/security, infrastructure and voxels. 0020 scopes Gitea delivery and the stateless dev Job. Each record has the eight required sections. 0021 authorizes the opt-in ECS comparison only, not a production dependency. 0022 adopts the bounded sequential lifecycle-command scheduler for the proof. 0023 defines local periodic neighborhood queries and a measured linear baseline. 0024 adopts finite, typed energy/matter inventory transfers for M2.1. 0025 scopes finite capture, growth recipes and residual accounting for M2.2. 0026 adds shared community ownership and bounded synthetic feeding for M2.3. 0027 adds terminal inventory ownership and budgeted nutrient return for M2.4. 0028 adopts funded reproduction, bounded slot capacity and retained lineage IDs. 0029 scopes the deterministic ecosystem driver and bounded measured episodes. 0030 adopts the immutable genome v1 record, validation and canonical encoding. 0031 adopts deterministic development, derived phenotype and bounded plans. 0032 derives non-uniform metabolic budgets and the first genome/ledger path. 0033 adopts the bounded mutation catalog and uniform seeded candidate draws.
Every dependency adoption records exact version/commit and integrity hash, transitive license obligations, maintenance/security review, owner and removal boundary. Candidate performance and binary-size comparisons are hypotheses until benchmarked. Primary sources were reviewed during the initial September 2026 design. No unadopted candidate is a link dependency of the proof.