@origintrail-official/dkg-storage 10.0.12 → 10.0.13

package/LICENSE

@@ -1,201 +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 2018 OriginTrail
-
-   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.
+                                 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 2018 OriginTrail
+
+   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/README.md

@@ -1,112 +1,112 @@
-# @origintrail-official/dkg-storage
-
-Triple store abstraction layer for DKG V10. Provides a unified API over multiple RDF storage backends with named graph management and private content storage.
-
-## Features
-
-- **Backend adapters** — pluggable triple store implementations:
-  - `OxigraphStore` — embedded WASM/native store, no external dependencies
-  - `OxigraphWorkerStore` — worker-thread variant; keeps the daemon event loop free, with a per-read-operation timeout (see below)
-  - `BlazegraphStore` — connects to a running Blazegraph SPARQL endpoint
-  - `SparqlHttpStore` — generic adapter for any SPARQL 1.1 compliant endpoint
-- **Graph manager** — named graph lifecycle (create, drop, list) with contextGraph-scoped data and metadata graphs
-- **Private content store** — encrypted triple storage for private KA triples, separate from the public graph
-- **Custom adapters** — `registerTripleStoreAdapter()` to plug in any storage backend
-
-## Usage
-
-```typescript
-import { createTripleStore, GraphManager } from '@origintrail-official/dkg-storage';
-
-// In-memory store
-const memStore = await createTripleStore({ backend: 'oxigraph' });
-
-// Persistent store (requires a path)
-const store = await createTripleStore({
-  backend: 'oxigraph-persistent',
-  options: { path: './data' },
-});
-
-const graphs = new GraphManager(store);
-
-await store.insert(quads);
-const result = await store.query('SELECT * WHERE { ?s ?p ?o } LIMIT 10');
-```
-
-## Embedded worker store (`oxigraph-worker`) tuning
-
-The embedded worker runs **all** store operations on a single worker thread, so
-a long-running or stuck op (a huge import, an expensive query) blocks every
-other store-backed request behind it. Under real load this surfaces as the
-daemon's `/api/status` staying green while `/api/query`,
-`/api/context-graph/list`, and `/api/assertion/create` hang. A `store.options`
-knob bounds that blast radius:
-
-| Option | Default | Purpose |
-|---|---|---|
-| `operationTimeoutMs` | `120000` | Reject a **read-only** op (`query`, `hasGraph`, `listGraphs`, `countQuads`) that exceeds this instead of hanging forever — that's where the user-visible hang shows up. `0` disables (restores unbounded behaviour). `close` is exempt — its final flush always runs to completion so shutdown can't drop pending writes. |
-
-Mutations (`insert`, `delete`, …) are intentionally **not** bounded by this
-timeout. The bound only drops the *caller's* promise — the single worker thread
-keeps running the op — so a "timed-out" write could still commit afterwards,
-and the rest of the codebase treats a rejected `insert`/`delete` as a clean
-failure. Bounding only reads surfaces a wedged worker on the paths that hang
-without inventing an indeterminate write outcome. `insert()` therefore stays
-strictly atomic (all quads commit or the call fails), which callers rely on.
-
-```jsonc
-// ~/.dkg/config.json
-"store": {
-  "backend": "oxigraph-worker",
-  "options": { "operationTimeoutMs": 120000 }
-}
-```
-
-For heavy / production workloads, prefer an out-of-process SPARQL server
-(`sparql-http` or `blazegraph`), which handles reads and writes concurrently
-and keeps the daemon responsive under load.
-
-## External-store admission and deadlines
-
-All external adapters share a process-wide priority scheduler. Waiting work is
-bounded independently for `ack`, `normal`, and `background` traffic, and an
-operation rejected before dispatch receives `StoreSchedulerBusyError` with
-`code: STORE_SCHEDULER_BUSY`, `retryable: true`, and a reason of either
-`queue_full` or `queue_wait_timeout`. Because this error is only created before
-the operation closure starts, retrying it cannot duplicate a write that might
-already have reached the store.
-
-| Environment variable | Default | Purpose |
-|---|---:|---|
-| `DKG_STORE_MAX_CONCURRENT` | `8` | Maximum external-store operations in flight. |
-| `DKG_STORE_ACK_RESERVED_SLOTS` | `1` | In-flight capacity reserved for ACK work. |
-| `DKG_STORE_NORMAL_RESERVED_SLOTS` | `1` | Non-ACK capacity kept available for normal work while background operations are in flight. |
-| `DKG_STORE_BACKGROUND_RESERVED_SLOTS` | `1` | Non-ACK capacity reserved for background progress. |
-| `DKG_STORE_QUEUE_LIMIT` | `64` | Maximum waiting operations in each priority queue. |
-| `DKG_STORE_ACK_QUEUE_LIMIT` | common limit | Optional ACK queue override. |
-| `DKG_STORE_NORMAL_QUEUE_LIMIT` | common limit | Optional normal queue override. |
-| `DKG_STORE_BACKGROUND_QUEUE_LIMIT` | common limit | Optional background queue override. |
-| `DKG_STORE_QUEUE_WAIT_TIMEOUT_MS` | `10000` | Maximum pre-dispatch wait before a retryable busy rejection. |
-| `DKG_BLAZEGRAPH_OPERATION_TIMEOUT_MS` | `30000` | Blazegraph end-to-end operation deadline, including scheduler wait, HTTP, response decoding, and mapping. |
-
-Normal and background reserves are normalized against the available non-ACK
-capacity. At least one background slot remains available, and the background
-progress floor is capped to its admission ceiling so conflicting custom values
-cannot leave usable capacity idle.
-
-Blazegraph's deadline can also be set per store, which takes precedence over
-the environment default:
-
-```jsonc
-"store": {
-  "backend": "blazegraph",
-  "options": {
-    "url": "http://127.0.0.1:9999/blazegraph/namespace/dkg/sparql",
-    "timeout": 30000
-  }
-}
-```
-
-## Internal Dependencies
-
-- `@origintrail-official/dkg-core` — configuration types, logging, constants
+# @origintrail-official/dkg-storage
+
+Triple store abstraction layer for DKG V10. Provides a unified API over multiple RDF storage backends with named graph management and private content storage.
+
+## Features
+
+- **Backend adapters** — pluggable triple store implementations:
+  - `OxigraphStore` — embedded WASM/native store, no external dependencies
+  - `OxigraphWorkerStore` — worker-thread variant; keeps the daemon event loop free, with a per-read-operation timeout (see below)
+  - `BlazegraphStore` — connects to a running Blazegraph SPARQL endpoint
+  - `SparqlHttpStore` — generic adapter for any SPARQL 1.1 compliant endpoint
+- **Graph manager** — named graph lifecycle (create, drop, list) with contextGraph-scoped data and metadata graphs
+- **Private content store** — encrypted triple storage for private KA triples, separate from the public graph
+- **Custom adapters** — `registerTripleStoreAdapter()` to plug in any storage backend
+
+## Usage
+
+```typescript
+import { createTripleStore, GraphManager } from '@origintrail-official/dkg-storage';
+
+// In-memory store
+const memStore = await createTripleStore({ backend: 'oxigraph' });
+
+// Persistent store (requires a path)
+const store = await createTripleStore({
+  backend: 'oxigraph-persistent',
+  options: { path: './data' },
+});
+
+const graphs = new GraphManager(store);
+
+await store.insert(quads);
+const result = await store.query('SELECT * WHERE { ?s ?p ?o } LIMIT 10');
+```
+
+## Embedded worker store (`oxigraph-worker`) tuning
+
+The embedded worker runs **all** store operations on a single worker thread, so
+a long-running or stuck op (a huge import, an expensive query) blocks every
+other store-backed request behind it. Under real load this surfaces as the
+daemon's `/api/status` staying green while `/api/query`,
+`/api/context-graph/list`, and `/api/assertion/create` hang. A `store.options`
+knob bounds that blast radius:
+
+| Option | Default | Purpose |
+|---|---|---|
+| `operationTimeoutMs` | `120000` | Reject a **read-only** op (`query`, `hasGraph`, `listGraphs`, `countQuads`) that exceeds this instead of hanging forever — that's where the user-visible hang shows up. `0` disables (restores unbounded behaviour). `close` is exempt — its final flush always runs to completion so shutdown can't drop pending writes. |
+
+Mutations (`insert`, `delete`, …) are intentionally **not** bounded by this
+timeout. The bound only drops the *caller's* promise — the single worker thread
+keeps running the op — so a "timed-out" write could still commit afterwards,
+and the rest of the codebase treats a rejected `insert`/`delete` as a clean
+failure. Bounding only reads surfaces a wedged worker on the paths that hang
+without inventing an indeterminate write outcome. `insert()` therefore stays
+strictly atomic (all quads commit or the call fails), which callers rely on.
+
+```jsonc
+// ~/.dkg/config.json
+"store": {
+  "backend": "oxigraph-worker",
+  "options": { "operationTimeoutMs": 120000 }
+}
+```
+
+For heavy / production workloads, prefer an out-of-process SPARQL server
+(`sparql-http` or `blazegraph`), which handles reads and writes concurrently
+and keeps the daemon responsive under load.
+
+## External-store admission and deadlines
+
+All external adapters share a process-wide priority scheduler. Waiting work is
+bounded independently for `ack`, `normal`, and `background` traffic, and an
+operation rejected before dispatch receives `StoreSchedulerBusyError` with
+`code: STORE_SCHEDULER_BUSY`, `retryable: true`, and a reason of either
+`queue_full` or `queue_wait_timeout`. Because this error is only created before
+the operation closure starts, retrying it cannot duplicate a write that might
+already have reached the store.
+
+| Environment variable | Default | Purpose |
+|---|---:|---|
+| `DKG_STORE_MAX_CONCURRENT` | `8` | Maximum external-store operations in flight. |
+| `DKG_STORE_ACK_RESERVED_SLOTS` | `1` | In-flight capacity reserved for ACK work. |
+| `DKG_STORE_NORMAL_RESERVED_SLOTS` | `1` | Non-ACK capacity kept available for normal work while background operations are in flight. |
+| `DKG_STORE_BACKGROUND_RESERVED_SLOTS` | `1` | Non-ACK capacity reserved for background progress. |
+| `DKG_STORE_QUEUE_LIMIT` | `64` | Maximum waiting operations in each priority queue. |
+| `DKG_STORE_ACK_QUEUE_LIMIT` | common limit | Optional ACK queue override. |
+| `DKG_STORE_NORMAL_QUEUE_LIMIT` | common limit | Optional normal queue override. |
+| `DKG_STORE_BACKGROUND_QUEUE_LIMIT` | common limit | Optional background queue override. |
+| `DKG_STORE_QUEUE_WAIT_TIMEOUT_MS` | `10000` | Maximum pre-dispatch wait before a retryable busy rejection. |
+| `DKG_BLAZEGRAPH_OPERATION_TIMEOUT_MS` | `30000` | Blazegraph end-to-end operation deadline, including scheduler wait, HTTP, response decoding, and mapping. |
+
+Normal and background reserves are normalized against the available non-ACK
+capacity. At least one background slot remains available, and the background
+progress floor is capped to its admission ceiling so conflicting custom values
+cannot leave usable capacity idle.
+
+Blazegraph's deadline can also be set per store, which takes precedence over
+the environment default:
+
+```jsonc
+"store": {
+  "backend": "blazegraph",
+  "options": {
+    "url": "http://127.0.0.1:9999/blazegraph/namespace/dkg/sparql",
+    "timeout": 30000
+  }
+}
+```
+
+## Internal Dependencies
+
+- `@origintrail-official/dkg-core` — configuration types, logging, constants

