@pegma/rate-limit 0.0.0

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 RetireGolden, LLC
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,90 @@
+# `@pegma/rate-limit`
+
+Two explicitly named application rate-limit tiers:
+
+- `createMemoryLimiter` is a per-instance sliding window with zero I/O. It is
+  approximate under scale-out.
+- `createDurableLimiter` is a shared fixed-window counter over an injected
+  `@pegma/storage-core` `Store`. It is for low-rate, expensive or
+  abuse-critical operations.
+
+> [!IMPORTANT]
+> This source package is at the one-time `0.0.0` package-name bootstrap stage.
+> It is not an advertised release. A separate `0.1.0` release follows
+> bootstrap and consumer validation.
+
+There is no default tier and no automatic upgrade. This package is application
+abuse control, not DDoS protection, HTTP middleware, or billing metering.
+Policy names and limiter keys must be primitive, non-blank strings. Whitespace
+is preserved; it remains part of the host-chosen opaque identity. Inputs must
+also contain well-formed Unicode so UTF-8 hashing cannot alias distinct
+unpaired UTF-16 surrogate code units.
+
+## Memory tier
+
+The memory-only subpath does not import storage:
+
+```ts
+import {
+  createMemoryLimiter,
+  defineRateLimitPolicy,
+} from "@pegma/rate-limit/memory";
+
+const policy = defineRateLimitPolicy({
+  name: "public-read",
+  limit: 60,
+  windowMs: 5 * 60_000,
+});
+const limiter = createMemoryLimiter(policy);
+const decision = await limiter.allow(clientAddress);
+```
+
+With N host instances this can admit approximately N times `limit`. Choosing
+it means accepting that property.
+
+## Durable tier
+
+```ts
+import {
+  createDurableLimiter,
+  defineRateLimitPolicy,
+} from "@pegma/rate-limit/durable";
+
+const limiter = createDurableLimiter(
+  defineRateLimitPolicy({
+    name: "login",
+    limit: 10,
+    windowMs: 5 * 60_000,
+  }),
+  store,
+);
+
+const decision = await limiter.allow(principalOrAddress);
+await limiter.sweep();
+```
+
+Allowed checks perform a decider-mediated storage update. Once the current
+count reaches the limit, checks refuse without writing. Contention exhaustion,
+storage outage, malformed state, and malformed clock values fail closed with
+`retryAfter`, measured in milliseconds.
+
+Policy names and limiter keys are domain-separated and SHA-256 hashed for
+backend-safe storage identifiers. Durable counter records store only those
+bounded hashes, never the raw policy name or key. Subject hashes are scoped to
+their policy, but they are deterministic pseudonymous identifiers, not
+anonymization: predictable inputs can still be guessed and activity remains
+linkable within a policy.
+
+The durable tier uses fixed windows. A burst across a boundary can briefly
+admit nearly twice the limit. It also puts shared-storage latency on every
+allowed check; do not use it for hot, cheap endpoints.
+
+Sweeps list one policy partition and delete structurally valid expired rows
+only if their versions are unchanged. Malformed rows are retained:
+storage-core listings do not expose actual row keys, so pairing a malformed
+row's version with a key reconstructed from its payload could target another
+row. Checks against that malformed row still fail closed.
+
+## License
+
+MIT

package/dist/durable.d.ts

@@ -0,0 +1,31 @@
+import type { IsoTimestamp } from "@pegma/spine";
+import { type Store } from "@pegma/storage-core";
+import { type LimiterOptions, type RateLimiter, type RateLimitPolicy } from "./policy.js";
+export interface DurableLimiterOptions extends LimiterOptions {
+    /** Total optimistic-concurrency attempts. Defaults to 3. */
+    readonly maxAttempts?: number;
+}
+export interface SweepResult {
+    readonly scanned: number;
+    readonly deleted: number;
+}
+export interface DurableRateLimiter extends RateLimiter {
+    /**
+     * Deletes structurally valid expired records only if their versions are
+     * unchanged. Malformed rows are retained because listings do not expose
+     * their authoritative storage keys.
+     */
+    sweep(now?: IsoTimestamp): Promise<SweepResult>;
+}
+/**
+ * Creates a shared, fixed-window limiter over an injected Store.
+ *
+ * This tier pays for one storage update per allowed check. A fixed window can
+ * admit nearly twice the limit across a boundary; it is intended for
+ * low-rate, expensive or abuse-critical operations, not hot cheap endpoints.
+ * Storage failures and exhausted contention retries deny rather than throw.
+ */
+export declare function createDurableLimiter(inputPolicy: RateLimitPolicy, store: Store, options?: DurableLimiterOptions): DurableRateLimiter;
+export type { LimiterOptions, RateLimitDecision, RateLimiter, RateLimitPolicy, } from "./policy.js";
+export { defineRateLimitPolicy } from "./policy.js";
+//# sourceMappingURL=durable.d.ts.map

package/dist/durable.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"durable.d.ts","sourceRoot":"","sources":["../src/durable.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AACjD,OAAO,EAEL,KAAK,KAAK,EAEX,MAAM,qBAAqB,CAAC;AAE7B,OAAO,EAML,KAAK,cAAc,EAEnB,KAAK,WAAW,EAChB,KAAK,eAAe,EACrB,MAAM,aAAa,CAAC;AA2CrB,MAAM,WAAW,qBAAsB,SAAQ,cAAc;IAC3D,4DAA4D;IAC5D,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAC;CAC/B;AAED,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;CAC1B;AAED,MAAM,WAAW,kBAAmB,SAAQ,WAAW;IACrD;;;;OAIG;IACH,KAAK,CAAC,GAAG,CAAC,EAAE,YAAY,GAAG,OAAO,CAAC,WAAW,CAAC,CAAC;CACjD;AA8FD;;;;;;;GAOG;AACH,wBAAgB,oBAAoB,CAClC,WAAW,EAAE,eAAe,EAC5B,KAAK,EAAE,KAAK,EACZ,OAAO,GAAE,qBAA0B,GAClC,kBAAkB,CAyIpB;AAED,YAAY,EACV,cAAc,EACd,iBAAiB,EACjB,WAAW,EACX,eAAe,GAChB,MAAM,aAAa,CAAC;AACrB,OAAO,EAAE,qBAAqB,EAAE,MAAM,aAAa,CAAC"}

