@themoltnet/pi-extension 0.3.0 → 0.4.0

package/dist/index.js

@@ -4,7 +4,7 @@ import { existsSync, mkdirSync, readFileSync, readdirSync, rmSync, statSync } fr
 import path, { join } from "node:path";
 import { DefaultResourceLoader, SessionManager, createAgentSession, createBashTool, createBashToolDefinition, createEditTool, createEditToolDefinition, createReadTool, createReadToolDefinition, createWriteTool, createWriteToolDefinition, defineTool } from "@mariozechner/pi-coding-agent";
 import { createHash, randomUUID } from "node:crypto";
-import { createHash as createHash$1 } from "crypto";
+import crypto, { createHash as createHash$1 } from "crypto";
 import { readFile } from "node:fs/promises";
 import { homedir } from "node:os";
 import { Type, complete, getModel } from "@mariozechner/pi-ai";
@@ -2810,7 +2810,7 @@ K512[1];
 * To break sha256 using birthday attack, attackers need to try 2^128 hashes.
 * BTC network is doing 2^70 hashes/sec (2^95 hashes/year) as per 2025.
 */
-var sha256 = /* @__PURE__ */ createHasher(() => new SHA256());
+var sha256$1 = /* @__PURE__ */ createHasher(() => new SHA256());
 //#endregion
 //#region ../../node_modules/.pnpm/multiformats@13.4.2/node_modules/multiformats/dist/src/bytes.js
 function equals$1(aa, bb) {
@@ -3027,12 +3027,12 @@ var Codec = class {
 		return this.decoder.decode(input);
 	}
 };
-function from({ name, prefix, encode, decode }) {
+function from$1({ name, prefix, encode, decode }) {
 	return new Codec(name, prefix, encode, decode);
 }
 function baseX({ name, prefix, alphabet }) {
 	const { encode, decode } = _brrp__multiformats_scope_baseX(alphabet, name);
-	return from({
+	return from$1({
 		prefix,
 		name,
 		encode,
@@ -3087,7 +3087,7 @@ function createAlphabetIdx(alphabet) {
 */
 function rfc4648({ name, prefix, bitsPerChar, alphabet }) {
 	const alphabetIdx = createAlphabetIdx(alphabet);
-	return from({
+	return from$1({
 		prefix,
 		name,
 		encode(input) {
@@ -3623,7 +3623,7 @@ function buildCanonicalInput(entryType, title, content, tags) {
 */
 function computeCanonicalHash(entryType, title, content, tags) {
 	const input = buildCanonicalInput(entryType, title, content, tags);
-	return sha256(new TextEncoder().encode(input));
+	return sha256$1(new TextEncoder().encode(input));
 }
 /**
 * Compute a CIDv1 content identifier for a diary entry.
@@ -4069,6 +4069,64 @@ etc.sha512Sync = (...m) => {
 	m.forEach((msg) => hash.update(msg));
 	return hash.digest();
 };
+new TextEncoder();
+new TextDecoder();
+//#endregion
+//#region ../../node_modules/.pnpm/multiformats@13.4.2/node_modules/multiformats/dist/src/hashes/hasher.js
+var DEFAULT_MIN_DIGEST_LENGTH = 20;
+function from({ name, code, encode, minDigestLength, maxDigestLength }) {
+	return new Hasher(name, code, encode, minDigestLength, maxDigestLength);
+}
+/**
+* Hasher represents a hashing algorithm implementation that produces as
+* `MultihashDigest`.
+*/
+var Hasher = class {
+	name;
+	code;
+	encode;
+	minDigestLength;
+	maxDigestLength;
+	constructor(name, code, encode, minDigestLength, maxDigestLength) {
+		this.name = name;
+		this.code = code;
+		this.encode = encode;
+		this.minDigestLength = minDigestLength ?? DEFAULT_MIN_DIGEST_LENGTH;
+		this.maxDigestLength = maxDigestLength;
+	}
+	digest(input, options) {
+		if (options?.truncate != null) {
+			if (options.truncate < this.minDigestLength) throw new Error(`Invalid truncate option, must be greater than or equal to ${this.minDigestLength}`);
+			if (this.maxDigestLength != null && options.truncate > this.maxDigestLength) throw new Error(`Invalid truncate option, must be less than or equal to ${this.maxDigestLength}`);
+		}
+		if (input instanceof Uint8Array) {
+			const result = this.encode(input);
+			if (result instanceof Uint8Array) return createDigest(result, this.code, options?.truncate);
+			return result.then((digest) => createDigest(digest, this.code, options?.truncate));
+		} else throw Error("Unknown type, must be binary type");
+	}
+};
+/**
+* Create a Digest from the passed uint8array and code, optionally truncating it
+* first.
+*/
+function createDigest(digest, code, truncate) {
+	if (truncate != null && truncate !== digest.byteLength) {
+		if (truncate > digest.byteLength) throw new Error(`Invalid truncate option, must be less than or equal to ${digest.byteLength}`);
+		digest = digest.subarray(0, truncate);
+	}
+	return create(code, digest);
+}
+from({
+	name: "sha2-256",
+	code: 18,
+	encode: (input) => coerce(crypto.createHash("sha256").update(input).digest())
+});
+from({
+	name: "sha2-512",
+	code: 19,
+	encode: (input) => coerce(crypto.createHash("sha512").update(input).digest())
+});
 //#endregion
 //#region ../../node_modules/.pnpm/cborg@4.5.8/node_modules/cborg/lib/is.js
 var objectTypeNames = [
@@ -8509,6 +8567,17 @@ var BUILT_IN_TASK_TYPES = {
 	}
 };
 //#endregion
+//#region ../tasks/src/task-type-registry.ts
+var schemaCids = null;
+function getTaskTypeRegistry() {
+	if (!schemaCids) throw new Error("Task type registry not initialized. Call initTaskTypeRegistry() first.");
+	return schemaCids;
+}
+new Proxy({}, { get(_, prop) {
+	if (typeof prop !== "string") return void 0;
+	return getTaskTypeRegistry().get(prop);
+} });
+//#endregion
 //#region ../tasks/src/wire.ts
 /**
 * Wire-format types for the MoltNet Task model.

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@themoltnet/pi-extension",
-  "version": "0.3.0",
+  "version": "0.4.0",
   "type": "module",
   "description": "MoltNet pi extension — sandboxed tool execution in Gondolin VMs with MoltNet identity and persistent memory",
   "license": "MIT",