@totemsdk/proofgraph 1.0.1 → 1.1.0

package/dist/index.js

@@ -1,4 +1,3 @@
-"use strict";
 /**
  * @module @totemsdk/proofgraph
  *
@@ -14,54 +13,11 @@
  *   const g1 = addProof(g0, signedProof);
  *   const result = verifyProofGraph(g1);
  */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.importProofGraph = exports.exportProofGraph = exports.verifyGraphProofs = exports.verifyProofGraph = exports.reachableFrom = exports.getEdgesBetween = exports.getManifestsForAddress = exports.resolveCurrentProofSet = exports.getProofLineage = exports.getEvidenceTrail = exports.findConflicts = exports.findSupersessions = exports.findRevocations = exports.findAnchorsForProof = exports.findProofsByIssuer = exports.findProofsBySubject = exports.getProofNodes = exports.getEdgesByType = exports.getEdgesTo = exports.getEdgesFrom = exports.findNode = exports.addAnchor = exports.addReceiptLike = exports.addManifest = exports.addIdentityClaim = exports.addProof = exports.addIdentityDocument = exports.addEdge = exports.addNode = exports.buildEdge = exports.setGraphMetadata = exports.createProofGraph = exports.recomputeGraphId = exports.computeProofGraphId = exports.computeEdgeId = exports.computeNodeId = exports.canonicalJson = exports.toHex = exports.normalizeEvidenceHash = exports.assertEvidenceBinding = exports.createProofGraphEvidenceStore = exports.createDurableProofGraphStore = void 0;
