@ixo/openhands-sdk 0.0.0-stage → 0.1.0

package/dist/esm/campaign/rule.d.ts

@@ -0,0 +1,311 @@
+/**
+ * The campaign's funding rule — written once, sealed, revealed later.
+ *
+ * **Why a hash and not a secret.** Mapping runs before funding exists, and a
+ * mapper who knows what a pin will pay can aim at it: dump where the money
+ * will be, inflate what the rule rewards, fabricate what the sponsor matches.
+ * Keeping the rule secret would work and would ask everybody to trust that we
+ * did not write it after seeing the pins. Publishing its hash on day 0 asks
+ * nobody to trust anything: the rule is fixed, provably before the first pin,
+ * and unreadable until we say so.
+ *
+ * So the campaign can honestly say *"what happens next is already decided —
+ * here is the proof"* without saying what was decided. That is the whole
+ * device, and it is the same commit–reveal this estate already uses for
+ * sealed submissions, moved up a level from one answer to the rules
+ * themselves.
+ */
+export interface CampaignRule {
+    v: 1;
+    campaign: string;
+    /** ISO date. After this, mapping closes and the rule is revealed. */
+    mappingCloses: string;
+    /**
+     * A campaign that never ends.
+     *
+     * Sealing exists so a mapper cannot aim at money that has not been
+     * announced — a real defence when mapping and funding are two phases of one
+     * day. A campaign that runs all year has no such phases: pins arrive and
+     * fund continuously, the rule has been public for months, and keeping it
+     * secret would protect nothing while making every backer trust a document
+     * they cannot read. So an open rule says so, and is simply published.
+     *
+     * Absent means sealed, which is what every rule written before this was.
+     */
+    open?: boolean;
+    /**
+     * When a spot may post for less than its whole bill, with no day to wait
+     * for.
+     *
+     * A one-day campaign has a deadline and down-bands at it. An ongoing one
+     * needs a clock instead: a spot that has stood long enough with most of its
+     * money is better cleaned partly than left standing, and "long enough" and
+     * "most" are the campaign's own numbers rather than code's.
+     */
+    clock?: {
+        downBandAfterDays: number;
+        downBandAtFraction: number;
+    };
+    funding: {
+        /** Targets come from the assessment frozen at approval — never re-read. */
+        bandTargetsFrom: "assessment-at-approval";
+        /** Post the largest band the money covers rather than nothing. */
+        downBand: boolean;
+    };
+    finder: {
+        cutPercent: number;
+        floorBase: number;
+        capBase: number;
+        paidFrom: "treasury";
+        on: "cleanup-approval";
+    };
+    match: {
+        sponsor: string;
+        ratio: number;
+        perSpotCapBase: number;
+        /** Fraction of target the crowd must reach before match is offered. */
+        threshold: number;
+        deadline: string;
+        bands: ("trailer" | "truck")[];
+        requiresConfirmation: true;
+        drawnLast: true;
+        approval: "sponsor-tap";
+        /**
+         * Small spots the sponsor has agreed to match without being asked each
+         * time, up to a daily ceiling.
+         *
+         * The tap exists because sponsor money is somebody's budget and a rule
+         * alone should not spend it. That argument holds for the spots worth
+         * arguing about; it does not hold for a bagful, where waiting for a
+         * person is the only thing standing between a funded spot and a cleaned
+         * one. The ceiling is what keeps "without being asked" bounded.
+         */
+        auto?: {
+            upToBand: "bagful" | "boot" | "trailer";
+            dailyCapBase: number;
+        };
+    };
+    witnesses: {
+        requiredFromBand: "truck";
+    };
+    /** Sealed, so a farmed spot cannot count the days to its look-back. */
+    lookBack: {
+        daysMin: number;
+        daysMax: number;
+    };
+    /**
+     * Addresses barred from funding-linked payouts.
+     *
+     * Whoever writes the rule knows it, and could map the spots it favours. The
+     * hash proves the rule predates the pins; it cannot prove the rule-writer's
+     * own pins were innocent. This can, and it belongs inside the sealed bytes
+     * so nobody can add themselves afterwards.
+     */
+    excluded: string[];
+}
+/**
+ * The exact bytes that get hashed.
+ *
+ * Keys sorted at every depth, no incidental whitespace: two rules that say the
+ * same thing must hash the same however the JSON was typed, or the reveal
+ * fails on a formatting difference and the commitment looks broken when it is
+ * only untidy.
+ */
+export declare function canonicalBytes(rule: CampaignRule | PoolRule): Uint8Array;
+/** The commitment itself: sha256 of the canonical bytes, hex. */
+export declare const ruleHash: (rule: CampaignRule | PoolRule) => string;
+/** What the commitment transaction's memo carries, so anyone can find it. */
+export declare const ruleMemo: (rule: CampaignRule | PoolRule) => string;
+export declare function readRule(doc: unknown): CampaignRule | null;
+/**
+ * The pool rule — a campaign that prices nothing.
+ *
+ * **Why this replaces the funding rule above.** A v1 rule decides what a
+ * spot is worth: bands, targets, a sponsor's match, a clock for posting
+ * short. Every one of those numbers is a guess about a place the rule's
+ * author has never stood in — a truckload is not the same money in Lagos
+ * and in Zurich, and a threshold that fills in an hour in one city never
+ * fills in the other. A v2 rule stops guessing. Every approved mess is an
+ * ask at once, its pool starts empty, and whoever cleans it is paid what
+ * people put in. The only numbers left are bounds, and they are here.
+ *
+ * Both shapes are read from the same commit-and-reveal ceremony; `v` tells
+ * them apart, and `readRule` and `readPoolRule` each refuse the other's.
+ */
+export interface PoolTerms {
+    /**
+     * The most a checker may ever pay from one pool, base units.
+     *
+     * A pool ask names its payout at approval rather than at posting, so the
+     * poster's only bound is this one — set into the checker's authorization
+     * in the transaction that opens the ask, which is the last moment the
+     * poster holds the authority to set it. Generous on purpose: it is a
+     * bound against a bug or a compromised checker, not a price.
+     */
+    ceilingBase: number;
+    /**
+     * The first band that is a site rather than a one-person job.
+     *
+     * A bagful is one person with a bin bag; a car boot upward is more than
+     * anybody clears alone, and its ask takes patches from many people.
+     */
+    bigFrom: "boot" | "trailer" | "truck";
+    /**
+     * How many patch claims a site's ask holds — one number per band.
+     *
+     * This was a single figure for every site from a car boot upward, and 50
+     * was the guess. A quota is not just a crew size: every slot escrows one
+     * checker's leg at posting, so fifty of them parked five PAY before
+     * anybody had cleared anything — which is why the campaign's first truck
+     * got no ask at all — and `poolAvailable` reserves a leg for every
+     * *undecided* slot, so the same fifty made a backed site read as an empty
+     * pot. A car boot is not a truck, and neither is a landfill.
+     *
+     * Every band from `bigFrom` upward needs an entry, at least 2 (a site that
+     * holds one patch is not a site). The pass raises a live ask's quota when
+     * it fills, so this is where a site *starts*, not its ceiling.
+     */
+    siteQuota: Record<string, number>;
+    /**
+     * How many more tries a one-person cleanup gets after a rejection.
+     *
+     * A one-person ask starts with one slot, and the chain keeps a slot that
+     * a REJECTED claim used — only INVALIDATED frees one. So a single bad
+     * after photograph, or a test, used to close the spot to everybody,
+     * including the person who had actually cleaned it (43925, 43914, 43926
+     * on testnet, 17–18 Sep 2026). The pass now grows such an ask by one slot
+     * for each distinct address that was rejected on it, up to this many
+     * extra slots, each escrowing one more checker's leg from the campaign.
+     *
+     * Optional, and two when absent: a rule published before this existed
+     * keeps working, and two retries is the difference between a forgiving
+     * campaign and one that pays for a determined stranger's tenth attempt.
+     */
+    retries?: number;
+    /**
+     * The most one pot may hold from cards, base units, per band.
+     *
+     * Not a fundraising target — a **fraud ceiling**. A pot that anyone can
+     * pay into from a share link with no account is a place to park a stolen
+     * card's money, and a very large one is a reason to fake a cleanup. The
+     * cap scales with the band because a truck honestly needs more than a
+     * car boot: at ten patches, six hundred is sixty a patch, and three
+     * hundred on a trailer is fifty.
+     *
+     * Every band needs a number, `bagful` upward, because every band can be
+     * backed. It bounds **card** money only: sponsor and wallet money comes
+     * through an account we know and cannot be charged back, so it is not
+     * what this is defending against.
+     */
+    capBase: Record<string, number>;
+    /**
+     * How long a site's held patches wait for somebody to show the whole area
+     * clear before they are paid anyway.
+     *
+     * Without it a site where nobody ever files the wide shot holds its
+     * cleaners' money forever, and the people who did the work are punished
+     * for the one who did not come back.
+     */
+    fallbackDays: number;
+    /**
+     * Where a pool goes when its pin ends without a cleanup, and where the
+     * part of it nobody can be paid back always goes.
+     *
+     * This used to be the whole answer, and the comment here said refunds were
+     * a promise we could not keep. Half of that is still true: an anonymous
+     * card backing has no address to return money to, so that part always
+     * comes here. What changed is that a backing can *name an account* — a
+     * sponsor funding a pool from their own balance, or a person who backed by
+     * card while signed in — and with `refund` on, what those accounts put in
+     * goes back to them in PAY, capped at what they contributed. Everything
+     * the memos cannot name — the anonymous card money, and anything that
+     * reached the pool by some other route — is the reserve's.
+     */
+    reserve: string;
+    /** What a newly approved pin is seeded with from the reserve. 0 = off. */
+    seedBase: number;
+    /**
+     * How long a cleanup ask stands, in days — the campaign's one clock.
+     *
+     * There are no renewals. A chain ask cannot be extended, and the round
+     * that renewed by posting a twin and carrying the pot across found what
+     * that costs: escrow for every twin, money scattered across old accounts,
+     * a ledger of turns, and a mess nobody would ever clear holding a
+     * sponsor's money for years. So an ask runs its days and then lapses:
+     * nobody can file against it any more, whatever was filed still gets
+     * judged, and once everything filed is decided the pool goes back — to
+     * the accounts that funded it, the rest to the reserve.
+     *
+     * A mess that is still there after its ask lapsed is mapped again, which
+     * costs a photograph and is worth exactly that: proof it is still there,
+     * instead of a robot reposting an ask for a corner the council cleared a
+     * month ago.
+     */
+    askDays: number;
+    /**
+     * The lengths a finder may choose from, when they choose at all.
+     *
+     * Most never see the question; the default is `askDays`. But somebody
+     * standing in front of a mess sometimes knows the crew is coming Saturday
+     * or that nothing will happen before spring, and this is the set the
+     * campaign lets them say so from. It has to contain `askDays`, so the
+     * default is always a choice the campaign itself endorses.
+     */
+    askDaysChoices: number[];
+    /**
+     * Whether the returnable part of a lapsed pool goes back to the accounts
+     * that funded it, rather than all of it to the reserve.
+     *
+     * A campaign that would rather keep every pool sets this false and the
+     * behaviour is exactly what it was before this existed.
+     */
+    refund: boolean;
+}
+export interface PoolRule {
+    v: 2;
+    campaign: string;
+    /** Kept from v1: the day mapping would close, for a campaign that has one. */
+    mappingCloses: string;
+    /** A pool rule is public by construction — there is nothing to aim at. */
+    open?: boolean;
+    pool: PoolTerms;
+    finder: CampaignRule["finder"];
+    lookBack: CampaignRule["lookBack"];
+    excluded: string[];
+}
+/**
+ * Is this spot a site — too much for one person, so its ask takes patches?
+ *
+ * Read from the rule rather than a constant, because where the line falls is
+ * a campaign's judgement about its own volunteers: a school group clears a
+ * car boot between them, a lone commuter does not.
+ */
+export declare function isBig(volume: string | null | undefined, rule: Pick<PoolRule, "pool">): boolean;
+/**
+ * A pool rule, or null. Structure only, like `readRule` — but strict about
+ * the reserve, because a pool rule whose reserve is unreadable would sweep
+ * money to nowhere.
+ */
+export declare function readPoolRule(doc: unknown): PoolRule | null;
+/**
+ * How many patches this spot's ask starts with — 1 unless it is a site.
+ *
+ * Read from the rule rather than a constant, for the same reason `isBig` is:
+ * how many people a truck takes is a campaign's judgement about its own
+ * volunteers, and it is also what the campaign pre-pays in checker legs.
+ */
+export declare function siteQuotaFor(volume: string | null | undefined, rule: Pick<PoolRule, "pool">): number;
+/** How many extra slots a one-person ask may grow by after rejections — see `PoolTerms.retries`. */
+export declare const DEFAULT_RETRIES = 2;
+export declare function retriesFor(rule: Pick<PoolRule, "pool">): number;
+/**
+ * The most this spot's pot may hold from cards, base units.
+ *
+ * Unknown bands take the smallest cap in the rule rather than the largest:
+ * a pin whose band this deployment cannot read is the case where a cap
+ * matters most, and guessing generously is how a ceiling becomes a door.
+ */
+export declare function capFor(volume: string | null | undefined, rule: Pick<PoolRule, "pool">): number;
+/** Whether an address may take funding-linked money, per the sealed rule. */
+export declare const mayBePaid: (rule: CampaignRule | PoolRule, address: string) => boolean;
+//# sourceMappingURL=rule.d.ts.map