package/dist/durable.js

@@ -0,0 +1,213 @@
+import { systemClock } from "@pegma/spine";
+import { defineCollection, } from "@pegma/storage-core";
+import { assertRateLimitKey, defineRateLimitPolicy, denyForWindow, retryAfter, timeInMilliseconds, } from "./policy.js";
+const COLLECTION_NAME = "rate-limit-windows";
+const windows = defineCollection({
+    name: COLLECTION_NAME,
+    key: (value) => ({
+        partition: String(value.partition),
+        id: String(value.id),
+    }),
+    codec: {
+        encode: (value) => ({ ...value }),
+        decode: (record) => ({
+            partition: record.partition ?? null,
+            id: record.id ?? null,
+            policyHash: record.policyHash ?? null,
+            subjectHash: record.subjectHash ?? null,
+            windowStartMs: record.windowStartMs ?? null,
+            count: record.count ?? null,
+        }),
+    },
+});
+async function hashOpaque(value) {
+    const digest = await crypto.subtle.digest("SHA-256", new TextEncoder().encode(value));
+    return [...new Uint8Array(digest)]
+        .map((byte) => byte.toString(16).padStart(2, "0"))
+        .join("");
+}
+async function partitionFor(policy) {
+    const policyHash = await hashOpaque(`pegma.rate-limit.policy.v1\u0000${policy.name}`);
+    return { partition: `policy-${policyHash}`, policyHash };
+}
+async function subjectHashFor(policyHash, key) {
+    return hashOpaque(`pegma.rate-limit.subject.v1\u0000${policyHash}\u0000${key}`);
+}
+function idFor(windowStartMs, subjectHash) {
+    return `${windowStartMs}-${subjectHash}`;
+}
+const SHA_256_HEX = /^[0-9a-f]{64}$/u;
+function validWindow(value) {
+    return typeof value.partition === "string" &&
+        /^policy-[0-9a-f]{64}$/u.test(value.partition) &&
+        typeof value.id === "string" &&
+        value.id.length > 0 &&
+        typeof value.policyHash === "string" &&
+        SHA_256_HEX.test(value.policyHash) &&
+        typeof value.subjectHash === "string" &&
+        SHA_256_HEX.test(value.subjectHash) &&
+        typeof value.windowStartMs === "number" &&
+        Number.isSafeInteger(value.windowStartMs) &&
+        typeof value.count === "number" &&
+        Number.isSafeInteger(value.count) &&
+        value.count > 0
+        ? value
+        : null;
+}
+function sweepIdentity(value, expected) {
+    if (typeof value.partition !== "string" ||
+        value.partition !== expected.partition ||
+        typeof value.id !== "string" ||
+        value.id.length === 0 ||
+        typeof value.policyHash !== "string" ||
+        value.policyHash !== expected.policyHash ||
+        typeof value.subjectHash !== "string" ||
+        !SHA_256_HEX.test(value.subjectHash) ||
+        typeof value.windowStartMs !== "number" ||
+        !Number.isSafeInteger(value.windowStartMs) ||
+        value.id !== idFor(value.windowStartMs, value.subjectHash)) {
+        return null;
+    }
+    return {
+        partition: value.partition,
+        id: value.id,
+        policyHash: value.policyHash,
+        subjectHash: value.subjectHash,
+        windowStartMs: value.windowStartMs,
+    };
+}
+function assertMaxAttempts(value) {
+    if (!Number.isSafeInteger(value) || value <= 0) {
+        throw new TypeError("maxAttempts must be a positive integer.");
+    }
+    return value;
+}
+/**
+ * Creates a shared, fixed-window limiter over an injected Store.
+ *
+ * This tier pays for one storage update per allowed check. A fixed window can
+ * admit nearly twice the limit across a boundary; it is intended for
+ * low-rate, expensive or abuse-critical operations, not hot cheap endpoints.
+ * Storage failures and exhausted contention retries deny rather than throw.
+ */
+export function createDurableLimiter(inputPolicy, store, options = {}) {
+    const policy = defineRateLimitPolicy(inputPolicy);
+    const clock = options.clock ?? systemClock;
+    const maxAttempts = assertMaxAttempts(options.maxAttempts ?? 3);
+    const collection = store.collection(windows);
+    let partitionPromise;
+    function getPartition() {
+        // Start hashing only inside allow/sweep, where fail-closed handling
+        // immediately awaits the promise. Eager hashing can leave a rejected
+        // digest promise unhandled before the limiter is first used.
+        partitionPromise ??= partitionFor(policy);
+        return partitionPromise;
+    }
+    return {
+        async allow(key, at) {
+            assertRateLimitKey(key);
+            const now = timeInMilliseconds(clock, at);
+            if (now === null) {
+                return denyForWindow(policy.windowMs);
+            }
+            const windowStartMs = Math.floor(now / policy.windowMs) * policy.windowMs;
+            const windowEndsAt = windowStartMs + policy.windowMs;
+            let deciderAllowed = false;
+            try {
+                const { partition, policyHash } = await getPartition();
+                const subjectHash = await subjectHashFor(policyHash, key);
+                const id = idFor(windowStartMs, subjectHash);
+                const result = await collection.update({ partition, id }, (current) => {
+                    if (current === null) {
+                        deciderAllowed = true;
+                        return {
+                            action: "write",
+                            value: {
+                                partition,
+                                id,
+                                policyHash,
+                                subjectHash,
+                                windowStartMs,
+                                count: 1,
+                            },
+                        };
+                    }
+                    const valid = validWindow(current);
+                    if (valid === null ||
+                        valid.partition !== partition ||
+                        valid.id !== id ||
+                        valid.policyHash !== policyHash ||
+                        valid.subjectHash !== subjectHash ||
+                        valid.windowStartMs !== windowStartMs ||
+                        valid.count >= policy.limit) {
+                        deciderAllowed = false;
+                        return { action: "keep" };
+                    }
+                    deciderAllowed = true;
+                    return {
+                        action: "write",
+                        value: { ...valid, count: valid.count + 1 },
+                    };
+                }, { maxAttempts });
+                if (result.written && deciderAllowed) {
+                    return { allowed: true };
+                }
+            }
+            catch {
+                // Storage outage and contention exhaustion deliberately fail closed.
+            }
+            return {
+                allowed: false,
+                retryAfter: retryAfter(windowEndsAt, now),
+            };
+        },
+        async sweep(at) {
+            const now = timeInMilliseconds(clock, at);
+            if (now === null) {
+                return { scanned: 0, deleted: 0 };
+            }
+            let expected;
+            let rows;
+            try {
+                expected = await getPartition();
+                rows = await collection.listVersioned(expected.partition);
+            }
+            catch {
+                return { scanned: 0, deleted: 0 };
+            }
+            let deleted = 0;
+            for (const row of rows) {
+                const identity = sweepIdentity(row.value, expected);
+                if (identity === null) {
+                    // CollectionStore.listVersioned does not expose the actual row key.
+                    // Reconstructing one from malformed identity fields could pair this
+                    // row's version with a different row, so retaining it is the only
+                    // safe choice.
+                    continue;
+                }
+                const countIsMalformed = typeof row.value.count !== "number" ||
+                    !Number.isSafeInteger(row.value.count) ||
+                    row.value.count <= 0;
+                if (countIsMalformed ||
+                    identity.windowStartMs + policy.windowMs > now) {
+                    continue;
+                }
+                try {
+                    const removed = await collection.deleteIfUnchanged({
+                        partition: identity.partition,
+                        id: identity.id,
+                    }, row.version);
+                    if (removed) {
+                        deleted += 1;
+                    }
+                }
+                catch {
+                    // A sweep is hygiene; a failed delete leaves the record for later.
+                }
+            }
+            return { scanned: rows.length, deleted };
+        },
+    };
+}
+export { defineRateLimitPolicy } from "./policy.js";
+//# sourceMappingURL=durable.js.map

