@crewhaus/tool-money 0.7.0 → 0.8.0

package/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/NOTICE

@@ -0,0 +1,9 @@
+CrewHaus Factory
+Copyright 2026 Max Meier
+
+This product includes software developed by Max Meier
+(operating as StudioMax — https://studiomax.io) and contributors.
+
+The CrewHaus name and logo are trademarks of Max Meier. See
+https://github.com/crewhaus/factory/blob/main/TRADEMARK.md for the
+use-of-marks policy.

package/README.md

@@ -27,6 +27,20 @@ Cents, pence, yen. Floating point produces totals that do not add up, and
 that fails reconciliation. Every amount in and out of these tools is an
 integer, and the schemas reject anything else.
 
+An amount must also be one a JSON number holds exactly: at most 2^53 − 1
+minor units (about 90 trillion dollars in cents). A larger one has already
+been rounded by the time it arrives, so it is refused, with a pointer to a
+larger unit. Inside, the arithmetic is exact however large the intermediate
+products get — a tax rate times an amount passes 2^53 long before the amount
+does — and a total that would itself pass the limit is refused by name
+rather than reported a unit off. `PurchaseOrderMatch` takes fractional
+quantities (kilograms, hours) and compares them as the decimals written; its
+exposure figures are computed exactly and rounded to whole minor units, half
+away from zero. `StatementParse` reads amounts out of a
+file, so an amount there past the limit is a rejected row that says so, and a
+total past it comes back `null` with `totalsUnavailable` saying which; the
+transactions themselves are unaffected.
+
 Splitting is largest-remainder, so the parts always sum to the whole. 100
 cents three ways is 34, 33, 33 — never 33, 33, 33 with a cent unaccounted
 for. A full return refunds exactly what was charged, and a lot's partial
@@ -54,11 +68,18 @@ wrong side of a year boundary depending on the machine.
 
 ## Controls, not suggestions
 
-`SpendLimitCheck` is the gate an unattended harness consults before moving
-money. A limit a model is asked to respect is a suggestion; a limit computed
-from the record of what has already been spent is a limit. It reports every
-limit a payment breaks rather than the first, and the headroom that would
-pass.
+`SpendLimitCheck` applies velocity, counterparty and quiet-hours limits to a
+proposed payment, the same way every time, and reports every limit it breaks
+rather than the first, plus the headroom that would pass. It computes over the
+history, the limits and the clock it is given, and enforces nothing by
+itself: when a model supplies those, the verdict is advisory — a model that
+would move money past a limit can equally leave out the history or skip the
+check. So a limit that must hold belongs where the model cannot edit it: in
+the policy of the tool that moves the money (for `EvmSendTransaction`, the
+spec's `transaction_policy`). The result says which clock it used (`clock`),
+and `now` — on this tool, `RefundAbuseCheck` and `WebhookSignatureVerify` —
+is for tests and replays only: it replaces the real clock, and every time
+window, a webhook's replay tolerance included, moves with it.
 
 When `knownCounterparties` is declared, that list **is** the allow-list, and
 payment history does not extend it. Treating anyone previously paid as known

package/dist/index.js

@@ -14,12 +14,12 @@
  * Nothing here moves money, reaches a payment provider, or decides that
  * somebody is committing fraud. It computes, checks and reports.
  */
-import { readFileSync, statSync } from "node:fs";
 import { buildTool } from "@crewhaus/tool-builder";
-import { ASSERT_OPS } from "@crewhaus/tool-schema";
+import { openForRead } from "@crewhaus/tool-safety/fs";
+import { ASSERT_OPS, regexRunContext } from "@crewhaus/tool-schema";
 import { z } from "zod";
 import { SHIPPING_POLICIES, computeRefund, } from "./lib/allocate";
-import { codeLines } from "./lib/coding";
+import { codeLinesAnsweringPatterns } from "./lib/coding";
 import { checkSpendLimit, refundAbuseSignals } from "./lib/controls";
 import { IDENTIFIER_KINDS, detectKind, validateIdentifier, } from "./lib/identifiers";
 import { LOT_METHODS, computeCostBasis } from "./lib/lots";
@@ -27,7 +27,7 @@ import { matchInvoiceToPurchaseOrder } from "./lib/match";
 import { DATE_ORDERS, STATEMENT_FORMATS, parseStatement } from "./lib/statement";
 import { ROUNDING_MODES, ROUNDING_SCOPES, calculateTax } from "./lib/tax";
 import { verifyWebhookSignature } from "./lib/webhook";
-import { resolveSafe } from "./paths";
+import { resolveSafe, workspaceRoot } from "./paths";
 const json = (value) => JSON.stringify(value);
 const LIMITS = {
     lines: 5_000,
@@ -44,7 +44,17 @@ const checkSchema = z.object({
     flags: z.string().optional(),
     message: z.string().optional(),
 });
-const minorUnits = z.number().int();
+/**
+ * An amount in minor units: an integer a double holds exactly. Past 2^53 − 1
+ * a JSON number has already been rounded before the tool sees it, so it is
+ * refused rather than computed with.
+ */
+const UNSAFE_AMOUNT = "is past ±(2^53 − 1) minor units, the largest amount computed exactly — express it in a larger unit";
+const minorUnits = z
+    .number()
+    .int()
+    .min(Number.MIN_SAFE_INTEGER, UNSAFE_AMOUNT)
+    .max(Number.MAX_SAFE_INTEGER, UNSAFE_AMOUNT);
 /**
  * An instant, as epoch milliseconds or ISO-8601 WITH an offset.
  *
@@ -67,6 +77,13 @@ function parseInstant(value, field) {
     return parsed;
 }
 const instantField = z.union([z.string(), z.number()]);
+/**
+ * The `now` a caller may pass. It replaces the real clock, which moves every
+ * time window with it — the spend windows, the quiet hours, a webhook's
+ * replay tolerance — so it is for tests and replays of a recorded event, not
+ * for a live decision.
+ */
+const CLOCK_OVERRIDE = "tests and replays only; omit it for a live decision — it replaces the real clock, and every time window moves with it";
 // ---------------------------------------------------------------------------
 export const paymentIdentifierValidate = buildTool({
     name: "PaymentIdentifierValidate",
@@ -138,7 +155,7 @@ export const refundAmountCompute = buildTool({
         lines: z
             .array(z.object({
             id: z.string().min(1),
-            quantity: z.number().int().positive(),
+            quantity: z.number().int().positive().max(Number.MAX_SAFE_INTEGER),
             unitPriceMinor: minorUnits,
             taxMinor: minorUnits.optional(),
             discountMinor: minorUnits.optional(),
@@ -146,7 +163,10 @@ export const refundAmountCompute = buildTool({
             .min(1)
             .max(LIMITS.lines),
         returned: z
-            .array(z.object({ lineId: z.string().min(1), quantity: z.number().int().positive() }))
+            .array(z.object({
+            lineId: z.string().min(1),
+            quantity: z.number().int().positive().max(Number.MAX_SAFE_INTEGER),
+        }))
             .min(1)
             .max(LIMITS.lines),
         orderDiscountMinor: minorUnits.optional(),
@@ -234,7 +254,7 @@ export const costBasisCompute = buildTool({
 });
 export const spendLimitCheck = buildTool({
     name: "SpendLimitCheck",
-    description: "Decide whether a proposed payment fits inside the operator's velocity, counterparty and quiet-hours limits, given what has already been spent. Use it as the gate an unattended harness actually consults before moving money: a limit a model is asked to respect is a suggestion, while one computed from the record of prior spend is a limit. It reports every limit the payment breaks rather than the first, and the headroom that would pass.",
+    description: "Check a proposed payment against velocity, counterparty and quiet-hours limits, given the payments already made, and report every limit it breaks rather than the first, plus the headroom that would pass. Use it to apply the same limits the same way every time: the window arithmetic is exact and repeatable. It computes over the history, the limits and the clock passed in, and enforces nothing by itself — when the caller writes those inputs the verdict is advisory, so a limit that must hold belongs where the caller cannot edit it: in the policy of the tool that moves the money, such as transaction_policy for EvmSendTransaction.",
     inputSchema: z.object({
         proposed: z.object({ amountMinor: minorUnits, counterparty: z.string().optional() }),
         history: z
@@ -256,13 +276,18 @@ export const spendLimitCheck = buildTool({
             knownCounterpartiesOnly: z.boolean().optional(),
             knownCounterparties: z.array(z.string()).max(10_000).optional(),
         }),
-        now: instantField.optional().describe("overrides the real clock, for tests and replays"),
+        now: instantField.optional().describe(CLOCK_OVERRIDE),
     }),
     readOnly: true,
     concurrencySafe: true,
     execute: async (input) => {
         const nowMs = input.now === undefined ? Date.now() : parseInstant(input.now, "now");
-        return json(checkSpendLimit(input.proposed, input.history, input.limits, nowMs));
+        return json({
+            ...checkSpendLimit(input.proposed, input.history, input.limits, nowMs),
+            // Said in the payload, where whoever acts on the verdict reads it.
+            clock: input.now === undefined ? "runtime" : "caller-supplied",
+            basis: "the history and limits passed in this call; this verdict is only as binding as the record they came from",
+        });
     },
 });
 export const refundAbuseCheck = buildTool({
@@ -287,7 +312,7 @@ export const refundAbuseCheck = buildTool({
             refundCount: z.number().int().nonnegative().optional(),
         })
             .optional(),
-        now: instantField.optional(),
+        now: instantField.optional().describe(CLOCK_OVERRIDE),
     }),
     readOnly: true,
     concurrencySafe: true,
@@ -311,7 +336,7 @@ export const webhookSignatureVerify = buildTool({
             .describe("NAME of the environment variable holding the signing secret, never the secret"),
         toleranceSeconds: z.number().int().positive().max(86_400).optional().describe("default 300"),
         scheme: z.string().optional().describe("default v1"),
-        now: instantField.optional(),
+        now: instantField.optional().describe(CLOCK_OVERRIDE),
     }),
     readOnly: true,
     concurrencySafe: true,
@@ -370,18 +395,33 @@ export const statementParse = buildTool({
             .positive()
             .max(20_000)
             .optional()
-            .describe("cap the returned list; default 500"),
+            .describe("cap the returned transaction and rejected lists; default 500"),
     }),
     readOnly: true,
     concurrencySafe: true,
     execute: async (input) => {
         const at = resolveSafe("StatementParse", input.file);
-        const size = statSync(at.real).size;
-        if (size > LIMITS.statementBytes) {
-            throw new Error(`${at.rel} is ${size} bytes, over the ${LIMITS.statementBytes}-byte limit`);
+        // Opened without blocking and only as a regular file: a FIFO with no
+        // writer blocks an ordinary open for ever, and the read here was
+        // synchronous, so a named pipe in the workspace stopped the whole
+        // harness. The byte limit is enforced while reading, not by a size the
+        // file reported before it was opened.
+        const read = await openForRead(workspaceRoot(), input.file, {
+            maxBytes: LIMITS.statementBytes,
+        });
+        if (!read.ok)
+            throw new Error(`StatementParse: ${read.reason}`);
+        if (read.truncated) {
+            throw new Error(`StatementParse: ${JSON.stringify(input.file)} is over the ${LIMITS.statementBytes}-byte limit, so it was not read`);
         }
-        const result = parseStatement(readFileSync(at.real, "utf-8"), input);
         const limit = input.limit ?? 500;
+        // Only what is returned is held: the counts and the totals still cover
+        // every row, but a file of a million unreadable blocks is not a million
+        // objects in memory on the way to showing five hundred of them.
+        const result = parseStatement(read.text, {
+            ...input,
+            keep: { transactions: limit, rejected: limit },
+        });
         return json({
             file: at.rel,
             format: result.format,
@@ -390,8 +430,14 @@ export const statementParse = buildTool({
             totalMinor: result.totalMinor,
             debitMinor: result.debitMinor,
             creditMinor: result.creditMinor,
+            // Set, with the reason, when a total is past what a number holds exactly.
+            ...(result.totalsUnavailable === null ? {} : { totalsUnavailable: result.totalsUnavailable }),
+            // Capped like the transactions: a file of nothing but unreadable rows
+            // would otherwise come back as one reason per row, whatever its size.
             rejected: result.rejected,
-            transactions: result.transactions.slice(0, limit),
+            rejectedCount: result.rejectedCount,
+            rejectedTruncated: result.rejectedCount > limit,
+            transactions: result.transactions,
             truncated: result.count > limit,
         });
     },
@@ -424,10 +470,17 @@ export const glCodeSuggest = buildTool({
     }),
     readOnly: true,
     concurrencySafe: true,
-    execute: async (input) => json(codeLines(input.lines, input.rules, {
-        version: input.version,
-        defaultAccount: input.defaultAccount,
-    })),
+    execute: async (input, ctx) => {
+        // `matches` patterns run in the regex worker, before the rules are read,
+        // a chunk of lines at a time: a pattern that cannot be run to an answer
+        // is undetermined, and the line goes to review rather than to a
+        // lower-priority rule.
+        return json(await codeLinesAnsweringPatterns(input.lines, input.rules, {
+            version: input.version,
+            defaultAccount: input.defaultAccount,
+            run: regexRunContext(ctx),
+        }));
+    },
 });
 /**
  * The normalized statement row, and the parser that produces it.

package/dist/lib/allocate.d.ts

@@ -18,6 +18,13 @@
  * dropped, since dropping it would silently lose the money.
  */
 export declare function allocateProportional(totalMinor: number, weights: ReadonlyArray<number>): number[];
+/**
+ * {@link allocateProportional} in exact integers. Each share's exact value is
+ * a quotient and a remainder over the weights' sum, so the largest remainders
+ * are compared exactly: a double's `magnitude × weight` passes 2^53 on an
+ * ordinary invoice's cents times its lines' values.
+ */
+export declare function allocateExact(total: bigint, weights: ReadonlyArray<bigint>): bigint[];
 export type OrderLine = {
     readonly id: string;
     readonly quantity: number;