@mark1russell7/service 0.5.13 → 0.5.15

package/README.md

@@ -10,13 +10,18 @@ This release has the declaration, its export, the law, the health runtime, the l
 - **No defaults.** The runtime has no defaults of its own. Thus `describe()` refuses a service that does not declare its readiness, its liveness, its startup budget, its shutdown phases or its cooperative window. It also refuses a service that does not declare what a repeat signal does. The error tells which. `start()` also refuses a check without its function.
 - **One timing shape.** Each policy has a `Timing`: a debounce of polls, or a window of time. Each converts to the other (`asWindow`, `asDebounce`). `failSpan` and `recoverSpan` give the earliest and the latest time to detect a change. At 3 polls of 5 s ± 20 %, a latch fails in 8–18 s on an error, and in 12–22 s on a 4 s timeout.
 - **Checks.** A check names the step of the connection that it examines (`dial`, `round-trip`, `checkout` and others). It also tells if it uses the connection of the application, and which policy it controls. The policy has no default.
+- **The catalog of a client.** The checks of each client name the steps that they gate: `steps: { "round-trip": "readiness" }`. With `catalog: true`, the client also gives a check for each other step that it has. These checks gate nothing and poll each 30 s. A nominated step that the client does not have then fails the attach. The name of each check is the pair of the component and the step (`db.round-trip`).
 - **Idempotency for each operation.** One dependency has the two kinds of operation. A Redis GET is safe to send again. An INCR that goes again after a timeout counts two times. Thus each operation of a dependency, and each route of a controller, declares if it can go again: `true`, `false`, or keyed.
 - **Keyed operations.** A keyed operation has the window that the server keeps its key for. `mayReissue` answers from the declaration of an operation. An operation without a declaration does not go again.
 - **The law.** `evaluate` and `verdictOf` decide one rule of the timer-ordering law on one binding. A rule is data: linear inequalities over `symbol@hop`, with a margin. A verdict is `holds`, `violated`, `unbounded` (it holds only because a timer is absent) or `depends` (nothing is bound).
 - **The linter.** `lint(description, scenario, rules)` applies the service rules (`SERVICE_RULES`) to a declaration. The declaration binds the symbols of the service: the polls of its checks, the windows of its policies, its drain. The scenario binds the symbols of the platform and of each dependency. A `depends` finding names the symbols that have no bound.
+- **The claims of a scenario.** A default is true only for a version: the keep-alive of Node is 5 s, but 65 s on main. Thus a value of the scenario can be a claim that names its epoch: `{ epoch: "node@22", value }`. Each finding then gives the epoch of each value that its rule reads (`epochs`).
+- **A measured value.** A claim can give a distribution by its statistics: `{ epoch, distribution: { p50, p99 } }`. The law binds the p99. A distribution without a p99 binds nothing, thus each rule that reads it depends.
 - **The scopes of a rule.** A rule about a client applies one time for each dependency. A rule about a consumer, for example O20, applies one time for each consumer and each worker.
 - **The loops of a progress check.** A check of the step `progress` can name the loops that mark it, with its stall time: `marks: { loops, stall }`. Each loop is a check or a worker of the service.
 - **The stall time.** `lint()` compares the stall time with the longest gap between two marks of the slowest loop (`PROGRESS_RULE`). A loop marks at the end of each turn, also a turn that fails. The gap of a check is `interval × (1 + jitter) + timeout`. The gap of a worker is its sleep or its longest backoff, the longer one, plus `unit_processing_time`. At 300 s ± 20 % and a timeout of 10 s, a poll gives 370 s.