package/dist/durable.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"durable.js","sourceRoot":"","sources":["../src/durable.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAE3C,OAAO,EACL,gBAAgB,GAGjB,MAAM,qBAAqB,CAAC;AAE7B,OAAO,EACL,kBAAkB,EAClB,qBAAqB,EACrB,aAAa,EACb,UAAU,EACV,kBAAkB,GAKnB,MAAM,aAAa,CAAC;AAErB,MAAM,eAAe,GAAG,oBAAoB,CAAC;AAsB7C,MAAM,OAAO,GAAG,gBAAgB,CAAe;IAC7C,IAAI,EAAE,eAAe;IACrB,GAAG,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QACf,SAAS,EAAE,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC;QAClC,EAAE,EAAE,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;KACrB,CAAC;IACF,KAAK,EAAE;QACL,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,KAAK,EAAE,CAAC;QACjC,MAAM,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;YACnB,SAAS,EAAE,MAAM,CAAC,SAAS,IAAI,IAAI;YACnC,EAAE,EAAE,MAAM,CAAC,EAAE,IAAI,IAAI;YACrB,UAAU,EAAE,MAAM,CAAC,UAAU,IAAI,IAAI;YACrC,WAAW,EAAE,MAAM,CAAC,WAAW,IAAI,IAAI;YACvC,aAAa,EAAE,MAAM,CAAC,aAAa,IAAI,IAAI;YAC3C,KAAK,EAAE,MAAM,CAAC,KAAK,IAAI,IAAI;SAC5B,CAAC;KACH;CACF,CAAC,CAAC;AAqBH,KAAK,UAAU,UAAU,CAAC,KAAa;IACrC,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,MAAM,CAAC,MAAM,CACvC,SAAS,EACT,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,CAChC,CAAC;IACF,OAAO,CAAC,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC;SAC/B,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;SACjD,IAAI,CAAC,EAAE,CAAC,CAAC;AACd,CAAC;AAOD,KAAK,UAAU,YAAY,CACzB,MAAuB;IAEvB,MAAM,UAAU,GAAG,MAAM,UAAU,CACjC,mCAAmC,MAAM,CAAC,IAAI,EAAE,CACjD,CAAC;IACF,OAAO,EAAE,SAAS,EAAE,UAAU,UAAU,EAAE,EAAE,UAAU,EAAE,CAAC;AAC3D,CAAC;AAED,KAAK,UAAU,cAAc,CAC3B,UAAkB,EAClB,GAAW;IAEX,OAAO,UAAU,CACf,oCAAoC,UAAU,SAAS,GAAG,EAAE,CAC7D,CAAC;AACJ,CAAC;AAED,SAAS,KAAK,CAAC,aAAqB,EAAE,WAAmB;IACvD,OAAO,GAAG,aAAa,IAAI,WAAW,EAAE,CAAC;AAC3C,CAAC;AAED,MAAM,WAAW,GAAG,iBAAiB,CAAC;AAEtC,SAAS,WAAW,CAAC,KAAmB;IACtC,OAAO,OAAO,KAAK,CAAC,SAAS,KAAK,QAAQ;QACxC,wBAAwB,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC;QAC9C,OAAO,KAAK,CAAC,EAAE,KAAK,QAAQ;QAC5B,KAAK,CAAC,EAAE,CAAC,MAAM,GAAG,CAAC;QACnB,OAAO,KAAK,CAAC,UAAU,KAAK,QAAQ;QACpC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC;QAClC,OAAO,KAAK,CAAC,WAAW,KAAK,QAAQ;QACrC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC;QACnC,OAAO,KAAK,CAAC,aAAa,KAAK,QAAQ;QACvC,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,aAAa,CAAC;QACzC,OAAO,KAAK,CAAC,KAAK,KAAK,QAAQ;QAC/B,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,KAAK,CAAC;QACjC,KAAK,CAAC,KAAK,GAAG,CAAC;QACf,CAAC,CAAE,KAAqB;QACxB,CAAC,CAAC,IAAI,CAAC;AACX,CAAC;AAED,SAAS,aAAa,CACpB,KAAmB,EACnB,QAA2B;IAE3B,IACE,OAAO,KAAK,CAAC,SAAS,KAAK,QAAQ;QACnC,KAAK,CAAC,SAAS,KAAK,QAAQ,CAAC,SAAS;QACtC,OAAO,KAAK,CAAC,EAAE,KAAK,QAAQ;QAC5B,KAAK,CAAC,EAAE,CAAC,MAAM,KAAK,CAAC;QACrB,OAAO,KAAK,CAAC,UAAU,KAAK,QAAQ;QACpC,KAAK,CAAC,UAAU,KAAK,QAAQ,CAAC,UAAU;QACxC,OAAO,KAAK,CAAC,WAAW,KAAK,QAAQ;QACrC,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC;QACpC,OAAO,KAAK,CAAC,aAAa,KAAK,QAAQ;QACvC,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,aAAa,CAAC;QAC1C,KAAK,CAAC,EAAE,KAAK,KAAK,CAAC,KAAK,CAAC,aAAa,EAAE,KAAK,CAAC,WAAW,CAAC,EAC1D,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,OAAO;QACL,SAAS,EAAE,KAAK,CAAC,SAAS;QAC1B,EAAE,EAAE,KAAK,CAAC,EAAE;QACZ,UAAU,EAAE,KAAK,CAAC,UAAU;QAC5B,WAAW,EAAE,KAAK,CAAC,WAAW;QAC9B,aAAa,EAAE,KAAK,CAAC,aAAa;KACnC,CAAC;AACJ,CAAC;AAED,SAAS,iBAAiB,CAAC,KAAa;IACtC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;QAC/C,MAAM,IAAI,SAAS,CAAC,yCAAyC,CAAC,CAAC;IACjE,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,oBAAoB,CAClC,WAA4B,EAC5B,KAAY,EACZ,OAAO,GAA0B,EAAE;IAEnC,MAAM,MAAM,GAAG,qBAAqB,CAAC,WAAW,CAAC,CAAC;IAClD,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,WAAW,CAAC;IAC3C,MAAM,WAAW,GAAG,iBAAiB,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,CAAC,CAAC;IAChE,MAAM,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;IAC7C,IAAI,gBAAwD,CAAC;IAE7D,SAAS,YAAY;QACnB,oEAAoE;QACpE,qEAAqE;QACrE,6DAA6D;QAC7D,gBAAgB,KAAK,YAAY,CAAC,MAAM,CAAC,CAAC;QAC1C,OAAO,gBAAgB,CAAC;IAC1B,CAAC;IAED,OAAO;QACL,KAAK,CAAC,KAAK,CAAC,GAAW,EAAE,EAAiB;YACxC,kBAAkB,CAAC,GAAG,CAAC,CAAC;YACxB,MAAM,GAAG,GAAG,kBAAkB,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;YAC1C,IAAI,GAAG,KAAK,IAAI,EAAE,CAAC;gBACjB,OAAO,aAAa,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;YACxC,CAAC;YACD,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,MAAM,CAAC,QAAQ,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC;YAC1E,MAAM,YAAY,GAAG,aAAa,GAAG,MAAM,CAAC,QAAQ,CAAC;YACrD,IAAI,cAAc,GAAG,KAAK,CAAC;YAE3B,IAAI,CAAC;gBACH,MAAM,EAAE,SAAS,EAAE,UAAU,EAAE,GAAG,MAAM,YAAY,EAAE,CAAC;gBACvD,MAAM,WAAW,GAAG,MAAM,cAAc,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC;gBAC1D,MAAM,EAAE,GAAG,KAAK,CAAC,aAAa,EAAE,WAAW,CAAC,CAAC;gBAC7C,MAAM,MAAM,GAAG,MAAM,UAAU,CAAC,MAAM,CACpC,EAAE,SAAS,EAAE,EAAE,EAAE,EACjB,CAAC,OAAO,EAAE,EAAE;oBACV,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;wBACrB,cAAc,GAAG,IAAI,CAAC;wBACtB,OAAO;4BACL,MAAM,EAAE,OAAO;4BACf,KAAK,EAAE;gCACL,SAAS;gCACT,EAAE;gCACF,UAAU;gCACV,WAAW;gCACX,aAAa;gCACb,KAAK,EAAE,CAAC;6BACT;yBACF,CAAC;oBACJ,CAAC;oBAED,MAAM,KAAK,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC;oBACnC,IACE,KAAK,KAAK,IAAI;wBACd,KAAK,CAAC,SAAS,KAAK,SAAS;wBAC7B,KAAK,CAAC,EAAE,KAAK,EAAE;wBACf,KAAK,CAAC,UAAU,KAAK,UAAU;wBAC/B,KAAK,CAAC,WAAW,KAAK,WAAW;wBACjC,KAAK,CAAC,aAAa,KAAK,aAAa;wBACrC,KAAK,CAAC,KAAK,IAAI,MAAM,CAAC,KAAK,EAC3B,CAAC;wBACD,cAAc,GAAG,KAAK,CAAC;wBACvB,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC;oBAC5B,CAAC;oBAED,cAAc,GAAG,IAAI,CAAC;oBACtB,OAAO;wBACL,MAAM,EAAE,OAAO;wBACf,KAAK,EAAE,EAAE,GAAG,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,GAAG,CAAC,EAAE;qBAC5C,CAAC;gBACJ,CAAC,EACD,EAAE,WAAW,EAAE,CAChB,CAAC;gBAEF,IAAI,MAAM,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC;oBACrC,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;gBAC3B,CAAC;YACH,CAAC;YAAC,MAAM,CAAC;gBACP,qEAAqE;YACvE,CAAC;YAED,OAAO;gBACL,OAAO,EAAE,KAAK;gBACd,UAAU,EAAE,UAAU,CAAC,YAAY,EAAE,GAAG,CAAC;aAC1C,CAAC;QACJ,CAAC;QAED,KAAK,CAAC,KAAK,CAAC,EAAiB;YAC3B,MAAM,GAAG,GAAG,kBAAkB,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;YAC1C,IAAI,GAAG,KAAK,IAAI,EAAE,CAAC;gBACjB,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC;YACpC,CAAC;YAED,IAAI,QAA2B,CAAC;YAChC,IAAI,IAAI,CAAC;YACT,IAAI,CAAC;gBACH,QAAQ,GAAG,MAAM,YAAY,EAAE,CAAC;gBAChC,IAAI,GAAG,MAAM,UAAU,CAAC,aAAa,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;YAC5D,CAAC;YAAC,MAAM,CAAC;gBACP,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC;YACpC,CAAC;YAED,IAAI,OAAO,GAAG,CAAC,CAAC;YAChB,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACvB,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;gBACpD,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC;oBACtB,oEAAoE;oBACpE,oEAAoE;oBACpE,kEAAkE;oBAClE,eAAe;oBACf,SAAS;gBACX,CAAC;gBACD,MAAM,gBAAgB,GACpB,OAAO,GAAG,CAAC,KAAK,CAAC,KAAK,KAAK,QAAQ;oBACnC,CAAC,MAAM,CAAC,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC;oBACtC,GAAG,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC;gBACvB,IACE,gBAAgB;oBAChB,QAAQ,CAAC,aAAa,GAAG,MAAM,CAAC,QAAQ,GAAG,GAAG,EAC9C,CAAC;oBACD,SAAS;gBACX,CAAC;gBACD,IAAI,CAAC;oBACH,MAAM,OAAO,GAAG,MAAM,UAAU,CAAC,iBAAiB,CAChD;wBACE,SAAS,EAAE,QAAQ,CAAC,SAAS;wBAC7B,EAAE,EAAE,QAAQ,CAAC,EAAE;qBAChB,EACD,GAAG,CAAC,OAAO,CACZ,CAAC;oBACF,IAAI,OAAO,EAAE,CAAC;wBACZ,OAAO,IAAI,CAAC,CAAC;oBACf,CAAC;gBACH,CAAC;gBAAC,MAAM,CAAC;oBACP,mEAAmE;gBACrE,CAAC;YACH,CAAC;YACD,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,OAAO,EAAE,CAAC;QAC3C,CAAC;KACF,CAAC;AACJ,CAAC;AAQD,OAAO,EAAE,qBAAqB,EAAE,MAAM,aAAa,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,4 @@
+export { defineRateLimitPolicy, type LimiterOptions, type RateLimitDecision, type RateLimiter, type RateLimitPolicy, } from "./policy.js";
+export { createMemoryLimiter } from "./memory.js";
+export { createDurableLimiter, type DurableLimiterOptions, type DurableRateLimiter, type SweepResult, } from "./durable.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,qBAAqB,EACrB,KAAK,cAAc,EACnB,KAAK,iBAAiB,EACtB,KAAK,WAAW,EAChB,KAAK,eAAe,GACrB,MAAM,aAAa,CAAC;AACrB,OAAO,EAAE,mBAAmB,EAAE,MAAM,aAAa,CAAC;AAClD,OAAO,EACL,oBAAoB,EACpB,KAAK,qBAAqB,EAC1B,KAAK,kBAAkB,EACvB,KAAK,WAAW,GACjB,MAAM,cAAc,CAAC"}

