FrankenRobotics

Habitat: scenes, living worlds, clearance, retrofits

19,082 words38 subsections28 tables2 listingsPlan version 1.1

On this page38
19.1 What it owns19.2 Decisions19.3 The scene pack19.3.1 Optical cards and optical volumes19.3.2 Fixtures and declared behaviours19.3.3 What is shared and what is per world19.4 The scene compiler19.5 Scene acceptance19.5.1 Registration: four points, because three accept a reflection19.5.2 One-sided enclosures for clearance evidence19.5.3 Collision-to-visual deviation19.5.4 Optical properties are separate from friction19.5.5 Infeasible cases are kept, tagged and counted19.5.6 Acceptance fixtures19.6 Terrain generators19.7 Interior generators: seven archetypes19.8 Hazard lists19.9 Assets and licences19.10 Living worlds in three tiers19.10.1 The calculations that remove the naive versions19.10.2 Solid: film-friction patches and rigid proxies19.10.3 Frontier: robot-advected films19.10.4 Frontier: payload slosh19.10.5 Frontier: articulated cord and rug proxies19.10.6 Moonshot: coupled islands19.10.7 The proxy-adequacy pilot and the kill rule19.11 Clearance complexes (.fclear)19.12 The retrofit catalog19.13 Ingesting real places19.14 Train and test hygiene19.15 Memory arithmetic, brick pools and the world bank19.16 Refusals19.17 Invariants and proof obligations19.18 Known answers19.19 Gates and kill gates19.20 Open questions19.21 Far-field field reuse across forks19.22 Scaled instances: distances, normals and ray parameters in world metres

Owner crate: frob-scene (layer 2). Formats: .fscene (frob.scene/1) and .fclear (frob.clearance/1).

Labels in this chapter: default values (spacings, capacities, tile sizes) are DESIGN choices with the reason given where they are introduced; a worked example is a derivation from its stated premises and is not a measurement; every dimension of a place is assumed (§19.8); thresholds in gate tables are TARGETs; statements about sibling code or public sources are marked FACT with their source.

19.1 What it owns

Habitat owns every part of a world that is not the robot. That is: static geometry as distance fields; analytic overlays for features smaller than a voxel; articulated fixtures, movable objects and moving surfaces; the assignment of a contact interface and of an optical card to every surface region; optical volumes such as steam; the state of living matter in a world (films, sloshing payloads, cords, rugs); semantic labels, spawn regions, goals and route graphs; clearance complexes; the retrofit catalog; ingestion of real places; scene splits; and the world bank that keeps compiled scenes resident on a device.

Habitat does not own contact laws and cones (§18), ray kernels and sensor models (§20), task and requirement definitions (§24), mission queries (§25), adversarial search over scenes (§26) or calibration against measurement (§30). It supplies the objects those subsystems read and the typed scene edits they apply.

Object Type or format Read by
Scene pack ScenePack, manifest .fscene, identity SceneId Every subsystem that touches a world
Distance bricks, brick pool, variant directory Device buffers described by the manifest Traction (narrow phase), Sensorium (ray kernels), clearance
Analytic overlays Typed primitive list with a spatial index The same consumers as the bricks
Interface map and optical map Region table with two independent card references per region Traction reads the interface card; Sensorium reads the optical card
Fixtures, movables, moving surfaces Articulated models and rigid bodies compiled by Skeleton (§14) Kinesis (§16), Traction (§18)
Living-world state Film patches and tiles, payload modules, cord and rug proxies Traction (film friction), Kinesis (proxies), Sensorium (specular wet floors)
Clearance complex .fclear Atelier's maneuverability analysis (§28), Augur (§25), Nemesis (§26), the retrofit search
Retrofit catalog registries/retrofits.toml, typed scene edits with prices Nemesis, Augur, scene.retrofit
Scene split SceneSplit with group identifiers Arena (§24), Cortex (§23), the qualification lane
World bank Resident set of compiled packs with an admission ledger Spark's placement planner (§21)
Verb Kind First milestone Returns
scene.gen run M2 (terrain), M3 (interiors) A pack from (family, parameters, seed)
scene.compile run M2 A pack from source geometry, with compile receipts
scene.import run M3 (assets), M5 (real places) A pack with a loss report, a scale label and an unknown mask
scene.accept run M3 The acceptance report of §19.5
scene.list, scene.show read M2 The catalog (also an MCP resource), a manifest, the hazards drawn, the feasibility tag
scene.hazards read M3 The hazard registry of an archetype with the provenance of every dimension
scene.fit run M3 A feasibility witness, an impossibility cut or unresolved for a footprint family and a route (§19.11)
scene.retrofit run M3 The cheapest building amendment that flips a failing verdict, beside the cheapest redesign (§19.12)
scene.probe-request read M5 The measurements that would settle an unresolved answer (§19.13)
scene.split mutate M3 A split over scene groups, with feasibility counts (§19.14)
scene.bank read, admin M3 The resident set on a device, an admission estimate, eviction (§19.15)

Verbs that can run long (scene.gen, scene.compile, scene.fit, scene.retrofit) take the bounded synchronous wait of §32 and otherwise return a job handle.

19.2 Decisions

  • ADR-HAB-01: static geometry is a truncated signed-distance field in bricks, sampled by manual trilinear interpolation written in the kernel source. Reason: a distance field answers "how far, and which way" in constant time for any query point, which is what thousands of worlds need (§18), and hardware texture filtering uses fixed-point weights that differ between vendors and would break the determinism classes of §35.
  • ADR-HAB-02: a feature smaller than a voxel is an analytic overlay, never a voxel. Reason: thresholds, rug edges, cable covers, grate slots and drain slots are between a few millimetres and a few centimetres (§19.8), a 2 cm lattice cannot represent them, and they are the features that decide home, kitchen and plant missions.
  • ADR-HAB-03: contact properties and optical properties are two maps, joined only by declared shared latent variables. Reason: a glossy tile can produce a bad depth sample and low traction for unrelated reasons, and a model that ties them together fabricates a correlation.
  • ADR-HAB-04: the visual mesh is read by the viewer only. Physics, sensors and stills read the collision field. The deviation between the two is measured per region and reported (§19.5). Reason: one authority for geometry inside the model identity, and a presentation asset that can be replaced without changing a digest.
  • ADR-HAB-05: one scene serves many worlds. A device holds K scene variants in a shared brick pool and every world indexes one. One scene per world is not offered. Reason: the arithmetic of §19.15.
  • ADR-HAB-06: infeasible scenes are kept, tagged and counted. A generator never resamples to hide a scene in which the nominal robot cannot reach the goal. Reason: rejection sampling changes the distribution without saying so, and the studio's most useful answer to some missions is "impossible, and here is the bottleneck".
  • ADR-HAB-07: living matter enters in three tiers, and only the Solid tier is on the critical path. Reason: the strong form (coupled fluid, cloth and cables in training worlds) is refuted by the calculations of §19.10; a contact-level film law and rigid proxies stand in for coupled matter at negligible cost; whether they reproduce the failures of coupled models is decided by the pilot of §19.10.7.
  • ADR-HAB-08: a clearance question has three answers: a feasibility witness, an impossibility cut that names the bottleneck, or unresolved. Reason: a single traversability bit for a nominal footprint cannot be trusted for a rectangular or articulated body and cannot say why a body does not fit.
  • ADR-HAB-09: the building is a design variable. Scene edits are typed and priced, and a retrofit is compared with a robot redesign in one budget. Reason: a failure caused by a 20 mm threshold may be cheaper to remove from the building than from the robot.
  • ADR-HAB-10: unobserved space is unknown, not free and not solid. Occupancy is three-valued in every ingested scene, and each consumer states how it treats unknown. Reason: closing a scan can create a wall where a door exists, and leaving it open can create a route through a wall.
  • ADR-HAB-11: every dimension a generator draws carries provenance, and its provenance is assumed until a cited norm or a measurement is recorded. Reason: realism claims need sources (OPEN-HAB-1), and validity does not.
  • ADR-HAB-12: generated scenes cross machines as seeds and identities, never as voxels. Each machine compiles what it needs and checks the SceneId. Private real places do not cross at all unless exported with an explicit flag (§37). Reason: the division of labour between the machines (§21) and the privacy rule.

19.3 The scene pack

A ScenePack is immutable and content-addressed (SceneId). It contains:

  • A truncated signed-distance field in bricks, quantized to 16 bits, at a fine level near surfaces and a coarse level everywhere, plus an optional heightfield for open terrain (§19.4 gives the layout and the reason the field is truncated).
  • Analytic overlays for sub-voxel and sharp features: boxes, rounded boxes, wedges, cylinders and periodic bar patterns, each exact to round-off.
  • An interface map: for each surface region, a material and a condition (dry, wet, greasy, dusty), which select contact cards (§18).
  • An optical map: for each surface region, an optical card (§19.3.1), and a list of optical volumes with an extinction coefficient for steam and dust.
  • Shared latents: named scalar variables per region, such as wetness, that drive the interface condition and the optical response through separately recorded conditionals.
  • Semantic labels: room type, object class and a traversability class.
  • Articulated fixtures (doors, drawers, cabinet doors, swing gates, lifts, carts) as articulated models simulated by the same engine as the robot, because a door is a one-joint mechanism and needs no special case. Each fixture carries its parameter table (§19.3.2).
  • Movable objects (boxes, totes, chairs, pallets, toys) as rigid bodies, each with a declared behaviour.
  • Moving surfaces (conveyors, escalators) as contact surfaces with prescribed tangential velocity, the same mechanism as a track (§18).
  • Living-world declarations: film patches, sloshing payloads, cords and rugs, each at a declared tier (§19.10).
  • Spawn regions, goals, task regions and route graphs.
  • A visual mesh in GLB for the viewer, never read by physics or by sensors.
  • For ingested scenes: a three-valued occupancy mask (free, occupied, unknown), per-region confidence, the registration residual and a scale label (§19.13).
  • An acceptance report (§19.5) and a feasibility tag for the nominal footprint (§19.11).
  • Provenance: a licence manifest per asset; generator name and version; the resolved value of every randomized quantity; the count of dimensions whose provenance is assumed; a group identifier used by splits (§19.14); a privacy mark; and the no-authorization flags of §12.
{
  "schema": "frob.scene/1",
  "scene_id": "b3:9c1e…",
  "family": "kitchen-commercial/galley",
  "seed": "0x5eed0417", "group": "bldg-00417",
  "frame": "right-handed, z up, metres",
  "field": { "fine_m": 0.02, "coarse_m": 0.16, "truncation_m": 0.08, "bits": 16,
             "pool": "b3:41aa…", "directory": "b3:07d2…", "band_bricks": 41233, "bound_m": 0.0011 },
  "overlays": 212, "regions": 96, "fixtures": 14, "movables": 37, "optical_volumes": 2,
  "maps": ["interface", "optical", "semantic", "unknown"],
  "living": [{ "kind": "film-patch", "tier": "S", "region": 31, "thickness_m": 0.0004, "fluid": "water" }],
  "feasibility": { "footprint": "nominal-0.50x0.70", "tag": "witnessed", "fclear": "b3:e2f0…" },
  "provenance": { "generator": "frob-scene 0.3 kitchen", "licences": "b3:5b19…", "scale": "generated",
                  "dimensions_assumed": 23, "private": false },
  "acceptance": "b3:77c4…"
}

DESIGN: the manifest is canonical JSON; the numbers in this example are illustrative and are not results.

19.3.1 Optical cards and optical volumes S

An optical card describes how a surface region responds to the active and passive optical sensors of §20. It is a .fcard of kind optical with per-field provenance (measured, datasheet, assumed), in the same manner as an interface card.

Field Meaning Used by
class diffuse, glass, mirror, specular-floor, retroreflector, absorber, emitter Selects the ray rule of §20.6
r0 Reflectance at normal incidence, used in a polynomial Fresnel approximation Reflection weight for glass, mirrors and wet or polished floors
transmittance Fraction passed through a thin pane Through-glass returns
albedo_ir, albedo_vis Diffuse albedo in the sensor bands Return strength, speckle visibility
roughness Width of the specular lobe Whether a time-of-flight beam returns from a glossy surface off normal
retro_gain Retroreflective gain Saturation and bloom F
emission Emitted irradiance in the sensor band (lamps, sunlit patches) Ambient washout of projected patterns

An optical volume is a box or ellipsoid with an extinction coefficient σ in m⁻¹ and a backscatter albedo. Steam near a dishwasher, a kettle or a fryer, and dust in a warehouse, are optical volumes attached to a fixture with an on and off schedule.

