MeTTa TS 1.1.4

Author: MesTTo

README.md

@@ -278,7 +278,7 @@ node packages/node/dist/cli.js examples/factorial.metta
 
 ## Performance
 
-The pure-MeTTa path stays TypeScript throughout, with no escape to native code. The interpreter uses a precomputed-ground short-circuit, structural sharing in substitution, a cons-list instruction stack, and Prolog-style clause indexing (by head functor and by every ground-leaf argument position). A functor-and-argument-keyed query over a 1,000,000-atom knowledge base resolves in about 0.2 to 1.4 ms. See [`packages/node/bench/RESULTS.md`](packages/node/bench/RESULTS.md) for the full benchmark log.
+The pure-MeTTa path stays TypeScript throughout, with no escape to native code. The interpreter uses a precomputed-ground short-circuit, structural sharing in substitution, a cons-list instruction stack, and Prolog-style clause indexing by head functor, indexable ground-leaf arguments at every position, and one nested expression-head level. A functor-and-argument-keyed query over a 1,000,000-atom knowledge base resolves in about 0.2 to 1.4 ms. See [`packages/node/bench/RESULTS.md`](packages/node/bench/RESULTS.md) for the full benchmark log.
 
 ### Head-to-head with PeTTa
 
@@ -325,7 +325,7 @@ That speed comes from general engine work:
 - an O(1)-stack worklist for nondeterminism;
 - ground-atom type memoisation;
 - an exact-match ground-fact index;
-- nested argument-functor indexing for ground runtime facts such as `(num (M $x))`;
+- nested argument-functor indexing for ground static and runtime facts such as `(num (M $x))`;
 - bounded automatic tabling of pure overlapping-recursive functions, with structural token keys, runtime rule-versioned entries, and one shared budget for completed and active tables;
 - consumer-directed distinct memoization and streaming choice deduplication only where `unique-atom(collapse(...))` makes duplicate derivations unobservable, while ordinary `collapse` keeps its exact ordered bag;
 - a slot-based evaluator for closed pure `let` and `superpose` products that preserves result order and multiplicity without allocating general binding frames;

RELEASE_NOTES.md