package/dist/index.js

@@ -0,0 +1,4 @@
+export { defineRateLimitPolicy, } from "./policy.js";
+export { createMemoryLimiter } from "./memory.js";
+export { createDurableLimiter, } from "./durable.js";
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,qBAAqB,GAKtB,MAAM,aAAa,CAAC;AACrB,OAAO,EAAE,mBAAmB,EAAE,MAAM,aAAa,CAAC;AAClD,OAAO,EACL,oBAAoB,GAIrB,MAAM,cAAc,CAAC"}

package/dist/memory.d.ts

@@ -0,0 +1,12 @@
+import { type LimiterOptions, type RateLimiter, type RateLimitPolicy } from "./policy.js";
+/**
+ * Creates a zero-I/O sliding-window limiter.
+ *
+ * This tier is per-instance. With N application instances it can admit about
+ * N times the configured limit; use it only where that approximation is an
+ * explicit host decision.
+ */
+export declare function createMemoryLimiter(inputPolicy: RateLimitPolicy, options?: LimiterOptions): RateLimiter;
+export type { LimiterOptions, RateLimitDecision, RateLimiter, RateLimitPolicy, } from "./policy.js";
+export { defineRateLimitPolicy } from "./policy.js";
+//# sourceMappingURL=memory.d.ts.map

