Chronicle: telemetry, replay, evidence
9,263 words22 subsections15 tables6 listingsPlan version 1.1
On this page22
29.1 What Chronicle owns
Chronicle is the record. It owns one crate, frob-chronicle, and through it: the ledger and the column store; the
.frun format; the protocol by which a device worker publishes chunks so that a crash, a retry or a late writer
cannot corrupt or duplicate the record; telemetry levels, streams and channel kinds; the choice of which worlds are
traced; deterministic aggregates; snapshots as stored objects, replay, teleport, the fork mechanism (which implements
the five classes of §27.4) and the first-divergence algorithm; the energy ledger and the audit for energy the
simulator created; the failure taxonomy;
the stores behind the fidelity ledger (§16), the rank-agreement ledger (§28.10), the tier-correction ledger and the
memo graph (§28.14); the artifact graph that ties every claim to its evidence; token-budgeted summaries; the
structured log per bead; retention.
Chronicle does not decide anything about a design. It refuses to let a claim be printed that it cannot trace, and it refuses to compute a metric from samples it does not have.
| Mechanism | Tier | Verb | Gate | Section |
|---|---|---|---|---|
Ledger, column store, .frun |
S | run.export, telemetry.query |
GATE-CHRON-04, -10 | §29.3 |
| Chunk protocol and pinned pagination | S | telemetry.query; every publishing worker |
GATE-CHRON-04 | §29.4 |
| Levels, streams, channel kinds | S | telemetry.summary, telemetry.query |
GATE-CHRON-13 | §29.5 |
| Tracing by address | S | Run manifest fields trace.rate, trace.size |
GATE-CHRON-07 | §29.6 |
| Integer histograms | S | telemetry.histogram |
GATE-CHRON-07 | §29.7 |
| Replay and teleport | S | sim.replay |
GATE-CHRON-01, -02 | §29.8 |
| Fork classification | S | run.fork |
GATE-CHRON-05 | §29.8 |
| First divergence | S | telemetry.divergence |
GATE-CHRON-06 | §29.8 |
| Energy ledger and created-energy audit | S | telemetry.energy |
GATE-CHRON-03, -08 | §29.9 |
| Failure taxonomy | S | telemetry.failures |
GATE-CHRON-08 | §29.10 |
| Tier-correction ledger | S; its benefit is a HYPOTHESIS | eval.promote |
GATE-CHRON-09; KILL-DR | §29.11 |
| Background referee sampler; segment fidelity | F | Daemon setting; telemetry.query |
With §16 | §29.11 |
| Self-contained HTML replay | S | telemetry.export-html |
GATE-TETHER-16 | §29.12; page and viewer in §32.15, §32.24 |
| Artifact graph | S | evidence.trace |
GATE-CHRON-10 | §29.13 |
| Bead logs | S | None; written by the gate recorder | GATE-CHRON-10 | §29.14 |
| Simulation testing | S | None; a test tier | GATE-CHRON-11 | §29.15 |
| Retention | S | store.status, store.collect |
GATE-CHRON-12 | §29.16 |
29.2 Decisions
- ADR-CHRON-01: metadata in a ledger on FrankenSQLite, bulk data in content-addressed column files. Reason: the
ledger needs transactions and queries; traces need sequential writes and deduplication. This is the pattern of
FrankenSim's
fs-ledger(FACT). - ADR-CHRON-02: the logical chunk partition is fixed per run and independent of device sharding. Reason: after a retry splits a shard, two different range keys can cover the same transition. With a fixed partition, identical work always has an identical key, so a duplicate is detectable and a conflict is provable.
- ADR-CHRON-03: evidence aggregates are integers. On the evidence path an aggregate is a count, an integer sum, a minimum, a maximum, a bitwise or, or a histogram of integer counts. Quantiles come from histograms. Order-dependent sketches are not used. Reason: integer addition, minimum, maximum and or are commutative and associative, so the result has the same bits under any scheduling, shard split or merge order. The same rule gives the one positive licence for device-side atomics: integer maximum, minimum, or and add only.
- ADR-CHRON-04: worlds are chosen for tracing by address, never by arrival. Reason: a sample that depends on which slot finished first is not replayable and is not the same for two arms of a comparison.
- ADR-CHRON-05: digests are integer mixes computed in-kernel; BLAKE3 is used on the host. Reason: integer arithmetic is exact on every backend.
- ADR-CHRON-06: a fork is classified before any state is restored. Reason: restoring first and discovering later that the change invalidated the restored state produces a trajectory of no design.
- ADR-CHRON-07: no claim without a trace. Every claim that crosses the agent boundary has a
claim_idthat resolves to evidence, to the version of the rule that decided it and to the executions that produced it. A claim that does not resolve is not printed. - ADR-CHRON-08: the numerical residual is its own line, and created energy is audited. The integrator's and the solver's energy error is never folded into a physical term, and energy that appears from nowhere is a finding about the simulator, reported against the result that benefited.
- ADR-CHRON-09: retention never removes evidence silently. Deletion leaves a tombstone; a metric whose samples are gone is refused, not interpolated; chunks in the evidence closure of a live claim are pinned.
29.3 What is stored, and where
Run and episode metadata, events, summaries, receipts, verdicts and predictions live in a ledger on FrankenSQLite (the
pattern of FrankenSim's fs-ledger, FACT). Bulk data lives in content-addressed column files. Everything carries the
identities of §11.
| Ledger table | One row is | Written by |
|---|---|---|
run, job |
A run or job: manifest hash, identities, state, budgets, terminal receipt with counts | §32 |
episode |
(run, world, episode): outcome, T0 metrics, digests, failure class | Chronicle |
chunk, frontier |
A published chunk; the contiguous committed frontier (§29.4) | Chronicle |
event, snapshot |
A T1 event; a T3 snapshot with its content hash | Chronicle |
fidelity, rank_agreement, tier_correction |
A stratum of the three ledgers of disagreement | §16, §28.10, §29.11 |
verdict, prediction, core_decision |
A verdict record (frob.verdict/1); a registered prediction; one decision of a decision core |
§28 |
memo_node |
A node of the memo graph with its key, class and cost | §28.14 |
claim, evidence, edge |
The artifact graph (§29.13) | Chronicle |
alpha_spend |
A pre-committed confirmation request and its error budget | §24 |
pin, tombstone |
A retention pin with its reason; a record of something deleted | Chronicle |
The .frun format (FMT-FRUN, schema frob.run/1). frob run export <run> writes a run as a manifest in
canonical JSON and a set of column files. The manifest holds the run identity; the model, scene, task and policy
identities; kernel versions, tier, determinism class and effort profile; the chunk length; channel schemas; the chunk
index with content hashes and chain digests; the frontier; every gap with its reason; and the no-authorization flags
of §12. A column file has a header (schema identifier, channels with kind, unit, frame and quantization, tick range)
and fixed-width little-endian columns, quantized integers or f32. A .frun is readable with no device and no
daemon, and frob-verify checks its hashes and chains with the standard library alone. Integers that can exceed 2⁵³
(ticks, sequence numbers, digests) are strings in every JSON view.
29.4 The chunk protocol
A world's record is published in fixed logical chunks. Chunk i of episode e of world w on stream s covers control ticks [i·L, (i + 1)·L), cut short only by the episode's terminal tick; L is fixed for the run at admission (OPEN-CHRON-2). The key does not mention a device, a shard, a batch slot or a retry.
// DESIGN: intent, not signatures.
struct ChunkKey { run: RunId, world: u32, episode: u32, stream: StreamId, index: u32 }
struct ChunkRecord {
key: ChunkKey,
content: Blake3, // hash of the column file bytes
prev: Blake3, // chain digest of chunk index − 1; zero for index 0
chain: Blake3, // H(prev ‖ content ‖ key)
state_digest: u128, // in-kernel digest of the world's state at the chunk's last tick
lease_gen: u64, // fencing token of the writer
commit_seq: u64, // assigned inside the publishing transaction; a string on the wire
gaps: Vec<Gap>, // dropped intervals, each with a reason
}
Publishing is one transaction in the ledger, and it does five things or nothing.
- Lease. The writer's
lease_genequals the run's current lease generation. Any reassignment of worlds to workers, by retry, shard split or device loss, increments the generation, so every older writer is fenced out; a healthy writer renews at its next chunk boundary. A late lease is refused and nothing is written. - Alignment. The chunk covers exactly its partition extent, or ends at the episode's terminal tick. A range that is not a partition extent is refused, so partially overlapping ranges cannot be committed.
- Predecessor.
indexis the frontier of (run, world, episode, stream) plus one, andprevequals the chain digest at the frontier. - Duplicate or conflict. If the key is already committed with the same content hash, the original receipt is
returned and no row is written. If it is committed with different bytes, the run is marked
determinism-violated, serving from the memo graph stops for the node kinds involved, and the publish is refused (FROB-REF-878). - Commit. The row is inserted, the frontier advances, and
commit_seqis the run's counter plus one.
The receipt is (key, chain, commit_seq). Three properties follow. The frontier is contiguous: for every (world, episode, stream) the committed chunks are exactly indices 0 to the frontier, with no hole. A reset that reuses tick zero cannot collide, because the next episode has a different key. And a crash after commit but before the receipt reaches the writer is harmless: the retry finds the key committed with the same hash and gets the original receipt.
Pagination is pinned to the committed frontier. A query fixes, on its first page, the run, the value of
commit_seq at that moment, its filters and a total order (tick, world, episode, stream, sample identifier, so that
samples with equal timestamps are ordered). Rows committed later are invisible to that query. The cursor is the pin
plus the last order key. Appends between pages can therefore neither skip nor repeat a row. A summary statistic names
the frontier it was computed at, and a verdict cites the frontier it read.
Stopping. Cancellation takes effect at safe boundaries: the worker drains, discards unpublished state, and
acknowledges with the last committed tick per world, the outstanding device work and the observed cancellation
latency. A budget stop publishes nothing partial as a result; the chunks already committed remain as telemetry, and
the terminal receipt says budget-stop. Every terminal receipt counts completed, failed, refused and unstarted
trials, and separates three things that must never be merged: a numerical refusal, a budget stop and a physical
failure.
29.5 Telemetry levels, streams and channel kinds
| Level | Contents | Default scope |
|---|---|---|
| T0 | Per-episode metrics, the energy ledger totals, integer histograms and per-chunk minimum-maximum envelopes of declared channels (§29.7), and state digests at intervals | Every world, always |
| T1 | Events: contacts made and broken, limit and saturation episodes, faults, refusals | Every world |
| T2 | Traces at control rate: joint states, torques, contact wrenches, estimator state | An address-keyed sample of worlds (§29.6), and every failing world |
| T3 | Full state snapshots at intervals, sufficient for exact restart | Sampled and failing worlds |
A per-world ring buffer keeps the last seconds at T2 and T3 on the device and is flushed when a world fails, so failures are always recorded in full without paying to record everything. The ring is also frozen around a mode change or a requested tick.
Telemetry is organized in nine streams. A chunk belongs to one stream.
| Stream | Retained fields | Primary use |
|---|---|---|
| Kinematics | Base and joint state as group elements and velocities | Replay, viewer, metrics |
| Contact | Feature pair, normal, gap, impulse, patch, stick or slip, solver residual of the owning island | Slip and traction diagnosis; the audit of §29.9 |
| Energetics | Every term of the energy ledger, per port | The energy ledger |
| Control | Policy or controller identity, the provenance of each input sample, requested and applied action, saturation, fallback taken | Exploit detection; action-likelihood accounting (§23) |
| Sensing | Capture and delivery instants, validity mask, bias state, calibration identity | A-17, A-21, estimator diagnosis |
| Solver | Mode, iterations, residuals, step reductions, precision, contact capacity used, effort profile | DC-08; Degraded and Faulted counts |
| Runtime | Placement per stage (requested and actual), resident bytes, transfers, queue delay, shape bucket | The performance program (§36); DC-09 |
| Task | Goal events, termination against truncation, hard violations, reward and requirement components | Scorecards (§24) |
| Provenance | Identities, versions, lease generation, frontier | The artifact graph |
Every channel declares its kind, unit, frame, sampling, quantization and permitted consumers. The kind fixes how the channel may be downsampled; a downsampling that ignores it is a defect that changes physics on the page.
| Kind | Example | Correct downsampling | Wrong, and why |
|---|---|---|---|
| State | Joint angle, base pose | A sample, or a minimum-maximum envelope; orientation by a group-aware mean or a sample | A componentwise mean of quaternions leaves the group |
| Interval mean | Mean power over a tick | Duration-weighted mean | A sample drops energy |
| Impulse | Contact impulse | Sum over the window | A mean or a sample changes momentum transfer |
| Event | Contact made, limit hit | All events, or a count | Decimation deletes the event that explains the failure |
| Cumulative counter | Energy drawn, distance | Last value | A sum counts everything twice |
At a jump (an impact, a reset map, a mode switch) the state before and the state after are both recorded. Telemetry that was dropped is marked with its interval and its reason, and a metric whose samples are missing is refused (FROB-REF-888), not estimated from its neighbours. Channels are labelled as visible to the acting policy or as privileged; the isolation itself is enforced in §20 and §23, and Chronicle's label is what an audit reads.
29.6 Choosing which worlds to trace: a reservoir by address
T2 and T3 cannot be kept for every world. The sample is chosen by a hash of the world's address:
h(w) = Philox( key = run_seed, counter = (world, episode), stream_id = "telemetry-sample" ) as u64
fixed rate p trace w iff h(w) < ⌊p · 2⁶⁴⌋
fixed size k trace the k worlds with the smallest h(w)
The stream identifier is its own, so the choice is independent of every random draw the physics makes. The fixed-size form is a reservoir sample without the usual dependence on arrival order: the k smallest hashes of a set are a uniform sample of size k without replacement, and the k smallest of a union are the k smallest of the per-shard k smallest, so shards merge exactly. Four properties follow from the sample being a pure function of addresses.
- Replay needs no record of the choice; it recomputes it.
- Two designs compared on the same addresses are traced in the same worlds, so every traced pair is a pair.
- Co-tenancy, slot assignment, preemption and shard count cannot change it.
- Inclusion probabilities are known, so population estimates from traced worlds are weighted: 1/p for the fixed rate, N/k for the fixed size with N worlds admitted. Failing worlds are always traced; they form a stratum of weight one, and an estimate over all worlds is the stratified sum of the two.
29.7 Deterministic integer histograms
Distributional summaries (the 95th percentile of knee torque, the distribution of friction utilization) are histograms of integer counts over integer bins.
- Quantization. A channel declares a quantum u. A value x becomes q = round-half-even(x/u), saturated to the channel's integer range, with one overflow bin on each side. The result depends only on the bits of x.
- Bins. For magnitude |q| below 2ˢ, one bin per integer, exact. Above, the octave e = ⌊log₂|q|⌋ is split into 2ˢ equal sub-buckets, index (|q| >> (e − s)) & (2ˢ − 1). With m magnitude bits there are (m − s + 1)·2ˢ bins per sign, and every bin's width is at most 2⁻ˢ of its lower edge. Defaults (DESIGN): run-level histograms m = 24, s = 5, 640 bins per sign, relative resolution 3.1%; per-world T0 histograms m = 16, s = 3, 112 bins per sign with 16-bit saturating counts, about 450 bytes per channel per world.
- Arithmetic. Count-leading-zeros, shifts, masks and integer add: exact on every backend. Merging two histograms is integer addition of counts. A run-level histogram may be accumulated on the device with integer atomic add (ADR-CHRON-03) in 32-bit bins, under the width rule of §21.26: the host drains the bins into 64-bit totals at every chunk commit, a step plan is admitted only if no bin can receive more than 2³² − 1 increments in one chunk, and no backend is asked for a 64-bit atomic.
- Queries.
frob telemetry histogram <run> --channel <name> --quantile 0.95returns the bounds of the bin that contains the quantile, as an interval, with the count. It never returns a point it did not measure.
Order-dependent quantile sketches (the compactor and digest families) are excluded from the evidence path: their output depends on insertion and merge order, so the same worlds replayed under a different shard split give different bits. Counterexample on the smallest scale: a compactor of capacity two that keeps the lower of each sorted pair summarizes the stream 1, 2, 3 as {1 with weight 2, 3} and the stream 3, 2, 1 as {2 with weight 2, 1}, so the medians are 1 and 2; integer bin counts are 1, 1, 1 in both orders.
29.8 Replay, teleport and forks (GOAL-10)
A world is determined by its address, its model, scene, task and policy identities, and its kernel versions. frob sim replay <episode> reproduces it. Adding --tier batch-cpu teleports it: the run restarts from the nearest
snapshot on the CPU, compares digests step by step with the recorded ones, and at the first difference re-runs that
step with per-stage digests to name the stage and kernel where the tiers part (the per-subsystem digest technique of
the Wright Flyer plan, FACT). Digests are a 128-bit integer mix computed in-kernel, since integer arithmetic is exact
on every backend; BLAKE3 is used on the host for snapshots.
A world's trajectory must not depend on the batch it ran in. Replay of one world alone, in a batch of different size, and among different co-tenants must give the recorded digests on the same backend (GATE-CHRON-01).
What a snapshot contains. Physical state as group elements, velocities and anchored cell indices; contact feature memory, impulses and every solver warm start; the phase accumulators of every clock and every packet queue with its packets (§20); controller, estimator and filter state, including a policy's recurrent state; actuator thermal and electrical state; the step counter that indexes the counter-based random streams (there is no generator state to save); scene state the robot can change (movable objects, and film or wear fields where those features are on); learning state when the run is a training run; the command cursor; and the provenance identities. Full snapshots are relocatable; sparse differences are stored between them. A snapshot is bound to its numerical profile: restoring it under another profile is a comparison replay, not a continuation.
Fork classification. frob run fork <episode> --at <tick> --change <set> classifies the request before it
restores anything, and returns the class, the earliest valid fork tick and the fields that forced it;
--classify-only restores nothing. This section owns the fork mechanism: snapshots, restore, the shared prefix and
the verb. The classes are the five of §27.4, which owns the intervention semantics; the mechanism implements those
five and adds none.
| Class (§27.4) | Example | Restart point | What is reused |
|---|---|---|---|
| Continuation | Replay; teleport; the empty intervention; a placebo | The nearest snapshot whose physical, clock, sensor and policy contracts all match the recorded run | Everything. On the same backend it replays bit for bit |
| Exogenous intervention | A changed setpoint; a declared future disturbance; a change to a part of the scene the robot has not yet touched or sensed | The fork tick, which is no later than the first tick at which recorded state depends on a changed field | The whole checkpoint, restored with nothing regenerated; exogenous draws by address |
| Contact-affecting intervention | Friction or compliance of a surface in contact at the fork tick; the contact law | The fork tick | Positions and velocities. Contact memory is discarded, the first solve runs cold with a raised iteration cap, and the fork is labelled |
| Information intervention | Sensor noise or latency; privileged state substituted into the estimator | The fork tick | Physical state. Packet queues and filter state are re-initialized as the intervention states; labelled diagnostic where no hardware could realize it |
| Structural or design-parameter intervention | A larger wheel; a gear ratio; a mass or inertia; an actuator card; a sensor mount; controller gains or memory; policy weights | The authored initial condition, settled again for the new design | Exogenous draws only, by address and by physical coordinate. Contact memory, proprioception, sensor histories and policy actions are regenerated |
Negative control: grafting the contact warm start of a 60 mm wheel onto a 75 mm design at a threshold lip must return a structured refusal (FROB-REF-582, the code of §27.4) naming the contact memory as the field that forces a restart. A prefix is reused only when it is identical by construction, never because it is "close".
The first-divergence algorithm. frob telemetry divergence <a> <b> answers "where do these two computations
part", for a replay against its record, two tiers, or two designs of one lineage.
- Align. Committed ticks and events of both runs; canonical variables by stable identifier (link, joint, contact feature pair, channel).
- Exact classes. Compare the chain of state digests. Because each chain value covers the whole prefix, "the prefixes agree up to chunk i" is monotone in i and binary search over chunks is valid. Inside the first unequal chunk the per-step digests are compared in order, and the first unequal step is re-run with per-stage digests.
- Tolerance class. For an interval of ticks, the stored envelopes give an upper bound on the largest scaled difference and the stored samples give a lower bound. An upper bound at or below tolerance certifies agreement on the interval; a lower bound above tolerance proves a mismatch inside it; anything else is unresolved and is refined chronologically, earliest sub-interval first.
- Never bisect on an undecided or pointwise predicate. Counterexample: two traces differ at ticks 1 and 5 and agree at ticks 2 to 4. A midpoint search on "tick k differs" probes tick 3, sees agreement, goes right and reports tick 5.
- Missing samples. The answer is the earliest possible interval and a coverage gap, not a tick.
- Stage. Within the first supported interval the algorithm refines to the first stage over tolerance.
- Changed topology. Two designs with different bodies are compared on shared interfaces and task observables only. A new leg has no counterpart.
- Decisions. Beside the state divergence, the first tick at which a task decision differs (a contact-mode sequence, a termination, a success) is reported, which is what the decision-level equivalence test of §35 reads.
The report is a statement about where two computations part. It is not a statement about cause, and the order in which solver stages report residuals is not evidence of a first physical cause.
29.9 The energy ledger (GOAL-11) and the audit for created energy
For each world and episode:
battery energy out = Σ actuators (copper loss + friction loss + gear loss + Δ stored) + mechanical work at joints
mechanical work at joints = Δ kinetic + Δ potential + contact dissipation (normal damping + sliding friction)
+ joint damping + work on fixtures and payloads + numerical residual
Every term is a port quantity (C-12), accumulated in double-float on the device. The numerical residual is reported as its own line, "integrator and solver", and is never folded into a physical term. Breakdowns are available by joint, by limb, and by stance and swing. Cost of transport decomposes along the same lines, so an agent can see that, say, 38% of the energy went to copper loss in the knees during stance.
Three refinements. On the electrical side, bus power Σ vⱼ·iⱼ is integrated with its positive and negative parts separately, so regeneration is visible and is never netted against draw without saying so. Energy per task is reported two ways: the mean over completed episodes, and the total over all attempts divided by completions. A design that succeeds once for 10 J and fails once for 20 J reports 10 J and 30 J; a rival with two 12 J successes reports 12 J and 12 J; the first figure alone would rank them wrongly. And every energy figure names the residual it was computed with.
The audit for energy the simulator created. A fast contact model can hand a policy energy that no actuator supplied. The ledger makes this measurable, and three monitors watch for it in every world.
| Monitor | Quantity | Flag | Threshold (TARGET) |
|---|---|---|---|
| Residual sign | r = Δ kinetic + Δ potential − (actuator work + external work − all dissipation), per step; created energy is Σ max(0, r) over a window | energy-created |
Created energy above 1% of the absolute work exchanged in any 0.5 s window on a fast tier; above 10⁻⁶ relative on the referee |
| Contact passivity | The net work a contact does on the bodies over one contact episode, from touch to release | contact-active |
Net positive work above the tier's residual bound: the contact returned more than it absorbed |
| Cone excess | Friction utilization ‖f_t‖ / (μ·f_n) per contact | cone-excess |
Utilization above 1.05 for more than 1% of stance time; a pyramidal cone admits up to √2 along its diagonal |
energy-created, with this window and this denominator, is the one flag of the created-energy audit; §16.10 applies
it and defines no other label or threshold. A flagged episode keeps its result and gains the flag. A design or policy
whose advantage in a comparison coincides with flagged episodes is typed model-conditional by A-19 (§28.11), and
the exploitation detectors of §23 read the same flags. Known fixtures: a body bouncing on a stiff penalty contact at a
step near the stability limit gains height
and must raise energy-created and contact-active; the same drop under the convex law at the default step must
raise neither; a block pushed along the diagonal of a pyramidal cone must raise cone-excess.
29.10 Failure taxonomy
Mechanical classes: fall, stuck, collision, self-collision, slip, torque-saturation, speed-saturation,
thermal-limit, limit-impact, timeout, numerical-fault. Classes for the world and for perception: film-slip
(traction lost on a contaminated surface), thermal-runaway, brownout, perception-dropout (a sensor blinded by
glass, steam or glare), localization-alias, pinch, snag, slosh-tip, gait-instability, observation-alias,
timing-race, model-drift. A class of the second group is reported only when the feature that can produce it is on
in the scene or the model.
Every terminal outcome also has a kind: physical (the simulated robot failed), numerical (the solver or integrator
refused or faulted), budget (a limit stopped the run) or protocol (the request was invalid). A numerical outcome
leaves the verdict unknown; it is not counted as a physical failure and it is not dropped from the denominator.
Monitors timestamp their first anomaly; the earliest anomaly before the terminal event is reported as the first cause,
with stills at −0.5 s, 0 s and +0.2 s. The ordering is a heuristic and is labeled Estimated. It is a description.
Attribution by intervention is §27.
29.11 The tier-correction ledger
Promotion (§16, DC-01) says whether a fast-tier result is faithful. It does not say what the number would have been on the referee. The tier-correction ledger supplies that number from the pairs promotion already pays for, with an estimator that stays unbiased when the fast tier is wrong.
What a row holds. Key: model class, scene class, task, quantity, tier pair, kernel versions, effort profile, battery version. Measures: the number of paired addresses; mean and variance on each tier; mean and variance of the difference; the per-episode correlation ρ_ep; the regression coefficient β; the audit probabilities used; the effective sample size; the share of the stratum's scenarios the referee can complete; the estimator version and the frontier.
The estimator S. N addresses run on the fast tier. Each gets a prediction mᵢ of its referee outcome, fixed
before any referee outcome of the round exists (by default mᵢ = c + β·Y_fast,i with c and β from earlier rows of the
ledger; β = 1 and c = 0 in a new stratum), an audit probability pᵢ ≥ 1/20 (DESIGN floor), and an audit bit Aᵢ drawn
from the address-keyed stream "referee-audit". Referee episodes run only where Aᵢ = 1. eval.promote returns θ̂ with
its interval beside the label that DC-01 issues.
Zᵢ = mᵢ + Aᵢ · (Y_ref,i − mᵢ) / pᵢ θ̂ = (1/N) · Σᵢ Zᵢ
- Unbiased under a wrong fast tier. E[Aᵢ/pᵢ] = 1 given everything fixed before the draw, so E[Zᵢ] = E[Y_ref,i]. A bad prediction inflates the variance and cannot move the mean. The estimator is of the doubly robust kind (right if either the audit probabilities or the outcome model is right), and here the audit probabilities are exact by construction, because the draw is an addressed stream.
- Two exact limits. With every pᵢ = 1 it is the plain referee mean, exactly. With no audited address it is refused.
- Bounded weights without clipping. The floor on pᵢ bounds every weight by 20, so nothing is clipped and no clipping bias exists. Likelihood-ratio weights for tilted failure proposals are a different object and belong to §26, where clipped mass is reported.
- Variance. About (1/N)·[Var(Y_ref) + E((1 − p)/p·(Y_ref − m)²)]. For a constant audit fraction n/N, N much larger than n and the best linear prediction, this is (1 − ρ_ep²)·Var(Y_ref)/n: the saving in referee episodes is 1/(1 − ρ_ep²).
- Sequential use. Zᵢ is bounded once the metric has a span, so a confidence sequence on θ̂ lets a promotion stop early against a declared indifference margin. For a design comparison the same construction is applied to the paired contrast, and both referee arms run only on audited addresses.
Limits and fallbacks. Budget: 256 referee episodes per promotion (DESIGN), after which the result stays
provisional. The estimator is switched off for a stratum, and promotion falls back to referee episodes alone, when
the effective sample size (Σ wᵢ)²/Σ wᵢ² falls under 30% of the audited count, or when ρ_ep is under 0.7 on at least
200 paired addresses (DESIGN triggers; 0.7 is the kill threshold of the rank-agreement experiment). The same audited
pairs feed DC-01's exceedance bits and this estimator, and the audit draw is frozen within a round, so the two cannot
steer each other. The loss model in the contract: wrong establishment 100, a referee episode 1, a wrong refusal 10
(DESIGN constants). Calibration: interval coverage is checked against full-referee values on the standard battery
(§38).
The ceiling. The saving is 1.96 at ρ_ep = 0.7, 5.3 at 0.9, 10 at 0.95 and 25 at 0.98 (arithmetic). Paired worlds decouple under contact, and published cross-fidelity correlation becomes neutral at large dynamics gaps (FACT, source register), so the plan expects about two until a higher ρ_ep is measured. The estimator is adopted because it is nearly free, not because it is a large factor.
The referee's reach. A promotion needs referee episodes, and the referee does not reach every scenario:
FrankenSim's articulated contact step admits at most 21 contacts and its event solve has no persistent time stepper
(FACT: frankensim/crates/fs-mbd/src/articulated_contacts/step.rs, fs-contact/src/sustained/solve.rs MAX_CONTACTS = 21; re-read at the pinned commit). The ledger therefore records, per stratum, the share of battery scenarios the
referee completes and the wall-clock of a promotion, and both figures are reported at the M2 exit. A promotion in a
stratum the referee cannot complete returns provisional: referee-unavailable.
A background sampler F. Idle CPU cores re-run address-sampled fast-tier worlds on the referee from their snapshots and write rows into the fidelity and tier-correction ledgers. At the planned throughputs it covers on the order of 0.1 to 2.4% of GPU world-seconds if the referee runs at 0.2 to 1.0 times real time per core on 24 cores (HYPOTHESIS; the arithmetic is §16.11's and the speed is measured at M2), and it reports the coverage it measured. It is a correctness guard and a free source of pilot variances. It is not a speed lever, and its mechanism belongs to §16.
Segments are a different quantity F. Restarting one-second segments on the referee from fast-tier snapshots shows where in an episode the tiers part. It estimates per-segment fidelity, not the episode-level outcome, and is never used for promotion. Falsifier: if segment disagreement does not predict episode-level exceedance better than chance on the standard battery, the mode is removed; the ceiling of its benefit is diagnostic time, not referee cost.
29.12 Summaries an agent can afford
frob telemetry summary --budget 800 returns a hierarchical summary sized to a token budget, with handles for
drill-down. Numbers carry units and evidence classes. A compact encoding is available (the suite's MCP tools already
use TOON, FACT). Raw traces are never the default answer.
Every summary states its denominator and the frontier it was computed at. Counts sum to what was planned: completed,
failed, refused, unstarted, and for a paired study the five cells of the accounting identity of §28.6. Progress is
reported with its denominator ("1,312 of 2,048 episodes committed"), never as a bare percentage. Each number that
supports a claim carries the claim_id, so a drill-down handle and an evidence trace are the same thing.
The self-contained replay. telemetry.export-html is a verb of the telemetry cluster, and frob-chronicle writes
its packet: frob telemetry export-html <run> --world <address> produces one offline HTML file that replays an
episode from stored telemetry and computes nothing new. What the page shows, its overlays and its size budget are the
viewer text of §32.15 and §32.24, which also hold its gate (GATE-TETHER-16).
29.13 The artifact graph: every claim traces to its evidence
Four kinds of identifier tie a statement to what supports it.
ClaimId BLAKE3( claim type ‖ subject identities ‖ statement ‖ scope )
EvidenceId BLAKE3( kind ‖ payload hash )
kinds: episode set · chunk range · snapshot · certificate · receipt · ledger row · analysis result
DecisionPolicyId ( dotted rule name, version ) e.g. ("atelier.dc01.promote", 3)
TraceId 128-bit, time-ordered identifier of the execution that produced an evidence item
edges claim ──supported-by──► evidence claim ──decided-by──► decision policy
evidence ──produced-by──► trace evidence ──derived-from──► evidence
claim ──depends-on──► claim (the weakest input bounds the claim, §8)
FACT: asupersync/franken_kernel/src/lib.rs defines TraceId, DecisionId and a PolicyId of a dotted name and a
version. Its PolicyId names a decision rule; the plan's PolicyId of §11 names a control policy by content hash.
The decision-rule identifier is therefore called DecisionPolicyId throughout this plan, whichever crate supplies the
type (OPEN-CHRON-3).
Rules. An envelope that carries a claim carries its claim_id. frob evidence trace <claim_id> returns the closure:
the evidence items, the rule versions that decided, the executions, and the claims it depends on. A claim whose
closure contains a dangling or tombstoned node prints evidence: unavailable and cannot be cited (FROB-REF-869). Each
gate row in registries/gates.toml lists the claim_ids that its recorded PASS rests on, and each demonstration
manifest lists the claims it supports with commands that run in under 60 s. Trace identifiers and wall-clock times
identify executions; they never enter a content hash, so two executions of the same work produce the same evidence
identifiers and different traces.
29.14 A structured log per bead
Every bead (§45) has an append-only log, docs/delivery/logs/<bead>.ndjson, schema frob.beadlog/1. One line per
recorded event:
{"ts":"2027-02-11T09:14:03Z","bead":"BD-203","commit":"3f9c…","host":"m5u-01:fingerprint:8b1e…",
"toolchain":"nightly-2026-07-06","determinism":"D2","state_hash":"u128:5a07…","claim_type":"Known answer",
"claim_ids":["c:7d21…"],"metrics":{"worlds_replayed":{"v":1000,"unit":"1"},"digest_mismatches":{"v":0,"unit":"1"}},
"refusals":[],"verdict":"pass","recorded_by":"session:fresh-41","gate":"GATE-CHRON-01"}
A bead closes only with a line whose verdict is pass, whose claim_ids resolve in the artifact graph, and whose
recording session is not the session that implemented the bead (§38). The honest-status table is generated from these
logs and registries/gates.toml. The check is part of the existing generated-artifact check; it adds no new tool.
29.15 Simulation testing of the daemon and the ledger
The job state machine, the idempotency binding, the chunk publisher, pagination, the lease manager, the memo store and the dispatcher are concurrent code whose failures are rare interleavings. They are tested by deterministic simulation, not by waiting.
- Harness. asupersync's lab runtime supplies virtual time, seeded scheduling, fault injection, lineage-driven
fault selection, recorded replay and minimization of failing schedules (FACT:
asupersync/src/lab/containschaos.rs,injection.rs,ldfi.rs,replay.rs,replay_minimization.rs,schedule_minimizer.rs,dual_run.rsandexplorer.rs). The device is replaced by a fake whose episode outcomes are a pure function of the world address, so a whole campaign simulates in milliseconds. - Fault menu. A crash at every await point of the publish and submit paths; a torn ledger write; duplicate and reordered delivery; delay; lease expiry and takeover by a second writer; device loss; a full disk; a clock jump; cancellation at every boundary; a client that disconnects with a job running and reconnects by submission key.
- Lineage-driven selection. From the lineage of a successful run, the faults that could have broken its outcome are tried first, before random ones.
- Oracles. The invariants INV-CHRON-01 to -04 and -12, INV-ATEL-02 and -06, and the one-job-one-charge rule of §32.
- Minimization. A failing run is reduced to a seed, a fault list and a schedule of minimal length, stored as a regression that replays in under a second.
- Keeping the fake honest. Dual-run scenarios execute the same small job against the fake device and against
batch-cpuand require the same ledger state, so the fake cannot drift into testing a protocol the real workers do not follow.
Targets: every await point on the publish and submit paths is hit by a crash fault at least once, and 10⁵ seeded schedules run per release (TARGET). This extends the chaos tier of §38, which injects cancellation at kernel-batch boundaries; it does not replace it.
29.16 Retention
| Class | Contents | Default policy |
|---|---|---|
| Evidence-pinned | Chunks, snapshots, ledger rows, certificates and receipts in the closure of a live claim; qualification receipts; registered predictions | Kept until the claim is withdrawn; then tombstoned |
| Failure captures | T2 and T3 rings of failing worlds | Kept while the run is the head of a lineage or is cited by an open comparison, bisect or autopsy; then 30 days (OPEN-CHRON-4) |
| Sampled traces | T2 and T3 of sampled worlds that did not fail | Evicted under the store budget, oldest unpinned first |
| T0 and T1 | Metrics, histograms, digests, events | Kept for the life of the run record |
| Memo artifacts | Cached results (§28.14) | 64 GB by default; evict, never block |
frob store status reports what each class holds and what is pinned and why; frob store collect --dry-run lists
what a collection would remove. Pins are taken when a verdict is issued: the verdict's evidence closure is pinned in
the same transaction that writes the verdict, so the interval that explains a decision cannot be collected while the
decision stands. Collection marks from pins, open jobs, lineage heads and registered predictions, sweeps the rest by
class, and writes a tombstone for everything it removes: content hash, class, time, reason. A later citation of a
collected object fails with that reason. Telemetry derived from a private scene inherits the scene's privacy class
(§37) through retention and export.
29.17 Refusals
| Code | Refused | Ranked repair |
|---|---|---|
| FROB-REF-869 | Citing a claim whose evidence closure is dangling or tombstoned | Re-run the evidence; the tombstone names what is missing |
| FROB-REF-875 | A publish under a late lease | Re-acquire; replay from the last committed tick |
| FROB-REF-878 | Different bytes for a committed chunk key | Stop the run; file the determinism violation with both hashes |
| FROB-REF-582 (owner §27.4; FROB-REF-882 is retired in its favour) | State from one model grafted onto another: a fork that asks to reuse state its change set invalidates | Fork at the earliest valid tick returned; or restart and settle |
| FROB-REF-885 | A chunk that is not a partition extent, or whose predecessor is not the frontier | Publish in order on the fixed partition |
| FROB-REF-888 | A metric computed over missing samples | Re-run with the channel retained; accept unavailable |
| FROB-REF-894 | A snapshot restored under another numerical profile and labelled a continuation | Request a comparison replay |
| FROB-REF-896 | A pagination cursor used with a different pin, filter or order | Restart the query |
| FROB-REF-898 | An order-dependent aggregate requested on the evidence path | Use the integer histogram |
| FROB-REF-811 | A tier-corrected estimate across identities, with no audited address, or below the effective-sample floor | Referee episodes alone |
| FROB-REF-813 | A deletion that would remove a pinned object | Withdraw the claim first |
| FROB-REF-815 | Closing a bead without a resolving log line from another session | Record the gate from a fresh session |
29.18 Invariants and proof obligations
| ID | Invariant |
|---|---|
| INV-CHRON-01 | A committed chunk key maps to one content hash for the life of the run. |
| INV-CHRON-02 | For every (run, world, episode, stream) the committed chunks are exactly the indices 0 to the frontier. |
| INV-CHRON-03 | One idempotency key yields one job, one budget charge and one receipt, under any crash or retry (with §32). |
| INV-CHRON-04 | A paginated query returns every row visible at its pin exactly once. |
| INV-CHRON-05 | The set of traced worlds is a pure function of the run manifest and the addresses. |
| INV-CHRON-06 | Every evidence aggregate has the same bits under any permutation of worlds, shard split and merge order. |
| INV-CHRON-07 | A fork with the empty change set equals the replay, bit for bit on the same backend. |
| INV-CHRON-08 | A world's digests do not depend on batch size, slot or co-tenants. |
| INV-CHRON-09 | The lines of the energy ledger, including the residual line, sum to zero; no physical term absorbs the residual. |
| INV-CHRON-10 | Every printed claim resolves in the artifact graph; no trace identifier or wall-clock time enters a content hash. |
| INV-CHRON-11 | Every summary states its denominator, and its counts sum to the planned total. |
| INV-CHRON-12 | Collection never removes a pinned object, and every removal leaves a tombstone. |
| INV-CHRON-13 | The audit set of a tier-correction round is fixed before any referee outcome of the round exists, and every audit probability is at least the floor. |
| ID | Obligation | How it is discharged |
|---|---|---|
| PO-CHRON-01 | The publishing transaction preserves INV-CHRON-01 to -03 under every fault of §29.15. | Deterministic simulation over 10⁵ schedules; every failing schedule minimized and kept. |
| PO-CHRON-02 | The tier-correction estimator is unbiased, and equals the plain mean when every address is audited. | A written derivation; exact equality at n = N; simulation with a deliberately wrong prediction. |
| PO-CHRON-03 | The k smallest address hashes are a uniform sample, and per-shard samples merge exactly. | Derivation; inclusion frequencies over 10⁶ draws inside exact binomial bounds; merge equality on random shard splits. |
| PO-CHRON-04 | A histogram bin is at most 2⁻ˢ of its lower edge wide, and merge is associative and commutative. | Exhaustive check over all 16-bit magnitudes; property test of merges. |
| PO-CHRON-05 | The first-divergence algorithm never reports a tick later than the true first divergence on exact classes. | Planted divergences at one tick and at two ticks, 100 trials each. |
| PO-CHRON-06 | The in-kernel digest distinguishes states that differ in any recorded bit, to the collision budget of a 128-bit mix. | Avalanche tests at the Gauntlet's G0 tier; identical output on every backend for a pinned corpus. |
| PO-CHRON-07 | The energy ledger closes. | GATE-CHRON-03. |
29.19 Known answers and negative controls
| Subject | Known answer | Negative control that must fail |
|---|---|---|
| Energy ledger | A damped pendulum's ledger equals the hand calculation; residual below 10⁻⁹ relative on the referee | A sign error seeded at one port is localized to that port |
| Energy per task | 10 J success and 20 J failure against two 12 J successes: 10 and 30 against 12 and 12 | A report that prints only the conditional mean |
| Created energy | The stiff penalty bounce raises energy-created and contact-active; the convex law at the default step raises neither |
The audit switched off: the bouncing policy wins the comparison |
| Cone excess | A push along the diagonal of a pyramidal cone reaches utilization √2 | A circular-cone run flagged |
| Chunk protocol | Two identical publishes yield one row and one receipt; a crash after commit returns the original receipt | A late lease that writes; overlapping ranges that commit; a reset at tick zero that collides |
| Pagination | 10⁴ rows read in pages during concurrent appends: each row visible at the pin appears once | A query ordered by timestamp alone repeats or skips equal-time samples |
| Sampling | The traced set is identical under 100 slot assignments and shard counts | Arrival-order reservoir sampling gives different sets |
| Histogram | Counts identical under 100 permutations and shard splits, on every backend; the compactor example gives medians 1 and 2 | An order-dependent sketch on the evidence path |
| Downsampling | An impulse train summed over a window conserves momentum transfer | The same train averaged |
| Fork | The empty intervention replays bit for bit; a setpoint change at tick t reuses the prefix to the snapshot before t | The 60 mm warm start grafted onto the 75 mm wheel |
| First divergence | Traces that differ at ticks 1 and 5 report tick 1 | Midpoint search on a pointwise predicate reports tick 5 |
| Teleport | A planted single-kernel divergence is named by step and stage | — |
| Tier correction | Every address audited: the plain mean exactly; a prediction off by a constant: still unbiased | Audit bits chosen after seeing fast-tier failures, without recorded probabilities |
| Artifact graph | Every gate row resolves to evidence and traces | A claim printed after its evidence was collected |
29.20 Gates and kill gates
| Gate | Claim | Threshold (TARGET) |
|---|---|---|
| GATE-CHRON-01 | Known answer | 1,000 random worlds from a GPU run replay with identical digests on the same backend, and inside the class on batch-cpu; the same worlds replayed alone, in a batch of another size and among other co-tenants give the same digests. |
| GATE-CHRON-02 | Known answer | Teleport localizes a planted single-kernel divergence to the right step and stage in 100 of 100 trials. |
| GATE-CHRON-03 | Known answer | The energy ledger closes: residual below 10⁻⁹ relative on the referee and 10⁻³ on single-precision tiers; a damped pendulum's ledger matches the hand calculation. |
| GATE-CHRON-04 | Known answer | The chunk protocol under 10⁵ seeded fault schedules: INV-CHRON-01 to -04 hold in every one; each planted violation (late lease, overlap, conflict, tick-zero reuse) is refused, 100 of 100. |
| GATE-CHRON-05 | Known answer | Fork classification: the five classes of §27.4 are assigned correctly on 100 planted change sets; the warm-start graft is refused 100 of 100; the empty intervention equals replay on 1,000 worlds. |
| GATE-CHRON-06 | Known answer | First divergence: the two-tick case reports the earlier tick 100 of 100; a tolerance case with a loose bound returns unresolved and then the right interval after refinement; a trace with missing samples returns an interval and a gap. |
| GATE-CHRON-07 | Known answer | Sampling and histograms: INV-CHRON-05 and -06 hold over 100 permutations, shard splits and co-tenancies on batch-cpu, CUDA and Metal; weighted estimates from the traced stratum recover a planted population mean inside the exact interval. |
| GATE-CHRON-08 | Known answer | The created-energy audit flags every planted trampolining and cone-excess exploit and no honest fixture. Each failure class's monitor fires on its planted fixture, and a numerical fault is never counted as a physical failure or dropped from a denominator. |
| GATE-CHRON-09 | Known answer, Design comparison | Tier correction: exact equality with the plain mean at n = N; type-I error at most α over 10⁴ null comparisons under optional stopping; interval coverage on the battery at least nominal minus 0.03; a planted between-tier reversal is never established; referee episodes per established verdict 16 / 64 / 256 at the 50th / 95th / 99th percentile. |
| GATE-CHRON-10 | Known answer | The artifact graph: every row of registries/gates.toml with a PASS resolves; a dangling identifier fails the build; evidence.trace on 100 random claims returns closures whose hashes recompute. |
| GATE-CHRON-11 | Known answer | Simulation testing: full await-point coverage of the publish and submit paths; every failure minimized to a regression that replays in under one second; dual-run agreement on 100 small jobs. |
| GATE-CHRON-12 | Known answer | Retention: 10⁴ random collection cycles remove no pinned object; every removal has a tombstone; a citation of a collected object is refused with its reason. |
| GATE-CHRON-13 | Performance | T0 and T1 on every world cost at most 3% of step time, and T2 on a 1% sample at most 2% more, on the reference quadruped workload with the disclosure block of §36. |
| Kill gate | Trigger | Fallback |
|---|---|---|
| ✖ KILL-DR | ρ_ep below 0.7 on 200 paired addresses in every stratum tested, or GATE-CHRON-09 coverage fails after one repair cycle | Promotion reports the label only, from referee episodes alone; the ledger keeps recording ρ_ep |
Milestones (§43): GATE-CHRON-03 on the referee, GATE-CHRON-04 on the CPU, GATE-CHRON-10 and the CPU part of GATE-CHRON-11 at M1; GATE-CHRON-01, -02, -05 to -08, -12, -13, the single-precision row of -03 and the device rows of -04 and -11 at M2; GATE-CHRON-09 and KILL-DR at M3.
29.21 Open questions
- OPEN-CHRON-1. Column compression without a third-party codec. Owner: Chronicle lead. Blocks nothing before M2. Default: uncompressed quantized columns.
- OPEN-CHRON-2. The chunk length L and the depth of the device ring. Owner: Chronicle lead. Blocks GATE-CHRON-04. Default: 256 control ticks per chunk and 2 s of ring.
- OPEN-CHRON-3. Whether the identifier types are imported from
franken_kernelunder the suite's single-version rule for asupersync, or defined locally with the same layout. Owner: suite lead. Blocks GATE-CHRON-10. Default: defined locally infrob-core. - OPEN-CHRON-4. Retention windows for failure captures and the default store budget on each machine. Owner: owner of the machines. Blocks GATE-CHRON-12. Default: 30 days and 64 GB.
- OPEN-CHRON-5. Lease granularity: one generation per run, or one per shard with a versioned world-to-shard map. Owner: Tether lead. Blocks GATE-CHRON-04 on two devices. Default: one per run.
29.22 The solver's kinetic-energy correction is not heat
What it is. S A separate ledger line for the energy that an impulse-level contact step exchanges with the velocity predictor, and a rule that only constitutive dissipation feeds a thermal or a wear state.
Counterexample. A 1 kg block rests on a frictionless stationary support under g = 8 m/s². A step that applies forces, then contact, then drift gives the block a free velocity g·h and removes it with the support impulse. The kinetic energy removed per step is ½·m·(g·h)², which is ½·m·g²·h per second of simulated time: 1 J at 32 Hz and 0.5 J at 64 Hz. The block has zero displacement and the support produces no heat. The quantity is first order in h and vanishes under refinement. Booked as contact dissipation, it warms the tyres of a parked robot at a rate set by the step size.
Mechanism. DESIGN:
- Stage 9 (
K-ledger-step) accumulates two quantities separately for each contact row and each joint-limit row. The algorithmic exchange is the energy that the constraint impulse removes from, or returns to, the unconstrained predictor. The constitutive dissipation is computed from a law with a dissipation function: sliding friction as the integral of f_t·v_slip at the solved slip velocity; normal damping of the compliant law as the integral of c·ḋ²; restitution loss ½·m_eff·(1 − e²)·v_n² at a located impact; joint damping; stiction and backlash rows by their own laws (§15.6). - The ledger identity of §29.9 gains the line
algorithmic exchangebesidenumerical residual. On a resting body the algorithmic work of gravity and the algorithmic removal by the support cancel exactly in every step, and the identity is checked with both shown. - Invariant: a thermal state (winding, housing, tyre, film) and a wear state (§31.14) take input only from
constitutive dissipation lines and from electrical loss.
frob-chroniclerejects a channel binding that routes algorithmic exchange or numerical residual into a state (refusal: non-physical energy bound to a physical state). telemetry.energyprints the two lines separately on every tier. On the compliant tiers the algorithmic exchange of a resting contact is zero, because the contact force is a function of state. The line matters on the referee's impulse step and on the hard-contact batch law.
Owner: frob-contact and frob-dyn (the two quantities); frob-chronicle (ledger and invariant).
Known answers. Resting block: algorithmic exchange 1 J/s at 32 Hz and 0.5 J/s at 64 Hz; constitutive dissipation 0; heat 0. The same block sliding at 1 m/s on μ = 0.5: 4 W of friction heat at both rates. A plastic drop arriving at 2 m/s: 2 J of impact dissipation, booked once at the located event.
| GATE-CHRON-14 | Known answer. The three fixtures at 32, 64 and 2,000 Hz on referee and strict: constitutive dissipation of the resting block is exactly 0; sliding heat is within 0.1% of 4 W; impact loss is within 10⁻⁹ J of 2 J; a mutant that feeds algorithmic exchange into the film temperature is caught, because its temperature rise differs between 32 and 64 Hz by a factor of 2. M1 on the referee; M2 on the batch tiers. |