DESIGN: a region without an optical card is a compile refusal (FROB-REF-316), not a silent diffuse. A generator that has no better information writes diffuse with provenance assumed, and the pack counts it. Reason: a default that nobody chose is how a glass wall becomes a painted one.

The contact condition and the optical class of a region are independent fields. Where physics couples them, the coupling is a declared latent: a region's wetness in [0, 1] selects the interface condition (dry or wet) through one recorded conditional and raises r0 and lowers roughness through another. Randomization draws the latent once, so a wet floor is both slippery and glossy in the same episode, and each conditional has its own provenance.

19.3.2 Fixtures and declared behaviours

Fixture Model Parameters, each with provenance Behaviour
Hinged door Revolute joint Hinge axis, leaf width and mass, closer torque law τ = τ₀ + k·θ + c·θ̇, latch state and release force, stop angle, handle geometry Articulated
Sliding door, including glass Prismatic joint Track friction, travel, optional sensor zone that opens it Articulated, or prescribed when automatic
Swing (saloon) door Revolute joint with a two-way centring spring Centring stiffness and damping, kick-plate height Articulated
Drawer, cabinet door Prismatic or revolute joint Detent force, travel Articulated
Swing gate, turnstile Revolute joint with a one-way limit Release torque Articulated
Lift Prescribed car motion with sliding doors Door timing, sill gap, level offset Prescribed
Conveyor, escalator Moving surface Belt speed profile, guard geometry Prescribed
Cart, castor chair, wheeled tote Free body with castor joints Mass, castor trail, rolling and swivel friction Free
People, forklifts, pets Kinematic capsule actors on route graphs F Speeds, yielding rule Prescribed

Every object that can move declares exactly one behaviour, and the choice is recorded in the episode manifest:

  • Static. Part of the distance field.
  • Articulated. Joints, limits and passive elements; pushing it transfers momentum and work.
  • Free. A rigid body that receives two-way impulses.
  • Prescribed. It follows a trajectory regardless of contact. It is an external energy source, and the energy ledger of §29 books the boundary work it does on the robot on its own line.

An object with no declared behaviour is a refusal (FROB-REF-315).

19.3.3 What is shared and what is per world

Bricks, overlays, maps and fixture parameter tables are immutable and shared by every world that indexes the scene. Fixture joint states, movable poses, film tiles, sloshing payload states and (where §18 admits them) rut fields are per-world mutable state allocated from fixed-capacity pools and addressed by world. They are part of every snapshot (§29).

INV-HAB-03 states the rule: a film tile wetted or a rut made in one world or one episode has no effect on any other world or any later episode unless the task declares persistence across episodes, and then only for that world address. The reset and checkpoint fixtures of §19.18 detect a leak.

19.4 The scene compiler

The compiler is a CPU job. Its stages are fixed and each writes a receipt into the acceptance report.

  1. Decode under limits. Bytes, nesting depth of instances, polygon count, texture and material counts are bounded by the import profile; relative references resolve inside the pack; missing assets and unit conversions are recorded. A violated limit is FROB-REF-303.
  2. Build the metric transform graph. Axes, handedness and units are mapped by an explicit matrix per source format. Negative and non-uniform scales are handled explicitly and baked before any support map or mass property is computed. Triangle winding is checked against the sign of the determinant of the composed node transform. The transform class of an import is established by §19.5.1 or the import is refused (FROB-REF-302).
  3. Tag. Each part is tagged support, keep-out, movable, jointed, optical-only, transparent, deformable-by-proxy or unknown. A door leaf is split from its static jamb, with hinge limits, friction and swept volume.
  4. Check watertightness and orientation, then compute signed distance with FrankenSim's distance-field machinery. FACT (frankensim at 483d09c682f2): fs-rep-sdf provides TiledSdf (dense Morton-tiled grids with a constructed error enclosure and sphere-traced raycasts), VdbGrid (a sparse tile tree, root map to 32³ internal nodes to 8³ bitmasked leaves, with deterministic iteration order), NarrowBand and AdaptiveSdf; fs-rep-mesh provides generalized winding numbers (exact, and an octree approximation whose error is measured against exact), a BVH mesh chart with watertight ray tests and a repair pipeline with receipts; fs-rep-frep provides constructive solids as a DAG with value and gradient, a Lipschitz bound and an interval range derived from the same graph; fs-topo provides manifold and self-intersection certificates. The three representation crates depend on fs-qty only through fs-evidence (their manifests), so the scene compiler carries the toolchain risk tested at INT-TOOLCHAIN-01 and reaches them through the airlock like every other FrankenSim crate (§33). A scene that fails the watertight check is refused (FROB-REF-301), not patched. An import may request the repair pipeline explicitly; every closed hole is then recorded with its receipt and marked derived: hole-fill, and its neighbourhood becomes an unknown region (§19.13).
  5. Emit bricks, the directory and the pool (below), with a recorded error bound per brick: FrankenSim's enclosure for the source chart, plus the trilinear interpolation error on the brick lattice, plus half a quantization step.
  6. Emit analytic overlays for every part tagged sharp or thinner than two fine voxels (ADR-HAB-02), and the overlay index.
  7. Emit the region table and maps: interface, optical, semantic, and for ingested scenes the unknown mask.
  8. Compile fixtures and movables through the model compiler of §14, settle the movables on the referee until kinetic energy falls below a threshold, and store the settled poses so that a reset does not start with falling clutter.
  9. Check spawn poses for interference and tip-over, compute the clearance complex for the nominal footprint and write the feasibility tag (§19.11).
  10. Run the acceptance fixtures (§19.5).
  11. Freeze. SceneId is the hash of the manifest, the compiler version and settings, units, tolerances, brick contents, overlays, maps and fixture tables. Device resources are allocated by the worker that loads the pack and are scoped to its manifest.

Field layout (DESIGN). The coarse level is a dense lattice of spacing S (default 16 cm indoors) over the whole scene. The fine level has spacing s = S/8 (default 2 cm) and exists only in band bricks: 8³ fine samples for each coarse cell that lies within the truncation distance of a surface. A per-variant directory holds one 32-bit pool slot per coarse cell; two sentinel slots stand for "far outside" and "deep inside". Stored values are clamp(φ, −T, +T), quantized to 16 bits, with T = 4 fine voxels (8 cm at 2 cm spacing).

The truncation corrects a defect of the earlier wording "quantized to 16 bits". Sixteen bits over a range of ±10 m resolve 20 m / 65,536 ≈ 0.31 mm, which at a contact stiffness of 10⁵ N/m is a force step of about 30 N (DESIGN arithmetic). Over ±8 cm the step is 0.16 m / 65,535 ≈ 2.4 µm, a ripple of at most half a step, or about 0.12 N per contact sample at the same stiffness. The speculative contact margin of §18 is always smaller than T, so contact never reads a clamped value. Ray kernels step by the coarse level where the fine level is absent.

Region labels in bricks (DESIGN). A band brick carries a palette of at most four region identifiers and a two-bit selector per sample: 128 bytes per brick, 12.5% over the 1,024 bytes of distance samples. A brick that touches more than four regions is recorded in the acceptance report and uses the nearest-region rule for the excess.

Overlays (DESIGN). The scene distance at a point is the minimum of the interpolated brick value and the exact distance to each overlay listed for that point's index cell. The index is a lattice of 0.64 m cells with eight overlay slots each; a cell that needs more is a compile refusal with the repair "bake at a finer level or raise the capacity" (FROB-REF-306). A periodic bar pattern (a floor grate, a drain cover) is one overlay: the query point is folded modulo the pitch and tested against one bar, which is exact and costs no more than a box. The minimum of exact distances is exact outside the union and a lower bound on depth inside it, which is the side contact uses.

Field sampling in kernels is manual trilinear interpolation in the kernel source, not hardware texture filtering (ADR-HAB-01).

19.5 Scene acceptance S

A compiled scene is not usable until its acceptance report is complete. Acceptance is a set of mechanical checks with known outcomes; none is a matter of taste. Verb: scene.accept. The report is part of the pack and its hash is in the manifest.

19.5.1 Registration: four points, because three accept a reflection

An imported scene is placed by a transform whose class must be established, not assumed. Three labelled, non-collinear landmarks and a known length fix a proper rigid registration. A reflection through the plane of the three landmarks passes the same three checks with zero residual.

Smallest case, checkable by hand: landmarks A = (0, 0, 0), B = (1, 0, 0), C = (0, 1, 0). The map (x, y, z) ↦ (x, y, −z) fixes all three, so a mirrored room registers perfectly. A fourth landmark D = (0, 0, 1), for example a ceiling marker, maps to (0, 0, −1) and shows a residual of 2 m. A gravity witness does not replace the fourth point: if the three landmarks lie in a vertical plane, the reflection through that plane preserves gravity.

Rule (DESIGN): an import whose format or pipeline admits a parity change or a general affine map requires four non-coplanar correspondences. With four, the affine map is determined; the compiler checks that its linear part L satisfies LᵀL = c²·I within the registration tolerance and det L > 0, and that c matches the scale witness. The tetrahedron of the four landmarks must have a volume of at least 1% (TARGET) of the cube of their largest separation, so that the fourth point is not nearly coplanar. A glTF camera looks along local −Z with +Y up (FACT: the Khronos glTF 2.0 specification, to be re-read before a gate cites it); the conversion to the optical frame of §20 is checked with an off-axis point in front of the lens. Failure of any of these is FROB-REF-302.

19.5.2 One-sided enclosures for clearance evidence

A statement that a body clears an obstacle, or that it must hit it, is made on enclosures, never on nominal surfaces.

  • The outer enclosure of a body or an obstacle contains every point it can occupy, given the field error bound, the registration residual, the pose uncertainty and the swept motion.
  • The inner enclosure is contained in the occupied set under the same uncertainties.

Disjoint outer enclosures establish clearance. Inner enclosures whose interiors intersect at the same time and pose, in one jointly admissible world, witness penetration in that world. Anything else is unknown and triggers refinement or a measurement request.

Smallest case: a nominal 6 mm gap at a doorway with 4 mm of possible outward error on each side. The outer enclosures overlap by 2 mm, so clearance is not established; the inner enclosures are 14 mm apart, so penetration is not witnessed. The verdict is unknown. Two further traps are tested: spatial sweeps of two bodies can overlap although the bodies are never in the same place at the same time, and a universal penetration claim must cover every admitted world, not one.

These enclosures are the cells of the clearance complex (§19.11) and the evidence behind any statement of the form "fits" or "cannot fit".

19.5.3 Collision-to-visual deviation

For each region tagged collidable, the compiler samples the visual mesh surface and evaluates the collision field there. It records two quantities and keeps their evidence types apart: a bounded deviation where the sampling density and the unit Lipschitz constant of a distance field give a bound (the largest sampled value plus the sample spacing), and a sampled deviation elsewhere. A region whose deviation exceeds half a fine voxel plus the brick bound is listed in the report and, above the pack's threshold, refused without a waiver (FROB-REF-317). Parts of the visual mesh with no collision counterpart must carry the tag optical-only.

Stills for agents are drawn from the collision field by ray kernels (§20.9), so an agent looks at what physics has. The viewer draws the GLB and can overlay the deviation as a heat map.

19.5.4 Optical properties are separate from friction

Three checks enforce ADR-HAB-03. Changing the optical card of a region leaves every physics digest unchanged in a run whose controller does not consume exteroception. Changing the interface card of a region leaves every ray-kernel output unchanged. Changing a shared latent changes both in the recorded direction. The fixture is one floor tile in four states: matte dry, glossy dry, matte wet, glossy wet.

19.5.5 Infeasible cases are kept, tagged and counted

Every generated scene carries a feasibility tag for the family's nominal footprint: witnessed, impossible with the cut attached, or unresolved (§19.11). A family may declare a quota of intentionally impossible scenes, tagged impossible: intended; scenes that are impossible without having been intended are tagged impossible: incidental. No scene is resampled because of its tag. Split manifests state the count in each class, scorecards state which classes entered a metric, and a success rate is always reported with its numerator and denominator.

19.5.6 Acceptance fixtures

Fixture What it checks Passing outcome
Metric calibration board A board of known dimensions placed in the scene is measured by ray kernels Measured lengths equal the known lengths within the brick bound
Door-clearance gauges For each door of clear width w and field bound b, a go gauge of width w − 2b and a no-go gauge of width w + 2b are swept through The go gauge passes and the no-go gauge is blocked
Normal-direction probe ∇φ at probes on each tagged surface Normals point out of solids; floor normals are +z within tolerance
Support test A unit block is released above each support surface on the referee It comes to rest on the surface; a floor that exists only in the renderer fails here
Ray and visual registration Identifier buffers drawn from the field and from the GLB at fixed viewpoints Silhouette overlap at or above the pack threshold
Quantization ripple A 10 kg block at rest on a brick floor with no overlay Normal-force ripple at most 1% of weight (TARGET)
Tile continuity Rays and swept wheels crossing brick and tile boundaries No gap or step at a boundary
Mutable-state leak Wet a tile in world i, reset, and read world j and the next episode of world i No trace outside the declared persistence