package/dist/memory.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory.d.ts","sourceRoot":"","sources":["../src/memory.ts"],"names":[],"mappings":"AAGA,OAAO,EAML,KAAK,cAAc,EAEnB,KAAK,WAAW,EAChB,KAAK,eAAe,EACrB,MAAM,aAAa,CAAC;AAIrB;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CACjC,WAAW,EAAE,eAAe,EAC5B,OAAO,GAAE,cAAmB,GAC3B,WAAW,CA+Cb;AAED,YAAY,EACV,cAAc,EACd,iBAAiB,EACjB,WAAW,EACX,eAAe,GAChB,MAAM,aAAa,CAAC;AACrB,OAAO,EAAE,qBAAqB,EAAE,MAAM,aAAa,CAAC"}

package/dist/memory.js

@@ -0,0 +1,56 @@
+import { systemClock } from "@pegma/spine";
+import { assertRateLimitKey, defineRateLimitPolicy, denyForWindow, retryAfter, timeInMilliseconds, } from "./policy.js";
+const PRUNE_THRESHOLD = 10_000;
+/**
+ * Creates a zero-I/O sliding-window limiter.
+ *
+ * This tier is per-instance. With N application instances it can admit about
+ * N times the configured limit; use it only where that approximation is an
+ * explicit host decision.
+ */
+export function createMemoryLimiter(inputPolicy, options = {}) {
+    const policy = defineRateLimitPolicy(inputPolicy);
+    const clock = options.clock ?? systemClock;
+    const hits = new Map();
+    let nextPruneAt = Number.NEGATIVE_INFINITY;
+    function liveEntries(entries, cutoff) {
+        return entries.filter((at) => at > cutoff);
+    }
+    function prune(cutoff) {
+        for (const [key, entries] of hits) {
+            const kept = liveEntries(entries, cutoff);
+            if (kept.length === 0) {
+                hits.delete(key);
+            }
+            else {
+                hits.set(key, kept);
+            }
+        }
+    }
+    return {
+        async allow(key, at) {
+            assertRateLimitKey(key);
+            const now = timeInMilliseconds(clock, at);
+            if (now === null) {
+                return denyForWindow(policy.windowMs);
+            }
+            const cutoff = now - policy.windowMs;
+            const entries = liveEntries(hits.get(key) ?? [], cutoff);
+            if (entries.length >= policy.limit) {
+                return {
+                    allowed: false,
+                    retryAfter: retryAfter(entries[0] + policy.windowMs, now),
+                };
+            }
+            entries.push(now);
+            hits.set(key, entries);
+            if (hits.size > PRUNE_THRESHOLD && now >= nextPruneAt) {
+                prune(cutoff);
+                nextPruneAt = now + policy.windowMs;
+            }
+            return { allowed: true };
+        },
+    };
+}
+export { defineRateLimitPolicy } from "./policy.js";
+//# sourceMappingURL=memory.js.map