@@ -1,152 +1,70 @@
-# MeTTa TS 1.1.3
-
-MeTTa TS 1.1.3 improves nondeterministic evaluation and bounds every automatic
-table allocation. The default evaluator is faster than PeTTa on the four
-reported nondeterministic workloads while preserving Hyperon semantics. There
-is no benchmark mode, PeTTa mode, curry mode, or manually selected fast path.
-
-## Tested on Linux
-
-This release is prepared on Linux with Node 22 and pnpm 11. The release gate
-builds every package, typechecks the workspace, runs the full Vitest suite,
-builds the GitHub Pages documentation, runs the Hyperon oracle, runs the scale
-proof, and runs the benchmark suite before tagging.
-
-The final suite passed 109 test files and 1,063 tests, with 38 optional live
-integration tests skipped. The checked 270-assertion oracle passed all 23
-corpus files.
-
-The external Core/ST conformance result is unchanged from the untouched 1.1.2
-baseline: 431 passed, 77 failed, 60 manifest expected failures, and 0 skipped.
-The remaining failures are existing parser, directive, kernel, typing, and
-stdlib contract differences. This release does not claim full specification
-conformance.
-
-## Nondeterministic execution
-
-The new checked benchmark keeps four query shapes reported by Patrick Hammer
-as ordinary `.metta` files. Five-run subprocess medians include startup:
-
-| Program                          |     PeTTa |  MeTTa TS | Speedup |
-| -------------------------------- | --------: | --------: | ------: |
-| filtered `matespacefast` matches | 5738.1 ms | 3344.2 ms |   1.72x |
-| 22^4 `superpose` cross product   |  388.7 ms |  148.5 ms |   2.62x |
-| nondeterministic tabled `fib(7)` |  180.1 ms |   99.6 ms |   1.81x |
-| duplicate-heavy `TupleConcat`    |  178.8 ms |  101.1 ms |   1.77x |
-
-The harness validates 234,256 cross-product results, 196 distinct Fibonacci
-answers, the exact `TupleConcat` sequence, and the embedded matespace
-assertion. Run it with `pnpm bench:nondeterminism`.
-
-A slot-based choice evaluator handles closed pure `let`, `let*`, `superpose`,
-integer arithmetic, comparisons, `if`, and constructor tuples. Unsupported,
-redefined, ill-typed, async, or executable-grounded forms stay on the normal
-interpreter path. Result order and multiplicity are unchanged.
-
-`unique-atom(collapse(call))` can evaluate a supported static pure integer
-recurrence as a first-seen answer set. Closed pure choice products also retain
-first-seen answers as they emit instead of materializing a duplicate bag first.
-An ordinary `collapse(call)` still returns its exact ordered bag with duplicate
-derivations. Ground answer deduplication uses structural hashes with equality
-checks instead of a quadratic scan.
-
-## Bounded automatic tabling
-
-Automatic table admission remains conservative. The whole rule dependency
-graph must be pure, the call key must be safe, and the recursive component must
-branch back into itself at least twice. Linear recursion stays on the normal
-compiled path.
-
-The policy does not assume that every recursive program is safe to memoize and
-does not let admitted tables grow until the process runs out of memory. It
-combines the static overlap test with one global runtime budget. Exceeding the
-active-state budget returns `TableResourceLimit`; it does not continue toward
-an out-of-memory failure.
-
-Completed and active tables now share these default ceilings:
-
-- 50,000 entries
-- 1,000,000 answers
-- 1,000,000 retained atom cells
-- 100,000 cells in one entry
-- 250,000 interned leaves
-
-Completed tables are removed in least-recently-used order. Active tables are
-not evicted while their producer runs, so they return `TableResourceLimit` when
-the shared budget cannot fit more state. The consumer-directed recurrence memo
-uses the same entry, answer, cell, and per-entry limits. Interner generations
-prevent stale tail-call keys from writing after a reset.
-
-Direct active variant recursion still uses local-linear fixed-point completion.
-Non-cyclic calls preserve exact ordered bags. The evaluator does not infer
-Picat-style `min` or `max` answer subsumption.
-
-## Matching and scale
-
-Ground runtime facts now have a nested argument-functor index. A pattern such
-as `(num (M $x))` selects the `M` bucket instead of scanning every `num` fact.
-The matcher falls back to complete candidates when a non-ground fact could
-unify.
-
-A finite in-memory match whose result is discarded by a standard
-`let ... (empty)` is removed before enumeration. The optimization declines for
-custom grounded matchers, mutable state handles, changed standard forms, and
-non-memory spaces.
-
-The 30,000-fact scale gate also runs larger actual MeTTa workloads:
-
-| Program                    |                  Checked result |     Time |
-| -------------------------- | ------------------------------: | -------: |
-| 24^4 pure choice product   |                 331,776 answers |  81.2 ms |
-| duplicate tuple product    | 50 values from 500,000 branches |  30.8 ms |
-| nondeterministic `fib(10)` |          2,817 distinct answers |  73.4 ms |
-| nested runtime match       |                  30,000 answers | 647.3 ms |
-
-## Correctness fixes
-
-- `superpose` in the choice evaluator now strips a collapsed bag's leading
-  comma marker. The recursive `supercollapse` corpus case remains empty as
-  Hyperon requires.
-- Choice planning now respects application type errors, expression-headed
-  rewrite rules, and replaced sync or async grounded operations.
-- Nested indexing no longer changes candidate enumeration when a pattern has
-  no nested-head constraint.
-- Active table entries and answers count against the same global resource
-  budget as completed entries.
-- The purity firewall now treats custom sync and async grounded operations as
-  effectful unless they are the unchanged implementation of a known-pure
-  built-in. File, catalog, random, time, output, fresh-identity, and host calls
-  cannot enter automatic tables transitively.
-- File handles can be closed immediately with `file-close!` and are also closed
-  when their grounded atom is collected. Dictionary spaces and file records use
-  weak-key storage instead of lifetime-unbounded global maps. Grounded behavior
-  and non-default grounded types remain on the lossless atomspace path.
-- Grounded-operation registration invalidates evaluated terms, table analyses,
-  and compiled closures that may encode the previous dispatch behavior.
-- DAS gateway binding responses must contain exactly one MeTTa atom per value.
-  Malformed or multi-atom wire values now fail at the decode boundary.
-- Git imports pass an end-of-options marker before the repository path.
-- The unused `streamEmit`, `tableBackchain`, and `trieSpace` experimental
-  options have been removed. They never selected an implementation.
+# MeTTa TS 1.1.4
+
+MeTTa TS 1.1.4 adds selective nested-head indexing for immutable static facts.
+Queries such as `(num (M $x))` can select the matching `M` bucket while the
+normal unifier preserves MeTTa result order, multiplicity, and fallback
+semantics.
+
+## Static nested matching
+
+Static `&self` facts now have a nested argument-functor candidate index. A
+pattern such as `(num (M $x))` selects the `M` bucket instead of scanning every
+static `num` fact. The path applies to one match pattern over an immutable
+ground fact bucket. Static removals, state cells, runtime additions,
+variable-headed facts, non-ground facts, and conjunctions disable the new
+static nested path. Runtime additions retain their separate compact-store
+index. Static candidate selection then follows the existing complete or
+leaf-indexed paths. Existing leaf-key selection retains precedence. The full
+unifier remains authoritative.
+
+Indexed and custom-grounded residual candidates merge by source occurrence,
+so the nested path retains insertion order and duplicate multiplicity. Skipped
+ground candidate attempts are restored to the evaluator counter. Leaf index
+keys now retain custom grounded matchers as residual candidates and use one
+numeric key for integer and float values, matching ground equality.
+
+The selective static nested scale case passed at the 30,000-fact default and
+with `node packages/node/bench/scale-proof.mjs --size=100000`.
+`pnpm bench:nested-index` validates complete ordered result sequences and
+counters while measuring selective and dense cases up to 1,000,000 facts.
+Detailed measurements are in
+[`packages/node/bench/RESULTS.md`](packages/node/bench/RESULTS.md).
+
+## Verification
+
+The workspace build, typecheck, lint, formatting check, documentation build,
+benchmark suite, and 270-assertion oracle pass. The full suite passes 109 test
+files and 1,079 tests, with 38 optional live integration tests skipped.
+
+The concurrency benchmark status now states both parts of its regression gate:
+the median must exceed 1.5 times the baseline and add more than 1 millisecond.
+
+## Repository links
+
+Package metadata, documentation links, and the GitHub Pages base path now use
+the canonical [`MesTTo/MeTTa-TS`](https://github.com/MesTTo/MeTTa-TS)
+repository name.
+
+`@metta-ts/grapher` now ships a package README. Its examples distinguish
+starting a reduction trace from scheduling later trace steps, and its GIF
+example contains a reducible expression.
 
 ## Install
 
 ```bash
-npm install @metta-ts/core@1.1.3
-npm install -g @metta-ts/node@1.1.3
+npm install @metta-ts/core@1.1.4
+npm install -g @metta-ts/node@1.1.4
 ```
 
 Optional host packages use the same version:
 
 ```bash
-npm install @metta-ts/py@1.1.3 pythonia
-npm install @metta-ts/prolog@1.1.3
+npm install @metta-ts/py@1.1.4 pythonia
+npm install @metta-ts/prolog@1.1.4
 ```
 
 ## Provenance
 
 - Semantics: [hyperon-experimental](https://github.com/trueagi-io/hyperon-experimental).
 - Verified differential semantics: [LeaTTa](https://github.com/MesTTo/LeaTTa).
-- Host compatibility: PeTTa-compatible Python and Prolog bridge forms where
-  they do not depend on PeTTa's evaluator.
 - License: [MIT](LICENSE).

package.json

@@ -18,6 +18,7 @@
     "oracle": "vitest run packages/core/src/oracle.test.ts",
     "bench": "pnpm -r --filter @metta-ts/core --filter @metta-ts/node --filter @metta-ts/browser build && node packages/node/bench/suite.mjs && node packages/node/bench/nondeterminism.mjs --engine=ts --runs=1 && node packages/node/bench/concurrency.mjs && node packages/browser/bench/concurrency.mjs",
     "bench:nondeterminism": "pnpm -r --filter @metta-ts/core --filter @metta-ts/node build && node packages/node/bench/nondeterminism.mjs",
+    "bench:nested-index": "pnpm --filter @metta-ts/core build && node packages/node/bench/nested-static-index.mjs",
     "bench:scale": "pnpm -r --filter @metta-ts/core --filter @metta-ts/node build && node packages/node/bench/scale-proof.mjs",
     "bench:prolog": "pnpm -r --filter @metta-ts/core --filter @metta-ts/hyperon --filter @metta-ts/prolog --filter @metta-ts/node build && node packages/node/bench/prolog.mjs"
   },

packages/bench/concurrency-harness.mjs

@@ -126,8 +126,12 @@ export function writeOrCheckReport({
   }
 
   if (regressions.length > 0) {
-    printErr(`\n${regressions.length} operation(s) slower than ${regressionRatio}x baseline.`);
+    printErr(
+      `\n${regressions.length} operation(s) exceeded both ${regressionRatio}x baseline and a ${ms(regressionMinMs)} ms slowdown.`,
+    );
     process.exit(1);
   }
-  print(`\nNo regression over ${regressionRatio}x baseline.`);
+  print(
+    `\nNo operation exceeded both ${regressionRatio}x baseline and a ${ms(regressionMinMs)} ms slowdown.`,
+  );
 }

packages/browser/README.md

@@ -1,6 +1,6 @@
 # @metta-ts/browser
 
-Browser entry for [MeTTa TS](https://github.com/MesTTo/Meta-TypeScript-Talk). Re-exports everything from [`@metta-ts/core`](https://github.com/MesTTo/Meta-TypeScript-Talk/tree/main/packages/core) and adds an in-memory virtual file system so `import!` works without disk access.
+Browser entry for [MeTTa TS](https://github.com/MesTTo/MeTTa-TS). Re-exports everything from [`@metta-ts/core`](https://github.com/MesTTo/MeTTa-TS/tree/main/packages/core) and adds an in-memory virtual file system so `import!` works without disk access.
 
 ## Install
 
@@ -123,4 +123,4 @@ check.
 
 ## License
 
-[MIT](https://github.com/MesTTo/Meta-TypeScript-Talk/blob/main/LICENSE).
+[MIT](https://github.com/MesTTo/MeTTa-TS/blob/main/LICENSE).

packages/browser/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@metta-ts/browser",
-  "version": "1.1.3",
+  "version": "1.1.4",
   "license": "MIT",
   "type": "module",
   "main": "./dist/index.js",
@@ -54,11 +54,11 @@
   ],
   "repository": {
     "type": "git",
-    "url": "git+https://github.com/MesTTo/Meta-TypeScript-Talk.git",
+    "url": "git+https://github.com/MesTTo/MeTTa-TS.git",
     "directory": "packages/browser"
   },
-  "homepage": "https://github.com/MesTTo/Meta-TypeScript-Talk#readme",
+  "homepage": "https://github.com/MesTTo/MeTTa-TS#readme",
   "bugs": {
-    "url": "https://github.com/MesTTo/Meta-TypeScript-Talk/issues"
+    "url": "https://github.com/MesTTo/MeTTa-TS/issues"
   }
 }

packages/core/README.md

@@ -2,7 +2,7 @@
 
 The MeTTa (OpenCog Hyperon) interpreter in pure TypeScript: atoms, spaces, the type system, pattern matching, evaluation, and the standard library. No native addons and no required WASM. Runs in any JavaScript runtime (browser, Node, Deno, Bun, edge).
 
-Part of [MeTTa TS](https://github.com/MesTTo/Meta-TypeScript-Talk).
+Part of [MeTTa TS](https://github.com/MesTTo/MeTTa-TS).
 
 ## Install
 
@@ -26,8 +26,8 @@ for (const { query, results: rs } of results) {
 // (fact 5) => [ '120' ]
 ```
 
-`runProgram` parses the source, adds every non-bang atom to the knowledge base, evaluates each `!`-query, and returns one result group per query. For a higher-level class API modeled on Python's `hyperon`, see [`@metta-ts/hyperon`](https://github.com/MesTTo/Meta-TypeScript-Talk/tree/main/packages/hyperon).
+`runProgram` parses the source, adds every non-bang atom to the knowledge base, evaluates each `!`-query, and returns one result group per query. For a higher-level class API modeled on Python's `hyperon`, see [`@metta-ts/hyperon`](https://github.com/MesTTo/MeTTa-TS/tree/main/packages/hyperon).
 
 ## License
 
-[MIT](https://github.com/MesTTo/Meta-TypeScript-Talk/blob/main/LICENSE).
+[MIT](https://github.com/MesTTo/MeTTa-TS/blob/main/LICENSE).

packages/core/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@metta-ts/core",
-  "version": "1.1.3",
+  "version": "1.1.4",
   "license": "MIT",
   "type": "module",
   "main": "./dist/index.js",
@@ -46,11 +46,11 @@
   ],
   "repository": {
     "type": "git",
-    "url": "git+https://github.com/MesTTo/Meta-TypeScript-Talk.git",
+    "url": "git+https://github.com/MesTTo/MeTTa-TS.git",
     "directory": "packages/core"
   },
-  "homepage": "https://github.com/MesTTo/Meta-TypeScript-Talk#readme",
+  "homepage": "https://github.com/MesTTo/MeTTa-TS#readme",
   "bugs": {
-    "url": "https://github.com/MesTTo/Meta-TypeScript-Talk/issues"
+    "url": "https://github.com/MesTTo/MeTTa-TS/issues"
   }
 }