FACT: FrankenSim's fs-scene crate exists because robot experiments there had floors that were drawn by a renderer and absent from physics, so that a robot could stand inside the floor; the support test is the same guard.

19.6 Terrain generators S

Deterministic functions of (family, parameters, seed) with a scalar difficulty: flat ground, slopes, stairs (rise and run), single steps, gaps, stepping stones, rough ground (band-limited noise), rubble (random boxes), ramps and curbs. Families tile into a curriculum grid in the manner of the legged-locomotion benchmarks.

Open terrain is a heightfield; overhangs, vertical faces and culverts are overlays or band bricks on top of it. Soil laws under wheels, tracks and legs are Traction's (§18); Habitat supplies the material layers they read.

A mixed route family joins the two regimes: an exterior approach, a sill, a change of floor material and of lighting, and a jointed door into an interior. It exists because the transition is where timing, traction and sensing change at once, and neither a terrain family nor an interior family exercises it.

19.7 Interior generators: seven archetypes

Each archetype is a typed attribute grammar: Building → Floors → Rooms → Zones → Fixtures → Clutter, with dimensional constraints (door widths, aisle widths, counter heights, stair geometry) and a seed. Geometry is emitted as constructive solids and compiled by §19.4. Repeated modules (rack bays, shelving units, desks) are placed on the coarse lattice where the grammar allows, so that their bricks are identical and are stored once (§19.15).

Delivery is proxy first. The structural proxy of each archetype is S and lands at M3: boxes and fixtures with exact functional clearances, doors, ramps, thresholds, stairs, film patches, glass and mirror regions and a lighting level. Scenes populated from asset libraries are F and land at M5. Within M3 the warehouse and the commercial kitchen come first, because the M3 scenarios need them; the other five follow from the same grammar mechanism.

Archetype What it contains What it tests in a robot Failure quantity to expose
Home Rooms off a hallway, thresholds, rugs, stairs, furniture, cords, small floor clutter, pets and toys Step and threshold crossing, narrow doors, clutter avoidance Wheel slip at a rug edge, pitch excursion on a threshold, strike of an underslung load
Apartment Compact plan, tight turns, a lift lobby with a sill Turning radius, maneuvering index (C-07), docking Clearance distribution, turning envelope, odometry drift
Office Open plan with desks, castor chairs, carpet, glass doors and partitions, meeting rooms, repeated corridors Movable obstacles, carpet rolling resistance, door opening, sensing through glass Depth dropout on glass, localization ambiguity, chair contacts
Warehouse Long aisles, racking, pallets, totes, ramps, dock plates Speed and energy per metre with payload, ramp traction Rack strikes, load sway, cycle time, charge consumed
Manufacturing plant Machine cells, fences, conveyors, floor grates, oil patches, cable covers Moving surfaces, low-friction patches, keep-out zones Contact timing on a moving belt, boundary work, placement error
Retail store Shelving aisles, displays, checkout lanes, carts, glass-fronted cases Narrow aisles with movable carts, shelf reach Occluded obstacles, shelf strikes, stopping distance
Commercial kitchen Galley aisles, wet and greasy floor patches, drains, mats, swing doors, low shelves, steam Slip margin, swing doors, tight galley turns Low-traction turn, depth artifacts, acceleration of a carried container

Moving people, pets and vehicles are kinematic capsule actors on route graphs and are Frontier. They are scenario dressing: no claim about human behaviour is made from them, because it could not be checked.

For the two Frontier items of this section (asset-populated interiors and kinematic actors): the ceiling of the benefit is nil on decision time; they widen geometric and visual variety. Paper-scale pilot and falsifier: for one archetype, list the failure classes of the hazard registry and mark which a populated scene or a moving actor could provoke that the structural proxy cannot; if the list is empty the tier is not funded. ✖ KILL-DRESSING. Trigger: either item breaks the fixed launch shape or the determinism class of a batch, adds more than 25% to step cost, or exposes no failure class beyond the proxies on the M5 battery. Fallback: structural proxies and static clutter only.

FACT (public sources read on 2026-11-21, to be re-read from the primary source before a gate cites them): generators or builders of interior scenes are published for homes, kitchens, retail stores and warehouses; none was found for manufacturing plants or commercial kitchens. Interior generation is therefore not claimed as new. What this chapter adds to a generated interior is the hazard list with dimensions and provenance, the optical map, the feasibility tag with its cut, and the acceptance report.

19.8 Hazard lists

A hazard is a feature of a place that causes a specific robot failure. Each archetype has a hazard registry, registries/hazards/<archetype>.toml, and generators draw from it. A row has a name, a dimension range with units, a distribution, the mechanism that represents it, the failure it provokes, and a provenance field.

Every dimension in the tables below is assumed. The ranges are generic values chosen to make scenes valid; no building code, workplace regulation or product standard has been read for them, and none is cited. A row's provenance changes to norm: <citation> or measured: <dataset> only when the source is recorded in the source register, and a pack counts the assumed dimensions it used (dimensions_assumed in the manifest). A report that claims a scene is representative of real buildings is refused while that count is non-zero (FROB-REF-312). The full registries are in the appendix on robots, scenes, licences and hazard lists.

Home

Hazard Dimension (assumed) Represented by Failure it provokes
Interior door, clear width 0.70–0.90 m Jamb geometry, hinged leaf Footprint does not pass, or passes only at one heading
Threshold or door bar 5–25 mm high Overlay (rounded box) Small wheel stalls; pitch excursion; underslung strike
Rug or mat 5–20 mm thick; curled edge up to 30 mm Rigid slab S; hinged plates F Edge snag, rug pushed instead of climbed, slip on rug-over-hardwood
Cord or cable across a path 5–12 mm diameter Fixed ridge S; chain cord F Wheel or foot snag, entanglement
Stairs Riser 150–200 mm, tread 230–300 mm Overlays with exact nosings Step-height limit, toe strike, fall
Hallway 0.85–1.20 m wide Walls Turning envelope
Floor transition Hardwood to carpet, friction step Interface map Yaw disturbance, odometry error
Toys and small clutter 20–150 mm Free rigid bodies Ride-up, tip, blocked castor
Pets 0.2–0.6 m, moving Kinematic actor F Unexpected obstacle within stopping distance
Dim hallway Low ambient light Lighting level Camera exposure lengthens, motion blur

Apartment

Hazard Dimension (assumed) Represented by Failure it provokes
Entry door 0.80–0.90 m clear; closer torque 10–40 N·m Hinged leaf with closer Door cannot be pushed, or closes on the robot
Lift door and sill 0.80–1.10 m clear; sill gap 10–35 mm; level offset ±10 mm Prescribed car and doors; overlay for the gap Castor drops into the gap; door timing missed
Right-angle corridor turn Corridor 0.90–1.10 m Walls Body too long to turn (§19.11)
Balcony or sliding-door track 15–40 mm high Overlay Wheel stall
Compact kitchen galley 0.80–1.00 m aisle Walls and fixtures No room to turn with a payload

Office

Hazard Dimension (assumed) Represented by Failure it provokes
Glass door or partition Full height Solid geometry with optical class glass Not seen by optical ranging; collision
Castor chair Five castors, base radius 0.30–0.35 m, 10–20 kg Free body with castor joints Pushed into the path; legs under the scan plane
Carpet tile Rolling resistance step Interface map, rolling-resistance row Energy per metre rises; turn-in-place torque
Door closer 10–40 N·m closing torque Closer torque law Push capability exceeded
Cable cover 10–20 mm high, bevelled Overlay (wedge and box) Small wheel stall
Glossy lobby floor Low roughness Optical class specular-floor Phantom depth below the floor
Repeated corridors and doors Identical modules Grammar repetition Localization alias (§20.12)

Warehouse

Hazard Dimension (assumed) Represented by Failure it provokes
Aisle 1.5–3.5 m wide Racking Turning and passing limits
Rack beam, first level 1.2–2.0 m above floor Geometry above the scan plane Overhead strike of a tall body or raised load
Pallet 1.2 m × 0.8–1.0 m × 0.14–0.16 m Free or static body with fork openings Wheel caught in an opening; partial occlusion
Dock plate Lip 10–30 mm; slope up to 10% Wedge overlay; hinged plate Traction limit with payload; pitch at the lip
Ramp 5–10% slope Wedge Traction and thermal limit
Floor joint 10–25 mm wide Periodic or single slot overlay Castor drop, vibration
Stretch-wrap debris Thin film on the floor Low-friction patch; hinged plate F Slip, wrap around an axle
Dust Optical extinction and friction change Optical volume; interface condition dusty Range dropout; longer stopping distance
Identical aisles Repeated bays Grammar repetition Localization alias
Forklifts and carts Moving Kinematic actor F; free cart Collision within stopping distance

Manufacturing plant

Hazard Dimension (assumed) Represented by Failure it provokes
Conveyor Belt 0.1–1.0 m/s, 0.6–0.9 m high Moving surface Placement error on a moving target; boundary work
Floor grate Slot 15–30 mm, bar 5 mm Periodic bar overlay Foot or castor snag; twist at the contact
Oil or coolant film 0.05–1 mm thick, 20–100 mPa·s Film patch (§19.10) Slip that depends on dwell time and load
Cable tray or cover 15–40 mm high Overlay Stall, strike
Fence and keep-out zone Declared regions Keep-out tag Zone violation
Polished metal Mirror-like Optical class mirror Phantom points, glare
Floor vibration 5–50 Hz, small amplitude Prescribed floor motion F Estimator bias, loosened grasp
Chips and swarf Millimetre debris Interface condition; small free bodies Rolling-element slip

Retail store

Hazard Dimension (assumed) Represented by Failure it provokes
Shelving aisle 0.9–1.5 m wide; shelves 1.2–2.2 m high with lips Geometry Shelf strike; reach limit
Shopping cart 0.6 m × 1.0 m, 15–30 kg, castor front wheels Free body with castor joints Blocked aisle; cart pushed into a display
End cap Tight turn at an aisle end Geometry Turning envelope with payload
Glass-fronted case Glass with condensation Optical class glass with a fog latent Depth dropout or false return
Spill 0.1–2 mm film Film patch Slip
Entrance mat Edge 5–12 mm Rigid slab; overlay Edge snag
Checkout lane 0.6–0.9 m wide Geometry Footprint does not pass
Shoppers Moving Kinematic actor F Stopping distance

Commercial kitchen

Hazard Dimension (assumed) Represented by Failure it provokes
Galley aisle 0.9–1.2 m wide Fixtures Turn with a carried container
Wet floor Water film 0.1–2 mm Film patch with wetness latent Slip; specular depth artifacts
Greasy floor Oil or grease film 0.05–1 mm, 30–100 mPa·s Film patch Slip that persists through a stance
Floor drain Slot 8–15 mm; floor dished 1–2% Periodic bar overlay; sloped floor Castor drop; drift toward the drain on a film
Anti-fatigue mat 10–20 mm thick, bevelled, perforated Rigid slab; overlay Edge snag; mat slides on a wet floor
Swing door Two-way spring, closing torque 5–20 N·m Swing-door fixture Door returns onto the robot or its load
Low shelf 0.15–0.30 m clearance under counters Geometry Strike of a tall chassis; lost line of sight
Steam Plume near dishwasher, kettle, fryer Optical volume Range dropout, false returns
Hot liquid in a pot or tray Fill 30–80% Sloshing payload (§19.10) Spill; destabilizing oscillation at step frequency
Stainless steel Mirror-like Optical class mirror Phantom points
Cold-room threshold and strip curtain 10–40 mm; hanging strips Overlay; hinged plates F Stall; occluded sensors

The hazard registries also supply the rows of the scene-by-failure-mode incidence table from which evaluation batteries are selected (§28), so a battery can be asked which hazards it leaves uncovered.

19.9 Assets and licences

Only permissively licensed assets enter the default pipeline: fully procedural generators here; Infinigen (BSD-3) as an offline external generator; Google Scanned Objects (CC-BY 4.0); RoboCasa assets (CC BY 4.0, with MIT code) for kitchen fixtures. Research-only collections (HM3D, HSSD, PartNet-Mobility, BEHAVIOR-1K) are supported as user-supplied imports and are never redistributed (FACT and licences in the appendix on robots, scenes, licences and hazard lists; licences are re-checked at admission).

