@mikeargento/bitgraph 1.1.0

package/LICENSE

@@ -0,0 +1,9 @@
+Copyright (c) 2024-2026 Mike Argento. All rights reserved.
+
+The source code and related materials in this repository are proprietary and are not licensed for copying, modification, distribution, sublicensing, or commercial use except pursuant to a separate written agreement with the copyright owner or as expressly granted below.
+
+Verification grant. Permission is granted, free of charge and irrevocably, to any person obtaining a copy of this software, to copy, build, and run the software solely for the purposes of verifying BitGraph proofs and of reproducing and auditing the published enclave measurements. This permission does not extend to constructing proofs, operating a proof-issuing service, or any other use.
+
+Certain prior versions of this software were distributed under the Apache License, Version 2.0. Nothing in this notice is intended to revoke rights validly granted with respect to those prior versions.
+
+Patent pending. Verification of BitGraph proofs is and remains permissionless.

package/NOTICE

@@ -0,0 +1,14 @@
+BitGraph
+Copyright 2024-2026 Mike Argento
+
+This product includes software from the following third-party projects:
+
+@noble/ed25519
+  Copyright (c) 2019 Paul Miller (https://paulmillr.com)
+  License: MIT
+  https://github.com/paulmillr/noble-ed25519
+
+@noble/hashes
+  Copyright (c) 2022 Paul Miller (https://paulmillr.com)
+  License: MIT
+  https://github.com/paulmillr/noble-hashes

package/README.md

@@ -0,0 +1,175 @@
+# BitGraph
+
+**Portable cryptographic proof of construction for digital artifacts.**
+
+[![npm @mikeargento/bitgraph](https://img.shields.io/npm/v/@mikeargento/bitgraph?label=%40mikeargento%2Fbitgraph&color=cb3837)](https://www.npmjs.com/package/@mikeargento/bitgraph)
+[![Website](https://img.shields.io/badge/bitgraph.ing-live-0065A4)](https://bitgraph.ing)
+[![Docs](https://img.shields.io/badge/docs-0065A4)](https://bitgraph.ing/docs)
+
+---
+
+Just as a photograph captures photons through the constraint of a single frame of film, a BitGraph captures bits through the constraint of a single mathematical slot.
+
+Origin can be enforced or it can be claimed. Most digital provenance systems claim it. They produce an artifact and then attach a signature, a timestamp, or a metadata block describing where the artifact came from. The claim arrives after the artifact already exists, which is the wrong end of the timeline.
+
+BitGraph enforces origin. A measured trusted execution environment creates an unpredictable cryptographic slot before the artifact's hash is known. The artifact's hash arrives later and is bound into the slot. The slot is consumed and cannot be reused. What emerges is not a description of provenance but a proof of construction.
+
+> This exact digital state was committed through this measured process, in this order, under these constraints.
+
+## The primitive
+
+Nonce first. Hash second. Atomic binding third.
+
+The TEE generates hardware entropy inside the enclave. That entropy becomes a slot, signed with the enclave's key, with an identity no attacker could have precomputed. The slot exists as a cryptographic object before any artifact hash has been seen.
+
+The artifact hash arrives. The TEE binds the hash into the slot, signs the binding, and advances its internal order. The slot becomes consumed.
+
+> UNUSED slot exists first. Artifact hash enters later. TEE binds the hash to the slot. Slot becomes CONSUMED. Proof travels with the artifact.
+
+The atomicity is the whole guarantee. The slot is allocated and signed before the hash is known. The slot can be consumed exactly once by a single binding operation. The artifact itself can be produced anywhere, by any process, using any tools. What matters is that when the hash arrives, the slot is already there waiting.
+
+Most systems say: "Here is a file hash. Now let's sign it." BitGraph says: "Here is a pre-existing origin slot. Now this file hash has occupied it."
+
+## Why nonce-first matters
+
+If a nonce, timestamp, or credential is added after the hash is already witnessed, it is just a label. It can prove someone signed something. It can prove a record existed by some moment. It cannot constrain the artifact's origin, because the artifact already existed before the nonce entered the picture.
+
+That leaves a forgery window. A malicious actor can prepare old hashes, replay prior material, backfill records, or attach fresh randomness to something never produced through the claimed path. The label looks valid. The construction was never constrained.
+
+BitGraph closes the window by requiring the slot to exist first. The slot is not evidence added afterward. It is the condition the artifact must satisfy.
+
+## What a BitGraph proof contains
+
+A BitGraph proof is a portable proof object, typically JSON, that travels with the artifact. It can include:
+
+| Component | Purpose |
+|---|---|
+| Artifact hash | Identifies the exact file or digital state |
+| Nonce | The pre-existing causal slot |
+| Slot counter | Shows the slot was allocated before the commit |
+| Commit counter | Shows the artifact consumed the slot later |
+| Epoch ID | Groups an ordered run of commitments |
+| Previous hash link | Connects proofs into a chain |
+| Signer public key | Identifies the proof-signing authority |
+| Signature | Verifies the proof was issued by the enclave-controlled key |
+| TEE measurement | Shows what code and environment produced the proof |
+| Attestation | Shows the proof came from measured hardware |
+| Public anchor | Tethers BitGraph logical time to a public reference |
+
+The result is not "a file was signed." It is: this hash was committed into this causal slot, by this measured environment, at this position in logical order, under this signing identity.
+
+## Logical time
+
+Every proof has order. Every slot and commit has a position. The system can prove that this happened after that, that this slot existed before this hash was bound, that this proof came before the next, that this epoch has an internal cryptographic history.
+
+BitGraph proves causal order first. Clock time is optional.
+
+## Ethereum: the backward seal
+
+BitGraph's internal ordering does not require Ethereum. The chain creates internal order through slot allocation, consumption, counters, signatures, and chained proof history. Ethereum anchors add a different property on top: a public backward seal that any third party can independently verify.
+
+An Ethereum block hash that becomes available after the artifact has been committed could not have been known at the moment of commitment. This produces an entropy sandwich:
+
+1. Private TEE entropy before the artifact.
+2. Artifact commitment in the middle.
+3. Public blockchain entropy after it.
+
+The artifact was committed after the TEE-created slot existed and before the later Ethereum block was knowable. That bounds the commitment in adversary-resistant entropy, witnessed in a public timeline anyone can check years later.
+
+Ethereum is not asked to prove the artifact's origin. BitGraph does that. Ethereum provides the backward seal that makes the commitment publicly verifiable.
+
+## Multi-TEE breach detection
+
+BitGraph's architecture supports running three independent TEEs in parallel as a tripwire, not a consensus system. Three TEEs witness the same input and produce three individual proofs with different nonces, signatures, and attestations. They agree on the meaningful result: same artifact hash, same policy decision, valid measurements, valid signatures, expected ordering behavior.
+
+If one diverges, the system does not need to know which one is compromised. It only needs to know something is wrong. The batch is quarantined, the affected range is marked suspect, the epoch is rotated, and downstream verification accounts for the gap.
+
+This is not "trust this TEE forever." It is: compromise is assumed, silence is what gets eliminated.
+
+## The trust model
+
+BitGraph does not depend on blind trust in any single component. Not the operator, the TEE, Ethereum, the clock, a certificate authority, or a live server. Each layer adds an independently verifiable property.
+
+| Layer | What it contributes |
+|---|---|
+| TEE | Measured execution and protected key use |
+| Nonce-first slot | Causal precondition |
+| Atomic binding | Prevents post-hoc attachment |
+| Counters | Internal logical order |
+| Proof chain | Historical continuity |
+| Ethereum anchor | Public backward seal |
+| Multi-TEE redundancy | Breach visibility |
+| Epoch rotation | Damage containment |
+| Portable verification | Independence from the original server |
+
+## What BitGraph applies to
+
+BitGraph works on any digital state that can be hashed. The same primitive applies whether the artifact is a photograph, a contract, a model output, a dataset, or a software release.
+
+**Media.** Photos, videos, audio, edited files, generative outputs. The question shifts from "is this real?" to "what origin path does this artifact satisfy?"
+
+**AI outputs.** Model results bound to authenticated identity and causal position without requiring the model to run inside an enclave.
+
+**Software supply chain.** Build artifacts, releases, model weights, and deployment packages bound to a measured construction path.
+
+**Legal and clinical records.** Contracts, filings, telehealth session manifests, lab results, and consent forms with independently verifiable causal ordering.
+
+**Research and IP.** Datasets, experimental outputs, and possession proofs that commit to a hash without requiring the file to leave the user's device.
+
+## How BitGraph differs from existing approaches
+
+BitGraph is often confused with adjacent systems. The differences are structural:
+
+| System | Says | BitGraph says |
+|---|---|---|
+| Signatures | This key signed this data | This key was controlled by a measured environment that consumed an unused slot |
+| Timestamps | This hash existed by time T | This hash consumed a pre-existing slot at this position in causal order |
+| C2PA | Here are signed claims about this content | Here is the construction path this content satisfied |
+| Blockchains | Public ordering of shared transactions | Private origin coordinates with optional public anchoring |
+
+Signatures, timestamps, content credentials, and blockchains all answer "who claimed what, when?" BitGraph answers "what construction path did this exact artifact satisfy?" They are complementary, not competing. A signature can be inside a BitGraph proof. A timestamp can decorate one. Content credentials can ride alongside one. None of them, alone, do what BitGraph does.
+
+## Multiple copies of the same original
+
+Physical originality depends on singularity. There is one canvas, one negative, one signed paper. Digital files broke that because perfect copies are indistinguishable from the source.
+
+BitGraph introduces a different category. A digital artifact can be copied without losing its original provenance. The proof travels with the bytes or alongside them. Instead of every copy being a degraded copy, BitGraph allows multiple copies of the same original. Originality moves from physical container to causal proof. Singularity is no longer required for originality.
+
+## The simplest version
+
+A measured TEE creates a random unused slot before the artifact hash arrives. The hash arrives. The TEE binds it to the slot, consumes the slot, signs the result, and links it into an ordered chain. Three TEEs can run in parallel so silent compromise becomes visible. The same mechanism periodically commits an Ethereum block hash, sealing everything before it in a public timeline.
+
+The result is a provenance system that does not say "someone signed this." It says: this exact artifact occupied this origin coordinate.
+
+---
+
+## Quickstart
+
+Try it live: drop a file at [bitgraph.ing](https://bitgraph.ing). The file never leaves your device; only its SHA-256 hash is sent to the enclave.
+
+Verify a proof in code:
+
+```bash
+npm install @mikeargento/bitgraph
+```
+
+```ts
+import { verify } from "@mikeargento/bitgraph";
+
+const result = await verify({ proof, bytes });
+if (result.ok) {
+  // signature, slot binding, attestation, and chain link all checked
+}
+```
+
+See [bitgraph.ing/docs](https://bitgraph.ing/docs) for the full proof format, verification checklist, attestation handling, and self-host instructions.
+
+## License
+
+Copyright 2024-2026 Mike Argento. All rights reserved. Patent Pending.
+
+This repository is source-available, not open-source. The code is published so anyone can read, audit, and reproduce the enclave build, but it is proprietary: copying, modification, distribution, and commercial use require a separate written agreement with the copyright owner. See [LICENSE](LICENSE).
+
+Certain prior versions were distributed under the Apache License, Version 2.0; rights validly granted with respect to those prior versions are not affected.
+
+Verification of BitGraph proofs is and remains permissionless. Anyone can verify a proof without asking permission: the standalone verifier is published as [@mikeargento/bitgraph-verify](https://www.npmjs.com/package/@mikeargento/bitgraph-verify) under the MIT license, and the [LICENSE](LICENSE) here additionally grants express, irrevocable permission to copy, build, and run this repository's code for verifying proofs and for reproducing and auditing the published enclave measurements.

package/dist/__tests__/canonical.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=canonical.test.d.ts.map

package/dist/__tests__/canonical.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"canonical.test.d.ts","sourceRoot":"","sources":["../../src/__tests__/canonical.test.ts"],"names":[],"mappings":""}

package/dist/__tests__/canonical.test.js

@@ -0,0 +1,162 @@
+// Copyright (c) Mike Argento. All rights reserved. See LICENSE.
+import { describe, test } from "node:test";
+import * as assert from "node:assert/strict";
+import { canonicalize, canonicalizeToString, constantTimeEqual, } from "../index.js";
+// ---------------------------------------------------------------------------
+// canonicalizeToString
+// ---------------------------------------------------------------------------
+describe("canonicalizeToString", () => {
+    // Primitives
+    test("null", () => assert.equal(canonicalizeToString(null), "null"));
+    test("true", () => assert.equal(canonicalizeToString(true), "true"));
+    test("false", () => assert.equal(canonicalizeToString(false), "false"));
+    test("integer", () => assert.equal(canonicalizeToString(42), "42"));
+    test("float", () => assert.equal(canonicalizeToString(3.14), "3.14"));
+    test("negative", () => assert.equal(canonicalizeToString(-1), "-1"));
+    test("zero", () => assert.equal(canonicalizeToString(0), "0"));
+    test("string", () => assert.equal(canonicalizeToString("hello"), '"hello"'));
+    test("empty string", () => assert.equal(canonicalizeToString(""), '""'));
+    // Object key ordering
+    test("sorts keys lexicographically", () => {
+        assert.equal(canonicalizeToString({ z: 1, a: 2, m: 3 }), '{"a":2,"m":3,"z":1}');
+    });
+    test("uppercase sorts before lowercase (Unicode code-point order)", () => {
+        assert.equal(canonicalizeToString({ b: 2, A: 1 }), '{"A":1,"b":2}');
+    });
+    test("sorts nested object keys recursively", () => {
+        assert.equal(canonicalizeToString({ outer: { z: 1, a: 2 }, b: 3 }), '{"b":3,"outer":{"a":2,"z":1}}');
+    });
+    test("empty object", () => assert.equal(canonicalizeToString({}), "{}"));
+    test("same output regardless of insertion order", () => {
+        const a = { z: 1, a: 2 };
+        const b = { a: 2, z: 1 };
+        assert.equal(canonicalizeToString(a), canonicalizeToString(b));
+    });
+    // Arrays
+    test("preserves array element order", () => {
+        assert.equal(canonicalizeToString([3, 1, 2]), "[3,1,2]");
+    });
+    test("sorts keys inside array elements", () => {
+        assert.equal(canonicalizeToString([{ b: 2, a: 1 }]), '[{"a":1,"b":2}]');
+    });
+    test("empty array", () => assert.equal(canonicalizeToString([]), "[]"));
+    test("nested arrays preserve order", () => {
+        assert.equal(canonicalizeToString([[1, 2], [3, 4]]), "[[1,2],[3,4]]");
+    });
+    // Undefined handling
+    test("skips undefined values in objects", () => {
+        const obj = { a: 1, c: 3 };
+        obj["b"] = undefined;
+        assert.equal(canonicalizeToString(obj), '{"a":1,"c":3}');
+    });
+    // Rejection of non-serializable types
+    test("throws TypeError for undefined", () => {
+        assert.throws(() => canonicalizeToString(undefined), TypeError);
+    });
+    test("throws TypeError for function", () => {
+        assert.throws(() => canonicalizeToString((() => { })), TypeError);
+    });
+    test("throws TypeError for symbol", () => {
+        assert.throws(() => canonicalizeToString(Symbol("x")), TypeError);
+    });
+    test("throws TypeError for BigInt", () => {
+        assert.throws(() => canonicalizeToString(BigInt(42)), TypeError);
+    });
+    test("throws TypeError for BigInt inside object", () => {
+        assert.throws(() => canonicalizeToString({ n: BigInt(1) }), TypeError);
+    });
+    // NaN / Infinity → null (standard JSON.stringify behavior)
+    test("NaN serializes as null", () => {
+        assert.equal(canonicalizeToString(NaN), "null");
+    });
+    test("Infinity serializes as null", () => {
+        assert.equal(canonicalizeToString(Infinity), "null");
+    });
+    test("-Infinity serializes as null", () => {
+        assert.equal(canonicalizeToString(-Infinity), "null");
+    });
+    // Determinism
+    test("is deterministic across repeated calls", () => {
+        const obj = { c: 3, b: 2, a: 1 };
+        assert.equal(canonicalizeToString(obj), canonicalizeToString(obj));
+    });
+});
+// ---------------------------------------------------------------------------
+// canonicalize
+// ---------------------------------------------------------------------------
+describe("canonicalize", () => {
+    test("returns a Uint8Array", () => {
+        assert.ok(canonicalize({}) instanceof Uint8Array);
+    });
+    test("UTF-8 encodes the canonical JSON string", () => {
+        const bytes = canonicalize({ hello: "world" });
+        assert.equal(new TextDecoder().decode(bytes), '{"hello":"world"}');
+    });
+    test("matches TextEncoder(canonicalizeToString(obj))", () => {
+        const obj = { z: 1, a: 2 };
+        const bytes = canonicalize(obj);
+        const str = canonicalizeToString(obj);
+        assert.deepEqual(bytes, new TextEncoder().encode(str));
+    });
+    test("empty object → two bytes ('{' and '}')", () => {
+        assert.deepEqual(canonicalize({}), new TextEncoder().encode("{}"));
+    });
+    test("large payload round-trips through canonicalizeToString", () => {
+        const large = {};
+        for (let i = 0; i < 1000; i++)
+            large[`key_${i}`] = i;
+        const bytes = canonicalize(large);
+        const str = canonicalizeToString(large);
+        assert.deepEqual(bytes, new TextEncoder().encode(str));
+    });
+    test("throws TypeError for BigInt nested inside object", () => {
+        assert.throws(() => canonicalize({ n: BigInt(1) }), TypeError);
+    });
+});
+// ---------------------------------------------------------------------------
+// constantTimeEqual
+// ---------------------------------------------------------------------------
+describe("constantTimeEqual", () => {
+    test("equal non-empty arrays", () => {
+        assert.equal(constantTimeEqual(new Uint8Array([1, 2, 3]), new Uint8Array([1, 2, 3])), true);
+    });
+    test("different content same length", () => {
+        assert.equal(constantTimeEqual(new Uint8Array([1, 2, 3]), new Uint8Array([1, 2, 4])), false);
+    });
+    test("different lengths", () => {
+        assert.equal(constantTimeEqual(new Uint8Array([1, 2, 3]), new Uint8Array([1, 2])), false);
+    });
+    test("empty arrays are equal", () => {
+        assert.equal(constantTimeEqual(new Uint8Array([]), new Uint8Array([])), true);
+    });
+    test("empty vs non-empty", () => {
+        assert.equal(constantTimeEqual(new Uint8Array([]), new Uint8Array([0])), false);
+    });
+    test("single byte equal", () => {
+        assert.equal(constantTimeEqual(new Uint8Array([0xff]), new Uint8Array([0xff])), true);
+    });
+    test("single byte different", () => {
+        assert.equal(constantTimeEqual(new Uint8Array([0xff]), new Uint8Array([0xfe])), false);
+    });
+    test("large equal arrays", () => {
+        const a = new Uint8Array(1024).fill(0xab);
+        const b = new Uint8Array(1024).fill(0xab);
+        assert.equal(constantTimeEqual(a, b), true);
+    });
+    test("large arrays differing in last byte", () => {
+        const a = new Uint8Array(1024).fill(0xab);
+        const b = new Uint8Array(1024).fill(0xab);
+        b[1023] = 0xac;
+        assert.equal(constantTimeEqual(a, b), false);
+    });
+    test("large arrays differing in first byte", () => {
+        const a = new Uint8Array(1024).fill(0xab);
+        const b = new Uint8Array(1024).fill(0xab);
+        b[0] = 0xac;
+        assert.equal(constantTimeEqual(a, b), false);
+    });
+    test("all-zeros equal", () => {
+        assert.equal(constantTimeEqual(new Uint8Array(32), new Uint8Array(32)), true);
+    });
+});
+//# sourceMappingURL=canonical.test.js.map

package/dist/__tests__/canonical.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"canonical.test.js","sourceRoot":"","sources":["../../src/__tests__/canonical.test.ts"],"names":[],"mappings":"AAAA,gEAAgE;AAEhE,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAC3C,OAAO,KAAK,MAAM,MAAM,oBAAoB,CAAC;AAC7C,OAAO,EACL,YAAY,EACZ,oBAAoB,EACpB,iBAAiB,GAClB,MAAM,aAAa,CAAC;AAErB,8EAA8E;AAC9E,uBAAuB;AACvB,8EAA8E;AAE9E,QAAQ,CAAC,sBAAsB,EAAE,GAAG,EAAE;IACpC,aAAa;IACb,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,oBAAoB,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;IACrE,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,oBAAoB,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;IACrE,IAAI,CAAC,OAAO,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,oBAAoB,CAAC,KAAK,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;IACxE,IAAI,CAAC,SAAS,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,oBAAoB,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;IACpE,IAAI,CAAC,OAAO,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,oBAAoB,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;IACtE,IAAI,CAAC,UAAU,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;IACrE,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IAC/D,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,oBAAoB,CAAC,OAAO,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC;IAC7E,IAAI,CAAC,cAAc,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,oBAAoB,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;IAEzE,sBAAsB;IACtB,IAAI,CAAC,8BAA8B,EAAE,GAAG,EAAE;QACxC,MAAM,CAAC,KAAK,CACV,oBAAoB,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAC1C,qBAAqB,CACtB,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,6DAA6D,EAAE,GAAG,EAAE;QACvE,MAAM,CAAC,KAAK,CAAC,oBAAoB,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,eAAe,CAAC,CAAC;IACtE,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,sCAAsC,EAAE,GAAG,EAAE;QAChD,MAAM,CAAC,KAAK,CACV,oBAAoB,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EACrD,+BAA+B,CAChC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,cAAc,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,oBAAoB,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;IAEzE,IAAI,CAAC,2CAA2C,EAAE,GAAG,EAAE;QACrD,MAAM,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;QACzB,MAAM,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC,CAAC,EAAE,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC;IACjE,CAAC,CAAC,CAAC;IAEH,SAAS;IACT,IAAI,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACzC,MAAM,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IAC3D,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,kCAAkC,EAAE,GAAG,EAAE;QAC5C,MAAM,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,iBAAiB,CAAC,CAAC;IAC1E,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,aAAa,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,oBAAoB,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;IAExE,IAAI,CAAC,8BAA8B,EAAE,GAAG,EAAE;QACxC,MAAM,CAAC,KAAK,CACV,oBAAoB,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EACtC,eAAe,CAChB,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,qBAAqB;IACrB,IAAI,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAC7C,MAAM,GAAG,GAA4B,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;QACpD,GAAG,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;QACrB,MAAM,CAAC,KAAK,CAAC,oBAAoB,CAAC,GAAG,CAAC,EAAE,eAAe,CAAC,CAAC;IAC3D,CAAC,CAAC,CAAC;IAEH,sCAAsC;IACtC,IAAI,CAAC,gCAAgC,EAAE,GAAG,EAAE;QAC1C,MAAM,CAAC,MAAM,CACX,GAAG,EAAE,CAAC,oBAAoB,CAAC,SAAoB,CAAC,EAChD,SAAS,CACV,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACzC,MAAM,CAAC,MAAM,CACX,GAAG,EAAE,CAAC,oBAAoB,CAAC,CAAC,GAAG,EAAE,GAAE,CAAC,CAAY,CAAC,EACjD,SAAS,CACV,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACvC,MAAM,CAAC,MAAM,CACX,GAAG,EAAE,CAAC,oBAAoB,CAAC,MAAM,CAAC,GAAG,CAAY,CAAC,EAClD,SAAS,CACV,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACvC,MAAM,CAAC,MAAM,CACX,GAAG,EAAE,CAAC,oBAAoB,CAAC,MAAM,CAAC,EAAE,CAAY,CAAC,EACjD,SAAS,CACV,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,2CAA2C,EAAE,GAAG,EAAE;QACrD,MAAM,CAAC,MAAM,CACX,GAAG,EAAE,CAAC,oBAAoB,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAa,CAAC,EACvD,SAAS,CACV,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,2DAA2D;IAC3D,IAAI,CAAC,wBAAwB,EAAE,GAAG,EAAE;QAClC,MAAM,CAAC,KAAK,CAAC,oBAAoB,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACvC,MAAM,CAAC,KAAK,CAAC,oBAAoB,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,8BAA8B,EAAE,GAAG,EAAE;QACxC,MAAM,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,CAAC;IACxD,CAAC,CAAC,CAAC;IAEH,cAAc;IACd,IAAI,CAAC,wCAAwC,EAAE,GAAG,EAAE;QAClD,MAAM,GAAG,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;QACjC,MAAM,CAAC,KAAK,CAAC,oBAAoB,CAAC,GAAG,CAAC,EAAE,oBAAoB,CAAC,GAAG,CAAC,CAAC,CAAC;IACrE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,8EAA8E;AAC9E,eAAe;AACf,8EAA8E;AAE9E,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;IAC5B,IAAI,CAAC,sBAAsB,EAAE,GAAG,EAAE;QAChC,MAAM,CAAC,EAAE,CAAC,YAAY,CAAC,EAAE,CAAC,YAAY,UAAU,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,yCAAyC,EAAE,GAAG,EAAE;QACnD,MAAM,KAAK,GAAG,YAAY,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;QAC/C,MAAM,CAAC,KAAK,CAAC,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,mBAAmB,CAAC,CAAC;IACrE,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,gDAAgD,EAAE,GAAG,EAAE;QAC1D,MAAM,GAAG,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;QAC3B,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;QAChC,MAAM,GAAG,GAAG,oBAAoB,CAAC,GAAG,CAAC,CAAC;QACtC,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,wCAAwC,EAAE,GAAG,EAAE;QAClD,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,EAAE,CAAC,EAAE,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;IACrE,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,wDAAwD,EAAE,GAAG,EAAE;QAClE,MAAM,KAAK,GAA2B,EAAE,CAAC;QACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE;YAAE,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;QACrD,MAAM,KAAK,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;QAClC,MAAM,GAAG,GAAG,oBAAoB,CAAC,KAAK,CAAC,CAAC;QACxC,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,kDAAkD,EAAE,GAAG,EAAE;QAC5D,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,YAAY,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAa,CAAC,EAAE,SAAS,CAAC,CAAC;IAC5E,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,8EAA8E;AAC9E,oBAAoB;AACpB,8EAA8E;AAE9E,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;IACjC,IAAI,CAAC,wBAAwB,EAAE,GAAG,EAAE;QAClC,MAAM,CAAC,KAAK,CACV,iBAAiB,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EACvE,IAAI,CACL,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACzC,MAAM,CAAC,KAAK,CACV,iBAAiB,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EACvE,KAAK,CACN,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,mBAAmB,EAAE,GAAG,EAAE;QAC7B,MAAM,CAAC,KAAK,CACV,iBAAiB,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EACpE,KAAK,CACN,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,wBAAwB,EAAE,GAAG,EAAE;QAClC,MAAM,CAAC,KAAK,CACV,iBAAiB,CAAC,IAAI,UAAU,CAAC,EAAE,CAAC,EAAE,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC,EACzD,IAAI,CACL,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,oBAAoB,EAAE,GAAG,EAAE;QAC9B,MAAM,CAAC,KAAK,CACV,iBAAiB,CAAC,IAAI,UAAU,CAAC,EAAE,CAAC,EAAE,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAC1D,KAAK,CACN,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,mBAAmB,EAAE,GAAG,EAAE;QAC7B,MAAM,CAAC,KAAK,CACV,iBAAiB,CAAC,IAAI,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EACjE,IAAI,CACL,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,uBAAuB,EAAE,GAAG,EAAE;QACjC,MAAM,CAAC,KAAK,CACV,iBAAiB,CAAC,IAAI,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EACjE,KAAK,CACN,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,oBAAoB,EAAE,GAAG,EAAE;QAC9B,MAAM,CAAC,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1C,MAAM,CAAC,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1C,MAAM,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,qCAAqC,EAAE,GAAG,EAAE;QAC/C,MAAM,CAAC,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1C,MAAM,CAAC,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1C,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;QACf,MAAM,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,sCAAsC,EAAE,GAAG,EAAE;QAChD,MAAM,CAAC,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1C,MAAM,CAAC,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;QACZ,MAAM,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,iBAAiB,EAAE,GAAG,EAAE;QAC3B,MAAM,CAAC,KAAK,CACV,iBAAiB,CAAC,IAAI,UAAU,CAAC,EAAE,CAAC,EAAE,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC,EACzD,IAAI,CACL,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/__tests__/commit-service.integration.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=commit-service.integration.test.d.ts.map

package/dist/__tests__/commit-service.integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"commit-service.integration.test.d.ts","sourceRoot":"","sources":["../../src/__tests__/commit-service.integration.test.ts"],"names":[],"mappings":""}

package/dist/__tests__/commit-service.integration.test.js

@@ -0,0 +1,95 @@
+// Copyright (c) Mike Argento. All rights reserved. See LICENSE.
+/**
+ * Integration test: HTTP commit service (mock server)
+ *
+ * Starts server/commit-service/dist/mock/mock-server.js, exercises the full
+ * commit → verify cycle over HTTP, and confirms that tampered proofs are rejected.
+ */
+import { describe, test, before, after } from "node:test";
+import * as assert from "node:assert/strict";
+import { spawn } from "node:child_process";
+import { createHash } from "node:crypto";
+import { fileURLToPath } from "node:url";
+import { join, dirname } from "node:path";
+const __dirname = dirname(fileURLToPath(import.meta.url));
+// Two levels up from dist/__tests__/ reaches the project root.
+const MOCK_SERVER_PATH = join(__dirname, "../../server/commit-service/dist/mock/mock-server.js");
+const PORT = 18787;
+const BASE_URL = `http://localhost:${PORT}`;
+async function waitForServer(timeoutMs = 8000) {
+    const deadline = Date.now() + timeoutMs;
+    while (Date.now() < deadline) {
+        try {
+            const res = await fetch(`${BASE_URL}/health`);
+            if (res.ok)
+                return;
+        }
+        catch {
+            // not ready yet
+        }
+        await new Promise((r) => setTimeout(r, 100));
+    }
+    throw new Error(`Mock server did not become ready within ${timeoutMs}ms`);
+}
+function sha256B64(text) {
+    return createHash("sha256").update(text, "utf8").digest("base64");
+}
+describe("HTTP commit service integration", () => {
+    let server;
+    before(async () => {
+        server = spawn(process.execPath, [MOCK_SERVER_PATH], {
+            env: { ...process.env, PORT: String(PORT) },
+            stdio: "pipe",
+        });
+        await waitForServer();
+    });
+    after(() => {
+        server.kill();
+    });
+    test("happy path: commit + verify succeeds", async () => {
+        const digestB64 = sha256B64("hello bitgraph integration test");
+        // Commit
+        const commitRes = await fetch(`${BASE_URL}/commit`, {
+            method: "POST",
+            headers: { "Content-Type": "application/json" },
+            body: JSON.stringify({ digests: [{ digestB64, hashAlg: "sha256" }] }),
+        });
+        assert.equal(commitRes.status, 200, "POST /commit should return 200");
+        const proofs = (await commitRes.json());
+        assert.ok(Array.isArray(proofs) && proofs.length === 1, "expected one proof");
+        const proof = proofs[0];
+        assert.equal(proof.version, "bitgraph/1");
+        assert.equal(proof.artifact.digestB64, digestB64);
+        // Verify
+        const verifyRes = await fetch(`${BASE_URL}/verify`, {
+            method: "POST",
+            headers: { "Content-Type": "application/json" },
+            body: JSON.stringify({ proof }),
+        });
+        assert.equal(verifyRes.status, 200, "POST /verify should return 200");
+        const result = (await verifyRes.json());
+        assert.equal(result.valid, true, `signature verification failed: ${result.reason}`);
+    });
+    test("tamper path: modified digest bytes are rejected", async () => {
+        const digestB64 = sha256B64("tamper test payload");
+        const commitRes = await fetch(`${BASE_URL}/commit`, {
+            method: "POST",
+            headers: { "Content-Type": "application/json" },
+            body: JSON.stringify({ digests: [{ digestB64, hashAlg: "sha256" }] }),
+        });
+        assert.equal(commitRes.status, 200);
+        const proofs = (await commitRes.json());
+        // Deep-clone and tamper the artifact digest
+        const tampered = JSON.parse(JSON.stringify(proofs[0]));
+        tampered.artifact.digestB64 = sha256B64("completely different content");
+        const verifyRes = await fetch(`${BASE_URL}/verify`, {
+            method: "POST",
+            headers: { "Content-Type": "application/json" },
+            body: JSON.stringify({ proof: tampered }),
+        });
+        assert.equal(verifyRes.status, 200);
+        const result = (await verifyRes.json());
+        assert.equal(result.valid, false, "tampered proof should fail verification");
+    });
+});
+//# sourceMappingURL=commit-service.integration.test.js.map

package/dist/__tests__/commit-service.integration.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"commit-service.integration.test.js","sourceRoot":"","sources":["../../src/__tests__/commit-service.integration.test.ts"],"names":[],"mappings":"AAAA,gEAAgE;AAEhE;;;;;GAKG;AAEH,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,WAAW,CAAC;AAC1D,OAAO,KAAK,MAAM,MAAM,oBAAoB,CAAC;AAC7C,OAAO,EAAE,KAAK,EAAqB,MAAM,oBAAoB,CAAC;AAC9D,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AACzC,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAG1C,MAAM,SAAS,GAAG,OAAO,CAAC,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;AAE1D,+DAA+D;AAC/D,MAAM,gBAAgB,GAAG,IAAI,CAC3B,SAAS,EACT,sDAAsD,CACvD,CAAC;AAEF,MAAM,IAAI,GAAG,KAAK,CAAC;AACnB,MAAM,QAAQ,GAAG,oBAAoB,IAAI,EAAE,CAAC;AAE5C,KAAK,UAAU,aAAa,CAAC,SAAS,GAAG,IAAI;IAC3C,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;IACxC,OAAO,IAAI,CAAC,GAAG,EAAE,GAAG,QAAQ,EAAE,CAAC;QAC7B,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,MAAM,KAAK,CAAC,GAAG,QAAQ,SAAS,CAAC,CAAC;YAC9C,IAAI,GAAG,CAAC,EAAE;gBAAE,OAAO;QACrB,CAAC;QAAC,MAAM,CAAC;YACP,gBAAgB;QAClB,CAAC;QACD,MAAM,IAAI,OAAO,CAAO,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IACrD,CAAC;IACD,MAAM,IAAI,KAAK,CAAC,2CAA2C,SAAS,IAAI,CAAC,CAAC;AAC5E,CAAC;AAED,SAAS,SAAS,CAAC,IAAY;IAC7B,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;AACpE,CAAC;AAED,QAAQ,CAAC,iCAAiC,EAAE,GAAG,EAAE;IAC/C,IAAI,MAAoB,CAAC;IAEzB,MAAM,CAAC,KAAK,IAAI,EAAE;QAChB,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC,gBAAgB,CAAC,EAAE;YACnD,GAAG,EAAE,EAAE,GAAG,OAAO,CAAC,GAAG,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE;YAC3C,KAAK,EAAE,MAAM;SACd,CAAC,CAAC;QACH,MAAM,aAAa,EAAE,CAAC;IACxB,CAAC,CAAC,CAAC;IAEH,KAAK,CAAC,GAAG,EAAE;QACT,MAAM,CAAC,IAAI,EAAE,CAAC;IAChB,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,sCAAsC,EAAE,KAAK,IAAI,EAAE;QACtD,MAAM,SAAS,GAAG,SAAS,CAAC,iCAAiC,CAAC,CAAC;QAE/D,SAAS;QACT,MAAM,SAAS,GAAG,MAAM,KAAK,CAAC,GAAG,QAAQ,SAAS,EAAE;YAClD,MAAM,EAAE,MAAM;YACd,OAAO,EAAE,EAAE,cAAc,EAAE,kBAAkB,EAAE;YAC/C,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,SAAS,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC;SACtE,CAAC,CAAC;QACH,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE,GAAG,EAAE,gCAAgC,CAAC,CAAC;QAEtE,MAAM,MAAM,GAAG,CAAC,MAAM,SAAS,CAAC,IAAI,EAAE,CAAoB,CAAC;QAC3D,MAAM,CAAC,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,oBAAoB,CAAC,CAAC;QAE9E,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;QACzB,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;QAC1C,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QAElD,SAAS;QACT,MAAM,SAAS,GAAG,MAAM,KAAK,CAAC,GAAG,QAAQ,SAAS,EAAE;YAClD,MAAM,EAAE,MAAM;YACd,OAAO,EAAE,EAAE,cAAc,EAAE,kBAAkB,EAAE;YAC/C,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,CAAC;SAChC,CAAC,CAAC;QACH,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE,GAAG,EAAE,gCAAgC,CAAC,CAAC;QAEtE,MAAM,MAAM,GAAG,CAAC,MAAM,SAAS,CAAC,IAAI,EAAE,CAAwC,CAAC;QAC/E,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,EAAE,kCAAkC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;IACtF,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,iDAAiD,EAAE,KAAK,IAAI,EAAE;QACjE,MAAM,SAAS,GAAG,SAAS,CAAC,qBAAqB,CAAC,CAAC;QAEnD,MAAM,SAAS,GAAG,MAAM,KAAK,CAAC,GAAG,QAAQ,SAAS,EAAE;YAClD,MAAM,EAAE,MAAM;YACd,OAAO,EAAE,EAAE,cAAc,EAAE,kBAAkB,EAAE;YAC/C,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,SAAS,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC;SACtE,CAAC,CAAC;QACH,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QAEpC,MAAM,MAAM,GAAG,CAAC,MAAM,SAAS,CAAC,IAAI,EAAE,CAAoB,CAAC;QAC3D,4CAA4C;QAC5C,MAAM,QAAQ,GAAkB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,CAAkB,CAAC;QACxF,QAAQ,CAAC,QAAQ,CAAC,SAAS,GAAG,SAAS,CAAC,8BAA8B,CAAC,CAAC;QAExE,MAAM,SAAS,GAAG,MAAM,KAAK,CAAC,GAAG,QAAQ,SAAS,EAAE;YAClD,MAAM,EAAE,MAAM;YACd,OAAO,EAAE,EAAE,cAAc,EAAE,kBAAkB,EAAE;YAC/C,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;SAC1C,CAAC,CAAC;QACH,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QAEpC,MAAM,MAAM,GAAG,CAAC,MAAM,SAAS,CAAC,IAAI,EAAE,CAAwC,CAAC;QAC/E,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,yCAAyC,CAAC,CAAC;IAC/E,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/__tests__/constructor.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=constructor.test.d.ts.map

package/dist/__tests__/constructor.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"constructor.test.d.ts","sourceRoot":"","sources":["../../src/__tests__/constructor.test.ts"],"names":[],"mappings":""}