package/dist/memory.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory.js","sourceRoot":"","sources":["../src/memory.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAG3C,OAAO,EACL,kBAAkB,EAClB,qBAAqB,EACrB,aAAa,EACb,UAAU,EACV,kBAAkB,GAKnB,MAAM,aAAa,CAAC;AAErB,MAAM,eAAe,GAAG,MAAM,CAAC;AAE/B;;;;;;GAMG;AACH,MAAM,UAAU,mBAAmB,CACjC,WAA4B,EAC5B,OAAO,GAAmB,EAAE;IAE5B,MAAM,MAAM,GAAG,qBAAqB,CAAC,WAAW,CAAC,CAAC;IAClD,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,WAAW,CAAC;IAC3C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAoB,CAAC;IACzC,IAAI,WAAW,GAAG,MAAM,CAAC,iBAAiB,CAAC;IAE3C,SAAS,WAAW,CAAC,OAA0B,EAAE,MAAc;QAC7D,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,MAAM,CAAC,CAAC;IAC7C,CAAC;IAED,SAAS,KAAK,CAAC,MAAc;QAC3B,KAAK,MAAM,CAAC,GAAG,EAAE,OAAO,CAAC,IAAI,IAAI,EAAE,CAAC;YAClC,MAAM,IAAI,GAAG,WAAW,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;YAC1C,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACtB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACnB,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO;QACL,KAAK,CAAC,KAAK,CAAC,GAAW,EAAE,EAAiB;YACxC,kBAAkB,CAAC,GAAG,CAAC,CAAC;YACxB,MAAM,GAAG,GAAG,kBAAkB,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;YAC1C,IAAI,GAAG,KAAK,IAAI,EAAE,CAAC;gBACjB,OAAO,aAAa,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;YACxC,CAAC;YAED,MAAM,MAAM,GAAG,GAAG,GAAG,MAAM,CAAC,QAAQ,CAAC;YACrC,MAAM,OAAO,GAAG,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,MAAM,CAAC,CAAC;YACzD,IAAI,OAAO,CAAC,MAAM,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;gBACnC,OAAO;oBACL,OAAO,EAAE,KAAK;oBACd,UAAU,EAAE,UAAU,CAAE,OAAO,CAAC,CAAC,CAAY,GAAG,MAAM,CAAC,QAAQ,EAAE,GAAG,CAAC;iBACtE,CAAC;YACJ,CAAC;YAED,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAClB,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;YACvB,IAAI,IAAI,CAAC,IAAI,GAAG,eAAe,IAAI,GAAG,IAAI,WAAW,EAAE,CAAC;gBACtD,KAAK,CAAC,MAAM,CAAC,CAAC;gBACd,WAAW,GAAG,GAAG,GAAG,MAAM,CAAC,QAAQ,CAAC;YACtC,CAAC;YACD,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;QAC3B,CAAC;KACF,CAAC;AACJ,CAAC;AAQD,OAAO,EAAE,qBAAqB,EAAE,MAAM,aAAa,CAAC"}