Each asset has a manifest entry with its licence and any restriction on redistribution, and the entry travels with every pack that contains the asset. A pack that would export a research-only or private asset is refused at pack time (FROB-REF-310, and §37). The starter pack ships only synthetic and redistributable fixtures.

19.10 Living worlds in three tiers

A place changes because a robot is in it: a wheel drags oil out of a patch, a carried pot sloshes, a castor pushes a rug into a fold, a cord wraps an axle. A scene whose only state is rigid geometry and a friction map cannot produce these failures. The strong response, coupled fluid, cloth and cable solvers in every training world, is refuted (§19.10.1). The plan therefore admits living matter in three tiers and keeps only the first on the critical path.

Tier Mechanism State it adds Evidence class of what it outputs First milestone
S Film-friction patches: a contact-level law in which friction on a wetted region depends on dwell time, load and pad size One thickness value per contact sample Estimated M3
S Rigid proxies: a rug as a thin free slab, a cord as a fixed ridge or a free rod, clutter and toys as rigid bodies Ordinary rigid bodies Tested M3
F Robot-advected films: a 2.5-dimensional film field the robot spreads and carries Sparse film tiles per world, one reservoir per contact body Estimated M6
F Payload slosh by an equivalent mechanical model One to three sprung masses per horizontal axis Estimated; Known answer for modal frequency M6
F Articulated proxies: a cord as a chain of rigid links, a rug as hinged plates Articulated bodies Tested M6
M Coupled islands: free-surface lattice fluid, implicit cloth, Cosserat rod, on the CPU referee for finalists only An island beside one world Estimated After M6, behind a flag

Capabilities of this kind are not new in the field. FACT (public documentation read on 2026-11-21, to be re-read from the primary source before a gate cites it): incumbent engines ship cables, cloth and particle solvers coupled to rigid robots, and one documents that it does not guarantee determinism for scenes with non-rigid bodies. Nothing here is claimed as a first. The claim is narrower: the Solid and Frontier mechanisms stay inside the determinism classes of §35 because they are rigid bodies, joints and integer-indexed fields.

19.10.1 The calculations that remove the naive versions

All of the following is DESIGN arithmetic from stated assumptions; none is a measurement.

  1. Memory of a room of fluid. A D3Q19 lattice in single precision with two population buffers needs 19 × 4 × 2 = 152 bytes per cell. A 10 m × 10 m × 3 m room at 1 cm is 3.0 × 10⁸ cells, or 45.6 GB for one world; at 5 mm it is 2.4 × 10⁹ cells, or 365 GB, more than the working-set limit of the large-memory machine. At 8,192 worlds the 1 cm case is about 374 TB. One cubic metre at 5 mm is 8 × 10⁶ cells and 1.22 GB.
  2. A spill is thinner than any affordable lattice. A film 0.1–1 mm thick needs cells of 0.25 mm or less to be resolved through its depth. One square metre of floor with a 4 mm slab of such cells is 4,000 × 4,000 × 16 = 2.56 × 10⁸ cells, or 39 GB per square metre.
  3. Lattice Mach number at control rate. The lattice sound speed is Δx/(√3·Δt), so a flow of speed u has Mach number Ma = √3·u·Δt/Δx. Stepping the fluid once per 50 Hz control tick (Δt = 20 ms) with u = 1 m/s gives Ma = 0.35 at 10 cm cells, 3.5 at 1 cm and 6.9 at 5 mm. FACT: fs-lbm declares MACH_LIMIT = 0.3 for its low-Mach regime (frankensim/crates/fs-lbm/src/lib.rs). To hold Ma at 0.1 with 5 mm cells the fluid needs Δt ≤ 0.29 ms, which is 70 fluid steps per control tick.
  4. Relaxation time. The lattice relaxation time is τ = 3·ν·Δt/Δx² + ½. For water (ν = 10⁻⁶ m²/s) at 10 cm cells and 20 ms steps, τ − ½ = 6 × 10⁻⁶; at 5 mm cells and the 0.29 ms step it is 3.5 × 10⁻⁵. A single-relaxation scheme is not stable that close to ½.
  5. Throughput. If coupled matter is active in 5% of worlds and the batch must keep at least a tenth of its rigid-only throughput, a coupled world may cost at most c rigid worlds, with 0.95 + 0.05·c ≤ 10, so c ≤ 181. FACT: the sibling cloth solver reports drapes that take tens of CPU seconds for a few thousand vertices and states that it has no GPU path by design (franken_textiles/README.md); the sibling rod solver states that it is fixture-scale statics and that dynamics on SE(3) are successor scope (frankensim/crates/fs-solid/src/rod.rs); FrankenSim lists GPU execution as not implemented (frankensim/README.md). A batched rigid step costs microseconds per world. The bound is missed by orders of magnitude.

Conclusion: no fluid lattice, cloth solver or rod solver runs inside a training batch. What the failures need is a friction that depends on contact history, and objects that can be pushed, lifted and wrapped. Both can be had from mechanisms the engine already has.

19.10.2 Solid: film-friction patches and rigid proxies

The film patch. A film patch is a region with a fluid class (density, viscosity η), an initial thickness h₀ and a wetness latent. In the Solid tier the patch is static and inexhaustible: the robot neither removes nor carries film.