package/dist/esm/campaign/rule.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rule.d.ts","sourceRoot":"","sources":["../../../src/campaign/rule.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;;GAgBG;AAEH,MAAM,WAAW,YAAY;IAC3B,CAAC,EAAE,CAAC,CAAC;IACL,QAAQ,EAAE,MAAM,CAAC;IACjB,qEAAqE;IACrE,aAAa,EAAE,MAAM,CAAC;IACtB;;;;;;;;;;;OAWG;IACH,IAAI,CAAC,EAAE,OAAO,CAAC;IACf;;;;;;;;OAQG;IACH,KAAK,CAAC,EAAE;QAAE,iBAAiB,EAAE,MAAM,CAAC;QAAC,kBAAkB,EAAE,MAAM,CAAA;KAAE,CAAC;IAClE,OAAO,EAAE;QACP,2EAA2E;QAC3E,eAAe,EAAE,wBAAwB,CAAC;QAC1C,kEAAkE;QAClE,QAAQ,EAAE,OAAO,CAAC;KACnB,CAAC;IACF,MAAM,EAAE;QACN,UAAU,EAAE,MAAM,CAAC;QACnB,SAAS,EAAE,MAAM,CAAC;QAClB,OAAO,EAAE,MAAM,CAAC;QAChB,QAAQ,EAAE,UAAU,CAAC;QACrB,EAAE,EAAE,kBAAkB,CAAC;KACxB,CAAC;IACF,KAAK,EAAE;QACL,OAAO,EAAE,MAAM,CAAC;QAChB,KAAK,EAAE,MAAM,CAAC;QACd,cAAc,EAAE,MAAM,CAAC;QACvB,uEAAuE;QACvE,SAAS,EAAE,MAAM,CAAC;QAClB,QAAQ,EAAE,MAAM,CAAC;QACjB,KAAK,EAAE,CAAC,SAAS,GAAG,OAAO,CAAC,EAAE,CAAC;QAC/B,oBAAoB,EAAE,IAAI,CAAC;QAC3B,SAAS,EAAE,IAAI,CAAC;QAChB,QAAQ,EAAE,aAAa,CAAC;QACxB;;;;;;;;;WASG;QACH,IAAI,CAAC,EAAE;YAAE,QAAQ,EAAE,QAAQ,GAAG,MAAM,GAAG,SAAS,CAAC;YAAC,YAAY,EAAE,MAAM,CAAA;SAAE,CAAC;KAC1E,CAAC;IACF,SAAS,EAAE;QAAE,gBAAgB,EAAE,OAAO,CAAA;KAAE,CAAC;IACzC,uEAAuE;IACvE,QAAQ,EAAE;QAAE,OAAO,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAA;KAAE,CAAC;IAC/C;;;;;;;OAOG;IACH,QAAQ,EAAE,MAAM,EAAE,CAAC;CACpB;AAED;;;;;;;GAOG;AACH,wBAAgB,cAAc,CAAC,IAAI,EAAE,YAAY,GAAG,QAAQ,GAAG,UAAU,CAaxE;AAED,iEAAiE;AACjE,eAAO,MAAM,QAAQ,GAAI,MAAM,YAAY,GAAG,QAAQ,KAAG,MAAyE,CAAC;AAEnI,6EAA6E;AAC7E,eAAO,MAAM,QAAQ,GAAI,MAAM,YAAY,GAAG,QAAQ,KAAG,MAAmD,CAAC;AAoB7G,wBAAgB,QAAQ,CAAC,GAAG,EAAE,OAAO,GAAG,YAAY,GAAG,IAAI,CAkB1D;AAED;;;;;;;;;;;;;;GAcG;AACH,MAAM,WAAW,SAAS;IACxB;;;;;;;;OAQG;IACH,WAAW,EAAE,MAAM,CAAC;IACpB;;;;;OAKG;IACH,OAAO,EAAE,MAAM,GAAG,SAAS,GAAG,OAAO,CAAC;IACtC;;;;;;;;;;;;;;OAcG;IACH,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAClC;;;;;;;;;;;;;;OAcG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB;;;;;;;;;;;;;;OAcG;IACH,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAChC;;;;;;;OAOG;IACH,YAAY,EAAE,MAAM,CAAC;IACrB;;;;;;;;;;;;;OAaG;IACH,OAAO,EAAE,MAAM,CAAC;IAChB,0EAA0E;IAC1E,QAAQ,EAAE,MAAM,CAAC;IACjB;;;;;;;;;;;;;;;;OAgBG;IACH,OAAO,EAAE,MAAM,CAAC;IAChB;;;;;;;;OAQG;IACH,cAAc,EAAE,MAAM,EAAE,CAAC;IACzB;;;;;;OAMG;IACH,MAAM,EAAE,OAAO,CAAC;CACjB;AAED,MAAM,WAAW,QAAQ;IACvB,CAAC,EAAE,CAAC,CAAC;IACL,QAAQ,EAAE,MAAM,CAAC;IACjB,8EAA8E;IAC9E,aAAa,EAAE,MAAM,CAAC;IACtB,0EAA0E;IAC1E,IAAI,CAAC,EAAE,OAAO,CAAC;IACf,IAAI,EAAE,SAAS,CAAC;IAChB,MAAM,EAAE,YAAY,CAAC,QAAQ,CAAC,CAAC;IAC/B,QAAQ,EAAE,YAAY,CAAC,UAAU,CAAC,CAAC;IACnC,QAAQ,EAAE,MAAM,EAAE,CAAC;CACpB;AAKD;;;;;;GAMG;AACH,wBAAgB,KAAK,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC,GAAG,OAAO,CAI9F;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,GAAG,EAAE,OAAO,GAAG,QAAQ,GAAG,IAAI,CA8C1D;AAED;;;;;;GAMG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC,GAAG,MAAM,CAGpG;AAED,oGAAoG;AACpG,eAAO,MAAM,eAAe,IAAI,CAAC;AAEjC,wBAAgB,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC,GAAG,MAAM,CAG/D;AAED;;;;;;GAMG;AACH,wBAAgB,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC,GAAG,MAAM,CAI9F;AAED,6EAA6E;AAC7E,eAAO,MAAM,SAAS,GAAI,MAAM,YAAY,GAAG,QAAQ,EAAE,SAAS,MAAM,KAAG,OAA2C,CAAC"}