package/dist/policy.d.ts

@@ -0,0 +1,34 @@
+import type { Clock, IsoTimestamp } from "@pegma/spine";
+/** A named rate limit. Durations and retry-after values are milliseconds. */
+export interface RateLimitPolicy {
+    /** Stable configuration name and durable-storage partition. */
+    readonly name: string;
+    /** Number of allowed checks in one window. */
+    readonly limit: number;
+    /** Window duration in milliseconds. */
+    readonly windowMs: number;
+}
+export interface RateLimitDecision {
+    readonly allowed: boolean;
+    /** Milliseconds until this key may be checked again. Present on refusal. */
+    readonly retryAfter?: number;
+}
+export interface RateLimiter {
+    /**
+     * Decides whether `key` may proceed.
+     *
+     * `now` exists for deterministic replay and tests. Normal hosts inject a
+     * Clock at construction and omit it.
+     */
+    allow(key: string, now?: IsoTimestamp): Promise<RateLimitDecision>;
+}
+export interface LimiterOptions {
+    readonly clock?: Clock;
+}
+/** Validates and returns a named policy. */
+export declare function defineRateLimitPolicy(policy: RateLimitPolicy): RateLimitPolicy;
+export declare function assertRateLimitKey(key: string): void;
+export declare function timeInMilliseconds(clock: Clock, now: IsoTimestamp | undefined): number | null;
+export declare function retryAfter(windowEndsAt: number, now: number): number;
+export declare function denyForWindow(windowMs: number): RateLimitDecision;
+//# sourceMappingURL=policy.d.ts.map

package/dist/policy.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"policy.d.ts","sourceRoot":"","sources":["../src/policy.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAExD,6EAA6E;AAC7E,MAAM,WAAW,eAAe;IAC9B,+DAA+D;IAC/D,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,8CAA8C;IAC9C,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,uCAAuC;IACvC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;CAC3B;AAED,MAAM,WAAW,iBAAiB;IAChC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,4EAA4E;IAC5E,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,CAAC;CAC9B;AAED,MAAM,WAAW,WAAW;IAC1B;;;;;OAKG;IACH,KAAK,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,YAAY,GAAG,OAAO,CAAC,iBAAiB,CAAC,CAAC;CACpE;AAED,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC;CACxB;AAkBD,4CAA4C;AAC5C,wBAAgB,qBAAqB,CACnC,MAAM,EAAE,eAAe,GACtB,eAAe,CA0BjB;AAED,wBAAgB,kBAAkB,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI,CAOpD;AAED,wBAAgB,kBAAkB,CAChC,KAAK,EAAE,KAAK,EACZ,GAAG,EAAE,YAAY,GAAG,SAAS,GAC5B,MAAM,GAAG,IAAI,CAcf;AAED,wBAAgB,UAAU,CAAC,YAAY,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAEpE;AAED,wBAAgB,aAAa,CAAC,QAAQ,EAAE,MAAM,GAAG,iBAAiB,CAEjE"}

package/dist/policy.js

@@ -0,0 +1,69 @@
+function isWellFormedUnicode(value) {
+    for (let index = 0; index < value.length; index += 1) {
+        const codeUnit = value.charCodeAt(index);
+        if (codeUnit >= 0xd800 && codeUnit <= 0xdbff) {
+            const next = value.charCodeAt(index + 1);
+            if (!(next >= 0xdc00 && next <= 0xdfff)) {
+                return false;
+            }
+            index += 1;
+        }
+        else if (codeUnit >= 0xdc00 && codeUnit <= 0xdfff) {
+            return false;
+        }
+    }
+    return true;
+}
+/** Validates and returns a named policy. */
+export function defineRateLimitPolicy(policy) {
+    if (typeof policy !== "object" || policy === null || Array.isArray(policy)) {
+        throw new TypeError("A rate-limit policy must be an object.");
+    }
+    const name = Object.getOwnPropertyDescriptor(policy, "name")?.value;
+    const limit = Object.getOwnPropertyDescriptor(policy, "limit")?.value;
+    const windowMs = Object.getOwnPropertyDescriptor(policy, "windowMs")?.value;
+    if (typeof name !== "string" || name.trim().length === 0) {
+        throw new TypeError("A rate-limit policy name must be a non-blank string.");
+    }
+    if (!isWellFormedUnicode(name)) {
+        throw new TypeError("A rate-limit policy name must contain well-formed Unicode.");
+    }
+    if (!Number.isSafeInteger(limit) || limit <= 0) {
+        throw new TypeError("A rate-limit policy limit must be a positive integer.");
+    }
+    if (!Number.isSafeInteger(windowMs) || windowMs <= 0) {
+        throw new TypeError("A rate-limit policy windowMs must be a positive integer.");
+    }
+    return Object.freeze({ name, limit, windowMs });
+}
+export function assertRateLimitKey(key) {
+    if (typeof key !== "string" || key.trim().length === 0) {
+        throw new TypeError("A rate-limit key must be a non-blank string.");
+    }
+    if (!isWellFormedUnicode(key)) {
+        throw new TypeError("A rate-limit key must contain well-formed Unicode.");
+    }
+}
+export function timeInMilliseconds(clock, now) {
+    try {
+        const timestamp = now ?? clock.now();
+        if (typeof timestamp !== "string") {
+            return null;
+        }
+        const milliseconds = Date.parse(timestamp);
+        return Number.isFinite(milliseconds) &&
+            new Date(milliseconds).toISOString() === timestamp
+            ? milliseconds
+            : null;
+    }
+    catch {
+        return null;
+    }
+}
+export function retryAfter(windowEndsAt, now) {
+    return Math.max(1, Math.ceil(windowEndsAt - now));
+}
+export function denyForWindow(windowMs) {
+    return { allowed: false, retryAfter: windowMs };
+}
+//# sourceMappingURL=policy.js.map

