@mikeargento/bitgraph-mcp 0.7.1 → 0.8.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +2 -2
- package/dist/server.d.ts +1 -1
- package/dist/server.js +1 -1
- package/package.json +3 -3
- package/src/server.ts +1 -1
package/README.md
CHANGED
|
@@ -2,9 +2,9 @@
|
|
|
2
2
|
|
|
3
3
|
MCP server for BitGraph. It gives any MCP client, Claude Code and Claude Desktop among them, the same three gestures the website has: make a BitGraph, check whether bytes are on record, and fetch a proof.
|
|
4
4
|
|
|
5
|
-
Making a BitGraph is one call for any number of files or folders, and everything in the call becomes ONE BitGraph, the way a drop on the site works: a single file is fused on its own
|
|
5
|
+
Making a BitGraph is one call for any number of files or folders, and everything in the call becomes ONE BitGraph, the way a drop on the site works: a single file is fused on its own position, with its Frame; two or more files become a set under one position. For a set, on your machine each file is read once for its SHA-256 (the origin) and a hasher state; an unused position is allocated in the ledger before any new file exists; every file's new fused bytes, the original plus a registered placement carrying that position's commitment (a 48-byte trailer for formats that ignore trailing bytes, a small tar container with the original first for everything else), are hashed from that state without being written or held; and the canonical list of those digests (above 2,000 files, a Merkle root over it) is committed under the same position. Those bytes could not have been finalized before the position was allocated and were committed no later than the commit. The new files are virtual: the original plus the set proof rebuilds them, and a lookup by any file's own digest finds the set.
|
|
6
6
|
|
|
7
|
-
BitGraph gives bytes a causal position in a forward-only ledger. Ethereum serves as a public clock, not a storage layer: the ledger periodically records the hash of a recent Ethereum block, and since a block's hash cannot be known before the block exists, the sequence is pinned to a public timeline. Nothing is ever written to Ethereum. This server reads files locally; only digests, the set's committed artifact and
|
|
7
|
+
BitGraph gives bytes a causal position in a forward-only ledger. Ethereum serves as a public clock, not a storage layer: the ledger periodically records the hash of a recent Ethereum block, and since a block's hash cannot be known before the block exists, the sequence is pinned to a public timeline. Nothing is ever written to Ethereum. This server reads files locally; only digests, the set's committed artifact and position records ever leave the machine. File contents are never uploaded, and files are never modified.
|
|
8
8
|
|
|
9
9
|
```sh
|
|
10
10
|
claude mcp add bitgraph -- npx -y @mikeargento/bitgraph-mcp
|
package/dist/server.d.ts
CHANGED
|
@@ -15,7 +15,7 @@
|
|
|
15
15
|
import { McpServer } from "@modelcontextprotocol/sdk/server/mcp.js";
|
|
16
16
|
import { type FuseFileFn, type FuseSetFn } from "@mikeargento/bitgraph-sdk";
|
|
17
17
|
export type { FuseFileFn, FuseSetFn, FusedSummary, SetSummary } from "@mikeargento/bitgraph-sdk";
|
|
18
|
-
export declare const SERVER_VERSION = "0.
|
|
18
|
+
export declare const SERVER_VERSION = "0.8.0";
|
|
19
19
|
/** Files one call may BitGraph after directories expand: one set. The site's own ceiling for a set/2. */
|
|
20
20
|
export declare const MAX_MEMBERS = 100000;
|
|
21
21
|
/** Rows the structured result lists in full; every fused row shares the set's position. */
|
package/dist/server.js
CHANGED
|
@@ -19,7 +19,7 @@ import { FuseError, MAX_SET_MEMBERS } from "@mikeargento/bitgraph";
|
|
|
19
19
|
import { ApiError, batchCheck, configFromEnv, getProofDetail, indexSetMembers, search, fromUrlSafeB64, looksLikeDigest, mapConcurrent, sha256FileB64, toUrlSafeB64, expandPaths, classifyPath, fuseFilePipeline, fuseSetPipeline, MAX_LOADED_BYTES, SLOT_TTL_SECONDS, beginTask, decodeTaskToken, sealTask, writeProofBeside, } from "@mikeargento/bitgraph-sdk";
|
|
20
20
|
import { capJson, positionOf, proofUrl, renderCheckMarkdown, renderProofMarkdown, renderRecordMarkdown, } from "./format.js";
|
|
21
21
|
import { TASK_INSTRUCTIONS } from "./instructions.js";
|
|
22
|
-
export const SERVER_VERSION = "0.
|
|
22
|
+
export const SERVER_VERSION = "0.8.0";
|
|
23
23
|
const SCAN_CONCURRENCY = 4;
|
|
24
24
|
/** Paths per call; a directory counts once and expands to its files. */
|
|
25
25
|
const MAX_PATHS = 2000;
|
package/package.json
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
{
|
|
2
2
|
"name": "@mikeargento/bitgraph-mcp",
|
|
3
|
-
"version": "0.
|
|
3
|
+
"version": "0.8.0",
|
|
4
4
|
"description": "MCP server for BitGraph. Make a BitGraph of files or folders (one set, one position for all of it), check whether bytes are on record, and fetch proofs from any MCP client.",
|
|
5
5
|
"keywords": [
|
|
6
6
|
"bitgraph",
|
|
@@ -46,8 +46,8 @@
|
|
|
46
46
|
},
|
|
47
47
|
"dependencies": {
|
|
48
48
|
"@mikeargento/bitgraph": "^1.8.0",
|
|
49
|
-
"@mikeargento/bitgraph-sdk": "^0.
|
|
50
|
-
"@mikeargento/bitgraph-verify": "^1.
|
|
49
|
+
"@mikeargento/bitgraph-sdk": "^0.3.0",
|
|
50
|
+
"@mikeargento/bitgraph-verify": "^1.15.0",
|
|
51
51
|
"@modelcontextprotocol/sdk": "^1.29.0",
|
|
52
52
|
"zod": "^3.25.0"
|
|
53
53
|
},
|
package/src/server.ts
CHANGED
|
@@ -45,7 +45,7 @@ import { TASK_INSTRUCTIONS } from "./instructions.js";
|
|
|
45
45
|
|
|
46
46
|
export type { FuseFileFn, FuseSetFn, FusedSummary, SetSummary } from "@mikeargento/bitgraph-sdk";
|
|
47
47
|
|
|
48
|
-
export const SERVER_VERSION = "0.
|
|
48
|
+
export const SERVER_VERSION = "0.8.0";
|
|
49
49
|
|
|
50
50
|
const SCAN_CONCURRENCY = 4;
|
|
51
51
|
/** Paths per call; a directory counts once and expands to its files. */
|