package/dist/esm/campaign/rule.js

@@ -0,0 +1,197 @@
+import { createHash } from "node:crypto";
+/**
+ * The exact bytes that get hashed.
+ *
+ * Keys sorted at every depth, no incidental whitespace: two rules that say the
+ * same thing must hash the same however the JSON was typed, or the reveal
+ * fails on a formatting difference and the commitment looks broken when it is
+ * only untidy.
+ */
+export function canonicalBytes(rule) {
+    const sorted = (value) => {
+        if (Array.isArray(value))
+            return value.map(sorted);
+        if (value && typeof value === "object") {
+            return Object.fromEntries(Object.keys(value)
+                .sort()
+                .map((key) => [key, sorted(value[key])]));
+        }
+        return value;
+    };
+    return new TextEncoder().encode(JSON.stringify(sorted(rule)));
+}
+/** The commitment itself: sha256 of the canonical bytes, hex. */
+export const ruleHash = (rule) => createHash("sha256").update(canonicalBytes(rule)).digest("hex");
+/** What the commitment transaction's memo carries, so anyone can find it. */
+export const ruleMemo = (rule) => `${rule.campaign}-rule:${ruleHash(rule)}`;
+/**
+ * Is this rule usable? Structure only — the numbers are the campaign's
+ * business, but a rule that cannot be read is a commitment to nothing.
+ */
+const finite = (value) => typeof value === "number" && Number.isFinite(value);
+const nonNegative = (value) => finite(value) && value >= 0;
+const fraction = (value) => finite(value) && value >= 0 && value <= 1;
+const dated = (value) => typeof value === "string" && !Number.isNaN(Date.parse(value));
+/*
+ * Every field the funding pass dereferences is checked here, because the
+ * pass does not: `fundable` reads `funding.downBand`, `witnesses.requiredFromBand`
+ * and `clock`; the pass reads `match.bands`, `match.deadline` and `match.auto`;
+ * `matchFor` prices from `ratio`, `perSpotCapBase` and `threshold`. A rule
+ * that read as usable with any of those missing did not fail at reveal — it
+ * threw inside the first tick, on every tick, and nothing funded until
+ * somebody read the worker's log.
+ */
+export function readRule(doc) {
+    const rule = doc;
+    if (!rule || typeof rule !== "object" || rule.v !== 1)
+        return null;
+    if (typeof rule.campaign !== "string" || !rule.campaign)
+        return null;
+    if (!dated(rule.mappingCloses))
+        return null;
+    if (rule.open !== undefined && typeof rule.open !== "boolean")
+        return null;
+    if (rule.clock !== undefined && (!rule.clock || !nonNegative(rule.clock.downBandAfterDays) || !fraction(rule.clock.downBandAtFraction)))
+        return null;
+    if (!rule.funding || rule.funding.bandTargetsFrom !== "assessment-at-approval" || typeof rule.funding.downBand !== "boolean")
+        return null;
+    if (!rule.finder || !finite(rule.finder.cutPercent) || !nonNegative(rule.finder.floorBase) || !nonNegative(rule.finder.capBase))
+        return null;
+    const match = rule.match;
+    if (!match || typeof match.sponsor !== "string")
+        return null;
+    if (!nonNegative(match.ratio) || !nonNegative(match.perSpotCapBase) || !fraction(match.threshold) || !dated(match.deadline))
+        return null;
+    if (!Array.isArray(match.bands) || !match.bands.every((band) => band === "trailer" || band === "truck"))
+        return null;
+    if (match.auto !== undefined && (!match.auto || !["bagful", "boot", "trailer"].includes(match.auto.upToBand) || !nonNegative(match.auto.dailyCapBase)))
+        return null;
+    if (!rule.witnesses || rule.witnesses.requiredFromBand !== "truck")
+        return null;
+    if (!Array.isArray(rule.excluded) || !rule.excluded.every((one) => typeof one === "string"))
+        return null;
+    if (!rule.lookBack || !nonNegative(rule.lookBack.daysMin) || !(rule.lookBack.daysMax >= rule.lookBack.daysMin))
+        return null;
+    return rule;
+}
+/** The bands, largest last — the order `isBig` reads. */
+const BAND_ORDER = ["bagful", "boot", "trailer", "truck", "bigger"];
+/**
+ * Is this spot a site — too much for one person, so its ask takes patches?
+ *
+ * Read from the rule rather than a constant, because where the line falls is
+ * a campaign's judgement about its own volunteers: a school group clears a
+ * car boot between them, a lone commuter does not.
+ */
+export function isBig(volume, rule) {
+    const at = BAND_ORDER.indexOf((volume ?? ""));
+    const from = BAND_ORDER.indexOf(rule.pool.bigFrom);
+    return at >= 0 && from >= 0 && at >= from;
+}
+/**
+ * A pool rule, or null. Structure only, like `readRule` — but strict about
+ * the reserve, because a pool rule whose reserve is unreadable would sweep
+ * money to nowhere.
+ */
+export function readPoolRule(doc) {
+    const rule = doc;
+    if (!rule || rule.v !== 2)
+        return null;
+    if (typeof rule.campaign !== "string" || !rule.campaign)
+        return null;
+    if (typeof rule.mappingCloses !== "string" || Number.isNaN(Date.parse(rule.mappingCloses)))
+        return null;
+    const pool = rule.pool;
+    if (!pool || typeof pool !== "object")
+        return null;
+    if (!(typeof pool.ceilingBase === "number" && pool.ceilingBase > 0))
+        return null;
+    /* A site line at "bagful" would make every pin a site; at "bigger" it would
+       make none, since "bigger than a truck" goes to professionals either way. */
+    if (!["boot", "trailer", "truck"].includes(pool.bigFrom))
+        return null;
+    /* A number for every band that is a site, and none of them one: a site
+       that holds a single patch is a one-person cleanup wearing a site's
+       terms. Bands below `bigFrom` may be named or not; they are never read. */
+    const quotas = pool.siteQuota;
+    if (!quotas || typeof quotas !== "object")
+        return null;
+    const siteBands = BAND_ORDER.slice(BAND_ORDER.indexOf(pool.bigFrom));
+    if (!siteBands.every((band) => Number.isInteger(quotas[band]) && quotas[band] >= 2))
+        return null;
+    /* Optional; when it is there it is a whole number of extra slots. Zero is
+       a real answer — "one try and that is that" — and a campaign may say it. */
+    if (pool.retries !== undefined && !(Number.isInteger(pool.retries) && pool.retries >= 0))
+        return null;
+    /* A cap for every band, including the ones that are not sites: a bagful
+       can be backed too, and a band with no cap would be the one a ring
+       used. Zero is not "no cap" — it is a pot nobody may pay into, which a
+       campaign should have to say deliberately rather than by omission. */
+    const caps = pool.capBase;
+    if (!caps || typeof caps !== "object")
+        return null;
+    if (!BAND_ORDER.every((band) => typeof caps[band] === "number" && caps[band] > 0))
+        return null;
+    if (!(typeof pool.fallbackDays === "number" && pool.fallbackDays > 0))
+        return null;
+    if (typeof pool.reserve !== "string" || !/^ixo1[0-9a-z]{38}$/.test(pool.reserve))
+        return null;
+    if (typeof pool.seedBase !== "number" || pool.seedBase < 0)
+        return null;
+    /* Both are required rather than defaulted. A rule is a public commitment
+       about somebody else's money, and "how long before you give it back" is
+       exactly the kind of term a default would quietly answer for a campaign
+       that never thought about it. */
+    /* Whole days, at least one, and the default among the choices: a
+       campaign that endorses a set of lengths must endorse its own default. */
+    const wholeDays = (value) => typeof value === "number" && Number.isInteger(value) && value >= 1;
+    if (!wholeDays(pool.askDays))
+        return null;
+    if (!Array.isArray(pool.askDaysChoices) || pool.askDaysChoices.length === 0 || !pool.askDaysChoices.every(wholeDays))
+        return null;
+    if (!pool.askDaysChoices.includes(pool.askDays))
+        return null;
+    if (typeof pool.refund !== "boolean")
+        return null;
+    if (!rule.finder || typeof rule.finder.cutPercent !== "number")
+        return null;
+    if (!Array.isArray(rule.excluded))
+        return null;
+    if (!rule.lookBack || !(rule.lookBack.daysMax >= rule.lookBack.daysMin))
+        return null;
+    return rule;
+}
+/**
+ * How many patches this spot's ask starts with — 1 unless it is a site.
+ *
+ * Read from the rule rather than a constant, for the same reason `isBig` is:
+ * how many people a truck takes is a campaign's judgement about its own
+ * volunteers, and it is also what the campaign pre-pays in checker legs.
+ */
+export function siteQuotaFor(volume, rule) {
+    if (!isBig(volume, rule))
+        return 1;
+    return rule.pool.siteQuota[(volume ?? "")] ?? 2;
+}
+/** How many extra slots a one-person ask may grow by after rejections — see `PoolTerms.retries`. */
+export const DEFAULT_RETRIES = 2;
+export function retriesFor(rule) {
+    const said = rule.pool.retries;
+    return typeof said === "number" && Number.isInteger(said) && said >= 0 ? said : DEFAULT_RETRIES;
+}
+/**
+ * The most this spot's pot may hold from cards, base units.
+ *
+ * Unknown bands take the smallest cap in the rule rather than the largest:
+ * a pin whose band this deployment cannot read is the case where a cap
+ * matters most, and guessing generously is how a ceiling becomes a door.
+ */
+export function capFor(volume, rule) {
+    const named = rule.pool.capBase[(volume ?? "")];
+    if (typeof named === "number" && named > 0)
+        return named;
+    return Math.min(...BAND_ORDER.map((band) => rule.pool.capBase[band]).filter((one) => typeof one === "number" && one > 0));
+}
+/** Whether an address may take funding-linked money, per the sealed rule. */
+export const mayBePaid = (rule, address) => !rule.excluded.includes(address);
+//# sourceMappingURL=rule.js.map

