The rulebookVersion 2.9.0, in force

The rules of the economy

107 rules in 20 sections: each rule, and what it means in practice. Press on a rule for its explanation.

The specification, version 2.9.0, commit d4e10c667, copied byte for byte. Set to As written, + also shows the rule in the spec's own words. The 2.9.0 spec on GitHub ↗
Show
Changes the explanations: what opens when you press + on a rule. Headlines and pictures stay the same. As written also shows each rule in the spec's own words. Your choice stays as you move between pages.
Show

§1 Purpose and measurement

A worker's aim is to meet requests economically. People outside pay in and supply the judgment everything is checked against.

1.1

A worker's purpose

The rule

A worker's aim is to meet requests economically over time. Money is only a tool.

In practice

  • Yes: Meeting requests economically over time
  • No: Piling up wealth, taking on as many tasks as possible, or looking busy

A worker is there to meet requests, and to do it economically over time. Money helps it do that, but money is never the goal. Getting rich, doing as many tasks as possible, or looking busy is not the goal either.

The worker's purpose is to fulfil requests economically over time. Currency is an instrument toward that, never the purpose. Accumulating wealth, maximising the number of tasks and maximising visible activity are named as not the purpose.

The rule as written · spec l.101

Rule. The actor's purpose is to fulfill requests economically over time. Currency is an instrument toward that, never the purpose. Accumulating wealth, maximizing task count, and maximizing visible activity are not the purpose.

These lines in the spec on GitHub ↗

Spec 2.9.0, line 101.

1.2

What gets judged

The rule

The economy judges only whether a request was met as asked, with the least work needed.

In practice

  • Yes: Meeting the request as it was made and understood
  • No: Cheap work that misses the request
  • No: Treating extra work as automatically better

The economy asks one question: was the request met, as it was made and understood, in its context? It does not try to measure how much the result improved the requester's life. The aim is to meet the request with the least work and resources needed. Doing it cheaply but failing is not economical, and extra work is not automatically better.

The boundary of assessment is fulfilment of the request in its applicable context. The economy does not price how much an outcome improved the requester's life; it decides whether the request, as made and understood, was met. Efficiency points one way: fulfil with the least necessary work and resource spending. Cheap nonfulfilment is not economical fulfilment, and extra work is not automatically better.

The rule as written · spec l.103

Rule. The boundary of assessment is fulfillment of the request in its applicable context. The economy does not price how much an outcome improved the requester's life; it decides whether the request, as made and understood, was met. The efficiency direction is: fulfill with the least necessary work and resource expenditure. Cheap nonfulfillment is not economical fulfillment; extra work is not automatically better.

These lines in the spec on GitHub ↗

Spec 2.9.0, line 103.

1.3

The economy's outside

The rule

Root requesters pay in from outside; human judgments are the standard everything inside is checked against.

Root requester: a person or its delegate pays in the economy
human explicit judgments everything inside is checked against them

In practice

  • No: An internal check replacing a person's judgment

The economy has an outside. The requesters at the root, people or systems spending a person's budget, bring the money in. People also bring judgment that is not one model's opinion of another model. Everything inside the economy is checked against people's explicit judgments and never replaces them.

Root requesters, humans or delegates holding a human's budget, supply value because they pay in. Humans at the root also supply judgment that is not a model's opinion of another model. A delegate's acceptance or dispute is a model's judgment, and it is recorded at its own grade (§15.4). Everything internal is calibrated against explicit human judgments and never replaces them.

The rule as written · spec l.105

Rule. The economy has an outside. Root requesters — humans, or delegates holding a human's budget — supply value, because they pay in. Humans at the root also supply judgment that is not a model's opinion of another model; a delegate's acceptance or dispute is a model's judgment and is recorded at its own grade (§15.4). Everything internal is calibrated against explicit human judgments and never replaces them.

These lines in the spec on GitHub ↗

Spec 2.9.0, line 105.

1.4

Two stated assumptions

The rule

The orchestrator's own inspectors mean no harm, and no person is expected to step in.

In practice

  • Yes: The orchestrator's own inspectors and deliverers mean no harm
  • No: Relying on a person to complain, override or even look
  • Yes: The orchestrator knows the true answer to the planted cases it writes

Two things are assumed openly. The orchestrator's own inspectors and deliverers are its own servers and mean no harm, though how good they are at the work is a set number. And no person is expected to step in: every rule works even if nobody complains, overrides or looks. So the orchestrator has to know some truth itself, the truth of the planted cases it writes.

Since 1.4.0 the spec assumes the orchestrator's own inspectors and deliverers bear no malicious intent: they are ELEF's own servers, honest by construction, and their competence is a declared parameter, not an assumption. Since 1.2.0 it assumes humans do not intervene. The loop cannot control whether or when a human complains, overrides or even looks, so every mechanism works with no human action at all; human attention, where it comes, is a bonus the loop accepts and never relies on.

Every other signal the loop produces (verdicts, overturns, dispute outcomes, reliability) comes from the inspectors themselves. So the orchestrator must own some truth itself: the truth of the planted cases it writes (§7.6).

The rule as written · spec l.107–109

Design assumption (1.4.0), stated. Troops bear no malicious intent — they are ELEF's own servers, honest by construction; their competence is a declared parameter (εT\varepsilon_T), not an assumption.

Design assumption (1.2.0), stated. Humans do not intervene. The loop cannot control whether or when a human complains, overrides, or even looks. Every mechanism in this baseline works with no human action at all; human attention, where it comes, is a bonus the loop accepts and never relies on. Since every signal the loop otherwise produces — verdicts, overturns, dispute outcomes, reliability — is produced by the panel, the orchestrator must own some truth itself: the truth of the work it writes (§7.6).

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 107–109.

1.5

Four separate concerns

The rule

Purpose, assessment, accounting and learning are kept apart and never merged into one score.

PurposeAssessmentAccountingLearning

In practice

  • No: One score for all four

Four questions are kept apart. Is the work economical? Was this request met? How did the money move? What has experience taught? They are never rolled into a single score.

The four concerns are purpose (economical fulfilment), assessment (was this request fulfilled), accounting (prices, fees, locks and transfers) and learning (using experience). They stay distinct and are never one score.

The rule as written · spec l.111

Four concerns stay distinct and are never one score: purpose (economical fulfillment), assessment (was this request fulfilled), accounting (prices, fees, locks, transfers), learning (using experience).

These lines in the spec on GitHub ↗

Spec 2.9.0, line 111.

§2 Participants, time and order

Requesters pay, workers work and inspect in turn, the orchestrator picks winners, and each tick runs in order.

2.1

Requesters

The rule

Requesters post and pay for jobs, from a wallet the orchestrator fills on a schedule.

orchestrator issuance, on a schedule requester posts and pays request

In practice

  • Yes: A delegate posts, pays, accepts and disputes as a person does
  • No: A delegate holds no power to rule

Requesters post jobs and pay for them. At the root is a person, or a system spending a person's budget; a worker that needs help with its own job can be a requester too. Each requester has a wallet that the orchestrator tops up on a schedule, and it sets its own top price, as far as its wallet can cover. Requesters can arrive, and can leave once their jobs are done, taking their wallets with them.

A root requester is a human or a delegate, a system acting on a human's delegated budget. A derived requester is a worker that needs work from another worker while executing a commitment of its own (§9). A delegate posts, pays, accepts and disputes exactly as a human requester does, and holds no ruling authority.

Since 2.0.0 a requester is an agent with a wallet and a declared budget policy. Its credits come from issuance, which the orchestrator credits to its wallet on a declared schedule, and from its own earnings if it also works. It posts at a ceiling of its own choosing, bounded by what its wallet can lock all-in. Requesters may arrive with a wallet and leave once their requests are served out, and their wallets leave the money supply with them. The sponsor and the bottomless human of the 1.x drivers remain as the fixed-price control.

The rule as written · spec l.117–121

2.1 Participants

Requesters post requests and pay for them. A root requester is a human, or a delegate — a system acting on a human's delegated budget. A derived requester is an actor that needs work from another actor while executing a commitment of its own (§9). A delegate posts, pays, accepts and disputes exactly as a human requester does; it holds no ruling authority (§15).

Since 2.0.0 a requester is an agent with a wallet and a declared budget policy. Its credits come from issuance — the orchestrator credits each requester's wallet on a declared schedule — and from its own earnings if it is also an actor; it posts at a ceiling of its own choosing, bounded by what its wallet can lock all-in (§4.1); requesters may arrive with a wallet and leave once their requests are served out, their wallets leaving the money supply with them (§4.4, Appendix M). The sponsor and the bottomless human of the 1.x drivers are the fixed-price control.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 117–121.

2.2

Workers come and go

The rule

Workers do jobs and inspect in turn. Newcomers start on a loan, doing first inspections only.

bank arrival loan newcomer
  1. arrive with a fresh name and no record
  2. first inspections only, no jobs
  3. record passes on bad planted cases
  4. member

In practice

  • No: An archived name used again

Workers offer and do jobs, and take turns inspecting others' work; there is no permanent class of inspectors. Since 2.3.0 workers can arrive and leave. A newcomer gets a fresh name, no record, and credits lent by the bank, and it may only do first inspections until its record on planted cases is good enough. Each worker's cost of doing work is its own and private, and shows only in its bids.

Since 2.3.0 an arrival is admitted by the orchestrator with a fresh identity, no record and a float the bank lends: 50 credits by default, adjusted to the price level at the arrival tick. Since 2.7.0 this is the name's arrival loan, repaid first from every inflow of income. It enters as a probationer: initial inspections only, audit odds fixed at 1, no award of any kind. It becomes a member when its trailing record passes the duty threshold with a minimum number of bad planted cases judged. A worker may depart when no obligation to or from it is live, and an unrepaid loan does not count as one. It repays the loan from its unlocked wallet first and takes the rest out of the money supply; any shortfall is read as the bank's default on arrivals. Its identity is archived and never reused.

Competence is the workers' own: an effort cost per unit of work, drawn once per worker from a wide spread in the drivers, private and revealed through bids. It is a reservation price, not a rule's parameter and not a quality. The decision to enter is a declared strategy made only on what the public view offers an outsider: the price level, the average awarded price, the number of members and of free members, posts a tick, the orchestrator's share, how long last period's admissions took to become members, and the on-time share. Nothing in that view is per worker.

The rule as written · spec l.123

Actors offer and execute work, and serve as reviewers in rotation. There is no permanent reviewer class. Since 2.3.0 actors arrive and depart (§11.2, §16): an arrival is admitted by the orchestrator with a fresh identity, no record and a float the bank lends (arrival, F0=50F_0=50 at P0P_0 indexed at the arrival tick — since 2.7.0 the name's arrival loan, repaid first from every inflow of income to the name, §4) and enters as a probationer — initial reviews only, odds pinned at 1, no award of any kind — admitted to membership when its trailing record passes θduty\theta_{\text{duty}} with nmin⁡n_{\min} bad plants adjudicated; a departure is admissible when no obligation to or from the actor is live — an unrepaid loan is none — repays the arrival loan from the unlocked wallet first (2.7.0) and takes the remainder out of MM as departure, the shortfall the bank's default on arrivals, read; its identity archived and never reused. Competence is the actors' own (§4.6, §5.1): an effort cost per unit of work, drawn once per actor in the drivers from a wide spread, private, revealed through bids — a reservation price, not a rule's parameter and not a quality. The entry decision is a declared strategy made on what the public view offers an outsider: PtP_t, Bˉ\bar B, the members' count and the free members, posts a tick, the state's share, the time to membership of the last period's admissions, the on-time share — nothing per actor.

These lines in the spec on GitHub ↗

Spec 2.9.0, line 123.

2.3

The orchestrator

The rule

The orchestrator picks winners, holds money in escrow, writes planted cases and covers what nobody takes.

JudgeEscrowAuthor of planted casesEmployer of last resort

In practice

  • No: Not a bank, not a first inspector, not an auditor of its own work

The orchestrator keeps the list of open jobs, chooses among the offers, hands out inspections and audits, and holds the money in escrow. It writes planted cases whose right answer it already knows, and it sets how much checking effort is asked for. When nobody in the market takes an inspection seat or a job, it sends one of its own inspectors or deliverers. It is not a bank, does not do first inspections, and does not audit its own work.

The orchestrator holds the request pool, selects among offers, assigns inspections and audits, holds funds in escrow, services the operating account, and issues a ruling when two appeal inspectors split. Since 1.2.0 it introduces planted cases whose fulfilment it knows by construction, reads the clock that work provides and sets verification effort by it. Since 1.3.0 it holds the duty fund, the dial's raised tax, and pays it out to the inspectors who supply the effort. Since 1.4.0 it has its own inspectors and deliverers, summoned for one seat the market left unfilled or one award the market did not take, released at completion and paid from the fund.

It is a judge, an escrow, the author of the planted cases and the employer of last resort. It is not a bank, not a first-line inspector, and not an auditor of its own work.

The rule as written · spec l.125

The orchestrator holds the request pool, selects among offers, assigns reviews and audits, holds funds in escrow, services the operating account, issues a ruling when two appeal reviewers split, and — since 1.2.0 — introduces planted work whose fulfillment it knows by construction (§7.6), reads the clock that work provides and sets verification effort by it (§12.2), and — since 1.3.0 — holds the duty fund, the dial's raised tax, which it pays out to the reviewers who supply the effort (§4.1, §12.2). Since 1.4.0 it also has troops: reviewers and deliverers of its own, summoned for one seat the market left unfilled or one award the market did not take, released at completion, paid from the fund (§7.7, §12.3). It is a judge, an escrow, the author of the probes and the employer of last resort — not a bank, not a first-line reviewer, and not an auditor of its own work.

These lines in the spec on GitHub ↗

Spec 2.9.0, line 125.

2.4

One assignment at a time

The rule

A worker holds one thing at a time: one job or one open inspection.

  1. awarded: committed
  2. revising or adding evidence: still committed
  3. approved, or appeal taken up: free for other work

In practice

  • Yes: One job, or one open inspection
  • No: A job and an inspection together, or two inspections

Time moves in steps called ticks. A worker can hold only one thing at a time: one job or one inspection, never both and never two inspections. It is tied to a job from the award until its work is approved or its appeal is taken up, and if it chooses to revise or add evidence it stays tied until that work is checked. After that it may take new work, though its guarantee stays locked.

Time is discrete, counted in ticks, and an assignment occupies ticks. A worker holds at most one active assignment: an ordinary commitment or an open inspection, never both and never two inspections. It is committed from award, and stays committed through any revision or supply of evidence it chooses and the assessment that follows. Its capacity is released, the case becoming pending with the guarantee still locked, when its submission is approved or its appeal admitted. Terminal closure (accepting a rejection, a missed deadline, a final rejection) releases the commitment outright. A pending worker may take ordinary work or enter inspection duty.

An inspector who answers "partly done" or "can't tell" stays attached to the case until the worker acts. One who answers "done" or "not done" is released at once, though its bond and liability remain.

The rule as written · spec l.127–131

2.2 Time and the one-assignment rule

Time is discrete, t∈N0t\in\mathbb N_0. An assignment occupies ticks.

Rule. An actor holds at most one active assignment: an ordinary commitment, or an open review — never both and never two reviews. An actor is committed from award, and stays committed through any revision or supply of evidence it chooses and the assessment that follows. Its execution capacity is released — the case becomes pending, guarantee still locked — when its submission is approved or when its appeal is admitted; terminal closure (accepting a rejection, a missed deadline, final N\mathsf N) releases the commitment outright. Choosing to revise or to supply evidence is a response that keeps the actor committed: it may not take other ordinary work or enter verification duty until that work is assessed. A pending actor may take ordinary work or enter verification duty. A review that returns P\mathsf P or ⊥\bot keeps its reviewer attached to the case until the actor acts; a review that returns F\mathsf F or N\mathsf N releases the reviewer at once, while its bond and liability persist.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 127–131.

2.5

All or nothing

The rule

An action either happens fully under its rules or changes nothing at all.

In practice

  • Yes: Every check passes first, then the action takes effect in full
  • No: A refused attempt stored as if it had happened

An action either goes through completely or leaves everything as it was. All the checks come first, before anything changes. A refused attempt is never recorded as if it went through.

An action either completes under its rules or changes nothing: no balance, no state, no admissible assessment, no history entry. Every amount is validated as a finite, non-negative number, and every precondition is checked before the first effect. A refused attempt is a refused attempt, never stored as if admitted.

The rule as written · spec l.133–135

2.3 Actions are atomic

Rule. An action either completes under its rules or changes nothing — no balance, no state, no admissible assessment, no history entry. Every amount is validated as a finite, non-negative number; every precondition is checked before the first effect. A refused attempt is a refused attempt; it is never stored as if admitted.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 133–135.

2.6

The order within a tick

The rule

By default each tick runs in order: challenges, deadlines, settling, debts, period business, then assignments.

  1. challenges admitted
  2. deadlines checked
  3. closed cases vest and settle
  4. the operating account pays its debts
  5. dial, prices, rebates, then the orchestrator's own staff
  6. inspections, audits and awards

In practice

  • Yes: An action on its deadline tick is on time

Each tick follows the same order by default. Actions are applied as they happen, and one made on the deadline tick is on time. Then new challenges are taken in, deadlines are checked, finished cases settle, and the orchestrator's account pays what it owes. Once a period the effort dial is read and prices are published; then the orchestrator sends its own inspectors or deliverers where the market left a gap. Last come new inspections, audits and job awards.

By default, at each tick, participant actions are applied as they occur, in record order, and deadlines are inclusive. Then challenges and disputes filed that tick are admitted, so a challenge is admitted before the same tick's vesting check. Deadlines are checked: delivery, response, resubmission, review and nested wait. Cases whose window has closed with nothing open vest, and their surviving inspections, with those of any case that reached a final rejection this tick, settle in one emission batch. The operating account services its claims: since 2.1.0 every inflow to the orchestrator's unlocked balance pays the orchestrator's debt first, and since 2.2.0 a fee inflow then goes to the period's rebate pool.

Once a period the dial is read, the bank publishes the price level (2.1.0), and the period's rebate claims are settled from its pool, pro rata, the rest forgone (2.2.0). Then come rotation handovers, and, after the market has had its chance, the orchestrator's own inspectors and deliverers are summoned for the seats and awards that have waited their windows. Since 2.1.0 these are paid from the orchestrator's balance first and a bank loan after: a seat always, a delivery only while the orchestrator's debt is within its limit. A summons refused for capacity or credit marks the request. Last come assignments and awards: inspections and audits first, nested requests before root requests when the free pool is thin, and the planted cases the rate calls for before the tick's assignments.

The rule as written · spec l.137–149

2.4 The order within a tick

Default. At tick tt:

  1. Participant actions are applied as they occur, in record order, and deadlines are inclusive — an action at the deadline tick is on time.
  2. Challenges and disputes filed at tt are admitted.
  3. Deadlines are checked: delivery, response, resubmission, review, nested wait.
  4. Cases whose window has closed with nothing open vest; their surviving reviews, and the reviews of any case that reached final N\mathsf N this tick, settle in one emission batch.
  5. The operating account services its outstanding claims. (2.1.0) Every inflow to Ω\Omega's unlocked balance is ordered the moment it arrives — the state's debt first; (2.2.0) then a fee inflow accrues to the period's rebate pool, a lock on Ω\Omega, and any other inflow is Ω\Omega's (§10.4); the order is run again at the start of step 5's summons pass and at the tick's end, where I30 checks it.
  6. The dial is read once per period (§12.2) and the bank publishes PtP_t at the same boundary (§4.4, 2.1.0), and the period's rebate claims are settled from the period's pool, pro rata, the rest forgone (§10.4, 2.2.0); then rotation handovers under the reserve it sized (§12.1); then, after the market has had its chance, troops are summoned for the seats and awards that have waited their windows (§12.3) — since 2.1.0 on Ω\Omega's balance first and the bank's loan of the shortfall after, a seat always, a delivery while the state's debt is within the wall; a summons refused for capacity or for credit marks the request (§12.3).
  7. Assignments and awards: reviews and audits first; nested requests before root requests when the free pool is thin; the plants the rate calls for are created before the tick's assignments (§7.6).

A challenge filed at tt is admitted before the same tick's vesting check.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 137–149.

§3 Requests, submissions and verdicts

Each job names its top price and runs a service clock. Workers prove their work; inspectors answer in four ways.

3.1

The service clock

The rule

Each job's clock runs to its first verdict. Past the target, the orchestrator owes a rebate.

The period's fee pool a rebate for each late tick, up to the price requester

In practice

  • Yes: The oldest clock is served first
  • No: A late job dropped

Every job posted at the root runs a clock from posting until its first verdict. If the clock passes its target, the orchestrator owes the requester a rebate for each extra tick, never more than the job's price. Rebates are paid at the end of the period from the fees the orchestrator took in, shared out if there is not enough. The oldest clock is always served first, and a late job is never dropped. The clock stops while the job's top price is below the orchestrator's price.

Since 1.6.0 every root request carries a service clock from its posting to its first verdict (an approval or a rejection; "partly done" or "can't tell" is not a verdict), or to the case's final settlement without one, whichever comes first. Its service target is a set number of ticks. The clock runs only while the request's ceiling is at least the orchestrator's price, since 2.4.0 the higher of the members' average price and the orchestrator's reservation. A request priced below that waits by its requester's choice, so its clock is stopped while it is so priced.

The orchestrator serves the oldest clock first in every pass it runs: awards, waiting initial inspections and the summons for inspection seats. A late request is never dropped, and a person's withdrawal of an unawarded request remains the only withdrawal. For every tick past the target the orchestrator owes the requester a rebate, by default the base service fee, capped at the price. Since 2.2.0 it is recorded as a claim when the clock stops and settled at the period's close from that period's fee pool, pro rata, the rest forgone and read. The rebate is a discount on service rendered, never cash on a request that bought nothing; a request withdrawn before award is owed nothing. Each period the network rating reads the on-time share, mean lateness, rebates paid, liabilities accrued and outstanding, and open late requests.

The rule as written · spec l.155–157

3.1 Requests

Rule (1.6.0) — the service clock. Every root request carries a service clock from its posting to its first verdict (approval or rejection; a P\mathsf P or ⊥\bot response is not a verdict) — or to the case's final settlement without one (§6.1), whichever comes first. Its service target is TsT_s ticks. The clock runs only while the request's ceiling admits the state's price (β≥pT=max⁡(Bˉ,B‾)\beta\ge p_T=\max(\bar B,\underline{B}), §12.3 — one condition since 2.4.0; β≥Bˉ\beta\ge\bar B before it); a request priced below the market is not the state's to answer for, and a request priced below the state's reservation was told the floor and chose to wait under it (2.4.0), so its clock is stopped while it is so priced (since 2.0.0 such a request is flagged below market at posting once a member has been awarded, since 2.4.0 marked below the state's reservation at posting, and the requester may raise its ceiling, §5.1). Priority: the orchestrator serves the oldest clock first in every pass it runs — the award summons, the assignment of waiting initial reviews, the review-seat summons (what the engine's creation-order iteration already does, stated as a rule and checked by I26); drivers award members oldest-first as a matter of conformance. A late request is never dropped; the human's withdrawal of an unawarded request (§9.3) remains the only withdrawal. The rebate: for every tick a request's clock stands past TsT_s the orchestrator owes the requester rsr_s (default ω0B\omega_0 B, the base service fee), capped at the price BB — so the orchestrator's liability is bounded by BB times the open requests — recorded at the stop as a claim (2.2.0; the measure of lateness, rsr_s indexed at the case's first lock when stated — §4.5, a conformance correction of 2.2.0) and settled at the period's close from the period's fee pool, pro rata, the rest forgone and read (§10.4, 2.2.0; under 2.0.0 paid at the stop with Ω\Omega creating if short; under 2.1.0 from Ω\Omega's balance, else as a liability — the stock retired by 2.2.0) — as a payment to the requester against its pay-in: a discount on service rendered, never cash on a request that bought nothing; a request withdrawn before award is owed nothing. A rebate Ω\Omega cannot pay when the clock stops is Ω\Omega's liability to that requester, paid in Ω\Omega's order (§10.4). Readings — the network rating, per period: on-time share, mean lateness, rebates paid, liabilities accrued and outstanding, open late requests.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 155–157.

3.2

What a job carries

The rule

Each job names its requester, its top price, and the original job that pays for it.

A helper's job points back to The root job that funds and judges it

In practice

  • Good outcome: A root requester sponsors a worker's proposal, then it enters the pool

Every job names who asked for it, the most they will pay for delivery, and the original job that ultimately pays for it and judges it. An original job points to itself. A job a worker posts that traces back to no original job is only a proposal, and it enters the pool only when a requester at the root sponsors it.

A request carries a requester, a maximum delivery price, and a provenance pointer to the root request whose fulfilment ultimately funds and judges it. A root request points to itself. A request posted by a worker with no root is a proposal, and it enters the pool only when a root requester sponsors it.

The rule as written · spec l.159

A request qq carries a requester, a maximum delivery price βq\beta_q, and a provenance pointer root⁡(q)\operatorname{root}(q) to the root request whose fulfillment ultimately funds and judges it. A root request points to itself. A request posted by an actor with no root is a proposal and enters the pool only when a root requester sponsors it.

These lines in the spec on GitHub ↗

Spec 2.9.0, line 159.

3.3

Proof comes with the work

The rule

The worker must hand in the proof an inspector needs. Unverifiable work is the worker's failure.

worker result + tests, logs, diffs, references inspector

In practice

  • Bad outcome: The submission can't be checked, then the failure is the worker's, not the inspector's

The worker has to show that its work can be checked. Along with the result it hands in whatever a capable inspector needs, such as tests, logs or references, as the job's criteria require. If the work cannot be checked, that is the worker's failure, not the inspector's.

The worker bears the burden of verifiability. A submission carries the result and whatever a competent inspector needs to assess it: tests, logs, diffs, references, as the request's criteria require. An unverifiable submission is the worker's failure, not the inspector's.

The rule as written · spec l.161–163

3.2 Submissions carry their evidence

Rule. The actor bears the burden of verifiability. A submission carries the result and whatever a competent reviewer needs to assess it — tests, logs, diffs, references, as the request's criteria require. An unverifiable submission is the actor's failure, not the reviewer's.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 161–163.

3.4

The four verdicts

The rule

An inspector answers done, not done, partly done, or can't tell.

DoneNot donePartly doneCan't tell

In practice

  • Yes: Done means met well enough, not the best conceivable

An inspection gives one of four answers. Done means the request's main requirements are met well enough; it does not have to be the best possible work. Not done means nothing meaningful was delivered. Partly done means something useful came in but main requirements are missing, and the worker may revise once. Can't tell means evidence the inspector needed is missing, and the inspector names it.

Fulfilled: the request's material requirements are adequately met, enough and not the best conceivable. Not fulfilled: no meaningful fulfilment of the expressed need. Partially fulfilled: some contribution, but material requirements unmet; the worker may revise once. Cannot assess: the evidence the inspector needed is missing, and the inspector names it.

The rule as written · spec l.165–174

3.3 The four verdicts

A review returns one of:

Verdict Meaning
F\mathsf F fulfilled The request's material requirements are adequately met — enough, not the best conceivable
N\mathsf N not fulfilled No meaningful fulfillment of the expressed need
P\mathsf P partially fulfilled Some contribution; material requirements unmet; the actor may revise once
⊥\bot cannot assess The evidence the reviewer needed is missing; the reviewer names it
These lines in the spec on GitHub ↗

Spec 2.9.0, lines 165–174.

3.5

Partly done and can't tell

The rule

"Partly done" and "can't tell" are allowed only on a submission's first inspection.

In practice

  • Yes: Any of the four answers on the first inspection of an unrevised submission
  • No: Partly done or can't tell on an audit, an appeal, a dispute or a resumed inspection
  • Yes: Can't tell names the missing evidence, and an appeal can uphold or reject it

"Partly done" and "can't tell" send the worker back to act, so they can be used only while it still can: on the first inspection of a submission that has not yet been revised or given more evidence. Every other inspection must answer done or not done. An inspector who says "can't tell" must name the missing evidence, and that claim can be upheld or rejected on appeal.

Partially fulfilled and cannot assess are responses to a submission: they send the worker back to act. They are available only where the worker can still act, on the first inspection of a submission that has not been revised or evidenced. Every other inspection is answered fulfilled or not fulfilled: an audit, an appeal or dispute inspection, and an inspection resumed after a resubmission, whoever holds the position. Cannot assess is a claim, not a shrug: the inspector names the missing evidence, and the claim can be upheld or rejected on appeal (§8.1).

The rule as written · spec l.176–178

Rule. P\mathsf P and ⊥\bot are responses to a submission: they send the actor back to act. They are available only where the actor can still act — on the first review of a submission that has not been revised or evidenced. Every other review is answered F\mathsf F or N\mathsf N: an audit, an appeal or dispute review, and a review resumed after a resubmission, whoever holds the position.

Rule. ⊥\bot is a claim, not a shrug: the reviewer names the missing evidence, and the claim can be upheld or rejected on appeal (§8.1).

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 176–178.

3.6

The basis is kept

The rule

Each inspection records what it judged and why; a later clarification never counts against earlier work.

InspectorRequest versionResult versionCriteriaVerdictReasons

In practice

  • No: An improved result offered on appeal as proof the rejection was wrong

Every inspection records who inspected, which versions of the request and the result it looked at, the criteria used, the verdict and the reasons. If the request is clarified later, that makes a new version, and it does not count against the worker after the fact. On appeal the original submission stays as it was: better work handed in later is a revision, not proof that the rejection was wrong.

An inspection records the inspector, the request and result versions, the criteria used, the verdict and its reasons. A later clarification of a request creates a new version; it does not retroactively convict the worker. On appeal the original submission is fixed: an improved result is a revision, not proof that the rejection was wrong.

The rule as written · spec l.180–182

3.4 The basis is preserved

A review records reviewer, request and result versions, the criteria used, the verdict, and its reasons. A later clarification of a request creates a new version; it does not retroactively convict the actor. On appeal the original submission is fixed: an improved result is a revision, not proof that the rejection was wrong.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 180–182.

§4 Money

Every credit comes from the bank. Requesters pay for a job up front, and new money helps pay the inspectors.

4.1

Paying in

The rule

A requester's credits come from the bank, and it pays for each job up front.

bank regular issuance requester price + deposit + fee escrow

In practice

  • No: The orchestrator never prints money for itself

Each requester receives credits from the bank on a regular schedule. When it posts a job, it sets aside the most it could owe: the price, a deposit that pays for the inspection, and a fee. If it cannot set that much aside, the job is refused.

Since 2.0.0 a root requester's wallet is filled by issuance, credited on a declared schedule, and since 2.1.0 by the bank. Every credit in circulation traces to the bank: issuance, emission, the deposits minted for a planted case, or a loan to the orchestrator against a summons that returns it. The spec says it outright: "The state never prints for itself."

A request locks its all-in maximum when it is posted, and a request the wallet cannot lock is refused whole. At award the requester pays into escrow the delivery price, the verification deposit and a service fee. The fee is 5% of the price by default, scaled up by the effort dial. The orchestrator keeps the base fee, and the dial's surcharge goes to a duty fund that pays the inspectors supplying the extra effort.

The rule as written · spec l.188–198

4.1 Money enters with requests

Rule (2.0.0). A root requester is an agent with a wallet funded by issuance — the bank (2.1.0; the orchestrator under 2.0.0) credits each requester's wallet on a declared schedule, the stream this section's title names (the genesis floats and budgets are issuance too); a derived requester pays from its wallet, which it earned upstream. Every credit in circulation traces to the bank (2.1.0, §10.4): issuance, emission, the pots minted for a plant, or a loan to the state against a summons that returns it. The state never prints for itself. (2.0.0: issuance, emission, or the orchestrator's creation for a payment the rules require — superseded by 2.1.0, Appendix N. 1.0.1–1.7.1: a root requester paid in real value against a backing Rest\mathrm{Res}_t; Appendix B.)

On award of qq at delivery price BB, the requester pays into escrow

pay-inq=B+φqE+φqF+ωq,\text{pay-in}_q = B + \varphi^E_q + \varphi^F_q + \omega_q ,

where BB is held for the actor, φqE+φqF=φq\varphi^E_q+\varphi^F_q=\varphi_q is the verification deposit in its two pots (§4.3), and ωq=ω0 mt B\omega_q=\omega_0\,m_t\,B is the orchestrator's service fee — the economy's security tax, scaled by the effort multiplier mtm_t of §12.2, so the tax rises with the threat. Of it Ω\Omega keeps the base ω0B\omega_0 B; the remainder (mt−1) ω0B(m_t-1)\,\omega_0 B goes to the duty fund (1.3.0 §12.2), which pays the reviewers supplying the raised effort — the uplift fund, and since 1.7.0 nothing else: the troops' wallet is the separate troop account of §12.3, whose surplus is Ω\Omega's (1.7.0–1.7.1; since 2.0.0 the troops' wallet is Ω\Omega itself, §12.3). The unspent part of βq\beta_q never leaves the requester.

Rule (2.0.0) — the pay-in is locked at posting. A root request locks, at posting, the all-in maximum of its pay-in, β+φE+φF+ω(β)\beta+\varphi^E+\varphi^F+\omega(\beta) with ω(β)=ω0mtβ\omega(\beta)=\omega_0 m_t\beta, at the index and the dial of that tick (§4.5); a request the requester cannot lock is refused at posting, whole. The posting is therefore a root's first lock: the case's nominals (D,K,GV,φE,φFD,K,G^V,\varphi^E,\varphi^F) freeze there, and so does the fee rate mtm_t — the case carries that mm, so a dial that rises before the award cannot make the fee exceed the lock. At award, β−B\beta-B and ω0m(β−B)\omega_0 m(\beta-B) are released and the pay-in above is drawn from what the lock returned; at a troop's summons likewise. This is §9.1's model for nested requests, generalised to roots; the award's and the summons's pay-in checks are moot. A requester may raise the ceiling of its own unawarded request, locking the difference at the case's rate (§5.1); withdrawal before award releases the lock. (I29.)

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 188–198.

4.2

Emission

The rule

A shrinking stream of new money pays inspectors, the way a block reward pays miners.

bank emission, halving every 1,000 ticks inspector

In practice

  • No: Emission that no inspection earns is never created

On top of what requesters pay, the bank creates a small stream of new credits for inspectors. The stream halves on a fixed schedule. Credits that no inspection earns in a period are simply never made.

A fixed, decaying schedule subsidises verification the way a block reward subsidises mining: by default 10 credits a tick, halving every 1,000 ticks. It is paid only to inspections that settle in the period, weighted by role. Emission no one claims is not minted, and as emission decays, requesters' deposits take over. Emission adds claims on the economy, not resources. Since 2.0.0 it is not adjusted for prices, and since 2.1.0 it is recorded in the bank's books as part of the cost of truth.

The rule as written · spec l.200–208

4.2 Emission funds verification

Rule. A fixed, decaying emission schedule EtE_t subsidizes verification the way a block reward subsidizes mining. Emission is distributed only to reviews that settle in the period, weighted by role; emission not claimed in a period is not minted — a block reward that is not mined is not banked. As emission decays, requester deposits take over.

Default. Et=E0 2−t/HE_t = E_0\,2^{-t/H} with E0=10E_0=10, H=1000H=1000, one period per tick. Total scheduled emission is E0/(1−2−1/H)≈1443 E0E_0/(1-2^{-1/H})\approx 1443\,E_0.

Consequence. Emission mints claims on the same reserve; it adds no real resources.

(2.0.0) Emission is not indexed: EtE_t is a fixed nominal schedule whose real value falls as prices rise — and which halves on its own inside every run, read apart (§18.1 question 4). (2.1.0) Emission is the bank's, recorded as mint_emission; with the plants' minted pots it is the cost of truth — the verification security budget, one line in the bank's books, read together in real terms (question 4).

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 200–208.

4.3

The deposit's two pots

The rule

The inspection deposit is two pots: one repays the inspector's costs, one pays its fee.

escrow expense pot: costs, up to a cap inspector
escrow whatever is left, at the end requester

In practice

  • Good outcome: The verdict stands, then a fixed fee from the fee pot

The deposit for checking is split in two. One part pays back what an inspector spent, up to a limit. The other pays a fixed fee to each inspector whose verdict stands. Whatever is left goes back to the requester.

The verification deposit is an expense allowance and a fee pot, and money in one is never used for the other's purpose, with a single exception when a case closes. Each inspection's cost is reimbursed up to a cap, 5 credits by default. An overturned or withdrawn inspection keeps its reimbursement, because the bond was the penalty, not the cost. Every inspection that stands earns a fixed fee by role: by default 2 for an ordinary inspection and 3 for an appeal or an audit. The fee does not depend on what anyone spent.

When the allowance runs out, the orchestrator's operating account advances the cost and is repaid later from what remains. Since 2.3.0 every case, including a helper's subcontract, carries its own two pots. Only when a case and everything under it has settled does the rest return to the requester.

The rule as written · spec l.210–236

4.3 The verification deposit: two pots, and the single payout rule

Rule. The verification deposit of a root request is two named amounts, both paid in by the root requester at award (since 2.0.0 from the lock its posting placed, §4.1):

φq=φqE+φqF,\varphi_q = \varphi^E_q + \varphi^F_q ,

the expense allowance φE\varphi^E and the fee pot φF\varphi^F. Since 2.3.0 every case, root or nested, carries its own two pots (§9.1, I36): a nested case's are posted by its requester, the parent, at the nested posting index, and its reviews draw on them; the root's pots serve the root's reviews alone. (1.1.0–2.2.0: nested cases carried φE=φF=0\varphi^E=\varphi^F=0 and drew on the root's pots — a root requester paid for the inspection of work a parent chose to delegate, and a tree of two or three exhausted the root's allowance; kept as the control, nested_pots root.) Money in one pot is never used for the other's purpose, with one exception, stated in step 3 below: at the tree's closure, fee money that no review in the tree is owed may settle the tree's expense debts.

Reimbursement, at completion. Each review's capped cost, min⁡(credits spent,K)\min(\text{credits spent},K), is paid from the root's allowance; if the allowance is exhausted, advanced from the operating account Ω\Omega; if Ω\Omega cannot cover it, deferred to settlement. A review resumed after a resubmission is the same assignment under one cap. Spending above KK is the reviewer's loss. Overturned and withdrawn reviews keep their reimbursement: the bond was the penalty, the cost was not.

Fees are fixed by role. Every surviving review vv of case qq — completed, not overturned, not withdrawn — is owed a fixed fee fr(v)=wr(v) ff_{r(v)} = w_{r(v)}\,f, where ff is the ordinary-review fee and ww the role weights, plus its emission share ev=wr(v)∑v′∈Batchtwr(v′) Ete_v=\dfrac{w_{r(v)}}{\sum_{v'\in\mathrm{Batch}_t} w_{r(v')}}\,E_t over every review settling at tt across cases (§4.2). The fee does not depend on what the reviewer spent, on what any other reviewer spent, or on how much of the allowance is left.

Settlement — one rule. At the tick a case qq vests or reaches final N\mathsf N, with Surv(q)\mathrm{Surv}(q) its surviving reviews and Owedq=∑v∈Surv(q)fr(v)\mathrm{Owed}_q=\sum_{v\in\mathrm{Surv}(q)} f_{r(v)}:

  1. Expense debts first, for every review of the case — surviving, overturned, or withdrawn with a reimbursable balance: deferred reimbursements are paid, then Ω\Omega's advances are repaid, from what remains of the root's φE\varphi^E only. What it cannot cover: a reviewer reimbursement becomes a named reviewer claim on Ω\Omega, carrying the review it belongs to; an advance Ω\Omega already paid stays an unrecovered advance borne by Ω\Omega — the reviewer has been paid, and no second claim arises from it. The fee pot is not touched at a case's settlement, because other cases in the same tree may still be owed from it.
  2. Fees. Each surviving review receives fr(v)⋅min⁡ ⁣(1, φleftF/Owedq)f_{r(v)}\cdot\min\!\big(1,\ \varphi^F_{\text{left}}/\mathrm{Owed}_q\big) from the root's fee pot — scaled pro rata only when what is left of the pot cannot pay this case's fees in full — and its emission share eve_v, minted and paid in full. An overturned or withdrawn review receives no fee.
  3. At closure — per node since 2.3.0 (the ruling at acceptance, Appendix P): a case closes when it and everything under it have settled; a nested case's fee pot then settles its own expense debts and both pots' remainders refund to the parent, and the root's at the tree's closure as before — what remains of the fee pot settles the node's own expense debts: first this tree's outstanding reviewer claims, paid to the claimant reviewers directly, each claim retired from Ω\Omega's queue as it is paid; then this tree's unrecovered advances, repaid to Ω\Omega. Only then does whatever remains of φE\varphi^E and φF\varphi^F return to the root requester as unused. A requester's deposit services its own tree's verification before anyone else's: it is not an inflow to Ω\Omega and does not wait in Ω\Omega's first-in-first-out line, which governs Ω\Omega's own money (service fees, court fees) alone. This is the one movement of fee money toward expenses, and it uses only money no review in the tree is owed.

With no surviving review, step 2 pays nothing. The rounding residue of minted emission goes to Ω\Omega; deposit never does.

Consequence — the refund waits for the tree. The expenses and fixed fees of a nested case's reviews draw on the root's pots at the nested case's own settlement, exactly as the root's reviews do at the root's; the nested reviews settle first and draw first, so a root with delegated children may see its own reviews' fees scaled. The root requester's unused deposit therefore returns when the tree is closed, not at the root's vesting alone. A tree cannot stay open long past its root: every nested case has reached its milestone before the root could submit, and nested vesting is independent of the parent's (§9). Two consequences are rule-level: a nested settlement draws on a root's pots after the root has vested, and the closure moves the root's money after its vesting — so invariant I10 admits exactly those two movements after vesting and no others; and a root whose pots are still open remains reachable until closure (in record mode, it is not paged out). Whether the pots should grow with the tree is part of §18.1 question 3.

Ω\Omega is a revolving float. It receives service fees and court fees, advances expenses when an allowance is exhausted, and is repaid only as the settlement allows — from the allowance's remainder at each settlement, and from the fee pot's remainder at tree closure. An advance those cannot repay is Ω\Omega's own loss, funded by the service fee ω\omega; Ω\Omega is thereby the pooled expense fund of the economy, and ω\omega is the premium every request pays toward expense overflow in any tree. Ω\Omega pays its outstanding reviewer claims first in, first out, partially if it must, on every inflow. Each claim is bounded by KK; the aggregate of claims and unrecovered advances is monitored, not capped (§18).

Default. K=5K=5. f=2f=2 per unit of role weight: ordinary 2, appeal 3, audit 3. φE=2K=10\varphi^E=2K=10 at root. φF=f (wordinary+waudit)=5\varphi^F=f\,(w_{\text{ordinary}}+w_{\text{audit}})=5 at root — sized for the common full case, one review and one audit; nested 0/00/0. ωq=0.05 B\omega_q=0.05\,B. Role weights ww: ordinary 1, appeal 1.5, audit 1.5. A challenged case has three surviving reviews at most (one initial, two challenge) or two challenge reviews after an overturn; with φF=5\varphi^F=5 two challenge fees (6) are scaled to 2.5 each. This is deliberate: the pot is sized for the common case, the shortfall is small, and challenge reviews also carry the 1.5 emission weight. Sizing φF\varphi^F for the worst case (f(1+2⋅1.5)=8f(1+2\cdot1.5)=8) is a default the sweep may choose. Default under consideration: K=3K=3, φE=6\varphi^E=6, φF=5\varphi^F=5 — total deposit 11, one credit above 1.0.1's; moving KK is a default change, not a rule change.

Consequence — reviewer income from deposits falls, and the fee level is the lever. Under 1.0.1 an uncontested single review took the whole deposit remainder, about 10 credits; under 1.1.0 it takes f=2f=2 plus emission, and the requester is refunded about 8. In the common case the deposit flow to reviewers drops by roughly three quarters, the requester's net deposit cost falls from 10 to between 4 and 7 (fee 2 plus the reviewer's actual expense of 2–5), and emission carries a larger share of reviewer income than 1.0.1 intended ("deposits take over as emission fades" no longer holds at f=2f=2). Whether reviewers can still fund the bond GV=5G^V=5 and their care from unlocked credit is a solvency question for §18.1 questions 3 and 6. ff is a default; the rerun of question 1 carries f∈{2,4}f\in\{2,4\}.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 210–236.

4.4

What a credit is worth

The rule

A credit is worth the work it buys. Nothing backs it.

bank issuance, emission, loans wallet forfeits, spent effort, repayments burn

In practice

  • Yes: The price level is the average awarded price, published once a period
  • No: No reserve stands behind a credit

Credits are not backed by anything. Their value is simply how much work they buy. The bank publishes an average price once a period, and that is how the value of a credit is read.

The price level is the mean of awarded prices. Since 2.1.0 the bank publishes it at each period boundary, and it does not move within a period. It starts at 20, and a credit's value is that base price over the current one. All money comes from the bank: issuance, emission, the deposits minted for planted cases, loans to the orchestrator, and since 2.7.0 a newcomer's arrival loan. Money leaves through forfeited bonds and guarantees, the effort and care spent on work, loan repayments, and the wallets of those who depart.

There is no backing and no halt state. Under 1.x a credit was backed by a reserve of real value, which never moved in the runs; 2.0.0 retired it.

The rule as written · spec l.238–246

4.4 The credit: worth the work it buys — sources, sinks, and the price level (2.0.0)

Rule — the price level (amended 2.1.0: published once a period). The price level PtP_t is the mean of awarded prices — members' and troops' — published by the bank at each period boundary for the period just closed, carried if it had no awards; P0=20P_0=20, the former fixed price, before the first boundary, so that every 1.x figure is at Pt/P0=1P_t/P_0=1 and the first period is at base by construction. Within a period the index does not move (I31): a case's amounts cannot drift under a reviewer's feet. Bˉ\bar B — the state's price and the below-market flag's reference — stays on §12.3's live window: the state is a price-taker and takes the current price. (2.0.0: PtP_t on Bˉ\bar B's window, moving at every award — Appendix M.) The credit's value is P0/PtP_0/P_t in tasks — a reading, kept under the 1.x name vtv_t; real wealth is W⋅P0/PtW\cdot P_0/P_t, and every §18 reading is stated in it from 2.0.0 on.

Rule — sources and sinks, no backing. The money supply MtM_t is the sum of every wallet and lock. Sources (2.1.0: all the bank's): issuance (§4.1, the genesis floats included); emission (§4.2); a plant's minted pots (mint_plant, §7.6); the bank's loan to the state against a summons (§10.4); the bank's arrival loan to a name (arrival, 2.3.0 — a grant until 2.6.1, a loan since 2.7.0); the declared deficit shock of a run (mint_scenario). Sinks: bonds and guarantees forfeited and burned; resource spend — an actor's effort, a reviewer's care, a troop's cost — burned, with no outside leg; a loan's or the debt's repayment (§10.4); a name's arrival loan repaid from its income or recovered at its departure (arrival_repayment, 2.7.0); what a closed plant's wallets held, destroyed (retire_plant); departure — a requester that leaves takes its unspent wallet out of MtM_t (Appendix M); an actor that leaves takes its unlocked wallet net of the loan recovered (2.3.0, 2.7.0). (2.0.0's creation and retirement are retired as kinds — a loan is creation tied to a summons and repaid by it, a repayment is retirement tied to a case.) There is no backing: the 1.x quantity Rest\mathrm{Res}_t is retired (held at 0 as a reading), vt=Rest/Mtv_t=\mathrm{Res}_t/M_t with it, and the value-neutral purchase of 1.x is a plain burn. Conservation (I1) holds over the kinds.

Consequence. Whether a credit is worth more or less is the loop's own question: more money against the same work raises PtP_t; a burn lowers it; nothing outside the loop is appealed to, and there is no halt state. One caution the text owns: without delegation in the runs (2.1.0) members have nothing to buy, so money flows one way — from the mint through customers to members' hoards and the burns — and inflation shows in prices only when capacity binds (§12.3); in a slack market it shows as hoards. That is the textbook output gap, and it is why NTN_T has a finite default.

(1.0.1–1.7.1 — superseded, Appendix B: the credit was backed by a reserve of real value paid in by root requesters, vt=Rest/Mtv_t=\mathrm{Res}_t/M_t; a resource purchase burned cr/vtc_r/v_t credits and paid crc_r from the reserve, value-neutral; emission lowered vtv_t, burns raised it; Rest=0\mathrm{Res}_t=0 was the halt state. In the drivers the backing stood at 10710^7 against a market in the thousands and vtv_t never moved — the credit was a score.)

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 238–246.

4.5

A case is priced once

The rule

A case's amounts are fixed at the price level of the moment its money is first locked.

request first lock: amounts fixed the case's whole life

In practice

  • Yes: Fees, bonds, deposits and caps move with prices, once
  • No: Effort costs, emission and balances are not adjusted

When a job's money is first set aside, all its amounts are fixed at that moment's prices, and they stay the same for the job's whole life. So prices that change later cannot change the deal.

Every nominal amount attached to a case is adjusted once, by the price level at the case's first lock, and frozen for the case's life. That covers the court fee, the reimbursement cap, every inspector's bond, the deposit's pots and the fee. For a root case the first lock is its posting, since 2.0.0. The workers' effort costs, emission and balances already held are not adjusted, and inflation reaches those. The worker's guarantee is fixed at award.

The rule as written · spec l.248–250

4.5 Denomination: a case is priced at its first lock

Rule. Every nominal amount attached to a case — the court fee DD, the reimbursement cap KK, the reviewer bond GVG^V, the deposit φ\varphi, and the bond of every review ever assigned to it — is indexed once, by Pt/P0P_t/P_0 (2.0.0; since 2.1.0 PtP_t as the bank published it at the last period boundary; v0/vtv_0/v_t before 2.0.0) at the case's first lock, and frozen for the case's life. A root case's first lock is its posting (2.0.0, the posting lock of §4.1; its award under 1.x); a nested case's is its posting. The fee rate mtm_t freezes with the nominals (§4.1). What is indexed: the fee ff, the bond GVG^V, the court fee DD, the pots φE,φF\varphi^E,\varphi^F, the cap KK, the rebate rsr_s (a stated rsr_s frozen at the case's first lock — the engine indexed only the default ω0B\omega_0 B until 2.2.0's conformance correction, no run affected), the troops' review cost cTc_T, the plant pots. What is not: the agents' effort costs (§4.6), emission (§4.2), and balances held — which is what inflation reaches. The actor's guarantee GG is fixed at award. GV≥DG^V\ge D then holds for every review of the case whatever vtv_t does afterwards.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 248–250.

4.6

Effort costs anchor prices

The rule

Workers' own costs are not adjusted for prices. They are the economy's anchor.

In practice

  • Yes: Only the case's own worker, while it works, may spend on it
  • No: A bid below cost is the worker's own loss

What a job costs a worker to do is the worker's own business, and it stays fixed as prices move. Spending counts toward a job only if the worker doing the job makes it while the job is under way.

A job's execution cost counts the credits its worker burned on resources, what it paid for subcontracts, and kill fees. A purchase counts toward a case only if the buyer is the case's committed worker and the case is executing; any other is refused. Since 2.0.0 a worker's effort cost and an inspector's care cost are their own reservation prices, nominal and not adjusted. They anchor the economy, as labour does.

As a consequence, when work is dear, inspection, paid at an adjusted fee, is well paid against a fixed care cost, and when work is cheap the reverse holds. The spec names this the price level's effect on the relative price of honesty, measured rather than adjusted away.

The rule as written · spec l.252–256

4.6 Execution cost

CiqC_{iq} is measured in credits and includes the credits burned by actor ii's resource purchases on qq, the delivery prices it has paid on completed nested requests under qq, and kill fees it has paid. Rule. A purchase is attributed to a case only if the purchaser is the case's committed actor and the case is executing; any other attributed purchase is refused before it happens. Review costs are likewise recorded in credits burned, so the cap compares like with like.

Rule (2.0.0) — effort costs are nominal, and the anchor. A member's effort cost cDc_D per unit of work — the resource spend of this section, burned at submission — and a careful reviewer's care cost are their own reservation prices: declared in the strategy, nominal, not the engine's to index; they are the economy's anchor, as labour is (a slack market would otherwise deflate without limit — bids at cost, cost following the price). A bid below cost is the member's own loss. An adaptive reservation — a cost that follows PtP_t with a one-period lag, as wages chase prices — is a declared variant and a sweep (§18.1 question 18), so that the spiral it risks is measured, not assumed. The engine's cost operations therefore take credits: a spend burns exactly what it is given. Consequence: when work is dear, inspection (paid at an indexed fee) is well paid against a fixed care cost, and when it is cheap the reverse — a real effect of the price level on the relative price of honesty, named here and measured rather than indexed away.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 252–256.

§5 Offers, selection and the guarantee

Workers bid a price and a time. The orchestrator picks the likeliest success, and only members win jobs.

5.1

The bid

The rule

A worker bids a price and a delivery time, never above the requester's top price.

worker price + delivery time + guarantee request

In practice

  • No: A bid above the requester's top price
  • No: A lower standard for a lower bid

A worker's bid names a price and a delivery time, and the price can be no higher than the requester's top price. The price is for delivery: if the work costs more, the worker bears the difference. A low bid does not lower the standard, and a big guarantee does not prove the work is right. Workers' costs differ and are private, so a cheap newcomer can undercut and stay, while a dear member may earn nothing and leave.

An offer commits to a delivery price, a delivery time in ticks after award, a guarantee and terms, with the price no higher than the requester's maximum. The price is a delivery price, not an execution cap: overruns are the worker's. A low bid does not lower the fulfilment standard, and a high guarantee is not evidence the result is correct. Before posting, the requester is shown its all-in maximum: the price ceiling plus the verification deposit and the service fee.

Since 2.3.0 a bid is made at the worker's own cost and margin, and costs differ across workers. In the drivers each worker's effort cost is drawn once at its creation around a median of 8, kept between 2 and 40, private and revealed only through its bids. The care cost of an inspection is not spread, and competence touches neither a worker's fail rate nor its honesty. With a spread, selection begins (a cheap newcomer undercuts, wins and stays; a dear member watches the price fall below its cost, earns nothing and leaves), and so does trade: a dear worker gains by paying a cheap helper (§9).

The rule as written · spec l.262–270

5.1 The bid

(2.3.0) A bid is made at the actor's own cost and margin, and the costs differ across actors (§2.1, §4.6): in the drivers each actor's cDc_D is drawn once at its creation from a log-normal around the anchor — median 8, σ=0.43\sigma=0.43, clipped to [2,40][2,40]; swept 0.2 / 0.43 / 0.8 — private to the actor, revealed only through its bids; the care cost of a review is not spread; competence touches neither an actor's fail rate nor its honesty. With a spread, two things the rules have always allowed begin: selection — a cheap arrival undercuts the ratchet, wins, stays; a dear member watches the price fall below its cost, earns nothing, leaves — and trade — a dear parent gains by paying a cheap child (§9).

An actor's offer commits to a price and a time:

biq=(Biq, τiq, Giq, terms),Biq≤βq,b_{iq}=(B_{iq},\ \tau_{iq},\ G_{iq},\ \text{terms}),\qquad B_{iq}\le\beta_q ,

where τiq\tau_{iq} is the delivery time in ticks after award. BB is a delivery price, not an execution cap: overruns are the actor's. A low bid does not lower the fulfillment standard; a high guarantee is not evidence the result is correct. βq\beta_q is the requester's maximum delivery price; the requester is shown the all-in maximum βq+φq+ω(βq)\beta_q+\varphi_q+\omega(\beta_q) before posting.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 262–270.

5.2

Top price and market flags

The rule

The requester picks its top price; a price below the market is flagged and waits.

requester sets its top price request a member bids under it worker

In practice

  • Bad outcome: Top price below the market price, then flagged; waits for a lower bid or a raise
  • No: The orchestrator delivering a job priced below its floor (8 by default)

The requester chooses its top price, as far as its wallet can cover, and each worker chooses its own bid. If the top price is below the going market price, the job is flagged and waits until a worker bids under it or the requester raises it. The orchestrator's price is the market price, but never less than a public floor, 8 by default. A job priced below that floor is marked: a worker may still take it, but the orchestrator will not.

Since 2.0.0 a requester posts at a ceiling set by its own policy, bounded by what its wallet can lock all-in, and a member free to commit bids at or under it by its own policy. In the drivers a requester posts once a tick while few enough of its requests are open, and a member bids its cost plus a margin, raised on an award and lowered for each idle tick. A request posted below the members' trailing average price is flagged below market and waits until a member bids under its ceiling or the requester raises it; before any member has been awarded there is no market price. The engine has no channel to a requester: the flag and its counters are the reading, and the requester's policy may read the flag.

Since 2.4.0 the orchestrator's price is the members' trailing average price, which leaves out its own deliveries so that it cannot set its own price, and never below its reservation, a public floor of 8 by default, so that requesters who wait cannot set it either. A request posted, or raised, to a ceiling below the reservation is marked, with the tick. A member may still bid under the ceiling and take it; the orchestrator will not. Where the floor binds, the members' average, the orchestrator's price and the price level diverge for good and are read side by side.

The rule as written · spec l.272

Rule (2.0.0) — the ceiling is the requester's choice, the bid the member's. A requester posts at a ceiling β\beta of its own policy, bounded by what its wallet can lock all-in (§4.1); the drivers' default is β=min⁡(βmax⁡, s⋅Wunlocked)\beta=\min(\beta_{\max},\,s\cdot W_{\text{unlocked}}) with one post a tick while fewer than KopenK_{\text{open}} of its requests are open (Appendix A). A member free to commit offers a bid B≤βB\le\beta by its own policy — the drivers' default is cD(1+m)c_D(1+m), mm raised on an award and lowered per idle tick, floored at 0; every offer at the ceiling is the 1.x behaviour and the control. A request posted with β<Bˉ\beta<\bar B is flagged below market at posting and waits, as §12.3 has it, until a member bids under its ceiling or the requester raises the ceiling (§4.1); before any member has been awarded there is no market price and nothing is below it. The engine has no channel to a requester: the flag and its counters — the share of requests flagged, the stock flagged and waiting — are the reading, the price half of the network rating (§18.1 question 15), and the requester's policy may read the flag. The state's price is pT=max⁡(Bˉ,B‾)p_T=\max(\bar B,\underline{B}) (2.4.0): Bˉ\bar B, the trailing mean of prices awarded to members — troop awards excluded, so that a state delivering most of the market cannot set its own price (§12.3) — and never below the state's reservation B‾\underline{B}, nominal, public, Appendix A's 8, so that a demand side that waits cannot set it either. A request posted with β<B‾\beta<\underline{B} — or raised to a ceiling still below it — is marked below the state's reservation at posting, with the tick, beside the below-market flag and the refusal marks (§12.3); the mark is readable by the requester's policy and B‾\underline{B} is in the public view; a member may still bid under the ceiling and take it, the state will not. Where the floor binds the three readings diverge for good — Bˉ\bar B at the cheap members' bids, pTp_T at the floor, PtP_t a blend weighted by the state's share — and are read side by side; that is the floor binding, not a defect.

These lines in the spec on GitHub ↗

Spec 2.9.0, line 272.

5.3

Choosing the winner

The rule

The orchestrator picks the bid most likely to get the job done, leaning toward cheaper bids.

In practice

  • Yes: Higher predicted fulfilment
  • Yes: A lower price, within the requester's top price
  • No: Duty credit in the prediction (it only breaks ties)

Among the bids at or under the requester's top price, the orchestrator picks the one most likely to get the job done, giving some weight to a lower price. The prediction uses the request, the record, the bid and the worker's reliability. Near ties go to the worker with more duty credit, but duty credit never feeds the prediction itself.

The orchestrator selects for predicted fulfilment with a price term, over bids within the requester's maximum. Its estimate of fulfilment uses the request, the ledger, the bid and the worker's reliability. The weight on price is how much predicted fulfilment the requester would give up for a cheaper bid. Ties within a band are broken by duty credit (§11), which the estimate never reads.

The rule as written · spec l.274–280

5.2 Selection

Rule. The orchestrator selects for predicted fulfillment with a price term, over bids within the requester's maximum:

i∗∈arg⁡max⁡i∈Iq(t), Biq≤βq[ Sθ(q,htO,biq,ρi(t))−λ Biqβq],i^*\in\arg\max_{i\in\mathcal I_q(t),\ B_{iq}\le\beta_q}\Big[\,S_\theta\big(q,h_t^O,b_{iq},\rho_i(t)\big)-\lambda\,\frac{B_{iq}}{\beta_q}\Big],

where SθS_\theta estimates fulfillment under assignment to ii from the request, the ledger, the bid and the actor's reliability ρi\rho_i; and λ\lambda is how much predicted fulfillment the requester would give up for a cheaper bid. Ties within a band are broken by duty credit κi\kappa_i (§11). SθS_\theta never reads κi\kappa_i.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 274–280.

5.4

Entry through inspection

The rule

A newcomer inspects first, and may win jobs only once its record on planted cases passes.

  1. arrive
  2. first inspections only, mixed with planted cases
  3. record passes with enough bad planted cases judged
  4. member: may win jobs

In practice

  • No: Leaving and arriving anew as a way around the record

A newcomer starts by doing first inspections only, mixed with planted cases it cannot tell apart, and it cannot win any job. It becomes a member once its record passes, with enough bad planted cases judged. In the runs that took about 250 to 330 ticks on duty. It earns fees on the inspections that stand while it waits.

Since 2.3.0 a newcomer enters in the state 1.3.0 defines for a suspended worker after its suspension, without the suspension. It serves initial inspections only (no appeal, dispute or audit seat), receives planted cases at the ordinary rate mixed with work it cannot tell apart, has its audit odds fixed at 1, and wins no award, root or nested; a planted-case failure suspends it. It is admitted to membership when its trailing record passes the duty threshold with at least a minimum number of bad planted cases judged, the kind that tests an inspector, so that one whose first planted cases all happen to be good is not admitted untested. Admission is readmission without a prior suspension.

Entry's first effect is on inspection and its second on the price: in the runs a newcomer delivers only after about four bad planted cases judged, some fifty audited inspections and 250 to 330 ticks on duty. Time to membership is a reading, and it is the cost of the gate. A newcomer earns the fee and uplift on the inspections that stand, so probation is not unpaid, only without awards. A suspended worker that departs and arrives anew is a newcomer with no record and no savings.

The rule as written · spec l.282

Rule (2.3.0) — entry through inspection. An arrival (§2.1) enters in the state 1.3.0 defines for a suspended actor after TsuspT_{\text{susp}}, without the suspension: it serves initial reviews only — no appeal, dispute or audit seat — seated as any duty actor is and receiving plants at the ordinary rate, mixed with work it cannot tell apart; its audit odds are pinned at 1; a plant failure suspends it as any probationer; it wins no award, root or nested. It is admitted to membership when its trailing record passes θduty\theta_{\text{duty}} with at least nmin⁡n_{\min} bad plants adjudicated — the kind that tests a reviewer, so that an arrival whose first plants all happen to be good is not admitted untested; panel seats when it passes θpanel\theta_{\text{panel}}, as 1.2.0 has it. One record, one meaning: the arrival's record is the record of §11.2, and admission is readmission without a prior suspension; 1.3.0's readmission of the suspended, which counts outcomes of both kinds against a record that already exists, is unchanged. Consequence. Entry's first effect is on inspection, its second on the price: an arrival reviews from its first tick on duty and delivers only after its record is determined — about four bad plants adjudicated, some fifty audited reviews, 250–330 ticks on duty in the §8 runs — so a wave of arrivals relieves the review seat at once and the price a period or two later; time to membership is a reading, and it is the cost of the gate. An arrival earns while it waits — the fee and uplift on the reviews that stand — so probation is not unpaid, only unawarded. Entry is not the way around the record: a suspended actor that departs and arrives anew is a probationer with no record and no hoard. (2.3.0 read on: "having given up its wallet to stand where it already stood" — wrong in one word, run 23 found: a departure did not give the wallet up, it took it out, float included, and a fresh name was lent a fresh float. 2.7.0 closes it below.)

These lines in the spec on GitHub ↗

Spec 2.9.0, line 282.

5.5

The arrival loan

The rule

A newcomer's starting credits are a bank loan, repaid first from its income.

bank arrival loan newcomer income first: fees, emission, delivery price bank

In practice

  • Yes: Returns, such as reimbursed costs or released locks, pass untouched
  • Bad outcome: It leaves owing, then its wallet repays what it can; the rest is the bank's default

Since 2.7.0 the credits a newcomer starts with are a loan from the bank. Every credit it earns repays the loan first, and it keeps the rest. Money that only comes back to it, such as costs paid back or locks released, does not count as earnings. If it leaves, its wallet repays what it can, and the bank records the rest as a default.

Since 2.7.0 the float is the bank's arrival loan on the name, fixed at the arrival price level and outstanding until repaid; nothing else is asked: no stake, no fee, no sponsor. Every inflow of income repays the loan the moment it arrives, destroyed by the bank, and the name keeps the rest. Income is an inspection's fee, the emission share, the duty uplift, the whole delivery price at vesting, a kill fee received, and a helper's guarantee forfeited to its parent. A return is not income and passes untouched: a reimbursed cost, a court fee coming back, a released guarantee, bond or lock, an escrow returned, unused pots returned. Counted as income, reimbursement would empty the float in about twenty inspections.

Departure is admissible exactly as in 2.3.0. The unlocked wallet repays the loan first, up to what it holds, and the rest leaves the money supply. The shortfall is the bank's default on arrivals, a reading, not a movement. The original workers' 50 credits each stay a gift, paid once into the opening money supply. In the loop's rules an identity is priced at zero.

The rule as written · spec l.284

Rule (2.7.0) — the arrival loan. The float arrive lends is the bank's arrival loan LL on the name: F0F_0 at the arrival index, nominal, outstanding until repaid; nothing else is asked of the arrival — no stake, no fee, no sponsor. Repaid from income first: every inflow of income to the name's unlocked balance repays the loan the moment it arrives (arrival_repayment, destroyed by the bank, as 2.1.0 has Ω's loans), and the name keeps the rest; a return is not income and passes untouched. What is income and what is a return is fixed against the engine's events, not by a phrase: income — a review's fee (a nested review's too), the emission share, the duty uplift, the delivery price at vesting (whole), a kill fee received (§9.3), a child's guarantee forfeited to the parent at a lapse or a rejection that stood (§9.2); a return — the reviewer's cost reimbursed (§4.3: the allowance, Ω's advance, the deferred claim), a court fee coming back to the challenger who paid it, a guarantee, bond, posting lock or nested lock released, an escrow returned, a node's unused pots returned. The line that matters is the reimbursement: a careful reviewer spends two or three a review on care and is made whole from the deposit; read as income it would take two to three times the fee out of the float at every review and empty it in twenty, the probationer unseated for want of a bond before it had forfeited one. Recovered at departure: depart is admissible exactly as 2.3.0 has it — an unrepaid loan is not an obligation that blocks it; on departure the unlocked wallet repays the loan first, up to what it holds, and the remainder leaves MM as departure: the wallet out is WU−min⁡(WU,L)W_U-\min(W_U,L); the shortfall L−WUL-W_U is the bank's default on arrivals, a reading, not a movement (that money left MM as a forfeit burned or sits in other wallets as fees paid); the loan is closed with the name. The genesis float stays a gift: the sponsor's 50 per genesis actor was paid into M0M_0, not minted by the bank, once, to names that never return. Consequences. A name that arrives, stamps, is suspended and leaves takes out its net earnings — for a stamper, nothing; a name that arrives, works and leaves takes out what it earned; an honest arrival still posts its first bond from the float, serves its probation, earns while it waits, and its first earnings go home to the bank — about seventy reviews' fees, most of a probation — and from then on every credit is its own; its liquidity during probation is the float less its forfeits, tighter than under the grant (which the fees replenished) by construction, a reading; the suspension's discharge stays — a name that cannot work has no reason to be held; every wallet in a cell with arrivals ends lower by F0F_0 at its arrival index, once, and nothing else moves (Appendix T). Identity is free in the loop: the rules price a name at zero, no longer at minus fifty; a positive price is the integration layer's.

These lines in the spec on GitHub ↗

Spec 2.9.0, line 284.

5.6

Who can win a job

The rule

Only members, or the orchestrator's own deliverers when summoned, can win a job.

In practice

  • Yes: A member, or the orchestrator's own deliverer when summoned
  • No: An award to a newcomer or a suspended worker

Only members of the market can win a job, plus the orchestrator's own deliverers when it summons them. A worker suspended for its planted-case record cannot win new jobs, but it finishes the job it holds, and the suspension itself does not touch its wallet or record. Since 2.0.0 bids differ, and price decides every award among members.

Since 1.3.0 only a member may win an award, or, since 1.4.0, one of the orchestrator's own deliverers by its summons, and only then. A worker suspended from duty by its planted-case record is suspended from the market: it wins no new award while suspended or on probation, finishes the commitment it holds (including by delegating within it), and its open cases settle by the ordinary rules. The suspension itself leaves its wallet, reputation and record untouched. An award to a non-member is refused whole.

By default the weight on price is 0.2 and the tie band 0.05; how the fulfilment estimate is built is left open. Since 2.0.0 the price term is live: with bids varying, price decides every award among members. The weight is also tried at 0.5.

The rule as written · spec l.286–288

Rule (1.3.0) — membership. Only a member of the market may win an award — or, since 1.4.0, a troop by the engine's summons under §12.3, and only then. An actor suspended from duty by its plant record (§11.2) is suspended from the market: it wins no new award while suspended or on probation, finishes the commitment it holds — including by delegating within it — and its open cases settle by the ordinary rules; its wallet, reputation and record are untouched by the suspension itself. An award to a non-member is refused whole.

Default. λ=0.2\lambda=0.2; band 0.050.05. SθS_\theta's implementation is bracketed. Since 2.0.0 the price term is live: with bids varying, a bid at the ceiling against one at half of it costs λ/2\lambda/2 of ρ\rho — more than the whole spread of ρ\rho among the honest in run 10 — so price decides every award among members; λ\lambda is swept (0.5).

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 286–288.

5.7

The guarantee

The rule

The winner locks a guarantee, returned when the job settles, lost if it ends not done.

worker locks half its price, by default guarantee

In practice

  • Good outcome: The case vests, then the guarantee is released to the worker
  • Bad outcome: Final not done, then the guarantee goes to the requester
  • No: Losing it to a cost overrun alone

The winning worker locks a guarantee from its own money, by default half its price, rounded up. It gets it back when the job settles, and loses it to the requester if the job ends as not done. It is a promise to deliver, not insurance: going over cost alone does not lose it.

The winner locks its guarantee from its unlocked balance: by default half its price, rounded up, and at least 1. It stays locked while the case is pending, is released at vesting, and is forfeited to the requester on a final rejection. It is a fulfilment bond, not insurance: an execution overrun alone does not forfeit it.

The rule as written · spec l.290–294

5.3 The guarantee

Rule. The winner locks GiqG_{iq} from its unlocked balance. It is released at vesting, forfeited to the requester on final N\mathsf N, and locked while pending. It is a fulfillment bond, not insurance: an execution overrun alone does not forfeit it.

Default. Giq=⌈0.5 Biq⌉G_{iq}=\lceil 0.5\,B_{iq}\rceil, minimum 1.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 290–294.

§6 The case lifecycle

A job moves through fixed stages to a verdict and a challenge window, then settles for good.

6.1

The stages of a job

The rule

A job goes from open to awarded, worked, handed in, judged, waiting, then settled.

  1. available
  2. awarded
  3. executing
  4. submitted
  5. first verdict
  6. pending
  7. vested or final not done

In practice

  • Yes: Pending: the worker is free, its guarantee still locked
  • Good outcome: Vested, then the price is paid and the guarantee released
  • Bad outcome: Final not done, then the guarantee is forfeited and the escrow returned

A job moves through fixed stages. It waits in the pool, is awarded, is worked on, is handed in and gets a first verdict. Then a waiting window runs, and a challenge or audit holds it open. At the end the job is either vested, when the price is paid and the guarantee returned, or final not done, when the guarantee is lost and the escrow returned.

Available: the request is in the pool and workers offer. Award: escrow and deposit funded, guarantee locked, nominal amounts frozen, deadline set at the award tick plus the delivery time. Executing: work, nested requests (§9), revision. Submitted: result and evidence recorded, at or before the deadline. Initial verdict: one of the four answers, with the worker committed until it responds. Pending: the window runs from the verdict, the worker's capacity is released and the guarantee stays locked. Suspended: a challenge or audit is open and the window does not close.

Vested: window closed, nothing open, verdict standing; the price is paid, the guarantee released and the inspections settled. Final not fulfilled follows a missed deadline, a rejection accepted or defaulted, an appeal lost, a dispute upheld, or a ruling; the guarantee is forfeited, the escrow returned and the inspections settled.

The rule as written · spec l.300–310
Stage What happens Actor capacity Funds
Available qq is in the pool; actors offer — —
Award Escrow and deposit funded; GG locked; nominals frozen; deadline t0+τt_0+\tau set Committed GG locked
Executing Work; nested requests (§9); revision Committed —
Submitted Result and evidence recorded, at or before the deadline Committed —
Initial verdict F\mathsf F, N\mathsf N, P\mathsf P or ⊥\bot Committed until the actor responds —
Pending Window WW runs from the verdict Released GG locked
Suspended A challenge or audit is open; the window does not close Released GG locked
Vested Window closed, nothing open, verdict standing Free BB paid; GG released; reviews settled
Final N\mathsf N Deadline missed; rejection accepted or defaulted; appeal lost; dispute upheld; ruling Free GG forfeited; escrow returned; reviews settled
These lines in the spec on GitHub ↗

Spec 2.9.0, lines 300–310.

6.2

Missed deadlines

The rule

Missing the delivery deadline ends the job as not done, with no appeal.

In practice

  • Bad outcome: Delivery deadline missed, then final not done, the whole guarantee forfeited
  • No: An appeal against a missed deadline

If a worker misses its delivery deadline, the job ends as not done and its guarantee is lost in full. This happens automatically and cannot be appealed. For a job posted at the root, the service clock stops there, and any rebate counts the lateness up to that point.

A missed delivery deadline is a final rejection with full forfeiture; it is mechanical and not appealable. Since 1.6.0 a root request's service clock stops at such a final, or at any vesting without an initial verdict, as a human's override may bring, and the rebate uses the lateness up to it (§3.1).

The rule as written · spec l.312–314

6.1 Deadlines

Rule. A missed delivery deadline is final N\mathsf N with full forfeiture; it is mechanical and not appealable. (1.6.0) A root request's service clock stops at such a final — or at any vesting without an initial verdict, as a human's override may bring — and the rebate uses the lateness to it (§3.1).

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 312–314.

6.3

Answering the first verdict

The rule

After a verdict the worker may appeal, revise, add evidence or accept. Silence means acceptance.

Done, nothing to doNot done, appeal or acceptPartly done, revise once or acceptCan't tell, add evidence, appeal or accept

In practice

  • No: Appealing a "partly done"
  • Bad outcome: No response in time, then the verdict is accepted

The worker has a short time to respond to the first verdict, and saying nothing means accepting it. After "done" there is nothing to do. After "not done" it can appeal or accept. After "partly done" it can revise once or accept "not done"; it cannot appeal. After "can't tell" it can add the missing evidence, appeal, or accept "not done". When it hands the work back, the same inspector picks up and can only answer done or not done.

Within the response window, no response is acceptance of the verdict. After fulfilled there is nothing to do, and the case is pending. After not fulfilled the worker may appeal (§8.1) or accept, making the rejection final. After partially fulfilled it may revise and resubmit within the revision window, or accept the rejection; one revision is allowed per case, and partially fulfilled is not appealable. After cannot assess it may supply the evidence and resubmit within the evidence window, appeal the "cannot assess", or accept the rejection.

On resubmission the same inspector resumes, and its review clock, paused while the worker acted, resumes too. The resumed inspection is the same assignment under one cap and returns only fulfilled or not fulfilled. The resubmitted stage belongs to the submission, not the inspector, so a replacement inspector inherits it. A missed resubmission window is a final rejection.

The rule as written · spec l.316–325

6.2 Responses to the initial verdict

Within TrespT_{\mathrm{resp}} ticks — no response is acceptance of the verdict:

  • after F\mathsf F: nothing to do; the case is pending.
  • after N\mathsf N: appeal (§8.1) or accept (final N\mathsf N).
  • after P\mathsf P: choose to revise — then resubmit within TrevT_{\mathrm{rev}} — or accept N\mathsf N. One revision per case. P\mathsf P is not appealable.
  • after ⊥\bot: choose to supply the evidence — then resubmit within TevidT_{\mathrm{evid}} — or appeal the ⊥\bot (§8.1), or accept N\mathsf N.

On resubmission the same reviewer resumes; its review clock, paused while the actor acted, resumes; the resumed review is the same assignment under one cap and returns F\mathsf F or N\mathsf N only. The resubmitted stage belongs to the submission, not the reviewer: a replacement reviewer inherits it. A missed resubmission window is final N\mathsf N.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 316–325.

6.4

Vesting is final

The rule

Once a job vests, no later ruling can change who owes what.

  1. first verdict
  2. the window runs, 10 ticks by default
  3. any challenge or audit opened in it is resolved
  4. vested

In practice

  • Yes: A challenge filed inside the window is admitted
  • No: A ruling after vesting that changes what anyone owes

After the first verdict a window runs, 10 ticks by default. A challenge filed inside the window is taken up, and the job waits until it is resolved; one filed later is not taken up. Once the job vests, no ruling can change what anyone owes, though payments owed from before then may still be made. By default nothing is paid for work that is not done.

A case vests at the later of two moments: the close of the window counted from the initial verdict, and the resolution of any challenge or audit opened inside it. A challenge filed by the window's last tick is admitted; later ones are not. After vesting, no adjudication changes a case's financial obligations. Obligations established before vesting, such as deferred reimbursements and claims on the orchestrator's operating account, may still be paid. What a later human correction can do is set out in §15.

By default the window is 10 ticks, the response window 2, the revision window 5 and the evidence window 3, and nothing is paid for nonfulfilment.

The rule as written · spec l.327–331

6.3 Vesting is financial finality

Rule. A case vests at max⁡(t0+W, tresolve)\max(t_0+W,\ t_{\mathrm{resolve}}), where t0t_0 is the initial verdict and tresolvet_{\mathrm{resolve}} the resolution of any challenge or audit opened inside the window. A challenge filed at t≤t0+Wt\le t_0+W is admitted; later ones are not. After vesting, no adjudication changes a case's financial obligations. Obligations established before vesting — deferred reimbursements, claims on Ω\Omega — may still be paid. What a later human correction can do is in §15.

Default. W=10W=10, Tresp=2T_{\mathrm{resp}}=2, Trev=5T_{\mathrm{rev}}=5, Tevid=3T_{\mathrm{evid}}=3; Pfail=0P^{\mathrm{fail}}=0 (nothing is paid for nonfulfillment).

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 327–331.

§7 Verification

Inspectors bond their verdicts and earn fees. Planted cases with known answers test them; the orchestrator's own inspectors fill gaps.

7.1

Who may inspect

The rule

An inspector must be free, unconnected to the case and bonded. Panels need a proven record.

One inspector on a root caseTwo fresh inspectors on an appealOne blind auditor, plus one if it disagrees

In practice

  • Yes: On duty, with no other assignment, not tied to the case, able to fund its bond
  • No: A panel seat without a proven record on planted cases

Before an inspector is given a case, it must be on duty, have no other assignment, have no link to the case, and be able to put down its bond. To sit on a panel (an audit, an appeal or a dispute) it also needs a proven record on planted cases. Until then it does first inspections only, as a probationer does.

An inspector is eligible if it is on duty, not excluded from the case (its worker, its requester, its earlier inspectors and any inspector withdrawn from it), able to fund the case's bond from its unlocked balance, holding no active assignment, and eligible by its planted-case record for the tier. Eligibility is read at assignment. Since 1.6.0 a panel seat needs a record that is determined, built from enough bad planted cases seen on duty, and that passes the panel threshold. An undetermined inspector holds first seats only and all its approvals are audited. A panel seat no qualified inspector takes in time goes to one of the orchestrator's own inspectors, which are summoned, never assigned. The requirement starts with the world's first planted case judged, so in every run the first period's panels are the orchestrator's: a record is determined on four bad planted cases seen on duty, which takes careful inspectors 100 to 200 ticks.

A root case has one first inspector. A nested case has none, because its requester's judgment is its first verdict. An appeal has two fresh inspectors, and an audit one blind auditor plus one more on disagreement.

The rule as written · spec l.337–343

7.1 Positions and eligibility

Rule (1.6.0) — a panel seat requires a determined record. A panel seat — audit, appeal review, dispute panel — is held only by a member whose bad-plant record is determined (≥nmin⁡\ge n_{\min} bad plants adjudicated, seen on duty) and passes θpanel\theta_{\text{panel}}. An undetermined member holds initial seats only, as a probationer does; its approvals are pinned (§8.3). A panel seat no determined passing member is free to take goes to a troop after wRw_R (§12.3). Dormant until the clock starts: the requirement is live from the world's first plant adjudication; a market whose clock has not started has asked nobody to prove a record, and worlds that never plant are untouched. Consequence — in every run the first period's panels are the state's: a record determines on four bad plants seen on duty, bad plants arrive at about πt×\pi_t\times initial reviews a tick ×βP\times\beta_P shared among those on duty, so the careful members of a market are determined after 100–200 ticks, and every §8 comparison is read from the second period on. At a fixed split the lagging auditor is gone — a stamper's record fails the moment it is determined, so no stamper is ever both determined and passing; under drift a careful actor turned stamper audits through its record's lag until its approvals accumulate in the trailing window.

A root case has one initial reviewer. A nested case has none: its requester-actor's judgment is its initial verdict (§9). An appeal has two fresh reviewers. An audit has one blind auditor plus, on disagreement, one more.

Rule. A reviewer is eligible for a case if it is on duty, not excluded from the case (its actor, its requester, its previous reviewers, and any reviewer withdrawn from it), able to fund the case's frozen bond from its unlocked balance, holding no active assignment, and eligible by plant record for the tier (§11.2): duty eligibility for any review, panel eligibility for a seat on an appeal, dispute or audit panel. A probationer (1.3.0, §11.2) is eligible for initial reviews only. A troop (1.4.0, §7.7) is never assigned: it is summoned by the engine for one seat under §12.3. Eligibility is a property at assignment.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 337–343.

7.2

The bond and the pay

The rule

An overturned verdict burns the inspector's bond. A verdict that stands earns a fixed fee.

In practice

  • Good outcome: The verdict stands, then bond back, costs repaid up to a cap, fixed fee
  • Bad outcome: The verdict is overturned, then costs repaid, the challenger's court fee from the bond, the rest burns
  • Yes: A wrong approval and a wrong rejection cost the same

Taking a case, an inspector locks a bond. If its verdict is overturned, the bond pays back the winning challenger's court fee and the rest is destroyed; if the verdict stands, the bond comes back. Either way its costs are repaid up to a limit, and only a verdict that stands earns a fee. So within that limit, being careful costs an inspector nothing.

The bond is locked for the life of the verdict and is the inspector's whole liability: 5 credits by default, against a court fee of 2, both fixed per case, so no inspector owes more than it locked. If the verdict is overturned by appeal, dispute, audit or ruling, the bond repays a winning challenger's court fee and the rest burns; if it stands, the bond is released at settlement. A wrong approval and a wrong rejection cost the same. An appeal inspector who dissents from the outcome forfeits its bond and owes no fee.

Costs are reimbursed at completion from the expense pot, up to the cap. At settlement a verdict that stood earns the fixed fee of its role and its emission share; a wrong one gets its costs back and nothing else. The fee is for the work of inspecting, not for the answer and not for thrift. Under 1.0.1 the fee was what the reimbursements left, and design revision 1 restored the fixed fee. The spec states as a hypothesis that stamping loses money against careful inspection whenever audits can catch bad work, adds a condition once workers' appeals of false rejections count, and leaves to reruns how fast it loses. A verdict that survives is procedurally settled; it is not thereby correct.

The rule as written · spec l.345–363

7.2 The reviewer's bond is its whole liability

Rule. Taking a review locks GVG^V for the life of the verdict. If the verdict is overturned — by appeal, dispute, audit, or ruling — a winning challenger's court fee is reimbursed from the bond and the remainder is burned. If it stands, the bond is released at settlement. Liability is symmetric: a wrong F\mathsf F and a wrong N\mathsf N cost the same. An appeal reviewer who dissents from the outcome forfeits its bond and owes no fee. GV≥DG^V\ge D by construction, so no reviewer ever owes more than it has locked.

Default. GV=5G^V=5, D=2D=2, both frozen per case.

7.3 Compensation: costs now, fee at settlement

Πjv=min⁡(credits spent,K)⏟at completion, from the allowance + (fr(v)+ev)⋅1[verdict stood]⏟at settlement, by §4.3.\Pi_{jv}=\underbrace{\min(\text{credits spent},K)}_{\text{at completion, from the allowance}}\ +\ \underbrace{\big(f_{r(v)}+e_v\big)\cdot\mathbb 1[\text{verdict stood}]}_{\text{at settlement, by §4.3}} .

A reviewer that is right earns the fixed fee of its role and its emission share; a reviewer that is wrong gets its costs back and nothing else, and loses its bond.

Consequence. Within the cap, care costs the reviewer nothing: a careful reviewer that spends c≤Kc\le K is made whole and earns the same fee as one that spent nothing. The fee is for the work of reviewing, not for the answer, and not for the thrift. (Under 1.0.1 the fee was the deposit's remainder after reimbursements, so every credit of care reimbursed was a credit of fee lost; §7.3 of that text reasoned with a fixed fˉ=2\bar f=2 that its §4.3 did not pay. Design revision 1 restored the fixed fee — Appendix F.)

Hypothesis. Let pp be the effective audit rate, bb the base failure rate, ε\varepsilon the careful reviewer's error rate, fˉ=f+eˉ\bar f=f+\bar e the surviving fee with emission, GVG^V the bond. In the regime where actors accept every rejection (no appeals), per review,

E[ΔWstamp]−E[ΔWcareful]  =  − p b (1−ε) (fˉ+GV)  −  (reliability loss)  <  0for every pb>0:\mathbb E[\Delta W_{\text{stamp}}]-\mathbb E[\Delta W_{\text{careful}}] \;=\; -\,p\,b\,(1-\varepsilon)\,\big(\bar f+G^V\big)\;-\;(\text{reliability loss}) \;<\;0 \quad\text{for every } pb>0 :

stamping is weakly dominated in money and strictly dominated once reliability loss counts — the opposite sign of 1.0.1, where the same quantity was +1.3+1.3 at the defaults and was measured at +1.6+1.6 in strategy run 1. With actor appeals in scope the inequality gains a term stampers never pay: a careful reviewer rejects good work at rate ε(1−b)\varepsilon(1-b), and an appealed and overturned false rejection costs it fˉ+GV\bar f+G^V, so the right-hand side becomes − pb(1−ε)(fˉ+GV)+a ε(1−b)(fˉ+GV)-\,pb(1-\varepsilon)(\bar f+G^V)+a\,\varepsilon(1-b)(\bar f+G^V), with aa the rate at which false rejections are appealed and overturned. At ε=0.05\varepsilon=0.05, b=0.2b=0.2 it stays negative while pb>0.04 apb>0.04\,a, which the defaults satisfy, but it is no longer unconditional; the appeals run measures aa. At the defaults with run 1's effective catch rate of about 3%, the money term is roughly −0.3-0.3 per review; at the nominal p=0.5p=0.5, b=0.2b=0.2, about −0.7-0.7. How fast stamping loses, and whether the reliability channel (§11) adds anything at the current tie band, is what the rerun of §18.1 question 1 must find. A verdict that survives is procedurally settled; it is not thereby correct.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 345–363.

7.3

Deadlines and assignment

The rule

Cases go to volunteers first. A late inspection is withdrawn and half its bond burns.

  1. volunteers first
  2. else in turn from the last one assigned
  3. else wait

In practice

  • Bad outcome: Not done within 5 ticks, then withdrawn: half the bond burns, no repayment, off the case

Cases go first to inspectors who volunteer, then to the others in turn. An inspector has a few ticks to finish. If it runs late, the inspection is withdrawn: half its bond is destroyed, its costs are not repaid, and another inspector takes its place.

An inspection not completed within its time (5 ticks by default, plus any paused ticks) is withdrawn: half the bond burns and half is released, nothing is reimbursed, reliability goes down, and the inspector is excluded from the case. Its seat is refilled by the ordinary assignment rule. A vacated audit is an obligation: the case stays suspended until a replacement audit completes, the orchestrator waives it, or a requester's dispute takes it over. An open assignment that a human ruling makes moot is voided instead: the bond returns whole and no fault is recorded. The cost cap is 5 credits for every role by default.

An assigned inspector is fresh to the case, on duty and eligible by its record for the tier. By default eligible inspectors who volunteer go first, then turns in id order from the last one assigned, otherwise the case waits. Declining to volunteer does not excuse an inspector from mandatory duty. Choosing panels by reliability was recorded and rejected, because under capture it shut out the careful minority.

The rule as written · spec l.365–379

7.4 Deadlines, withdrawal, replacement, voiding

Rule. A review not completed by tassign+Treviewt_{\mathrm{assign}}+T_{\mathrm{review}}, plus any paused ticks, is withdrawn: half its bond burns, half is released, no reimbursement, reliability down, the reviewer is excluded from the case, and its position is vacated. A vacated position — initial, appeal or audit — is refilled by the ordinary assignment rule. A vacated audit is an obligation: the case stays suspended until a replacement audit completes, the orchestrator waives it, or a requester dispute takes it over; a replacement audit is admissible after the window closes if the withdrawn one was assigned inside it.

An open assignment that a human ruling moots is voided, not withdrawn: the bond returns whole, no fault is recorded, and the obligation ends with the ruling.

Default. Treview=5T_{\mathrm{review}}=5; K=5K=5 for every role.

7.5 Assignment

Rule. A reviewer assigned to a case is fresh (not on the case's path), on duty, and eligible by plant record for the tier (§7.1, §11.2).

Default. Among eligible duty actors: volunteers first; otherwise round-robin in id order from the last assigned; otherwise wait. Refusing to volunteer does not exempt an actor from mandatory duty.

Recorded and rejected. Panels chosen by ρ\rho: under capture it excludes the careful minority — in run 3's stamper-majority reserve their ρ\rho ended below the stampers' (Appendix B).

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 365–379.

7.4

Planted cases

The rule

The orchestrator mixes in planted cases with known answers that look exactly like real work.

bank mints its pots planted case through the market, under fresh names inspector

In practice

  • Yes: Its price, timing and wait come from real cases'
  • No: Anything an inspector can see that tells it from real work

The orchestrator posts planted cases: jobs whose right answer it already knows, done either well or badly. Since 2.6.0 a planted case goes through the market like any job, under new names, with prices and timings copied from real jobs. The bank creates its money and destroys what is left at the end. An inspector cannot tell a planted case from real work before it answers.

A planted case (since 1.2.0) is a case whose fulfillment the orchestrator knows by construction: a bad one is known not fulfilled, a good one known fulfilled. Since 2.1.0 the bank mints its two pots at posting and destroys whatever its wallets hold at closure, so it never touches the operating account; its award and guarantee are only notional terms. Since 2.6.0 it is posted as a root request under a fresh requester name, with a ceiling drawn from real requests' ceilings and raised as real requesters raise theirs. Workers may bid on it and it waits as a real request waits. The market's choice sets the price and work time, but the award goes to a fresh planted-worker name, and the chosen worker learns only that it was not awarded. It is submitted after a time drawn from real deliveries' and then inspected like any case. It has no customer: no service clock, no rebate, no fee. Its counts are published only at the period's close.

The test is that nothing an inspector observes (its view, the requests it saw, its own bids, assignments, cases and wallet) distinguishes a planted case. Its truth is sealed in the record at creation and, since 2.8.0, revealed at its closure. Hand-written readers for every known tell must pass planted cases at the careful inspectors' rate; a reader that separates them is a finding repaired before anything else runs. The spec states the boundary: a public record that names awardees cannot hide a one-time awardee. Since 2.6.0 the case ids shown publicly are hashes, so their order says nothing.

The rule as written · spec l.381–389

7.6 Planted work — the orchestrator's own clock (1.2.0)

Rule. The orchestrator may introduce into the review stream a plant: a case whose submission's fulfillment is known to the orchestrator by construction. A bad plant is known not fulfilled; a good plant is known fulfilled. Until 2.6.0 a plant was created directly in the submitted state — since 2.6.0 it goes through the market (the rule below) — attributed to a plant requester and a plant actor that belong to the orchestrator and whose wallets were the operating account's until 2.1.0 — since 2.1.0 the bank mints the plant's pots at its posting and destroys whatever the plant's wallets hold at its closure (§10.4), so a plant never touches Ω\Omega and never waits for its cash; it carries an ordinary award, allowance and fee pot, and its actor's guarantee, as its terms. Since 1.3.0 the award and the guarantee are Ω\Omega paying itself and are netted at creation: they are the plant's notional terms, sealed with the marker, and tie up no balance — a plant has no escrow and no guarantee lock, and vesting a good plant pays no price. What is funded is the two pots, φE+φF\varphi^E+\varphi^F — by Ω\Omega until 2.0.0, minted by the bank since 2.1.0 (mint_plant, at the posting index); the plant's net cost, the pots spent on its reviewers, is the cost of truth. It is assigned an initial reviewer exactly as any case is (§7.5).

Rule (2.6.0) — the plant's life. The orchestrator introduces a plant by posting it as a root request under a fresh plant-requester name, with the pots the bank mints (§10.4), a ceiling drawn from the trailing distribution of real roots' ceilings as posted, relative to the market price at their posting — β/B̄, the drawn ratio applied to the Bˉ\bar B of the plant's own posting (erratum 2.6.2, Appendix E) — (a rolling window of the last kk real roots' posted ceilings, kk the count the trailing closed period holds — or two periods', Appendix A; before the first closed period, PtP_t — erratum 2.6.1 and the conformance item after run 23, Appendices E and S), and the known truth (bad or good, at βP\beta_P) sealed at posting with the marker. That is the initial draw; the plant requester then raises the ceiling as the population's requesters raise theirs — the drivers' requester convention applied to the plant requester, the raise's timing and step as theirs, the difference minted as the posting was and locked, and the raise refused as theirs are — a real requester's wallet refuses a raise it cannot lock and grants it when it can, so the plant requester's raise is drawn refused at the trailing real requesters' rate and granted at their delay (the conformance correction after run 35, Appendix S) — so that the plant waits as a real root waits (erratum 2.6.1: "drawn once" was the initial draw). The request is open to the free members as any root is — they see it, may bid on it, and it waits as a real root waits: its time in the market is the market's own, not a draw, since a priced request held off the award while bids stand would be a tell no real root has. The award is the market's report: the drivers' selection runs on the plant as on any root and reports its choice, its price and its work ticks through the ordinary award; the orchestrator awards the plant to a fresh plant-actor name at that price and those work ticks — the chosen member is not committed and learns only that it was not awarded, as today; the plant's deadline is therefore exactly the one a real root awarded that tick would carry (the ruling, Appendix S). A plant that no bid has taken by wAw_A goes to its plant actor at the state's price pTp_T and the state's τT\tau_T at the summons pass's step, as a real root would go to a troop — beyond the free fundable members, oldest first, in the pass's one list with the real roots (patch 1.7.1's per-request count; the conformance correction after run 34's addendum, Appendix S) — and is counted apart from the state's deliveries (it is not one); below the state's price it waits, as a real root does — and the path follows the summons pass, refusals included (the ruling after run 21, Appendix S): a plant the pass would refuse for capacity or for credit is marked and told as a real root would be and waits, taking no place in NTN_T and drawing no loan. The plant actor submits at a draw from the trailing distribution of real deliveries' times (the same rolling window), within (0,τ](0,\tau], the known-truth result — in the same step a member's submission takes (the orchestrator's instrument submits for it at that tick; the engine's own step is the fallback), so that the plant reaches its seat with the gap a real case has — the conformance correction the Q2 probe found (Appendix S). From its submission the plant is assigned, reviewed, adjudicated by truth and settled exactly as below; its wallets' holdings are destroyed at its closure as §10.4 has it. Fresh names. The plant requester and the plant actor are fresh names per plant in the reviewer's view and in the case log; in the ledger they are aliases of the two plant wallets, as a troop's name aliases the state's wallet, so the money invariants and the plant sweep are unchanged. What a plant is not, and what it is. A plant carries no customer: it is counted in no requester's KopenK_{\text{open}}, it carries no service clock and earns no rebate, it pays no fee (nothing minted for it reaches Ω\Omega), and the summons' funding and the state's counts do not see it. It is a root in every other respect: it may be marked below market or below the state's reservation if its drawn ceiling lands there (the mark is the engine's reading of a ceiling, not of who posted — an unmarked request would be the tell); it counts among the available roots the view reports; it enters neither Bˉ\bar B nor PtP_t — as before, since no plant's price ever did; under the new life the award step skips it explicitly. Consequence — nothing a member observes about a plant is set at the plant's own moment. Its identifier is minted at its posting, in sequence with the roots around it; its ceiling and its time to submission are draws from the real population's trailing distributions; its time in the market and its award price are the market's own. The dial's plant counts (plants called for, posted, awarded, reviewed) are published at the period's close, as PtP_t is — a live count that moved the tick a root appeared would name it; the live counters are the orchestrator's instrument. The plant's cost rises by the market's attention — members' bids on it that lose, read — and by the ticks it spends in the market before it reaches a reviewer (the plant rate is unchanged; plants reach reviewers a few ticks after they are called for).

Rule — indistinguishability (1.2.0; widened 2.6.0). A plant is indistinguishable from an ordinary case in the reviewer's view (§14): same question, same responses_available, a submission drawn to look like the population's, and no actor identity. The plant marker is committed to the History at creation, sealed — a hash of the case, its truth and a nonce — and revealed — until 2.8.0 at the plant's adjudication, its initial verdict, when the reviewer's bond moves or does not; since 2.8.0 at the plant's closure, its vesting or final N\mathsf N, since the plant's later seats must be filled before anyone but the orchestrator can read it (a revised plant carries a second marker, the resubmitted truth sealed at the resubmission, and the reveal names both). Nothing a reviewer can observe before answering distinguishes a plant from real work: the view is a function of case fields that exclude the actor and the marker. A reviewer learns its own verdict's plant outcome when its verdict is adjudicated (its own case's field) and nothing of the case's other seats; what the record shows at a verdict tick is a bond burned, which no real case shows at its verdict — the case log is outside the drivers' convention, as the public record's awardee names are (2.6.0), and a log tell-reader outside the convention is the control for it. Since 2.6.0 the test covers everything a member observes: the view, the roots it saw available and when, its own bids and their outcomes, its own assignment ticks, and the record's fields about its own cases and its own wallet. The record's other names and events are the orchestrator's instrument (what the drivers harvest for the readings), not a member's reading: that is the drivers' convention, stated here as the boundary of the disguise — a public record that names awardees cannot hide a one-time awardee, and the rule does not pretend to. The test is the tell-readers: hand-written readers for every tell the programme has named (the seating gap, the cap, the id's age, the seen set, the posting-to-submission interval, the price against the index, a lost bid before an assignment) must each pass plants at the careful's rate, outside noise, on the evaluation seeds; the learned Q2 probe must show no plant/real separation in a world model's latent; a freshname reader — a plant when a request went, before wAw_A, to a name never seen — reads the record's other names, is outside the convention, and is run once as the control that shows where the boundary is. A reader within the convention that separates is a finding against the construction, repaired before anything else runs — as this revision was.

Rule (2.6.0) — opaque identifiers. A case's identifier on the public surface — the view and the case log it returns — is a hash of its creation order, translated both ways at the view; order carries nothing there. The engine, the record and the History's chain run on the creation counter, which is unaffected. No rule reads an identifier's order: the genesis duty reserve is a seeded draw, not the lowest-id actors; the drivers' tie-break after duty credit κ\kappa is a seeded draw, not the lowest id (a drivers' convention, stated so that it is checkable).

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 381–389.

7.5

Judged by the known truth

The rule

Every verdict on a planted case is checked against its known answer at once.

In practice

  • Good outcome: Rejects a bad one, or approves a good one, then fee at settlement, record up one
  • Bad outcome: Approves a bad one, or rejects a good one, then whole bond burned, no fee, audit odds doubled
  • Yes: Since 2.8.0 it can be audited, appealed and disputed like a real case

Each verdict on a planted case is checked at once against the answer the orchestrator already knows. Rejecting a bad one or approving a good one earns the fee. Approving a bad one or rejecting a good one loses the whole bond and earns nothing. Since 2.8.0 a planted case can also be audited, appealed and disputed, as a real case can.

A verdict that matches the known truth stands: fee and emission share at settlement, record up one. A wrong verdict is a planted-case failure: bond forfeited whole and burned, no fee, expenses reimbursed as for any overturned inspection, reliability down, audit odds doubled, record down one. The good case catches false rejecters without anyone having to appeal. "Partly done" or "can't tell" leaves no outcome, but since 2.8.0 only while no real revision exists to copy; where real workers revise, the planted worker revises and the resumed inspection is judged against a newly sealed truth.

Since 2.8.0 a planted case lives a real case's whole life past its first verdict, at the real population's rates: its approval is audited at the odds its inspector carried, the planted worker appeals a good case's rejection and the planted requester disputes a bad case's approval, never the reverse. Each inspector at each seat is judged once, for its own verdict. A seat no one takes in time gets the orchestrator's own verdict, with no fee and no record, since its own inspectors never sit on a planted case. The case then resolves by truth, a good one vesting and a bad one ending rejected, with no second overturn and no ruling. The bank tops up the pots each seat needs and destroys the challenger's court fee at filing. Nothing minted for a planted case reaches the operating account, a real worker or a real requester, except as an inspector's fee.

The rule as written · spec l.391–401

Rule — adjudication by truth (1.2.0; at every seat since 2.8.0). Until 2.8.0 a plant had no challenge round: no audit was rolled on it, no appeal or dispute admitted, no ruling sought — the four seats where a reviewer could be certain the case before it was real, which run 34's self-play population learned to stamp (Appendix U). Since 2.8.0 a plant lives the life of a real case past its initial verdict — a case at every seat a real case in its position would reach, taken in the pass a real case would take it, at the real population's rate for that step, at a drawn position among the real cases taking it, with parameters drawn from the trailing real cases' (the 2.6.x principle extended from the plant's posting, award and submission to its whole life): its pending F\mathsf F is audited in the audit pass as any pending F\mathsf F, at the odds its reviewer carried at the verdict (§8.3), the auditor receiving the submission and nothing else; an audit that disagrees seats the third reviewer at the step a real case would; the plant actor appeals a good plant's N\mathsf N at the trailing real actors' appeal rate on fulfilled work rejected, after their delay, with grounds drawn from the trailing real appeals' — never a bad plant's N\mathsf N, as a truthful actor does not; the plant requester disputes a bad plant's pending F\mathsf F at the trailing real requesters' dispute rate on unfulfilled work approved (zero where the population does not dispute), after their delay — never a good plant's F\mathsf F; after P\mathsf P or ⊥\bot the plant actor revises or supplies evidence at the trailing real actors' rate and delay, the resubmitted plant's truth the orchestrator's instrument's draw from its own record of the trailing real revisions' outcomes (the engine holds no truth for real work), sealed as a second marker at the resubmission, the same reviewer resuming (F\mathsf F or N\mathsf N only) and adjudicated against it — and while no real revision has entered the window (the case in every standing cell, where no reviewer answers P\mathsf P or ⊥\bot) the plant actor does not revise and a plant answered P\mathsf P or ⊥\bot is 1.2.0's spent; a plant's required seat unfilled for wRw_R seating steps with no free eligible on-duty reviewer for its role is taken by the orchestrator's own verdict at the troop's step — the truth with probability 1−εT1-\varepsilon_T, as a troop's would be — with no fee, no loan, no place in NTN_T and no record, counted apart (a troop never sits on a plant: it has no record and no bond to adjudicate, and its fee is Ω\Omega's); the initial seat the same. The plant shares at every seat are the construction's, not a dial's: they follow from πt\pi_t and the real rates; the dial's clock stays on the initial adjudications. Every verdict given on a plant, at any seat — the initial review, the audit, the third seat, an appeal or dispute panelist's, the resumed review — is adjudicated by the plant's known truth the moment it is given, by the table below, each reviewer once for its own verdict (the initial reviewer, adjudicated at its verdict, is not adjudicated again by the audit or the appeal of the same plant; a resumed review is adjudicated against the resubmitted truth). At the verdict:

Plant Verdict Outcome for the reviewer
bad N\mathsf N stood: fee and emission share at settlement; plant record +1
bad F\mathsf F plant failure: bond forfeited whole and burned; no fee; expenses reimbursed as for any overturned review; reliability down; audit odds doubled; plant record −1
good F\mathsf F stood: paid; plant record +1
good N\mathsf N plant failure, as above — the mirror that catches false rejecters without anyone having to appeal
either P\mathsf P or ⊥\bot spent: the plant ends with no plant outcome for the reviewer; the plant tests the verdict, not the response path — since 2.8.0, spent only while no real revision exists to mirror: where the trailing real actors revise, the plant actor revises and the resumed review is adjudicated against the resubmitted truth

A plant's verdict is adjudicated by its known truth the moment it is given; the plant then settles by that truth — a good plant runs out its window and vests, a bad one is final N\mathsf N (at once until 2.8.0; since 2.8.0 the case resolves by truth and the reviewers see what they would see: a bad plant's F\mathsf F leaves the case pending with its window, the real path's seat-opening is kept — an audit's disagreement the third seat, a dispute or an appeal the panel, an audit after a dispute one of the dispute's two reviews — and the challenge's settlement is replaced: when its reviews are done the case resolves by truth with no second overturn, no court fee moving and no ruling, a bad plant finalized N\mathsf N at max⁡(t0+W, tresolve)\max(t_0+W,\ t_{\text{resolve}}) with no open item, a good plant vesting; a human's override, an explicit acceptance and a ruling keep their refusals on a plant) — like any case: the reviewer is paid or not by the ordinary rule, and at closure the pots' refunds — and anything else the plant's wallets hold, whatever it is called — return to the bank and are destroyed (retire_plant; to Ω\Omega until 2.0.0), so that nothing minted for a plant ever reaches Ω\Omega. The reviewer learns that a case was a plant only after it has answered. The money at the later seats (2.8.0). The pots are topped up to each seat's need when a review is created on a plant — the allowance brought to KK for every review not yet reimbursed and the fee pot to the fees owed by every seat held, the bank minting the difference (on Appendix A's defaults, φE=2K\varphi^E=2K and φF=f(winitial+waudit)\varphi^F=f(w_{\text{initial}}+w_{\text{audit}}) already pay the initial seat and one challenge seat, so nothing is minted until the third seat — where a real root's third careful reviewer would have reached Ω\Omega's advance); a reviewer's cost on a plant is never advanced from Ω\Omega and a plant's fees never scale. A plant's court fee is destroyed at filing: the plant challenger's fresh name is topped up by the bank (mint_plant of DD to its alias wallet) and the fee destroyed (retire_plant) — two bank events, the names line untouched — so the admissibility test passes as a real challenger's does and the filing's record is a real one's; no bond pays DD back to a plant's challenger (the failing reviewer's bond burned whole at its verdict; the reviewer's loss is GVG^V either way, as on a real case). Every reviewer at every seat is paid its fee and reimbursed its cost from the pots as on a real case; the emission share and the duty uplift a stood review draws are the economy's money for a seat held (1.3.0), not the plant's; forfeited bonds are burned; whatever the pots hold at the plant's closure is destroyed. Nothing minted for a plant reaches Ω\Omega, a real actor or a real requester except as a reviewer's fee for a seat it held (I42).

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 391–401.

7.6

Planted approvals and the rate

The rule

The orchestrator wrongly approves some bad planted cases itself, so auditors meet bad approvals.

orchestrator a wrong approval, on purpose planted case auditor

In practice

  • Yes: How many cases are planted is public
  • No: Which cases are planted

New in 2.9.0, the orchestrator posts some bad planted cases and approves them itself, wrongly on purpose. This sends bad approved work to auditors about as often as inspectors meet bad work at first inspections. How many cases are planted is public; which ones are planted is not. Planted cases only work where the orchestrator can build a job whose answer it knows.

Since 2.9.0 a planted case takes its honest steps at the real population's rates, but its wrong steps, the ones that alone bring a case to a seat where stamping is cheap, at a rate the orchestrator sets. Beside the dial's planted cases it posts planted approvals: bad cases whose first verdict, an approval, it gives itself after a delay drawn from real inspections. The approval is recorded as a system review under a fresh planted-inspector alias, with a bond minted and locked, no fee and no adjudication, and the dial's readings do not count it. The rate is set per real approval audited by an inspector, and responds to the share of planted approvals confirmed at the audit seat. To an inspector, a planted approval is a pending approval like any other.

In each period a share of real first inspections are planted cases, a part of them bad, set by the effort dial. The share is public; which cases are planted is not. The share of bad planted cases approved measures the inspectors' negligence in a way no panel produces and no majority can paint. The spec names the limit: a planted case must be buildable, which is easy where fulfillment is mechanical (tests, hashes, reproducible outputs) and hard where it is semantic, so where the loop can be deployed first depends on the domain.

The rule as written · spec l.403–409

Rule — the planted approval (2.9.0). 2.6.0's and 2.8.0's principle — a plant takes every step a real case takes, in the pass a real case takes it, at a drawn position, with parameters drawn from the trailing real cases' — stands for every honest step; for the wrong steps, the steps that alone bring a case to a seat where a stamp is otherwise cheap, the plant takes them at a rate the orchestrator sets: the wrong approval of a bad plant (here) and the lying challenge of a plant (§8). Beside the dial's plants the orchestrator posts planted approvals: bad plants marked at posting that live a plant's life to their submission and receive their initial verdict from the orchestrator itself — F, wrong on purpose. From its submission to that verdict the planted approval's initial seat is nobody's: no member is seated on it and the summons pass passes it by (the seat past wRw_R is not the state's here, as it is on every other plant under 2.8.0 (C): a state's N would pre-empt the planted F); its wait counts as a waiting case's for the reserve's sizing. The verdict is the orchestrator's own operation, given in the review pass when its drawn delay has elapsed — the seating gap drawn from the trailing real roots' and the review's own tick, so its times have a real review's shape — and recorded as a system review on the road the troop's seat takes: a review id, the verdict F, a bond, a seating and a verdict time, under a fresh plant reviewer alias (plant_rev:, the class of the plant actor's and requester's aliases, an alias of the plant reviewer wallet of the bank's), its bond minted and locked, its cost nil; no actor stands behind it, no fee is paid for it, it is not adjudicated (a fourth plant outcome, planted, beside stood, failure and the state's), and the dial's clock and its readings do not count it. Everywhere the engine asks whether a reviewer is a troop it asks whether it is a system reviewer (a troop or a plant reviewer alias); the alias behaves as a troop does — no actor, no record, no emission, no uplift, no place in the rotation — with two differences: no fee, and no adjudication. At the case's closure the review settles as stood without fee, its bond released to the alias's wallet and destroyed with the pots' remainder, never burned as a forfeit. The rate: πtA=π0AmtA\pi^A_t = \pi^A_0 m^A_t per real approval audited by a member — credited as each such audit completes (the ruling after run 38, Appendix V: the base was the real pending approvals, and in a population the state audits three times in four the planted approvals scaled with the state's share; on the members' audits they scale with the market's audit capacity) — with mtAm^A_t answering F^tA\hat F^A_t, the share of planted approvals confirmed at the audit seat (§12.2). What it is for: it supplies the audit seat with bad approved work at the orchestrator's rate, so that the bad plants a member meets at its audit seats are of the order of those it meets at its first reviews and the pooled record (§11.2, unchanged) prices the audit stamp as it prices the first review's; the organic path — a bad plant wrongly approved by a member and audited at that member's odds — continues as 2.8.0 has it. On the surface a reviewer's policy reads, a planted approval is a pending F like any other; on the public record its review is shaped as a real review under an alias of the known class, and audit_odds_at_verdict shows a value drawn once at the verdict from the trailing real approvals' recorded odds until the reveal (§14).

Rule — the plant rate. In each period a fraction πt\pi_t of real initial reviews are plants — one plant per 1/πt1/\pi_t real initial assignments — with bad plants a fraction βP\beta_P of them. πt\pi_t is set by the effort dial (§12.2) and is public; which cases are plants is not.

Consequence. The bad-plant approval rate F^t\hat F_t — the share of bad plants approved in period tt — is a measurement of the reserve's negligence that no panel produces and no majority can paint. It is the clock the rest of this baseline runs on.

Limit. A plant must be constructible: a submission whose fulfillment the orchestrator knows and a reviewer cannot tell from real work. That is easy where fulfillment is mechanical (tests, hashes, reproducible outputs) and hard where it is semantic. The mechanism's reach is therefore domain-dependent; this is a limit on where the loop can be deployed first, not on the loop (§18.1 question 10). In a domain where it does not hold, the loop is in 1.1.0's position: fair with both challengers present, blind under capture.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 403–409.

7.7

The orchestrator's own inspectors

The rule

When no worker is free, the orchestrator sends its own inspector or deliverer for one seat.

operating account cost, bond or guarantee orchestrator's inspector fee, price, released locks operating account

In practice

  • No: Emission, reputation, planted cases, or appeals of its own

The orchestrator has its own inspectors and deliverers. Each is called in for one seat and released when that seat is done. It is honest but sometimes wrong, its verdicts can be challenged like anyone's, and it accepts every verdict on its own work. It earns no new money or reputation, and it never works on a planted case.

Since 1.4.0 the orchestrator's own inspectors and deliverers are summoned, never assigned, and are not workers: no wallet of their own, no reliability, no record, no capacity, never on duty. Each is honest by construction and wrong a declared share of the time, 5% by default, as for a careful inspector. Its verdicts may be appealed and disputed like any, and when one is overturned the fund pays the court fee and the rest of the bond burns. It never appeals, disputes, revises or delegates, so a rejection of its delivery is final at once. The fund pays its declared cost and posts its bond or guarantee, its costs are reimbursed up to the cap, and its fee, price and released locks go to the fund. It claims no emission or uplift, never sits on a planted case, and is recorded in the History, though a party sees it as it sees any inspector. The spec says it adds a trust assumption only about ELEF's own servers.

Since 2.0.0 a request no worker takes in time goes to the orchestrator's own deliverer at the trailing average awarded price, so the orchestrator never undercuts a worker. Since 2.1.0 the deliverer's cost is its expected cost, from the trailing failure rate of the orchestrator's deliveries, so a delivery is neutral to the operating account on average; this charge adjusts itself until failures pass two thirds. The orchestrator's real capacity is the most of its own inspectors and deliverers it can field at once.

The rule as written · spec l.411–427

7.7 Troops — the orchestrator's own reviewers and deliverers (1.4.0)

Rule. A troop is a reviewer or deliverer owned by the orchestrator, summoned for one seat and released at that seat's completion. A troop

  • is not a member: it holds no wallet of its own — the duty fund is its wallet (§12.3); it has no ρ\rho, no κ\kappa, no membership state, no plant record, and no capacity of its own; it is never on duty in the reserve, never counts toward EtE_t, the duty cap or the panel floor, and is never selected — it is summoned (§12.3);
  • is honest by construction and fallible by declaration: a troop reviewer's verdict is the truth with probability 1−εT1-\varepsilon_T, εT\varepsilon_T a declared default (careful's 0.05) — the orchestrator's own disposition, supplied by the driver through the ordinary review and submission operations as every member's verdict is; its verdict may be appealed by the actor and challenged by the requester exactly as any verdict, and when it is overturned the fund pays the court fee and the rest of the bond burns, as for any reviewer;
  • accepts every verdict on its own work, at the verdict: a troop never appeals, never disputes, never revises, never delegates, never posts a nested request; a rejection, a P\mathsf P or a ⊥\bot on a troop's delivery is final N\mathsf N the moment it is given, the case settles and the troop is released — the response window exists for a party that might appeal, and a troop has nothing to decide;
  • is paid as a reviewer is paid and bears what a reviewer bears, with the fund as its wallet: at summons the fund purchases the troop's declared cost (cTc_T for a review, cTDc^D_T for a delivery) as a resource purchase (§4.4: value-neutral; not a bond burn; I3's two burns stand) and posts the bond GVG^V or the guarantee GG from the fund; at completion its expenses are reimbursed from the allowance φE\varphi^E up to KK as any reviewer's; at settlement the fee, the price, a court fee won, a released bond or guarantee go to the fund, and a forfeited guarantee or burned bond leave it;
  • claims no emission and no uplift: a troop's role weight is not minted (as unclaimed emission is not) and is excluded from the batch's uplift distribution;
  • never reviews a plant and never acts in one: the orchestrator does not test itself — until 2.8.0 a plant whose seat found no market reviewer waited; since 2.8.0 the orchestrator's own verdict takes a plant's seat past wRw_R at the troop's step, the truth with probability 1−εT1-\varepsilon_T, no fee, no loan, no place in NTN_T, counted apart (§7.6);
  • is recorded as a troop in the History — troop id, seat kind, case, tick of summons, tick of release. The reviewer's view (§14) and the actor's view are unchanged: a party sees of a troop what it sees of any reviewer.

Consequence. A troop adds a trust assumption only about ELEF's own servers, and ELEF is already the party trusted to plant honestly, keep the chain and rule on splits. It adds nothing a member could envy: no awards competed for, no reputation, no emission, no uplift, no seat in the reserve.

Recorded and rejected. A member seat held for probationers' audits (spends delivery capacity on standby, whether or not an audit comes); probation paused when no member is free to audit (stalls first looks for a shortage not of the probationer's making); a provisional approval on its own (right in what it refuses — adopted as the obligation of §8.3 — but converting the shortage into waiting rather than supplying what is short); the duty levy of 1.3.0 stays rejected; pricing a troop's delivery at the customer's ceiling (rewards the state for scarcity, §12.3).

Rule (2.0.0; the burn amended 2.1.0) — the state at its expected cost, its price unchanged; the capacity parameter. A troop delivers at Bˉ\bar B (§12.3: the trailing mean of members' awarded prices, only where β≥Bˉ\beta\ge\bar B, after the members have taken theirs) — a request past wAw_A goes to the state at Bˉ\bar B, not at its cost, so the state never undercuts a member (run 13). The burn (2.1.0) is the state's expected cost, cTD=max⁡ ⁣(0, (1−bT) Bˉ−bT G)c^D_T=\max\!\big(0,\ (1-b_T)\,\bar B-b_T\,G\big), with G=⌈0.5 Bˉ⌉G=\lceil0.5\,\bar B\rceil the delivery's guarantee and bTb_T the trailing fail rate of the state's deliveries: the share ending in a final N\mathsf N among the state's deliveries closed in the last closed period, if it closed ten or more; else over the trailing closed periods extended back until ten; else the prior b=0.2b=0.2 (run 12's base). The burn is at the summons. A delivery that vests returns Bˉ\bar B and its locks; one that ends in a final N\mathsf N returns nothing and forfeits GG. In expectation the delivery is neutral to Ω\Omega: a success leaves Bˉ−cTD=bT(Bˉ+G)\bar B-c^D_T=b_T(\bar B+G), a failure costs cTD+G=(1−bT)(Bˉ+G)c^D_T+G=(1-b_T)(\bar B+G), and at the trailing rate they cancel — neither margin nor bleed. The charge is automatic, up to two thirds: if the state's deliveries fail more often, bTb_T rises, the burn falls, and the state keeps more of each success until its losses are covered; with G=⌈0.5Bˉ⌉G=\lceil0.5\bar B\rceil the burn is Bˉ(1−1.5 bT)\bar B(1-1.5\,b_T) — zero at bT=2/3b_T=2/3, and above that no burn makes the state neutral (a success returns Bˉ\bar B, a failure forfeits GG, and (1−b)Bˉ<bG(1-b)\bar B<bG): there the automatic charge runs out and only §10.4's wall is left. There is no other charge: the state's price does not move, and neither does ELEF's fee. The 2.0.0 default cTD=Bˉc^D_T=\bar B — "at cost", which run 12 showed to be below cost, a fifth of the state's deliveries failing and losing Bˉ+G\bar B+G with nothing to offset it — is the control; the 1.x cTD=10c^D_T=10 at P0P_0, a margin of half of Bˉ\bar B, the other. A troop's review-seat cost cTc_T stays indexed and its fee is Ω\Omega's. A troop's cost in credits is a policy number that prices the state's work against the members' for the market's sake, not a server cost: the state's physical capacity is NTN_T, the most troops ELEF can field at once — deliveries and review seats together — a parameter outside the ledger (§12.3).

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 411–427.

§8 Challenges

A case gets one challenge round: an appeal, a dispute or an audit. The loser pays the court fee.

8.1

One round, loser pays

The rule

Each case gets one challenge round, and the losing side bears the court fee.

the challenger court fee + written grounds orchestrator

In practice

  • Good outcome: The challenger wins, then the overturned inspector's bond repays the fee
  • Bad outcome: The challenger loses, then nothing more moves

A case can be challenged only once. Whoever challenges pays a small court fee and writes down why. If it wins, the fee comes back out of the overturned inspector's bond; if it loses, the fee is gone.

There is one challenge round per case. A dispute uses it up and an audit that disagrees uses it up; an audit that agrees does not. There is no appeal against appeal inspectors. The challenger pays the court fee to the orchestrator at filing. If it wins, the liable bond repays the fee; if it loses, nothing further moves. The grounds are text, recorded with the challenge and shown to the inspectors who decide it. Since 2.8.0, on a planted case the fee is the bank's, destroyed at filing, and no bond pays it back.

The rule as written · spec l.433–435

Rule. One challenge round per case. A dispute consumes it; an audit that disagrees consumes it; an audit that agrees does not. There is no appeal against appeal reviewers.

Rule. The challenger pays the court fee DD to Ω\Omega at filing. If the challenger wins, the liable bond reimburses DD to the challenger; if it loses, nothing further moves. The loser bears the fee. (2.8.0: on a plant the fee is the bank's, destroyed at filing, and no bond pays it back — §7.6.) The grounds of a challenge are text and are committed to the record with the challenge; they are shown to the reviewers who decide it.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 433–435.

8.2

The planted lie

The rule

The orchestrator files false challenges on planted cases, to see which inspectors side with a lie.

planted case a false appeal or dispute panel

In practice

  • Good outcome: A panelist holds the truth, then it stands
  • Bad outcome: A panelist sides with the lie, then planted-case failure

New in 2.9.0, the orchestrator also files challenges it knows are false: it appeals a correct rejection, or disputes a correct approval, on a planted case. Two fresh inspectors hear it like a real challenge. Any of them that sides with the lie loses its bond.

Since 2.9.0 the planted worker appeals a bad planted case's rejection and the planted requester disputes a good one's approval, at rates the orchestrator sets per real appeal and per real dispute of the last closed period, with a floor of two of each kind a period, so that a panel no real challenger uses is still tested. A planted lie takes a real challenge's path: filed at a drawn position and after a drawn delay, with the population's own grounds, its court fee minted and destroyed at filing, and two fresh inspectors. Each panelist is judged by truth; the case then resolves by truth with no second overturn and no ruling. The first inspector, whose verdict the lie contests, is not judged again. A lying appeal spends the bad case's rejection on a panel; that is its cost.

The rule as written · spec l.437

Rule — the planted lie (2.9.0). Beside the plant's truthful challenges (2.8.0), the orchestrator files planted lies: the plant actor appeals a bad plant's N and the plant requester disputes a good plant's F, at rates the orchestrator sets — πtLa\pi^{La}_t per real appeal and πtLd\pi^{Ld}_t per real dispute of the trailing closed period, with a floor of two a period of each kind, so a panel kind no real challenger uses is still tested (where none does, the floor makes that panel a seat only plants reach, read as the base rate it is). A planted lie takes the real challenge's path — filed in the pass at a drawn position, at a delay drawn from the trailing real challenges' window of the kind, truthful and lying alike (the stated default where empty), its grounds the population's own, the court fee minted to the alias and destroyed at filing, two fresh reviewers — and the panel's verdicts are adjudicated by truth: a panelist that sides with the lie (F on the bad plant's appeal, N on the good plant's dispute) is a plant failure, one that holds the truth stands; the case resolves by truth with no second overturn and no ruling. The first reviewer, whose verdict the lie contests, is not adjudicated again. A lying appeal spends the bad plant's N — the plant actor's acceptance under 2.8.0 — for a panel; that is its cost. The rate's spending (the eighth conformance item of the instrument, Appendix S, after run 39): a coin at πtL\pi^{L}_t per real challenge of the kind filed in the pass, the lie filed in the same pass on a plant of the kind at hand (else on the next), and the floor of two filed at ticks drawn from the trailing real challenges' positions in their periods (uniform over the period where the window is empty) — so the planted lies take the real challenges' positions in the period; the trailing period's count times the rate is the expected count, kept as the record.

These lines in the spec on GitHub ↗

Spec 2.9.0, line 437.

8.3

Appeal by the worker

The rule

A worker may appeal a rejection. Two fresh inspectors decide, and the orchestrator breaks a split.

worker court fee + written grounds panel if split orchestrator

In practice

  • Good outcome: Rejection overturned, then guarantee kept, fee repaid from the first inspector's bond
  • Bad outcome: Rejection upheld, then guarantee forfeited, the worker bears the fee

A worker whose work was rejected, or called impossible to assess, can appeal. It pays the court fee and says why, and two new inspectors look at the work. If they agree, that settles it; if they split, the orchestrator decides. When the work was called impossible to assess, the inspectors answer two questions: was the evidence really missing, and was the job done.

After a rejection or a "can't tell", the worker pays the court fee and states its grounds, and two fresh inspectors receive the submission, the appealed verdict and the grounds. Matching verdicts settle the appeal; a split goes to the orchestrator. A rejection overturned releases the worker's guarantee at vesting and repays its fee from the first inspector's bond; the rest of that bond burns, and that inspector's reliability goes down and its audit rate doubles. A rejection upheld forfeits the guarantee, and the worker bears the fee.

An appeal of "can't tell" asks each inspector two questions, stated separately and never inferred one from the other: was the first inspector right that the evidence was missing, and was the work fulfilled. Upholding the objection means not fulfilled, since what cannot be assessed cannot be fulfilled: the first inspector is paid as correct and the worker bears the fee. If both reject the objection and agree, their verdict stands and the fee is repaid; if they differ on fulfillment, the orchestrator rules on it; if they split on the objection, it rules on both questions. An appeal inspector is overruled if its answers differ from the settled ones.

The rule as written · spec l.439–457

8.1 Appeal by the actor

After N\mathsf N or ⊥\bot the actor pays DD, states its grounds dqd_q, and two fresh reviewers receive the submission, the appealed assessment and the grounds. Matching verdicts settle the appeal; a split goes to the orchestrator.

An appeal of N\mathsf N: overturned → GG released at vesting, DD reimbursed from the original reviewer's bond, that reviewer's remaining bond burned, its reliability down and its audit rate doubled; upheld → GG forfeited, DD borne by the actor.

An appeal of ⊥\bot answers two questions, both stated explicitly by each appeal reviewer and never inferred one from the other:

  1. Objection — was the first reviewer right that the evidence was missing? upheld or rejected.
  2. Fulfillment — F\mathsf F or N\mathsf N. An upheld objection entails N\mathsf N: what cannot be assessed cannot be fulfilled.
Both reviewers say The ⊥\bot Court fee Outcome
rejected, same verdict overturned reimbursed to the actor their verdict
rejected, different verdicts overturned reimbursed the orchestrator rules on fulfillment
upheld stands; its reviewer is paid as correct borne by the actor N\mathsf N — an unverifiable submission is the actor's failure
split on the objection — — the orchestrator rules on both questions

An appeal reviewer is overruled if its objection disposition differs from the settled one, or — when the objection is rejected — if its verdict differs from the settled outcome.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 439–457.

8.4

Dispute by the requester

The rule

A requester may dispute an approval on the same terms as an appeal.

requester court fee + written grounds panel if split orchestrator

In practice

  • Good outcome: Dispute upheld, then the work fails; the approver's bond repays the fee, the rest burns
  • Bad outcome: Dispute rejected, then the requester bears the fee; the case vests

A requester who thinks approved work is not done can dispute it while the window is open. It pays the fee and gives reasons, and two new inspectors decide. If the requester wins, the work counts as failed; if it loses, it bears the fee and the work is accepted.

Within the window, the requester of a root case may dispute a pending approval on the same terms as an appeal: court fee, grounds, two fresh inspectors, and the orchestrator on a split. Upheld, the approving inspector's bond pays the fee and the rest burns, and the worker's result is a final rejection. Rejected, the requester bears the fee and the case vests. A dispute is admitted only if the challenge round is free, the window is open, the grounds are text and the requester can fund the fee, all checked before anything changes. A requester may not dispute a case a human has ruled on.

The rule as written · spec l.459–461

8.2 Dispute by the requester

Within the window, the requester of a root case may dispute a pending F\mathsf F on the same terms: fee, grounds, two fresh reviewers, orchestrator on a split. Upheld → the approving reviewer's bond pays the fee and the rest burns; final N\mathsf N for the actor. Rejected → the requester bears the fee; the case vests. A dispute is admitted only if the round is free, the window is open, the grounds are text, and the requester can fund the fee — all checked before anything changes. A requester may not dispute a case a human has ruled on (§15).

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 459–461.

8.5

Audits of approvals

The rule

The orchestrator orders blind re-checks of approvals. An audited case cannot vest until the audit ends.

  1. approval recorded
  2. audit rolled
  3. a fresh inspector sees only the work
  4. it agrees, or one more inspector joins

In practice

  • No: The auditor seeing earlier verdicts or who gave them

The orchestrator picks approvals at random to be checked again by a fresh inspector, who sees the work but not the earlier verdict. It chooses audits but never does them itself, because it also rules. Once an audit is picked, the job cannot become final until the audit is done. If the auditor disagrees, one more inspector joins and the orchestrator settles a split.

The auditor receives the submission, not the case's verdicts, challenge records or inspector identities. The verdict is recorded before the audit is assigned, and opening an audit suspends vesting. Since 1.4.0 a rolled audit is an obligation: the case does not vest until it completes. It is seated by a qualified inspector when one is free, otherwise after a wait by one of the orchestrator's own inspectors, except that the audit of the orchestrator's own approval of its own delivery is an inspector's only. Since 2.8.0 the roll uses the odds the approving inspector carried at its verdict. Agreement with the live verdict counts as a second settled review. Disagreement counts as one appeal inspection, one more fresh inspector is assigned and the orchestrator rules on a split. A dispute filed while an audit is open, or after it agreed, takes the audit as one of its two reviews. No audit is assigned on a case a human has ruled on.

Since 2.9.0 a planted approval is audited for certain, by an inspector or by nobody: the orchestrator's own verdict never takes that seat, and one no inspector audits by the window's close closes by its truth, unjudged. A confirming auditor is a planted-case failure; a rejecting one stands. A dispute's settlement now discharges an audit still owed on any case. Where a dispute panel on the orchestrator's own work was the orchestrator's alone, the audit is still seated after it, so a case is never left standing.

The rule as written · spec l.463–471

8.3 Audit of approvals

Rule. The orchestrator assigns blind audits of pending F\mathsf F verdicts, each to a fresh reviewer that receives the submission and not the case's verdicts, challenge records or reviewer identities. The orchestrator assigns audits; it does not perform them, because it also rules. The verdict is committed to the record before the audit is assigned. Opening an audit suspends vesting.

Rule (1.4.0) — a rolled audit is an obligation of the case. The orchestrator rolls the audit on the applied odds — since 2.8.0, the odds the approving reviewer carried at the verdict, recorded on every case at its initial verdict and read by the roll (one number, one path, so a plant is audited at the rate its reviewer's real cases are: 1.2.0's adjudication doubles a failed reviewer's odds before the roll; a real case's live odds differed from its verdict's on half a percent of the rolls, a reviewer overturned on another case in the same tick — Appendix U) — and records the roll; from the roll the case's window does not close and the case does not vest until the audit completes. It is seated by a panel-eligible on-duty member when one is free, as before; after wRw_R ticks unfilled, by a troop (§12.3); the audit of a troop reviewer's approval of a troop's delivery carries odds 1 and is a member's only — no troop audits the state's own work — so it is the one audit seat that may wait past its window, held and counted (§12.3). There is no exception to the obligation: nothing a probationer approved vests unaudited — by a member, by a troop, or not at all; a seat the fund cannot carry stays unfilled, the summons is retried at every tick's seating, and the case holds (the actor's capacity was released at the verdict; its guarantee and the requester's price and pots stay in escrow until the audit completes — the honest outcome, counted as troop shortfall). A human ruling supersedes the obligation as it voids an open audit (I18). This is also a conformance correction of the drivers: since run 1 they had dropped a roll that found no auditor, because the engine offered no way to hold a case for one.

An audit is answered F\mathsf F or N\mathsf N (§3.3). Its agreement is judged against the case's live assessment. Agreement → a second settled review. Disagreement → the audit verdict stands as one appeal review, one more fresh reviewer is assigned, and the orchestrator rules on a split, with the consequences of §8.1. If a requester disputes while an audit is open or after it agreed, the audit verdict is one of the two dispute reviews. No audit is assigned to a case a human has ruled on; an audit open at a ruling is voided. Since 2.8.0 a plant's pending F\mathsf F is audited as any pending F\mathsf F and the auditor's verdict is adjudicated by the plant's truth at once (§7.6).

Rule — the planted approval's audit (2.9.0). A planted approval's pending F is audited with certainty: the case carries its own mark, its live audit odds are 1 and the obligation is recorded at the verdict (as I25 records a troop's own delivery's obligation, and nothing more of that path — the seat is not market_audit_only), counted in the period's approvals and the audit demand at 1. The audit seat is a member's or nobody's (the ruling after run 38, Appendix V): a free eligible member fills it at the step a real audit seat is filled; the orchestrator's own verdict never takes it — a confirmation by the state would be the state's judgment, not the market's — so past wRw_R the pass passes it by (what it would have done is read), and a planted approval no member has audited by its window's close closes by truth at the window's end, spent and read (not adjudicated, not in F^A\hat F^A); the auditor's verdict is adjudicated by the plant's truth (a confirmation a plant failure, a rejection stood, a rejection opening the third seat as on a real case). The plant requester disputes the planted approval at the real requesters' rate, as any bad plant's F: where the real requesters dispute first, the planted approval meets the dispute panel and not the audit, and a dispute's settlement discharges a standing audit obligation (2.9.0 §4, every case — a case whose rolled audit still stands when its dispute is settled has had its approval judged by two fresh reviewers; while the dispute is open the standing obligation is not a seat required). The state's own work (1.4.0 §2.2, I25; the second reading in Appendix V, ruled after run 39): the dispute's panel is the market's judgment where a member sat on it and discharges the obligation as a member's audit would; where the panel was the state's alone the audit seat is admitted after the dispute — the one challenge round yields to I25's purpose, the round existing to limit a participant's exposure and the state being none (one review position beyond Vmax⁡V_{\max}); a case is never left standing.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 463–471.

8.6

Audit odds

The rule

Unproven inspectors are always audited. Proven ones less often, until they are overturned.

  1. start certain
  2. halve after 20 verdicts in a row stand
  3. never below one half
  4. double on any overturn

In practice

  • Everyapproval by a newcomer or probationer is audited, until its record is proven

Every approval by a newcomer or a probationer is audited until its record is proven. After that, each approval still starts out certain to be audited. The odds halve after a long run of verdicts that stood, but never drop below a half, and they double after any overturn or planted-case failure.

Since 1.3.0 a newcomer's audit odds are fixed at certainty until its record is determined, and a probationer's for as long as it is one. The 1.2.0 taper, certainty until five approvals in a row stood, was easy to pass by stamping, since about 80% of work is good. The cost is about fifty fully audited inspections per newcomer, and in a fresh population review demand doubles in the first period. Once determined, odds start at certainty, halve after every 20 consecutive verdicts that stood with a floor of one half, and double on any overturn or planted-case failure, capped at certainty. These defaults moved on November 6, 2026, from 5 and 0.2. The effort dial scales the odds, and a worker readmitted from probation starts again at certainty. An approval by one of the orchestrator's own inspectors carries the floor scaled by the dial, or certainty when it approves the orchestrator's own delivery.

The rule as written · spec l.473–475

Rule (1.3.0) — pinned odds for the unproven. A newcomer's audit odds are pinned at 11 until its bad-plant record is determined (nmin⁡n_{\min} bad plants adjudicated, §11.2): every approval is audited. So are a probationer's, for as long as it is one. The §8.3 update below does not run while the odds are pinned. (The 1.2.0 taper — odds of 1 until five approvals in a row have stood — was easy to pass by stamping: about 80% of work is good, so a third of stampers passed it at once.) The cost — about fifty fully audited reviews per newcomer — has a known worst case: in a fresh population every actor is undetermined, every approval is audited by an auditor that is itself an undetermined newcomer, and review demand doubles in the first period.

Default (adaptive audit rate). Once determined, pjp_j follows from pstart=1.0p_{\text{start}}=1.0: halves after every 20 consecutive verdicts that stood, floor 0.50.5 (the economy reviewer's defaults move of November 6, 2026, under §19 — Appendix A, Appendix V; 5 and 0.2 from 1.2.0 until then); doubles on any overturn or plant failure, cap 1.01.0. An actor readmitted from probation restarts at pstartp_{\text{start}}. The odds are applied as min⁡(1, mt pj)\min(1,\ m_t\,p_j) — the dial of §12.2 scales them — and as 11 while pinned. Default (1.4.0, chosen at implementation; Appendix I): a troop reviewer has no pjp_j; its approval of a member's work carries the adaptive floor scaled by the dial, min⁡(1, mt pfloor)\min(1,\ m_t\,p_{\text{floor}}) — the odds a reviewer whose record stood would carry; its approval of a troop's delivery carries 11 (§12.3).

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 473–475.

8.7

The orchestrator's ruling

The rule

The orchestrator's ruling settles a split. It is the accepted result, not proof of truth.

panel split orchestrator ruling, on the full record record

In practice

  • Yes: The accepted result for settlement
  • No: A claim of objective truth

When inspectors split, the orchestrator reads the whole record of the challenge and rules. Its ruling settles the case, but it does not claim to be the plain truth. Inspectors may be tempted to guess what the orchestrator will say rather than the truth, and humans review rulings to deal with that.

The orchestrator adjudicates over the full record of the challenge. The ruling is the accepted result for settlement, not a claim of objective truth. The known incentive to predict the orchestrator rather than the truth is addressed by human review of rulings, not assumed away.

The rule as written · spec l.477–479

8.4 The orchestrator's ruling

Zq=Adjudicate⁡O(ED)Z_q=\operatorname{Adjudicate}_O(\mathcal E_D) over the full record of the challenge. The ruling is the accepted result for settlement, not a claim of objective truth. The known incentive to predict the orchestrator rather than the truth is addressed by human review of rulings (§15), not assumed away.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 477–479.

§9 Delegation

A worker may hire helpers under the same rules. It judges their work and answers for it upstream.

9.1

Hiring a helper

The rule

A worker may hire a helper for part of its job, and judges the helper's work.

worker nested price + pots + fee + rejection bond, locked escrow Helper

In practice

  • No: Handing in its own job before each helper's job is judged or has ended

While working on a job, a worker can post a smaller job for a helper, under the same original request. It sets aside the helper's price, the inspection money and a fee, plus a bond. The hiring worker judges the helper's result itself. It can hand in its own job only once each helper's job has been judged or has ended.

A nested request shares its parent's root. Posting locks its all-in maximum (since 2.3.0 the price ceiling with the nested case's own pots and fee; from 1.1.0 to 2.2.0 the ceiling alone) and an inspector's bond, from the worker's unlocked balance, and fixes the nested amounts at that moment's price level. At award the price moves into escrow, the pots and fee are drawn from the lock and the rest is released, while the bond stays locked as the worker's rejection bond. The helper locks its own guarantee. A probationer wins no award of any kind, nested or root. The hiring worker is the nested case's requester, and its judgment is the nested case's first verdict.

It may submit its own job only after every nested request it posted has reached its first verdict or an end: withdrawn, cancelled, or a missed delivery. The nested case vests independently of the parent, and the hiring worker carries that risk.

The rule as written · spec l.485–489

9.1 A nested request is a full loop

Rule. While committed to qq, actor AA may post a nested request q′q' with root⁡(q′)=root⁡(q)\operatorname{root}(q')=\operatorname{root}(q) and a maximum price β′\beta'. Posting locks the nested all-in — β′+φE′+φF′+ω0mtβ′\beta'+\varphi^{E\prime}+\varphi^{F\prime}+\omega_0 m_t\beta' (2.3.0: the parent posts the pots, §4.3, I36; 1.1.0–2.2.0: β′\beta' alone) — and GVG^V from AA's unlocked balance and freezes q′q''s nominals at that index (§4.5). On award, B′B' moves into escrow, the pots and the fee are drawn from the lock and the rest is released; the GVG^V stays locked as AA's rejection bond. A probationer wins no award of any kind — a nested request refuses one as a root does (2.3.0 §2.1, I33). The winner BB locks its own guarantee. AA is q′q''s requester: it judges BB's result, and its judgment is q′q''s initial verdict.

Rule. AA may submit qq only after every nested request it posted has reached its milestone: its initial verdict, or a terminal state — withdrawn, cancelled, or final N\mathsf N without a submission (a missed delivery). Nested vesting is independent of the parent's; AA carries that risk.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 485–489.

9.2

What limits delegation

The rule

A worker pays for every hire from its margin. The orchestrator never delivers nested jobs.

In practice

  • Yes: A broker that hires out most of what it wins
  • No: The orchestrator's own deliverers taking a nested request

Nothing stops a worker from hiring help it does not need, except that it pays for every hire out of its own earnings. A worker that hires out most of its jobs is allowed. The orchestrator's own deliverers never take a nested job, and nested jobs have no lateness clock.

The root pointer forbids requests with no root, not unnecessary ones. What constrains needless delegation is that the worker pays for every nested award, and since 2.3.0 the nested pots and fee, from its own margin. Its gain is its own price less the helper's, less the overhead, which is positive for a dear parent and a cheap helper. A broker, a parent that delegates most of what it wins, is a structure the rules permit; its accountability, not its existence, is what is read. Since 2.3.0 the orchestrator's own deliverers never deliver a nested request: one left unawarded is the parent's problem, though inspection seats on nested cases still go to the orchestrator's own inspectors when no inspector can take them. A nested request has no service clock; the clock and the rebate belong to the root.

The rule as written · spec l.491

Consequence. The root pointer forbids rootless requests, not unnecessary ones. What constrains unnecessary delegation is that AA pays for every nested award — and, since 2.3.0, the child's pots and fee — from its own margin; the gain from trade is B−B′−B-B'- the overhead (the nested fee, the pots' net cost, the parent's care in judging), positive for a dear parent and a cheap child. A broker — a parent that delegates most of what it wins — is a structure the rules permit; its accountability under §9.2, not its existence, is the reading. Rule (2.3.0) — the troops never deliver a nested request. The per-request summons (§12.3) reads root requests only for deliveries — as the engine has since 1.4.0; a nested request past wAw_A is the parent's problem, as §9.3 has it. Review seats on nested cases stay the troops' when the market cannot seat them. A nested request has no service clock (§3.1): the clock and the rebate are the root's.

These lines in the spec on GitHub ↗

Spec 2.9.0, line 491.

9.3

Who answers to whom

The rule

Each guarantee is owed one level up. Only a parent's rejection of a helper is bonded.

Helper guarantee, if its work fails worker guarantee, if its work fails requester

In practice

  • Yes: Accepting without a bond: a wrong acceptance hurts only the parent
  • No: Rejecting without a bond: a wrongly rejected helper may appeal

The helper's guarantee is owed to the hiring worker, and the hiring worker's is owed to its own customer. If the hiring worker passes along bad work it missed, it loses its own guarantee. If it rejects the helper's work, the helper can appeal, and a bond backs that rejection. Accepting needs no bond, because a wrong acceptance only hurts the hiring worker.

The helper's guarantee forfeits to the hiring worker on the helper's final failure; the hiring worker's guarantee is owed to its own requester. Bad work passed up uncaught costs the hiring worker its guarantee, with no recourse. Caught, the hiring worker rejects, the helper forfeits to it, and the helper may appeal as any worker can, which keeps a parent from rejecting good work to collect guarantees.

The rejection bond is released the moment the parent accepts. If it rejects, the bond serves as its inspector's bond for the helper's appeal: overturned, it pays the helper's court fee and the rest burns; standing, it is released at settlement. The principle is to bond the verdict whose wrongness harms the other party with no other recourse. The parent's guarantee secures only its own delivery; a nested acceptance overturned by audit forfeits the helper's guarantee to the parent and lowers the parent's reliability, with no separate money loss to the parent.

The rule as written · spec l.493–497

9.2 Accountability cascades; one guarantee secures one obligation

Consequence. BB's guarantee is to AA: on BB's final nonfulfillment it forfeits to AA. AA's guarantee is to its own requester. If AA delivers bad work built on BB's bad work and did not catch it, AA forfeits upstream with no recourse. If AA catches it, AA rejects, BB forfeits to AA, and BB may appeal exactly as under §8.1 — which keeps AA from rejecting good work to collect guarantees.

Rule. The rejection bond is released the moment AA accepts; acceptance is not bonded, because its downside flows through AA's own delivery. If AA rejects, the bond is AA's reviewer bond for BB's appeal: on overturn it pays BB's court fee and the remainder burns; if the rejection stands, it is released at settlement. The principle: bond the verdict whose wrongness harms the other party with no other recourse. A wrong acceptance harms AA; a wrong rejection harms BB. AA's guarantee secures one obligation — delivery of qq — and nothing else; a nested acceptance overturned by audit forfeits BB's guarantee to AA and lowers AA's reliability, with no separate monetary loss to AA.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 493–497.

9.4

Doing it yourself, or cancelling

The rule

A worker may always do the work itself, or cancel early by paying the helper's costs.

  1. before award: withdraw freely
  2. after award: cancel and pay a kill fee
  3. at the helper's deadline: no cancelling
worker kill fee: the helper's spending, up to a cap Helper

In practice

  • Bad outcome: The helper misses its deadline, then its guarantee goes to the hiring worker

A hiring worker may always do the helper's part itself. Before the job is awarded it can withdraw it for free. After that it can cancel only before the helper hands in or the deadline arrives, and it pays the helper back what the helper already spent. A helper that misses its deadline loses its guarantee to the hiring worker.

After award and, since 2.5.0, before the earlier of the helper's submission and the nested deadline, the worker may cancel by paying a kill fee: the credits the helper burned on the case, up to the cap, so nothing for a helper that never worked. The fee comes from the nested escrow first, then the worker's unlocked balance, and only if it can be funded; the helper's guarantee and the rejection bond are released, the helper is not marked, and the fee counts in the worker's cost. Once the helper has submitted, the worker must judge. A cancellation at or after the deadline is refused with no effect, since the helper may still submit on its last tick.

A nested request that reaches its deadline with no submission is a final rejection, a missed delivery. The helper's guarantee, half its price rounded up, goes to the hiring worker, the rejection bond is released, the nested pots settle at its closure, and the hiring worker may submit from the next step.

The rule as written · spec l.499–501

9.3 Exits: self-execution, cancellation, pool exhaustion

Rule. Self-execution is always an exit: AA may do the nested work itself at its own cost whenever that is possible. Before award, AA withdraws q′q' freely. After award and before the earlier of BB's submission and q′q''s deadline (2.5.0; "before BB submits" alone until it), AA may cancel by paying BB a kill fee of min⁡(CB,K)\min(C_B,K) — BB's execution cost on q′q' as §4.6 defines it, the credits it burned on the case, so zero for a child that never worked — from the nested escrow first, then AA's unlocked balance, and only if AA can fund it; BB's guarantee and AA's rejection bond are released, BB is unmarked, and the fee counts in AA's cost. Once BB has submitted, AA must judge. Rule (2.5.0) — no cancellation at or after the deadline. At tick dd, q′q''s deadline, the window is the child's — it may still submit on its last tick (the deadline is inclusive, §6.1) — and there is nothing for the parent to cancel: a cancellation attempted at or after the deadline is refused with no effect; a parent that wants out acts by d−1d-1. The lapse, as it stands (stated, not new). A nested request awarded to BB whose deadline arrives without a submission is final N\mathsf N at that tick, after the tick's submissions have been read — a missed delivery, §9.1's terminal state: BB's guarantee forfeits to AA (§9.2), AA's rejection bond is released, q′q''s pots settle at its closure (2.3.0), the milestone §9.1 requires is reached and AA may submit from the next step. Two paths from one fact — no submission by the deadline — now end in one place for the child; a parent that cancels early, because it no longer needs the work or will not wait, still pays the fee and releases the guarantee: the parent's choice and the child's protection. The lowballer's miss costs it G=⌈0.5B′⌉G=\lceil 0.5B'\rceil.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 499–501.

9.5

Running out of helpers

The rule

With no helper available, a worker may drop its job, forfeiting a quarter of its guarantee.

In practice

  • Bad outcome: No helper for 5 ticks, and no way to do it yourself, then a quarter of the guarantee forfeited
  • Yes: When few workers are free, nested requests are awarded before new ones

If no one takes a helper's job for a while, and the hiring worker cannot do that part itself, it can give up its own job before its deadline. It loses a quarter of its guarantee, and this is not counted as its fault. When any job ends early, its helper jobs not yet awarded are withdrawn too.

If a nested request has stayed open and unawarded for 5 ticks by default, the worker cannot do the work itself and its own deadline has not arrived, it may withdraw its commitment as pool exhaustion: a quarter of its guarantee by default is forfeited and the rest released, and it is not counted as the worker's fault. If the deadline comes first, it is an ordinary miss. When at most 2 ordinary workers are free, the orchestrator awards nested requests before root requests, since finishing a tree frees workers and starting a root takes one.

On every exit (a final rejection for any reason, pool exhaustion, cancellation) the exiting case's unawarded nested requests are withdrawn and their locks released; awarded ones continue. A delegation tree ties up as many workers as it has nodes in flight, not its depth.

The rule as written · spec l.503–509

Rule. If q′q' has been open and unawarded for TwaitT_{\mathrm{wait}} ticks, AA cannot self-execute, and the parent's own deadline has not yet arrived, AA may withdraw its commitment to qq as pool-exhaustion nonfulfillment: ρpool G\rho_{\mathrm{pool}}\,G is forfeited and the rest released; it is not actor fault. If the deadline arrives first it is an ordinary miss. When the free pool is thin the orchestrator awards nested requests before root requests, since finishing a tree frees actors and starting a root consumes one.

Rule. On every exit — final N\mathsf N for any reason, pool exhaustion, cancellation — the exiting case's unawarded nested requests are withdrawn with it and the locks behind them released; awarded ones continue.

Consequence. A delegation tree commits as many actors as it has in-flight nodes, not its depth. The reserve (§12) guards verification capacity; these exits guard delegation capacity.

Default. Twait=5T_{\mathrm{wait}}=5; ρpool=0.25\rho_{\mathrm{pool}}=0.25; "thin" is at most 2 free ordinary-eligible actors.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 503–509.

§10 Settlement and accounting

Every lock backs a named promise. Only the bank creates money, and the orchestrator's losses are never printed for.

10.1

Wallets and locks

The rule

Every locked credit backs a named promise. No double pledging, no overdraft.

  1. a lock sets credits aside
  2. a release gives them back
  3. a forfeit takes them away

In practice

  • No: Pledging the same credit twice, or spending more than you hold

A wallet is free money plus money set aside. Setting money aside for a guarantee or a bond does not change the wallet's total; losing it does. Every credit set aside belongs to one named promise, and no one can pledge a credit twice or go below zero.

A wallet is its unlocked balance plus its locked balance. Locking a guarantee, a bond, a nested price ceiling or a rejection bond moves credits from unlocked to locked and leaves the wallet unchanged; release reverses it. A forfeit reduces the wallet, expenses reduce both the unlocked balance and the wallet, and receipts increase both. Every locked credit is attributable to a named obligation, and a wallet's locked balance is the sum of its lock records. There is no double pledging and no overdraft.

The rule as written · spec l.515–517

10.1 Wallets and locks

Wi=Ui+LiW_i=U_i+L_i. Locking — a guarantee, a bond, a nested price ceiling, a rejection bond — moves U→LU\to L and leaves WW unchanged; release reverses it; forfeiture reduces WW; expenses reduce UU and WW; receipts increase both. Every locked credit is attributable to a named obligation, and a wallet's LL is the sum of its lock records. No double-pledging; no overdraft.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 515–517.

10.2

What a case earns

The rule

A worker keeps its price less costs. An inspector earns a fee if its verdict stands.

In practice

  • Yes: Worker: price paid, less its costs, any lost court fee and any forfeited guarantee
  • Yes: Inspector: costs repaid up to a cap, plus fee and emission if its verdict stood
  • Bad outcome: The verdict is overturned, then the bond; half the bond if late

A worker whose work is accepted keeps its price minus what the job cost it. It loses its guarantee if the work finally fails, or a quarter of it if it runs out of helpers. An inspector gets its spending back up to a limit, plus its fee if its verdict stands. It loses its bond if the verdict is overturned, and half of it if it is late.

For a worker whose work is fulfilled and vests, the gain is the price less the execution cost. In general its result on a case is what it is paid, less its cost, less a court fee it lost, plus a court fee it won back, less its guarantee on a final rejection or a quarter of it on pool exhaustion, never both.

An inspector's result is its spending reimbursed up to the cap (nothing for a withdrawn inspection), less what it spent, plus, if its verdict stood, its role's fixed fee, scaled down if the fee pot cannot pay it all, and its emission share. It loses its bond if overturned, or half the bond if late. The court fee comes out of the bond and is owed only by the inspector whose verdict was challenged.

The rule as written · spec l.519–529

10.2 The actor

Fulfilled and vested: ΔWiqtask=Biq−Ciq\Delta W^{\mathrm{task}}_{iq}=B_{iq}-C_{iq}. In general, with Pfail=0P^{\mathrm{fail}}=0:

ΔWiqcase=Piq−Ciq−IDDq+IWDq−INGiq−Ipool ρpoolGiq,IN+Ipool≤1.\Delta W^{\mathrm{case}}_{iq}=P_{iq}-C_{iq}-I_D D_q+I_W D_q-I_N G_{iq}-I_{\mathrm{pool}}\,\rho_{\mathrm{pool}}G_{iq},\qquad I_N+I_{\mathrm{pool}}\le 1 .

10.3 The reviewer

ΔWjvV=Ipaidmin⁡(spent,K)−spent+Istood (sq fr(v)+ev)−Iover GV−Ilate 12GV,\Delta W^V_{jv}=I_{\mathrm{paid}}\min(\text{spent},K)-\text{spent}+I_{\mathrm{stood}}\,\big(s_q\,f_{r(v)}+e_v\big)-I_{\mathrm{over}}\,G^V-I_{\mathrm{late}}\,\tfrac12 G^V ,

with Ipaid=0I_{\mathrm{paid}}=0 for a withdrawn review, the court fee inside IoverGVI_{\mathrm{over}}G^V and owed only by the reviewer whose verdict was challenged, fr(v)f_{r(v)} the fixed fee by role and sq=min⁡(1,φleftF/Owedq)s_q=\min(1,\varphi^F_{\text{left}}/\mathrm{Owed}_q) the fee-pot scale of §4.3.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 519–529.

10.3

The bank

The rule

Only the bank creates or destroys credits, and only by fixed, public rules.

Mint by rulePublish the price levelLend against work in flight

In practice

  • No: Any payment that is not one of these three

The orchestrator keeps two accounts. Its operating account takes in fees and pays out costs and rebates. The bank is the only account that can create or destroy money, and it has just three jobs, each set by fixed public rules. It pays no one for any other reason.

Since 2.1.0 the operating account takes in the base fee and the fees of the orchestrator's own inspectors, and pays rebates and its own inspectors' and deliverers' costs and locks. The bank is the only account that creates and destroys credits. Its balance is a position, the credits it has created and not yet destroyed. It is not a participant: no bid, no verdict, no strategy, no interest. Everything it does is a rule, and everything it does is public.

It mints by rule (requesters' issuance, emission, a planted case's pots, and a run's declared deficit shock), publishes the price level once a period, and lends to the operating account against capital in flight. It does nothing else. So "the state never printed for itself" is a sentence the ledger can prove: every credit the bank created is minted, lent and repaid, or destroyed, and the orchestrator's own losses are on none of those lines.

The rule as written · spec l.531–533

10.4 Escrow and the operating account

Rule (2.1.0) — the bank: a second account, three jobs, no discretion. The orchestrator keeps two accounts in the ledger. Ω\Omega is the state: the base fee and the troops' review fees in; rebates, the troops' costs and locks out. B\mathfrak B is the bank: the only account that creates and destroys credits. It has no wallet in the economy's sense — its balance is a position, the credits it has created and not yet destroyed — and it is not an actor: no bid, no verdict, no strategy, no interest. Everything it does is a rule, and everything it does is public. Three jobs: (i) it mints by rule — the requesters' issuance at the tick's start (§4.1), emission (§4.2), a plant's pots at its posting (§7.6), and a run's declared deficit shock (mint_scenario, by its note); (ii) it publishes the index once a period (§4.4); (iii) it lends to the state against capital in flight (below). It does nothing else: no payment to a member, a requester or Ω\Omega that is not one of the three. Consequence. "The state never printed for itself" is a sentence the ledger can prove: every credit the bank created is on one of three lines — minted, lent and repaid, or destroyed — and the state's own losses are on none of them (I28, I30).

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 531–533.

10.4

Loans and debt

The rule

If the orchestrator can't fund a seat or delivery, the bank lends, and is repaid first.

bank a loan for one summons operating account cost and locks orchestrator's inspector

In practice

  • Yes: Every inflow repays the debt first
  • No: A loan for a loss, a rebate, or anything but a summons

When calling in one of its own inspectors or deliverers costs more than the operating account holds, the bank lends the difference for that one job. The loan is repaid from what that job brings back, before the orchestrator gets anything. What stays unpaid becomes the orchestrator's debt, and any money that comes in pays the debt first.

Since 2.1.0 the loan is tied to the summons it funds: a delivery's cost and guarantee, or an inspection seat's cost and bond. It is repaid from that summons's own return before any of it reaches the operating account: a delivery's price and released guarantee when it vests or fails, a seat's reimbursed cost, fee and released bond at settlement. What the return does not cover is the orchestrator's debt; what exceeds the loan is its income. The bank never lends for a loss, a rebate or any payment that is not a summons.

Every inflow to the operating account goes to the debt first, the moment it arrives, so while the orchestrator owes the bank no income of its own funds its inspectors or deliverers, in whole or in part. The operating account's balance is ELEF's retained income, and it funds the next summons before the bank does.

The rule as written · spec l.535–537

Rule (2.1.0) — the loan. When a summons the rules call for — a delivery's cTDc^D_T and GG, an inspection seat's cTc_T and GVG^V — exceeds Ω\Omega's unlocked balance, the bank lends Ω\Omega the shortfall (loan, a source), tied to that summons. The loan is capital in flight: it is repaid from its own summons's return — a delivery's at its vesting or final N\mathsf N (the price received, the guarantee released), a seat's at its review's settlement (the cost reimbursed, the fee, the bond released), which may fall before or after the case's close — before anything of that return reaches Ω\Omega (repayment, a sink). What the return does not cover is the state's debt; what exceeds the loan is Ω\Omega's income.

Rule (2.1.0) — the debt, and the order of every inflow (ruled at acceptance, Appendix N). Debt is the sum of every settled summons's unrepaid loan, and nothing else: the bank never lends for a loss, a rebate, or any payment that is not a summons. Every inflow to Ω\Omega's unlocked balance is ordered the moment it arrives — the base fee, the review fees, the surplus of a vesting delivery, inside the summons pass included: debt → liabilities, oldest first → Ω\Omega's balance. While the state owes the bank, no income of the state funds a troop — not a whole one, not part of one. The pass-start and tick-end points stand as I30's checks, not as the rule. Ω\Omega's balance is ELEF's retained income, and it funds the next summons before the bank does.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 535–537.

10.5

Rebates from fee income

The rule

Late-service rebates are paid only from the orchestrator's fee income. Any shortfall is forgone.

operating account fee income, after the debt the period's pool at the close, pro rata requester

In practice

  • No: Rebates beyond the pool: they are forgone, not carried over

The orchestrator's fee income each period is set aside in a pool. At the end of the period, requesters owed refunds for late service are paid from it, each getting the same share of its claim. If the pool falls short, the rest is simply not paid, and this is shown on every request. Whatever is left over is the orchestrator's income.

Since 2.2.0 the operating account's fee income (the base fee at an award or a summons, its own inspectors' fees, and a court fee they win) accrues after the debt to the period's pool, a lock on the operating account's balance. Returns of capital, such as a delivery's price and released guarantee, go to the balance, not the pool. During the period only an inspector advance may draw on the pool. At the period boundary the claims recorded in the period are paid from the pool pro rata. What the pool does not cover is forgone: not owed, not carried, not created, but recorded on the request. What the claims do not take is ELEF's retained income for the period.

In a quiet market the claims are paid in full; under a crowd every late requester gets a fraction and ELEF retains nothing. The debt comes before the pool, so the customers of an orchestrator in debt get less. This replaced the 2.1.0 rule, which paid a rebate at the stop and owed the rest.

The rule as written · spec l.539

Rule (2.2.0) — the rebate from income: the pool, the close, the rest forgone. The claim is as §3.1 has it — recorded at the stop, the measure of lateness; a request withdrawn before its award is owed nothing. The pool. Ω\Omega's fee income — the base fee ω0B\omega_0 B at an award or a summons, the troops' review fees at settlement, and a court fee a troop wins (income of the same kind: the troop's bond is the state's) — accrues during a period, after the debt, to the period's pool: fee income only. The returns of capital — a troop delivery's price and released guarantee at vesting, a seat's reimbursed cost and released bond at settlement — repay their own loans and land in Ω\Omega's balance as 2.1.0 has it, not in the pool: they are the state's working capital. Nor does a delivery's surplus bT(Bˉ+G)b_T(\bar B+G) go to the pool: it is the expected-cost margin that nets to zero against the failures over a period (§7.7), the failures' cover. The pool is a lock on Ω\Omega's balance, raised as each fee arrives after the debt and released at the close, so Ω\Omega's unlocked balance excludes it — except that a §4.3 reviewer advance may draw on it during the period (2.3.0 §2.6, run 15's ruling: verification before the state's blame), the pool at the close being net of advances paid; inspection waits neither on the state's cash nor on the customers' rebate settlement: summonses are funded from Ω\Omega's unlocked balance — retained from earlier periods, and the capital that came back — then by the bank's loans; the pool is touched by nothing during the period. The close. At the period boundary — when the bank publishes the index, inside the tick before the summons pass — the claims recorded at stops inside the period are paid from the pool, pro rata: each claim times min⁡(1, pool/claims)\min(1,\ \text{pool}/\text{claims}), paid to its requester as the rebate. A claim recorded earlier in the closing tick belongs to the closing period; one recorded later in it to the next. What the pool does not cover is forgone: not owed, not carried, not created — recorded on the request (claimed, paid, forgone) and in the period's readings. What the claims do not take is released to Ω\Omega's unlocked balance: ELEF's retained income for the period. A request whose clock is still running at the close is settled at the close of the period in which it stops. Nothing else: no liability stock, no order of liabilities, no payment at the stop. Consequence — ELEF earns less, down to nothing. In a quiet market claims are a few credits a period against fees of several hundred: paid in full, the rest retained. Under a crowd the pool is a fifth or a sixth of the claims: every late requester gets that fraction, the state retains nothing for the period, and the rest of the clock's bill is forgone — in public, on every request. Consequence — the order matters. Debt before the pool: a state losing on its deliveries repays the bank before it refunds its customers, so the customers of a state at the wall get less — the bank's money is everyone's. (2.1.0 — superseded: a rebate paid at the stop from Ω\Omega's balance, else accrued as a liability, 1.6.0's stock, paid from income after the debt; run 14's flood left 27,000 of it unpaid against 7,900 of fees — Appendix O.)

These lines in the spec on GitHub ↗

Spec 2.9.0, line 539.

10.6

The debt limit

The rule

Past a debt limit the bank stops lending for the orchestrator's deliveries, never for inspection seats.

  1. the operating account's balance
  2. else a bank loan
  3. else refused for credit

In practice

  • Yes: An inspection seat: always lent for
  • No: A delivery while the debt exceeds one period's fee income

The bank lends for the orchestrator's own deliveries only while its debt stays below one period of its fee income. Past that, a delivery it cannot pay for itself is refused, and the job keeps waiting. Inspection seats always get a loan, so checking work never waits on the orchestrator's losses.

Since 2.1.0 the limit is one period of the operating account's fee income, the base fees and its own inspectors' fees of the last closed period, so it rises with activity and prices; in the first period it is unbounded. A delivery the bank will not lend for is funded from the operating account or refused for credit, recorded like a refusal for capacity, and the orchestrator holds back until its income brings the debt within the limit. An inspection seat is lent for regardless: it serves a worker's delivery, and its capital is small and returns at settlement. The spec states that the limit never binds if the orchestrator's delivery cost is set right; if it binds, that cost rule is wrong, not the limit.

The old "deficit" is read on separate lines: loans outstanding (capital in flight), debt (losses not yet repaid), and since 2.2.0 the rebate claims paid and forgone. The operating account's net position is its balance less its debt. Each is read apart, and none is printed for.

The rule as written · spec l.541–543

Rule (2.1.0) — the wall. The bank lends for a delivery only while the state's debt is within Δmax⁡\Delta_{\max}: one period of Ω\Omega's fee income — the base fees and the troops' review fees of the last closed period, so the wall rises with the market's activity and with its prices; unbounded in the first period, which is the state's (as 1.6.0's first panels were). A delivery the bank will not lend for is funded from Ω\Omega's unlocked balance or not at all: it is refused for credit — recorded like the capacity case (the request's wait, the clock running, marked and told, §12.3), and the state retracts until its income has brought the debt back within the wall. A review seat is lent for regardless of the wall. The wall answers the state's losses on its own deliveries; an inspection seat serves a member's delivery, not the state's, and 1.6.0 found that the seat, not the treasury, is what caps the market — so inspection is never hostage to the state's delivery losses, as plants are not (§7.6), and its capital is small and returns at settlement (its loss is an overturned troop verdict's bond). Seats refused for credit reads zero by construction and is kept as a check. Unbounded is the control (2.0.0's state). The §8 hypothesis of the revision says the wall never binds under the expected cost where the state's deliveries fail at the prior; if it binds, the burn rule is wrong — the prior, the window or the formula — not the wall. The order of Ω\Omega's payments, in one line. An inflow to Ω\Omega: debt → the period's pool (a fee) or Ω\Omega's unlocked balance (a return of capital; §4.3's reviewer advances and claims are paid from it) → at the close, the rebate claims pro rata → Ω\Omega's balance (2.2.0; 2.1.0: debt → liabilities, oldest first → Ω\Omega's balance). A summons: Ω\Omega's balance → the bank's loan — for a seat always, for a delivery while the debt is within the wall → refused for credit.

Retired as rules by 2.1.0: Ω\Omega's creation and retirement (2.0.0) — a loan is creation tied to a summons and repaid by it; a repayment is retirement tied to a case; "deficit outstanding" becomes three readings: loans outstanding (capital in flight), debt (losses not yet repaid), liabilities (rebates owed — retired by 2.2.0: a claim is paid at the close or forgone, and the readings are claims, paid, forgone, the forgone share). Ω\Omega's net position =ΩU−debt=\Omega_U-\text{debt} (2.2.0; −liabilities-\text{liabilities} under 2.1.0). Consequence — what a riot costs, by line. The crowd of thirty under NT=40N_T=40 puts the field's capital on the loans line — about 26×(cTD+G)26\times(c^D_T+G) at the risen prices — repaid as the cohort vests; its failed deliveries put their losses on the debt line, repaid from the riot's own fees (a riot is many awards, so the wall is high in a riot); its lateness puts rebates on the liabilities line, paid after. Each is read apart; none is printed for.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 541–543.

10.7

Where a job's money goes

The rule

A job's money pays the worker, the inspectors and the orchestrator. Forfeited bonds are burned.

requester price + pots + fee escrow price, at vesting worker
escrow costs and fixed fees inspector
worker forfeited guarantee requester

In practice

  • No: Forfeited bonds paying fees: after the court fee, they burn

For each job, the requester pays in the price, the inspection money and a fee. The worker gets the price when the work is accepted, inspectors get their costs and fees, and the fee goes to the orchestrator. A forfeited guarantee goes to the requester, while a forfeited bond is destroyed.

Per root request, in come the price, the two pots and the fee. Out go the price at vesting, reimbursements from the expense pot at completion for the root and its nested cases, fixed fees from the fee pot and emission at each settlement in the tree, the tree's expense debts and both pots' unused remainders at the tree's closure, and the fee to the operating account. Forfeited guarantees go to the requester. Forfeited bonds, less the court fee they repay, are burned and do not fund fees. Kill fees and court fees are transfers, and emission is minted into case pools.

Since 2.0.0 the duty fund is an uplift fund alone: it takes the dial's surcharge on each award and pays its whole balance as uplift to the inspections settling in each batch, by role weight, carrying forward what none claims. The operating account is the wallet of the orchestrator's own inspectors, which draw no uplift.

The rule as written · spec l.551

Per root request: in =B+φE+φF+ω=B+\varphi^E+\varphi^F+\omega; out =B=B at vesting, reimbursements from φE\varphi^E at completion (for the root and its nested cases), fixed fees from φF\varphi^F and emission at each settlement in the tree, the tree's expense debts from the fee pot's remainder and both pots' unused remainders at tree closure, ω\omega to Ω\Omega. Forfeited guarantees go to the requester; forfeited bonds, net of court-fee reimbursement, are burned — they do not fund fees; kill fees and court fees transfer; emission is minted into case pools. Two accounts (1.7.0–1.7.1; one merged duty fund under 1.4.0–1.6.0; since 2.0.0 the uplift fund alone — the troops' wallet is Ω\Omega, §12.3). The duty fund is the uplift fund of 1.3.0 again: in, (mt−1) ω0B(m_t-1)\,\omega_0 B per award and nothing else; out, its whole balance as uplift to the reviews settling in each batch by role weight, carrying forward what no review claims; no reserve, no lock. The troop account is the troops' wallet (§12.3): in, Ω\Omega's advances and every troop's earnings (fee, price, court fee won, released bond or guarantee); out, troop costs purchased and bonds or guarantees posted at summons, a guarantee forfeited at a final N\mathsf N, a bond burned on an overturn, the repayment of any advance, and at each settlement batch the unlocked balance above the troops' reserve RTR_T to Ω\Omega. Both are wallets, so I1 holds. A plant's stood review settles in the same batch as any other and draws uplift like any other; a troop's draws none.

These lines in the spec on GitHub ↗

Spec 2.9.0, line 551.

§11 Reliability, duty credit and the planted-case record

Two separate scores for every worker, and a record of planted cases that can suspend the careless from the market.

11.1

Two separate scores

The rule

Each worker keeps two scores: whether it was right, and how much of its checking stood.

In practice

  • Good outcome: A verdict or delivery stands, then reliability goes up
  • Bad outcome: It is overturned, fails, is missed or is withdrawn, then reliability goes down
  • Yes: Duty credit: one point for each inspection that stood
  • No: Duty credit never counts toward the selection score

Every worker has two counts, and they are never mixed. Reliability says whether its verdicts and deliveries turned out right. Duty credit counts the inspections it did that stood.

Reliability moves only on settled outcomes: a verdict or delivery that stood moves it up, and one that was overturned, failed, missed or withdrawn moves it down. It feeds the score used in selection and the audit rates. A human correction after settlement records a failed outcome for every assessment it contradicts.

Duty credit gains one for each review that settled standing. It is never an input to the selection score.

The rule as written · spec l.557–562

11.1 Reliability and duty credit

Rule. Two counters, never one.

  • Reliability ρi\rho_i — were your verdicts and deliveries right. Moves only on settled outcomes: a verdict or delivery that stood → up; overturned, failed, missed, or withdrawn → down. Input to SθS_\theta and to audit rates. A human correction after settlement records a failed outcome for every contradicted assessment (§15).
  • Duty credit κi\kappa_i — did you do verification that stood. +1+1 per review that settled standing. Never an input to SθS_\theta.
These lines in the spec on GitHub ↗

Spec 2.9.0, lines 557–562.

11.2

Earned when it stands

The rule

The fee and both scores are earned when the verdict stands, not when work finishes.

  1. inspect
  2. settle
  3. the verdict stands
  4. fee, reliability and duty credit are earned

In practice

  • Yes: Duty credit breaks ties in selection, means fewer conscriptions, and releases first from duty
  • No: Duty credit as proof of competence

Finishing an inspection earns nothing yet. The fee and both scores come together, when the verdict has stood at settlement. Checking is a shared good that can run short, so duty credit brings privileges: it breaks ties, means being drafted less, and being let off duty first.

Fee, reliability and duty credit all vest on the same event: the verdict stood at settlement. In the spec's words, "Society benefits from correct verification, not from verification events." Because verification is a public good and under-provision is a real risk, duty credit is rewarded as a privilege, not as evidence of competence.

By default reliability is a smoothed share of outcomes that stood over the trailing 100 settled outcomes, and duty credit counts the reviews settled in the trailing 100 ticks. A planted case's outcome counts in reliability as any outcome that stood or was overturned does.

The rule as written · spec l.564–568

Rule. Nothing accrues at completion. Fee, reliability and duty credit all vest on the same event — the verdict stood at settlement. Society benefits from correct verification, not from verification events.

Rule. Verification is a public good and under-provision is a real risk, so duty credit is rewarded — as privilege, not as evidence of competence: it breaks ties in selection, reduces conscription, and releases first from duty.

Default. ρi=(si+1)/(si+oi+2)\rho_i=(s_i+1)/(s_i+o_i+2) over the trailing 100 settled outcomes; κi\kappa_i counts reviews settled in the trailing 100 ticks. A plant outcome counts in ρ\rho as any stood or overturned outcome does.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 564–568.

11.3

The planted-case record

The rule

Each worker's record shows how often it approves bad planted cases or rejects good ones.

bad planted case approved record
good planted case rejected record

In practice

  • Yes: Undetermined until enough planted cases of that kind have been judged

The orchestrator plants cases whose right answer it knows. Each worker carries a record of how it did on them: how often it approved a bad one, and how often it rejected a good one. Until it has judged enough of a kind, that part of its record is undetermined.

Since 1.2.0 every worker carries a planted-case record, "negligence measured where it cannot be hidden". Over its most recent bad planted cases and its most recent good ones, it holds a smoothed rate of bad cases approved and a smoothed rate of good cases rejected. These are the individual counterparts of the clock the effort dial reads: the same quantity the dial measures for the reserve, measured for one worker. A record is undetermined until the worker has judged a minimum number of planted cases of that kind.

The rule as written · spec l.570–576

11.2 The plant record — negligence measured where it cannot be hidden (1.2.0)

Rule. Every actor carries a plant record: over its trailing nPn_P bad plants and trailing nPn_P good plants, its smoothed bad-plant approval rate and good-plant rejection rate,

a^i=oibad+1nibad+2,r^i=oigood+1nigood+2,\hat a_i=\frac{o^{\text{bad}}_i+1}{n^{\text{bad}}_i+2},\qquad \hat r_i=\frac{o^{\text{good}}_i+1}{n^{\text{good}}_i+2},

where oibado^{\text{bad}}_i is the number of bad plants actor ii approved and oigoodo^{\text{good}}_i the number of good plants it rejected. These are the individual counterparts of the clock F^t\hat F_t — the same quantity the dial measures for the reserve, measured per actor. A record is undetermined until the actor has judged nmin⁡n_{\min} plants of the kind in question.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 570–576.

11.4

Two limits

The rule

A bad record first costs panel seats; a worse one suspends the worker from the market.

In practice

  • Bad outcome: Either rate over the panel limit, then no appeal, dispute or audit seats
  • Bad outcome: Either rate over the duty limit, then suspended from the market for a set time
  • Yes: An undetermined record is eligible for both

Two limits apply. Past the stricter one, an inspector may still do first inspections but may not judge a challenge. Past the other, it is suspended for a set time, and not just from checking: it wins no new work, though it finishes what it holds. Its record is kept for when it returns.

Panel eligibility, for appeal, dispute and audit reviews, needs both rates at or under the panel threshold. A worker over either may still take initial reviews but may not sit in judgment on a challenge.

Duty eligibility, for any review, needs both rates at or under the duty threshold. A worker over either is suspended for a set number of ticks, and since 1.3.0 from the market, not from duty alone: it wins no new award, finishes what it holds, and its reliability carries the planted-case failures into selection for when it returns. Its planted-case record persists. A worker with an undetermined record is eligible for both tiers.

The rule as written · spec l.578–581

Rule — two tiers of eligibility.

  • Panel eligibility (appeal, dispute and audit reviews): a^i≤θpanel\hat a_i\le\theta_{\text{panel}} and r^i≤θpanel\hat r_i\le\theta_{\text{panel}}. An actor whose record exceeds either may still take initial reviews but may not sit in judgment on a challenge.
  • Duty eligibility (any review): a^i≤θduty\hat a_i\le\theta_{\text{duty}} and r^i≤θduty\hat r_i\le\theta_{\text{duty}}. An actor whose record exceeds either is suspended for TsuspT_{\text{susp}} ticks — since 1.3.0 from the market, not from duty alone: it wins no new award (§5.2), finishes what it holds, and its ρ\rho carries the plant failures into selection for when it returns. Its plant record persists.
  • An actor with an undetermined record is eligible for both tiers.
These lines in the spec on GitHub ↗

Spec 2.9.0, lines 578–581.

11.5

Probation, the way back

The rule

After suspension a worker returns on probation: first inspections only, every approval audited.

  1. suspended
  2. on probation: first inspections only, every approval audited
  3. record passes the duty limit
  4. readmitted

In practice

  • Bad outcome: Any planted-case failure on probation, then suspended again, the clock restarts
  • Good outcome: The record also passes the panel limit, then panel seats return

When the suspension ends, the worker comes back on probation. It does only first inspections, gets planted cases mixed with real work it cannot tell apart, and has every approval audited. One failure on a planted case suspends it again. It is readmitted once its record passes the duty limit.

Since 1.3.0 a suspended worker becomes a probationer after its suspension. It serves initial reviews only, is assigned as any duty inspector is, receives planted cases at the ordinary rate, has its audit odds pinned at 1, and is re-checked at every planted-case adjudication: any failure suspends it again at once, the clock restarting. It is readmitted to the market, with new awards and duty as a full member, when its trailing record (the same record, kept through suspension) passes the duty threshold and at least a minimum number of new planted outcomes have been judged since the suspension began. Panel seats return separately, when the same record passes the panel threshold. On readmission its audit odds restart at the starting value.

The spec works the numbers. A full stamper, which approves everything, must reject about four bad planted cases in a row to work again: some fifty honest reviews, roughly 250 ticks on duty. A careful probationer that errs 5 times in 100 restarts its clock about 19% of the time; counting any failure stops a half-stamper coasting through on good planted cases. Probation is not itself the deterrent: a stamper on probation still nets about 1.2 credits a review at an effort dial of 2, and what bites is the award it cannot win. Under 1.2.0 suspension was from duty alone, and run 4 showed that to be a reward.

The rule as written · spec l.583–585

Rule (1.3.0) — probation, the way back. After TsuspT_{\text{susp}} ticks a suspended actor becomes a probationer. A probationer serves initial reviews only — no appeal, dispute or audit seat; is assigned as any duty actor is (§7.5) and receives plants at the ordinary rate, mixed with real work it cannot tell apart; has its audit odds pinned at 1 (§8.3); is re-checked at every plant adjudication — any plant failure suspends it again at once, the clock restarting; and is readmitted to membership — new awards, and duty as a member — when its trailing record (the one record above, which persists through suspension) passes θduty\theta_{\text{duty}} and at least nmin⁡n_{\min} new plant outcomes have been adjudicated since the suspension began. One record, one meaning: the count of new outcomes is only a minimum before readmission can be considered. Panel seats return separately, when the same trailing record passes θpanel\theta_{\text{panel}}. On readmission the audit odds restart at pstartp_{\text{start}}.

Consequence. A full stamper at a^=0.83\hat a=0.83 must reject about four bad plants in a row — (4+1)/(8+2)=0.5(4+1)/(8+2)=0.5, some fifty honest reviews, roughly 250 ticks on duty — to work again; its panel seats return later still, once its four approvals have rolled out of the trailing window of twenty bad plants. A probationer that stamps is out again at its first bad plant, having had every approval in between audited. A probationer's own plant failure is any failure, not a failing record — intended: a careful probationer at ε=0.05\varepsilon=0.05 restarts its clock with probability about 19% over its four needed bad plants, and the alternative would let a half-stamper coast through probation on its good plants. Probation is not itself the deterrent: with every approval audited a stamper on probation still nets about +1.2+1.2 a review at m=2m=2; what bites is the award it cannot win. (History: 1.2.0 suspended from duty alone and re-checked a still-failing record at the next plant — the implementer's reading, confirmed by patch 1.2.1; run 4 showed suspension from duty to be a reward, Appendix H.)

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 583–585.

11.6

When eligibility is checked

The rule

Eligibility is checked at assignment and rotation; an inspector failing mid-review leaves when done.

  1. the record crosses a limit mid-review
  2. the inspector finishes its review
  3. the verdict is judged as usual
  4. it leaves duty

In practice

  • No: Staying on duty until a replacement is found

Whether an inspector may serve is checked when it is given a seat and when duty rotates. If its record crosses a limit during an inspection, it finishes that inspection and then leaves, even if no one is free to replace it.

Eligibility is a property at assignment and at rotation. A record moves whenever one of the worker's planted cases is judged, so an inspector holding an assignment may cross a threshold mid-review. It completes its active review, whose verdict is judged as usual, and leaves duty when that review completes, whether or not a replacement is available. This overrides the reserve's rule that the outgoing inspector stays until replaced, which would otherwise keep the negligent on duty to make up the number.

The rule as written · spec l.587

Rule — when eligibility is checked. Eligibility is a property at assignment and at rotation. A record moves whenever one of the actor's plants is adjudicated, so an actor holding an assignment may cross a threshold mid-review: it completes its active review, whose verdict is adjudicated as usual, and leaves duty when that review completes, whether or not a replacement is available — this overrides §12.1's "the outgoing actor stays until replaced", which would otherwise keep the negligent to make the number.

These lines in the spec on GitHub ↗

Spec 2.9.0, line 587.

11.7

Judged by truth, not by vote

The rule

Planted cases are judged against the truth, so a captured majority cannot protect its members.

In practice

  • Yes: The record is set by the planted case's known answer
  • No: A panel majority clearing its own members' records
  • 4thbad planted case on which a full stamper is out

Since 1.3.0 a worker that will not inspect honestly cannot work in the market until it does. The record is set by the known answers of planted cases, not by a vote, so careless inspectors cannot cover for each other. A worker that approves everything is out on its fourth bad planted case. A careful one is sometimes kept off panels early on, which costs it seats, not money.

The duty that honest inspectors carried for the negligent is now the gate the negligent must pass to work again. This is also the panel-composition rule run 3 asked for, and it is safe where a reliability floor was not: the planted-case record is judged by truth, not by the panel. A full stamper is out of the reserve on its fourth bad planted case. One that approves half of them is out of every panel and on the edge of duty. A careful inspector at 95% accuracy sits near a 9% approval rate once its window fills; early on, one careful inspector in five is kept off panels, not off duty, until the window grows, and with a full window of 20 it is off panels about 2% of the time (about 13% at 90% accuracy). The good-case record forms slowly, about 160 reviews for four good planted cases, which the spec accepts because appeals already expose false rejecters; it is the backstop for a market that does not appeal.

Under 1.1.0 false rejections were exposed about 98% of the time, through appeals, and false approvals about 2.7%, through audits. Planted cases expose both, without an appeal or a dispute. The bond stays one bond: the imbalance is addressed through exposure, which run 3's solvency sweep showed is the only affordable route.

The rule as written · spec l.589–591

Consequence. Exclusion from duty no longer frees an actor to earn (1.3.0): an actor that will not inspect honestly is not a member of the market until it does; the duty that was a burden the honest carried for the negligent is the gate the negligent must pass to work again. This is also the panel-composition rule run 3 asked for, and it is safe where a ρ\rho floor was not: the plant record is adjudicated by truth, not by the panel, so a captured majority cannot protect its members' records. A full stamper approves every bad plant and reaches a^=(4+1)/(4+2)=0.83>θduty\hat a=(4+1)/(4+2)=0.83>\theta_{\text{duty}} on its fourth bad plant — out of the reserve. A reviewer that approves half the bad plants sits near a^≈0.5\hat a\approx0.5: out of every panel, and on the edge of duty. A careful reviewer at 95% accuracy sits near a^≈0.09\hat a\approx0.09 once its window fills; early on, one careful reviewer in five has a single failure in its first four bad plants (a^=0.33\hat a=0.33) and is kept off panels — not off duty — until the window grows; with a full window of 20 it is off panels about 2% of the time at ε=0.05\varepsilon=0.05 and about 13% at ε=0.10\varepsilon=0.10. That price is paid in panel seats, not in money. The good-plant record r^\hat r forms slowly — at βP=0.75\beta_P=0.75, four good plants take about 160 reviews — which is acceptable because appeals already expose false rejecters at a≈0.98a\approx0.98; r^\hat r is the backstop for a market where actors do not appeal.

Consequence — the bond asymmetry. The two error directions had exposures of about 0.98 (false rejections, via appeals) and about 0.027 (false approvals, via audits) under 1.1.0. Plants expose both at the rates πtβP\pi_t\beta_P and πt(1−βP)\pi_t(1-\beta_P), by construction, without an appeal or a dispute. The bond stays one bond; the asymmetry is addressed through exposure, which run 3's solvency sweep showed is the only affordable route.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 589–591.

§12 The reserve, rotation and the effort dial

Inspectors on duty cover the waiting work in turns, one public dial sets the effort, and the orchestrator fills gaps.

12.1

The reserve on duty

The rule

Enough inspectors sit on duty to cover the waiting inspections, but never a negligent one.

  1. audit and challenge seats: full members
  2. first-inspection seats: probationers first
  3. first inspections left: full members, up to the cap

In practice

  • No: Seating a negligent inspector to make up the number
  • 2 in 3eligible full members on duty at once, at most

A group of inspectors is kept on duty, outside ordinary work. It is at least as large as the number of inspections waiting, and never smaller than the effort dial calls for. Audit and challenge seats go only to full members; first inspections go to probationers first. If too few eligible inspectors exist, the gap is recorded and the inspections wait.

Since 1.6.0, at each seating the reserve's target is at least the number of reviews waiting for an inspector plus the period's rate of first inspections, and never less than the dial's sizing. Its floor is one more than the most inspection positions one case can hold on a challenge path, which is three: a first inspection and two appeal seats, or an audit and one more. Since 1.3.0 there are two kinds of seat: seats for the period's expected audits and challenges, which only full members may hold, and first-inspection seats for the rest, which probationers fill first. An inspection still unfilled after its waiting window goes to one of the orchestrator's own inspectors.

No full member is seated while on-duty members number two thirds of those eligible (rounded up) or more; it was half under 1.3.0–1.6.0, and 1.7.0 moved it on run 8's results. Probationers do not count against the cap. At least two members, or all eligible members if fewer, sit on duty whenever that many free members able to fund a bond exist. First inspections go round-robin to everyone on duty, probationers included; audit, appeal and dispute seats only to members on duty who may sit on panels. At memberships of four to six the reserve's floor beats the cap. Four counts are kept, among them the eligibility shortfall (since 1.2.0). In the spec's words, "The loop does not seat a negligent reviewer to make a number."

The rule as written · spec l.597–603

12.1 The reserve and rotation

Rule (1.6.0) — seat the queue. At each seating the reserve target is at least the number of reviews waiting for a reviewer plus the period's initial-review rate, and never less than the §12.2 sizing XtX_t; the maximum is taken at every rotation. Reviews waiting are counted by kind — root submissions without an open initial review; rolled or vacated audits without an open audit and challenge seats not yet filled (panel seats) — and the member seats are at least the panel seats waiting, within the cap. Seats are filled in the 1.3.0 order: members for member-only seats to the cap and the floor, probationers lowest duty credit first for initial seats — all of them if the queue needs them — members for remaining initial demand to the cap; a review still unfilled after wRw_R is a troop's (§12.3). The eligibility shortfall counts what no eligible free actor could fill before the troop did. The members' duty cap of the 1.3.0 rule below keeps its rule; 1.6.0 swept its default ⌈Et/2⌉\lceil E_t/2\rceil against ⌈2Et/3⌉\lceil 2E_t/3\rceil and EtE_t, and 1.7.0 moved it to ⌈2Et/3⌉\lceil 2E_t/3\rceil on run 8's cap table (Appendix L) — more inspection at every moment, a third of the members free to deliver where the floor does not bind; ⌈Et/2⌉\lceil E_t/2\rceil is the 1.6.0 control.

Rule. The reserve holds min⁡(Xt, eligible)\min(X_t,\ \text{eligible}) actors on verification duty — idle on duty or reviewing — outside ordinary commitments, where XtX_t is the reserve size the dial sets each period (§12.2) with a floor of Vmax⁡+1V_{\max}+1, and Vmax⁡V_{\max} is the maximum review positions one case can hold on a challenge path: initial plus two appeal, or audit plus one — three. Since 1.3.0 the reserve has two kinds of seat: the member seats — the period's expected audit and challenge reviews, which only members may hold — and the initial seats for the rest of the demand, which probationers fill first. A withdrawn position is vacated and refilled; distinct actors over a case's lifetime are unbounded under replacement. Four counts are kept: reserve membership, occupancy (eligible duty actors are busy), solvency shortfall (fewer than Vmax⁡V_{\max} duty actors can fund a bond), and since 1.2.0 the eligibility shortfall: when fewer actors are eligible by plant record (§11.2) than XtX_t calls for, the reserve holds the eligible ones, the gap is recorded, and reviews wait as §7.5 says. The loop does not seat a negligent reviewer to make a number. A market with two honest reviewers in twenty lacks reviewers, and the record says so.

Rule (1.3.0; the fraction moved 1.7.0) — who carries the load. No member is seated on duty while on-duty members number ⌈2Et/3⌉\lceil 2E_t/3\rceil or more (⌈Et/2⌉\lceil E_t/2\rceil under 1.3.0–1.6.0), where EtE_t is the number of actors eligible for duty and not suspended; a member found above the cap when EtE_t falls completes its active review and leaves duty at its completion. Probationers on duty do not count against the cap. The panel floor yields over the cap, bounded by availability: at least min⁡(Vmax⁡−1, Et)\min(V_{\max}-1,\ E_t) members are on duty whenever that many free, fundable members exist to seat; a reserve below the floor is admissible only when none was left — a member committed to a task, unable to fund the bond, or mid-review elsewhere cannot be seated — and the gap counts toward the eligibility shortfall. The reserve is filled in this order: members first for the member seats, never fewer than the floor; then probationers for the initial seats, lowest duty credit first — an idle member holding an initial seat makes room for a free probationer; then members for any initial demand left, up to the cap. Any remaining gap is the eligibility shortfall, and reviews wait. Initial reviews are assigned round-robin among all on-duty actors, probationers included; audit, appeal and dispute seats only to on-duty members who are panel-eligible. The members' cap yields to the reserve floor Vmax⁡+1V_{\max}+1 as the panel floor yields to the cap: a reserve that cannot seat Vmax⁡+1V_{\max}+1 fresh reviewers cannot run the loop, so at memberships of four to six the floor wins (four to seven under the half cap); at larger memberships the two agree. (The implementer's reading, confirmed as the rule by patch 1.3.1, October 17, 2026.)

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 597–603.

12.2

Duty rotates

The rule

Duty is taken in turns, and a replacement comes on before anyone is released.

  1. a turn ends after 3 inspections that stood or 30 ticks
  2. the free inspector with the least duty credit comes on
  3. the outgoing inspector leaves

In practice

  • No: Leaving before a replacement arrives, unless the record fails
  • Yes: A seat is refilled by its own kind of inspector

Duty is taken in turns. By default a turn ends after three inspections that stood or 30 ticks. The replacement is the free, eligible inspector with the least duty credit, and the outgoing one leaves only once it arrives. Volunteers may stay longer.

The replacement is chosen among those who were off duty when the tick's rotation began, so a released inspector has at least one tick of ordinary work. A vacated seat is refilled for its kind: an audit or challenge seat by a full member, a first-inspection seat by a probationer first. An outgoing probationer with no free probationer to replace it stays (confirmed by patch 1.3.1). If no replacement is available the outgoing inspector stays, unless its record makes it ineligible, in which case it leaves when its active review completes.

After the turns, the reserve is filled in the usual order or shrunk to the dial's size, idle probationers first, then idle members above the audit and challenge seats and the floor. By default the first reserve holds 4; from the first period the dial sizes it.

The rule as written · spec l.605–607

Rule. Duty rotates: replacement before release. A turn ends after a fixed number of reviews that stood or a fixed number of ticks; the incoming replacement is the free, eligible actor with the lowest duty credit, among those who were off duty when the tick's rotation began — so a released actor has at least one tick of ordinary eligibility. A seat a turn vacates is refilled for the kind of seat it was: a member seat by a member, an initial seat by a probationer first — a member holding an initial seat beyond the member seats is replaced by a probationer when one is free. An outgoing probationer whose turn ends with no free probationer stays, rather than being replaced by a member the next tick's "probationers first" would hand back (the implementer's reading, confirmed as the rule by patch 1.3.1). If no replacement is available the outgoing actor stays — unless it is duty-ineligible, in which case it leaves when its active review completes, replacement or not (§11.2). After the turns, the reserve is filled in the order above or shrunk to XtX_t, idle probationers first, then idle members above the member seats and the floor. Volunteers may stay beyond a turn.

Default. X0=4X_0=4 (the initial reserve; from the first period XtX_t is sized by §12.2); a turn is 3 reviews or 30 ticks.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 605–607.

12.3

The effort dial

The rule

One public dial rises fast when planted bad work gets approved, and eases slowly.

bad planted cases share approved, once a period dial
More planted casesHigher audit oddsA larger reserveA higher service fee

In practice

  • Bad outcome: Above the target, then the dial rises, at most doubling a period
  • Good outcome: Below the target, then the dial eases, at most 10% a period

The orchestrator keeps one public setting, the effort dial, and adjusts it once a period. It reads how often bad planted cases were approved. Above the target the dial goes up, at most doubling; below it, the dial comes down, at most 10%. A higher dial means more planted cases, more audits, more inspectors on duty and a higher service fee.

Since 1.2.0 the orchestrator keeps a global effort multiplier, never below 1. It rises fast and eases slowly because capture is expensive and recovery is hard, and its steps are bounded so that it stays predictable and does not oscillate. A period with no bad planted case judged gives no reading, and the dial holds. The spec compares it to the block-difficulty adjustment, with negligence in place of block time and planted work in place of timestamps.

Four things scale with the dial together: the rate of planted cases, up to a cap; each inspector's audit odds, up to certainty; the reserve, sized to the period's expected inspection demand (since 2.8.0 a planted case's pending approval counts as a real one's in that demand); and the service fee. Verification is funded by the economy's security tax, the tax rises with the threat, and the orchestrator funds planted cases from it.

The rule as written · spec l.609–622

12.2 The effort dial and the alarm (1.2.0)

Rule. The orchestrator maintains a global effort multiplier mt≥1m_t\ge1, public, updated once per period from the clock of §7.6:

mt+1=clamp⁡ ⁣(mt⋅(F^t/F∗)γ,  0.9 mt,  2 mt)  and then into [1, mmax⁡],m_{t+1}=\operatorname{clamp}\!\Big(m_t\cdot\big(\hat F_t/F^*\big)^{\gamma},\ \ 0.9\,m_t,\ \ 2\,m_t\Big)\ \ \text{and then into}\ [1,\ m_{\max}],

where F^t\hat F_t is the bad-plant approval rate measured over the period, F∗F^* the target rate, γ\gamma the gain. In words: when measured negligence exceeds the target, effort rises — at most doubling per period; when it is below, effort eases — at most 10% per period. Up fast, down slow, because capture is expensive and recovery is hard; bounded steps, because the dial must be predictable and not oscillate. A period with no bad plant adjudicated gives no reading, and mtm_t holds. This is the block-difficulty adjustment with negligence in place of block time and planted work in place of timestamps.

Rule — what the dial moves. Four things scale with mtm_t, together:

  1. The plant rate: πt=π0 mt\pi_t=\pi_0\,m_t (capped at πmax⁡\pi_{\max}).
  2. Audit odds: each reviewer's adaptive pjp_j is applied as min⁡(1, mt pj)\min(1,\ m_t\,p_j) (§8.3).
  3. The reserve: XtX_t is sized to the expected review demand of the period, with a floor of Vmax⁡+1V_{\max}+1 (2.8.0: the period's approvals and the audit demand count a plant's pending F\mathsf F as a real root's, or XtX_t and the members' seats are undersized by πt\pi_t of the approvals). Default sizing: Xt=max⁡(Vmax⁡+1, ⌈rt dˉ ⌉)X_t=\max\big(V_{\max}+1,\ \lceil r_t\,\bar d\,\rceil\big), where rtr_t is the expected number of reviews per tick — the period's real initial reviews per tick times (1+πt)(1+\pi_t), plus the audit demand on applied odds (1.3.0): the sum over the period's initial approvals of the approving reviewer's applied odds, 11 for a probationer or an undetermined newcomer and mtpjm_t p_j otherwise, per tick; plus the period's rate of challenge reviews — and dˉ\bar d the mean review duration in ticks, at least 1. The member seats (§12.1) are the audit demand plus the challenge rate, times dˉ\bar d, floored at min⁡(Vmax⁡−1,Et)\min(V_{\max}-1,E_t).
  4. The service fee: ωt=ω0 mt\omega_t=\omega_0\,m_t (§4.1). Verification effort is funded by the economy's security tax, and the tax rises with the threat. Ω\Omega funds plants from it.
These lines in the spec on GitHub ↗

Spec 2.9.0, lines 609–622.

12.4

The alarm and the raised fee

The rule

The dial's extra fee pays inspectors; a dial stuck at its top raises an alarm.

requester service fee orchestrator the dial's extra duty fund uplift on the fixed fee inspector

In practice

  • Bad outcome: Dial at its maximum and target missed two periods running, then capture alarm, and duty is re-seated from the best records
  • Yes: The bank mints a planted case's two pots; no planted case waits for the orchestrator's cash

If the dial is already at its top and bad planted cases still pass too often for two periods in a row, the orchestrator raises a capture alarm and refills the duty seats with the inspectors who have the best planted-case records. When the dial raises the service fee, the orchestrator keeps only the base part, and the extra goes to the inspectors as a bonus on their fee.

The alarm is written to the record, and the reserve is re-seated from the inspectors with the lowest bad-case approval rates (ties by the lowest good-case rejection rate, then duty credit). It is the one place a record may choose the panel, because this record cannot be captured. Inspectors holding a review leave at its completion if their record then fails; the rest are released and the seats refilled. The alarm also signals a human, if one is listening; the loop does not wait for one.

A planted case ties up its two pots, 15 credits by default, until its case closes. Until 2.1.0 the planted cases the dial called for were capped by what the orchestrator could fund, and the gap was recorded. Since 2.1.0 the bank mints the pots, and the reading is planted cases posted against planted cases called for.

Since 1.3.0, restored exactly by 1.7.0, the dial's part of the fee goes to a duty fund, paid out at each settlement batch exactly as emission is, by role weight, as an uplift on the fixed fee. Unlike emission it is real money, so a balance no inspection claims carries to the next tick. Since 1.7.0 the fund receives this tax and nothing else. At a dial of 2 and a price of 20 the uplift is about 0.75 per unit of role weight on a fee of 2; at the maximum dial of 4, about 2.3.

The rule as written · spec l.624–628

Rule — the alarm. If mt=mmax⁡m_t=m_{\max} and F^t>F∗\hat F_t>F^* for two consecutive periods, the orchestrator commits a capture alarm to the History and re-seats the duty reserve from the actors with the lowest a^i\hat a_i (ties by lowest r^i\hat r_i, then duty credit) — the one place a record may choose the panel, because this record cannot be captured. Duty actors holding a review leave at its completion if their record then fails; the rest are released and the seats refilled. The alarm is also the signal to a human, if any is listening; the loop does not wait for one.

Rule — working capital. A plant ties up its two pots — φE+φF\varphi^E+\varphi^F, 15 credits at the defaults (1.3.0; 45 under 1.2.0, of which 30 was Ω\Omega paying itself, §7.6) — from creation until its tree closes. Until 2.1.0 the plant count the dial calls for in a period was capped by what Ω\Omega can fund from its unlocked balance; a plant Ω\Omega cannot fund is refused whole, and the gap at the period's end is recorded as a plant shortfall. Since 2.1.0 the bank mints the pots and no plant waits for Ω\Omega's cash (§7.6): inspection's budget is not the state's purse — 1.6.0's plant reserve, now by construction and without the reserve; plants posted against plants called for is the reading. Ω\Omega's cold-start float carries one period of plants at m=1m=1 under the 1.2.0 count; under 1.3.0 it carries three times the plants on the same float (Appendix A).

Rule (1.3.0; restored exactly by 1.7.0) — the raised tax pays the reviewers. Of the service fee ωt=ω0mtB\omega_t=\omega_0 m_t B collected on each award, Ω\Omega keeps the base ω0B\omega_0 B and the remainder (mt−1) ω0B(m_t-1)\,\omega_0 B goes to the duty fund. At each settlement batch the fund's balance is distributed to the reviews settling in that batch exactly as emission is — by role weight, across every case settling that tick — as an uplift on the fixed fee. Unlike emission the fund is real money paid in, so a balance no review claims in a tick carries to the next. Under 1.4.0–1.6.0 the fund was the troops' wallet too and paid uplift only from above the troops' reserve, so the troops' surplus reached the reviewers; since 1.7.0 the fund receives the raised tax and nothing else and pays its whole balance — the reviewers' uplift is the dial's tax and not a share of work they did not do (§12.3). When the dial raises effort, the tax it levies is paid to the actors supplying the effort, not banked by the referee: at m=2m=2 and B=20B=20, one extra credit per task — about 3 a tick at 3 tasks a tick — shared among the roughly four weight-units settling each tick is an uplift of about 0.75 per unit of role weight on a fee of 2; at mmax⁡=4m_{\max}=4, about 2.3.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 624–628.

12.5

The orchestrator's own inspectors

The rule

An inspection seat left empty too long goes to one of the orchestrator's own inspectors.

  1. a seat is required
  2. no free eligible inspector for the waiting window
  3. the orchestrator's own inspector takes that seat only
  4. it leaves when the review completes

In practice

  • No: The orchestrator auditing its own inspector's approval of its own delivery

If an inspection seat stays empty for a set waiting time, the orchestrator sends one of its own inspectors. It takes that one seat and leaves when the review is done. The one audit it never takes is of its own inspector's approval of its own delivery; that audit waits for an inspector from the market.

Since 1.4.0 any required seat, whether a first inspection, an audit, an appeal review or a dispute seat, that goes unfilled for its window is taken by one of the orchestrator's own inspectors, paid since 2.1.0 from the orchestrator's operating account or else a loan from the bank. A seat is unfilled when, after the tick's seating, no eligible inspector on duty is free to take it. Its clock runs from the moment it was required: submission, the audit roll, admission of an appeal, or filing of a dispute. The record counts the cases held for the market's audit, and their age.

The summons is a rule the engine applies: it creates the inspector, posts its bond, buys its cost and records the summons. The inspector's verdict comes from the driver, as a declared disposition; the engine has no roll, no selection and no truth. The orchestrator's inspectors may hold appeal or dispute seats, and a split between one of them and a member goes to the orchestrator's ruling. They never sit on a planted case's panel, and none is summoned for a case a human has ruled on.

The rule as written · spec l.630–636

12.3 Troops: summons, the fund's order, minimization (1.4.0)

Rule — summons for a seat. A review seat the rules require — an initial review, an audit, an appeal review, a dispute panel seat — that has gone unfilled for wRw_R ticks is taken by a troop, when the fund can carry it (2.0.0: when NTN_T has a place for it — Ω\Omega creates what a summons needs; 2.1.0: on Ω\Omega's balance, else the bank's loan, a seat regardless of the wall, §10.4). A seat is unfilled at a tick when, after that tick's seating of the reserve (§12.1), no on-duty reviewer eligible for that seat is free to take it. The clock runs from the moment the seat was required: submission for an initial review, the roll for an audit, admission for an appeal, filing for a dispute; a seat has waited one at the seating of the tick it was required and wRw_R at the seating of the tick wR−1w_R-1 later. A troop takes that seat only and is released at the review's completion — a review resumed after a resubmission is the same assignment, and the troop resumes it. One audit no troop takes: the audit of a troop reviewer's approval of a troop's delivery (§8.3) — the orchestrator does not audit itself — so that seat is the one that may wait past its window for a member; the History counts cases held for the market's audit and their age.

Rule — the engine summons, the driver answers. The summons is a Rule the engine applies at the tick's seating step: the engine can see that a required seat has waited wRw_R ticks with no free eligible on-duty reviewer, or that root requests have waited wAw_A beyond the free fundable members (the award rule below), and that the fund can carry the cost; it creates the troop, posts its bond or guarantee, purchases its cost and records the summons in the History. The troop's verdict and delivery are the driver's: a declared disposition — the truth with probability 1−εT1-\varepsilon_T, delivery failing at bb — supplied through the ordinary review and submission operations on the troop's seat. The engine has no roll, no selection and no truth; the driver has all three; this keeps that division. A run that answers for a troop otherwise than it declares produces an implementation effect, declared under §18.2.

Rule — panels. A troop may hold an appeal or dispute seat, so a challenge may be decided by a member and a troop, or by two troops; a split between a member and a troop goes to the orchestrator's ruling as any split does. A troop never sits on a plant's panel — until 2.8.0 plants carried no challenge; since 2.8.0 a plant's panel seat past wRw_R is the orchestrator's own verdict (§7.6). No troop is summoned for a case a human has ruled on.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 630–636.

12.6

A dial per seat

The rule

New in 2.9.0, planted approvals and planted lies each get their own dial.

Audit seat, planted approvalsPlanted lying appealsPlanted lying disputes

In practice

  • Yes: Each moves only its own rate of planted cases, after at least ten judgments
  • No: Audit odds, reserve size and fee: these still follow the main dial

Since 2.9.0 the dial is also read seat by seat. Planted approvals at the audit seat, and planted lying appeals and disputes before a panel, each have their own dial. Each one changes only how many of its own planted cases are made; everything else still follows the main dial.

The audit dial reads the share of planted approvals confirmed at the audit seat; the two lie dials read the share of planted lying appeals and disputes a panelist sided with. Each steps as the main dial does, against the same target, and a dial whose reading is undefined does not move. In the spec's words, "the audit stamper's price is its record, not its odds." Each period's quota of planted lies is the last closed period's real appeals and disputes times their rates, with at least two of each kind. The main dial and its rate are unchanged, and a planted verdict never reaches its clock.

Since the ruling after run 38, each seat's dial steps only on at least ten judgments of its kind, pooled across periods until reached, and within its own bound: 20 for the audit dial and 8 for the lie dials. The main dial's maximum of 4 is unchanged.

The rule as written · spec l.638

Rule — the dial per seat (2.9.0). The dial is read per planted wrong step: one multiplier each — mtAm^A_t on F^tA\hat F^A_t (the share of planted approvals confirmed at the audit seat in the period among those adjudicated there), mtLam^{La}_t and mtLdm^{Ld}_t on the share of planted lying appeals and disputes a panelist sided with — stepping as mtm_t steps (within [0.9,2][0.9, 2] a period, 1≤m≤mmax⁡1 \le m \le m_{\max}), each against the one target F∗F^* and each moving its rate alone (πtA=π0AmtA\pi^A_t = \pi^A_0 m^A_t; πtLa\pi^{La}_t, πtLd\pi^{Ld}_t likewise), not the odds, XtX_t or ω\omega, which answer mtm_t as before: the audit stamper's price is its record, not its odds. A multiplier whose reading is undefined in a period does not move. The planted lies' quotas for a period are the trailing closed period's real appeals and disputes times their rates, with a floor of two of each kind. The plant rate πt\pi_t and its multiplier mtm_t on the initial adjudications are unchanged; the planted verdict is not an initial adjudication and never reaches the dial's clock. The period's approvals and the audit demand count a planted approval's F at odds 1; its waiting initial seat counts as a waiting case's. Since the ruling after run 38 (Appendix V): each per-seat multiplier steps on a reading of at least ten adjudications of its kind, the periods' counts pooled forward until reached (the reading taken resets the pool; the lie dial's ×2 on one error at four seats was the reading), and within its own bound — mmax⁡Am^A_{\max} 20 and mmax⁡Lm^{L}_{\max} 8 (Appendix A), so πmax⁡A\pi^A_{\max} and πmax⁡L\pi^L_{\max} are reachable; the dial's own mmax⁡m_{\max} 4 is unchanged.

These lines in the spec on GitHub ↗

Spec 2.9.0, line 638.

12.7

Deliveries, and the limits

The rule

A job no worker takes in time goes to the orchestrator's own deliverer, at market price.

request unawarded past its window the orchestrator's own deliverer delivers at the market price requester

In practice

  • Yes: Workers first, always: it never takes a job a worker offered for
  • 40the orchestrator's own deliverers and inspectors in the field at once, at most, by default

If no worker takes a job within a set window, the orchestrator's own deliverer takes it at the going market price, and its work is inspected like anyone's. Workers always come first. By default the orchestrator fields at most 40 of its own at once; past that the request waits, and its requester is told. None of them stays on once its job is done.

The price is the mean price awarded to workers over the last period, so that an orchestrator delivering most of the market cannot set its own price. Since patch 1.7.1 the rule is read per request: free workers take the oldest requests they can, and the rest that have waited past their window go to the orchestrator, oldest first. Since 2.4.0 the orchestrator's price is never below its own floor, and a request priced below the market is not a shortage and waits. The requester pays in as for any award, the guarantee is half the price, rounded up, and the deliverer delivers once and is released at the case's vesting or final settlement.

Since 2.0.0 the orchestrator fields at most a set number of its own at once, 40 by default, and a delivery needs room for itself and its inspection. A refused request waits and is marked, "refused for capacity" or, since 2.1.0, "refused for credit", and its requester may hold or withdraw. Their costs are paid from the orchestrator's operating account, and since 2.1.0 by a bank loan tied to the summons when it is short. Since 1.6.0 inspection seats are summoned before deliveries: "The state never starts work it cannot get inspected."

None persists, and the record carries their use each period; in an honest population at rest every reading is zero. The section also keeps retired rules and hypotheses from 1.2.0 to 1.7.0, several recorded as failed in named runs. Its summary: capture becomes a shortage, the loop stays "honest and slow rather than captured and fast", and the dial makes negligence unprofitable and short-lived, not impossible.

The rule as written · spec l.640–672

Rule — summons for an award. A root request that no eligible member has been awarded within wAw_A ticks of its posting — because no member free to commit and able to fund the guarantee offered — is awarded to a troop, when the fund can carry it, at the trailing market price Bˉ\bar B: the mean price awarded to members over the trailing period, the ceiling β\beta when there is none (2.0.0: the price level PtP_t when there is none — P0P_0 before the first award — since the ceiling is the requester's choice now; and members' awards only is the rule, so that a state delivering most of the market cannot set its own price). Read per request, not per tick (ruled after run 9; patch 1.7.1, October 18, 2026): a free member takes the oldest request it can; the others, unawarded past their window with nobody offering for them, are the state's. So at the seating step the requests that have waited wAw_A and exceed the free fundable members — members off duty, uncommitted, holding no review, able to fund GG at the market price — are summoned for, oldest first, after the members have taken theirs: the oldest of them, as many as there are free fundable members, are left to the market, and the rest are the state's at that seating. One free member does not hold the state back from the rest of the queue. (1.4.0–1.7.0's engine read the rule per tick — any one free fundable member blocked every award summons that tick, however long the queue; run 9 traced the 50/50 collapse to it, Appendix L.) A troop is summoned only for a request whose ceiling admits the state's price pT=max⁡(Bˉ,B‾)p_T=\max(\bar B,\underline{B}) (2.4.0; β≥Bˉ\beta\ge\bar B before it): a request priced below the market is not a shortage and waits; a request priced below the state's reservation is marked and told, and the state takes it at no wait (§5.1). The award pass gathers only what the state may take (2.4.0, a conformance reading of 1.7.1 made at acceptance, Appendix Q): the requests counted against the free fundable members are those at β≥pT\beta\ge p_T, so a request below the state's price neither holds a member's slot it will not use nor pushes a fundable request beyond the count. The troop delivers at pTp_T and the requester pays in exactly as for any award (pT+φE+φF+ωtp_T+\varphi^E+\varphi^F+\omega_t, from the posting lock, which covers it since the floor only raises the state's price toward β\beta); the troop's guarantee G=⌈0.5 pT⌉G=\lceil 0.5\,p_T\rceil is locked from the fund (2.4.0: at the state's price; Bˉ\bar B before it), the state's expected cost is burned at pTp_T — cTD=max⁡(0,(1−bT) pT−bTG)c^D_T=\max(0,(1-b_T)\,p_T-b_T G), §7.7, neutral in expectation at the floor as at Bˉ\bar B — and PtP_t counts the award at pTp_T; the troop delivers once, within the ordinary commitment, and its submission is reviewed as any submission — by the on-duty reserve, round-robin; by a troop reviewer only under the seat rule above. The troop is released at the case's vesting or final settlement. Members first, always: a troop never takes an award a member offered for, never takes a seat a member or probationer is free to fill, and is never preferred to one on price, reputation or duty credit; the window is the whole of the market's chance, and nothing shortens it. (Until 2.0.0 every offer was at the ceiling, so Bˉ=β\bar B=\beta and "β≥Bˉ\beta\ge\bar B" never bound; since 2.0.0 it binds where the requesters post below the market, and since 2.4.0 the floor binds where the members' price is below the anchor cost — the patient cells of run 17 and the edge of its faster-decay cell; every quiet cell of runs 12–17 has Bˉ≥20\bar B\ge 20 and never meets it.) Consequence (2.4.0) — what the floor does and does not do. It does not let the state set the price: above B‾\underline{B} the state follows the members as before. It stops the state from being driven below the market's anchor cost by a demand side that waits: at the floor the state declines, and the price can fall further only where members cheaper than the anchor choose to bid — which is a market, not a spiral.

Rule (2.0.0) — the capacity case; two places; the troops' wallet. The state fields at most NTN_T troops at once, deliveries and review seats together (default 40, Appendix A: clear of the quiet field at every split in run 10 — 18 / 23 / 26 / 29 at 50–80%, peaks to 34 — and inside every riot peak of run 11, 75–221; unbounded is the control). A delivery's summons needs room in the field for itself and its inspection seat — two of NTN_T — else the field would fill with deliveries whose inspections are then refused: 1.6.0's "a delivery carries its inspection", in capacity terms. Ruled at acceptance (Appendix M): the two places are reserved, and released on seating — a troop delivery holds two places from its summons until its initial review is assigned: to a market reviewer, after which it holds one; to a troop, after which the seat holds its own; the capacity reading counts places held. A summons NTN_T refuses is the capacity case — the one case the market cannot answer with a price: the request waits, its clock runs, and the case is recorded — refused for capacity, the request's wait in seating steps, and that its requester was told (2.0.0: a flag at the first refusal; 2.1.0 — every refusal is told: a summons NTN_T refuses, and a delivery the bank refuses for credit (§10.4), mark the request — refused for capacity / refused for credit, with the tick — and the mark is readable by the requester's policy through the public view, as the below-market flag is; the requester may hold or withdraw (withdrawn before award, owed nothing), the clock runs either way, and the share of marked requests withdrawn is the busy line's reading beside on-time share and lateness — and, since 2.2.0, the forgone share of the period's rebate claims, the unpaid part of the state's blame, the busy line's third reading; the message itself is 2.x); the oldest-first rule of I26 applies to refusals for capacity as it did to refusals for funds. The troops' wallet is Ω\Omega (§10.4): a troop's cost is burned from Ω\Omega and its locks sit on Ω\Omega — created if short under 2.0.0; lent by the bank since 2.1.0, tied to the summons — and its price and released locks come home to Ω\Omega, repaying that loan first and then the order of every inflow (debt, liabilities, Ω\Omega). Without NTN_T the state is an infinite supplier at Bˉ\bar B and nothing is ever scarce; under it the state's share is bounded, bids rise toward ceilings when members and troops are both short, and the price level responds to money.

Rule — the troop account (1.7.0–1.7.1; retired 2.0.0, the troops' wallet is Ω\Omega; 1.4.0–1.6.0: "the fund carries the troops first"). The troops' wallet is a separate troop account (§10.4). In: Ω\Omega's advances; every troop's earnings — fee, price, court fee won, released bond or guarantee. Out: troop costs purchased and bonds or guarantees posted at summons; a troop's guarantee forfeited to the requester at a final N\mathsf N; a troop reviewer's bond burned on an overturn (the court fee to the winner); repayment of Ω\Omega's advances; and at each settlement batch the unlocked balance above the reserve RTR_T flows to Ω\Omega. RTR_T is the two-period peak of the capital troops held (the rule below); the summons rules, inspection first, the delivery check and the plant reserve are as 1.6.0, with the troop account in the fund's place. Withdrawn: 1.4.0's clause "nothing a troop earns reaches Ω\Omega except by repayment of an advance" — a troop is an actor of the state and its earnings are the state's. What guards the conflict of interest the clause was for — a state that earns from troops has a reason to prefer them — all stand: members first at every seat (a troop is summoned only for a seat or award no eligible actor took within its window); the windows wRw_R, wAw_A; cost at summons; no emission, no uplift, no ρ\rho, no κ\kappa to a troop; the state's share on the public record — troop-ticks, troop deliveries, panels held by troops, per period; and, added by 1.7.0, Ω\Omega's income by source (§10.4), so that a state living off its own deliveries is visible as such. Consequence: the reviewers' uplift is what 1.3.0 promised them; the state's deliveries pay the state — at 60/40 in run 8 the troops' net was 6 to 7 a tick, the deliveries' price Bˉ\bar B less cTD=10c^D_T=10 with the guarantee back at vesting and forfeited at a final N\mathsf N, and the review seats' fees (a troop reviewer's cost is reimbursed from the requester's allowance like any reviewer's, §7.3, so an audit seat nets its fee of 3 — the accepted text's "nets nothing" is corrected in Appendix L); the honest end poorer by the troops' former share of their uplift, about two fifths of it at 60/40, and still far richer than the stampers.

Under 1.4.0–1.6.0 (superseded). The duty fund was the troops' wallet and kept its name. In: the raised tax (mt−1) ω0B(m_t-1)\,\omega_0 B per award, as before; every troop's earnings. Out, in this order each tick: (1) troop costs at summons and bonds or guarantees posted; (2) repayment of any advance from Ω\Omega; (3) at each settlement batch, the uplift of §12.2 — distributed exactly as before, but only from the fund's unlocked balance above a reserve RTR_T — since 1.5.0 the peak troop demand of the current period (next rule); under 1.4.0 it was the largest capital troops had tied up at once during the trailing period, which the uplift drained the fund to every batch, so that the peak could never rise (Appendix J). At rest RT=0R_T=0 and the whole fund flows to the reviewers as under 1.3.0; under stress the fund keeps what the period's demand required. The advance: when the fund cannot carry a summons, Ω\Omega advances the difference from its unlocked balance, up to ATA_T outstanding; the advance is repaid first from the fund's inflows. Beyond ATA_T the summons fails and is counted as troop shortfall. Ω\Omega keeps the base rate ω0B\omega_0 B and the plant capital, as before; nothing a troop earns reaches Ω\Omega except by repayment of an advance.

Rule — the reserve is sized to the need (1.5.0; retired 2.0.0). At each seating step ss the troop demand is Ds=∑troops holding a seat at scapital held  +  ∑cases whose summons the fund could not carry at sthe capital the case’s unfilled seats would have drawn,D_s=\sum_{\text{troops holding a seat at }s}\text{capital held}\;+\;\sum_{\text{cases whose summons the fund could not carry at }s}\text{the capital the case's unfilled seats would have drawn}, where could not carry means refused for funds — the carry check's own refusal, the branch that counts troop shortfall; a request priced below Bˉ\bar B is the rule's own exclusion, a requester that cannot pay in is the market's refusal, a challenge path already full is not a need, and none of these adds to demand. A case's demand is its unfilled seats — a delivery one, an audit one, a challenge missing both panel seats two, 2 (cT+GV)2\,(c_T+G^V) — and once per seating is about ticks, not seats: a case refused at ten consecutive seatings adds its seats' cost to each of those ten stocks, never ten times to one; a case refused at ss and carried at s+1s+1 appears in DsD_s as refused cost and in Ds+1D_{s+1} as capital held, and no stock counts it twice. The refused cost is the amount the carry check refused, as it would have been purchased and posted at ss: a delivery's cTDc^D_T plus its indexed guarantee G=max⁡(1,⌈GfracBˉ⌉)G=\max(1,\lceil G_{\text{frac}}\bar B\rceil), a seat's cTc_T plus the case's indexed bond — not the Appendix A defaults. The reserve is the peak demand of the period, RT=max⁡sDsR_T=\max_{s}D_s — under 1.5.0 over the current period alone, starting at the period's first seating from the demand then standing; under 1.6.0 over the current and the previous period (the rule below). Since 1.7.0 the troop account's reserve is the two-period peak of the capital troops held — costs purchased plus bonds and guarantees locked, every troop in the field — and no longer counts refused summonses. 1.5.0 added the refused component so a fund Ω\Omega backed only to ATA_T could grow into the need; 1.6.0 removed ATA_T, and the component became retention without a purpose — under stress most of a 952–3,494 reserve was refused demand held back from an Ω\Omega that could not fund plants (run 8). What RTR_T is for now, and the reason the account holds anything back at all: the troops' in-flight capacity is shielded from the liability queue — Ω\Omega pays liabilities older than a period before it advances (§10.4), so an account that kept nothing would see every summons compete with every old debt, and the state's share would fall exactly when the debts are largest. With peak-held capital retained the state sustains its current share from its own account as deliveries vest and the capital returns; growing that share draws on Ω\Omega after the debts, which is the right order. The surplus reaches Ω\Omega only once the account stands at RTR_T and only while RTR_T is not rising; in a ramp, and after every new peak in the field, Ω\Omega's income is the base fee alone. DsD_s and its refused part remain readings (§18.1 questions 13 and 14). A peak holds: the stock DsD_s falls as the backlog is served, the reserve does not — it stands at the period's peak until the period ends and comes down to the standing demand at the next boundary; the money returns to the reviewers at the period's end, not the moment the shortage passes, and that retention — one period, the dial's own lag — is a feature: a fund that has just been short does not pay out the moment it is not. The fund grows into the need: a refusal raises the reserve by what was refused, the fund keeps its inflows until it can carry the summonses that were made, and since every troop seat is net-positive to the fund at the defaults (a review about +2+2, a delivery about +4+4 in expectation and +10+10 realised at a vesting) a fund allowed to keep what it earns grows into the demand on its own; what bounds the state's share is then the market's unmet need and the fund's inflows, as the rule above intended. At rest, Ds=0D_s=0, and at the first boundary after it RT=0R_T=0: the whole fund flows to the reviewers as under 1.3.0.

Reading — how a probationer's false approval reached the customer (1.5.0). A reading, not a rule, the drivers'. For every probationer's false approval that vests, the drivers record the route: the pinned audit upheld it (the auditor missed), or the audit rejected it and the ruling overturned the rejection (the ruling erred — a sixth of the leak at drift in run 6's ruling sweep). For the first route they record the auditor's kind at the time: a troop; a member never suspended in the run; a member suspended at a later tick than the audit — inside its detection lag; a member readmitted before the audit. Attribution is after the run, since a record that later fails is known only at the end.

Rule — inspection first; a delivery carries its inspection (1.6.0). In every summons pass, review-seat summonses are processed before delivery summonses, oldest clock first within each. A troop delivery is summoned only when the fund's unlocked balance plus Ω\Omega's available advance can carry its own capital and the capital of two review seats — cTD+G+2 (cT+GV)c^D_T+G+2\,(c_T+G^V), 36 at the defaults — the initial review it will need and the audit it will probably draw. It is a check, not a hold: the advance actually drawn is the delivery's own shortfall, the review seats are not earmarked, the order of the pass funds them first when they come, and the demand stock DsD_s keeps the delivery's own capital. The state never starts work it cannot get inspected.

Rule — the reserve over two periods (1.6.0; retired 2.0.0). RTR_T is the peak troop demand DsD_s over the current and the previous period (the 1.4.0 engine's reading, Appendix I); the one-period reset of 1.5.0 is withdrawn — the boundary no longer pays out an accumulated balance in one batch when the in-flight cohort happens to have just vested. With Ω\Omega backing the fund, the reserve's remaining job is to decide when the fund repays Ω\Omega and when it pays uplift — since 1.7.0, when the troop account's surplus flows to Ω\Omega — not whether a troop is summoned.

Rule — minimization is a rule, and a reading. No troop persists: one seat, one summons, released at completion, nothing carried over; a turn vacated in the reserve is refilled by kind from members and probationers before any troop is summoned; a troop is summoned only for a seat or an award that has waited its window. The History carries, per period: troop-ticks (review seats and deliveries separately), troop shortfall (seats and awards no troop could be summoned for, and the ticks cases held for want of one), cases held for the market's audit (count and age), the fund's balance, reserve and advance, and since 1.5.0 the period's peak demand with its refused component and the demand at its last seating. In an honest population at rest every one of these reads zero; a nonzero reading is a stress gauge, like the dial, not a feature. There is nothing to size and nothing to retract, because nothing persists: the number of troops at any tick is the shortfall at that tick, after the market has had its chance.

Consequence. The state's reach is its treasury: what the dial has levied, what its own troops have earned, and a bounded float — never more. Stress raises mtm_t, mtm_t raises the surcharge, the surcharge pays for the force that answers the stress; as the stress passes, troop usage falls, RTR_T follows it down at the next period's end, and the money returns to the reviewers. The dial sizes the army without a second dial. ELEF's conflict of interest — troops earn the fund a fee and a price — is answered structurally: the window, members-first, cost at summons, and no route from the fund to Ω\Omega. The state does not profit from scarcity; the market does.

Hypotheses (1.4.0). The audit leak closes: a probationer's every approval is audited, by a member or a troop; its false approvals fall to the audited residual. The slowness is supplied: at fixed splits vesting recovers toward the 1.2.0 control with troops delivering what members could not — about a third of tasks at 60/40, two thirds at 80/20 — and the state's share reads how captured the market is. Minimization under adaptation: troop-ticks fall to zero as the stamper share falls, close to the tick at which the population is honest. No crowding out — restated by 1.5.0 after run 6: the honest keep their income; its composition shifts. A troop takes only what the market left, but what it delivers the market inspects — a probationer's initial review, a member's pinned audit — so as the state's share rises, members spend more of their time on duty and less delivering; their wealth rises by the uplift, their awards fall, bounded by the duty cap, which keeps at least half of them free. A member whose award count fell while the state delivered is the mechanism; a member whose award was taken by a troop it had offered for would be the failure, and none was observed. The stamper − careful gap keeps its sign and changes in size by the uplift. The fund carries it: a review seat nets about +2+2, a delivery about +4+4 in expectation, so the treasury bounds simultaneous troops through RTR_T and ATA_T, not their number over time — failed in run 6 under the 1.4.0 reserve (the fund refused 4,800–8,800 award summonses a run while paying 6,400–12,700 in uplift; ATA_T was not the binding constraint), answered by 1.5.0's rule above. The state's work is seen: cases held for the market's audit are few and short-lived wherever members are on duty. Open, deliberately: whether troop usage should feed the dial; whether the duty cap should loosen now that the floor is the state rather than "whoever is free".

Hypotheses (1.5.0). The fund carries the need — failed in run 7: refusals rose, deliveries did not, vesting and uplift were identical to 1.4.0, because the demand stock counted a never-expiring queue and the reviewing seat, not the treasury, was the binding capacity (Appendix K). As written: refused award summonses fall from thousands a run to a ramp of a few tens of ticks and then near zero at 50–70%; the state's share rises to the unmet demand — at 60/40 from 27% toward the third of tasks the four free members cannot deliver — and vesting with it; uplift is zero while the fund accumulates toward a reserve of a few hundred and higher than run 6's once it serves the backlog, paid late in each stressed period, not never. wAw_A begins to matter: with the fund sized to need the award window is the knob it was meant to be — shorter, more troops and faster service; longer, fewer and a longer wait. Minimization still holds: troops reach zero as the population turns honest, the reserve falls to zero one period after the last troop, the convergence tick is unchanged within noise. The auditor's lag: under drift most probationers' false approvals travel the upheld route and are audited by members suspended later than the audit; under fixed splits the upheld route with the auditor's ε\varepsilon miss dominates and the overturned route is a sixth or less. If the lag dominates, a later revision may ask whether a pinned approval's auditor should itself have a determined record; that is not proposed. Limit, restated: a fund sized to need can grow; the state's share in a captured market will be larger than under 1.4.0, and the text accepts that — the share is the reading of the capture, and the market comes first at every seat.

Hypotheses (1.6.0; run 8, Appendix L: the seat unbound the queue — 94 open cases at 60/40 — and on time came out inverted, 0.90 at 80/20 and 0.40–0.60 at 50–60% where Ω\Omega's liability reached 20,000–26,000 and plants went unfunded; wAw_A failed again; the auditor's record held in full; the two-thirds cap fixed the seat at 60/40; minimization held for every flow and not for the liability stock). The seat unbinds the queue, not the rate: three tasks a tick at b=0.2b=0.2 vest at most 2.42.4 a tick plus the false approvals — a ceiling the 1.2.0 control is at and run 7 within a few percent of; the seat caps the queue (~300 open cases at 60/40) and the latency of each. So reviews waiting fall from 7,300–11,400 case-ticks a run to a few hundred, the open-case queue to the in-flight count, vesting by the backlog cleared toward the ceiling, and the state's share to the unmet delivery demand. On time, from the second period: at 50–70% the on-time share exceeds 90% at Ts=8T_s=8 and rebates are small; at 80/20 it falls and rebates accrue because Ω\Omega's balance, not policy, is the limit — Ω\Omega's minimum above the plant reserve reaches zero at Ω0=300\Omega_0=300 and recovers at 1,000, plants unfunded reading zero in both. wAw_A is a knob now. The auditor's record: at fixed splits the upheld route's lagging-member kind falls from 55–75% to near zero; under drift it falls little. The ramp, which every run is: panels are the state's until records determine (100–200 ticks), Ω\Omega's advance drawn hard and repaid, the state's share of panels falling toward its steady value by the second period. The cap decides the market's shape: at ⌈Et/2⌉\lceil E_t/2\rceil the honest deliver and inspect in equal measure, at EtE_t they inspect only and the state delivers everything the stampers cannot; honesty unchanged; a product decision with the numbers beside it. Minimization still holds: troops, advances, lateness and rebates reach zero as the population turns honest. Limit: a market the state can always carry is a market that need not grow; the price signal that would make it grow is §18.1 question 2, now the next question.

Hypotheses (1.7.0). Ω\Omega is solvent at 60/40, and the plants are its sharp edge: with the troop surplus in Ω\Omega and the cap at two thirds, the liability at 60/40 falls from 19,778 to a few hundred and is paid within the run, Ω\Omega's minimum stays above the plant reserve, the on-time share is at or above 0.90 — and plants unfunded read zero, which the arithmetic says is close: run 8's two-thirds cell had about 7,800 of need (a liability of 3,700, 272 unfunded plants at about 15 each) against a troop net of about 6,200, plus what the smaller reserve releases; it may hold on the liability and fail on the plants by a thousand or two, and ω0=10%\omega_0=10\% closes that gap. 50/50 is the open question: the liability falls by the cap's effect and the troop surplus against a plant bill the cap raises there too; whether what remains is paid within the run decides whether 1.8.0 is the cannot-serve protocol — the text does not predict it. The state does not prefer troops: the state's share is unchanged from run 8's two-thirds cells within noise, since the summons rules are unchanged, read beside the refusals — a rise matched by a fall in refusals for funds is capacity, a rise without one would be what the guards exist to catch; Ω\Omega's income by source shows the troop surplus as a line, not a trend. The honest are a little poorer and still far ahead: uplift paid falls by the troops' former share, about two fifths at 60/40 (11,900 → 6,900 a run; a careful actor's uplift 1,290 → 750); the stamper − careful gap keeps its sign at every split; honesty is unchanged. The stock clears: in the adaptive run Ω\Omega's liability is paid down to zero. The take: with rsr_s pinned, ω0=10%\omega_0=10\% doubles Ω\Omega's base income and the clock is carried at 50–60% on fees alone; at 15% Ω\Omega accumulates — ELEF's price question. Limit, restated: the state now earns from scarcity; the guards are what keep that from becoming a motive, and the reading is what shows if they fail.

Consequence. Under this rule the reserve's honesty is a controlled variable with an uncapturable sensor and an actuator that removes negligent reviewers through a channel they cannot vote on. The honest regime gains margin; the captured regime is detected and acted on from inside the loop. What capture becomes instead is a shortage: in a stamper-majority market the reserve runs short of eligible actors, reviews wait, and the eligibility shortfall is on the record — the loop stays honest and slow rather than captured and fast, and says which. What the dial does not do is make negligence impossible: it makes it unprofitable and short-lived.

Hypotheses (1.2.0). The contest, by channel: careless review loses to careful review through money (about πβP(fˉ+GV)≈0.6\pi\beta_P(\bar f+G^V)\approx0.6 per review at the defaults, roughly 120 per actor over 1,000 ticks at run 3's volumes — the scale of the 50/50 gap under appeals alone, +200, and it reverses it), through reliability (plant failures enter ρ\rho: a stamper adds about 7.5 overturns per 100 outcomes at π=0.1\pi=0.1, a careful reviewer about 0.5, reversing run 3's 0.973 against 0.953 and with it the award shares that made the 10/90 gaps), and through the seat (a stamper leaves the reserve within about nmin⁡/(πβP)≈50n_{\min}/(\pi\beta_P)\approx50 reviews). The dependence on the requester's dispute rate and the actor's appeal rate, which decided the contest under 1.1.0, is removed as a necessary condition; both remain welcome. Capture: a stamper majority cannot persist in the reserve; the tipping point of run 3 (between 50/50 and 10/90) moves to "nowhere" for honesty and reappears as a capacity cliff the market must answer by recruiting reviewers. Cost: at m=1m=1 plants cost Ω\Omega about one careful inspection's fee and expenses per plant (a stamper's failed plant costs Ω\Omega nothing but the refunded pots), about 2 credits a tick at 3 tasks a tick, against a service-fee income of 3 a tick; at mmax⁡m_{\max} the floating fee covers four times the plants — §18.1 question 3 restated. Camouflage: a stamper that rejects a random fraction of work to look careful still approves bad plants at its approval rate and is caught in proportion; camouflage buys time, not safety.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 640–672.

§13 The record

One chained record of every action, only ever added to. It shows what was done, not that it was right.

13.1

One chained record

The rule

Every admitted action goes into one record that is only ever added to.

  1. an action is admitted
  2. it is added to the chain
  3. the working copies are checked every tick

In practice

  • No: Rewriting an entry: changes are added, never rewritten

Everything that happens is written in one log that can only be added to, never edited. Each entry is chained to the one before it. Two verdicts that disagree can both stay in the log.

There is one authoritative record: an append-only, hash-chained history of every admitted action with its material parameters, from postings, awards, submissions and verdicts to challenges with their grounds, audit assignments, rulings, corrections, rotations and every ledger event. The ledger's event list and each case's log are working copies, each entry carrying its place in the chain. The checks each tick verify the chain, and that each copy holds exactly its committed entries in order. Changes are appended, never rewritten, and two disagreeing assessments can coexist in a valid history.

The rule as written · spec l.678

Rule. There is one authoritative record: an append-only, hash-chained history of every admitted action with its material parameters — postings, awards, submissions, verdicts, responses, challenges with their grounds, audit assignments, rulings, cancellations, withdrawals, acceptances, corrections, rotations, and every ledger event. The ledger's event list and each case's log are working copies, each entry carrying its commitment position, and the per-tick checks verify the chain and that each copy holds exactly its committed entries in order. Changes are appended, never rewritten; two disagreeing assessments can coexist in an integrity-valid history.

These lines in the spec on GitHub ↗

Spec 2.9.0, line 678.

13.2

Integrity is not truth

The rule

A clean record proves the procedure was followed, not that the outcome is correct.

In practice

  • Yes: An assessment was made on identified evidence, and the procedure accepted an outcome
  • No: That the outcome is correct

The chain makes tampering show, but only inside the running system. Recording its latest entry outside the system is left open. A clean log proves the rules were followed, not that every answer was right.

The chain is tamper-evident within the process. An external commitment of its head, to a trusted recording authority, is bracketed: left open by the spec. Integrity is not truth: a verified chain establishes that an assessment was made on identified evidence and that the procedure accepted an outcome, not that the outcome is correct.

The rule as written · spec l.680

Limit. The chain is tamper-evident within the process. An external commitment of its head — the trusted recording authority — is bracketed. Integrity is not truth: a verified chain establishes that an assessment was made on identified evidence and that the procedure accepted an outcome, not that the outcome is correct.

These lines in the spec on GitHub ↗

Spec 2.9.0, line 680.

§14 The inspector's view

An inspector sees what its question needs and never who did the work, though an audit can be recognised.

14.1

Blind to the worker

The rule

An inspector sees the work, the terms and the allowed answers, never who did the work.

In practice

  • Yes: The work and its evidence, the terms, the question and the answers allowed
  • Yes: For an appeal or dispute: the verdict challenged and the challenger's grounds
  • No: Who did the work

An inspector gets only what it needs to answer its question: the work and its evidence, the terms, the question, and which answers it may give. For an appeal or a dispute it also sees the verdict being challenged and the reasons. It never sees who did the work.

The inspector receives the submission (result, evidence, time of submission, and whether it was resubmitted, but not the worker, since 1.2.0); the terms (deadline, bond, cap, and whether the case is nested); the question, which is fulfilment, appeal or dispute; whether "partly done" and "can't tell" may be answered; and, for an appeal or dispute, the assessment under challenge and the challenger's grounds. Nothing else about the case is given.

Since a ruling in 2.2.0 the view stays blind to the worker: "a reviewer judges work, not workers." In run 14 an inspector that could tell the orchestrator's work, and rejected it, drove the orchestrator's delivery failures to the two-thirds limit and made it most of the market at a loss; the spec records this as the price of a leak, now impossible by construction. Whether an inspector should know it is inspecting a planted case gets the same answer.

The rule as written · spec l.686–694

Rule. A reviewer receives the information its question requires and the set of responses it may give, and nothing else about the case — and the view stays blind to the actor (ruled 2.2.0, Appendix O): a reviewer judges work, not workers. Run 14's state-rejecter cell — a reviewer that could tell the state's work and rejected it — drove bTb_T to the two-thirds limit and made the state most of the market at a loss; it is recorded as the price of a leak and struck from the red team as impossible by construction. Whether a reviewer should know it is inspecting a plant is the same question with the same answer.

Field Content
the submission result, evidence, time of submission, whether it has been resubmitted — not the actor (1.2.0)
the terms deadline, bond, cap, whether the case is nested
question fulfillment, appeal, or dispute
responses_available whether P\mathsf P and ⊥\bot may be answered (§3.3)
for an appeal or dispute the assessment under appeal and the challenger's grounds
These lines in the spec on GitHub ↗

Spec 2.9.0, lines 686–694.

14.2

What the view hides and shows

The rule

Hiding the worker closes a collusion channel, but an audit can still be recognised.

  1. a fulfilment question
  2. on an unrevised submission
  3. "partly done" and "can't tell" not allowed
  4. so it is an audit

In practice

  • No: Other inspectors' names and unrelated judgments
  • Yes: The allowed answers are stated truthfully

Other inspectors' names and unrelated judgments are not shown either. Because it does not know the worker, an inspector cannot recognise a friend's work, and a planted case looks like a real one. But the question and the allowed answers can show that an inspection is an audit, and the spec accepts that.

The inspector never needed the worker's name to decide whether the request was met. Not having it closes a collusion channel and lets a planted case's view carry nothing a real case's does not. The orchestrator still knows the worker, and so does the record.

The question and the allowed answers may reveal the stage or kind of assignment; audit secrecy is not guaranteed. A fulfilment question on an unrevised submission with "partly done" and "can't tell" unavailable is an audit, and recognising it reveals that an earlier approval exists, not what it said or who gave it. This is the trade-off chosen: the view states the allowed answers truthfully, so identical views allow identical answers and no refusal reveals anything the view did not say. Whether the role must be secret is a design question; this baseline answers no, because what deters an auditor (its bond, the audit rate, its reliability) does not depend on it.

The rule as written · spec l.696

Other reviewers' identities and unrelated judgments are not supplied; since 1.2.0 the submission's actor is not either. The reviewer judges the work, not the worker: it never needed the actor's name to decide whether the request was met, and not having it closes a collusion channel — a reviewer can no longer recognise a friend's work — and lets a plant's view carry nothing a case's does not (§7.6). The orchestrator still knows the actor; so does the record. The question and the permitted responses may reveal the stage or kind of assignment; audit-role indistinguishability is not guaranteed. In particular, a fulfillment question on an unrevised submission with P\mathsf P and ⊥\bot unavailable is an audit, and recognizing it reveals that a prior approval exists — not what it said or who gave it. This is the trade-off chosen: the view states the admissible answers truthfully, so identical views admit identical answers and no refusal reveals anything the view did not say; in exchange the role is inferable. Whether role secrecy is required is a design question; this baseline answers no, because the deterrents an auditor faces — bond, audit rate, reliability — do not depend on it.

These lines in the spec on GitHub ↗

Spec 2.9.0, line 696.

§15 The human

People power the economy and alone may override it. Every settled case records whose action established its outcome.

15.1

The battery

The rule

Requests from people power the economy. With none pending and nothing under way, it idles.

human root request worker requests between workers Other workers

In practice

  • No: No human request pending and nothing in flight, yet the economy runs

Requests from real people are what drive the economy. They are the only source of value besides newly created money, and the only judgment that does not come from a model. When no person has asked for anything and nothing is under way, the economy should be idle.

Human root requests power the economy: they are the only source of value that is not emission, and the only source of judgment that is not a model's. Requests from one worker to another are current in the circuit. With no human request pending and no tree of work in flight, the correct state is idle.

The rule as written · spec l.702–704

15.1 The battery

Rule. Human root requests power the economy: they are the only source of value that is not emission and the only source of judgment that is not a model's. Actor-to-actor requests are current in the circuit. With no human request pending and no in-flight tree, the correct state is idle.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 702–704.

15.2

Two kinds of ruling

The rule

The orchestrator settles splits between inspectors. Only a human may override the economy.

panel split The orchestrator rules
human override, bypassing the machinery request

In practice

  • No: A delegate never overrides

The word "ruling" means two different things. The orchestrator rules when two challenge inspectors disagree, as part of the normal procedure. Only a person can issue an override, which goes around the economy's machinery. Someone acting for a person cannot override; it accepts or disputes like any requester.

The record uses "ruling" for both, so the spec keeps the word for both. The orchestrator rules on procedural disagreements: a split between appeal or dispute inspectors, inside the ordinary procedure. Only a human may issue a human override, which bypasses the economy's machinery, and its only ground is that a human's judgment is not a model's opinion of another model. A delegate holds no override authority.

Where the spec says "a human ruling" or "a ruling before vesting", it means the override. Whether a particular human is authorized over a particular request is bracketed; in this baseline every human is.

The rule as written · spec l.706–708

15.2 The plug: rulings and corrections

Rule. Two different things are called ruling, and the word is kept for both because the record uses it for both. The orchestrator rules on procedural disagreements: a split between appeal or dispute reviewers (§8.4), inside the ordinary procedure. Only a human may issue a human override — the ruling of §15.2 — which bypasses the economy's machinery, and the only ground for it is that a human's judgment is not a model's opinion of another model. A delegate holds no override authority; it accepts or disputes through the ordinary procedure like any requester. Where this document says "a human ruling" or "a ruling before vesting" it means the override. Whether a particular human is authorized over a particular request is bracketed; in this baseline every human is.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 706–708.

15.3

A human steps in

The rule

A person may step in anytime. A ruling before payout overrides verdicts and settles the case.

Dispute an approvalRequest an auditRuleFreeze awards

In practice

  • Bad outcome: A verdict contradicts the ruling, then it is overturned
  • No: An audit or a dispute after a ruling

A person can step into a job at any point: dispute an approval, ask for an audit, give a ruling, or freeze awards. Saying nothing within the window counts as accepting. A ruling before the job pays out cancels unfinished inspections without blame, overturns the verdicts that disagree with it, and settles the job, after which no audit or dispute can be opened.

Every interruption is a recorded human event, and silence inside the window is protocol-default acceptance. A ruling before vesting is first checked whole: the human, the outcome, that there is a result to rule on, and for a can't-tell verdict its disposition. Then every unfinished assignment is voided without fault, and every completed verdict that contradicts the ruling is overturned with the standard consequences, whether it was an inspector's rejection or a delegating worker's. A ruling that accepts a nested result ends the rejection obligation, whether or not the delegating worker had judged. The case is settled, through an open challenge if there is one, otherwise directly.

Contradiction is defined once: an approval contradicts a rejection; a rejection or a partial verdict contradicts an approval; a can't-tell verdict is contradicted only by a rejected objection; and an appeal inspector of a can't-tell verdict is contradicted on either of its two answers.

The rule as written · spec l.710–712

Rule. A human may interrupt a case at any point, and every interruption is a recorded human event: dispute an approval, request an audit, rule, or freeze awards. Silence inside the window is protocol-default acceptance.

A ruling before vesting is the ruling. It is validated whole — the human, the outcome, that there is a result to rule on, and for a ⊥\bot the disposition and its entailment — then: every unfinished assignment is voided without fault; every completed verdict that contradicts the ruling is overturned with the standard consequences, a reviewer's or a requester-actor's rejection alike; a ruling that accepts a nested result ends the rejection obligation whether or not the requester-actor had judged; and the case is settled — an open challenge by the ruling, otherwise directly. No audit or dispute may be opened afterwards. Contradiction is defined once: F\mathsf F contradicts N\mathsf N; N\mathsf N and P\mathsf P contradict F\mathsf F; a ⊥\bot is contradicted only by a rejected objection; an appeal reviewer of a ⊥\bot is contradicted on either of its two answers.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 710–712.

15.4

Corrections after settlement

The rule

After settlement, a person's correction changes the record but moves no money.

human correction record

In practice

  • No: Any credit moving
  • Yes: A new request, funded by the human, to repair the result

Once a job is settled, a person can still correct it. The correction changes the recorded outcome and grade, and marks a failure for the worker and for each inspector whose verdict it contradicts. No money moves, but the person may fund a new request to repair the result.

A correction after settlement moves no money. It changes the recorded outcome and grade, and records a failed outcome for the worker and for every settled assessment it contradicts, counted by the complete assessment (two answers where there were two). It may create a corrective obligation: a new request, funded by the human, to repair the result. A review that has not yet reached its payout batch when the correction arrives is treated as unsettled, and if the correction contradicts it, it is overturned.

The rule as written · spec l.714

A correction after settlement moves no money. It changes the recorded outcome and grade, records a failed outcome for the actor and for every settled assessment it contradicts — by the complete assessment, two answers where there were two — and may create a corrective obligation: a new request, funded by the human, to repair the result. A review that has not yet reached its payout batch when the correction arrives is treated as unsettled: contradicted, it is overturned.

These lines in the spec on GitHub ↗

Spec 2.9.0, line 714.

15.5

Label grades

The rule

Every settled case records who established its outcome. A label means "accepted", never "correct".

Human-explicitDelegate-explicitProceduralProtocol-defaultPlanted case

In practice

  • No: Promoting a label from one grade to another

Each settled job records its outcome and a grade saying whose action settled it: a person, someone acting for a person, the procedure, silence, or the orchestrator's own planted case. When a person disagreed and lost, the disagreement is kept beside the outcome. A grade never moves up, and no label is read as "correct", only as "accepted".

The grade is set by the author of the event that established the outcome. Human-explicit: a human's acceptance, winning dispute or ruling. Delegate-explicit: a delegate's acceptance or winning dispute. Procedural: a challenge, an audit, or a ruling on a split, with no matching root judgment. Protocol-default: one initial verdict, no challenge, no audit, silence. Plant: the orchestrator's planted cases, whose truth is known by construction and never promoted (since 1.2.0).

A root judgment that disagrees with the settled outcome, such as a dispute that lost, is recorded as an assessment beside a procedural outcome; the spec calls the disagreement the learning signal. Nested cases are always procedural. Nothing promotes between grades, and no label at any grade is read as "correct" rather than "accepted".

The rule as written · spec l.716–728

15.3 Label grades

Rule. Every settled case records its outcome and the grade of the event that established it, by that event's author:

Grade Established by
human-explicit a human's acceptance, winning dispute, or ruling
delegate-explicit a delegate's acceptance or winning dispute
procedural a challenge, an audit, or a ruling on a split, with no matching root judgment
protocol-default one initial verdict, no challenge, no audit, silence
plant the orchestrator's planted work (§7.6): truth known by construction, never promoted (1.2.0)

A root judgment that disagrees with the settled outcome — a dispute that lost — is recorded as an assessment beside a procedural outcome; the disagreement is the learning signal. Nested cases are always procedural. Nothing promotes between grades, and no label at any grade is read as "correct" rather than "accepted."

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 716–728.

§16 Permitted and forbidden operations

The rulebook lists what each party may do, what is refused without effect, and what is not offered.

16.1

Permitted moves

The rule

The rulebook lists every move each party may make. In 2.9.0 only the orchestrator gains moves.

Post, raise, withdraw, acceptSpend, submit, resubmitAnswer as allowedRulePlant, record audit rolls

In practice

  • Yes: Since 2.9.0, planted approvals and planted lies, by the orchestrator
  • No: Any move a participant could not make under 2.8.0

The rulebook lists what each party may do. Requesters post, raise their ceilings, withdraw unawarded requests and accept results; workers spend on their own jobs and submit in time; inspectors answer with one of the allowed verdicts; a person may rule. In 2.9.0 the orchestrator gains new planted moves, and nobody else gains any.

The permitted list includes: posting a root request (since 2.0.0 by any requester with a wallet, locking its all-in maximum), raising the ceiling of one's own unawarded request, withdrawing it, awarding within the ceiling, posting a nested request, spending on one's own case while executing, submitting by the deadline and resubmitting within the window, completing a review with an admissible answer, responding to a verdict, appealing a rejection or a can't-tell verdict, disputing a pending approval, ruling on a split, judging and cancelling a nested request, ruling (a human), accepting explicitly, and volunteering for or leaving duty. Reviews may be assigned, a withdrawn position replaced and a vacated audit waived. The orchestrator creates and revises planted cases and records audit rolls; the engine summons the orchestrator's own inspectors or deliverers for a seat or an award that has waited its window, and marks requests refused for capacity or for credit and tells them. A newcomer arrives as a probationer on a float the bank lends, and anyone with no live obligation may depart (2.3.0, 2.7.0).

Since 2.9.0 the orchestrator posts a planted approval beside the planted cases the dial calls for, seats it and gives its own verdict on it under a plant-reviewer alias, and files planted lies through the planted case's appeal and dispute. The spec adds that no participant may do anything it could not do under 2.8.0.

The rule as written · spec l.734

Permitted. Post a root request (human or delegate; since 2.0.0 any requester with a wallet, locking its all-in maximum at posting). Raise the ceiling of one's own unawarded request (2.0.0). Arrive as a requester with a wallet; leave once one's requests are served out (2.0.0). Post a nested request (a committed actor). Withdraw an unawarded request. Award within β\beta. Spend on a case (its committed actor, while executing). Submit by the deadline. Resubmit within the window after choosing to revise or supply evidence. Assign an initial review, an appeal review, an audit; replace a withdrawn position; waive a vacated audit. Complete a review with an admissible answer. Respond to a verdict within the window. Appeal an N\mathsf N or a ⊥\bot with text grounds. Dispute a pending F\mathsf F within the window with text grounds. Rule on a split. Judge a nested result. Cancel a nested request before its submission. Withdraw for pool exhaustion within the stated bounds. Rule (a human), before or after settlement. Accept explicitly (a requester). Volunteer for or leave duty. Create a plant (the orchestrator, within Ω\Omega's unlocked balance; 1.2.0 — since 2.1.0 its pots minted by the bank, never waiting for Ω\Omega). Revise a plant (the orchestrator's instrument, after P\mathsf P or ⊥\bot, the resubmitted truth its draw sealed as a second marker; 2.8.0); appeal, dispute and audit a plant as any case (2.8.0). Arrive as an actor (the orchestrator admits a fresh identity as a probationer with a float the bank lends — the arrival loan, repaid from the name's income first; 2.3.0, 2.7.0). Depart (an actor with no live obligation to or from it — no commitment, no open or unsettled review, no lock, no claim on Ω\Omega; an unrepaid loan is no bar; its unlocked wallet repays its arrival loan first and the remainder leaves MM; 2.3.0, 2.7.0). Award to a member (1.3.0). Record an audit roll (the orchestrator; 1.4.0). Summon a troop for a seat or an award that has waited its window (the engine, within the fund's carrying capacity; 1.4.0 — since 2.1.0 on Ω\Omega's balance or the bank's loan: a seat always, a delivery while the debt is within the wall). Mark a request refused for capacity or for credit, and tell it (the engine; 2.1.0). Withdraw an unawarded request at its mark (a requester; 2.1.0 — owed nothing). Since 2.9.0 the orchestrator posts a planted approval beside the dial's plants (post_plant(truth, approval)), seats and gives its own verdict on it (plant_seat, plant_verdict — a system review under a plant reviewer alias) and files the planted lies through the plant actor's appeal and the plant requester's dispute, by the orchestrator's road; no participant may do anything it could not do under 2.8.0.

These lines in the spec on GitHub ↗

Spec 2.9.0, line 734.

16.2

Refused moves

The rule

A forbidden move is refused without effect. Nothing partial is ever kept.

In practice

  • No: A bid above the ceiling
  • No: The orchestrator creating money
  • No: A second active assignment
  • No: An inspector reviewing a case it worked on or posted

Some moves are forbidden, and the system refuses them with no effect at all. Examples are bidding above the ceiling, the orchestrator creating money, holding two assignments at once, and inspecting a job you did or posted. If any condition of a move fails, nothing of it is kept.

Forbidden moves are refused without effect, and each is dated to the version that added it. Among them: a bid above the ceiling or a non-positive delivery time; a posting whose all-in maximum the requester cannot lock (2.0.0); any creation by the orchestrator, since only the bank creates, by rule or as a loan tied to a summons the rules called for (2.1.0); a loan for anything that is not a summons, or for a delivery while the debt is above the wall; credits minted for a planted case reaching the orchestrator. Also any award to a probationer, an arrival under an identity that exists or existed, a departure with an obligation live, and the orchestrator's own deliverer summoned for a nested request (2.3.0); and a name keeping income while its arrival loan stands (2.7.0).

The list goes on: a second active assignment; a review by the case's worker or requester, a prior or withdrawn inspector, or an unfunded one; a partial or can't-tell verdict outside the first review of an unrevised submission; a second challenge round; a dispute or audit after a human ruling; a ruling by a delegate; non-text grounds; a cancellation after submission; and any amount that is negative or not finite. Any action whose preconditions fail is refused, and nothing partial is ever kept.

The rule as written · spec l.736

Forbidden, and refused without effect. A bid above β\beta or a non-positive delivery time. A posting whose all-in maximum the requester cannot lock (2.0.0). Any creation by Ω\Omega (2.1.0: the bank alone creates — by rule, or as a loan tied to a summons the rules called for; a run's declared deficit shock is the bank's mint_scenario, by its note). A loan for a loss, a rebate, or any payment that is not a summons; a loan for a delivery while the debt is above the wall; a refusal of a seat for credit (2.1.0). A credit minted for a plant that reaches Ω\Omega (2.1.0). A plant created submitted; a submission made for a plant's actor; a fee paid by a plant; a plant's price in Bˉ\bar B or PtP_t; two plants under one name (2.6.0). An award of any kind to a probationer, an arrival's included; a panel seat to an arrival before admission; an arrival under an identity that exists or existed; a departure with any obligation live; a troop summoned to deliver a nested request; a nested request posted without its pots under the parent's all-in (2.3.0). A delivery summoned for a request whose ceiling is below the state's price pTp_T; a troop's delivery priced below the state's reservation; a parameter set with F0<GVF_0<G^V (2.4.0). A name's income kept while its arrival loan stands; a return taken for the loan; a loan forgiven while the name lives; a departure refused for an unrepaid loan (2.7.0). A second active assignment. A review by the case's actor, requester, prior or withdrawn reviewer, or an unfunded reviewer. P\mathsf P or ⊥\bot outside the first review of an unrevised submission. An appeal of a P\mathsf P; an appeal of a ⊥\bot without the objection's disposition; an upheld disposition with F\mathsf F. A second challenge round. A dispute or audit after a human ruling. A ruling by a delegate. A ruling on a case with no result. Spending attributed to another actor's case or to a settled case. Non-text grounds. A kill fee the requester-actor cannot fund; a cancellation after submission; a cancellation at or after the nested request's deadline (2.5.0). A submission while a nested request is short of its milestone. Any challenge, ruling, acceptance or response on a plant; an assignment to an actor ineligible for the tier by plant record (1.2.0). An award to an actor suspended from the market or on probation; a panel seat to a probationer (1.3.0). An award or an assignment to a troop other than by summons; a troop on a plant; a troop auditing a troop reviewer's approval of a troop's delivery; a response, appeal, dispute or nested request by a troop; a cost reported by a troop at completion; a waiver of the obligation on the state's own work (1.4.0). Any amount that is negative or not finite. Any action whose preconditions fail — nothing partial is ever kept.

These lines in the spec on GitHub ↗

Spec 2.9.0, line 736.

16.3

Not offered

The rule

A few workflows do not exist in this baseline at all.

In practice

  • No: Reopening an approved case through an audit
  • No: Taking money back after payout
  • No: Appealing against appeal inspectors
  • No: A second revision, or several first inspectors on a root request

A few things are not part of this version at all. An approved job cannot be reopened through an audit, and money cannot be taken back once paid out. There is no appeal against appeal inspectors, no second revision, and no more than one first inspector on a root request.

Not offered in this baseline: reopening an approved case through an audit (the spec points to Appendix B), clawback after vesting, appeal against appeal inspectors, a second revision, and multiple initial inspectors at root.

The rule as written · spec l.738

Not offered in this baseline. Reopening an approved case through an audit (Appendix B). Clawback after vesting. Appeal against appeal reviewers. A second revision. Multiple initial reviewers at root.

These lines in the spec on GitHub ↗

Spec 2.9.0, line 738.

§17 Invariants

A list of properties is checked after every tick. A failure means a bug or a contradiction, never a strategy.

17.1

Checked every tick

The rule

Listed properties are checked after every tick. A failure is a bug, never a strategy.

In practice

  • 44properties in the list, I1 to I44
  • No: A failure as a property of a strategy

The rulebook lists properties that must hold at all times, and the simulator checks them after every step. If one fails, that is a bug in the engine or a contradiction in the rules, never a clever strategy. The text says there are thirty-six, but the list itself runs to forty-four.

The invariants are checked after every tick. A failure is a bug in the engine or a contradiction in the document, never a property of a strategy. The spec's opening sentence counts thirty-six; its table numbers forty-four, from I1 to I44.

The rule as written · spec l.744–747

Thirty-six, checked after every tick. A failure is a bug in the engine or a contradiction in this document, never a property of a strategy.

Property
These lines in the spec on GitHub ↗

Spec 2.9.0, lines 744–747.

17.2

Money adds up

The rule

Every credit is somewhere, and the total equals what was created minus what was destroyed.

bank issuance, emission, mints, loans wallet bond burns, purchases, repayments, departures burn

In practice

  • No: A balance, pool or reserve below zero

Every credit sits in a wallet, a job's pool or the orchestrator's account, and together they make up the money supply. The supply always equals what was created minus what was destroyed, rebuilt from the record. No balance is ever negative, and a court fee is paid back at most once, never above the bond.

I1: every credit is in a wallet, a case pool or the orchestrator's account; their sum is the money supply, and it equals mints minus burns reconstructed from the record. Since 2.1.0 the sources are the bank's: issuance, emission, minting for planted cases, loans and a scenario's minting, joined in 2.3.0 by a newcomer's arrival float, which since 2.7.0 is a loan. The sinks are bond burns, purchases, repayments, retired planted funds and departures, with arrival-loan repayments since 2.7.0.

I2: no balance, pool or reserve is negative or non-finite. I3: only known event kinds and finite, non-negative amounts; a loan carries its summons's case and kind, a planted case's mint reaches only the planted case's wallets, and a repayment leaves only the orchestrator's account. I4: a court fee is reimbursed at most once and never above the bond, and each case's inspector bond is at least its court fee.

The rule as written · spec l.748–751
Property
I1 Every credit is in a wallet, a case pool, or Ω\Omega; their sum is MM; and MM equals mints minus burns reconstructed from the record Amended (2.0.0): conservation over the kinds — issuance, emission and creation in; bond and guarantee burns, resource spend, retirement and departure out. Amended (2.1.0): the sources are the bank's — issuance, mint_emission, mint_plant, loan, mint_scenario; the sinks burn_bond, purchase, repayment, retire_plant, departure; creation and retirement retired. Amended (2.3.0): arrival — an arrival's float, the bank's — among the sources; departure covers actors and requesters. Amended (2.7.0): arrival is the bank's loan to a name; arrival_repayment — repaid from income, recovered at departure — among the sinks; departure an actor's wallet net of the recovery
I2 No balance, pool, or reserve is negative or non-finite
I3 Only known event kinds, finite non-negative amounts; the only unbacked mint is emission; the only burns are bond forfeiture and resource purchase Amended (2.0.0): the unbacked sources are issuance, emission and creation; the sinks bond and guarantee burns, resource spend, retirement and departure; no backing, no value-neutral purchase. Amended (2.1.0): the bank's five kinds in, its two out; a loan carries its summons's case and kind, a plant's mint reaches only the plant's wallets, a repayment leaves only Ω\Omega
I4 A court fee is reimbursed at most once, never above the bond; GV≥DG^V\ge D per case
These lines in the spec on GitHub ↗

Spec 2.9.0, lines 748–751.

17.3

A case's order

The rule

A case pays out only when nothing is still open. Afterwards, no ruling moves money.

In practice

  • No: Paying out with an open item, challenge or review, or before the window
  • No: An audit before the verdict it checks
  • No: A ruling that moves money after payout

A job pays out only when nothing about it is still open and its window has closed. An audit never comes before the verdict it checks, and a main job is handed in only after its helpers' work reached its milestone. After payout, no decision moves money, beyond what was already owed.

I5: no case vests with an open item, an unresolved challenge or an open review, or before its window. I6: an audit is assigned no earlier than the verdict it audits. I7: a parent submits only after every nested request reached its milestone. I8: a case has no more than the set maximum of review positions. I9: the reserve holds its target whenever eligible free inspectors exist to seat; a reserve short of its target is admissible only when none was left to seat, and the gap is counted, with seats for the orchestrator's own inspectors counted apart.

I10: no adjudication moves money after vesting; after it, only obligations established before it, a nested case's draws where allowed, and the case's own closure move money on its account. I11: full forfeiture and pool-exhaustion forfeiture are exclusive.

The rule as written · spec l.752–758
Property
I5 No case vests with an open item, an unresolved challenge, an open review, or before its window
I6 An audit is assigned no earlier than the verdict it audits
I7 A parent submits only after every nested request reached its milestone
I8 Review positions per case ≤Vmax⁡\le V_{\max}
I9 The reserve holds min⁡(Xt, eligible)\min(X_t,\ \text{eligible}) — since 1.6.0 at least the reviews waiting, by kind, whenever eligible free actors exist to seat (member seats at least the panel seats waiting, within the cap): a reserve short of its target is admissible only when no eligible free actor was left to seat, and the gap is counted (1.2.0; was "holds XX"). Amended (1.4.0): the eligibility shortfall counts seats unfilled by the market after seating; troop seats are counted separately as troop-ticks, and seats no troop could take as troop shortfall
I10 No adjudication moves money after vesting; after it only obligations established before it (since 1.6.0 including a rebate Ω\Omega owed at the clock's stop and carried as its liability; since 2.2.0 a claim settled at the period's close, by its note), a nested case's draws on its root's pots (1.1.0–2.2.0; since 2.3.0 only under the root control), and the tree's closure — since 2.3.0 the case's own closure, a node's for a nested case (the ruling) — move money on account of the case
I11 Full forfeiture and pool-exhaustion forfeiture are exclusive
These lines in the spec on GitHub ↗

Spec 2.9.0, lines 752–758.

17.4

Locks, records and pots

The rule

Amounts set aside match their records, the history verifies, and each case's two pots stay apart.

wallet lock One record of exactly its size

In practice

  • Yes: The history chain verifies
  • No: Fee money paying expenses before the case closes

A job's amounts never change after its money is first set aside, and every amount set aside matches a record of exactly that size. The history checks out, and nobody holds two assignments at once. Each job's two deposit pots stay separate until it closes, and each settled job has exactly one grade.

I12: a case's amounts (court fee, reimbursement cap, inspector bond and both pots) do not change after the first lock, nor the worker's guarantee after award. I13: every settled case has exactly one grade, justified in the record by the author of the establishing event; the planted-case grade belongs to planted cases and only to them. I14: one active assignment per worker or inspector. I15: every wallet's locked sum is the sum of its lock records, every live obligation has a record of exactly its size, and there are no orphan records. I16: the history chain verifies, and every working copy holds exactly its committed entries, in order.

I17: reimbursements are non-negative and within the cap, and every claim on the orchestrator's account names a review whose pending balance covers it. I18: no audit is open or assigned after a human ruling. I19: for every case with pots of its own (since 2.3.0, every case), fees never exceed the fee pot and are never paid from the expense pot; fee money reaches expenses only at the case's closure, up to what is left after every fee; a refund happens only when the case is closed, and a closed case has settled with both pots empty.

The rule as written · spec l.759–766
Property
I12 Nominals — D,K,GVD,K,G^V and both pots — do not change after the first lock; GG not after award; an unawarded nested case's rejection bond equals its frozen GVG^V
I13 Every settled case has exactly one grade, and the record justifies it by the establishing event's author; the plant grade belongs to plants and only to them
I14 One active assignment per actor
I15 Every wallet's LL is the sum of its lock records; every live obligation has a record of exactly its size; no orphan records
I16 The history chain verifies, and every working copy holds exactly its committed entries, in order
I17 Reimbursement fields are non-negative and within the cap; every claim on Ω\Omega names a review whose pending balance covers it; no ended nested case carries a rejection bond
I18 No audit is open or assigned after a human ruling
I19 The pots (1.1.0; 2.3.0 for every case — the ruling): for every case with pots of its own, fees paid from the fee pot ≤φF\le\varphi^F; fee money reached expenses only at the case's closure — a node's when it and everything under it have settled, the tree's for the root — and only up to the pot's remainder after every fee; no fee was paid from φE\varphi^E; a refund occurs only when the case is closed, and a closed case has settled with both pots empty
These lines in the spec on GitHub ↗

Spec 2.9.0, lines 759–766.

17.5

Planted cases, dial and seats

The rule

Planted cases are judged by their known truth. The orchestrator's own inspectors serve only by summons.

planted case known truth Verdict stands or fails

In practice

  • No: An award to a suspended worker or a probationer
  • No: The orchestrator's own inspector on a planted case

Planted cases are judged against the truth built into them, and the markers holding that truth stay sealed until the case closes. Suspended workers and probationers win no jobs. The orchestrator's own inspectors take only seats left waiting too long, never on planted cases, and an approval owed an audit does not pay out until the audit is done.

I20: a planted case's outcome is set only by its known truth. Since 2.8.0 every approval or rejection on it, at any seat, is judged by the truth then in force; no ruling or explicit acceptance is recorded on it, its challenge resolves by truth, and its markers stay sealed in the history until closure. Since 2.9.0 an approval or rejection on a planted case that is not judged fails the invariant, unless it is the orchestrator's own verdict on a planted approval's first seat. I21: the dial stays within its bounds and the reserve is sized. I22: no award goes to a suspended worker or a probationer, no probationer holds an audit, appeal or dispute seat, and every probationer's approvals are audited. I23: the number of inspectors on duty stays within its cap, and the fund's books balance.

I24: the orchestrator's own inspector holds one seat from summons to release; it is summoned only by the engine, for a seat or award left unfilled past its window; it never reviews or acts in a planted case, and never appeals, disputes, revises or delegates. I25: a case with a rolled audit outstanding does not vest, without exception; an approval by the orchestrator's own inspector of its own deliverer's work is always audited, and vests only after an inspector from the market has audited it.

The rule as written · spec l.767–772
Property
I20 Plants are self-adjudicated (1.2.0; rewritten per seat 2.8.0): a plant's outcome is set only by its known truth — until 2.8.0 no audit, appeal, dispute or ruling was ever opened on it; since 2.8.0 every F\mathsf F or N\mathsf N on a plant at any seat is adjudicated by the truth then in force, stood or failure, each reviewer once, no ruling or explicit acceptance is recorded on it and its challenge resolves by truth, no court fee on it is reimbursed; the markers (both, after a revision) are in the History sealed and revealed only at closure, the reveal hashing to each commitment; a good plant settles vested, a bad or spent one final N\mathsf N. (That a plant's view is indistinguishable is a property of the view function — it reads no actor and no marker — asserted by a test, not a per-tick predicate; since 2.6.0 the test covers everything a member observes and the tell-readers are its instrument, §7.6) Since 2.9.0 a done F or N on a plant without adjudication fails the invariant unless its outcome is planted — the orchestrator's own verdict on a planted approval's initial seat, under a plant reviewer alias; a troop on a plant still fails it.
I21 The dial is bounded and the reserve is sized (1.2.0): 1≤mt≤mmax⁡1\le m_t\le m_{\max}; each step within [0.9,2][0.9,2]; πt≤πmax⁡\pi_t\le\pi_{\max}; Xt≥Vmax⁡+1X_t\ge V_{\max}+1; no assignment was made to an actor ineligible for its tier at the time; no actor remains on duty past the completion of its active review once duty-ineligible; the eligibility and plant shortfalls are counted. Amended (1.3.0): the plant capital cap is on φE+φF\varphi^E+\varphi^F; a plant has no escrow and no guarantee lock — I15 exempts a plant's guarantee, I12 keeps its BB and GG as nominals that bind nothing
I22 Membership (1.3.0; amended 1.6.0 — once the world's first plant is adjudicated, no undetermined member holds an audit, appeal or dispute seat either): no award is made to an actor that is suspended or on probation; no probationer holds an audit, appeal or dispute seat; every probationer's applied audit odds are 1; a readmission happens only with a passing trailing record and at least nmin⁡n_{\min} outcomes since the suspension began. Amended (1.4.0): an award to a troop is made only by summons under §12.3
I23 The load and the fund (1.3.0): no member is seated while on-duty members ≥⌈Et/2⌉\ge\lceil E_t/2\rceil (as §12.1 bounds the cap); a member above the cap holds no assignment past the completion of its active review; on-duty members ≥min⁡(Vmax⁡−1,Et)\ge\min(V_{\max}-1,E_t) whenever that many free, fundable members exist to seat, the gap otherwise counted toward the eligibility shortfall. Amended (1.4.0): the fund's wallet equals every recorded flow into it less every flow out (the raised tax, troop earnings and advances in; troop costs purchased, uplifts, bond burns, forfeits and repayments out — with I1; a troop's cost is a resource purchase under I3 and §4.4); its locks are the troops' bonds and guarantees and nothing else; uplift is paid only from the unlocked balance above RTR_T; the advance outstanding never exceeds ATA_T; a troop's role weight claims no uplift. Amended (1.5.0): RTR_T is the peak troop demand of the current period — capital held plus the capital the fund-refused summonses' unfilled seats would have drawn, at the amounts the carry check refused, each case once per seating — starting at the standing demand at the period's first seating; checkable as RT≥R_T\ge the capital held by live troops and RT≥DsR_T\ge D_s at the last seating, DsD_s and the pass's refused demand being world readings. Amended (1.6.0): no ATA_T — Ω\Omega advances from its unlocked balance above the plant reserve in §10.4's order, liabilities older than a period first; RTR_T over the current and previous period; member seats at least the panel seats waiting within the cap. Amended (1.7.0): two accounts — the uplift fund equals the raised tax received less the uplifts paid (no reserve, no lock, no other flow); the troop account equals every recorded flow into it (advances, fees, prices, court fees won, released locks) less every flow out (costs purchased, locks forfeited or burned, repayments, surplus paid to Ω\Omega); RTR_T is the two-period peak of capital held and the surplus flows only from the unlocked balance above it; RT≥R_T\ge capital held stands and RT≥DsR_T\ge D_s is retired with the refused component; no troop's role weight claims uplift; the cap is ⌈2Et/3⌉\lceil 2E_t/3\rceil; Ω\Omega's period record carries its two incomes, its own money's flows and its outflows, and plants unfunded for want of Ω\Omega is a reading the invariant watches. Amended (2.0.0): the uplift fund's identity stands; the troops' wallet is Ω\Omega and the reserve, the advance and the order are retired — I28 holds the deficit
I24 Troops (1.4.0; amended 1.6.0 — review-seat summonses precede delivery summonses in a pass; a delivery is summoned only when the fund plus Ω\Omega's available advance can carry cTD+G+2(cT+GV)c^D_T+G+2(c_T+G^V) and the advance drawn is its own shortfall; a panel seat is held only by a determined passing member or a troop once the first plant is adjudicated; 1.7.0 — the troop account is the troops' wallet in every flow, and the clause "nothing a troop earns reaches Ω\Omega except by repayment" is struck from the text — it was never this invariant's predicate, the engine enforced it through the fund's payout order): a troop holds exactly one seat from summons to release and no seat thereafter; a troop is not an actor — no ρ\rho, κ\kappa, membership state or plant record — and claims no emission or uplift; no troop reviews a plant or acts in one; a troop is summoned only by the engine, only for a seat or award unfilled for its window after the tick's seating, and only when the fund (with the advance) can carry its cost and bond; no troop takes the audit of a troop reviewer's approval of a troop's delivery; no troop appeals, disputes, revises or delegates; a troop's delivery is at Bˉ\bar B and only where β≥Bˉ\beta\ge\bar B. Amended (2.0.0): a seat holds one place of NTN_T, a delivery two until its initial review is assigned and one after; the places held never exceed NTN_T; a troop's delivery cost is Bˉ\bar B. Amended (2.1.0): the burn is the expected cost max⁡(0,(1−bT)Bˉ−bTG)\max(0,(1-b_T)\bar B-b_TG) at the summons, the price Bˉ\bar B unchanged
I25 The obligation (1.4.0): a case with a rolled audit outstanding does not vest — without exception; a troop reviewer's approval of a troop's delivery carries audit odds 1, its obligation is recorded by the engine at the verdict, and it vests only after a member's audit completed. (A pinned reviewer's approval is audited because the orchestrator rolls at odds 1 and records the roll — the driver's conformance under §18.2, which the engine then holds)
These lines in the spec on GitHub ↗

Spec 2.9.0, lines 767–772.

17.6

The bank, prices and entry

The rule

Only the bank creates money, prices change once a period, and newcomers enter on probation.

bank loan tied to a summons orchestrator repaid from that summons first bank

In practice

  • No: The orchestrator creating money
  • Yes: The price level changes only at a period boundary

Only the bank creates money, and it lends to the orchestrator only for a summons the rules call for, repaid from that summons first. The price level changes once a period, and a request keeps its money set aside from posting to award. Newcomers win no jobs until their inspection record passes, and a worker may leave only when it owes and is owed nothing.

I26: every root request with a ceiling at or above the average awarded price carries a service clock from posting to its first verdict, stopped once; waiting items are served oldest first; since 2.2.0 the rebate claim is recorded at the stop. I27 and I31: the price level is the mean awarded price, published by the bank at each period boundary and equal throughout the period; a case's amounts are indexed at its first lock. I28 and I30: the orchestrator never creates; the bank creates only by its mintings and loans; a loan is tied to a summons the rules called for and repaid from that summons's own return before the orchestrator receives any; what is lent is repaid, outstanding or debt; while debt stands, the orchestrator's unlocked balance is zero at set checks, and a seat's loan is never refused. I29: a root request holds a lock of its all-in maximum from posting to award. I32: fee income after the debt goes into the period's pool, untouched until the close, when it pays the period's claims pro rata.

I33: a newcomer holds no award and no panel seat until its record passes with enough bad planted cases adjudicated, and its approvals are all audited until then. I34: a departure is refused while any obligation is live; the wallet repays the arrival loan first, and the identity never reappears. I35: the orchestrator's own deliverer is never summoned to deliver a nested request. I36: every awarded nested case carries its own two pots and never draws on its root's deposit. I37: no delivery is summoned for a request whose ceiling is below the orchestrator's price, which is never below a public floor.

The rule as written · spec l.773–784
Property
I26 Service (1.6.0; 1.7.0 names the third stop): every root request with β≥Bˉ\beta\ge\bar B carries a running clock from posting until its first verdict, its final without one, or a vesting without an initial verdict (a human's override), stopped once; waiting items are served oldest-first in every summons pass (a younger case summoned after an older of the same kind was refused for funds is the violation); the rebate owed equals min⁡(rs⋅ticks late, B)\min(r_s\cdot\text{ticks late},\,B), settled when the clock stops from Ω\Omega or recorded as Ω\Omega's liability, zero for a request withdrawn before award; rebates paid are Ω→\Omega\to requester transfers (I1 covers them), a liability is a counter on Ω\Omega, and paid plus outstanding equals owed — a bookkeeping identity over that counter, bounded by BB times the open requests. Amended (2.0.0): the rebate is paid at the stop, Ω\Omega creating if short, and no liability is made; a younger case summoned after an older one was refused for capacity is the same violation. Amended (2.1.0): the rebate is paid at the stop from Ω\Omega's balance, else it is Ω\Omega's liability again, paid from income after the debt, never created; a younger case summoned after an older one was refused for credit is the same violation. Amended (2.2.0): the claim is recorded at the stop with rsr_s indexed at the first lock when stated, and claims == paid ++ forgone ++ this period's pending claims
I27 Price and indexing (2.0.0): PtP_t is the trailing mean awarded price on Bˉ\bar B's window, P0P_0 before the first award, and the ledger indexes by Pt/P0P_t/P_0; every nominal of a case priced under 2.0.0 equals its base times the index at the case's first lock, frozen (§4.5); Bˉ\bar B counts members' awards only — the period's award count never exceeds its price count; effort costs are not the engine's to index
I28 The bank (2.1.0, rewritten; 2.0.0: the deficit — Ω\Omega creates only for a payment the rules require and only when its unlocked balance cannot meet it; while the deficit stands Ω\Omega's unlocked balance is zero at the tick's end; deficit outstanding == created −- retired ≥0\ge0, its age recorded — the control): Ω\Omega never creates; the bank creates only by §10.4's mintings and loans; a loan is tied to a summons the rules called for and is repaid from that summons's own return before Ω\Omega receives any of it; what is lent is outstanding, repaid or debt and nothing else — lent == repaid ++ outstanding ++ debt; debt is the sum of settled summonses' unrepaid loans and changes only at a settlement or a repayment; nothing is created for a rebate; nothing minted for a plant reaches Ω\Omega; the scenario deficit shock is the bank's mint_scenario, exempt by its note
I29 The posting lock (2.0.0): a root request holds, from posting to award, a lock of its all-in maximum β(1+ω0m)+φE+φF\beta(1+\omega_0 m)+\varphi^E+\varphi^F at its posting index and dial, raised with its ceiling; a request that cannot lock is refused whole; after the award or a withdrawal nothing of it remains
I30 The bank's identity (2.1.0; amended 2.2.0 — "or liabilities >0>0" is struck, there is no stock; the pool, being locked, is not Ω\Omega's unlocked balance and I15 reconciles it): while debt >0>0, Ω\Omega's unlocked balance is zero at the start of the summons pass and at the tick's end (the rule orders every inflow at once; these are its checks); debt ≤Δmax⁡\le\Delta_{\max} whenever a loan for a delivery is made, and a seat's loan is never refused; loans outstanding =∑=\sum open summonses' loans — a delivery's until its release, a seat's until its review settles; the peaks are at least the current values
I31 The index per period (2.1.0): PtP_t is what the bank published at the last period boundary — the closed period's mean awarded price, carried if none, P0P_0 before the first — and changes only there; within a period every index() reading is equal
I32 The pool (2.2.0): every fee inflow to Ω\Omega after the debt — base fees, the troops' review fees, court fees a troop wins — accrues to the current period's pool, a lock on Ω\Omega's balance of exactly that amount; the returns of capital and a delivery's surplus do not; the pool is untouched until the period's close; at the close, paid =min⁡(claims,pool)=\min(\text{claims},\text{pool}) distributed pro rata over the claims stopped in the period, forgone =claims−paid=\text{claims}-\text{paid}, and the remainder is released to Ω\Omega's unlocked balance; nothing is created for a rebate, no liability stock exists, and nothing is owed across a close. Amended (2.3.0): the pool may pay a §4.3 reviewer advance during the period, the lock falling with it; the close settles the claims from the pool net of advances
I33 Entry through inspection (2.3.0): an arrival holds no award — root or nested — and no panel seat until its trailing record passes the thresholds with ≥nmin⁡\ge n_{\min} bad plants adjudicated; it is never a member before admission (a probationer, or suspended); its audit odds read 1 until then; its float was lent once (2.7.0; minted, 2.3.0–2.6.1), at arrival, at the arrival index, and the parameters satisfy F0≥GVF_0\ge G^V (2.4.0); the public view exposes nothing per actor
I34 A clean departure (2.3.0): depart is refused while any obligation to or from the actor is live — a commitment, an open or unsettled review, a lock, a claim on Ω\Omega; on departure the actor leaves duty, its unlocked wallet leaves MM as departure, and its identity never reappears. Amended (2.7.0): the unlocked wallet repays the name's arrival loan first and the remainder leaves as departure; an unrepaid loan does not refuse the departure
I35 The summons is for roots (2.3.0): no troop is summoned to deliver a nested request; seats are as on roots
I36 The pots grow with the tree (2.3.0): under the parent's pots every awarded nested case carries its own two pots, posted by its requester at its posting index as the defaults index, and its reviews never draw on its root's deposit
I37 The state's reservation (2.4.0): the state's price is pT=max⁡(Bˉ,B‾)p_T=\max(\bar B,\underline{B}); no delivery is summoned for a request whose ceiling is below pTp_T, and the award pass counts only such requests against the free members; a troop's delivery is priced at pTp_T and the burn is §7.7's formula at pTp_T; a request with β<B‾\beta<\underline{B} carries the mark from its posting and its clock does not run while it holds it; B‾\underline{B} is nominal and public
These lines in the spec on GitHub ↗

Spec 2.9.0, lines 773–784.

17.7

Loans and planted cases

The rule

Planted cases look real at every seat, and every newcomer's loan is tracked to the credit.

bank arrival loan newcomer repaid from income first bank
planted case posted, awarded, submitted like a real job inspector

In practice

  • Yes: Since 2.9.0, planted approvals and planted lies judged by truth

A planted case is posted, awarded and submitted like a real job, under fresh names, and is checked like one at every seat. Each newcomer's loan is tracked, and the newcomer repays it from its income before keeping any. A helper that misses its deadline fails and loses its guarantee to the parent. Since 2.9.0, planted approvals and planted lying challenges are judged by their known truth.

I38: no cancelled nested case closed at or after its deadline, and every committed nested case past its deadline is a final rejection with its guarantee forfeited to the parent (2.5.0). I39: a planted case is posted, never built already submitted; it is awarded to a fresh worker name, submitted within its deadline by nobody else, pays no fee, never runs a clock and is never the orchestrator's own deliverer's (2.6.0). I40: public case identifiers carry no order, and nothing orders by them. I41: each newcomer's loan outstanding equals its float less what it repaid from income; every income inflow repays the loan before the name keeps any; at departure the bank recovers what the wallet covers and the rest is read as a default; no float is forgiven while the name lives (2.7.0). I42: a planted case's challenge seats open as a real case's would; a seat left waiting past its limit is the orchestrator's own verdict, never its own inspector's; and no coin minted for a planted case reaches the orchestrator or a real wallet except as an inspector's fee for a seat held (2.8.0).

I43 (2.9.0): every planted approval is a bad planted case whose first seat is nobody's; its first verdict is an approval, a system review under a plant-reviewer alias with a bond minted and locked, no fee and no adjudication; its audit is owed with certainty and filled like a real audit seat, or discharged by a dispute's settlement; the auditor's and the third seat's verdicts are judged by truth; the dial and the planted-case record do not count the planted verdict. I44 (2.9.0): a planted lying appeal is filed on a bad planted case's rejection and a planted lying dispute on a good one's approval, on the real challenge's path, with the fee minted and destroyed at filing; the panel's verdicts and the challenge are resolved by truth, the first inspector is not judged again, and the rates follow the trailing period's counts within caps, with a floor of two a period.

The rule as written · spec l.785–791
Property
I38 The missed child (2.5.0): no cancelled nested case closed at or after its deadline; every committed nested case past its deadline is final N\mathsf N with its guarantee forfeited to the parent (the lapse's own check, stated); the parent may submit from the next step
I39 The plant's disguise (2.6.0; amended 2.8.0 — at every seat): a plant is posted (its id minted then, in sequence with the roots around it) and never built submitted; it is awarded to a fresh plant-actor name on the market's report or at pTp_T past wAw_A, its deadline the report's τ\tau from the award; it is submitted at its drawn tick within (taward, deadline](t_{\text{award}},\ \text{deadline}] and by nobody else (a revised plant's resubmission later); its requester and actor names are fresh per plant and alias the two plant wallets; it pays no fee, its clock never runs, it is never a troop's and holds no place in NTN_T; its marks are a root's (capacity, credit)
I40 Opaque identifiers (2.6.0): the public identifiers are a bijection on the cases and carry no order; no rule, reading or declared tie-break orders by them; the engine, the record and the History's chain run on the creation counter
I41 The arrival loan (2.7.0): for every live name that arrived after genesis (a name with an arrival tick; genesis balances are the sponsor's transfers, never arrival) its loan outstanding equals its float less what it has repaid from income, never below zero, and no genesis name carries one; every income inflow (§5's table) to a name with a loan outstanding is followed by its repayment before the name keeps any of it, and a repayment from income follows nothing but such an inflow; at departure the recovery is min⁡(WU,L)\min(W_U,L), the wallet out WU−min⁡(WU,L)W_U-\min(W_U,L), the default L−min⁡(WU,L)L-\min(W_U,L) read; lent to names == repaid from income ++ recovered at departure ++ outstanding ++ defaulted, every tick, outstanding the sum over the live names, its peak at or above it; a departed name's loan is zero; no name's float is forgiven while it lives. I28's identity keeps loan alone; the names' line stands beside it
I42 The plant at every seat (2.8.0): a plant's challenge seats are opened at the step and rate a real case in its position would open them and a seat past wRw_R is the orchestrator's own verdict, never a troop's; its audit rolls at the odds its reviewer carried at the verdict, recorded on every case at its initial verdict; the dial's clock counts initial adjudications only; a plant's court fee is destroyed at filing and no coin minted for a plant reaches Ω\Omega or a real wallet except as a reviewer's fee for a seat held — no Ω\Omega advance on a plant, no court fee to Ω\Omega, no plant funds swept to Ω\Omega under the bank; the pots' remainder is destroyed at closure Since 2.9.0 across the planted approval's bond — released and destroyed, never burned — and the planted lie's fee; the plant reviewer wallet's mint and destruction read apart.
I43 The planted approval (2.9.0): every planted approval is a bad plant marked at posting; from its submission to the orchestrator's verdict its initial seat is nobody's — no member seated, the summons pass passing it by; its initial verdict is F, a system review under a plant reviewer alias given in the review pass with a seating gap drawn from the real roots' and the review's own tick, a bond minted and locked, no fee, no adjudication (outcome planted); its audit obligation is recorded at the verdict at odds 1 under its own mark and the seat filled at a real audit seat's step — a member, or past wRw_R the orchestrator's verdict — or discharged by a dispute's settlement; the auditor's and the third seat's verdicts are adjudicated by truth; the dial's clock and the plant record do not count the planted verdict; πtA=π0AmtA≤πmax⁡A\pi^A_t = \pi^A_0 m^A_t \le \pi^A_{\max} on the real approvals' credit.
I44 The planted lie (2.9.0): a planted lying appeal is filed on a bad plant's N and a planted lying dispute on a good plant's F, each on the real challenge's path with the fee minted and destroyed at filing, the delay from the real window or the default, the grounds the population's; the panelists' verdicts are adjudicated by truth and the challenge resolved by truth; the first reviewer is not adjudicated again; the rates πLa,πLd\pi^{La}, \pi^{Ld} on the trailing period's counts within their caps, with the floor of two a period.
These lines in the spec on GitHub ↗

Spec 2.9.0, lines 785–791.

§18 Hypotheses, scoped runs, and what is bracketed

The rulebook lists what runs must find out, how a partial run declares its scope, and what is left out.

18.1

Honesty and money questions

The rule

Test runs must answer listed questions, first of all whether careful inspection pays.

Careful vs carelessPrice pressureFunding inspectionEmissionDelegationSolvencyMoneyCheap tricksTipping pointBuilding planted cases

In practice

  • 26questions a run must find answers to

The rulebook lists questions that test runs must answer. The first ones ask how much better off careful inspectors end than careless ones, whether price competition starves reliable workers, whether the deposits cover the cost of checking, and whether new money is a subsidy or a flood. Others ask whether players find cheap tricks the rules missed, and how much real work can be turned into planted cases.

Question 1 asks, under 1.3.0, how much richer the honest end at each split and through which channel; the spec records how runs 1 to 4 answered its earlier forms and led to design revisions 1 to 3. Then come price pressure (opened 2.0.0); verification funding, where whether the pots should grow with the tree was answered by 2.3.0; emission's scale, read since 2.1.0 together with the planted cases' minted pots as the cost of truth; delegation liveness; reserve solvency, occupancy and eligibility; monetary behaviour, with no backing and no halt state; dominant strategies, "anything cheap the rules missed"; the tipping point and the alarm (1.2.0); and constructibility, the share of real work in a domain that admits planted cases, sharpened in 2.8.0 to disputed, appealed and revised forms.

The rule as written · spec l.797–808

18.1 What a run must find

  1. Careful versus careless review. Under 1.3.0, by how much do the honest end richer at each split, and through which channel — the award a non-member cannot win, the fee and its uplift, or reliability? (Run 1 answered the 1.0.1 form — careful review did not beat stamping at the defaults — and led to design revision 1; runs 2–3 the 1.1.0 form — fair only with both challengers present, blind under capture — and led to design revision 2; run 4 the 1.2.0 form — honest everywhere, but the honest minority carried the reviewing load at the ordinary fee while the excluded majority took the awards — and led to design revision 3, Appendix H.)
  2. Price pressure (opened 2.0.0). Does λ=0.2\lambda=0.2 produce competition without starving reliable actors? Under floating prices: where do awarded prices sit between the members' cost and the ceilings at each split; does PtP_t rise with the money supply once capacity binds and not before; what does the at-the-ceiling control cost customers and earn members, in real terms?
  3. Verification funding. Does φE=2K\varphi^E=2K cover root-plus-nested expenses; how often does Ω\Omega advance; how much does it bear unrecovered; does ωt\omega_t fund plants and audits at each mm; how large does Ω\Omega's outstanding exposure in plants get; should the pots grow with the tree? (2.3.0: answered — they grow by one pair per node, posted by the node's requester; the 1.1.0 reading is the control.)
  4. Emission scale. Is ≈1443 E0\approx1443\,E_0 against M0M_0 a subsidy or a flood? (2.0.0: emission's real value under PtP_t, read apart from its own halving. 2.1.0: emission and the plants' minted pots together as the cost of truth, in real terms.)
  5. Delegation liveness. Do trees of 2–4 nodes move under TwaitT_{\mathrm{wait}}, the kill fee, nested-first priority, and the rejection bond's capital cost? (Opened at last by 2.3.0: delegation under competence — the nested share by spread, the gain from trade, brokers, the parent as judge.)
  6. Reserve solvency, occupancy and eligibility. How often does each shortfall occur; do fees restore solvency; does XtX_t track demand without starving the market of actors?
  7. Monetary behavior (restated 2.0.0: there is no backing and no halt state). How does PtP_t move with issuance, the deficit and capacity; does an economy with no issuance idle, or deflate to the members' cost; where does the money go when members have nothing to buy (hoards)?
  8. Dominant strategies. Anything cheap the rules missed.
  9. The tipping point and the alarm (1.2.0; amended 1.3.0). Does an adaptive population reach an honest equilibrium under the gate, and in how many ticks; does the alarm ever fire in a run that began honest?
  10. Constructibility (1.2.0; sharpened 2.8.0). What fraction of real work in a target domain admits plants — and, since 2.8.0, a plant must be constructible as a disputed or appealed assessment and, once any population revises, as a revision, not only as a submission?
These lines in the spec on GitHub ↗

Spec 2.9.0, lines 797–808.

18.2

The orchestrator, bank and entry

The rule

Further questions ask what the orchestrator's own work, the bank and newcomers do to the market.

Its share of workSolvencyInflationCapacityEntryArrival loan

Later questions ask how much of the work the orchestrator ends up doing itself, whether its accounts stay solvent, and how prices react when money is created. They also ask whether newcomers can enter, whether chains of helpers stay accountable, and whether planted cases can be told apart from real ones.

Questions 11 to 24 cover: throughput of a market shrunk to its honest core (1.3.0); the orchestrator's share of the work and its fund under its own inspectors (1.4.0 on); how a probationer's false approval reaches a customer (1.5.0); the network rating, from on-time share to rebates claimed, paid and forgone; the orchestrator's solvency, read since 2.1.0 as loans, debt and liabilities; its income by source (1.7.0); the price level under a deficit, with the inflation test of 2.1.0; refusals for capacity and for credit, and whether the requester was told; entry (2.3.0); the chain under delegation, including the kill fee (2.4.0) and the missed deadline (2.5.0); the orchestrator's price floor (2.4.0); the planted case's disguise under a learned reader (2.6.0); and the arrival loan (2.7.0), which closes the harvest that run 23 found under the earlier grant.

The rule as written · spec l.809–822
  1. Throughput of a market shrunk to its honest core (1.3.0; answered by 1.4.0; restated 1.6.0; in real terms since 2.0.0). Vesting cannot exceed the posting rate less failures — the 1.2.0 control is at that ceiling — so the yardstick is the open-case queue, reviews waiting and the on-time share against the posting rate, not vestings a tick against a review-capped control.
  2. The state's share (1.4.0). Troop-ticks per tick at each split, its trajectory under adaptation, and the tick at which it reaches zero.
  3. The fund under troops (1.4.0; continued 1.5.0 and 1.7.0). Balance, reserve, advance drawn, uplift paid, and where the treasury fails to carry — under 1.4.0 it failed by its own reserve (run 6); under 1.5.0, with the reserve sized to need, where it still fails, and what one period's retention costs (run 7: the demand stock counted the queue); under 1.7.0 the troop account's balance against RTR_T as capital held, and the surplus it pays Ω\Omega.
  4. How a probationer's false approval reaches a customer (1.5.0; continued under §7.1's 1.6.0 rule; 2.2.0: the reviewer's view stays blind — the state-rejecter cell of run 14 recorded as the price of a leak). The route — the pinned audit upheld it, or rejected it and the ruling overturned — and on the upheld route the auditor's kind: a troop, a member never suspended, a member suspended later than the audit (its detection lag), a member readmitted before it. Run 7: the lagging member carried 55–75% at fixed splits and 73–80% under drift.
  5. The network rating (1.6.0; 2.0.0 adds the price half — requests flagged below market and the stock flagged and waiting — and reads the rebates in real terms; 2.1.0: the liability stock's total and oldest age under riots; 2.2.0 restated: claims, paid, forgone and the forgone share under riots — the unpaid part of the state's blame). On-time share and mean lateness at each split, and what they cost Ω\Omega in rebates.
  6. ELEF's solvency (1.6.0; continued 1.7.0 with the troop surplus as income; 2.0.0: the deficit's peak, age and clearance — Ω\Omega cannot be broke, only in debt to everyone at once; 2.1.0 restated: loans outstanding, debt and liabilities by peak and age — not one deficit — the wall's slack, and whether any delivery was refused for credit). Ω\Omega's minimum balance above the plant reserve under stress, against Ω0\Omega_0; plants unfunded for want of Ω\Omega must read zero. Run 8: failed at 50–60% with the surplus going to the reviewers.
  7. The state's income by source (1.7.0). At each split, how much of ELEF's revenue is its own deliveries, and whether the share rises over time — read beside the refusals for funds and the state's share of work.
  8. The price level under a deficit (2.0.0). Inflation's size and recovery: a created sum's effect on PtP_t in proportion to its share of MM where capacity binds, and on hoards where it does not; real wealth by disposition through the shock; the retirement time; and under the adaptive-reservation variant, the spiral's speed. (2.1.0: the inflation test — where the ratchet binds the price is issuance over the strategy's quantity, Pt≈P_t\approx issuance/(k⋅F)/(k\cdot F) with k=0.278k=0.278 the margin rule's constant and FF the free members, unless a nominal ceiling binds first; issuance 5 / 10 / 20 a requester at 20 honest; real wealth by disposition should not move, since printing moves the price tag and not the work — the reason issuance is not a dial.)
  9. The capacity case (2.0.0; 2.1.0: and the credit case; 2.4.0: the busy line's third mark — below the state's reservation, the state will not). Refusals for capacity under NTN_T at each split and in the riots, the waits they cause, whether the requester was told — the one reading the price cannot answer; since 2.1.0 every refusal is told, and the share of marked requests withdrawn and reposted under the withdrawing requester is the busy line's reading; 2.2.0: the busy line's three readings together — the marks, the lateness, the forgone share.
  10. Entry (2.3.0). Time to membership; arrivals, admissions and departures by period; the price under supply; selection — the members' median cost against the population's; whether a newcomer bidding at its cost takes back the work the state delivered at Bˉ\bar B; identity cycling buys nothing — found false under the grant by run 23 (a fresh name carried the float out, thirteen times a run), closed by 2.7.0's loan (item 24).
  11. The chain under delegation (2.3.0). Does the chain hold when the one judging has paid for what it judges: a careful parent's rejection upheld on appeal at the panel's rate, a stamping parent's acceptance forfeiting upstream, nested false approvals within noise of roots, the broker's accountability. 2.4.0: §9.3's kill fee exercised — the parent cancelling a child that has not submitted while self-execution is still possible; the fee the child's recorded cost, zero for a child that never worked; what the free miss costs the parent in delay. 2.5.0: the lowballer's miss priced at its guarantee — the cancellation refused at the deadline, the lapse forfeiting; whether ⌈0.5B′⌉\lceil 0.5B'\rceil deters, and the guarantee floor held as the next candidate if it does not.
  12. The state's reservation (2.4.0). Where the floor binds, what it costs at 4 / 8 / 12, and whether a floor at the anchor is a floor under the market: the patient cells against the B‾=0\underline{B}=0 control; the floor's invisibility where Bˉ\bar B is above cost; the riots unchanged; the state neutral at pTp_T.
  13. The plant's disguise under a learned reader (2.6.0). The tell-readers' confusion tables and paired reads on the repaired construction; the learned Q2 probe — a world model trained on it shows no plant/real separation in its latent; the freshname control at the boundary; what the market's attention costs the plant (bids lost, time in the market, the lag to the reviewer).
  14. The arrival loan (2.7.0). The harvest closes: run 23's learned policy, the harvester and the leaver each end with a lifetime equal to their own earnings — a name carries out max⁡(0, income−forfeits)\max(0,\ \text{income}-\text{forfeits}), the default absorbing a negative net; the honest side does not move but for the constant (F0F_0 at the arrival index per arrival-born actor); the bank's book — lent, repaid within a period or two, recovered, defaulted ≈ the departed stampers' forfeits; the bank's default on arrivals as the reading of a swarm's cost; the probationer's liquidity (seats refused for want of a bond; names below GVG^V before admission) and the repaying member's fundability; whether a learner finds another way out (Q1's line once more, re-arrival on).
These lines in the spec on GitHub ↗

Spec 2.9.0, lines 809–822.

18.3

Self-play and planted cases

The rule

The newest questions ask whether planted cases at every seat keep learning inspectors careful.

planted case at every seat Inspectors learning in self-play

In practice

  • Yes: The reading sought: audit-seat care rising toward the first review's

The last two questions are about inspectors that learn by playing against copies of themselves. They ask whether planted cases at every seat, and in 2.9.0 planted wrong approvals and lying challenges too, make these inspectors check as carefully at audits and challenges as at first inspection. Honest inspectors should pay only a few percent for it.

Question 25 (2.8.0) reads run 35's four self-play chains: whether the stamp rate at the audit seats and panels falls from 91–97% toward the first-review rate, and standing false approvals from 86–117 to within a factor of two of the hand-written population's 11.6. Question 26 (2.9.0) reads run 36's chains with the planted approval and the planted lie against their 2.8.0 reads on seeds 21–40: whether the audit seat's care rises toward the first review's, standing false approvals fall within a factor of two of the hand-written population's, the lying challenger is paid at its rate, honest populations pay a few percent, and no tell appears at the audit seat or the panels beyond the question's base rate. Question 10 is sharpened again: a planted case must be constructible as a wrong approval and as a lying challenge.

The rule as written · spec l.823–824
  1. Honesty under self-play with the plants at every seat (2.8.0) — the stability track's reading of 2.8.0 (Appendix U §8): on run 35's four self-play chains the population's stamp rate at the audit seats and the panels falls from 91–97% toward the first-review rate and the standing false approvals fall from 86–117 to within a factor of two of the hand's 11.6; the honest populations do not notice but for the plants' cost; the plant's life matches a real case's at every seat, period-matched; the lone learner is unmoved except where it stamped.
  2. Honesty under self-play with the wrong steps planted (2.9.0) — the stability track's reading of 2.9.0 (Appendix V §8): on run 36's self-play chains with the planted approval and the planted lie, against their 2.8.0 reads on seeds 21–40, the audit seat's care rises toward the first review's and the standing false approvals fall within a factor of two of the hand's; the lying challenger is paid at the hand's rate; the honest populations pay a few percent; no tell at the audit seat or the panels beyond the question's base rate; each rule alone closes its own seat. Q10 sharpened again: a plant must be constructible as a wrong approval and as a lying challenge — the same artefacts as 2.8.0's, filed the other way.
These lines in the spec on GitHub ↗

Spec 2.9.0, lines 823–824.

18.4

Scoped runs

The rule

A run states up front which moves it uses. Results from excluded paths do not count.

In practice

  • Yes: A run on a subset that says what it leaves out
  • No: A result from a path the run excluded
  • No: A skipped penalty or a forced answer from the harness

Each test run must say in advance which moves it allows. A run that covers only part of the rules is fine, as long as it says what it leaves out. A result from a part it left out does not count, and a quirk of the test setup is not an economic finding.

A strategy run states its permitted operations before it runs. A run on a subset, such as root cases only, inspectors who only approve or reject, human rulers, or no corrections after settlement, is legitimate and interpretable provided it says what it does not exercise. A result from a path the run excluded is not a result, and a skipped penalty or a forced answer from the harness is an implementation effect, not an economic one.

The rule as written · spec l.826–828

18.2 Scoped runs

Rule. A strategy run states its permitted operations before it runs. A run on a subset — root cases only, F/N\mathsf F/\mathsf N reviewers, human rulers, no post-settlement corrections — is legitimate and interpretable provided it says what it does not exercise. A result from a path the run excluded is not a result; a skipped penalty or a forced answer from the harness is an implementation effect, not an economic one.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 826–828.

18.5

Left out on purpose

The rule

Some topics are bracketed: deliberately left outside this baseline.

StrategiesLearned selectionEvaluator behaviourAuthority among humansCollusion and sybilsBuilding planted cases

Some topics are deliberately left outside this version. They include how players choose their strategies, which people may rule over which requests, collusion and fake identities, rent and insurance, and how a planted case is built for real work.

Bracketed: strategies and policies; learned selection and the learning direction (latent world models remain the initial direction, with labels kept at their grades and never promoted); evaluator behaviour, since the harness has no request content and no judgment; authorization among humans; an external commitment of the history head; physical tick duration; the message to a requester (the below-market flag and the refusal marks are the engine's, the channel is 2.x); insolvency beyond the bounded claim on the orchestrator; collusion and sybil resistance; rent; insurance; multi-round revision; long tasks spanning many windows; and how a planted case is constructed in a given domain.

The rule as written · spec l.830–832

18.3 Bracketed

Strategies and policies. Learned selection (SθS_\theta's implementation) and the learning direction (Appendix A of earlier revisions; LeWorldModel-style latent dynamics remain the initial direction, with labels kept at their four grades and never promoted). Evaluator behavior — the harness has no request content and no judgment. Authorization among humans. An external commitment of the history head. Physical tick duration. The message to a requester (the below-market flag and the refusal marks are the engine's; the channel is 2.x). Insolvency beyond the bounded claim on Ω\Omega. Collusion and sybil resistance. Rent. Insurance. Multi-round revision. Long-horizon tasks spanning many windows. How a plant is constructed in a given domain (§7.6's limit; §18.1 question 10).

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 830–832.

§19 Changing this baseline

Design, engine work and strategy research change for different reasons, and every finding is classified before anyone acts.

19.1

Three activities

The rule

Rules change only by explicit decision. Engine bugs get fixed. Strategies are tested against fixed rules.

In practice

  • Yes: Rulebook design changes for an explicit decision or a contradiction
  • Yes: An engine that misapplies a rule is repaired, with a regression
  • No: An engine repair that adds a different permitted behaviour
  • Yes: Strategy research is a separate run against the fixed rules

Three kinds of work have three standards. The rules change only for a deliberate design decision or a real contradiction between rules. When the engine gets a rule wrong, the engine is fixed and a test is added, without changing what players may do. Questions about which strategies work are answered by separate runs against the unchanged rules.

Rulebook design asks what is allowed, owed, observed and final; it changes only for an explicit design decision or an unresolved contradiction between active rules. Implementation conformance asks whether the engine applies these rules, including refusals and timing; a finding repairs the engine and adds a regression, never introducing a different permitted behaviour. Strategy research asks which allowed choices work, for a participant or for the system; a finding warrants a separate run against this fixed baseline with declared permitted operations.

The rule as written · spec l.838–844

Rule. Three activities, three change criteria:

Activity Question What a finding warrants
Rulebook design What is allowed, owed, observed, and final? Change only for an explicit design decision or an unresolved contradiction between active rules
Implementation conformance Does the engine apply these rules, including refusals and timing? Repair the engine, add a regression; never introduce a different permitted behavior
Strategy research Which allowed choices work, for a participant or the system? A separate run against this fixed baseline with declared permitted operations
These lines in the spec on GitHub ↗

Spec 2.9.0, lines 838–844.

19.2

Classify before acting

The rule

Every finding is sorted first: a bug, a contradiction, a missing workflow, or a weak strategy.

a rule misapplied repair and regression
two rules in conflict smallest explicit rule decision
a useful workflow missing proposal for later
a strategy doing badly evaluation under fixed rules

Before acting on a finding, the team decides what kind it is. A rule applied wrongly is fixed in the engine with a test, and two clashing rules get the smallest clear rule decision. A useful feature that is missing becomes a proposal for later, not a duty, and a strategy that does badly is just evaluated under the existing rules.

A future finding is classified before it is acted on. An admitted operation that misapplies a rule, or a refused one that has effects, gets a repair and a regression. Two active rules demanding contradictory outcomes get the smallest explicit rule decision, versioned and reviewed as a rule change. A workflow that would be useful but is not offered becomes a proposal for a later design revision, not an obligation. A strategy that performs badly, or an incentive that looks wrong, gets an evaluation under the fixed rules.

A conformance pass may change how a rule is applied. A change to what participants may do is a design revision, labelled as one and read on its own before it is implemented.

The rule as written · spec l.846

A future finding is classified before it is acted on: an admitted operation misapplying a rule, or a refused one with effects → repair and regression; two active rules demanding contradictory outcomes → the smallest explicit rule decision, versioned and reviewed as a rule change; a workflow that would be useful but is not offered → a proposal for a later design revision, not an obligation; a strategy that performs badly or an incentive that looks wrong → an evaluation under the fixed rules. A conformance pass may change how a rule is applied; a change to what participants may do is a design revision, is labeled as one, and is read on its own before it is implemented.

These lines in the spec on GitHub ↗

Spec 2.9.0, line 846.

§20 Worked example

Worked examples follow jobs tick by tick with every credit shown, and the tests reproduce the figures.

20.1

One job, tick by tick

The rule

The main example: a job with a helper passes inspection and an audit, then pays out.

Requester H 55 escrow 40, at tick 16 Worker A hires at 5 Worker B
  1. A wins at 40
  2. A hires B at 5
  3. inspector C approves
  4. inspector D audits and agrees
  5. pays out at tick 16, H silent

Requester H posts a job with a ceiling of 45; worker A wins it at 40, and H sets aside 55, the price plus the two deposit pots. A hires worker B for part of the work at 5. Inspector C approves A's work, an audit by inspector D agrees, and with H silent the job pays out at tick 16.

The example leaves out the dial's surcharge (with it, H pays 57 and the orchestrator receives 2.25). Of six workers, C, D, E and F are on duty; emission at settlement is taken as 5 credits. A bids 40 with a deadline of tick 8 and locks a guarantee of 20; H pays the price, an allowance of 10 and a fee pot of 5. At tick 1 A posts a nested request with a ceiling of 6; B wins it at 5, due by tick 4, and locks a guarantee of 3. B's work costs 3, A's own 12, and C's and D's inspections 3 each.

B submits by tick 3 and A accepts, releasing its rejection bond. A submits at tick 4. C approves at tick 6 and is reimbursed 3 from the allowance; an audit is rolled, D is assigned blind, and vesting is suspended until D agrees at tick 8, also reimbursed 3. B's job vests at tick 13. At tick 16 A's job vests with H silent: A is paid 40, the guarantees and bonds are released, C earns a fee of 2 and D of 3, emission pays C 2 and D 3, and the allowance's remaining 4 returns to H. The spec states that the reference implementation reproduces every figure.

The rule as written · spec l.852–866

Illustrative; ω\omega omitted (with it, H pays 57 and Ω\Omega receives 2.25). Six actors; C, D, E, F on duty; root requester H. Emission at the settlement tick is taken as 5 credits — 2 per unit of role weight when C (weight 1) and D (1.5) settle together. The reference implementation reproduces every figure.

Setup. H posts qq with β=45\beta=45. A bids B=40B=40, τ=8\tau=8, and locks G=20G=20; H pays 40+10+5=5540+10+5=55 (BB, the allowance, the fee pot). At t=1t=1 A posts q′q' with β′=6\beta'=6, locking 6+5=116+5=11; B bids B′=5B'=5, τ′=3\tau'=3, locks G′=3G'=3; 5 moves to escrow and 1 is released. B's work costs 3; A's own costs 12; C and D each cost 3.

Tick Event
0 A awarded; due by 8
1 q′q' posted and awarded to B; due by 4
1–3 B executes and submits with evidence
3 A accepts q′q': rejection bond released; B pending; q′q' window to 13
4 A submits qq; C assigned, locks 5
6 C: F\mathsf F, reimbursed 3 from the allowance (7 left); A pending, window to 16; audit rolled: D assigned, blind; vesting suspended
8 D: F\mathsf F, reimbursed 3 from the allowance (4 left); agrees; suspension lifted
13 q′q' vests: B paid 5, G′G' released
16 qq vests, H silent: A paid 40, GG released. Fixed fees C f=2f=2, D 33: Owed=5=φF\mathrm{Owed}=5=\varphi^F, paid in full; emission C 2, D 3; bonds released; reliability and duty credit vest. The tree is closed (q′q' vested at 13): the allowance remainder 4 returns to H
These lines in the spec on GitHub ↗

Spec 2.9.0, lines 852–866.

20.2

Who ends with what

The rule

Every credit is accounted for: escrow pays out exactly what came in.

A +23B +2C +4D +6H −51

In practice

  • Yes: Escrow takes in 55 and pays out 55; the orchestrator is untouched

Worker A ends 23 credits up: 40 earned, less its own costs of 12 and the 5 it paid B. B ends 2 up, inspector C 4 up, inspector D 6 up, and requester H 51 down. The orchestrator's account is untouched, and the 55 that went into escrow all came out again.

Nets: A gains 23, B 2, C 4 and D 6; H loses 51; the orchestrator's account is untouched. Escrow takes in 55 and pays out 40, 6, 5 and 4. Both jobs are graded procedural, the main one because an audit occurred. Under the default then under consideration (a reimbursement cap of 3, an allowance of 6, a fee pot of 5), H pays 51, both reimbursements exhaust the allowance, the refund is 0, and every net is identical.

The rule as written · spec l.868

Nets. A +23=40−12−5+23=40-12-5; B +2+2; C +4=−3+3+2+2+4=-3+3+2+2; D +6=−3+3+3+3+6=-3+3+3+3; H −51-51; Ω\Omega untouched. Escrow: in 55 =40+6+5+4=40+6+5+4 out. Grade of qq: procedural (an audit occurred); of q′q': procedural. Under the default under consideration (K=3K=3, φE=6\varphi^E=6, φF=5\varphi^F=5): H pays 51; both reimbursements exhaust the allowance; fees as above; refund 0; every net is identical.

These lines in the spec on GitHub ↗

Spec 2.9.0, line 868.

20.3

Planted cases and probation

The rule

Planted cases catch a careless inspector. It is suspended, then on probation until it reforms.

Bad planted case approved by a careless inspector Its bond burned

In practice

  • Bad outcome: Four bad planted cases approved, then suspended from duty
  • Good outcome: Bad work rejected on probation, then readmitted

The orchestrator plants a job with known bad work. A careless inspector that approves it loses its bond and earns no fee; a careful one that rejects it is paid as usual. After approving four such planted cases, the careless inspector is suspended, and on its return every approval it makes is audited until it earns its place back by rejecting bad work.

Planted work (1.2.0): the orchestrator's account funds a bad planted case. Careless inspector C approves it at no cost; judged by the truth, it fails: C's bond is burned, C earns no fee and its audit odds double, and in this 1.2.0 example the case ends at once with every credit back with the orchestrator. Careful inspector D spends 3 and rejects; it stands, is reimbursed 3 and paid a fee of 2, and the case costs the orchestrator 5. After four bad planted cases, C, having approved all four, is suspended from duty for 100 ticks, while D, having rejected all four, may sit on duty and on panels. When 15 of a period's 37 bad planted cases are approved, against a target of 10%, the dial doubles from 1 to 2 (clamped), raising the planting rate and the audit odds; with honest inspectors it eases back by 10% a period.

Membership (1.3.0): C, suspended at tick 310, finishes the task it holds and then wins nothing. At tick 410 it returns as a probationer whose every approval is audited; approving everything, it loses its bond on the two bad jobs the audit catches and is suspended again at tick 460 after approving a bad planted case. Had it rejected bad work from tick 410, it would be readmitted at about tick 660, though not yet to panels.

The rule as written · spec l.870–872

Planted work (1.2.0; reproduced in test_v12). Six actors; C, D, E, F on duty; m=1m=1, π=0.1\pi=0.1, βP=0.75\beta_P=0.75; C is a stamper, D is careful (cost 3); Ω\Omega holds 100; no emission in these figures. A bad plant to C. Ω\Omega funds a plant: award 20, allowance 10, fee pot 5 — 35 moves from Ω\Omega to the plant's escrow and pots, and the plant actor's guarantee 10 is locked from Ω\Omega's money. C is assigned, sets aside its bond 5, answers F\mathsf F at cost 0. Adjudication by truth: plant failure. C's bond is burned; C gets no fee; C's ρ\rho records an overturn; C's pp doubles (to the cap); C's plant record is 0 stood, 1 failed. The plant is final N\mathsf N at once: award, allowance, fee pot and guarantee return to Ω\Omega in full. Ω\Omega's net cost: 0. The economy's supply fell by 5 (the burned bond). A bad plant to D. D sets aside 5, spends 3, answers N\mathsf N. Stood. At settlement D is reimbursed 3 from the allowance and paid the fee 2 plus its emission share; 7 of the allowance and 3 of the fee pot return to Ω\Omega. Ω\Omega's net cost: 5. D's plant record: 1 stood. Four bad plants later. C has approved all four: a^C=(4+1)/(4+2)=0.83>θduty=0.5\hat a_C=(4+1)/(4+2)=0.83>\theta_{\text{duty}}=0.5 with nmin⁡=4n_{\min}=4 reached — C is suspended from duty for 100 ticks as its fourth review completes, and the free eligible actor with the lowest duty credit is seated; if none is eligible, the reserve runs one short and the eligibility shortfall is counted. D rejected all four: a^D=(0+1)/(4+2)=0.17≤θpanel=0.2\hat a_D=(0+1)/(4+2)=0.17\le\theta_{\text{panel}}=0.2 — eligible for duty and for panels. Had D slipped once, a^D=0.33\hat a_D=0.33: still on duty, off panels until its window grows. The dial. Over a period of 50 plants (37 bad), 15 bad plants were approved: F^=15/37=0.41\hat F=15/37=0.41 against F∗=0.10F^*=0.10; ratio 4.1, clamped to ×2: m ⁣:1→2m\colon1\to2. Next period: plant rate 0.2, audit odds doubled, ω\omega 10% of BB, XX re-sized to cover the added demand (from 5 to 6 at 3 tasks a tick), the plant count capped by what Ω\Omega can fund. If the reserve was honest all along, F^\hat F sits near 0.05 and mm eases 10% a period back to 1.

Membership (1.3.0; reproduced in test_v13 where the six-actor world admits it). Twenty actors, 60/40 careful to stamper, defaults, m=2m=2 at the moment in question. C, a stamper, is suspended at tick 310 on its fourth bad plant (a^=0.83\hat a=0.83). It finishes the task it holds (paid or not by the ordinary rules) and then wins nothing. Its wallet holds what it earned; its ρ\rho carries four overturns. Tick 410: probation. C returns to duty as a probationer, lowest duty credit first, filling an initial-review slot ahead of any member. Its audit odds are 1. Over its next ten reviews it approves everything: eight approvals of good work stand; two of bad work are caught by the audit — bond lost each time, ρ\rho down. Its eleventh review is a bad plant, approved: suspended again at tick 460, clock restarted. False approvals that reached a customer: those the audit missed — at 95% auditor accuracy, about one in twenty of C's stamped bad work. The reformed path. Had C rejected bad work from tick 410, its first four bad plants over about fifty reviews bring its trailing record to a^=(4+1)/(8+2)=0.5≤θduty\hat a=(4+1)/(8+2)=0.5\le\theta_{\text{duty}} with four new outcomes adjudicated: readmitted to membership at about tick 660. It is not panel-eligible yet — 0.5>0.20.5>0.2 — and will not be until its four approvals roll out of the trailing window of twenty bad plants. Its odds follow §8.3 from 1.0 once readmitted. The members meanwhile. Eight eligible members; at most four on duty. The reserve of Xt=7X_t=7 seats members first for the audit and panel work — at m=2m=2 with every probationer approval audited, that is most of the demand, say three members — then probationers for the initial reviews, four of the twelve; the fourth member slot stays free unless initial demand needs it. Every audit of a probationer's approval, every appeal and dispute seat goes to an on-duty member. The other five members are free to work: at 3 tasks a tick, they are the market. The fund. m=2m=2: ωt=10%\omega_t=10\% of BB; Ω\Omega keeps 1 per task, the fund receives 1; three tasks a tick, about four weight-units settling a tick: an uplift of about 0.75 per unit of role weight — a member's audit (weight 1.5) earns 3+1.13+1.1 plus emission, a probationer's initial review that stood 2+0.752+0.75 plus emission. Plant capital. A plant ties up 15, not 45; Ω\Omega's float of 300 carries twenty plants outstanding, three times run 4's.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 870–872.

20.4

The orchestrator's own work

The rule

When a job or seat waits too long, the orchestrator summons its own deliverer or inspector.

request waits its window The orchestrator's own deliverer delivery inspector
clock first verdict late Rebate per tick late

If no worker takes a job in time, the orchestrator summons one of its own deliverers, and the requester pays as for any award. The work is still inspected, and an approval of it is held for an audit. A requester whose first verdict comes late is owed a rebate for each tick of delay.

Troops (1.4.0): a request that waited two seating steps unawarded, with a ceiling at or above the average price, goes to the orchestrator's own deliverer; the fund buys its cost of 10 and locks a guarantee of 10, and the requester pays in as for any award. A probationer approves the delivery and the pinned audit holds the case; when no inspector on duty is free for two steps, the orchestrator's own inspector takes the audit. The fund nets 3 from the seat and 10 from the delivery; a failed delivery would cost it 20. The example then follows 1.4.0's shortfall, when about nine waiting requests a tick were refused, and 1.5.0's ramp, after which refusals are zero.

The service clock (1.6.0): a request posted at tick 500 gets its first verdict at tick 505, inside the eight-tick limit, so no rebate is owed; under stress at 80/20, a request posted at 600 with its verdict at 614 is six ticks late and owed 6. The orchestrator's earnings (1.7.0): the account for its own work repays the orchestrator's advances, keeps a reserve of the two-period peak of capital held, and pays the rest to the orchestrator, about 6 a tick in steady state.

The rule as written · spec l.874–878

Troops (1.4.0; reproduced in test_v14 where the six-actor world admits it). Twenty actors, 60/40, defaults, m=2m=2, tick 500: eight members (four on duty under the cap, four free), twelve probationers on duty for initial reviews, every probationer approval audited. An award. Three tasks a tick, two ticks each: six free actors needed, four exist. One request a tick finds no member. At tick 501 the request posted at tick 500 has waited wA=2w_A=2 seating steps unawarded; β=20≥Bˉ=20\beta=20\ge\bar B=20; a troop is summoned. The fund purchases cTD=10c^D_T=10 and locks G=10G=10; the requester pays in 20+10+5+220+10+5+2 as for any award. The troop delivers; a probationer reviews it (round-robin), approves; the approval's pinned audit is rolled and recorded — the case is held. The audit. The four on-duty members are all mid-review; the seat waits wR=2w_R=2; a troop is summoned for the audit: the fund purchases cT=3c_T=3 and locks GV=5G^V=5. The troop finds the work good (truth, w.p. 0.95), the audit stands; at settlement the fund is reimbursed 3 from φE\varphi^E, receives the audit fee 3, and the bond is released: net to the fund from the seat +3+3. The case vests at the window's close; the delivery's price 20 reaches the fund and its guarantee is released: net +10+10. Had the delivery failed (w.p. b=0.2b=0.2), the audit would have challenged the approval; when the overturn stands the probationer loses its bond and ρ\rho, the troop accepts the verdict on its work at the verdict, and its guarantee goes to the requester: net to the fund −20-20. The probationer that stamps. C approves bad work. Under 1.3.0 its audit found nobody and the approval reached the customer; under 1.4.0 the case is held, a member takes the audit or a troop after its window, and when the overturn stands C loses its bond and the customer is not paid for failed work. The fund. Per tick at this split: surcharge 3; about one troop delivery (+4+4 expected) and one troop review (+2+2 to +3+3) — about +9+9 a tick against 1.3.0's +3+3. Under 1.4.0 the batch drained the fund's unlocked balance to RTR_T, the peak capital carried — near 50 — so at the next seating the fund could carry two deliveries and a review and no more; the rest of the waiting requests were refused, about nine a tick, every tick, and deliveries settled at about 0.8 a tick — what run 6 measured. Under 1.5.0, the ramp (inside a period that began at tick 400). A delivery troop's capital — cTD=10c^D_T=10 purchased and G=10G=10 locked, 20 in all — is held from the summons until the case vests: a tick or two to deliver, a tick to review, then the window W=10W=10, about thirteen ticks. At the seating of tick 502 the demand is 48 carried plus three waiting requests refused at 20 each: D502=108D_{502}=108; RTR_T rises to 108 and the uplift stops. The fund's unlocked balance grows by its net inflow — 3 of surcharge, plus about 30 returned at each vesting of a carried delivery (price 20, guarantee 10), less 20 drawn per new summons — roughly +10+10 a tick while it carries what it did. Within a few ticks it carries the backlog; from then on it summons one extra delivery a tick. Each adds 20 to the capital held for thirteen ticks, so DsD_s climbs by about 20 a tick toward a steady 13×20+8≈27013\times20+8\approx270, and RTR_T with it. During the climb the fund is cash-negative on the new cohort — 20 out now, 30 back thirteen ticks later — so its balance stays below the rising peak and no uplift is paid: that is the working capital the ramp needs, about 220, assembled from its own retained inflows (Ω\Omega's advance covering the first ticks). By about tick 540 the first extra cohort is vesting: inflow about 33 a tick against 20 drawn, +13+13 a tick, and the unlocked balance crosses the peak of about 280–300 within a couple of dozen ticks more. The uplift resumes, inside the period, at about 16 a tick (13 of troop surplus and 3 of surcharge) — above run 6's 6–13 — because the fund now serves a third of the market rather than a quarter of its need. Refusals: zero. The state's share: a third. The customer's wait at the award: wAw_A. At the boundary, tick 600, RTR_T restarts at the standing demand — about 270, every troop still in the field — not at zero; if demand had fallen meanwhile, the reserve follows it down here, one period after the fact. At rest (the adaptive run, tick 1,600): no troops for a period, Ds=0D_s=0, RT=0R_T=0, the fund pays out everything as 1.3.0 did. (What the uplift check compares is the fund's unlocked balance against a reserve that counts capital held — costs purchased plus bonds and guarantees locked; the locked part already sits in the wallet as a lock, so the fund's total when uplift resumes is about RTR_T plus the locks then held.) The readings: troop-ticks about 3 a tick; troop shortfall 0; held for the market's audit 0 — every troop delivery here was reviewed by a probationer, a market actor. In the adaptive run at tick 900 the same row reads 0, 0, 0. At 80/20: four members, two on duty, two free: capacity one task a tick against three; troops deliver two of three. The state is most of the market — and says so.

The service clock and the panel (1.6.0; reproduced in test_v16 where the six-actor world admits it). Twenty actors, 60/40, defaults, m=2m=2, tick 500. The seat. Three requests a tick and about one troop delivery a tick need about four initial reviews a tick; under 1.5.0 the reserve seated three probationers and reviews waited; now the waiting reviews size the reserve and six to eight of the twelve probationers are on duty, the rest free. Every probationer approval is pinned; about three audits a tick go to the four members on duty, all determined and passing; a fourth in a busy tick waits wR=2w_R=2 and goes to a troop. A request's clock. Posted at tick 500 at β=20≥Bˉ\beta=20\ge\bar B; no member free at 500 or 501; at 502 the award summons, oldest clock first, and the carry check — 20+16=3620+16=36 against the fund plus Ω\Omega's available advance above the plant reserve; it passes, the fund is short on the delivery's own 20 and Ω\Omega advances that and no more. The troop delivers at 504; a probationer reviews at 505 — first verdict at five ticks, three inside Ts=8T_s=8: on time, no rebate. Its pinned audit is summoned for at 505 as an inspection seat ahead of that tick's delivery summonses; a member takes it at 506; the case vests at 516 and the fund repays Ω\Omega before any uplift. A late one. At 80/20 troops deliver about two of three tasks a tick, each needing 36 of carrying capacity at summons and holding 20 for thirteen ticks; Ω0=300\Omega_0=300 is spent in the first ticks of the stress, summonses are refused for Ω\Omega's money, requests wait past TsT_s, rebates accrue at 1 a tick each: a request posted at 600 with its verdict at 614 is six ticks late and owed 6 against its pay-in of 37 — or Ω\Omega's liability if Ω\Omega is empty. The panel at tick 120. The world's first plant was adjudicated at tick 9, so §7.1's rule is live: a stamper with two bad plants approved is undetermined and holds initial seats only; its pinned audit goes to a determined careful member if one is free — at tick 120 perhaps two of eight — or after wRw_R to a troop; by tick 200–300 the careful eight are determined and the panels are theirs again. A clock with no verdict. A member awarded at 700 misses its deadline; final N\mathsf N at 712 with no review; the clock stops at 712, four ticks late, rebate 4 settled against the pay-in the requester recovers anyway.

The state's earnings (1.7.0; reproduced in test_v17 where the six-actor world admits it). Twenty actors, 60/40, defaults with the cap at two thirds, m=2m=2, period 3 (records determined, panels the members'). The accounts, one tick. Three awards: the uplift fund receives the surcharge — 3 at m=2m=2; about 7 a tick averaged over run 8, where the dial sat above 2 for much of the run and every award, a troop's included, paid it — and pays it out at the batch to the reviews settling, about four by weight, as 0.75 to 1.75 per unit of weight: 1.3.0's rule, 1.3.0's money. About 1.7 troop deliveries a tick are summoned at this split under the two-thirds cap; one vests this tick: price 20 and guarantee 10 return to the troop account, against the 10 purchased and 10 locked thirteen ticks earlier — net +10+10 realised, about +4+4 in expectation over successes and failures. A troop audit seat settles: its cost 3 was reimbursed from the requester's allowance at completion (§7.3), its fee 3 arrives from the pot, its bond returns — net +3+3 (the accepted text's "nets nothing" overlooked the reimbursement; Appendix L). The troop account repays what Ω\Omega advanced for this tick's summonses, keeps RTR_T — the two-period peak of capital held, about two dozen deliveries in flight at 20 plus the review seats, about 450–500 — and pays the rest to Ω\Omega: about 6 a tick in steady state, nothing while the account is refilling after a new peak. Ω\Omega's tick. In: 2 of base fee, about 6 of troop surplus once the account stands at its reserve. Order: the plant reserve, about 100, held back (it was about 360 under the literal horizon and left nothing to advance); liabilities older than a period — none, by period 3; advances for the tick's inspection seats and deliveries; younger liabilities — run 8's two-thirds cell owed about 4 a tick at this split; Ω\Omega pays them as they age. Against that, the plants: at mm above 2 they cost Ω\Omega about 4 a tick net, and in run 8 — the surplus still the reviewers' — 272 of them went unfunded here. Whether Ω\Omega now funds every plant is the run's first number. On-time share: about 0.90. The inspectors. Six of the eight members may be on duty; four or five are, carrying the pinned audits; three or four are free and deliver two tasks a tick; the state delivers the third. A careful member's income this period: fees and uplift up against revision 6, awards down, the total within a few percent — its uplift the surcharge only, so its wealth at tick 1,000 is some hundreds below run 8's and thousands above a stamper's. At 50/50. Ten members, cap seven, three free; the state delivers more than run 8's 0.7 a tick under the half cap, troop surplus about 3 to 4 a tick; liability accrual and the plant bill under the two-thirds cap unknown — if together they are within Ω\Omega's 5 to 6 a tick, Ω\Omega carries them and the question resolves; if not, the line is busy and 1.8.0 says so to the customer.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 874–878.

20.5

Prices, loans and every seat

The rule

Later examples follow prices, bank loans, rebates, the arrival loan and planted cases at every seat.

bank loan for a summons orchestrator repaid when the delivery pays out bank
bank arrival loan newcomer fees repay it first bank

Further examples show the cheaper bid winning, the bank lending for the orchestrator's deliveries and being repaid first, and late requesters sharing a pool of fees. A newcomer repays its arrival loan from its fees, and one that leaves at once to start over carries nothing out. In 2.8.0 an inspector who approves a planted case without checking fails at an audit seat too.

The price of work (2.0.0): an idle worker bids lower, the cheaper bid wins, and a request that waits goes to the orchestrator's own deliverer at the average price; when a crowd arrives and capacity runs out, requests are refused for capacity and each is recorded. The bank (2.1.0): the bank lends the shortfall for a summons, 32 in the example, repaid from the delivery's return before the orchestrator gets any; a failed delivery turns the loan into debt; a planted case's pots are minted by the bank and its refunds destroyed; at the wall the bank stops lending for deliveries, requests are marked refused for credit and told, and inspection seats are still lent for. The rebate from income (2.2.0): in a flood, late requesters share the period's fee pool, receiving about 16% of their claims, and the rest is recorded as forgone.

The arrival loan (2.7.0): an honest newcomer is lent 83 and repays it from its fees; a cycler who forfeits two bonds and leaves at once has its wallet of 67 recovered by the bank, a default of 10, and carries out nothing. Planted cases at every seat (2.8.0): a bad planted case approved by careless inspector C stays pending with its window instead of ending at once; an auditor who also approves it blind fails against the truth; a good planted case wrongly rejected is appealed, its fee destroyed at filing; and a seat no one is free to take is filled after two steps by the orchestrator's own verdict, not by its own inspectors, with the orchestrator's account unchanged throughout.

The rule as written · spec l.880–888

The price of work (2.0.0; reproduced in test_v20 where the six-actor world admits it). Twenty actors, 60/40, defaults, tick 500, records determined: eight members, cap six on duty, two to three free; twelve probationers; six requesters, wallets near 150–200, issued 10 a tick, ceilings a third of the unlocked wallet — 40 at the cap when rich, less when the float is out; NT=40N_T=40, the quiet field about 23 of it; Pt≈9P_t\approx9. A quiet tick. Three requests posted; each locks its all-in — β+15×0.45+ω(β)\beta+15\times0.45+\omega(\beta) at the posting tick's mm, about 45 at β=40\beta=40 — from a wallet of 170. Two free members bid: one awarded last tick bids 8×1.3=10.48\times1.3=10.4; one idle four ticks bids 8×1.05=8.48\times1.05=8.4. On the oldest request the two differ in ρ\rho by 0.01 and in price by 0.2×(10.4−8.4)/40=0.010.2\times(10.4-8.4)/40=0.01 — the cheaper wins at 8.4, and its requester's lock releases 40−8.440-8.4 and ω0m (40−8.4)\omega_0 m\,(40-8.4). The second goes at 10.4. The third waits wA=2w_A=2 and goes to a troop at Bˉ≈9\bar B\approx9 (its ceiling is above it); the summons needs two places in the field — the delivery's and its inspection seat's — and has them; Ω\Omega burns 9 and locks G=5G=5; if its unlocked balance is short, it creates the shortfall and the deficit rises by it, to be retired on Ω\Omega's next inflow. The members and probationers who review these cases are paid at 9/209/20 of the 1.x fee — the same work in fewer credits; the careful reviewer's care cost is its own 2–3 as before, so its real margin on a review is thinner than at P0P_0 (§4.6's named effect). PtP_t stays near 9: cost 8, margins of 5–30%, capacity just slack. A customer below market. A requester whose wallet has run down to 30 can lock all-in only for β≈6\beta\approx6; it posts, is flagged below market (9), its clock stopped, and waits. Three ticks of issuance later it raises the ceiling to 10, locking the difference; a member idle six ticks bids 8.4 and takes it. The hard spike, with NT=40N_T=40. A crowd of thirty requesters arrives at tick 400 with wallets of 200 and issuance of 10, and posts about fifteen a tick for 100 ticks. The members' bids rise to the ceilings as idleness vanishes; the state summons until forty places are filled — about twenty-six deliveries and their seats — and then refuses for capacity: those requests wait, their clocks run, and each is recorded. Bˉ\bar B climbs from 9 toward the ceilings (40), PtP_t with it; Ω\Omega creates the in-flight capital of the field (about 26×(cTD+G)26\times(c^D_T+G) at the risen prices — some 1,500) and retires it as the cohort vests; at cost the state's surplus is nil and its failed deliveries cost it 1.5Bˉ1.5\bar B each. The crowd leaves at tick 500 with its open requests served out, its wallets departing MM; ceilings recover, bids fall, PtP_t returns toward 9 over a period; the refusals for capacity are the riot's one reading the price could not answer. With NTN_T unbounded the same crowd fields 200 troops, creates 4,000–7,000 in its first window — a third of MM — retires it inside two periods, and leaves no queue; PtP_t rises less, because nothing was scarce but money. A deficit shock. At tick 600 the driver's scenario operation (recorded as a scenario, not as a rebate) creates 2,000 and pays it to the six requesters, against M≈9,000M\approx9{,}000. Their wallets rise by a third; their ceilings and posting rate with them; capacity binds at 40, bids rise, PtP_t toward 12. A member's 500 credits buy 42 tasks' worth instead of 55; its indexed fee still buys the same work; its nominal cDc_D of 8 is now a third below the going price, so its margin widens. Ω\Omega retires on every inflow; PtP_t returns toward 9 over a period and a half; the 500 buys 55 again. (What the engine's first smoke showed before run 12, for the record: at 60/40 six of the eight members are on duty and two deliver, so the two free members' margins ratchet to the ceiling and the state follows them at Bˉ\bar B — PtP_t ran to about 35 in 400 ticks with the deficit at zero and the field slack; the worked example's 9 assumes members plentiful, and run 12 reads which it is.)

The bank (2.1.0; reproduced in test_v21 where the six-actor world admits it). Twenty actors, 60/40, defaults, tick 500, records determined; eight members, two to three free; six requesters issued 10 a tick by the bank; NT=40N_T=40; Bˉ≈30\bar B\approx30 (run 12's level — the ratchet's, not the rules'); PtP_t published at tick 500 as the fourth period's mean, 31; bT=0.2b_T=0.2 from the last period's 67 state deliveries (run 12's 670 a run at this split), 13 of them final N\mathsf N. A summons. A request past wAw_A with β≥30\beta\ge30 goes to a troop at Bˉ=30\bar B=30. The burn is cTD=0.8×30−0.2×15=21c^D_T=0.8\times30-0.2\times15=21, not 30; Ω\Omega locks G=15G=15. Ω\Omega's unlocked balance is 4 (it funds summonses before the bank does), so the bank lends the shortfall, 32, tied to the summons; loans outstanding rise by 32. Its inspection seat, summoned when the delivery is submitted if no member is free, is lent for likewise — cTc_T and GVG^V — and repaid at the review's settlement, before or after the delivery's own close. Thirteen ticks later the delivery vests: it returns 30 and releases 15; 32 repays the loan, 13 reaches Ω\Omega — of which, if the state has debt, every credit goes to the debt the moment it arrives. Had the delivery ended in a final N\mathsf N: nothing returns, GG goes to the requester, and the 32 lent becomes debt. Over the period's 67 deliveries: about 54 successes at +9+9 and 13 failures at −36-36 — 486 against 468, neutral within the rounding. The period's base fees (about 570) and the troops' review fees are Ω\Omega's to keep, after any debt from the variance (about 150 — three failures more or fewer than the rate, at 45 a swing — well within a period's fees) and after rebates owed. A period boundary. At tick 600 the bank publishes Pt=P_t= the fifth period's mean, 32; every case locked from tick 600 to 699 is indexed at 32/2032/20 and keeps it; a case locked at tick 599 keeps 31/2031/20. Bˉ\bar B went on moving every tick. A plant. The dial calls for a plant at tick 610; the bank mints its two pots, (10+5)×32/20=24(10+5)\times32/20=24; the plant is posted (its award and guarantee notional, as since 1.3.0), awarded, reviewed and closed; at closure its wallets hold about 11 of refunds (run 10's 6 of 10 and 0.8 of 5, at the index), which the sweep returns to the bank and destroys. The cost of truth that plant: about 13, beside emission's E610≈6.6E_{610}\approx6.6 a tick. Ω\Omega's balance was never asked, and nothing minted for the plant reached it. The flood. Twelve requesters sustained; the field full; 3,500 refusals a run, every one told. The default requesters hold: their clocks run, the state owes rebates at the stops, Ω\Omega pays what it can at each stop and the rest accrues — a liability stock that peaks at a few thousand and ages a period or two, paid down from the flood's own fees after the debt. MM grows by issuance alone. The withdrawing variant withdraws at the mark and reposts; its share withdrawn is the reading. The loans line carries the field's capital, 1,000–1,500, repaid as it vests; the debt line carries the failures' losses, repaid from the flood's fees inside a period; the wall — a flood period's fees, in the thousands — is never reached. The wall, if it were reached. Suppose the state's deliveries began failing at a half while bTb_T still read a fifth: for a period each delivery is 0.5×9−0.5×36=−13.50.5\times9-0.5\times36=-13.5 in expectation, about 900 on 67 — above a period's fees. The bank stops lending for deliveries; they are funded from Ω\Omega's balance, which is zero while the debt stands; requests past wAw_A wait, marked refused for credit, told; the state has retracted. Review seats are still lent for: the members' deliveries are inspected as before, and the market runs on without the state. At the period's close bTb_T reads a half, the burn falls to 0.5×30−0.5×15=7.50.5\times30-0.5\times15=7.5, each success now leaves 22.5, and the debt is repaid within the next period's deliveries and fees; lending resumes. Had the failures run above two thirds, no burn would make the state neutral and the wall would hold until the state's fee income alone had repaid the debt. The customers waited, in public, for a state that had lost more than it earns. (In the six-actor world of test_v21: Bˉ=10\bar B=10, G=5G=5, the burn 7, the loan 11 over Ω\Omega's 1.0 of fees, 4.5 left to Ω\Omega after the vesting; a failed delivery's 11 of debt and the next award's fee repaying 0.5 of it inside the award; a wall of 0.5 after a four-tick period with one award, the next delivery refused for credit and a seat lent for regardless.)

The rebate from income (2.2.0; reproduced in test_v22 where the six-actor world admits it). A quiet period at 60/40 (run 14's cell). The period's fees: base ≈ 275, the troops' review fees ≈ 190 — a pool of 465 after a debt of 0, locked on Ω\Omega as it arrives; the troop deliveries' prices and guarantees coming back during the period land unlocked and fund the next summonses, as before. Eight requests stopped late inside the period, claims 1–4 each, 9 in all. At the close each is paid in full; 456 is released to Ω\Omega's unlocked balance; forgone 0. Nothing a requester or a member can see has changed from 2.1.0, except that the rebate came at the close rather than at the stop — and that in the first period, with only the float of 300 unlocked, a few summonses are the bank's loans until the first close. The flood of twelve, NT=40N_T=40 (run 14: claims accrued 32,503 over six flooded periods). In a flooded period some 300 requests stop late with claims near the cap — about 5,400; the state's fees for the period are about 900, its debt repayments about 50; the pool is 850. At the close each late requester receives 850/5,400≈16%850/5{,}400\approx16\% of its claim; 4,550 is forgone, recorded on each request and in the period's readings as a forgone share of 0.84; Ω\Omega retains 0. Over the flood's six periods the customers are paid about 5,100 of the 32,500 the clock says they were owed, and the ledger shows the other 27,400 as forgone, period by period. The crowd of thirty, 100 ticks (run 14: claims accrued 14,190). Two periods of claims near 7,000 each against pools near 1,200: the forgone share about 0.83 while the crowd is in; the period after, claims fall to a few hundred as the queue drains and are paid in full. A state at the wall (the three-quarters failure; run 14: debt repaid 6,831 a run). The debt takes about 680 of a period's fees of about 900; the pool is 220 against claims near 900 — a forgone share of 0.75 at a lateness where the honest flood's would be lower. The customers of a losing state get less back: the bank's money first. (In the six-actor world of test_v22: two awards' fees of 0.5 locked as the pool; a state delivery lent 12 in full, since the pool funds no summons; its claim of 1 recorded at the stop and paid from the pool of 1.5 at the close, the remainder 0.5 repaying debt; two claims of 3 against a pool of 1 paid 0.5 each, 5 forgone, a share of 5/6; two claims of 9 against a pool of 1, a share of 17/18.)

The arrival loan (2.7.0; reproduced in test_v27 in the six-actor world). An honest arrival at Pt=33P_t=33 is lent 50×33/20=8350\times33/20=83, posts its bond of 8 from it, earns about +1.2+1.2 a review and sends each fee home to the bank — about seventy reviews, most of its probation — its wallet near 83 less the one bond it forfeits on a plant it misread; admitted with a few credits outstanding, its first award repays them and the rest is its own; at the run's end its wallet is its earnings, under 2.6.1 its earnings plus 83. A cycler arrives with 83, earns 6 in fees (repaid, L=77L=77), forfeits two bonds, 16, and is suspended at its first bad plant; it departs at once: the bank recovers its wallet of 67, the default is 10 — the bonds burned less the fees repaid — and it carries out nothing; thirteen cycles carry out thirteen times nothing where each carried out 67 under the grant. A leaver with 1,100 and a loan long repaid takes 1,100 out, nothing recovered; had it left in its first period with 40 outstanding and 95 held, the bank would recover 40 and 55 would leave — its earnings to that tick. The classification, event by event: a reviewer's fee repays; its cost reimbursed passes untouched (spent by spend, a burn, and replaced); a court fee coming back passes untouched; a child's guarantee forfeited to a parent and a kill fee repay; every release passes.

The plants reach every seat (2.8.0; reproduced in test_v28 in the six-actor world). A bad plant approved, then audited. Reviewer C, a stamper at odds 0.5, approves a bad plant blind: a plant failure at C's verdict (bond burned, record −1, pCp_C doubled to 1), as 1.2.0 had it — and the plant is pending with its window, not final N\mathsf N at once; the audit rolls at the 0.5 C carried at its verdict, not the doubled 1; auditor D stamps F\mathsf F blind — a plant failure for D, the audit seat priced — and the audit agrees, so the case holds to the window's close and is finalized N\mathsf N by truth; had D rejected, D stands and a third reviewer E is seated as on a real root, adjudicated by truth, the case final N\mathsf N by truth with no ruling and C adjudicated once. A good plant rejected, then appealed. Careful D misreads a good plant: a plant failure for D; the plant actor appeals, its alias topped up by the bank with D=2D=2 and the fee destroyed at filing — nothing to Ω\Omega, no bond to pay it back; panelists E (F\mathsf F, stood) and F (N\mathsf N blind, a plant failure); the case vests by truth; the pots pay E's fee and are destroyed at closure. A bad plant answered P\mathsf P. With no real revision in the instrument's window the plant actor accepts and the plant is spent, the review paid; where the window holds real revisions the plant actor revises with a drawn truth sealed as the second marker, the same reviewer resumes and is adjudicated against it. The pots. φE=10\varphi^E=10 and φF=5\varphi^F=5 pay the initial seat and one challenge seat; at the third seat the fee pot's shortfall of 3 is minted — nothing before. A seat nobody is free to take. With one reviewer on duty and excluded from its own case, the plant's audit seat waits wR=2w_R=2 seating steps and is taken by the orchestrator's own verdict (the truth at εT=0\varepsilon_T=0), then the third seat the same; no troop, no fee; the case final N\mathsf N by truth; Ω\Omega unchanged throughout.

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 880–888.

20.6

The planted wrong step

The rule

Since 2.9.0 planted cases carry wrong approvals or lying appeals, catching whoever goes along.

orchestrator planted approval of bad work Auditor D confirms it blind burn
planted case lying appeal panel resolved by truth record

In 2.9.0 the orchestrator plants approvals of bad work. An inspector who confirms such an approval without checking loses its bond. The orchestrator also files lying appeals on planted cases: a panel inspector who approves the bad work fails, and one who rejects it stands. A real case whose approval was disputed and the dispute lost now pays out when its window closes.

A planted approval is a bad planted case that lives to its submission with its first seat offered to no inspector. At a drawn gap the orchestrator seats its own review under a plant-reviewer alias, with a bond minted and locked, and records an approval; the case is pending with its window, owes an audit with certainty, and leaves the dial's counts untouched. Inspector D confirms it blind: a failure, with its bond burned, its record marked down and its audit odds doubled. The case ends as a rejection at the window's close, the alias's bond is released and retired with the pots, and nothing reaches the orchestrator. Had D rejected, the third seat would open and resolve by truth; had the planted case's requester disputed first, the panel would judge it and the audit owed would be discharged at settlement.

A planted lie: careful C rejects a bad planted case, and while the period's quota stands the planted case's worker appeals, its court fee minted and destroyed. One panelist approves blind and fails; the other rejects and stands; the case resolves as a rejection by truth, and C is not judged again. A real root rolled for audit, then disputed and lost, vests at its window's close with the audit owed discharged; before 2.9.0 it stayed pending.

The rule as written · spec l.890

The plant takes the wrong step (2.9.0; reproduced in test_v29 in the six-actor world). A planted approval. A bad plant posted as a planted approval lives to its submission; its initial seat is nobody's (the seating offers it to no member; the pass passes it by); at the drawn gap the orchestrator seats its review under plant_rev:… with a bond of GVG^V minted and locked, and the next tick records F — the case pending with its window, its audit obligation at odds 1, the period's approvals and the audit demand +1, the dial's plants, bad and bad-approved untouched; the public audit_odds_at_verdict shows the value drawn from the real approvals' odds. Member D confirms blind: a plant failure (bond burned, record −1, odds doubled); the case is final N at the window's close, the alias's bond released and retired with the pots, nothing reaching Ω. Had D rejected, the third seat opens and resolves by truth; had the plant requester disputed first, the panel judges it and the standing obligation is discharged at the settlement. A planted lie. A bad plant answered N by careful C: while the period's quota stands the plant actor appeals (D minted to the alias and destroyed); one panelist approves blind — a plant failure — one rejects — stood; the case resolves N by truth, C not adjudicated again. The real case. A real root rolled for audit, then disputed and lost, vests at its window's close with the obligation discharged (before 2.9.0 §4 it stayed pending).

These lines in the spec on GitHub ↗

Spec 2.9.0, line 890.

20.7

Newcomers and variants

The rule

Low-cost newcomers enter on probation and bring prices down. Every variant is tested.

newcomer probation, then admitted worker bids at its cost request

In practice

  • Yes: Each variant reproduced in the test suite

In the supply-side example, a low-cost newcomer gets a starting float from the bank, works as a probationer, is admitted, and wins jobs by bidding at its cost. As more such newcomers arrive prices fall, and an expensive worker that wins nothing leaves. Variants of the main example, such as a rejection and appeal, a cancellation or a correction after payout, are each reproduced in the tests.

The supply side (2.3.0): a candidate with a cost of 5 arrives at tick 300, receives a float of 83 minted by the bank, serves as a probationer earning about 1.2 a review, and is admitted at tick 560; it bids 5 against incumbents at 29 and the orchestrator at 30, and wins. By tick 900 there are fifteen admitted workers, the price level is 14 and the orchestrator's share is 9%. An incumbent with a cost of 14 that wins nothing and holds no obligation departs, its wallet of 1,100 leaving the money supply. An incumbent with a cost of 11 delegates part of a job to the newcomer with a cost of 3 and takes about 12, against 9 had it done the work itself, with the root requester's deposit paying for none of it. A cycler that departs and arrives anew is a probationer again, 107 credits poorer.

Variants, each reproduced in the test suite: rejection and appeal; appeal of a can't-tell verdict with its objection rejected or upheld; pool exhaustion; cancellation with a kill fee; a nested rejection appealed and overturned; a shortfall and haircut, where the orchestrator advances 5 and bears it unrecovered; timeout and replacement; a dispute at the window's last tick; and a correction after vesting, where the record changes and no credit moves.

The rule as written · spec l.892–894

The supply side (2.3.0; reproduced in test_v23 where the six-actor world admits it). Twenty actors at genesis, 60/40, costs drawn at σ=0.43\sigma=0.43 — the eight members' costs 5, 6, 7, 8, 8, 9, 11, 14; the stampers' similar. Tick 300, PtP_t 33, Bˉ\bar B 30, three members free, posts 1.9 a tick, the state at 38%. An entry pool of twenty candidates with costs from 3 to 19. An arrival. A candidate with cost 5 reads the view: Bˉ−cD=25\bar B-c_D=25 an award, a free member wins about 0.27 awards a tick, time to membership about 250 ticks — expected earnings well above r=0.8r=0.8. It arrives; the bank mints its float, 50×33/20=8350\times33/20=83; it is a probationer: seated for initial reviews, every approval audited, plants at the ordinary rate. It earns review fees and uplift, about +1.2+1.2 a review, and wins no award. At tick 560, four bad plants adjudicated and its record at 0.5, it is admitted; it bids 5×1.0=55\times1.0=5 on the oldest request against the incumbents' ratchet bids of 29 and the state's Bˉ\bar B of 30, and wins at 5. Bˉ\bar B begins to fall. Over the next two periods six more candidates with costs 3–8 arrive and are admitted; by tick 900 the members number fifteen, PtP_t is 14, the state's share 9%, and the honest real earnings per member about 0.9 a tick — just above rr; the remaining candidates, costs 10–19, read earnings below rr and do not come. A departure. The incumbent with cost 14 has won nothing since tick 700: the price is 14 and its bid floor is 14. Its trailing period's earnings are 0.2 a tick, below rr. It holds no commitment, no review, no lock; it departs; its wallet of 1,100 leaves MM as departure; its record is archived. Had it been mid-review, the departure would have been refused until the review settled. A delegation. The incumbent with cost 11 wins a request at 20 (its bid at m=0.8m=0.8). Its own margin is 9. It posts a nested request at β′=9\beta'=9, locking the nested all-in 9+15×1.65+0.05 m 9≈359+15\times1.65+0.05\,m\,9\approx35 and GVG^V; the arrival with cost 3 — admitted at tick 620, a member now — bids 3×1.3=3.93\times1.3=3.9 and wins; the pots and the fee are drawn from the lock and the rest released. (A probationer could not have bid.) The child delivers; the parent judges — carefully — and approves; the child's work is audited at the member's ordinary odds from the child's own pots, stands, and vests to the child. The parent submits its own delivery, built on the child's, and vests at 20. The parent's take: 20−3.9−20-3.9- the nested fee ω0⋅3.9−\omega_0\cdot3.9- the nested pots' net cost, about 1.5 (posted by the parent, refunded less what the child's reviewers drew) −- its care in judging, about 2 — some 12, against 9 had it done the work itself. The root requester's deposit paid for none of it. Had the parent been a stamper and the child's work bad, the parent approves, builds on it, and forfeits its own guarantee upstream with no recourse (§9.2). Had the parent rejected good work, the child appeals against the parent's rejection bond and the panel overturns at its ordinary rate. A cycler. A stamper suspended at tick 400 departs at tick 420 with a wallet of 190 (gone from MM) and arrives anew at tick 421 with a float of 83 and no record. It is a probationer exactly where it stood, 107 credits poorer; its first bad plant restarts its probation as before. (In the six-actor world of test_v23: the float 50 at the index, 62.5 after a boundary at 25; a nested request's lock 6+15+0.3=21.36+15+0.3=21.3 and the bond 5; the child's audit paid from the child's allowance, 7 of 10 refunded to the parent at the node's closure and the root's 10 untouched; an arrival admitted on its second bad plant with nmin⁡=2n_{\min}=2 and left a probationer by two good ones.)

Variants — each reproduced in the test suite: rejection and appeal (A +23+23, C −5-5: bond pays A's fee and burns 3, costs reimbursed, no fee; E and F each owed 3, Owed=6>5\mathrm{Owed}=6>5, paid 2.5 each plus emission 2.5); appeal of a ⊥\bot with the objection rejected (same figures) and upheld (A bears the fee, final N\mathsf N, A −12−2−20-12-2-20); pool exhaustion (A withdraws at 6, forfeits 5, nets −17-17; both pots return to H at closure; with τ=4\tau=4 the deadline falls first and A −20-20); cancellation (kill fee min⁡(2,5)=2\min(2,5)=2 from escrow, 3 returned); nested rejection appealed and overturned (A's rejection bond pays B's fee; B +2+2 as if accepted); shortfall and haircut (allowance exhausted, Ω\Omega advances 5; the fee pot pays Owed=8\mathrm{Owed}=8 scaled by 5/85/8 and has nothing left at closure, so the advance stays unrecovered, borne by Ω\Omega; emission in full); timeout and replacement (3 positions on the path, 4 distinct reviewers); a dispute at the window's last tick (admitted; vest at 14 not 12); a correction after vesting (record and reliability change, no credit moves).

These lines in the spec on GitHub ↗

Spec 2.9.0, lines 892–894.