package/dist/bounded-rdf.js

@@ -128,9 +128,9 @@ async function readExactGraphPagedInternal(store, graphIri, options) {
         quads.length = 0;
         seenNQuadLines.clear();
         nquadsBytes = 0;
-        const result = await store.query(`CONSTRUCT { ?s ?p ?o } WHERE {
-        GRAPH <${graph}> { ?s ?p ?o }
-      }
+        const result = await store.query(`CONSTRUCT { ?s ?p ?o } WHERE {
+        GRAPH <${graph}> { ?s ?p ?o }
+      }
       LIMIT ${expectedQuadCount + 1}`, boundedQueryOptions);
         if (result.type !== 'quads' || !Array.isArray(result.quads)) {
             throw invalidQueryResult(graph, 'Exact blank-node graph read expected CONSTRUCT quads');
@@ -160,11 +160,11 @@ async function readExactGraphPagedInternal(store, graphIri, options) {
     for (;;) {
         const remainingWithOverflowSentinel = expectedQuadCount - quads.length + 1;
         const pageLimit = Math.min(pageSize, remainingWithOverflowSentinel);
-        const result = await store.query(`SELECT ?s ?p ?o WHERE {
-        GRAPH <${graph}> { ?s ?p ?o }
-      }
-      ORDER BY ?s ?p ?o
-      LIMIT ${pageLimit}
+        const result = await store.query(`SELECT ?s ?p ?o WHERE {
+        GRAPH <${graph}> { ?s ?p ?o }
+      }
+      ORDER BY ?s ?p ?o
+      LIMIT ${pageLimit}
       OFFSET ${offset}`, boundedQueryOptions);
         if (result.type !== 'bindings') {
             throw invalidQueryResult(graph, 'Exact graph read expected SELECT bindings');
@@ -253,8 +253,8 @@ function invalidQueryResult(graphIri, message) {
     });
 }
 async function queryExactGraphCount(store, graphIri, maxQuadCount, queryOptions) {
-    const result = await store.query(`SELECT (COUNT(*) AS ?count) WHERE {
-      GRAPH <${graphIri}> { ?s ?p ?o }
+    const result = await store.query(`SELECT (COUNT(*) AS ?count) WHERE {
+      GRAPH <${graphIri}> { ?s ?p ?o }
     }`, queryOptions);
     if (result.type !== 'bindings'
         || !Array.isArray(result.bindings)

package/dist/changelog-store.js

@@ -410,11 +410,11 @@ export class ChangelogStore {
     async readChanges(sinceSeq, limit, options) {
         const since = Number.isFinite(sinceSeq) ? Math.max(0, Math.floor(sinceSeq)) : 0;
         const cap = Number.isFinite(limit) ? Math.max(1, Math.floor(limit)) : 1;
-        const res = await this.inner.query(`SELECT ?seq ?graph ?op WHERE {
-  GRAPH <${CHANGELOG_GRAPH}> {
-    ?e <${P_SEQ}> ?seq ; <${P_GRAPH}> ?graph ; <${P_OP}> ?op .
-    FILTER(?seq > ${since})
-  }
+        const res = await this.inner.query(`SELECT ?seq ?graph ?op WHERE {
+  GRAPH <${CHANGELOG_GRAPH}> {
+    ?e <${P_SEQ}> ?seq ; <${P_GRAPH}> ?graph ; <${P_OP}> ?op .
+    FILTER(?seq > ${since})
+  }
 } ORDER BY ?seq LIMIT ${cap}`, { ...options, source: options?.source ?? 'changelog.readChanges' });
         if (res.type !== 'bindings')
             return [];

package/dist/graph-manager.js

@@ -304,11 +304,11 @@ function sharedMemorySelectionGraphPattern(selection, options) {
         throw new Error(message);
     }
     const values = roots.map((r) => `<${r}>`).join(' ');
-    return `VALUES ?root { ${values} }
-          ?s ?p ?o .
-          FILTER(
-            ?s = ?root
-            || STRSTARTS(STR(?s), CONCAT(STR(?root), "/.well-known/genid/"))
+    return `VALUES ?root { ${values} }
+          ?s ?p ?o .
+          FILTER(
+            ?s = ?root
+            || STRSTARTS(STR(?s), CONCAT(STR(?root), "/.well-known/genid/"))
           )`;
 }
 async function loadSharedMemoryQuadsInternal(store, bucketGraph, selection, options, graphScope) {
@@ -325,9 +325,9 @@ async function loadSharedMemoryQuadsInternal(store, bucketGraph, selection, opti
     if (options.resultBudget) {
         return loadSharedMemoryQuadsPaged(store, graphValues, innerGraphPattern, queryOptions, options);
     }
-    const result = await store.query(`CONSTRUCT { ?s ?p ?o } WHERE {
-        VALUES ?g { ${graphValues} }
-        GRAPH ?g { ${innerGraphPattern} }
+    const result = await store.query(`CONSTRUCT { ?s ?p ?o } WHERE {
+        VALUES ?g { ${graphValues} }
+        GRAPH ?g { ${innerGraphPattern} }
       }`, queryOptions);
     if (result.type !== 'quads')
         return [];
@@ -356,12 +356,12 @@ async function loadSharedMemoryQuadsPaged(store, graphValues, innerGraphPattern,
         getMetrics().storeQueryResultBytesEstimate.record(bytesEstimate, { source });
     };
     for (let offset = 0;; offset += pageRows) {
-        const result = await store.query(`SELECT DISTINCT ?s ?p ?o WHERE {
-      VALUES ?g { ${graphValues} }
-      GRAPH ?g { ${innerGraphPattern} }
-    }
-    ORDER BY ?s ?p ?o
-    OFFSET ${offset}
+        const result = await store.query(`SELECT DISTINCT ?s ?p ?o WHERE {
+      VALUES ?g { ${graphValues} }
+      GRAPH ?g { ${innerGraphPattern} }
+    }
+    ORDER BY ?s ?p ?o
+    OFFSET ${offset}
     LIMIT ${pageRows}`, queryOptions);
         if (result.type !== 'bindings' || result.bindings.length === 0)
             break;
@@ -425,18 +425,18 @@ export async function loadSelectedVerifiableMemoryQuads(store, dataGraph, rootEn
     const vmGraphs = await resolveVerifiableMemoryReadGraphs(store, dataGraph, queryOptions);
     const graphValues = vmGraphs.map((g) => `<${g}>`).join(' ');
     const rootValues = roots.map((root) => sparqlString(root)).join(' ');
-    const result = await store.query(`CONSTRUCT {
-      ?s ?p ?o
-    } WHERE {
-      VALUES ?g { ${graphValues} }
-      GRAPH ?g {
-        VALUES ?rootValue { ${rootValues} }
-        ?s ?p ?o .
-        FILTER(
-          STR(?s) = ?rootValue
-          || STRSTARTS(STR(?s), CONCAT(?rootValue, "/.well-known/genid/"))
-        )
-      }
+    const result = await store.query(`CONSTRUCT {
+      ?s ?p ?o
+    } WHERE {
+      VALUES ?g { ${graphValues} }
+      GRAPH ?g {
+        VALUES ?rootValue { ${rootValues} }
+        ?s ?p ?o .
+        FILTER(
+          STR(?s) = ?rootValue
+          || STRSTARTS(STR(?s), CONCAT(?rootValue, "/.well-known/genid/"))
+        )
+      }
     }`, queryOptions);
     return result.type === 'quads' ? result.quads : [];
 }

package/dist/index.d.ts

@@ -16,6 +16,7 @@ export { SparqlHttpStore, type SparqlHttpStoreOptions, type SparqlHttpQueryOptio
 export { ContextGraphManager, GraphManager, loadSelectedSharedMemoryQuads, loadSharedMemoryQuadsForScope, loadSharedMemorySliceWithKaBoundFallback, canonicalSharedMemoryScopeWriteGraph, resolveSharedMemoryScopeGraphs, resolveSharedMemoryScopeWriteGraph, loadSelectedVerifiableMemoryQuads, resolveSharedMemoryReadGraphs, resolveVerifiableMemoryReadGraphs, type LoadSelectedSharedMemoryQuadsOptions, type SharedMemoryResultBudget, SharedMemoryResultBudgetError, type LoadSelectedVerifiableMemoryQuadsOptions, type NonEmptyGraphList, type NamedKnowledgeAssetGraphIdentity, type SharedMemoryReadSelection, type SharedMemoryGraphScope, type SwmKaGraphBound, type SwmSliceSourceTags, type LoadSharedMemorySliceWithKaBoundFallbackOptions, } from './graph-manager.js';
 export { PrivateContentStore, type KnowledgeAssetPrivateReadOptions, } from './private-store.js';
 export { LOCAL_TRUSTED_KA_CONTROLS_GRAPH } from './local-trusted-controls.js';
+export { SWM_MATERIALIZATION_WITNESS_GRAPH, swmMaterializationWitnessSubject, readSwmMaterializationWitness, writeSwmMaterializationWitness, invalidateSwmMaterializationWitness, } from './swm-materialization-witness.js';
 import './adapters/oxigraph.js';
 import './adapters/oxigraph-worker.js';
 import './adapters/blazegraph.js';

package/dist/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,KAAK,IAAI,EACT,KAAK,WAAW,EAChB,KAAK,WAAW,EAChB,KAAK,YAAY,EACjB,KAAK,iBAAiB,EACtB,KAAK,qBAAqB,EAC1B,KAAK,YAAY,EACjB,KAAK,eAAe,EACpB,KAAK,SAAS,EACd,KAAK,iBAAiB,EACtB,KAAK,kBAAkB,EACvB,KAAK,uBAAuB,EAC5B,KAAK,aAAa,EAClB,KAAK,yBAAyB,EAC9B,0BAA0B,EAC1B,iBAAiB,EACjB,0BAA0B,EAC1B,yBAAyB,EACzB,mCAAmC,EACnC,2BAA2B,EAC3B,iBAAiB,EACjB,iBAAiB,EACjB,KAAK,cAAc,GACpB,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EACL,mCAAmC,EACnC,+BAA+B,EAC/B,uCAAuC,EACvC,6BAA6B,EAC7B,+BAA+B,EAC/B,gCAAgC,EAChC,KAAK,kCAAkC,EACvC,KAAK,wBAAwB,GAC9B,MAAM,2BAA2B,CAAC;AACnC,OAAO,EACL,qCAAqC,EACrC,yCAAyC,EACzC,+BAA+B,EAC/B,iCAAiC,EACjC,KAAK,qBAAqB,GAC3B,MAAM,mCAAmC,CAAC;AAC3C,OAAO,EACL,sBAAsB,EACtB,uBAAuB,EACvB,8BAA8B,EAC9B,yCAAyC,EACzC,yBAAyB,EACzB,mCAAmC,EACnC,KAAK,8BAA8B,EACnC,KAAK,6BAA6B,EAClC,KAAK,wBAAwB,EAC7B,KAAK,wBAAwB,GAC9B,MAAM,+BAA+B,CAAC;AACvC,OAAO,EACL,6BAA6B,EAC7B,0BAA0B,EAC1B,qCAAqC,EACrC,4BAA4B,EAC5B,KAAK,mCAAmC,GACzC,MAAM,uCAAuC,CAAC;AAC/C,OAAO,EACL,+BAA+B,EAC/B,mDAAmD,EACnD,kBAAkB,EAClB,KAAK,yBAAyB,EAC9B,KAAK,qBAAqB,EAC1B,KAAK,sBAAsB,GAC5B,MAAM,4BAA4B,CAAC;AACpC,OAAO,EACL,eAAe,EACf,wBAAwB,EACxB,cAAc,EACd,mBAAmB,EACnB,iBAAiB,EACjB,KAAK,QAAQ,EACb,KAAK,YAAY,EACjB,KAAK,iBAAiB,EACtB,KAAK,aAAa,EAClB,KAAK,eAAe,EACpB,KAAK,qBAAqB,GAC3B,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EACL,oBAAoB,EACpB,qBAAqB,EACrB,KAAK,mBAAmB,GACzB,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EACL,mBAAmB,EACnB,WAAW,EACX,aAAa,EACb,mBAAmB,EACnB,sCAAsC,EACtC,KAAK,uBAAuB,EAC5B,KAAK,uBAAuB,EAC5B,KAAK,0BAA0B,GAChC,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,0BAA0B,EAAE,MAAM,0BAA0B,CAAC;AACtE,OAAO,EACL,kCAAkC,EAClC,KAAK,2BAA2B,GACjC,MAAM,4CAA4C,CAAC;AAEpD,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,mBAAmB,EAAE,MAAM,+BAA+B,CAAC;AACpE,OAAO,EACL,eAAe,EACf,uCAAuC,EACvC,KAAK,sBAAsB,GAC5B,MAAM,0BAA0B,CAAC;AAClC,OAAO,EACL,eAAe,EACf,KAAK,sBAAsB,EAC3B,KAAK,sBAAsB,EAC3B,KAAK,wBAAwB,GAC9B,MAAM,2BAA2B,CAAC;AACnC,OAAO,EACL,mBAAmB,EACnB,YAAY,EACZ,6BAA6B,EAC7B,6BAA6B,EAC7B,wCAAwC,EACxC,oCAAoC,EACpC,8BAA8B,EAC9B,kCAAkC,EAClC,iCAAiC,EACjC,6BAA6B,EAC7B,iCAAiC,EACjC,KAAK,oCAAoC,EACzC,KAAK,wBAAwB,EAC7B,6BAA6B,EAC7B,KAAK,wCAAwC,EAC7C,KAAK,iBAAiB,EACtB,KAAK,gCAAgC,EACrC,KAAK,yBAAyB,EAC9B,KAAK,sBAAsB,EAC3B,KAAK,eAAe,EACpB,KAAK,kBAAkB,EACvB,KAAK,+CAA+C,GACrD,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EACL,mBAAmB,EACnB,KAAK,gCAAgC,GACtC,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EAAE,+BAA+B,EAAE,MAAM,6BAA6B,CAAC;AAG9E,OAAO,wBAAwB,CAAC;AAChC,OAAO,+BAA+B,CAAC;AACvC,OAAO,0BAA0B,CAAC;AAClC,OAAO,2BAA2B,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,KAAK,IAAI,EACT,KAAK,WAAW,EAChB,KAAK,WAAW,EAChB,KAAK,YAAY,EACjB,KAAK,iBAAiB,EACtB,KAAK,qBAAqB,EAC1B,KAAK,YAAY,EACjB,KAAK,eAAe,EACpB,KAAK,SAAS,EACd,KAAK,iBAAiB,EACtB,KAAK,kBAAkB,EACvB,KAAK,uBAAuB,EAC5B,KAAK,aAAa,EAClB,KAAK,yBAAyB,EAC9B,0BAA0B,EAC1B,iBAAiB,EACjB,0BAA0B,EAC1B,yBAAyB,EACzB,mCAAmC,EACnC,2BAA2B,EAC3B,iBAAiB,EACjB,iBAAiB,EACjB,KAAK,cAAc,GACpB,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EACL,mCAAmC,EACnC,+BAA+B,EAC/B,uCAAuC,EACvC,6BAA6B,EAC7B,+BAA+B,EAC/B,gCAAgC,EAChC,KAAK,kCAAkC,EACvC,KAAK,wBAAwB,GAC9B,MAAM,2BAA2B,CAAC;AACnC,OAAO,EACL,qCAAqC,EACrC,yCAAyC,EACzC,+BAA+B,EAC/B,iCAAiC,EACjC,KAAK,qBAAqB,GAC3B,MAAM,mCAAmC,CAAC;AAC3C,OAAO,EACL,sBAAsB,EACtB,uBAAuB,EACvB,8BAA8B,EAC9B,yCAAyC,EACzC,yBAAyB,EACzB,mCAAmC,EACnC,KAAK,8BAA8B,EACnC,KAAK,6BAA6B,EAClC,KAAK,wBAAwB,EAC7B,KAAK,wBAAwB,GAC9B,MAAM,+BAA+B,CAAC;AACvC,OAAO,EACL,6BAA6B,EAC7B,0BAA0B,EAC1B,qCAAqC,EACrC,4BAA4B,EAC5B,KAAK,mCAAmC,GACzC,MAAM,uCAAuC,CAAC;AAC/C,OAAO,EACL,+BAA+B,EAC/B,mDAAmD,EACnD,kBAAkB,EAClB,KAAK,yBAAyB,EAC9B,KAAK,qBAAqB,EAC1B,KAAK,sBAAsB,GAC5B,MAAM,4BAA4B,CAAC;AACpC,OAAO,EACL,eAAe,EACf,wBAAwB,EACxB,cAAc,EACd,mBAAmB,EACnB,iBAAiB,EACjB,KAAK,QAAQ,EACb,KAAK,YAAY,EACjB,KAAK,iBAAiB,EACtB,KAAK,aAAa,EAClB,KAAK,eAAe,EACpB,KAAK,qBAAqB,GAC3B,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EACL,oBAAoB,EACpB,qBAAqB,EACrB,KAAK,mBAAmB,GACzB,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EACL,mBAAmB,EACnB,WAAW,EACX,aAAa,EACb,mBAAmB,EACnB,sCAAsC,EACtC,KAAK,uBAAuB,EAC5B,KAAK,uBAAuB,EAC5B,KAAK,0BAA0B,GAChC,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,0BAA0B,EAAE,MAAM,0BAA0B,CAAC;AACtE,OAAO,EACL,kCAAkC,EAClC,KAAK,2BAA2B,GACjC,MAAM,4CAA4C,CAAC;AAEpD,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,mBAAmB,EAAE,MAAM,+BAA+B,CAAC;AACpE,OAAO,EACL,eAAe,EACf,uCAAuC,EACvC,KAAK,sBAAsB,GAC5B,MAAM,0BAA0B,CAAC;AAClC,OAAO,EACL,eAAe,EACf,KAAK,sBAAsB,EAC3B,KAAK,sBAAsB,EAC3B,KAAK,wBAAwB,GAC9B,MAAM,2BAA2B,CAAC;AACnC,OAAO,EACL,mBAAmB,EACnB,YAAY,EACZ,6BAA6B,EAC7B,6BAA6B,EAC7B,wCAAwC,EACxC,oCAAoC,EACpC,8BAA8B,EAC9B,kCAAkC,EAClC,iCAAiC,EACjC,6BAA6B,EAC7B,iCAAiC,EACjC,KAAK,oCAAoC,EACzC,KAAK,wBAAwB,EAC7B,6BAA6B,EAC7B,KAAK,wCAAwC,EAC7C,KAAK,iBAAiB,EACtB,KAAK,gCAAgC,EACrC,KAAK,yBAAyB,EAC9B,KAAK,sBAAsB,EAC3B,KAAK,eAAe,EACpB,KAAK,kBAAkB,EACvB,KAAK,+CAA+C,GACrD,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EACL,mBAAmB,EACnB,KAAK,gCAAgC,GACtC,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EAAE,+BAA+B,EAAE,MAAM,6BAA6B,CAAC;AAI9E,OAAO,EACL,iCAAiC,EACjC,gCAAgC,EAChC,6BAA6B,EAC7B,8BAA8B,EAC9B,mCAAmC,GACpC,MAAM,kCAAkC,CAAC;AAG1C,OAAO,wBAAwB,CAAC;AAChC,OAAO,+BAA+B,CAAC;AACvC,OAAO,0BAA0B,CAAC;AAClC,OAAO,2BAA2B,CAAC"}

package/dist/index.js

@@ -16,6 +16,10 @@ export { SparqlHttpStore, } from './adapters/sparql-http.js';
 export { ContextGraphManager, GraphManager, loadSelectedSharedMemoryQuads, loadSharedMemoryQuadsForScope, loadSharedMemorySliceWithKaBoundFallback, canonicalSharedMemoryScopeWriteGraph, resolveSharedMemoryScopeGraphs, resolveSharedMemoryScopeWriteGraph, loadSelectedVerifiableMemoryQuads, resolveSharedMemoryReadGraphs, resolveVerifiableMemoryReadGraphs, SharedMemoryResultBudgetError, } from './graph-manager.js';
 export { PrivateContentStore, } from './private-store.js';
 export { LOCAL_TRUSTED_KA_CONTROLS_GRAPH } from './local-trusted-controls.js';
+// #2079 — node-local memo of an already-verified SWM assertion graph. Read only
+// AFTER a count gate has matched; see the module doc for why the count cannot
+// be dropped.
+export { SWM_MATERIALIZATION_WITNESS_GRAPH, swmMaterializationWitnessSubject, readSwmMaterializationWitness, writeSwmMaterializationWitness, invalidateSwmMaterializationWitness, } from './swm-materialization-witness.js';
 // Side-effect: register built-in adapters
 import './adapters/oxigraph.js';
 import './adapters/oxigraph-worker.js';

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAeL,0BAA0B,EAC1B,iBAAiB,EACjB,0BAA0B,EAC1B,yBAAyB,EACzB,mCAAmC,EACnC,2BAA2B,EAC3B,iBAAiB,EACjB,iBAAiB,GAElB,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EACL,mCAAmC,EACnC,+BAA+B,EAC/B,uCAAuC,EACvC,6BAA6B,EAC7B,+BAA+B,EAC/B,gCAAgC,GAGjC,MAAM,2BAA2B,CAAC;AACnC,OAAO,EACL,qCAAqC,EACrC,yCAAyC,EACzC,+BAA+B,EAC/B,iCAAiC,GAElC,MAAM,mCAAmC,CAAC;AAC3C,OAAO,EACL,sBAAsB,EACtB,uBAAuB,EACvB,8BAA8B,EAC9B,yCAAyC,EACzC,yBAAyB,EACzB,mCAAmC,GAKpC,MAAM,+BAA+B,CAAC;AACvC,OAAO,EACL,6BAA6B,EAC7B,0BAA0B,EAC1B,qCAAqC,EACrC,4BAA4B,GAE7B,MAAM,uCAAuC,CAAC;AAC/C,OAAO,EACL,+BAA+B,EAC/B,mDAAmD,EACnD,kBAAkB,GAInB,MAAM,4BAA4B,CAAC;AACpC,OAAO,EACL,eAAe,EACf,wBAAwB,EACxB,cAAc,EACd,mBAAmB,EACnB,iBAAiB,GAOlB,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EACL,oBAAoB,EACpB,qBAAqB,GAEtB,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EACL,mBAAmB,EACnB,WAAW,EACX,aAAa,EACb,mBAAmB,EACnB,sCAAsC,GAIvC,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,0BAA0B,EAAE,MAAM,0BAA0B,CAAC;AACtE,OAAO,EACL,kCAAkC,GAEnC,MAAM,4CAA4C,CAAC;AAEpD,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,mBAAmB,EAAE,MAAM,+BAA+B,CAAC;AACpE,OAAO,EACL,eAAe,EACf,uCAAuC,GAExC,MAAM,0BAA0B,CAAC;AAClC,OAAO,EACL,eAAe,GAIhB,MAAM,2BAA2B,CAAC;AACnC,OAAO,EACL,mBAAmB,EACnB,YAAY,EACZ,6BAA6B,EAC7B,6BAA6B,EAC7B,wCAAwC,EACxC,oCAAoC,EACpC,8BAA8B,EAC9B,kCAAkC,EAClC,iCAAiC,EACjC,6BAA6B,EAC7B,iCAAiC,EAGjC,6BAA6B,GAS9B,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EACL,mBAAmB,GAEpB,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EAAE,+BAA+B,EAAE,MAAM,6BAA6B,CAAC;AAE9E,0CAA0C;AAC1C,OAAO,wBAAwB,CAAC;AAChC,OAAO,+BAA+B,CAAC;AACvC,OAAO,0BAA0B,CAAC;AAClC,OAAO,2BAA2B,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAeL,0BAA0B,EAC1B,iBAAiB,EACjB,0BAA0B,EAC1B,yBAAyB,EACzB,mCAAmC,EACnC,2BAA2B,EAC3B,iBAAiB,EACjB,iBAAiB,GAElB,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EACL,mCAAmC,EACnC,+BAA+B,EAC/B,uCAAuC,EACvC,6BAA6B,EAC7B,+BAA+B,EAC/B,gCAAgC,GAGjC,MAAM,2BAA2B,CAAC;AACnC,OAAO,EACL,qCAAqC,EACrC,yCAAyC,EACzC,+BAA+B,EAC/B,iCAAiC,GAElC,MAAM,mCAAmC,CAAC;AAC3C,OAAO,EACL,sBAAsB,EACtB,uBAAuB,EACvB,8BAA8B,EAC9B,yCAAyC,EACzC,yBAAyB,EACzB,mCAAmC,GAKpC,MAAM,+BAA+B,CAAC;AACvC,OAAO,EACL,6BAA6B,EAC7B,0BAA0B,EAC1B,qCAAqC,EACrC,4BAA4B,GAE7B,MAAM,uCAAuC,CAAC;AAC/C,OAAO,EACL,+BAA+B,EAC/B,mDAAmD,EACnD,kBAAkB,GAInB,MAAM,4BAA4B,CAAC;AACpC,OAAO,EACL,eAAe,EACf,wBAAwB,EACxB,cAAc,EACd,mBAAmB,EACnB,iBAAiB,GAOlB,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EACL,oBAAoB,EACpB,qBAAqB,GAEtB,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EACL,mBAAmB,EACnB,WAAW,EACX,aAAa,EACb,mBAAmB,EACnB,sCAAsC,GAIvC,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,0BAA0B,EAAE,MAAM,0BAA0B,CAAC;AACtE,OAAO,EACL,kCAAkC,GAEnC,MAAM,4CAA4C,CAAC;AAEpD,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,mBAAmB,EAAE,MAAM,+BAA+B,CAAC;AACpE,OAAO,EACL,eAAe,EACf,uCAAuC,GAExC,MAAM,0BAA0B,CAAC;AAClC,OAAO,EACL,eAAe,GAIhB,MAAM,2BAA2B,CAAC;AACnC,OAAO,EACL,mBAAmB,EACnB,YAAY,EACZ,6BAA6B,EAC7B,6BAA6B,EAC7B,wCAAwC,EACxC,oCAAoC,EACpC,8BAA8B,EAC9B,kCAAkC,EAClC,iCAAiC,EACjC,6BAA6B,EAC7B,iCAAiC,EAGjC,6BAA6B,GAS9B,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EACL,mBAAmB,GAEpB,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EAAE,+BAA+B,EAAE,MAAM,6BAA6B,CAAC;AAC9E,gFAAgF;AAChF,8EAA8E;AAC9E,cAAc;AACd,OAAO,EACL,iCAAiC,EACjC,gCAAgC,EAChC,6BAA6B,EAC7B,8BAA8B,EAC9B,mCAAmC,GACpC,MAAM,kCAAkC,CAAC;AAE1C,0CAA0C;AAC1C,OAAO,wBAAwB,CAAC;AAChC,OAAO,+BAA+B,CAAC;AACvC,OAAO,0BAA0B,CAAC;AAClC,OAAO,2BAA2B,CAAC"}

package/dist/private-store.js

@@ -90,24 +90,24 @@ export class PrivateContentStore {
             const subjectVals = incomingSubjects
                 .map((s) => `<${assertSafeIri(s)}>`)
                 .join(' ');
-            sparql = `
-        SELECT ?s ?p ?o WHERE {
-          GRAPH ${escapedGraph} {
-            VALUES ?s { ${subjectVals} }
-            VALUES ?p { ${escapedPredicateVals} }
-            ?s ?p ?o .
-          }
-        }
+            sparql = `
+        SELECT ?s ?p ?o WHERE {
+          GRAPH ${escapedGraph} {
+            VALUES ?s { ${subjectVals} }
+            VALUES ?p { ${escapedPredicateVals} }
+            ?s ?p ?o .
+          }
+        }
       `;
         }
         else {
-            sparql = `
-        SELECT ?s ?p ?o WHERE {
-          GRAPH ${escapedGraph} {
-            VALUES ?p { ${escapedPredicateVals} }
-            ?s ?p ?o .
-          }
-        }
+            sparql = `
+        SELECT ?s ?p ?o WHERE {
+          GRAPH ${escapedGraph} {
+            VALUES ?p { ${escapedPredicateVals} }
+            ?s ?p ?o .
+          }
+        }
       `;
         }
         const keys = new Set();
@@ -329,10 +329,10 @@ export class PrivateContentStore {
         assertSafeIri(rootEntity);
         const graphUri = this.privateStagingGraph(contextGraphId, shareOperationId, subGraphName);
         const subject = privateStageSubject(contextGraphId, shareOperationId, rootEntity, subGraphName);
-        const result = await this.store.query(`SELECT ?payload WHERE {
-        GRAPH <${assertSafeIri(graphUri)}> {
-          <${assertSafeIri(subject)}> <http://dkg.io/ontology/privateStagedQuads> ?payload .
-        }
+        const result = await this.store.query(`SELECT ?payload WHERE {
+        GRAPH <${assertSafeIri(graphUri)}> {
+          <${assertSafeIri(subject)}> <http://dkg.io/ontology/privateStagedQuads> ?payload .
+        }
       } LIMIT 1`);
         if (result.type !== 'bindings' || result.bindings.length === 0)
             return [];
@@ -350,16 +350,16 @@ export class PrivateContentStore {
     }
     async getPrivateTriples(contextGraphId, rootEntity, subGraphName) {
         const graphUri = this.privateGraph(contextGraphId, subGraphName);
-        const sparql = `
-      SELECT ?s ?p ?o WHERE {
-        GRAPH <${assertSafeIri(graphUri)}> {
-          ?s ?p ?o .
-          FILTER(
-            ?s = <${assertSafeIri(rootEntity)}>
-            || STRSTARTS(STR(?s), "${escapeSparqlLiteral(rootEntity)}/.well-known/genid/")
-          )
-        }
-      }
+        const sparql = `
+      SELECT ?s ?p ?o WHERE {
+        GRAPH <${assertSafeIri(graphUri)}> {
+          ?s ?p ?o .
+          FILTER(
+            ?s = <${assertSafeIri(rootEntity)}>
+            || STRSTARTS(STR(?s), "${escapeSparqlLiteral(rootEntity)}/.well-known/genid/")
+          )
+        }
+      }
     `;
         const result = await this.store.query(sparql);
         if (result.type !== 'bindings')
@@ -414,10 +414,10 @@ export class PrivateContentStore {
      * stored slice.
      */
     async readPrivateCommitment(graphUri, markerSubject) {
-        const result = await this.store.query(`SELECT ?c WHERE {
-        GRAPH <${assertSafeIri(graphUri)}> {
-          <${assertSafeIri(markerSubject)}> <${PRIVATE_COMMITMENT_PRED}> ?c .
-        }
+        const result = await this.store.query(`SELECT ?c WHERE {
+        GRAPH <${assertSafeIri(graphUri)}> {
+          <${assertSafeIri(markerSubject)}> <${PRIVATE_COMMITMENT_PRED}> ?c .
+        }
       } LIMIT 1`);
         if (result.type !== 'bindings' || result.bindings.length === 0)
             return undefined;

package/dist/swm-materialization-witness.d.ts

@@ -0,0 +1,54 @@
+import type { QueryOptions, TripleStore } from './triple-store.js';
+export declare const SWM_MATERIALIZATION_WITNESS_GRAPH = "urn:dkg:local:swm-materialization-witness";
+/**
+ * One subject per assertion graph — NOT per (graph, digest) pair.
+ *
+ * Keying the subject on the graph alone is what makes a new digest EVICT the
+ * old claim in the same atomic replace. Folding the digest into the subject IRI
+ * would leave the previous version's row standing, so a later return to that
+ * digest — or any equal-count replace — would find a standing lie.
+ *
+ * PRECONDITION: `assertionGraph` carries no `#`. Every caller passes a
+ * `knowledgeAssetLayerGraphUri`, which does not, but `assertSafeIri` does NOT
+ * reject `#` — so a fragment-bearing graph would yield a double-fragment IRI
+ * here. That would be a distinct, self-consistent subject rather than a
+ * collision (both write and read derive it the same way), but it is outside
+ * what this keying scheme intends.
+ */
+export declare function swmMaterializationWitnessSubject(assertionGraph: string): string;
+/**
+ * Has this node verified `assertionGraph` at exactly `digest`?
+ *
+ * A bound-subject ASK: O(1) regardless of graph size. Both the subject and the
+ * digest are bound, so a witness for a DIFFERENT digest reads as a miss rather
+ * than a hit — which is what makes an equal-count version change safe.
+ */
+export declare function readSwmMaterializationWitness(store: TripleStore, assertionGraph: string, digest: string, options?: QueryOptions): Promise<boolean>;
+/**
+ * Record that this node verified `assertionGraph` at `digest`, evicting any
+ * prior claim for that graph.
+ *
+ * Returns `false` when the store cannot do an atomic single-subject replace —
+ * in which case NOTHING is written. That is deliberate and is the one place
+ * this module departs from the usual `tryReplaceSubjectAtomically` idiom, which
+ * falls back to delete-then-insert: a missing witness is always safe (it costs
+ * one recomputation), whereas a non-atomic fallback could leave two digest rows
+ * for one graph after an interrupted write — and a stale digest row IS a
+ * standing lie. Never add a fallback here.
+ */
+export declare function writeSwmMaterializationWitness(store: TripleStore, assertionGraph: string, digest: string, options?: QueryOptions): Promise<boolean>;
+/**
+ * Drop the witness for `assertionGraph`.
+ *
+ * Call this from every path that replaces or removes the graph's content WITHIN
+ * a lock this module can see. The three unlockable paths named in the module
+ * doc are covered by the caller's count gate instead — they cannot be covered
+ * here, and pretending otherwise would be worse than leaving them to the count.
+ */
+export declare function invalidateSwmMaterializationWitness(store: {
+    deleteByPattern(pattern: {
+        graph: string;
+        subject: string;
+    }, options?: QueryOptions): Promise<unknown>;
+}, assertionGraph: string, options?: QueryOptions): Promise<void>;
+//# sourceMappingURL=swm-materialization-witness.d.ts.map

package/dist/swm-materialization-witness.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"swm-materialization-witness.d.ts","sourceRoot":"","sources":["../src/swm-materialization-witness.ts"],"names":[],"mappings":"AA4GA,OAAO,KAAK,EAAE,YAAY,EAAQ,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAGzE,eAAO,MAAM,iCAAiC,8CAA8C,CAAC;AAI7F;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,gCAAgC,CAAC,cAAc,EAAE,MAAM,GAAG,MAAM,CAE/E;AAED;;;;;;GAMG;AACH,wBAAsB,6BAA6B,CACjD,KAAK,EAAE,WAAW,EAClB,cAAc,EAAE,MAAM,EACtB,MAAM,EAAE,MAAM,EACd,OAAO,GAAE,YAAiB,GACzB,OAAO,CAAC,OAAO,CAAC,CAclB;AAED;;;;;;;;;;;GAWG;AACH,wBAAsB,8BAA8B,CAClD,KAAK,EAAE,WAAW,EAClB,cAAc,EAAE,MAAM,EACtB,MAAM,EAAE,MAAM,EACd,OAAO,GAAE,YAAiB,GACzB,OAAO,CAAC,OAAO,CAAC,CAqBlB;AAED;;;;;;;GAOG;AACH,wBAAsB,mCAAmC,CAMvD,KAAK,EAAE;IAAE,eAAe,CAAC,OAAO,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAA;KAAE,EAAE,OAAO,CAAC,EAAE,YAAY,GAAG,OAAO,CAAC,OAAO,CAAC,CAAA;CAAE,EACjH,cAAc,EAAE,MAAM,EACtB,OAAO,GAAE,YAAiB,GACzB,OAAO,CAAC,IAAI,CAAC,CAQf"}

package/dist/swm-materialization-witness.js

@@ -0,0 +1,197 @@
+/**
+ * A node-local memo recording that THIS node verified a graph-scoped SWM
+ * assertion graph against a specific content digest (issue #2079).
+ *
+ * Like `LOCAL_TRUSTED_KA_CONTROLS_GRAPH`, this graph deliberately lives outside
+ * every context-graph prefix, so durable sync neither serves nor ingests it as
+ * peer metadata.
+ *
+ * ## What this is, and what it is NOT
+ *
+ * It is a **memo of a measurement this node already took** — written only from
+ * the branch that has just computed the digest over its own store content and
+ * found it matching. It is never an independent claim that something is
+ * materialized.
+ *
+ * That distinction is the whole design. A witness derived from anything a PEER
+ * sent is unsound: the bulk `storeInsert(processed.verifiedMeta)` writes head
+ * rows for every descriptor in verified metadata with no dependency on whether
+ * that KA's graph was materialized, so using a head row as the witness grows
+ * MORE likely to wrongly report "already done" the more catch-up rounds a node
+ * runs. That design was proposed for #2079 and killed in review; this module
+ * exists to be the sound alternative, not a variation on it.
+ *
+ * ## The witness is NOT sufficient on its own — callers must keep a count gate
+ *
+ * A witness records that the content WAS correct, not that it still IS. What
+ * happens to the content splits into two classes, and the distinction is the
+ * whole safety argument — do NOT collapse them into one list of "paths that
+ * change the graph".
+ *
+ * **REMOVALS — covered by the caller's count gate, no invalidation needed.**
+ * These leave an empty or absent graph, so `COUNT` returns 0 ≠ expected and the
+ * witness is never consulted:
+ *
+ *   - the shared-memory TTL sweep (`cleanupExpiredSharedMemory`), on a timer;
+ *   - the chain-reset wipe, whose scoped delete filters on the context-graph,
+ *     publisher and changelog prefixes only — so a `urn:dkg:local:*` witness
+ *     SURVIVES a wipe that deletes every context-graph triple.
+ *
+ * **REPLACES — NOT covered by the count gate. Every one MUST invalidate.**
+ * A replace can leave the quad count unchanged while the content differs, which
+ * is exactly the case `COUNT` cannot see. Known sites, all on the byte-identical
+ * assertion-graph URI:
+ *
+ *   1. the sync materializer's own `replaceGraph`;
+ *   2. live gossip apply (`workspace-handler`);
+ *   3. the graph-scoped VM update path (`dkg-agent-publish`);
+ *   4. storage-ack persistence (`storage-ack-handler`);
+ *   5-6. the private SWM recovery lane (`swm-recovery`, two calls) — lane-disjoint
+ *     in automatic operation but reachable via the `recover-shared-memory` route;
+ *   7. WM→SWM promotion (`dkg-publisher`);
+ *   8. RFC-64 public-catalog activation
+ *     (`public-catalog-native-receiver-v1.activateExactPublicProjection`), which
+ *     uses `tryReplaceGraphAndSubjectAtomically` — see the grep note below.
+ *
+ * Two nearby RFC-64 sites are deliberately NOT obligations: rollback restore
+ * puts back the exact preimage, so a standing witness becomes valid again; and
+ * deactivation replaces with `[]`, leaving an empty graph the count gate covers.
+ *
+ * This list is a snapshot, not a closed set. **Any new whole-graph replace of a
+ * SWM assertion graph is a new obligation here** — treat adding one without an
+ * invalidate as a defect.
+ *
+ * When you sweep for missed sites, grep the SHAPE, not one function name. The
+ * primitives in tree today are:
+ *
+ *   - `tryReplaceGraphAtomically`
+ *   - `tryReplaceGraphAndSubjectAtomically`   ← added the 8th site below
+ *   - `store.replaceGraph` directly (the recovery lane)
+ *
+ * An earlier revision of this comment named only the first. Four review rounds
+ * then greppped the token it named and kept reporting the set complete, while
+ * `public-catalog-native-receiver-v1`'s activation — which uses the second —
+ * sat unlisted and uninvalidated. **The tripwire caused the miss it existed to
+ * prevent.** If you add a fourth primitive, add it here in the same commit.
+ *
+ * **Callers must treat a witness hit as valid only after a count gate has
+ * already matched.** Do not "optimize" that count away: without it the removal
+ * paths above become permanent silent divergence certified as parity.
+ *
+ * The digest is part of the READ for the same reason the replace list exists: a
+ * standing v1 row cannot satisfy an ASK bound to v2's digest, which bounds the
+ * damage when an invalidate is missed or its best-effort call fails.
+ *
+ * ## Known costs — accepted deliberately, recorded so they don't read as bugs
+ *
+ * An accepted trade nobody wrote down is indistinguishable from an oversight six
+ * months later, so:
+ *
+ *   - **No GC.** Rows are orphaned whenever content is destroyed by a path that
+ *     cannot invalidate — the TTL sweep, VM publish, and the chain-reset wipe
+ *     (whose scoped delete spares `urn:dkg:local:*`). Bounded at two quads per
+ *     KA ever materialized, harmless because every read binds the digest, and
+ *     reclaimed on the next replace of that graph. A sweep keyed on
+ *     "assertion graph no longer exists" would close it.
+ *   - **A changelog marker per write.** This graph is in no reserved set
+ *     (`ChangelogStore`'s is `{CHANGELOG_GRAPH}` plus `options.reservedGraphs`,
+ *     which has no callers), so every cold-path write appends a marker and
+ *     advances `seq`. Local only — the delta lane filters on `isCandidateGraph`,
+ *     so it never reaches a peer.
+ *   - **A read is now also a write.** On a MISS the check performs an atomic
+ *     subject replace inside the KA write lock, where before it only read. Cold
+ *     or churning stores therefore pay slightly more than they used to; the
+ *     memo only pays back on warm ones. `DKG_SWM_MATERIALIZATION_WITNESS=0`
+ *     disables both the read and the write for a fleet that finds it net
+ *     negative.
+ */
+import { assertSafeIri, sparqlString } from '@origintrail-official/dkg-core';
+import { tryReplaceSubjectAtomically } from './triple-store.js';
+export const SWM_MATERIALIZATION_WITNESS_GRAPH = 'urn:dkg:local:swm-materialization-witness';
+const WITNESS_DIGEST_PREDICATE = 'urn:dkg:local:swm-materialization-witness:digest';
+/**
+ * One subject per assertion graph — NOT per (graph, digest) pair.
+ *
+ * Keying the subject on the graph alone is what makes a new digest EVICT the
+ * old claim in the same atomic replace. Folding the digest into the subject IRI
+ * would leave the previous version's row standing, so a later return to that
+ * digest — or any equal-count replace — would find a standing lie.
+ *
+ * PRECONDITION: `assertionGraph` carries no `#`. Every caller passes a
+ * `knowledgeAssetLayerGraphUri`, which does not, but `assertSafeIri` does NOT
+ * reject `#` — so a fragment-bearing graph would yield a double-fragment IRI
+ * here. That would be a distinct, self-consistent subject rather than a
+ * collision (both write and read derive it the same way), but it is outside
+ * what this keying scheme intends.
+ */
+export function swmMaterializationWitnessSubject(assertionGraph) {
+    return `${assertionGraph}#dkg-swm-materialized`;
+}
+/**
+ * Has this node verified `assertionGraph` at exactly `digest`?
+ *
+ * A bound-subject ASK: O(1) regardless of graph size. Both the subject and the
+ * digest are bound, so a witness for a DIFFERENT digest reads as a miss rather
+ * than a hit — which is what makes an equal-count version change safe.
+ */
+export async function readSwmMaterializationWitness(store, assertionGraph, digest, options = {}) {
+    const subject = swmMaterializationWitnessSubject(assertionGraph);
+    // Contained: this is a pure OPTIMISATION, so a transient store error must
+    // degrade to "not memoized" and let the caller do the real read-back. Letting
+    // it throw would make a check that used to succeed fail, which is a strictly
+    // worse outcome than recomputing.
+    const result = await store
+        .query(`ASK { GRAPH <${assertSafeIri(SWM_MATERIALIZATION_WITNESS_GRAPH)}> { `
+        + `<${assertSafeIri(subject)}> <${assertSafeIri(WITNESS_DIGEST_PREDICATE)}> ${sparqlString(digest)} } }`, options)
+        .catch(() => null);
+    return result?.type === 'boolean' && result.value === true;
+}
+/**
+ * Record that this node verified `assertionGraph` at `digest`, evicting any
+ * prior claim for that graph.
+ *
+ * Returns `false` when the store cannot do an atomic single-subject replace —
+ * in which case NOTHING is written. That is deliberate and is the one place
+ * this module departs from the usual `tryReplaceSubjectAtomically` idiom, which
+ * falls back to delete-then-insert: a missing witness is always safe (it costs
+ * one recomputation), whereas a non-atomic fallback could leave two digest rows
+ * for one graph after an interrupted write — and a stale digest row IS a
+ * standing lie. Never add a fallback here.
+ */
+export async function writeSwmMaterializationWitness(store, assertionGraph, digest, options = {}) {
+    const subject = swmMaterializationWitnessSubject(assertionGraph);
+    // Exactly ONE row. An earlier revision also stored a `verified-at-ms`
+    // timestamp; nothing read it, and every witness write appends a changelog
+    // marker and advances `seq`, so a second row doubled that churn for no
+    // consumer. Add a row here only when something reads it.
+    const quads = [
+        {
+            subject,
+            predicate: WITNESS_DIGEST_PREDICATE,
+            object: sparqlString(digest),
+            graph: SWM_MATERIALIZATION_WITNESS_GRAPH,
+        },
+    ];
+    return tryReplaceSubjectAtomically(store, SWM_MATERIALIZATION_WITNESS_GRAPH, subject, quads, options);
+}
+/**
+ * Drop the witness for `assertionGraph`.
+ *
+ * Call this from every path that replaces or removes the graph's content WITHIN
+ * a lock this module can see. The three unlockable paths named in the module
+ * doc are covered by the caller's count gate instead — they cannot be covered
+ * here, and pretending otherwise would be worse than leaving them to the count.
+ */
+export async function invalidateSwmMaterializationWitness(
+// Narrower than `TripleStore` on purpose: invalidation needs exactly one
+// capability, and every replace path that must call it is an obligation
+// regardless of how rich its store handle is. The private recovery lane holds
+// a `SwmRecoveryStore`, which is not a full `TripleStore` — requiring one here
+// would have made that site uncallable and quietly left it out of the set.
+store, assertionGraph, options = {}) {
+    await store.deleteByPattern({
+        graph: SWM_MATERIALIZATION_WITNESS_GRAPH,
+        subject: swmMaterializationWitnessSubject(assertionGraph),
+    }, options);
+}
+//# sourceMappingURL=swm-materialization-witness.js.map

package/dist/swm-materialization-witness.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"swm-materialization-witness.js","sourceRoot":"","sources":["../src/swm-materialization-witness.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA0GG;AACH,OAAO,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,gCAAgC,CAAC;AAE7E,OAAO,EAAE,2BAA2B,EAAE,MAAM,mBAAmB,CAAC;AAEhE,MAAM,CAAC,MAAM,iCAAiC,GAAG,2CAA2C,CAAC;AAE7F,MAAM,wBAAwB,GAAG,kDAAkD,CAAC;AAEpF;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,gCAAgC,CAAC,cAAsB;IACrE,OAAO,GAAG,cAAc,uBAAuB,CAAC;AAClD,CAAC;AAED;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,6BAA6B,CACjD,KAAkB,EAClB,cAAsB,EACtB,MAAc,EACd,UAAwB,EAAE;IAE1B,MAAM,OAAO,GAAG,gCAAgC,CAAC,cAAc,CAAC,CAAC;IACjE,0EAA0E;IAC1E,8EAA8E;IAC9E,6EAA6E;IAC7E,kCAAkC;IAClC,MAAM,MAAM,GAAG,MAAM,KAAK;SACvB,KAAK,CACJ,gBAAgB,aAAa,CAAC,iCAAiC,CAAC,MAAM;UACpE,IAAI,aAAa,CAAC,OAAO,CAAC,MAAM,aAAa,CAAC,wBAAwB,CAAC,KAAK,YAAY,CAAC,MAAM,CAAC,MAAM,EACxG,OAAO,CACR;SACA,KAAK,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;IACrB,OAAO,MAAM,EAAE,IAAI,KAAK,SAAS,IAAI,MAAM,CAAC,KAAK,KAAK,IAAI,CAAC;AAC7D,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,KAAK,UAAU,8BAA8B,CAClD,KAAkB,EAClB,cAAsB,EACtB,MAAc,EACd,UAAwB,EAAE;IAE1B,MAAM,OAAO,GAAG,gCAAgC,CAAC,cAAc,CAAC,CAAC;IACjE,sEAAsE;IACtE,0EAA0E;IAC1E,uEAAuE;IACvE,yDAAyD;IACzD,MAAM,KAAK,GAAW;QACpB;YACE,OAAO;YACP,SAAS,EAAE,wBAAwB;YACnC,MAAM,EAAE,YAAY,CAAC,MAAM,CAAC;YAC5B,KAAK,EAAE,iCAAiC;SACzC;KACF,CAAC;IACF,OAAO,2BAA2B,CAChC,KAAK,EACL,iCAAiC,EACjC,OAAO,EACP,KAAK,EACL,OAAO,CACR,CAAC;AACJ,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,mCAAmC;AACvD,yEAAyE;AACzE,wEAAwE;AACxE,8EAA8E;AAC9E,+EAA+E;AAC/E,2EAA2E;AAC3E,KAAiH,EACjH,cAAsB,EACtB,UAAwB,EAAE;IAE1B,MAAM,KAAK,CAAC,eAAe,CACzB;QACE,KAAK,EAAE,iCAAiC;QACxC,OAAO,EAAE,gCAAgC,CAAC,cAAc,CAAC;KAC1D,EACD,OAAO,CACR,CAAC;AACJ,CAAC"}

package/package.json

@@ -1,13 +1,13 @@
 {
   "name": "@origintrail-official/dkg-storage",
-  "version": "10.0.12",
+  "version": "10.0.13",
   "type": "module",
   "main": "dist/index.js",
   "types": "dist/index.d.ts",
   "dependencies": {
     "oxigraph": "^0.5",
-    "@origintrail-official/dkg-core": "10.0.12",
-    "@origintrail-official/dkg-rdf-utils": "10.0.12"
+    "@origintrail-official/dkg-core": "10.0.13",
+    "@origintrail-official/dkg-rdf-utils": "10.0.13"
   },
   "devDependencies": {
     "@vitest/coverage-v8": "^4.0.18",