package/dist/esm/campaign/rule.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rule.js","sourceRoot":"","sources":["../../../src/campaign/rule.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAkGzC;;;;;;;GAOG;AACH,MAAM,UAAU,cAAc,CAAC,IAA6B;IAC1D,MAAM,MAAM,GAAG,CAAC,KAAc,EAAW,EAAE;QACzC,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACnD,IAAI,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;YACvC,OAAO,MAAM,CAAC,WAAW,CACvB,MAAM,CAAC,IAAI,CAAC,KAAgC,CAAC;iBAC1C,IAAI,EAAE;iBACN,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,MAAM,CAAE,KAAiC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CACxE,CAAC;QACJ,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC,CAAC;IACF,OAAO,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AAChE,CAAC;AAED,iEAAiE;AACjE,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,IAA6B,EAAU,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AAEnI,6EAA6E;AAC7E,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,IAA6B,EAAU,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,SAAS,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;AAE7G;;;GAGG;AACH,MAAM,MAAM,GAAG,CAAC,KAAc,EAAmB,EAAE,CAAC,OAAO,KAAK,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;AACxG,MAAM,WAAW,GAAG,CAAC,KAAc,EAAmB,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;AACrF,MAAM,QAAQ,GAAG,CAAC,KAAc,EAAmB,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;AAChG,MAAM,KAAK,GAAG,CAAC,KAAc,EAAmB,EAAE,CAAC,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;AAEjH;;;;;;;;GAQG;AACH,MAAM,UAAU,QAAQ,CAAC,GAAY;IACnC,MAAM,IAAI,GAAG,GAAmC,CAAC;IACjD,IAAI,CAAC,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACnE,IAAI,OAAO,IAAI,CAAC,QAAQ,KAAK,QAAQ,IAAI,CAAC,IAAI,CAAC,QAAQ;QAAE,OAAO,IAAI,CAAC;IACrE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC;QAAE,OAAO,IAAI,CAAC;IAC5C,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,OAAO,IAAI,CAAC,IAAI,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC;IAC3E,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IACrJ,IAAI,CAAC,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,OAAO,CAAC,eAAe,KAAK,wBAAwB,IAAI,OAAO,IAAI,CAAC,OAAO,CAAC,QAAQ,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC;IAC1I,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC;QAAE,OAAO,IAAI,CAAC;IAC7I,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;IACzB,IAAI,CAAC,KAAK,IAAI,OAAO,KAAK,CAAC,OAAO,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC;IAC7D,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,cAAc,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC;QAAE,OAAO,IAAI,CAAC;IACzI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,OAAO,CAAC;QAAE,OAAO,IAAI,CAAC;IACrH,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC,QAAQ,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IACpK,IAAI,CAAC,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC,gBAAgB,KAAK,OAAO;QAAE,OAAO,IAAI,CAAC;IAChF,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,OAAO,GAAG,KAAK,QAAQ,CAAC;QAAE,OAAO,IAAI,CAAC;IACzG,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,IAAI,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC;QAAE,OAAO,IAAI,CAAC;IAC5H,OAAO,IAAoB,CAAC;AAC9B,CAAC;AAgKD,yDAAyD;AACzD,MAAM,UAAU,GAAG,CAAC,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,QAAQ,CAAU,CAAC;AAE7E;;;;;;GAMG;AACH,MAAM,UAAU,KAAK,CAAC,MAAiC,EAAE,IAA4B;IACnF,MAAM,EAAE,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC,MAAM,IAAI,EAAE,CAAgC,CAAC,CAAC;IAC7E,MAAM,IAAI,GAAG,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACnD,OAAO,EAAE,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,EAAE,IAAI,IAAI,CAAC;AAC5C,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAAC,GAAY;IACvC,MAAM,IAAI,GAAG,GAA+B,CAAC;IAC7C,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACvC,IAAI,OAAO,IAAI,CAAC,QAAQ,KAAK,QAAQ,IAAI,CAAC,IAAI,CAAC,QAAQ;QAAE,OAAO,IAAI,CAAC;IACrE,IAAI,OAAO,IAAI,CAAC,aAAa,KAAK,QAAQ,IAAI,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IACxG,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;IACvB,IAAI,CAAC,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC;IACnD,IAAI,CAAC,CAAC,OAAO,IAAI,CAAC,WAAW,KAAK,QAAQ,IAAI,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IACjF;kFAC8E;IAC9E,IAAI,CAAE,CAAC,MAAM,EAAE,SAAS,EAAE,OAAO,CAAc,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAiB,CAAC;QAAE,OAAO,IAAI,CAAC;IAC9F;;gFAE4E;IAC5E,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC;IAC9B,IAAI,CAAC,MAAM,IAAI,OAAO,MAAM,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC;IACvD,MAAM,SAAS,GAAG,UAAU,CAAC,KAAK,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,OAAsC,CAAC,CAAC,CAAC;IACpG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAK,MAAM,CAAC,IAAI,CAAY,IAAI,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IAC7G;iFAC6E;IAC7E,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,IAAK,IAAI,CAAC,OAAkB,IAAI,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IAClH;;;2EAGuE;IACvE,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC;IAC1B,IAAI,CAAC,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC;IACnD,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,QAAQ,IAAK,IAAI,CAAC,IAAI,CAAY,GAAG,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IAC3G,IAAI,CAAC,CAAC,OAAO,IAAI,CAAC,YAAY,KAAK,QAAQ,IAAI,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IACnF,IAAI,OAAO,IAAI,CAAC,OAAO,KAAK,QAAQ,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC;QAAE,OAAO,IAAI,CAAC;IAC9F,IAAI,OAAO,IAAI,CAAC,QAAQ,KAAK,QAAQ,IAAI,IAAI,CAAC,QAAQ,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IACxE;;;sCAGkC;IAClC;+EAC2E;IAC3E,MAAM,SAAS,GAAG,CAAC,KAAc,EAAmB,EAAE,CAAC,OAAO,KAAK,KAAK,QAAQ,IAAI,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;IAC1H,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC;QAAE,OAAO,IAAI,CAAC;IAC1C,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,IAAI,CAAC,cAAc,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,SAAS,CAAC;QAAE,OAAO,IAAI,CAAC;IAClI,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC;QAAE,OAAO,IAAI,CAAC;IAC7D,IAAI,OAAO,IAAI,CAAC,MAAM,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC;IAClD,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,OAAO,IAAI,CAAC,MAAM,CAAC,UAAU,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC;IAC5E,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC;QAAE,OAAO,IAAI,CAAC;IAC/C,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,IAAI,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC;QAAE,OAAO,IAAI,CAAC;IACrF,OAAO,IAAgB,CAAC;AAC1B,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,YAAY,CAAC,MAAiC,EAAE,IAA4B;IAC1F,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC;QAAE,OAAO,CAAC,CAAC;IACnC,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,MAAM,IAAI,EAAE,CAAW,CAAC,IAAI,CAAC,CAAC;AAC5D,CAAC;AAED,oGAAoG;AACpG,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,CAAC;AAEjC,MAAM,UAAU,UAAU,CAAC,IAA4B;IACrD,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC;IAC/B,OAAO,OAAO,IAAI,KAAK,QAAQ,IAAI,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,eAAe,CAAC;AAClG,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,MAAM,CAAC,MAAiC,EAAE,IAA4B;IACpF,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,MAAM,IAAI,EAAE,CAAW,CAAC,CAAC;IAC1D,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,GAAG,CAAC;QAAE,OAAO,KAAK,CAAC;IACzD,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAiB,EAAE,CAAC,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;AAC3I,CAAC;AAED,6EAA6E;AAC7E,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,IAA6B,EAAE,OAAe,EAAW,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC"}