package/dist/policy.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"policy.js","sourceRoot":"","sources":["../src/policy.ts"],"names":[],"mappings":"AAgCA,SAAS,mBAAmB,CAAC,KAAa;IACxC,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,KAAK,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;QACrD,MAAM,QAAQ,GAAG,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACzC,IAAI,QAAQ,IAAI,MAAM,IAAI,QAAQ,IAAI,MAAM,EAAE,CAAC;YAC7C,MAAM,IAAI,GAAG,KAAK,CAAC,UAAU,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;YACzC,IAAI,CAAC,CAAC,IAAI,IAAI,MAAM,IAAI,IAAI,IAAI,MAAM,CAAC,EAAE,CAAC;gBACxC,OAAO,KAAK,CAAC;YACf,CAAC;YACD,KAAK,IAAI,CAAC,CAAC;QACb,CAAC;aAAM,IAAI,QAAQ,IAAI,MAAM,IAAI,QAAQ,IAAI,MAAM,EAAE,CAAC;YACpD,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,4CAA4C;AAC5C,MAAM,UAAU,qBAAqB,CACnC,MAAuB;IAEvB,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QAC3E,MAAM,IAAI,SAAS,CAAC,wCAAwC,CAAC,CAAC;IAChE,CAAC;IACD,MAAM,IAAI,GAAG,MAAM,CAAC,wBAAwB,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,KAAK,CAAC;IACpE,MAAM,KAAK,GAAG,MAAM,CAAC,wBAAwB,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,KAAK,CAAC;IACtE,MAAM,QAAQ,GAAG,MAAM,CAAC,wBAAwB,CAAC,MAAM,EAAE,UAAU,CAAC,EAAE,KAAK,CAAC;IAC5E,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzD,MAAM,IAAI,SAAS,CAAC,sDAAsD,CAAC,CAAC;IAC9E,CAAC;IACD,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,EAAE,CAAC;QAC/B,MAAM,IAAI,SAAS,CACjB,4DAA4D,CAC7D,CAAC;IACJ,CAAC;IACD,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;QAC/C,MAAM,IAAI,SAAS,CACjB,uDAAuD,CACxD,CAAC;IACJ,CAAC;IACD,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,QAAQ,CAAC,IAAI,QAAQ,IAAI,CAAC,EAAE,CAAC;QACrD,MAAM,IAAI,SAAS,CACjB,0DAA0D,CAC3D,CAAC;IACJ,CAAC;IACD,OAAO,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC;AAClD,CAAC;AAED,MAAM,UAAU,kBAAkB,CAAC,GAAW;IAC5C,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvD,MAAM,IAAI,SAAS,CAAC,8CAA8C,CAAC,CAAC;IACtE,CAAC;IACD,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,EAAE,CAAC;QAC9B,MAAM,IAAI,SAAS,CAAC,oDAAoD,CAAC,CAAC;IAC5E,CAAC;AACH,CAAC;AAED,MAAM,UAAU,kBAAkB,CAChC,KAAY,EACZ,GAA6B;IAE7B,IAAI,CAAC;QACH,MAAM,SAAS,GAAG,GAAG,IAAI,KAAK,CAAC,GAAG,EAAE,CAAC;QACrC,IAAI,OAAO,SAAS,KAAK,QAAQ,EAAE,CAAC;YAClC,OAAO,IAAI,CAAC;QACd,CAAC;QACD,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QAC3C,OAAO,MAAM,CAAC,QAAQ,CAAC,YAAY,CAAC;YAClC,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,WAAW,EAAE,KAAK,SAAS;YAClD,CAAC,CAAC,YAAY;YACd,CAAC,CAAC,IAAI,CAAC;IACX,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED,MAAM,UAAU,UAAU,CAAC,YAAoB,EAAE,GAAW;IAC1D,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,YAAY,GAAG,GAAG,CAAC,CAAC,CAAC;AACpD,CAAC;AAED,MAAM,UAAU,aAAa,CAAC,QAAgB;IAC5C,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,QAAQ,EAAE,CAAC;AAClD,CAAC"}

package/package.json

@@ -0,0 +1,48 @@
+{
+  "name": "@pegma/rate-limit",
+  "version": "0.0.0",
+  "description": "Explicit per-instance sliding-window and shared durable fixed-window rate limiters.",
+  "license": "MIT",
+  "type": "module",
+  "sideEffects": false,
+  "publishConfig": {
+    "access": "public"
+  },
+  "files": [
+    "dist/**/*.d.ts",
+    "dist/**/*.d.ts.map",
+    "dist/**/*.js",
+    "dist/**/*.js.map"
+  ],
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "import": "./dist/index.js"
+    },
+    "./memory": {
+      "types": "./dist/memory.d.ts",
+      "import": "./dist/memory.js"
+    },
+    "./durable": {
+      "types": "./dist/durable.d.ts",
+      "import": "./dist/durable.js"
+    }
+  },
+  "engines": {
+    "node": ">=22"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/pegma-dev/rate-limit.git",
+    "directory": "packages/rate-limit"
+  },
+  "dependencies": {
+    "@pegma/spine": "0.1.1",
+    "@pegma/storage-core": "0.3.0"
+  },
+  "scripts": {
+    "build": "tsc -p tsconfig.json",
+    "check": "tsc -p tsconfig.json --noEmit",
+    "prepack": "npm run build"
+  }
+}