+- **The marks of the timers.** A harness that runs a service k times faster scales its timers. Each timer has a mark: `scalable`, `fixed`, `stepped` (only multiples of a step) or `floored` (a peer sets a floor).
+- **The compression of a service.** `compressionOf(description, scenario, rules, k, marks)` gives each rule and scope whose verdict the compression changes. It also names the symbols that have no mark. `PLATFORM_MARKS` marks the timers of Kubernetes. For example, the propagation of the endpoints is `fixed`, thus a compression of the hold of O04 can break O04.
 - **A name that is not a loop.** A name that is not a check or a worker gets a `depends` finding. Without `marks`, a check gets no finding of this rule.
 - **Keyed limiters.** `svc.limiter(name, spec)` declares a rate limit for each key, as data. `keyedLimiter` makes its runtime on a store ([The keyed limiter](#the-keyed-limiter)).
 - **The hold.** The cap of the `fail readiness` phase binds `readiness_hold@process`, and a service without that phase holds for zero. The hold keeps the listener open after the signal, as a preStop sleep does. Thus O04 can compare the sum of the two with the propagation of the endpoints.
@@ -29,6 +34,7 @@ The format of a description is `mark1russell7.service/1`.
 
 - **Checks on their own loops.** Each check polls on a fixed delay from the start of each poll, with its jitter. Each poll has a timeout, and the runtime aborts the signal of the check at that timeout. An answer is `"ok"`, `"error"` or `"indeterminate"`. A throw is an error with a flag. An indeterminate poll measured nothing, thus it moves no streak.
 - **A pending use is not started again.** While a use of a check is pending, each later poll fails at once with the same cause. Thus a check that hangs fails a debounce of two polls or more as fast as an error does (`failSpan(timing, poll, "hang")`).
+- **The metrics.** `health.metrics()` gives the counts of the runtime, and starts no check. For each check, it counts each outcome, each throw and each forced failure. Its histogram counts the durations of the polls. The bounds are fractions of the timeout of the poll, and a poll that timed out goes into `timedOut`. Its last 8 episodes of failure each go from the first error to the next pass. The cause of an episode has no user, password or token (`redact`). It also counts each transition of the machines of the runtime.
 - **A latch for each check that gates a policy.** A debounce counts polls in sequence. A window measures time on the monotonic clock from the first failure of a sequence. A readiness latch starts tripped, thus readiness is earned. A liveness latch starts released.
 - **The start.** `start()` makes one warm-up sweep of each check, bounded by each timeout, and then starts the loops. The startup probe fails until the sweep ends. `svc.health` gives the runtime from the start of `start()`, thus the probes can answer during the sweep. The verdict says when the sweep outlasts the startup budget.
 - **The verdicts.** `health.verdict()` gives started, draining, ready, alive, each controller, each dependency and each check. The service is ready when it started, it does not drain, and each readiness latch is released. A controller is ready when its own dependencies are ready. Thus a failed dependency fails only the controllers that need it.

package/build/{builder-DawJhq4p.d.ts → builder-CsSO4LzB.d.ts}

@@ -1,6 +1,6 @@
 import { n as Clock } from "./clock-mVqhXD0b.js";
 import { c as LimiterSpec } from "./policy-G4QJ1ZZq.js";
-import { B as Gate, D as Outcome, E as CheckFn, F as CooperativeFloor, G as ServiceDescription, H as Phase, I as Coupling, L as Dependency, N as Check, R as ExitCodes, T as StartOptions, V as MessageTrigger, W as RepeatSignal, Y as Poll, Z as Timing, d as TransportImpl, ht as ProcessTrigger, k as Trace, lt as ExitTrigger, n as HealthServer, o as PhaseWork, r as Lifecycle, rt as OperationOf, s as RunOptions, t as DependencyHandle, wt as Operation, x as Health } from "./lifecycle-fgYfxrHK.js";
+import { B as Check, E as CheckFn, G as ExitCodes, H as CooperativeFloor, I as Trace, J as MessageTrigger, P as Outcome, Q as ServiceDescription, St as ProcessTrigger, T as StartOptions, U as Coupling, W as Dependency, Y as Phase, Z as RepeatSignal, d as TransportImpl, gt as ExitTrigger, it as Timing, jt as Operation, n as HealthServer, nt as Poll, o as PhaseWork, q as Gate, r as Lifecycle, s as RunOptions, t as DependencyHandle, ut as OperationOf, x as Health } from "./lifecycle-CMedxaQd.js";
 import { Extent, Quantity } from "@mark1russell7/quantity";
 //#region src/profiles.d.ts
 /**
@@ -208,4 +208,4 @@ interface ServiceBuilder {
 declare const service: (name: string) => ServiceBuilder;
 //#endregion
 export { WatchdogSpec as a, Profile as c, kubernetes as d, localDev as f, Watchdog as i, daemon as l, ServiceBuilder as n, watchdog as o, service as r, PodTiming as s, ControllerBuilder as t, ephemeral as u };
-//# sourceMappingURL=builder-DawJhq4p.d.ts.map
+//# sourceMappingURL=builder-CsSO4LzB.d.ts.map

package/build/{core-BPLRDcUJ.d.ts → core-D8iXeoE4.d.ts}

@@ -1,7 +1,7 @@
 import { t as Backoff } from "./backoff-B-jGWVDm.js";
 import { n as Clock } from "./clock-mVqhXD0b.js";
-import { B as Gate, E as CheckFn, G as ServiceDescription, K as Step, L as Dependency, M as Recorder, N as Check, Y as Poll, t as DependencyHandle, wt as Operation } from "./lifecycle-fgYfxrHK.js";
-import { n as ServiceBuilder } from "./builder-DawJhq4p.js";
+import { $ as Step, B as Check, E as CheckFn, Q as ServiceDescription, W as Dependency, jt as Operation, nt as Poll, q as Gate, t as DependencyHandle, z as Recorder } from "./lifecycle-CMedxaQd.js";
+import { n as ServiceBuilder } from "./builder-CsSO4LzB.js";
 import { Extent, Quantity } from "@mark1russell7/quantity";
 //#region src/client/meets.d.ts
 /** A situation is what the connection did when the failure started: a command in flight, or idle. */
@@ -89,6 +89,13 @@ interface CheckOptions<S extends Step = ClientStep> {
   readonly poll: Poll;
   /** For each step, the policy that its check controls, or null for a check that only reports. A step that is absent has no check. */
   readonly steps: Partial<Record<S, Gate | null>>;
+  /**
+   * With a catalog, the client gives a check for each step that it has (B19). The steps of `steps` are
+   * the nominated checks. Each other step reports only, and polls at the catalog poll. `true` is a poll
+   * of 30 s with the jitter and the timeout of `poll`. A nominated step that the client has no check
+   * for then fails the attach. Without a catalog, the client gives only the steps of `steps`.
+   */
+  readonly catalog?: true | Poll | undefined;
 }
 /**
  * These are the knobs that each client has, by the names of the ordering law. Each driver adds its
@@ -223,4 +230,4 @@ declare const retryProblems: (name: string, knobs: RetryKnobs) => string[];
 declare const STARTING_POLL: Poll;
 //#endregion
 export { MANIFESTATIONS as C, firstDetector as D, Situation as E, unwatched as O, Detector as S, Meeting as T, Sent as _, ClientKnobs as a, retryProblems as b, ClientSpec as c, Factory as d, ReadyWait as f, SendOptions as g, STARTING_POLL as h, ClientJoin as i, ClientStep as l, RetrySchedule as m, CheckOptions as n, ClientOptions as o, RetryKnobs as p, Client as r, ClientSocket as s, Attempt as t, DialFn as u, readyWait as v, Manifestation as w, retrySchedule as x, retryBackoff as y };
-//# sourceMappingURL=core-BPLRDcUJ.d.ts.map
+//# sourceMappingURL=core-D8iXeoE4.d.ts.map

package/build/{dial-DA8vJfh2.d.ts → dial-DJolDmOK.d.ts}

@@ -1,4 +1,4 @@
-import "./core-BPLRDcUJ.js";
+import "./core-D8iXeoE4.js";
 //#region src/client/dial.d.ts
 /**
  * A judge reads the bytes that the server sent so far. It gives null for a good answer, an error for
@@ -13,4 +13,4 @@ type Judge = (received: Buffer) => Error | null | "more";
 declare const statusLineJudge: (accept: (status: number, line: string) => Error | null) => Judge;
 //#endregion
 export { statusLineJudge as n, Judge as t };
-//# sourceMappingURL=dial-DA8vJfh2.d.ts.map
+//# sourceMappingURL=dial-DJolDmOK.d.ts.map

package/build/grpc.d.ts

@@ -1,6 +1,6 @@
-import { Y as Poll, wt as Operation } from "./lifecycle-fgYfxrHK.js";
-import { C as MANIFESTATIONS, D as firstDetector, E as Situation, O as unwatched, S as Detector, T as Meeting, _ as Sent, a as ClientKnobs, b as retryProblems, c as ClientSpec, d as Factory, f as ReadyWait, g as SendOptions, h as STARTING_POLL, i as ClientJoin, l as ClientStep, n as CheckOptions, o as ClientOptions, p as RetryKnobs, r as Client, s as ClientSocket, t as Attempt, u as DialFn, v as readyWait, w as Manifestation } from "./core-BPLRDcUJ.js";
-import { t as Judge } from "./dial-DA8vJfh2.js";
+import { jt as Operation, nt as Poll } from "./lifecycle-CMedxaQd.js";
+import { C as MANIFESTATIONS, D as firstDetector, E as Situation, O as unwatched, S as Detector, T as Meeting, _ as Sent, a as ClientKnobs, b as retryProblems, c as ClientSpec, d as Factory, f as ReadyWait, g as SendOptions, h as STARTING_POLL, i as ClientJoin, l as ClientStep, n as CheckOptions, o as ClientOptions, p as RetryKnobs, r as Client, s as ClientSocket, t as Attempt, u as DialFn, v as readyWait, w as Manifestation } from "./core-D8iXeoE4.js";
+import { t as Judge } from "./dial-DJolDmOK.js";
 import { Extent, Quantity } from "@mark1russell7/quantity";
 import { Machine } from "@mark1russell7/algebra";
 //#region src/grpc/connection.d.ts

package/build/grpc.js

@@ -1,6 +1,6 @@
 import { realClock } from "./clock.js";
 import { i as heartbeatDetection } from "./timing-DGRi3XCI.js";
-import { B as zeroProblems, C as notSent, D as readyWait, F as timeProblems, G as immediate, H as NEVER, L as wholeProblems, M as sendWithReissue, N as socketEnds, P as stepChecks, R as withinBound, S as ms, U as WHAT, V as MANIFESTATIONS, W as firstDetector, X as unwatched, Y as kernelGiveUp, _ as inFlight, a as helloDial, b as message, c as ageProblems, d as clientProblems, f as clientRecorder, g as idleCloseProblem, h as finiteMs, i as authority, j as roundTripCheck, k as retryProblems, l as attachClient, m as dialCheck, n as closeTimer, r as transition, s as STARTING_POLL, t as clientKnob, u as clientBounds, w as operationTable, y as localStateCheck, z as wrapperTimerProblems } from "./machine-BhTRu3u9.js";
+import { B as zeroProblems, C as notSent, D as readyWait, F as timeProblems, G as immediate, H as NEVER, L as wholeProblems, M as sendWithReissue, N as socketEnds, P as stepChecks, R as withinBound, S as ms, U as WHAT, V as MANIFESTATIONS, W as firstDetector, X as unwatched, Y as kernelGiveUp, _ as inFlight, a as helloDial, b as message, c as ageProblems, d as clientProblems, f as clientRecorder, g as idleCloseProblem, h as finiteMs, i as authority, j as roundTripCheck, k as retryProblems, l as attachClient, m as dialCheck, n as closeTimer, r as transition, s as STARTING_POLL, t as clientKnob, u as clientBounds, w as operationTable, y as localStateCheck, z as wrapperTimerProblems } from "./machine-DZMb_QEU.js";
 //#region src/grpc/connection.ts
 /** These states are in the sequence of the enum of grpc-js: the index of a state is its value. */
 const GRPC_STATES = [

package/build/http-client.d.ts

@@ -1,6 +1,6 @@
-import { Y as Poll, wt as Operation } from "./lifecycle-fgYfxrHK.js";
-import { C as MANIFESTATIONS, D as firstDetector, E as Situation, O as unwatched, S as Detector, T as Meeting, _ as Sent, a as ClientKnobs, c as ClientSpec, d as Factory, g as SendOptions, h as STARTING_POLL, i as ClientJoin, l as ClientStep, n as CheckOptions, o as ClientOptions, r as Client, s as ClientSocket, t as Attempt, u as DialFn, w as Manifestation } from "./core-BPLRDcUJ.js";
-import { t as Judge } from "./dial-DA8vJfh2.js";
+import { jt as Operation, nt as Poll } from "./lifecycle-CMedxaQd.js";
+import { C as MANIFESTATIONS, D as firstDetector, E as Situation, O as unwatched, S as Detector, T as Meeting, _ as Sent, a as ClientKnobs, c as ClientSpec, d as Factory, g as SendOptions, h as STARTING_POLL, i as ClientJoin, l as ClientStep, n as CheckOptions, o as ClientOptions, r as Client, s as ClientSocket, t as Attempt, u as DialFn, w as Manifestation } from "./core-D8iXeoE4.js";
+import { t as Judge } from "./dial-DJolDmOK.js";
 import { Extent, Quantity } from "@mark1russell7/quantity";
 import { Machine } from "@mark1russell7/algebra";
 //#region src/http-client/connection.d.ts

package/build/http-client.js

@@ -1,5 +1,5 @@
 import { realClock } from "./clock.js";
-import { B as zeroProblems, C as notSent, E as poolProblems, F as timeProblems, G as immediate, I as trackWithTimer, J as keepaliveSilent, K as keepaliveAnswered, L as wholeProblems, M as sendWithReissue, N as socketEnds, P as stepChecks, R as withinBound, S as ms, U as WHAT, V as MANIFESTATIONS, W as firstDetector, X as unwatched, Y as kernelGiveUp, _ as inFlight, a as helloDial, b as message, c as ageProblems, d as clientProblems, f as clientRecorder, g as idleCloseProblem, i as authority, j as roundTripCheck, l as attachClient, m as dialCheck, n as closeTimer, o as statusLineJudge, q as keepaliveReset, r as transition, s as STARTING_POLL, t as clientKnob, u as clientBounds, v as keepaliveOnProblems, w as operationTable, y as localStateCheck, z as wrapperTimerProblems } from "./machine-BhTRu3u9.js";
+import { B as zeroProblems, C as notSent, E as poolProblems, F as timeProblems, G as immediate, I as trackWithTimer, J as keepaliveSilent, K as keepaliveAnswered, L as wholeProblems, M as sendWithReissue, N as socketEnds, P as stepChecks, R as withinBound, S as ms, U as WHAT, V as MANIFESTATIONS, W as firstDetector, X as unwatched, Y as kernelGiveUp, _ as inFlight, a as helloDial, b as message, c as ageProblems, d as clientProblems, f as clientRecorder, g as idleCloseProblem, i as authority, j as roundTripCheck, l as attachClient, m as dialCheck, n as closeTimer, o as statusLineJudge, q as keepaliveReset, r as transition, s as STARTING_POLL, t as clientKnob, u as clientBounds, v as keepaliveOnProblems, w as operationTable, y as localStateCheck, z as wrapperTimerProblems } from "./machine-DZMb_QEU.js";
 //#region src/http-client/connection.ts
 /**
 * This factory makes an `http.Agent` of Node. It loads node:http only when a client connects.

package/build/http.d.ts

@@ -1,6 +1,6 @@
 import { n as Clock } from "./clock-mVqhXD0b.js";
 import { d as Refused } from "./policy-G4QJ1ZZq.js";
-import { d as TransportImpl, m as RequestEnd, n as HealthServer, r as Lifecycle, v as RequestStream, w as ProbeKind, x as Health, y as RequestWork } from "./lifecycle-fgYfxrHK.js";
+import { d as TransportImpl, m as RequestEnd, n as HealthServer, r as Lifecycle, v as RequestStream, w as ProbeKind, x as Health, y as RequestWork } from "./lifecycle-CMedxaQd.js";
 import { Extent, Quantity } from "@mark1russell7/quantity";
 import { ListenOptions } from "node:net";
 import { IncomingMessage, Server, ServerEventMap, ServerResponse } from "node:http";

package/build/index.d.ts

@@ -1,12 +1,12 @@
 import { a as backoffDelay, i as backoffBand, n as DelayBand, o as backoffProblems, r as Jitter, t as Backoff } from "./backoff-B-jGWVDm.js";
 import { a as realClock, i as platformClock, n as Clock, r as PlatformClockOptions, t as Cancel } from "./clock-mVqhXD0b.js";
 import { S as retryAfterSeconds, _ as freeAt, a as LimitRule, b as limiterProblems, c as LimiterSpec, d as Refused, f as SlidingWindow, g as decide, h as TokenBucket, i as LimitPolicy, l as LimiterStoreSpec, m as TakeStep, n as Decision, o as Limiter, p as StoreFailure, r as KeyState, s as LimiterEviction, t as Allowed, u as RefusalCause, v as idleSpan, x as longestRetryAfter, y as limitRule } from "./policy-G4QJ1ZZq.js";
-import { $ as asWindow, A as LifecycleEvent, B as Gate, C as ProbeAnswer, Ct as Idempotency, D as Outcome, E as CheckFn, F as CooperativeFloor, G as ServiceDescription, H as Phase, I as Coupling, J as FailsBy, K as Step, L as Dependency, M as Recorder, N as Check, O as Result, P as Controller, Q as asDebounce, R as ExitCodes, S as HealthVerdict, St as processPortOf, T as StartOptions, Tt as mayReissue, U as ProgressMarks, V as MessageTrigger, W as RepeatSignal, X as Span, Y as Poll, Z as Timing, _ as RequestOptions, _t as isExitCode, a as PhaseContext, at as RouteRequest, b as CheckVerdict, bt as matchesMessage, c as STAGES, ct as ExitSignal, d as TransportImpl, dt as MessageShape, et as failSpan, f as cooperativeAbortAt, ft as PROCESS_TRIGGERS, g as RequestFn, gt as embeddedProcess, h as RequestEvent, ht as ProcessTrigger, i as LifecycleState, it as RoutePattern, j as MachineName, l as ShutdownOptions, lt as ExitTrigger, m as RequestEnd, mt as ProcessPort, n as HealthServer, nt as recoverSpan, o as PhaseWork, ot as EXIT_SIGNALS, p as stageRank, pt as ProcessHost, q as Transport, r as Lifecycle, rt as OperationOf, s as RunOptions, st as EmbeddedProcess, t as DependencyHandle, tt as heartbeatDetection, u as Stage, ut as HostStream, v as RequestStream, vt as isExitSignal, w as ProbeKind, wt as Operation, x as Health, xt as nodeProcess, y as RequestWork, yt as isMessageShape, z as FORMAT } from "./lifecycle-fgYfxrHK.js";
-import { a as WatchdogSpec, c as Profile, d as kubernetes, f as localDev, i as Watchdog, l as daemon, n as ServiceBuilder, o as watchdog, r as service, s as PodTiming, t as ControllerBuilder, u as ephemeral } from "./builder-DawJhq4p.js";
+import { $ as Step, A as EPISODES_KEPT, At as Idempotency, B as Check, C as ProbeAnswer, Ct as embeddedProcess, D as CheckMetrics, Dt as matchesMessage, E as CheckFn, Et as isMessageShape, F as Result, G as ExitCodes, H as CooperativeFloor, J as MessageTrigger, K as FORMAT, L as LifecycleEvent, M as HealthMetrics, Mt as mayReissue, N as redact, O as DURATION_FRACTIONS, Ot as nodeProcess, P as Outcome, Q as ServiceDescription, R as MachineName, S as HealthVerdict, St as ProcessTrigger, T as StartOptions, Tt as isExitSignal, U as Coupling, V as Controller, W as Dependency, X as ProgressMarks, Y as Phase, Z as RepeatSignal, _ as RequestOptions, _t as HostStream, a as PhaseContext, at as asDebounce, b as CheckVerdict, bt as ProcessHost, c as STAGES, ct as heartbeatDetection, d as TransportImpl, dt as RoutePattern, et as Transport, f as cooperativeAbortAt, ft as RouteRequest, g as RequestFn, gt as ExitTrigger, h as RequestEvent, ht as ExitSignal, i as LifecycleState, it as Timing, j as Episode, jt as Operation, k as DurationHistogram, kt as processPortOf, l as ShutdownOptions, lt as recoverSpan, m as RequestEnd, mt as EmbeddedProcess, n as HealthServer, nt as Poll, o as PhaseWork, ot as asWindow, p as stageRank, pt as EXIT_SIGNALS, q as Gate, r as Lifecycle, rt as Span, s as RunOptions, st as failSpan, t as DependencyHandle, tt as FailsBy, u as Stage, ut as OperationOf, v as RequestStream, vt as MessageShape, w as ProbeKind, wt as isExitCode, x as Health, xt as ProcessPort, y as RequestWork, yt as PROCESS_TRIGGERS, z as Recorder } from "./lifecycle-CMedxaQd.js";
+import { a as WatchdogSpec, c as Profile, d as kubernetes, f as localDev, i as Watchdog, l as daemon, n as ServiceBuilder, o as watchdog, r as service, s as PodTiming, t as ControllerBuilder, u as ephemeral } from "./builder-CsSO4LzB.js";
 import { Heartbeat, HeartbeatOptions, detectionTime, heartbeat } from "./heartbeat.js";
 import { a as keyedLimiter, i as TakeRequest, n as LimiterStore, o as memoryStore, r as MemoryStore, t as KeyedLimiter } from "./store-D5HLgBnW.js";
 import { a as limiterStateOf, i as limiterMachine, n as SLIDING_WINDOW_MACHINE, r as TOKEN_BUCKET_MACHINE, t as LimiterState } from "./limiter-B0849Vhp.js";
-import { a as JobSource, c as QueueKnobs, d as queueDrain, f as redeliverOnce, i as JobSettle, l as RedeliveryPolicy, n as JobContext, o as QueueDrain, p as UnitRequest, r as JobFailure, s as QueueDrainOptions, t as JobAction, u as RequeueCause } from "./queue-snRHK3Jm.js";
+import { a as JobSource, c as QueueKnobs, d as queueDrain, f as redeliverOnce, i as JobSettle, l as RedeliveryPolicy, n as JobContext, o as QueueDrain, p as UnitRequest, r as JobFailure, s as QueueDrainOptions, t as JobAction, u as RequeueCause } from "./queue-CndiCVaY.js";
 import { Extent, Quantity } from "@mark1russell7/quantity";
 import { replay } from "@mark1russell7/algebra/replay";
 import { Machine } from "@mark1russell7/algebra";
@@ -84,6 +84,55 @@ export declare const evaluate: (rule: Rule, bind: Binding) => Evaluated[];
  * applies, the arithmetic cannot decide, and the verdict is "depends".
  */
 export declare const verdictOf: (rule: Rule, bind: Binding, evaluated: readonly Evaluated[]) => Verdict;
+/**
+ * A mark tells how a timer moves when a compression scales time by k (E10). A "scalable" timer
+ * becomes k times its value. A "fixed" timer keeps its value. A "stepped" timer takes only
+ * multiples of its step, thus it rounds up. A "floored" timer has a floor that a peer sets, for
+ * example the minimum retransmission timeout of the kernel. The step and the floor are in seconds.
+ */
+type TimerMark = {
+  readonly kind: "scalable";
+} | {
+  readonly kind: "fixed";
+} | {
+  readonly kind: "stepped";
+  readonly step: number;
+} | {
+  readonly kind: "floored";
+  readonly floor: number;
+  readonly by: string;
+};
+/** The marks map `symbol@hop` to a mark. A bare symbol marks the symbol at each hop. */
+type TimerMarks = Readonly<Record<string, TimerMark | undefined>>;
+/** A compressed binding, and the symbols that have no mark. */
+interface Compressed {
+  readonly bind: Binding;
+  /** These symbols have no mark. They keep their values, thus the compression proves nothing about them. */
+  readonly unmarked: readonly string[];
+}
+/** A change is a rule whose verdict a compression changes. */
+interface Change {
+  readonly rule: string;
+  readonly before: Verdict;
+  readonly after: Verdict;
+}
+/** The result of a compression: the rules whose verdict it changes, and the symbols of the rules that have no mark. */
+interface Compression {
+  readonly changed: readonly Change[];
+  readonly unmarked: readonly string[];
+}
+/**
+ * This function scales each timer of a binding by k, by its mark (E10). An absent timer ("inf" or
+ * "off") stays absent. A chain scales each value. The margins of the binding and the constants of
+ * the rules do not scale: they are tolerances, not timers. A symbol with no mark keeps its value.
+ */
+export declare const compress: (bind: Binding, k: number, marks: TimerMarks) => Compressed;
+/**
+ * This function tells which rules a compression by k changes. A compression keeps each ordering
+ * when no verdict changes. A change in either direction counts: a violation that the compression
+ * hides is as wrong as one that it makes. The unmarked symbols are the symbols that the rules read.
+ */
+export declare const compression: (rules: readonly Rule[], bind: Binding, k: number, marks: TimerMarks) => Compression;
 //#endregion
 //#region src/lint.d.ts
 /**
@@ -96,10 +145,31 @@ export declare const verdictOf: (rule: Rule, bind: Binding, evaluated: readonly
  * A rule about a client applies one time for each dependency. A rule about a consumer applies one
  * time for each consumer and each worker. A rule about a limiter applies one time for each limiter.
  */
+/** A statistic of a measured distribution. The law binds p99 (`LAW_STATISTIC`). */
+type Statistic = "p50" | "p90" | "p99" | "p999" | "max";
+/** The law binds this statistic of a distribution. */
+export declare const LAW_STATISTIC: Statistic;
+/**
+ * A claim is a value of the scenario that names its epoch: the component and the version that give
+ * it, for example "node@22" (E2). A default is true only for a version: the keep-alive of Node is
+ * 5 s, but 65 s on main. A claim gives a set value, or a measured distribution by its statistics.
+ */
+type Claim = {
+  readonly epoch: string;
+  readonly value: Extent;
+} | {
+  readonly epoch: string;
+  readonly distribution: Readonly<Partial<Record<Statistic, Quantity>>>;
+};
+/**
+ * A value of the scenario is an amount, or a claim. An amount names no epoch, thus the finding of
+ * each rule that reads it gives null for its epoch.
+ */
+type ScenarioValue = Extent | Claim;
 /** A scenario gives the values of the platform and of each dependency, by the `symbol@hop` of the law. */
 interface Scenario {
   /** These are the values of the platform: prestop_sleep@pod, termination_grace@pod, probe_period@pod, propagation_bound@cluster. */
-  readonly platform: Readonly<Record<string, Extent>>;
+  readonly platform: Readonly<Record<string, ScenarioValue>>;
   /**
    * These are the probe windows of the kubelet, period × failure threshold. They add to the
    * windows of the declaration. A probe reads the cached verdict, thus detection is the latch,
@@ -110,16 +180,18 @@ interface Scenario {
     readonly liveness: Quantity;
   };
   /** These are the values of each dependency, by its name: failover_time@dependency, server_idle_close@server. */
-  readonly dependencies?: Readonly<Record<string, Readonly<Record<string, Extent>>>> | undefined;
+  readonly dependencies?: Readonly<Record<string, Readonly<Record<string, ScenarioValue>>>> | undefined;
   /** These are the values of the source of each consumer and worker, by its name and by the `symbol@hop` of the law: lease_duration@broker. */
-  readonly transports?: Readonly<Record<string, Readonly<Record<string, Extent>>>> | undefined;
+  readonly transports?: Readonly<Record<string, Readonly<Record<string, ScenarioValue>>>> | undefined;
   /**
    * These are the values of the callers of each limiter, by its name and by the `symbol@hop` of the
    * law: client_retry_window@caller, retry_delay@caller. A symbol without a hop binds at `caller`.
    */
-  readonly limiters?: Readonly<Record<string, Readonly<Record<string, Extent>>>> | undefined;
+  readonly limiters?: Readonly<Record<string, Readonly<Record<string, ScenarioValue>>>> | undefined;
 }
-/** A finding is the verdict of one rule for one scope: the service, or the client of a dependency. */
+/** The epochs of a scope map each symbol that the scenario binds to the epoch of its value, or null when the value names none. */
+type Epochs = Readonly<Record<string, string | null>>;
+/** A finding is the verdict of one rule for one scope: the service, or the client of a dependency. When a value of the scenario names an epoch, the finding gives the epoch of each value that the rule reads. */
 interface Finding {
   readonly rule: string;
   readonly scope: string;
@@ -129,6 +201,8 @@ interface Finding {
   readonly evaluated: readonly Evaluated[];
   /** These are the symbols that have no bound. A "depends" verdict waits for them. */
   readonly unbound: readonly string[];
+  /** These are the epochs of the symbols of the rule that the scenario binds (E2). Thus a finding is true for these versions. */
+  readonly epochs?: Epochs | undefined;
 }
 /** These are the identifiers of the rules that each declaration gets. */
 export declare const SERVICE_RULES: readonly string[];
@@ -150,11 +224,31 @@ export declare const LIMITER_RULES: readonly Rule[];
 export declare const serviceBindings: (svc: ServiceDescription, scenario: Scenario) => {
   readonly bind: Record<string, Bound>;
   readonly from: Record<string, string>;
+  readonly epochs: Epochs;
 };
 /** This identifier is the rule of the findings about a field that the declaration does not give. */
 export declare const DECLARATION_RULE = "declaration";
 /** This identifier is the rule of the findings about the stall time of a progress check (`Check.marks`). */
 export declare const PROGRESS_RULE = "progress";
+/**
+ * These are the marks of the timers of the platform (E10). Kubernetes takes the probe period, the
+ * preStop sleep and the termination grace in whole seconds, thus each is stepped by 1 s. The
+ * cluster sets the propagation of the endpoints, thus a compression of the service cannot scale it.
+ */
+export declare const PLATFORM_MARKS: TimerMarks;
+/** A change of a compression of a service: a rule and a scope whose verdict the compression changes. */
+interface ScopedChange extends Change {
+  readonly scope: string;
+}
+/**
+ * This function tells which findings of `lint` a compression by k changes (E10). It scales the
+ * bindings of each scope by the marks. Thus a harness that runs the service k times faster learns
+ * the orderings that its run breaks. The unmarked symbols are the symbols of the rules with no mark.
+ */
+export declare const compressionOf: (svc: ServiceDescription, scenario: Scenario, rules: readonly Rule[], k: number, marks: TimerMarks) => {
+  readonly changed: readonly ScopedChange[];
+  readonly unmarked: readonly string[];
+};
 /**
  * This function applies each service rule to a declaration and a scenario. A rule applies one time
  * for the service, for each client, for each consumer and worker, or for each limiter. The function
@@ -292,5 +386,5 @@ export declare const drainMachine: (description: ServiceDescription) => Machine;
 /** These are the static machines of the runtime, by the name that their events carry. */
 export declare const MACHINES: Readonly<Record<Exclude<MachineName, "drain" | "client">, Machine>>;
 //#endregion
-export { type Allowed, type Backoff, type Binding, type Bound, type Cancel, type Check, type CheckFn, type CheckVerdict, type Clock, type Controller, type ControllerBuilder, type CooperativeFloor, type Coupling, type Decision, type DelayBand, type Dependency, type DependencyHandle, EXIT_SIGNALS, type EmbeddedProcess, type Evaluated, type ExitCodes, type ExitSignal, type ExitTrigger, FORMAT, type FailsBy, type Finding, type Gate, type Health, type HealthServer, type HealthVerdict, type Heartbeat, type HeartbeatOptions, type HostStream, type Idempotency, type Inequality, type IterationContext, type Jitter, type JobAction, type JobContext, type JobFailure, type JobSettle, type JobSource, type KeyState, type KeyedLimiter, type Lifecycle, type LifecycleEvent, type LifecycleState, type LimitPolicy, type LimitRule, type Limiter, type LimiterEviction, type LimiterSpec, type LimiterState, type LimiterStore, type LimiterStoreSpec, type MachineName, type MemoryStore, type MessageShape, type MessageTrigger, type Operation, type OperationOf, type Outcome, PROCESS_TRIGGERS, type Phase, type PhaseContext, type PhaseWork, type PlatformClockOptions, type PodTiming, type Poll, type ProbeAnswer, type ProbeKind, type ProcessHost, type ProcessPort, type ProcessTrigger, type Profile, type ProgressMarks, type QueueDrain, type QueueDrainOptions, type QueueKnobs, type Recorder, type RedeliveryPolicy, type RefusalCause, type Refused, type RepeatSignal, type RequestEnd, type RequestEvent, type RequestFn, type RequestOptions, type RequestStream, type RequestWork, type RequeueCause, type Result, type RoutePattern, type RouteRequest, type Rule, type RunOptions, SLIDING_WINDOW_MACHINE, STAGES, type Scenario, type ServiceBuilder, type ServiceDescription, type ShutdownOptions, type Side, type SlidingWindow, type Span, type Stage, type StartOptions, type Step, type StoreFailure, TOKEN_BUCKET_MACHINE, type TakeRequest, type TakeStep, type Term, type Timing, type TokenBucket, type Transport, type TransportImpl, type UnitRequest, type Verdict, type Watchdog, type WatchdogSpec, type WorkerKnobs, type WorkerLoop, type WorkerLoopOptions, asDebounce, asWindow, backoffBand, backoffDelay, backoffProblems, cooperativeAbortAt, daemon, decide, detectionTime, embeddedProcess, ephemeral, failSpan, freeAt, heartbeat, heartbeatDetection, idleSpan, isExitCode, isExitSignal, isMessageShape, keyedLimiter, kubernetes, limitRule, limiterMachine, limiterProblems, limiterStateOf, localDev, longestRetryAfter, matchesMessage, mayReissue, memoryStore, nodeProcess, platformClock, processPortOf, queueDrain, realClock, recoverSpan, redeliverOnce, replay, retryAfterSeconds, service, stageRank, watchdog };
+export { type Allowed, type Backoff, type Binding, type Bound, type Cancel, type Change, type Check, type CheckFn, type CheckMetrics, type CheckVerdict, type Claim, type Clock, type Compressed, type Compression, type Controller, type ControllerBuilder, type CooperativeFloor, type Coupling, DURATION_FRACTIONS, type Decision, type DelayBand, type Dependency, type DependencyHandle, type DurationHistogram, EPISODES_KEPT, EXIT_SIGNALS, type EmbeddedProcess, type Episode, type Epochs, type Evaluated, type ExitCodes, type ExitSignal, type ExitTrigger, FORMAT, type FailsBy, type Finding, type Gate, type Health, type HealthMetrics, type HealthServer, type HealthVerdict, type Heartbeat, type HeartbeatOptions, type HostStream, type Idempotency, type Inequality, type IterationContext, type Jitter, type JobAction, type JobContext, type JobFailure, type JobSettle, type JobSource, type KeyState, type KeyedLimiter, type Lifecycle, type LifecycleEvent, type LifecycleState, type LimitPolicy, type LimitRule, type Limiter, type LimiterEviction, type LimiterSpec, type LimiterState, type LimiterStore, type LimiterStoreSpec, type MachineName, type MemoryStore, type MessageShape, type MessageTrigger, type Operation, type OperationOf, type Outcome, PROCESS_TRIGGERS, type Phase, type PhaseContext, type PhaseWork, type PlatformClockOptions, type PodTiming, type Poll, type ProbeAnswer, type ProbeKind, type ProcessHost, type ProcessPort, type ProcessTrigger, type Profile, type ProgressMarks, type QueueDrain, type QueueDrainOptions, type QueueKnobs, type Recorder, type RedeliveryPolicy, type RefusalCause, type Refused, type RepeatSignal, type RequestEnd, type RequestEvent, type RequestFn, type RequestOptions, type RequestStream, type RequestWork, type RequeueCause, type Result, type RoutePattern, type RouteRequest, type Rule, type RunOptions, SLIDING_WINDOW_MACHINE, STAGES, type Scenario, type ScenarioValue, type ScopedChange, type ServiceBuilder, type ServiceDescription, type ShutdownOptions, type Side, type SlidingWindow, type Span, type Stage, type StartOptions, type Statistic, type Step, type StoreFailure, TOKEN_BUCKET_MACHINE, type TakeRequest, type TakeStep, type Term, type TimerMark, type TimerMarks, type Timing, type TokenBucket, type Transport, type TransportImpl, type UnitRequest, type Verdict, type Watchdog, type WatchdogSpec, type WorkerKnobs, type WorkerLoop, type WorkerLoopOptions, asDebounce, asWindow, backoffBand, backoffDelay, backoffProblems, cooperativeAbortAt, daemon, decide, detectionTime, embeddedProcess, ephemeral, failSpan, freeAt, heartbeat, heartbeatDetection, idleSpan, isExitCode, isExitSignal, isMessageShape, keyedLimiter, kubernetes, limitRule, limiterMachine, limiterProblems, limiterStateOf, localDev, longestRetryAfter, matchesMessage, mayReissue, memoryStore, nodeProcess, platformClock, processPortOf, queueDrain, realClock, recoverSpan, redact, redeliverOnce, replay, retryAfterSeconds, service, stageRank, watchdog };
 //# sourceMappingURL=index.d.ts.map