package/dist/esm/campaign/spot.d.ts

@@ -0,0 +1,37 @@
+import type { AskTerms } from "../rubric/terms.ts";
+import { ACCESS, VOLUME, WASTE, dominantWaste, isAssessment, needsProfessionals, spotPhrase, spotSays, spotTarget, wastesOf, type Access, type Assessment, type Volume, type Waste } from "./bands.ts";
+/**
+ * The standing ask the map is made of — and, by re-export, the bands it is
+ * priced with.
+ *
+ * The tables moved to `bands.ts` when the map route ran out of bytes: a
+ * client that shows a price was carrying this file's criterion prose with
+ * it. Everything is re-exported here, so every existing import keeps
+ * working and only the client surfaces were changed to ask for the
+ * smaller half.
+ */
+export { ACCESS, VOLUME, WASTE, dominantWaste, isAssessment, needsProfessionals, spotPhrase, spotSays, spotTarget, wastesOf };
+export type { Access, Assessment, Volume, Waste };
+/**
+ * The standing ask that the map is made of.
+ *
+ * **One ask, not one per pin** — a pin cannot have its own ask before anybody
+ * knows the mess is there. So this is a single collection with a large quota
+ * that stays open for the campaign, and every approved claim on it is a pin.
+ *
+ * Which is exactly why it declares `publish: "on-approval"`. A claim body is
+ * withheld while its ask is still taking answers, so that answers cannot be
+ * copied — right for a question with one answer, and fatal here, where the
+ * whole output is meant to be looked at. An approved mess report cannot
+ * usefully be copied anyway: `not-already-mapped` refuses the duplicate.
+ */
+export declare function messTerms(args: {
+    campaign?: string;
+    /** How close two pins may be before the second is a duplicate. */
+    metres?: number;
+    judge: {
+        address: string;
+        rewardUixo: number;
+    };
+}): AskTerms;
+//# sourceMappingURL=spot.d.ts.map

package/dist/esm/campaign/spot.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"spot.d.ts","sourceRoot":"","sources":["../../../src/campaign/spot.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AACnD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,aAAa,EAAE,YAAY,EAAE,kBAAkB,EAAE,UAAU,EAAE,QAAQ,EAAE,UAAU,EAAE,QAAQ,EAAE,KAAK,MAAM,EAAE,KAAK,UAAU,EAAE,KAAK,MAAM,EAAE,KAAK,KAAK,EAAE,MAAM,YAAY,CAAC;AAEvM;;;;;;;;;GASG;AACH,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,aAAa,EAAE,YAAY,EAAE,kBAAkB,EAAE,UAAU,EAAE,QAAQ,EAAE,UAAU,EAAE,QAAQ,EAAE,CAAC;AAC9H,YAAY,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;AAElD;;;;;;;;;;;;GAYG;AACH,wBAAgB,SAAS,CAAC,IAAI,EAAE;IAC9B,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,kEAAkE;IAClE,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE;QAAE,OAAO,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAA;KAAE,CAAC;CAChD,GAAG,QAAQ,CA6IX"}