-var durable_store_js_1 = require("./durable-store.js");
-Object.defineProperty(exports, "createDurableProofGraphStore", { enumerable: true, get: function () { return durable_store_js_1.createDurableProofGraphStore; } });
-var evidence_js_1 = require("./evidence.js");
-Object.defineProperty(exports, "createProofGraphEvidenceStore", { enumerable: true, get: function () { return evidence_js_1.createProofGraphEvidenceStore; } });
-Object.defineProperty(exports, "assertEvidenceBinding", { enumerable: true, get: function () { return evidence_js_1.assertEvidenceBinding; } });
-Object.defineProperty(exports, "normalizeEvidenceHash", { enumerable: true, get: function () { return evidence_js_1.normalizeEvidenceHash; } });
-var canonical_js_1 = require("./canonical.js"); // canonicalJson / toHex re-exported from @totemsdk/proof
-Object.defineProperty(exports, "toHex", { enumerable: true, get: function () { return canonical_js_1.toHex; } });
-Object.defineProperty(exports, "canonicalJson", { enumerable: true, get: function () { return canonical_js_1.canonicalJson; } });
-Object.defineProperty(exports, "computeNodeId", { enumerable: true, get: function () { return canonical_js_1.computeNodeId; } });
-Object.defineProperty(exports, "computeEdgeId", { enumerable: true, get: function () { return canonical_js_1.computeEdgeId; } });
-Object.defineProperty(exports, "computeProofGraphId", { enumerable: true, get: function () { return canonical_js_1.computeProofGraphId; } });
-Object.defineProperty(exports, "recomputeGraphId", { enumerable: true, get: function () { return canonical_js_1.recomputeGraphId; } });
-var graph_js_1 = require("./graph.js");
-Object.defineProperty(exports, "createProofGraph", { enumerable: true, get: function () { return graph_js_1.createProofGraph; } });
-Object.defineProperty(exports, "setGraphMetadata", { enumerable: true, get: function () { return graph_js_1.setGraphMetadata; } });
-Object.defineProperty(exports, "buildEdge", { enumerable: true, get: function () { return graph_js_1.buildEdge; } });
-Object.defineProperty(exports, "addNode", { enumerable: true, get: function () { return graph_js_1.addNode; } });
-Object.defineProperty(exports, "addEdge", { enumerable: true, get: function () { return graph_js_1.addEdge; } });
-Object.defineProperty(exports, "addIdentityDocument", { enumerable: true, get: function () { return graph_js_1.addIdentityDocument; } });
-Object.defineProperty(exports, "addProof", { enumerable: true, get: function () { return graph_js_1.addProof; } });
-Object.defineProperty(exports, "addIdentityClaim", { enumerable: true, get: function () { return graph_js_1.addIdentityClaim; } });
-Object.defineProperty(exports, "addManifest", { enumerable: true, get: function () { return graph_js_1.addManifest; } });
-Object.defineProperty(exports, "addReceiptLike", { enumerable: true, get: function () { return graph_js_1.addReceiptLike; } });
-Object.defineProperty(exports, "addAnchor", { enumerable: true, get: function () { return graph_js_1.addAnchor; } });
-var query_js_1 = require("./query.js");
-Object.defineProperty(exports, "findNode", { enumerable: true, get: function () { return query_js_1.findNode; } });
-Object.defineProperty(exports, "getEdgesFrom", { enumerable: true, get: function () { return query_js_1.getEdgesFrom; } });
-Object.defineProperty(exports, "getEdgesTo", { enumerable: true, get: function () { return query_js_1.getEdgesTo; } });
-Object.defineProperty(exports, "getEdgesByType", { enumerable: true, get: function () { return query_js_1.getEdgesByType; } });
-Object.defineProperty(exports, "getProofNodes", { enumerable: true, get: function () { return query_js_1.getProofNodes; } });
-Object.defineProperty(exports, "findProofsBySubject", { enumerable: true, get: function () { return query_js_1.findProofsBySubject; } });
-Object.defineProperty(exports, "findProofsByIssuer", { enumerable: true, get: function () { return query_js_1.findProofsByIssuer; } });
-Object.defineProperty(exports, "findAnchorsForProof", { enumerable: true, get: function () { return query_js_1.findAnchorsForProof; } });
-Object.defineProperty(exports, "findRevocations", { enumerable: true, get: function () { return query_js_1.findRevocations; } });
-Object.defineProperty(exports, "findSupersessions", { enumerable: true, get: function () { return query_js_1.findSupersessions; } });
-Object.defineProperty(exports, "findConflicts", { enumerable: true, get: function () { return query_js_1.findConflicts; } });
-Object.defineProperty(exports, "getEvidenceTrail", { enumerable: true, get: function () { return query_js_1.getEvidenceTrail; } });
-Object.defineProperty(exports, "getProofLineage", { enumerable: true, get: function () { return query_js_1.getProofLineage; } });
-Object.defineProperty(exports, "resolveCurrentProofSet", { enumerable: true, get: function () { return query_js_1.resolveCurrentProofSet; } });
-Object.defineProperty(exports, "getManifestsForAddress", { enumerable: true, get: function () { return query_js_1.getManifestsForAddress; } });
-Object.defineProperty(exports, "getEdgesBetween", { enumerable: true, get: function () { return query_js_1.getEdgesBetween; } });
-Object.defineProperty(exports, "reachableFrom", { enumerable: true, get: function () { return query_js_1.reachableFrom; } });
-var verify_js_1 = require("./verify.js");
-Object.defineProperty(exports, "verifyProofGraph", { enumerable: true, get: function () { return verify_js_1.verifyProofGraph; } });
-Object.defineProperty(exports, "verifyGraphProofs", { enumerable: true, get: function () { return verify_js_1.verifyGraphProofs; } });
-var io_js_1 = require("./io.js");
-Object.defineProperty(exports, "exportProofGraph", { enumerable: true, get: function () { return io_js_1.exportProofGraph; } });
-Object.defineProperty(exports, "importProofGraph", { enumerable: true, get: function () { return io_js_1.importProofGraph; } });
+export { createDurableProofGraphStore, } from './durable-store.js';
+export { createProofGraphEvidenceStore, assertEvidenceBinding, normalizeEvidenceHash, } from './evidence.js';
+export { toHex, canonicalJson, computeNodeId, computeEdgeId, computeProofGraphId, recomputeGraphId, } from './canonical.js'; // canonicalJson / toHex re-exported from @totemsdk/proof
+export { createProofGraph, setGraphMetadata, buildEdge, addNode, addEdge, addIdentityDocument, addProof, addIdentityClaim, addManifest, addManifestRevision, addReceiptLike, addAnchor, } from './graph.js';
+export { findNode, getEdgesFrom, getEdgesTo, getEdgesByType, getProofNodes, findProofsBySubject, findProofsByIssuer, findAnchorsForProof, findRevocations, findSupersessions, findConflicts, getEvidenceTrail, getProofLineage, resolveCurrentProofSet, getManifestRevisions, getManifestsForAddress, getEdgesBetween, reachableFrom, } from './query.js';
+export { verifyProofGraph, verifyGraphProofs, } from './verify.js';
+export { exportProofGraph, importProofGraph, } from './io.js';
+export * from './replicated-evidence.js';