Drainage under a contact. Each contact sample on a patch carries one state variable, the film thickness h under it, set to h₀ at first touch and reset when the sample leaves the patch. For a flat circular pad of radius R pressed with normal force F on a Newtonian film, the squeeze-film relation gives dh/dt = −2·F·h³ / (3π·η·R⁴) (FACT: Stefan's squeeze-film formula from lubrication theory, to be re-read from a primary source before a gate cites it). Equivalently

d(h⁻²)/dt = 4·F / (3π·η·R⁴),

so h⁻² grows linearly at a rate set by the load. The update h⁻²(t + Δt) = h⁻²(t) + 4·F·Δt/(3π·η·R⁴) is exact for a load that is constant over the step, is unconditionally stable, and needs one division and one square root, which the kernel dialect allows.

Friction from the film. With σ the combined roughness on the interface card, the film ratio is Λ = h/σ. The coefficient offered to the cone of §18 is μ = w(Λ)·μ_b + (1 − w(Λ))·μ_v, where μ_b is the boundary coefficient of the card for that condition, μ_v = min(μ_b, η·|v_t|·πR² / (h·F)) is the viscous shear contribution at tangential speed v_t, and w(Λ) = clamp((3 − Λ)/2, 0, 1) weights boundary contact fully below Λ = 1 and not at all above Λ = 3. The coefficient used in a step is computed from the state at the start of the step, so the contact solve of §18 stays convex. Habitat owns the patch and the thickness state; Traction owns the cone row that consumes μ.

Hand-checkable consequences. The time for a thick film to thin to h₁ is t = 3π·η·R⁴ / (4·F·h₁²). To reach 10 µm:

Pad and fluid (viscosities assumed) R F Time to 10 µm
Small foot on water, η = 1.0 mPa·s 20 mm 100 N 0.038 s
Small foot on cooking oil, η = 60 mPa·s 20 mm 100 N 2.3 s
Large flat foot on water 60 mm 400 N 0.76 s

Against a stance of about 0.3 s (assumed), a small foot on water reaches boundary contact within the stance, the same foot on oil does not, and a large flat foot on water does not. Friction on a film therefore depends on dwell time, load and pad size. A constant coefficient cannot express that, and no fluid grid is needed to express it.

Validity. The law assumes a smooth, rigid, flat pad. Treads and rough floors drain faster, so the drainage time is an upper bound and the predicted slip is pessimistic for treaded soles (HYPOTHESIS; the test is a spill-pad traction dataset imported through the Reality lane of §30, and until one exists every output of the law is Estimated and the Reality cell is no-claim). The roughness σ is assumed on every card until measured (OPEN-HAB-8).

Rigid proxies. A rug is a thin free rigid slab with its own rug-to-floor friction and an edge step. A cord is a fixed bevelled ridge where it is taped down and a free rigid rod where it is not. Toys, wet-floor signs, pallets and debris are free rigid bodies. A proxy uses no mechanism that §16 to §18 lack.

A fixed step is not a sufficient proxy for a rug, and the reason can be checked by hand. To push an undriven wheel of radius r carrying load W over an edge of height h takes a horizontal force W·tan α, with tan α = √(h·(2r − h)) / (r − h). A castor with r = 25 mm at a 10 mm rug edge needs 4/3 of its load: 67 N for a 50 N castor. A 2 kg rug resists sliding with about 0.5 × 19.6 N ≈ 10 N (friction assumed). The rug slides and folds long before the castor climbs it. A fixed step would simply be climbed or would block; a free slab reproduces the push.

19.10.3 Frontier: robot-advected films

What it is. The film thickness h(x, y, t) becomes a per-world field on a 2-dimensional lattice (cell edge Δx, default 2 cm) stored in sparse tiles of 16 × 16 cells that are allocated from a per-device pool when first wetted. Each contact body carries a reservoir volume V_res with a capacity. Owner: frob-scene for the field and its update kernel, frob-contact for the friction it feeds.

Update. Finite volume, conservative. For each cell, h ← h − (Δt/A)·Σ_faces F_f with face flux

F_f = [ 1_f·h_up·(v̄·n)_f − (g/(3ν))·h_f³·(∇h·n)_f ]·L_f,

where the first term is transport by the sliding contact (1_f marks faces under a contact patch, h_up is the upwind thickness, v̄ the mean tangential velocity of the patch) and the second is gravity spreading in the lubrication limit, with the face mobility taken as the arithmetic mean of the cubes, h_f³ = ½·(h_L³ + h_R³), so that a wet cell beside a dry one has a nonzero flux and the front advances (a harmonic or geometric mean gives zero and the spill never spreads). Under the step bound below the gravity term keeps h ≥ 0. Pickup moves volume from the cells under a contact into that body's reservoir; redeposition moves it back to the cells the body later touches. Each transfer is one paired statement, so what leaves one store enters the other.

Counterexample that seeds a negative control. Writing the transport as 1·∇·(h·v̄), with the contact indicator outside the divergence, creates or destroys film at the patch boundary. Three cells with h = (0, 1, 0), the indicator on the middle cell only and v̄ = +1: the masked update removes Δt/Δx from the middle cell and adds it nowhere. The face-flux form moves the same amount into the right-hand cell. The negative control runs the wrong form and must fail the mass gate.

Stability and refusal. Gravity spreading is a nonlinear diffusion with coefficient D = g·h³/(3ν). The explicit update is stable for Δt ≤ Δx²/(4·D), which bounds the thickness: h_max = (3ν·Δx² / (4·g·Δt))^(1/3). For water at Δx = 2 cm and Δt = 2 ms this is 2.5 mm; for a 65 mm²/s oil it is 10 mm (DESIGN arithmetic). A deeper liquid is not a film; it is refused or sub-cycled at admission (FROB-REF-307).

Cost. A tile is 1,024 bytes of thickness. Counting whole tiles of 0.32 m, a 6 m × 6 m floor fully wet is 19 × 19 = 361 tiles, about 370 kB per world; a 1 m × 1 m spill is 4 × 4 = 16 tiles, about 16 kB. An exhausted pool marks the world Degraded: film-pool. TARGET: at most 15% added step cost with a film active in every world.

Ceiling of the benefit, stated before any speed test. The mechanism adds cost and contributes nothing to throughput. Its benefit is the number of failure classes it produces that a static patch cannot, of which the clearest is a robot that tracks film onto a dry floor and slips on its own second pass.

Paper-scale pilot and falsifier. With a carried film of 20 µm, a transfer fraction of one half per wheel revolution and a roughness of 5 µm (all assumed), the deposited film stays at or above Λ = 1 for two revolutions, 1.26 m for a 0.1 m wheel. The pilot repeats this arithmetic over the admitted ranges of the three parameters. If the tracked low-friction length is under one wheel circumference across those ranges, advection changes no outcome and the work package is not funded.

Known answers. A constant volume released on a flat floor spreads with radius proportional to t^(1/8) in the axisymmetric case and front position proportional to t^(1/5) in the planar case (FACT: Huppert's similarity solutions for viscous gravity currents, to be re-read before a gate cites them). Total volume, cells plus reservoirs, is constant.

19.10.4 Frontier: payload slosh

A carried liquid is modeled by the standard equivalent mechanical model: a rigid mass fixed in the container plus, for each retained mode n, a mass m_n on a spring k_n = m_n·ω_n² and a damper, sliding horizontally at a fixed height. For a rectangular container of length L along the motion filled to depth h, the antisymmetric modes have

ω_n² = ((2n − 1)·π·g / L) · tanh((2n − 1)·π·h / L), n = 1, 2, 3

(FACT: linear sloshing theory, to be re-read from a primary source before a gate cites it). Modal masses and heights come from the same sources and are entered on a payload card with provenance; hyperbolic functions are evaluated on the CPU when the card is admitted, never in a batched kernel.

The model is a payload module with prismatic sprung masses, which are ordinary joints and passive elements, so it runs on every tier and inside every determinism class. Owner: frob-scene supplies the payload module; the model compiler of §14 lowers it.

Known answer: for L = 0.30 m and h = 0.10 m the first mode is ω₁ = 8.96 rad/s, 1.43 Hz. That lies inside the step-frequency band of walking robots (1–2.5 Hz, assumed), which is why a carried tray is a locomotion problem and not only a manipulation problem.

Validity: small amplitude. When a modal displacement exceeds a fraction of L set on the card, the result is flagged outside the validity domain; the model does not pretend to predict a wave that breaks. Benefit ceiling: none on throughput; it exposes resonance between gait and payload. Pilot and falsifier: on paper, compare ω₁ for the hazard list's container range with the step-frequency band; if they do not overlap for any admitted container, slosh cannot destabilize a gait and the work package is not funded. ✖ KILL-SLOSH. Trigger: the frequency gate fails after one repair cycle, or the sprung masses change no ranking of gaits or designs on the carried-container battery. Fallback: rigid ballast, with a spill metric computed from payload acceleration.

19.10.5 Frontier: articulated cord and rug proxies

Chain cord. A cord is 8 to 20 rigid capsule links joined by two-axis joints with bending stiffness and damping, lying on the floor with friction. It can be dragged, hooked by a foot and wrapped round an axle, which a friction patch and a fixed ridge cannot represent, because entanglement is a matter of topology. A cord is its own articulated island coupled to the robot only through contact, so its degrees of freedom enter the padded capacities of §17 and not the robot's mass matrix. Known answer: a chain 1.2 m long hung between supports 1.0 m apart sags 0.292 m (the catenary, with parameter a solving 1.2 = 2a·sinh(0.5/a)); 20 links reproduce it within 2% (TARGET).

Hinged-plate rug. A rug is two to four thin rigid plates hinged along lines parallel to a free edge, with torsional stiffness at the hinges and rug-to-floor friction. A wheel at the free edge can lift or fold it.

Cost, pilot and kill. TARGET: a world with one cord costs at most twice a rigid-only world of the same robot. Benefit ceiling: the count of failure classes found that the Solid proxies miss; none on throughput. The pilot is the proxy-adequacy experiment of §19.10.7, read in the other direction: its falsifier for this tier is that the fixed ridge and the free slab already reproduce the chain's and the plates' failures. ✖ KILL-PROXY. Trigger: that falsifier, or a cost above the target with no route to less. Fallback: Solid proxies in training batches; articulated proxies in evaluation batches only, or not at all.

19.10.6 Moonshot: coupled islands

An island is a small region of resolved matter beside one world on the CPU referee: a free-surface lattice fluid in a box of at most about one cubic metre, an implicit cloth for one rug or curtain, or a Cosserat rod for one cable. It is used for exactly two purposes: as an oracle against which the Solid and Frontier models are checked on finalists, and to verify a counterexample that Nemesis (§26) attributes to living matter. It never runs in a training batch and nothing on the critical path waits for it.

FACT: the pieces exist in the siblings as CPU code with their own evidence: fs-lbm has D3Q19 and D3Q27 lattices and a mass-tracking free-surface module whose ledger is gated every step; fs-tribo has a quasistatic Reynolds-film pressure solver and a regularized Stribeck friction law; fs-solid has geometrically exact rods for statics. fs-lbm and fs-tribo depend on fs-qty and are reached only through the airlock (§33). Dynamic rods and a batched cloth are not in the siblings. They are upstream work items (FD-FSIM-22, Appendix F), and no milestone waits on them.

Cost, from §19.10.1: one cubic metre at 5 mm holding Ma ≤ 0.1 at 1 m/s needs about 3,460 fluid steps of 8 × 10⁶ cells per simulated second. That is an offline computation.

19.10.7 The proxy-adequacy pilot and the kill rule

One experiment decides whether the Moonshot tier is ever funded, and it needs no new solver. On an incumbent engine that already ships cable and cloth (pinned by the rival audit of §39, used as an instrument outside the product): three scenes (a cord across the path, a rug with a free edge, one square metre of oil), 200 randomized episodes each, one wheeled and one legged robot. Rerun with the proxies of this section: a 20-link chain, a hinged thin plate, a friction patch, and the patch with the dwell-time law. The measure is the share of full-model failures that the proxy reproduces in the same failure class within one second. Estimated cost: one engineer-week and under ten GPU-hours (TARGET).

✖ KILL-LIVING. Trigger: the proxies reproduce 90% or more of the full-model failures, or an island costs more than 181 rigid worlds at 5% activity with no route to less. Fallback, named now: the Solid tier and the Frontier proxies are the product; coupled islands are not built beyond the oracle fixtures that already exist in the siblings, and reports say that deformable matter is represented by proxy.

✖ KILL-ADVECT. Trigger: the advected film fails its mass gate after one repair cycle, or costs more than 15% of the step, or design rankings on the spill battery agree with those from static patches at a rank correlation of 0.95 or above. Fallback: static film-friction patches.

19.11 Clearance complexes (.fclear) F

The question. Can this body get from here to there in this place? The earlier answer was a route graph and a traversability check for a nominal footprint. A scalar test of that kind is wrong in both directions for a body that is not a disc. Take a rectangular base 0.60 m wide in a corridor 0.90 m wide with a right-angle turn. Its inscribed disc (diameter 0.60 m) says every length fits. Its circumscribed disc says that a 1.30 m long body (diagonal 1.43 m) cannot. The truth is that the 1.30 m body passes and a 1.40 m body does not, by the closed form below.

The object. A clearance complex is a cubical subdivision of the planar configuration space SE(2) = (x, y, ψ) of a footprint in one height slab of a scene, for one assignment of fixture modes. Owner: frob-scene. Verb: scene.fit. Format: .fclear.

  • The footprint family is a base shape F₀ with reference radius ρ (the largest distance from its reference point), inflated by a non-negative margin w: F(w) = F₀ ⊕ disc(w). A catalog of chassis widths, a payload overhang or a safety margin is one parameter w.

  • The clearance c(q) of a configuration q is the distance from F₀ placed at q to the nearest obstacle in the slab, negative inside an obstacle. F(w) at q is collision-free exactly when c(q) > w.

  • Each cell is a closed box with centre q₀, translation edge Δ and heading width δ. Because a distance function has Lipschitz constant one and a point at radius at most ρ moves at most ρ·|Δψ| under a rotation, every q in the cell satisfies |c(q) − c(q₀)| ≤ e, with

    e = (Δ/2)·√2 + ρ·(δ/2) + ε_field + u_reg,

    where ε_field is the scene's field bound and u_reg the registration uncertainty of an ingested scene. The cell stores the one-sided values c_lo = c(q₀) − e and c_hi = c(q₀) + e, two 16-bit numbers in millimetres. These are the enclosures of §19.5.2.

  • The inner complex 𝒞_in(w) is the set of cells with c_lo > w: every configuration in them is free. The outer complex 𝒞_out(w) is the set with c_hi > w: every free configuration lies in one of them. Cells are adjacent across faces, with ψ periodic.

Three answers.

  1. A face-connected path of inner cells from the start cell to a goal cell is a feasibility witness: the polyline through cell centres and shared faces stays inside boxes that are entirely free.
  2. If the start and every goal cell lie in different components of the outer complex, no collision-free path exists for margin w: an impossibility cut. Face adjacency suffices for this direction because the cells are closed: a free configuration on a shared edge or corner makes every cell that contains it an outer cell, and those cells are face-connected round that edge.
  3. Otherwise the answer is unresolved, and the cells between the two verdicts are returned for refinement.

The bottleneck. One sweep answers every margin. Cells are sorted by c_lo and added to a union-find structure in decreasing order; the value at which the start and goal components merge is the largest certified margin w_in, and the cell that merges them is the bottleneck. The same sweep on c_hi gives w_out, the margin at and above which passage is impossible, and its bottleneck. (This is zero-dimensional persistence of the clearance filtration. FACT: fs-topo::cubical implements zero-dimensional persistence for voxel fields, with chart voxelization capped at 10⁶ cells and no periodic axis, so frob-scene implements the sweep itself and uses fs-topo as a parity oracle on small fixtures.) The bottleneck cell is mapped through the semantic labels to a named feature, so the answer reads "door D3, certified to 31 mm of margin, impossible at 46 mm", not a cell index.

Size and the default lattice. A 12 m × 8 m floor at Δ = 5 cm with 32 headings is 240 × 160 × 32 = 1,228,800 cells, 4.69 MiB at four bytes per cell. With ρ = 0.40 m the error term is 35.4 mm + 39.3 mm = 74.6 mm before field and registration error.

Paper-scale pilot, already decisive on one point. A body centred in a doorway has clearance equal to half the total margin, and a witness needs c_lo > 0, so at the default lattice a doorway fit with a total margin under 2e ≈ 149 mm is unresolved. The hazard list puts home doors at 0.70–0.90 m and plausible bases at 0.45–0.70 m; if both are drawn uniformly, about 22% of pairs have a margin under 149 mm, and they are the near fits, the only cases in which the question is hard. The default lattice alone is therefore not the mechanism. Local refinement is part of it: cells whose interval [c_lo, c_hi] straddles the query margin and that lie on a candidate bottleneck are subdivided in x, y and ψ. At Δ = 12.5 mm and 128 headings e is 18.7 mm; at Δ = 5 mm and 512 headings it is 6.0 mm (DESIGN arithmetic). Below that the floor is 2·(ε_field + u_reg): about 2 mm in a generated scene, and tens of millimetres in a scan, where the correct output is a measurement request (§19.13).

Envelope beyond the plane. The slab is chosen from the body's envelope: obstacles lower than its step-over height or higher than its top are outside the slab. Thresholds, ramps, stairs, lift sills and docking plates are transitions in the route graph, each with a capability predicate (riser at most the body's step height, slope at most its traction limit, gap at most its wheel diameter criterion). A route verdict is the conjunction of the planar verdict in each slab and the predicates on its transitions. A door that is closed but openable is a transition whose predicate is the body's push capability against the closer torque, not a wall.

What the witness does and does not say. The witness is geometric. For a base whose growth vector reaches full rank with reversal permitted (the maneuverability analysis of §28, construction C-07), a path with positive clearance can be followed by maneuvering inside that clearance (FACT: the standard small-time local controllability argument for car-like and differential-drive bases, to be re-read before a gate cites it), and the witness is labeled kinematic; the number of maneuvers is not bounded by the witness and its cost is C-07's estimate. For any other base the label is geometric-only. A witness is never a statement about dynamics, traction or control: static rejection and static admission are both candidates for a dynamic test, not substitutes for one.

Unknown regions. In an ingested scene, unknown space is blocked in the inner complex and free in the outer complex. A witness never crosses unobserved space; an impossibility cut never relies on it.

Certificates. A witness is the list of cells on the path; a checker recomputes c(q₀) and e for each and tests adjacency. A cut is a component labeling of the outer complex; a checker tests that every unlabeled cell has c_hi ≤ w, that no two adjacent labeled cells carry different labels, and that start and goal labels differ. Both checks are linear in the number of cells and need only the scene field, so they fit the certificate bundle of §12. Their class is Certified relative to the compiled scene and its stated bounds. They say nothing about the real building beyond what the scene's provenance supports.

Closed-form known answer. A rectangle of width b and length L can be carried round a right-angle corner between corridors of width a exactly when L ≤ 2√2·a − 2b (for b < a). Derivation: with the outer long side touching both outer walls at inclination θ, the inner corner clears the body when L ≤ (a·sin θ + a·cos θ − b) / (sin θ·cos θ); the right-hand side is smallest at θ = 45°. For a = 0.90 m and b = 0.60 m the limit is 1.346 m. The complex must return a witness for L below the limit minus its band and a cut above the limit plus its band.

Ceiling of the benefit, stated before any speed test. The complex saves the simulation and training that would be spent on bodies that cannot fit, and it replaces "the policy failed" with "the door is 15 mm too narrow". The saving is bounded by the share of candidate designs that geometry alone excludes, which is unknown and is measured on the M3 design corpus. An application built on an incumbent planning library could build the same index; the mechanism is not claimed as unique, and no multiplier is claimed for it.

✖ KILL-FCLEAR. Trigger: one false witness or one false cut that survives a repair cycle, or more than 30% of doorway queries on the archetype battery still unresolved after local refinement. Fallback: the route-graph traversability check for a nominal footprint, labeled heuristic, with the feasibility tag reduced to unresolved wherever the heuristic and a fine brute-force grid disagree.

19.12 The retrofit catalog F

The idea. Every repair a design loop normally searches lives in the robot. Some failures are caused by one feature of the building that costs little to change: a threshold, a door closer, an exposed cord, a glass door with nothing on it. The retrofit catalog makes the building a design variable with prices, so that "add a ramp" and "fit larger wheels" are compared in one budget.

The catalog. registries/retrofits.toml lists typed building amendments, about forty at first (TARGET). Each entry is a typed scene edit with its parameters, the hazards it applies to, a price with provenance, an install class (renter-safe, landlord, contractor), constraints on its parameters, and a declaration of which aspects of the scene it changes (geometry, material, optics, clocks, actors).

[[retrofit]]
id          = "threshold-ramp"
edit        = { kind = "add-overlay", shape = "wedge", params = ["rise_m", "run_m", "width_m"] }
applies_to  = ["threshold", "sliding-door-track", "dock-plate-lip"]
install     = "renter-safe"
cost        = { value = 12, currency = "USD", provenance = "assumed" }
constraints = [{ expr = "run_m >= 12 * rise_m", provenance = "assumed" }]
changes     = ["geometry"]
Amendment Scene edit Changes Hazard it addresses
Threshold ramp Add a wedge overlay Geometry Threshold, door track, dock lip
Door-closer adjustment Lower the closer torque parameter Actors Door the robot cannot push
Door holder Fix a door's mode to open Actors, geometry Door on the route
Cord raceway Replace a cord by a low bevelled cover Geometry Cord across a path
Rug gripper Fix a rug slab; raise rug-to-floor friction Material, actors Rug that slides or folds
Fiducial marker Add an optical marker region Optics Localization alias (§20.12)
Glass-door decal band Change a band of a glass region to diffuse Optics Glass not seen by optical ranging
Motion-activated light Raise the lighting level in a zone Optics Long exposure, blur
Floor mat on a wet zone Change the interface card of a region Material Film on tile
Finer drain cover Reduce the slot pitch of a grate overlay Geometry Castor drop
Anti-slip tape on a ramp Change the interface card of a strip Material Ramp traction
Cable bridge Add a bevelled overlay over a tray Geometry Cable tray
Dock leveller plate Add a hinged plate over a lip Geometry, actors Dock lip
Docking guide Add guide geometry at a dock Geometry Docking tolerance
Bump-stop absorber Add a compliant fixture at an impact point Geometry, material Impact energy at a known stop
Aisle marker Add distinguishing optical regions per aisle Optics Identical aisles

Prices and legality constraints are assumed until a source is recorded (OPEN-HAB-4). A kit that violates a constraint or uses an install class the mission does not permit is refused (FROB-REF-313).

The search. Verb: scene.retrofit. Input: a failing verdict with its evidence, which is one of an impossibility cut (§19.11), a minimal counterexample world (§26) or an alias witness (§20.12). Procedure:

  1. Localize. Only amendments whose applies_to matches a feature named by the evidence, and whose patch touches the bottleneck region, are candidates.
  2. Enumerate kits of at most three amendments in order of price. With forty entries the unfiltered space is 40 + 780 + 9,880 = 10,700 kits; after localization it is typically tens.
  3. Apply and re-decide. Each kit yields a new scene variant (which shares all untouched bricks, §19.15). The same procedure that produced the failing verdict is rerun on it with the robot's policy frozen: the policy identity in the evidence is unchanged, and no training step is taken.
  4. Compare with a redesign. The cheapest design edit that flips the same verdict is requested from the design search (§28, §25), priced from its part cards, with its controller obtained by the route the original used. A redesign changes the model, so its arm is not frozen-policy and its report says so.
  5. Report. The cheapest kit, the cheapest redesign, both prices, both verdicts on the same world addresses, and what remains unresolved. The claim made is a Design comparison (§8).

Ownership: frob-scene owns the catalog, the typed scene edits and the enumeration of kits. Steps 3 and 4 are executed by the verb implementation in frob-verbs through the owner of the failing verdict; frob-scene links no crate above layer 2 (§34).

Evidence: a kit verdict from a fast tier is provisional until promoted (§16). No physical installation is checked; the Reality cell is no-claim.

Closed-form known answer: a ramp against a larger wheel. A driven wheel of radius r that carries its own load and meets an edge of height h quasi-statically, with no help from another axle, needs a friction coefficient of at least tan α = √(h·(2r − h)) / (r − h) at the edge. For r = 50 mm and h = 20 mm that is 4/3, which no floor card offers: the climb is statically impossible. A wedge with a run of twelve times its rise needs 1/12. Doubling the wheel radius to 100 mm needs 0.75. The retrofit search must return the ramp, the design search must return the wheel, and the report must show both. The static figure is a screen and not the verdict: approach speed changes the outcome (a body arriving at √(2·g·h) = 0.63 m/s has the energy to rise 20 mm before losses), which is why step 3 reruns the full procedure. FACT (an executed planar sill study, listed in the source register and to be re-read before a gate cites it): of 156 cases, 62 that a sampled static test rejected succeeded dynamically.

Ceiling of the benefit, stated before any speed test. Bounded by the share of mission failures whose bottleneck is a building feature that some catalog entry addresses. That share is unknown.

Paper-scale pilot and falsifier. Before the work package is funded: for every row of the hazard registries, record whether a catalog entry addresses it and whether a design edit also could. If fewer than a third of hazards have an amendment, the catalog is too thin to search and is extended or dropped.

✖ KILL-RETROFIT. Trigger: on the home battery, kits flip fewer than 30% of the failures attributed to a building feature, or more than 10% of kit verdicts reverse when promoted to the referee. Fallback: the catalog remains as the edit vocabulary that Nemesis uses to mutate scenes; the search verb is withdrawn.

19.13 Ingesting real places F

Sources. Two pipelines exist in the owner's projects (FACT). First, a route from walkthrough video to an agent-built Blender twin with stable feature identifiers and a GLB export, with an accepted plan for a twin package that links visual, geometric and traversability representations (the reconstruction skills and franken_surveillance_system/BLENDER_TWIN_INTEGRATION_PLAN.md). Second, franken_drone_geometry_reconstruction (at db45703afc5e), a reference workspace for drone video whose executable chain today runs from media custody through clocks, calibration, scale witnesses, keyframes, correspondences and relative pose to an audited relative bundle problem; its own status file says it does not yet optimize cameras, emit metres or publish geometry. frob scene import therefore consumes the twin package first, and the drone route when that project publishes geometry (OPEN-HAB-5). Changes to either are upstream work items (FD-FSS-01, FD-FDGR-01).

What import adds. The collision compile and acceptance of §19.4 and §19.5, including four-point registration; interface cards and optical cards, marked assumed unless measured; fixture articulation where a hinge axis and limits are supplied; the unknown mask; and the scale label.

Scale witnesses. A scene's scale label is one of four values, ordered by authority, matching the reconstruction project's own vocabulary (FACT: fdgr-scale defines relative_only, estimated, witnessed, surveyed):

Label Meaning What a task may do with it
relative-only Shape without a metric scale Viewing only; every metric task is refused (FROB-REF-304)
estimated Scale inferred from priors such as typical door heights Exploratory runs; clearance verdicts are unresolved within the stated scale interval
witnessed Scale fixed by an object of known size or a measured baseline in the capture Metric tasks, with the witness's uncertainty in u_reg
surveyed Scale and registration from an independent survey Metric tasks at survey accuracy

Unknown regions. Occupancy is three-valued. Each consumer states its treatment:

Consumer Treatment of unknown
Spawn and goal placement Not allowed in or adjacent to unknown space
Clearance complex Blocked for witnesses, free for cuts (§19.11)
Contact Solid keep-out; a contact with an unknown surface marks the world Degraded: contact-with-unknown and the episode is excluded from metrics with a count (OPEN-HAB-6)
Ray kernels A ray that enters unknown space returns invalid: unknown-region
Tasks May require known traversability; a required route through unknown space is FROB-REF-305

An unseen underside stays unknown. A hole closed by repair is marked and its neighbourhood stays unknown. A watertight proxy may serve a navigation experiment while gripper contact with the same object stays unresolved; the pack records which.

Materials are not inferred from appearance. An unprobed surface gets an interface card of class assumed with a wide friction interval, which Nemesis searches (§26). No friction, compliance or optical value is estimated from an image.

Requests for a measurement. Verb: scene.probe-request. When a clearance verdict is unresolved because of registration or scale uncertainty, when the inner and outer answers of a mission query (§25) differ because of an unknown region, or when a decision reverses inside the interval of an assumed card, the studio emits a request that names the three-dimensional box to rescan or the surface to probe, the quantity needed and the accuracy that would settle the decision ("the clear width of door D3 to ±5 mm"). The request is the output; nothing is assumed in its place.

Real-place data is governed by §37: the pack is private, is stored outside the repository, and everything derived from it inherits the mark.

Ceiling, pilot and kill. Ingestion has no effect on decision time; it lets a candidate be evaluated in one particular place, which is the precondition for any Reality claim about that place (§30). Paper-scale pilot and falsifier, before the work package is funded: take one existing twin package and check by inspection that it exports what §19.5.1 and this section need (four non-coplanar landmarks, a scale witness, coverage or confidence per region); if it does not, the first deliverable is an upstream work item (FD-FSS-01) and not an importer. ✖ KILL-INGEST. Trigger: GATE-HAB-03 cannot be passed with a scale label of witnessed or better after one repair cycle. Fallback: the place is authored in the interior grammar from a tape-measure survey, with every surveyed dimension recorded as measured, and the pack says it is a proxy.

19.14 Train and test hygiene

A SceneSplit separates training scenes from held-out scenes by seed, by parameter range and by archetype variant. Arena checks mechanically that a reported evaluation score comes from scenes whose identifiers are absent from the policy's training manifest (FROB-REF-502 otherwise).

Identifiers alone do not prevent leakage, so splits are made over groups. A group contains a base scene and everything derived from it: mirrored layouts, clutter variants, retrofit variants, variants that share its brick pool, and every scan of the same building. A group never straddles a split (INV-HAB-09, FROB-REF-311). The smallest case that shows why: a layout and its mirror image have different SceneIds and the same aisles; a policy trained on one and scored on the other has seen the test.

Three further rules. The resolved value of every randomized quantity is stored with the episode, so a split can be audited after the fact. The count of scenes in each feasibility class is part of every split manifest (§19.5.5). Scene families used by the blinded qualification lane of §24 are generated from sealed seeds that discovery cannot enumerate; Habitat exposes such a family only through a handle that returns scores, never scenes.

19.15 Memory arithmetic, brick pools and the world bank

Dense fields. DESIGN arithmetic to size the design; volumes and surface areas are assumed (a 10 m × 10 m × 3 m home with about 1,000 m² of surface; a 60 m × 40 m × 8 m warehouse with about 35,000 m²; a six-storey building of 57,600 m³). Samples = volume / spacing³; bytes = 2 × samples.

Scene 4 cm dense 2 cm dense 2 cm band bricks with labels 1 cm dense
Home, 300 m³ 9 MB 75 MB 45–84 MB 0.6 GB
Warehouse, 19,200 m³ 0.6 GB 4.8 GB 1.6–3.9 GB 38 GB
Building, 57,600 m³ 1.8 GB 14.4 GB 2.9–7.3 GB 115 GB

The band occupies a fraction min(1, (A/V)·t·s) of the volume for surface area A, spacing s and a band of t = 8 to 20 voxels including brick rounding. Two corrections to earlier figures follow. A 2 cm warehouse is 4.8 GB, not the 600 MB that belongs to 4 cm. And a narrow band does not save an order of magnitude: at 2 cm it saves a factor of one to five, at 1 cm 1.5 to 11, and a cluttered home, whose surface-to-volume ratio is highest, gains least.

How many scenes fit. Assuming 12–16 GB of a 24 GB card is available for scenes beside world state, rollout storage and the policy, and about 203 GB (189 GiB) on the M5 Ultra, 85% of its measured working-set limit of about 222.7 GiB, dense:

Scene and spacing One RTX 4090 M5 Ultra
Home, 2 cm 160–210 about 2,700
Home, 1 cm 20–27 about 340
Warehouse, 4 cm 20–27 about 340
Warehouse, 2 cm 2–3 about 42
Warehouse, 1 cm none 5
Building, 2 cm at most 1 14
Building, 1 cm none 1

One scene per world is impossible. 8,192 worlds each with its own 2 cm home is 8,192 × 75 MB = 614 GB, which is 26 times a 24 GB card and more than twice the working set of the large-memory machine. Per-world state, by contrast, is small (about 20–53 kB for a quadruped and 56–180 kB for a humanoid, §36), so memory never limits the number of worlds; it limits the number of distinct places. Hence ADR-HAB-05.

Brick pools shared across variants S. The pool is a device buffer of band bricks addressed by slot. Bricks are content-addressed at compile time, so identical bricks are stored once. A scene variant is a directory and a coarse lattice: one 32-bit slot (the 4-byte directory entry of §19.4) and one 16-bit coarse sample per coarse cell, 6 bytes per cell in all, which is 0.44 MB for the home and 28 MB for the warehouse at the default spacings. A world holds a 16-bit variant index, which may change at reset. Three kinds of sharing follow:

  • Movable clutter costs nothing. Movable objects are rigid bodies, not field. Variants that differ only in where totes, chairs and carts stand share every brick and differ only in their movable tables.
  • Repeated modules inside a scene. A truncated field in a brick depends only on geometry within T of that brick. Modules placed on the coarse lattice with identical neighbourhoods therefore produce identical bricks, and an aisle of identical rack bays stores one bay.
  • Variants of a base scene. A retrofit, a moved wall or a different fixture changes only the bricks within T of the change.

HYPOTHESIS: the unique-brick count of a warehouse or retail scene is a small fraction of its band bricks, and a layout variant adds a few percent. Illustration under that assumption, not a result: a warehouse base of 2.5 GB whose variants each change 5% of bricks costs 125 MB + 28 MB per variant, so about 88 variants fit beside the base in 16 GB where three dense copies would. Test: measured brick occupancy and deduplication ratios of the compiled archetypes (GATE-HAB-13). Scans share least. ✖ KILL-POOL: if the measured deduplication on the archetype battery is below 1.5, variants fall back to dense per-variant fields behind the same directory interface, and the scene counts above apply as written.

The world bank. The bank is the resident set of compiled packs on a device: pools, directories, overlays, maps and clearance complexes, with an admission ledger. Verb: scene.bank.

  • Where. The M5 Ultra, with 256 GB of unified memory, holds the bank (§21): thousands of 2 cm homes, tens of 2 cm warehouses, and the only copies of 1 cm warehouses and whole buildings. Each RTX 4090 holds the slice its training job needs.
  • Admission. By the budget estimator, under a cap that defaults to 85% (TARGET) of the device's measured working-set limit, the same device budget as §36.10; a request over the cap is refused (FROB-REF-314). FACT (measured on this machine, to be re-read): the working-set limit is about 222.7 GiB and the largest single buffer about 167 GiB.
  • Segments. A pool is split into segments no larger than the largest single buffer. FACT: the Metal gateway binds at most 31 buffers per kernel (ft-kernel-metal, MAX_ARGUMENTS). A launch therefore binds one pool segment and one directory, and the placement planner of §21 groups worlds by segment.
  • Eviction. By recompute cost and recency: a pack that takes a minute to recompile is kept longer than one that takes a second. FACT: an admission-and-eviction policy of this family exists in the suite (frankensqlite/crates/fsqlite-pager/src/s3_fifo.rs); whether to reuse it is decided at implementation.
  • What crosses machines. Seeds, family parameters and SceneIds. Each machine compiles its packs and checks the identity (INV-HAB-10). Voxels never cross.
  • No zero-copy claim. Unified memory does not make a host array and a device buffer the same object. CPU analyses read scene data through the same fenced snapshots as any other consumer.

Ceiling of the benefit, stated before any speed test. By memory, the bank holds about five times what both RTX 4090 cards hold together. Whether training on more distinct places improves held-out performance is a HYPOTHESIS. Test: train the reference quadruped task at a fixed step budget on 16, 160 and 1,600 distinct homes and score on a held-out group. ✖ KILL-BANK-BREADTH: if held-out success does not rise with breadth beyond its confidence sequence, the bank is used for evaluation, qualification, replay, clearance and retrofit search and for large scenes, and training keeps per-card resident sets.

19.16 Refusals

Code Refusal Ranked repairs
FROB-REF-301 Source geometry is not watertight or not consistently oriented Request explicit repair with receipts; supply a closed model
FROB-REF-302 The transform class of an import is not established: a reflection or affine map is not excluded, or winding disagrees with the determinant Supply a fourth non-coplanar landmark; declare the source handedness; fix winding
FROB-REF-303 A decode limit is exceeded or a reference does not resolve Raise the limit in the import profile; supply the asset
FROB-REF-304 Scale authority is below what the task requires Add a scale witness; choose a non-metric task
FROB-REF-305 A required route, spawn or contact lies in an unknown region Emit a probe request for the named box; choose another route
FROB-REF-306 A feature below voxel scale has no overlay, or an overlay index cell is over capacity Add an overlay; bake at a finer level; raise the capacity
FROB-REF-307 A film is outside the validity of the film model Sub-cycle; treat the liquid as a pooled obstacle; use a static patch
FROB-REF-308 A clearance query is outside the domain of the complex: the footprint changes shape along the route, a height or step capability is missing, or a kinematic label is requested for a base that cannot reverse Supply the envelope; split the route by posture; accept geometric-only
FROB-REF-309 A run is requested on a route that has a standing impossibility cut for this footprint Read the cut; edit the design; run scene.retrofit; pass an explicit diagnostic override
FROB-REF-310 A pack or report would export a research-only or private asset Remove the asset; keep the pack local
FROB-REF-311 A scene group straddles a split Move the whole group
FROB-REF-312 A realism claim cites a scene with assumed dimensions Record a norm or a measurement; drop the claim
FROB-REF-313 A retrofit violates a constraint or an install class the mission does not permit Choose another amendment; widen the permitted class
FROB-REF-314 World-bank admission would exceed the device cap Evict; lower the resolution; move the job to the large-memory machine
FROB-REF-315 A movable object has no declared behaviour Declare one
FROB-REF-316 A surface region has no optical card Assign one, with provenance assumed if necessary
FROB-REF-317 Collision-to-visual deviation exceeds the pack threshold with no waiver Correct the collision model; tag the part optical-only; waive with a reason

FROB-REF-502 keeps its meaning (§19.14).

19.17 Invariants and proof obligations

ID Invariant
INV-HAB-01 A ScenePack is immutable; any change produces a new SceneId.
INV-HAB-02 Physics, sensors and stills read only the collision field, the overlays and the maps. No code path carries visual-mesh data into a result.
INV-HAB-03 Per-world mutable scene state never affects another world, and never a later episode unless the task declares persistence for that world address.
INV-HAB-04 unknown is never changed to free or occupied without a recorded observation or a recorded, named assumption.
INV-HAB-05 No scene is dropped or resampled because of its feasibility tag; the counts in a manifest equal a recount.
INV-HAB-06 Every configuration in an inner cell of a clearance complex is free, and every free configuration lies in an outer cell.
INV-HAB-07 Film volume, cells plus reservoirs, is conserved to the stated residual.
INV-HAB-08 A retrofit evaluation leaves the policy identity unchanged.
INV-HAB-09 A scene group never straddles a split.
INV-HAB-10 The same family, parameters, seed and compiler version give the same SceneId on every supported platform.
ID Statement Verification
PO-HAB-01 The recorded brick bound holds: the device field differs from the source chart by at most the bound everywhere in the brick. Derivation on file (unit Lipschitz constant, trilinear interpolation error, half a quantization step); interval evaluation against the constructive-solid range for generated scenes (Certified); 10⁶ samples for meshes (Tested).
PO-HAB-02 Over a cell of a clearance complex, clearance varies from its centre value by at most e. A written proof from the two Lipschitz facts of §19.11, as a theorem card (§12); a randomized check.
PO-HAB-03 A face-connected inner path is collision-free, and separation in the outer complex excludes every path. Written proof; exhaustive comparison with a brute-force grid at four times the resolution on small fixtures.
PO-HAB-04 The film-thickness update is exact for a load constant over the step. Symbolic identity checked by FrankenSymPy (Certified).
PO-HAB-05 The face-flux film update conserves total volume exactly in exact arithmetic. Telescoping identity on file; compensated-sum audit in every run.
PO-HAB-06 Each overlay primitive returns the exact distance outside its solid. Interval evaluation against fs-rep-frep for each primitive, including the periodic bar pattern.
PO-HAB-07 An affine map that fixes four non-coplanar points is the identity, so four correspondences determine the registration. Linear-algebra card.

19.18 Known answers

Case Truth Negative control
Compiled field against source Error at most the brick bound at 10⁶ surface samples; overlays exact to round-off A brick with its bound halved fails
Reflected asymmetric room Rejected by four-point registration; residual 2 m at the off-plane marker The three-point check accepts it
Doorway with 6 mm gap and 4 mm error per side unknown A nominal-surface test says "clear"
Door-clearance gauges Go gauge passes, no-go gauge blocked, at every door A door narrowed by 3 bounds blocks the go gauge
Tile in four optical and contact states Optical change leaves physics digests unchanged; contact change leaves ray outputs unchanged; the latent changes both A build that derives friction from r0 fails
Squeeze-film times 0.038 s, 2.3 s, 0.76 s for the three cases of §19.10.2, within 2% (the tolerance of GATE-TRAC-05) Doubling R must multiply the time by 16
Castor at a rug edge Needs 4/3 of its load; a 2 kg free slab slides first A fixed step is climbed or blocks
Three-cell film transport The face-flux form conserves volume The masked non-conservative form loses Δt/Δx
Viscous spreading Radius ∝ t^(1/8) axisymmetric; front ∝ t^(1/5) planar Removing the h³ factor changes the exponent
Film thickness limit 2.5 mm for water at 2 cm and 2 ms A 4 mm film is refused
Slosh, first mode ω₁ = 8.96 rad/s for L = 0.30 m, h = 0.10 m Halving the fill must lower the frequency
Hanging chain Sag 0.292 m for 1.2 m of chain over a 1.0 m span A chain with no bending limit and one link fails
Right-angle corridor A rectangle passes if and only if L ≤ 2√2·a − 2b; 1.346 m at a = 0.90 m, b = 0.60 m Inscribed and circumscribed disc tests are both wrong
Clearance error term 74.6 mm at Δ = 5 cm, 32 headings, ρ = 0.40 m —
Wheel at a 20 mm threshold Friction needed 4/3 at r = 50 mm, 0.75 at r = 100 mm, 1/12 on a 1:12 wedge —
Mirrored layout across a split Refused Splitting by SceneId alone accepts it
Mutable-state leak No trace in another world or a later episode A pool indexed without the world address fails
Scene memory The dense and band figures of §19.15 from a recount of compiled bricks —

19.19 Gates and kill gates

Gate Claim Threshold (TARGET) First milestone
GATE-HAB-01 Known answer Compiled field against source geometry: error at most half a fine voxel at 10⁶ surface samples and never above the recorded brick bound; analytic shapes compiled to bricks exact to the interpolation bound, and analytic overlays exact to round-off; quantization ripple on a resting 10 kg block at most 1% of weight on every tier. M2
GATE-HAB-02 Known answer For each archetype, 1,000 seeds yield valid scenes: all constraints satisfied, every scene tagged witnessed, impossible or unresolved for the nominal footprint, at most 5% unresolved, the share of impossible: intended within one percentage point of the family's quota, and no scene resampled. The same seed gives the same SceneId on Linux and macOS. M3
GATE-HAB-03 Reality One real place ingested end to end, privately, with its scale label and unknown regions respected, and at least one probe request emitted for it. A place for which no capture exists is recorded as no-claim, not as a pass. F M5
GATE-HAB-04 Known answer Scene acceptance: every fixture of §19.5.6 passes on 100 scenes per archetype; the reflected room is rejected and the three-point control accepts it; the 6 mm case returns unknown. M3
GATE-HAB-05 Known answer Separation of optics and friction: the four-state tile behaves as in §19.5.4 on every tier, bit for bit within the determinism class. M3
GATE-HAB-06 Known answer Film-friction law as scenes consume it (the law's own gate is GATE-TRAC-05): the three squeeze times within 2%; the R⁴ scaling; dry and thick-film limits recover the card coefficients. M3
GATE-HAB-07 Known answer Advected film F: relative volume residual at most 10⁻⁶ over 10⁵ steps with pickup and redeposition; spreading exponent within 2% of 1/8; the non-conservative control fails; no cross-world leak in 10⁶ world-episodes. M6
GATE-HAB-08 Known answer Slosh and proxies F: first-mode frequency within 3% at three fill depths; catenary sag within 2% at 20 links; the free-slab rug slides in the castor case. M6
GATE-HAB-09 Fidelity Proxy adequacy: the pilot of §19.10.7 is run and its number recorded; this gate reports, and KILL-LIVING decides. Before the island work package
GATE-HAB-10 Known answer Clearance complexes F: the corridor closed form is bracketed by witness and cut within the refined band on 100 (a, b) pairs; zero false witnesses and zero false cuts on the seven archetype fixtures against a brute-force grid at four times the resolution; the checker accepts every emitted certificate and rejects six mutated ones. M3
GATE-HAB-11 Design comparison Retrofit F: three planted bottlenecks (a 20 mm threshold, a closer above push capability, an unmarked glass door) are repaired by the expected kits with the policy identity unchanged; the wheel-and-ramp closed form is reproduced by both arms. M4
GATE-HAB-12 Performance World bank: resident counts are measured and recorded against the table of §19.15 (targets: at least 2,000 homes at 2 cm on the M5 Ultra; at least 150 on one RTX 4090 beside an 8,192-world quadruped batch); admission never exceeds the cap; a world changes scene at reset with no recompilation. M3
GATE-HAB-13 Known answer Brick pool: the pooled field equals the dense field bit for bit at 10⁶ points per scene; measured occupancy and deduplication ratios are recorded for every archetype. M2
GATE-HAB-14 Known answer Hygiene: a mirrored layout and a retrofit variant planted across a split are refused; feasibility counts in manifests equal recounts. M3
Kill gate Trigger Fallback
✖ KILL-LIVING §19.10.7 Solid tier and Frontier proxies only; islands not built
✖ KILL-ADVECT §19.10.7 Static film-friction patches
✖ KILL-SLOSH §19.10.4 Rigid ballast with a spill metric
✖ KILL-PROXY §19.10.5 Solid proxies in training; articulated proxies in evaluation only, or not at all
✖ KILL-DRESSING §19.7 Structural proxies and static clutter only
✖ KILL-INGEST §19.13 A surveyed proxy authored in the interior grammar
✖ KILL-FCLEAR §19.11 Route-graph check for a nominal footprint, labeled heuristic
✖ KILL-RETROFIT §19.12 Catalog kept as Nemesis's edit vocabulary; search verb withdrawn
✖ KILL-POOL §19.15 Dense per-variant fields behind the same directory interface
✖ KILL-BANK-BREADTH §19.15 Bank used for evaluation, replay and large scenes; training on per-card sets

19.20 Open questions

  • OPEN-HAB-1. Which published building and workplace norms supply the dimension distributions. Default: generic ranges labeled assumed, and realism claims refused. Owner: project lead. Blocks GATE-HAB-02 for claims of realism, not for validity.
  • OPEN-HAB-2. Whether bricks carry a one-sample apron. An apron removes neighbour lookups at brick faces and costs (9/8)³ − 1 = 42% more memory. Default: no apron, up to eight directory lookups for a query in a boundary cell. Owner: Spark lead. Decided by the M2 profile; blocks nothing.
  • OPEN-HAB-3. Default spacings and truncation distance (2 cm and 16 cm with T = 8 cm) against 1 cm interiors. Related to OPEN-TRAC-1. Default: as stated. Decided with measured memory and the fidelity ledger at M3.
  • OPEN-HAB-4. Sources for retrofit prices and legality constraints. Default: prices assumed, constraints marked unchecked in every report. Owner: project lead. Blocks any claim about cost in a published report.
  • OPEN-HAB-5. Which reconstruction package and version is the import contract. Default: the walkthrough twin package; the drone route when it publishes geometry. Blocks GATE-HAB-03.
  • OPEN-HAB-6. Whether contact with unknown space degrades the world or refuses the run. Default: degrade, exclude from metrics, count. Decided at M5 with the first real place.
  • OPEN-HAB-7. Whether scene breadth in training improves held-out success. Default: the bank serves evaluation. Decided by the experiment of §19.15.
  • OPEN-HAB-8. Sources for film roughness, carried thickness and transfer fraction. Default: assumed, outputs Estimated, Reality no-claim. Blocks any Reality claim about slip on films.

19.21 Far-field field reuse across forks

This subsection adds one mechanism to the living worlds of §19.10: a fork (§27.3, §29.8) may share the parent's field tiles and recompute only those whose inputs differ. Tier M. Owners: frob-scene for tile keys and the tile store, frob-chronicle for retention over the fork window. It is reported by run.fork (§29.8), from which Autopsy starts; it adds no verb.

Scope. Fields only: film tiles, and where they are admitted the thermal, optical-volume and fluid-island fields of the evaluation tier. Rigid bodies, contacts, sensors and controllers of a fork are always recomputed in full. In a robot-centred scene they dominate the step and always differ from the parent, which is why the general form of this idea, a dependency graph over the whole world, is not built.

Tile versions. A tile's content after a substep is identified by

TileKey = BLAKE3(field kind, math contract and kernel versions, substep index, content digests of the tile and of every tile in its stencil before the substep, digest of the events applied to the tile in the substep).

Events are sources and sinks, the motion of a fixture, door or cart that overlaps the tile, and robot contacts that deposit, remove or drag film. A store maps keys to tile contents for the parent's fork window.

Algorithm, per substep of a child. Form each tile's key from the child's inputs. If the store holds the key, the child refers to the stored content and no kernel runs for that tile. Otherwise the tile is dirty: it is recomputed, its content digest taken and the result stored. Keys are built from content digests, not from the fact of recomputation. A recomputed tile whose content equals the parent's therefore leaves its neighbours' next keys unchanged, and the dirty set shrinks when a disturbance dies out.

Preconditions. The field kernels return bit-identical results for identical inputs whatever the batch (class D1 or D2 with the rule of §35.5). The update's stencil covers its domain of dependence for one substep; this is the scheme's stability bound and is part of the tile's math contract. Every write to a field goes through the event list. Reuse is refused under classes D3 and D4, and for a field kind whose contract states no stencil.

The bound. Let a be the share of a fork's compute spent on tile updates, d the dirty fraction of those updates and b the bookkeeping (hashing and lookups) as a fraction of full cost. A fork costs (1 − a) + a·d + b of a full recomputation.

a d b Cost Factor
0.95 0.02 0.01 0.079 12.7
0.95 0.0421 0.01 0.100 10.0
0.90 0.02 0.01 0.128 7.8
0.20 0 0.01 0.810 1.23

A robot in one room with a small film patch has a small a, and no dirty fraction helps it. DESIGN: reuse is enabled only for worlds whose phase ledger shows a ≥ 0.8 (TARGET): spills across several rooms, steam, fluid islands on the evaluation tier.

How fast the dirty set can grow (FACT, arithmetic). A disturbance travels at most one stencil radius per substep. In a row of N tiles disturbed at one end, at most K·(K + 1)/2 tile-updates are dirty over K substeps: 210 for K = 20, which is 10.5% of the work at N = 100 and 1.05% at N = 1,000. In a plane with a square stencil at most (2k + 1)² tiles are dirty after k substeps, and Σ_{k=0}^{K−1} (2k + 1)² = K·(2K − 1)·(2K + 1)/3 = 10,660 for K = 20, which is 5.3% of a 100 × 100 tile domain over 20 substeps and already above the 4.21% line. The cone is the worst case. Whether real disturbances die out sooner is what the pilot measures; it is not assumed.

Known answers. A null fork has an empty dirty set at every substep. A fork that changes the robot's path in one room recomputes no tile of a dry room it never enters. A door swung through a dry room is an event with no field effect: the tiles it overlaps are recomputed while it overlaps them, their content equals the parent's, and no neighbour becomes dirty. In every case, tile digests with reuse equal tile digests without it.

Memory. The store holds the parent's tile versions for the fork window only (a lead of at most 2 s and 1 s after the failure, §27.3): one base version per tile plus one version per tile-update that changed content. sim.estimate reports the bytes before a fork batch is admitted. A store over its budget disables reuse for that batch, which then recomputes in full and stays exact.

Receipt. Every fork receipt carries field_reuse with the measured a, d and b and the counts of tiles referenced and recomputed. --no-field-reuse forces full recomputation.

Pilot before funding. Paper-scale, on the CPU: an explicit thin-film update on a 256 × 256 tile grid divided into two rooms, a scripted robot path in one room, and 100 forks that change the path at the fork tick; measure a, d and b and compare digests. Falsifier: d above 4.21% on the two-room case, b above 5%, or one digest mismatch. Cost: about two engineer-days (TARGET).

Ceiling, stated before any speed test. With every far tile clean the factor is 1/((1 − a) + b): 1.23 at a = 0.2, 4.8 at a = 0.8 and 16.7 at a = 0.95, for b = 0.01. It applies to forks of worlds with living fields and to nothing else: not to first runs, and not to worlds whose fields are a small share of the step.

Gate. GATE-HAB-15 (Known answer and Design comparison, M6). On the two-room spill fixture, 1,000 forks with reuse equal 1,000 forks without, tile digest for tile digest at every substep; the three known answers hold; the dirty set never exceeds the stencil cone; and where measured a is at least 0.9, fork cost is at most 0.15 of full recomputation at the paired 95% bound.

Kill gate. ✖ KILL-FARFIELD. Trigger: one digest mismatch that survives a repair cycle; or the pilot's falsifier; or no admitted living-world fixture reaches a ≥ 0.8. Fallback: the full-replay forks of §27.3, which are exact and need no dependency tracking.

19.22 Scaled instances: distances, normals and ray parameters in world metres

What it is. S The conversion rules for any query that reaches geometry through an instance transform with a scale. The compiler of §19.4 bakes scales before it computes a field, so a compiled pack is in world metres. The rules bind wherever a scaled transform survives to query time: an imported pack inspected before it is compiled, a distance brick shared by instances of different size, the viewer's picking rays, and any adapter over a sibling's ray primitive. Owner: frob-scene (compiler and bricks), frob-sense (ray kernels), the viewer. Verbs: scene.compile, scene.accept.

Rules. DESIGN. Let A be the linear part of the instance transform, local to world.

  1. Distance. A local signed distance d outside the shape bounds the world distance to [σ_min(A)·d, σ_max(A)·d]. It equals the world distance only for a uniform scale, where both ends coincide. An unresolved query is refined, or the field is baked in world metres; a local distance is never returned in metres.
  2. Normals. A surface normal transforms as A⁻ᵀ·n and is then renormalized, before any contact frame or optical response is built from it.
  3. Rays. For a unit world direction d the local direction is A⁻¹·d. If the primitive renormalizes it, the hit parameter is in local units and s_W = s_L/‖A⁻¹·d‖. The conversion happens before hits are sorted, clipped to a range gate, or used as optical depth.

Counterexamples.

  • A unit sphere scaled by (2, 0.5, 1). At the world point (0, 0.6, 0) the local distance is 0.20 and the clearance is 0.10 m: read as metres, the local value admits a 0.15 m probe that intersects. At (2.2, 0, 0) the local distance is 0.10 and the clearance is 0.20 m. Both lie inside the bounds [0.5·d, 2·d].
  • Two planes facing one ray. An opaque foreground plane at 2 m belongs to an instance of scale 1/2 and reports a local parameter of 4. A background plane at 3 m belongs to an instance of scale 3 and reports 1. Sorting by the local parameter returns the occluded plane, and a range gate of 2.5 m applied to the local values discards the foreground and keeps the background.

FACT (franken_threed/crates/f3d-math/src/ray.rs:487–490 and vector3.rs:708–719 at bf7abe16367e, read 2026-11-21): Ray::apply_matrix4 transforms its direction with Vector3::transform_direction, which normalizes the result, as the scene-graph method it mirrors does. An adapter over it converts by rule 3.

GATE-HAB-16 Known answer. The two sphere points return clearances of 0.10 m and 0.20 m after compilation, and the pre-compilation query returns the interval of rule 1 and never the local value. The two-plane fixture returns the foreground at 2 m through the compiled pack, through the viewer's pick and through the adapter; the mutant that sorts local parameters returns the background and fails. On 10³ random instances with anisotropic scales in [0.25, 4], depth against an analytic plane is within 1 mm plus the brick bound. M2.