package/dist/io.js

@@ -1,4 +1,3 @@
-"use strict";
 /**
  * Serialization helpers for ProofGraph.
  *
@@ -9,10 +8,7 @@
  * The graphId guards against silent corruption in transit. Node/edge
  * validation prevents hostile or malformed input from entering the system.
  */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.exportProofGraph = exportProofGraph;
-exports.importProofGraph = importProofGraph;
-const canonical_js_1 = require("./canonical.js");
+import { recomputeGraphId } from './canonical.js';
 const VALID_NODE_TYPES = new Set([
     'proof', 'identity', 'identity-claim', 'manifest', 'address',
     'subject', 'evidence', 'anchor', 'receipt', 'payment', 'device',
@@ -121,7 +117,7 @@ function checkDepth(obj, depth, maxDepth, path) {
  * Serialize a ProofGraph to a JSON string.
  * The stored graphId was computed at mutation time and is included as-is.
  */
-function exportProofGraph(graph) {
+export function exportProofGraph(graph) {
     return JSON.stringify(graph);
 }
 /**
@@ -133,7 +129,7 @@ function exportProofGraph(graph) {
  *
  * @throws Error if parsing, validation, or graphId verification fails.
  */
-function importProofGraph(json) {
+export function importProofGraph(json) {
     let parsed;
     try {
         parsed = JSON.parse(json);
@@ -163,7 +159,7 @@ function importProofGraph(json) {
     }
     // Recompute and verify graphId
     const originalId = typeof graph.graphId === 'string' ? graph.graphId : '';
-    const recomputed = (0, canonical_js_1.recomputeGraphId)(graph);
+    const recomputed = recomputeGraphId(graph);
     // If a stored graphId exists, verify it matches
     if (originalId !== '' && recomputed !== originalId) {
         throw new Error(`importProofGraph: graphId mismatch — stored="${originalId}" recomputed="${recomputed}"`);

package/dist/query.d.ts

@@ -70,6 +70,10 @@ export declare function resolveCurrentProofSet(graph: ProofGraph): ProofGraphNod
  * Return all manifest nodes linked to a given address via 'manifests_as' edges.
  */
 export declare function getManifestsForAddress(graph: ProofGraph, address: string): ProofGraphNode[];
+/**
+ * Return all content-addressed revisions of a logical manifest, ordered by envelope ID.
+ */
+export declare function getManifestRevisions(graph: ProofGraph, manifestId: string): ProofGraphNode[];
 /**
  * Return all edges between two nodes (in either direction).
  */

package/dist/query.js

@@ -1,38 +1,19 @@
-"use strict";
 /**
  * Query helpers for ProofGraph — pure read-only utilities.
  *
  * All functions receive a ProofGraph and return data without mutating the graph.
  * Function names match the @totemsdk/proofgraph public API spec exactly.
  */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.findNode = findNode;
-exports.getEdgesFrom = getEdgesFrom;
-exports.getEdgesTo = getEdgesTo;
-exports.getEdgesByType = getEdgesByType;
-exports.getProofNodes = getProofNodes;
-exports.findProofsBySubject = findProofsBySubject;
-exports.findProofsByIssuer = findProofsByIssuer;
-exports.findAnchorsForProof = findAnchorsForProof;
-exports.findRevocations = findRevocations;
-exports.findSupersessions = findSupersessions;
-exports.findConflicts = findConflicts;
-exports.getEvidenceTrail = getEvidenceTrail;
-exports.getProofLineage = getProofLineage;
-exports.resolveCurrentProofSet = resolveCurrentProofSet;
-exports.getManifestsForAddress = getManifestsForAddress;
-exports.getEdgesBetween = getEdgesBetween;
-exports.reachableFrom = reachableFrom;
 /**
  * Find a node by its composed node ID (type:refId) or by refId alone.
  */
-function findNode(graph, id) {
+export function findNode(graph, id) {
     return graph.nodes.find((n) => n.id === id || n.refId === id);
 }
 /**
  * Return all outgoing edges from a node (identified by node ID or refId).
  */
-function getEdgesFrom(graph, nodeIdOrRefId) {
+export function getEdgesFrom(graph, nodeIdOrRefId) {
     const node = findNode(graph, nodeIdOrRefId);
     if (!node)
         return [];
@@ -41,7 +22,7 @@ function getEdgesFrom(graph, nodeIdOrRefId) {
 /**
  * Return all incoming edges to a node (identified by node ID or refId).
  */
-function getEdgesTo(graph, nodeIdOrRefId) {
+export function getEdgesTo(graph, nodeIdOrRefId) {
     const node = findNode(graph, nodeIdOrRefId);
     if (!node)
         return [];
@@ -50,19 +31,19 @@ function getEdgesTo(graph, nodeIdOrRefId) {
 /**
  * Return all edges of a given type.
  */
-function getEdgesByType(graph, type) {
+export function getEdgesByType(graph, type) {
     return graph.edges.filter((e) => e.type === type);
 }
 /**
  * Return all proof nodes in the graph.
  */
-function getProofNodes(graph) {
+export function getProofNodes(graph) {
     return graph.nodes.filter((n) => n.type === 'proof');
 }
 /**
  * Find all 'proof' nodes connected to a subject via 'about' OR 'proves' edges.
  */
-function findProofsBySubject(graph, subjectId) {
+export function findProofsBySubject(graph, subjectId) {
     const relevantEdges = graph.edges.filter((e) => (e.type === 'about' || e.type === 'proves') && e.to === subjectId);
     const proofRefIds = new Set(relevantEdges.map((e) => e.from));
     return graph.nodes.filter((n) => proofRefIds.has(n.refId) && n.type === 'proof');
@@ -70,7 +51,7 @@ function findProofsBySubject(graph, subjectId) {
 /**
  * Find all 'proof' nodes issued by a given address (via 'issued_by' edges).
  */
-function findProofsByIssuer(graph, issuerId) {
+export function findProofsByIssuer(graph, issuerId) {
     const issuedEdges = graph.edges.filter((e) => e.type === 'issued_by' && e.to === issuerId);
     const proofRefIds = new Set(issuedEdges.map((e) => e.from));
     return graph.nodes.filter((n) => proofRefIds.has(n.refId) && n.type === 'proof');
@@ -78,7 +59,7 @@ function findProofsByIssuer(graph, issuerId) {
 /**
  * Find all 'anchor' nodes linked to a proof via 'anchored_to' edges.
  */
-function findAnchorsForProof(graph, proofId) {
+export function findAnchorsForProof(graph, proofId) {
     const anchoredEdges = graph.edges.filter((e) => e.type === 'anchored_to' && e.from === proofId);
     const anchorRefIds = new Set(anchoredEdges.map((e) => e.to));
     return graph.nodes.filter((n) => anchorRefIds.has(n.refId) && n.type === 'anchor');
@@ -86,19 +67,19 @@ function findAnchorsForProof(graph, proofId) {
 /**
  * Find all 'revokes' edges whose target is the given proof node.
  */
-function findRevocations(graph, proofId) {
+export function findRevocations(graph, proofId) {
     return graph.edges.filter((e) => e.type === 'revokes' && e.to === proofId);
 }
 /**
  * Find all 'supersedes' edges whose target is the given proof node.
  */
-function findSupersessions(graph, proofId) {
+export function findSupersessions(graph, proofId) {
     return graph.edges.filter((e) => e.type === 'supersedes' && e.to === proofId);
 }
 /**
  * Find all 'conflicts_with' edges involving the given proof node (in either direction).
  */
-function findConflicts(graph, proofId) {
+export function findConflicts(graph, proofId) {
     return graph.edges.filter((e) => e.type === 'conflicts_with' &&
         (e.from === proofId || e.to === proofId));
 }
@@ -107,7 +88,7 @@ function findConflicts(graph, proofId) {
  * Returns nodes in insertion order (the order edges were added, which matches
  * the original evidence array order from addProof).
  */
-function getEvidenceTrail(graph, proofId) {
+export function getEvidenceTrail(graph, proofId) {
     const refEdges = graph.edges.filter((e) => e.type === 'references' && e.from === proofId);
     return refEdges
         .map((e) => graph.nodes.find((n) => n.refId === e.to && n.type === 'evidence'))
@@ -118,7 +99,7 @@ function getEvidenceTrail(graph, proofId) {
  * Returns the ordered chain of ancestor proof nodes (closest ancestor first).
  * Terminates on cycle detection.
  */
-function getProofLineage(graph, proofId, _visited = new Set()) {
+export function getProofLineage(graph, proofId, _visited = new Set()) {
     if (_visited.has(proofId))
         return [];
     _visited.add(proofId);
@@ -137,7 +118,7 @@ function getProofLineage(graph, proofId, _visited = new Set()) {
  * Return all proof nodes that are NOT the target of any 'revokes' or 'supersedes' edge.
  * These are the current / active proofs in the graph.
  */
-function resolveCurrentProofSet(graph) {
+export function resolveCurrentProofSet(graph) {
     const supersededOrRevoked = new Set();
     for (const edge of graph.edges) {
         if (edge.type === 'revokes' || edge.type === 'supersedes') {
@@ -149,15 +130,26 @@ function resolveCurrentProofSet(graph) {
 /**
  * Return all manifest nodes linked to a given address via 'manifests_as' edges.
  */
-function getManifestsForAddress(graph, address) {
+export function getManifestsForAddress(graph, address) {
     const manifestEdges = graph.edges.filter((e) => e.type === 'manifests_as' && e.to === address);
     const manifestRefIds = new Set(manifestEdges.map((e) => e.from));
     return graph.nodes.filter((n) => manifestRefIds.has(n.refId) && n.type === 'manifest');
 }
+/**
+ * Return all content-addressed revisions of a logical manifest, ordered by envelope ID.
+ */
+export function getManifestRevisions(graph, manifestId) {
+    const revisionRefs = new Set(graph.edges
+        .filter((edge) => edge.type === 'revision_of' && edge.to === manifestId)
+        .map((edge) => edge.from));
+    return graph.nodes
+        .filter((node) => node.type === 'manifest' && revisionRefs.has(node.refId))
+        .sort((a, b) => a.refId.localeCompare(b.refId));
+}
 /**
  * Return all edges between two nodes (in either direction).
  */
-function getEdgesBetween(graph, refIdA, refIdB) {
+export function getEdgesBetween(graph, refIdA, refIdB) {
     return graph.edges.filter((e) => (e.from === refIdA && e.to === refIdB) ||
         (e.from === refIdB && e.to === refIdA));
 }
@@ -165,7 +157,7 @@ function getEdgesBetween(graph, refIdA, refIdB) {
  * Return the set of all node refIds reachable from a given node via directed edges.
  * Includes the start node itself.
  */
-function reachableFrom(graph, startRefId, _visited = new Set()) {
+export function reachableFrom(graph, startRefId, _visited = new Set()) {
     if (_visited.has(startRefId))
         return _visited;
     _visited.add(startRefId);

package/dist/replicated-evidence.d.ts

@@ -0,0 +1,42 @@
+/**
+ * RFC-057 Phase 4 — replicated proofgraph evidence adapter.
+ *
+ * Keeps the authoritative proofgraph evidence store local while allowing a
+ * replicated index to locate the same digest-verified artifacts on other
+ * peers. The replicated index is never trusted for bytes: every read
+ * re-verifies the artifact digest.
+ */
+import type { ArtifactRef, ArtifactStore } from '@totemsdk/storage/artifacts';
+import type { ProofGraph } from './types.js';
+export interface ReplicatedEvidenceIndexEntry {
+    readonly nodeId: string;
+    readonly ref: ArtifactRef;
+    readonly contentHash: string;
+    readonly storedAt: number;
+}
+export interface ReplicatedEvidenceIndexPort {
+    get(key: string): Promise<unknown | null>;
+    put(key: string, value: unknown): Promise<void>;
+    list?(prefix?: string): AsyncIterable<{
+        key: string;
+        value: unknown;
+    }>;
+}
+export interface ReplicatedEvidenceRead {
+    readonly nodeId: string;
+    readonly status: 'ok' | 'not-found' | 'corrupt' | 'unavailable';
+    readonly ref?: ArtifactRef;
+    readonly bytes?: Uint8Array;
+    readonly message?: string;
+}
+export interface ReplicatedProofGraphEvidenceStore {
+    putEvidence(graph: ProofGraph, bytesFor: (nodeId: string) => Uint8Array | undefined): Promise<ArtifactRef[]>;
+    getEvidence(nodeId: string): Promise<ReplicatedEvidenceRead>;
+    verifyEvidence(nodeId: string): Promise<boolean>;
+    listEvidence(): AsyncIterable<ReplicatedEvidenceIndexEntry>;
+}
+export declare function createReplicatedProofGraphEvidenceStore(options: {
+    artifacts: ArtifactStore;
+    index: ReplicatedEvidenceIndexPort;
+    namespace?: string;
+}): ReplicatedProofGraphEvidenceStore;

package/dist/replicated-evidence.js

@@ -0,0 +1,95 @@
+/**
+ * RFC-057 Phase 4 — replicated proofgraph evidence adapter.
+ *
+ * Keeps the authoritative proofgraph evidence store local while allowing a
+ * replicated index to locate the same digest-verified artifacts on other
+ * peers. The replicated index is never trusted for bytes: every read
+ * re-verifies the artifact digest.
+ */
+import { sha3_256, toHex } from '@totemsdk/core';
+import { StorageError } from '@totemsdk/storage/errors';
+const KEY_PREFIX = 'proofgraph:evidence:';
+const DEFAULT_NAMESPACE = 'totem-proofgraph-evidence';
+function normalizeHash(value) {
+    return value.replace(/^0x/i, '').toLowerCase();
+}
+function evidenceNodes(graph) {
+    return graph.nodes.filter((node) => node.type === 'evidence');
+}
+function contentHashOf(node) {
+    const value = node.data?.contentHash;
+    return typeof value === 'string' && value.length > 0 ? value : undefined;
+}
+export function createReplicatedProofGraphEvidenceStore(options) {
+    if (!options.artifacts.capabilities.writable) {
+        throw new Error('replicated evidence store requires a writable artifact store');
+    }
+    const namespace = options.namespace ?? DEFAULT_NAMESPACE;
+    const key = (nodeId) => `${KEY_PREFIX}${nodeId}`;
+    return {
+        async putEvidence(graph, bytesFor) {
+            const refs = [];
+            for (const node of evidenceNodes(graph)) {
+                const bytes = bytesFor(node.id);
+                if (!bytes)
+                    continue;
+                const digest = toHex(sha3_256(bytes));
+                const contentHash = contentHashOf(node);
+                if (contentHash && normalizeHash(contentHash) !== digest) {
+                    throw new StorageError(`evidence commitment mismatch for node "${node.id}"`, 'corrupt', {
+                        key: key(node.id),
+                    });
+                }
+                const receipt = await options.artifacts.put(namespace, bytes);
+                if (contentHash && normalizeHash(contentHash) !== receipt.ref.digest) {
+                    throw new StorageError(`artifact digest mismatch for node "${node.id}"`, 'corrupt', {
+                        key: key(node.id),
+                    });
+                }
+                await options.index.put(key(node.id), {
+                    nodeId: node.id,
+                    ref: receipt.ref,
+                    contentHash: contentHash ?? receipt.ref.digest,
+                    storedAt: Date.now(),
+                });
+                refs.push(receipt.ref);
+            }
+            return refs;
+        },
+        async getEvidence(nodeId) {
+            const raw = await options.index.get(key(nodeId));
+            if (!raw)
+                return { nodeId, status: 'not-found' };
+            const entry = raw;
+            const read = await options.artifacts.get(entry.ref);
+            if (read.status !== 'ok' || !read.bytes) {
+                return {
+                    nodeId,
+                    status: read.status,
+                    ref: entry.ref,
+                    ...(read.message ? { message: read.message } : {}),
+                };
+            }
+            const digest = toHex(sha3_256(read.bytes));
+            if (normalizeHash(entry.contentHash) !== digest) {
+                return {
+                    nodeId,
+                    status: 'corrupt',
+                    ref: entry.ref,
+                    message: `evidence digest mismatch: ${digest} !== ${entry.contentHash}`,
+                };
+            }
+            return { nodeId, status: 'ok', ref: entry.ref, bytes: read.bytes };
+        },
+        async verifyEvidence(nodeId) {
+            return (await this.getEvidence(nodeId)).status === 'ok';
+        },
+        async *listEvidence() {
+            if (!options.index.list)
+                return;
+            for await (const entry of options.index.list(KEY_PREFIX)) {
+                yield entry.value;
+            }
+        },
+    };
+}

package/dist/types.d.ts

@@ -4,7 +4,7 @@
  * Pure schema — no network, no DHT, no blockchain submission, no crypto.
  */
 export type ProofGraphNodeType = 'proof' | 'identity' | 'identity-claim' | 'manifest' | 'address' | 'subject' | 'evidence' | 'anchor' | 'receipt' | 'payment' | 'device' | 'service' | 'policy' | 'custom';
-export type ProofGraphEdgeType = 'proves' | 'issued_by' | 'signed_by' | 'about' | 'references' | 'derived_from' | 'supports' | 'contradicts' | 'supersedes' | 'revokes' | 'anchored_to' | 'delegates_to' | 'controls' | 'depends_on' | 'manifests_as' | 'conflicts_with';
+export type ProofGraphEdgeType = 'proves' | 'issued_by' | 'signed_by' | 'about' | 'references' | 'derived_from' | 'supports' | 'contradicts' | 'supersedes' | 'revokes' | 'anchored_to' | 'delegates_to' | 'controls' | 'depends_on' | 'manifests_as' | 'revision_of' | 'conflicts_with';
 export interface ProofGraphNode {
     id: string;
     type: ProofGraphNodeType;

package/dist/types.js

@@ -1,7 +1,6 @@
-"use strict";
 /**
  * @totemsdk/proofgraph — Type definitions
  *
  * Pure schema — no network, no DHT, no blockchain submission, no crypto.
  */
-Object.defineProperty(exports, "__esModule", { value: true });
+export {};

package/dist/verify.js

@@ -1,4 +1,3 @@
-"use strict";
 /**
  * Graph-level verification.
  *
@@ -8,43 +7,7 @@
  *
  * verifyGraphProofs: same logic, returns the list of invalid proof IDs (string[]).
  */
-var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    var desc = Object.getOwnPropertyDescriptor(m, k);
-    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
-      desc = { enumerable: true, get: function() { return m[k]; } };
-    }
-    Object.defineProperty(o, k2, desc);
-}) : (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    o[k2] = m[k];
-}));
-var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
-    Object.defineProperty(o, "default", { enumerable: true, value: v });
-}) : function(o, v) {
-    o["default"] = v;
-});
-var __importStar = (this && this.__importStar) || (function () {
-    var ownKeys = function(o) {
-        ownKeys = Object.getOwnPropertyNames || function (o) {
-            var ar = [];
-            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
-            return ar;
-        };
-        return ownKeys(o);
-    };
-    return function (mod) {
-        if (mod && mod.__esModule) return mod;
-        var result = {};
-        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
-        __setModuleDefault(result, mod);
-        return result;
-    };
-})();
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.verifyProofGraph = verifyProofGraph;
-exports.verifyGraphProofs = verifyGraphProofs;
-const proofModule = __importStar(require("@totemsdk/proof"));
+import * as proofModule from '@totemsdk/proof';
 /**
  * Verify every proof node stored in the graph.
  *
@@ -52,7 +15,7 @@ const proofModule = __importStar(require("@totemsdk/proof"));
  * and calls proofModule.verifyProof() from @totemsdk/proof.
  * Returns { valid: true } if ALL proofs pass; otherwise lists the failing proofIds.
  */
-function verifyProofGraph(graph, _options) {
+export function verifyProofGraph(graph, _options) {
     const invalidProofs = [];
     for (const node of graph.nodes) {
         if (node.type !== 'proof' || !node.data)
@@ -72,6 +35,6 @@ function verifyProofGraph(graph, _options) {
  * Returns the list of invalid proof IDs in the graph.
  * Equivalent to verifyProofGraph(graph).invalidProofs.
  */
-function verifyGraphProofs(graph) {
+export function verifyGraphProofs(graph) {
     return verifyProofGraph(graph).invalidProofs;
 }

package/package.json

@@ -1,14 +1,19 @@
 {
   "name": "@totemsdk/proofgraph",
-  "version": "1.0.1",
+  "version": "1.1.0",
   "description": "Local deterministic proof relationship graph for Totem Edge — indexes proofs, identities, manifests, and subjects into a queryable content-addressed DAG",
-  "main": "dist/index.js",
-  "types": "dist/index.d.ts",
+  "main": "dist/cjs/index.js",
+  "types": "dist/cjs/index.d.ts",
   "exports": {
     ".": {
-      "types": "./dist/index.d.ts",
-      "require": "./dist/index.js",
-      "import": "./dist/index.js"
+      "import": {
+        "types": "./dist/index.d.ts",
+        "default": "./dist/index.js"
+      },
+      "require": {
+        "types": "./dist/cjs/index.d.ts",
+        "default": "./dist/cjs/index.js"
+      }
     }
   },
   "files": [
@@ -16,14 +21,15 @@
     "rust/pkg/",
     "rust/pkg-node/",
     "README.md",
-    "LICENSE"
+    "LICENSE",
+    "NOTICE"
   ],
   "dependencies": {
-    "@totemsdk/core": "^1.2.11",
-    "@totemsdk/proof": "^1.0.0",
-    "@totemsdk/storage": "^0.1.0",
-    "@totemsdk/manifest": "^1.0.0",
-    "@totemsdk/identity": "^1.0.1"
+    "@totemsdk/core": "^1.4.2",
+    "@totemsdk/proof": "^1.0.2",
+    "@totemsdk/storage": "^0.2.2",
+    "@totemsdk/identity": "^1.1.0",
+    "@totemsdk/manifest": "^2.1.0"
   },
   "devDependencies": {
     "@types/jest": "^30.0.0",
@@ -38,7 +44,7 @@
   "publishConfig": {
     "access": "public"
   },
-  "license": "MIT",
+  "license": "Apache-2.0",
   "author": "Totem SDK",
   "homepage": "https://docs.totem.ing",
   "bugs": {
@@ -65,8 +71,9 @@
     "verification",
     "content-addressed"
   ],
+  "type": "module",
   "scripts": {
-    "build": "npm run build:wasm && tsc && node ../../scripts/clean-wasm-output-ignores.mjs",
+    "build": "tsc && tsc -p tsconfig.cjs.json && node -e \"require('fs').writeFileSync('dist/cjs/package.json', JSON.stringify({type:'commonjs'})+'\\n')\"",
     "build:wasm": "cd rust && wasm-pack build --target bundler --out-dir pkg && wasm-pack build --target nodejs --out-dir pkg-node",
     "clean": "rm -rf dist rust/pkg rust/pkg-node rust/target",
     "test": "jest"

package/rust/pkg/package.json

@@ -6,7 +6,7 @@
   ],
   "description": "Local deterministic proof relationship graph — content-addressed DAG, node/edge ID computation, graph ID hashing, import/export validation (Rust/WASM)",
   "version": "0.1.0",
-  "license": "MIT",
+  "license": "Apache-2.0",
   "repository": {
     "type": "git",
     "url": "https://github.com/Totem-Edge/totem-sdk"
@@ -24,4 +24,4 @@
     "./proofgraph_wasm.js",
     "./snippets/*"
   ]
-}
+}

package/rust/pkg-node/package.json

@@ -5,7 +5,7 @@
   ],
   "description": "Local deterministic proof relationship graph — content-addressed DAG, node/edge ID computation, graph ID hashing, import/export validation (Rust/WASM)",
   "version": "0.1.0",
-  "license": "MIT",
+  "license": "Apache-2.0",
   "repository": {
     "type": "git",
     "url": "https://github.com/Totem-Edge/totem-sdk"
@@ -18,4 +18,4 @@
   "main": "proofgraph_wasm.js",
   "homepage": "https://totem.ing",
   "types": "proofgraph_wasm.d.ts"
-}
+}