MeTTaScript 2.3.0

Author: MesTTo

.gitignore

@@ -21,6 +21,7 @@ isolate-*.log
 # Local scratch, notes, and screenshots (never committed)
 /ai-notes/
 /ai-tmp/
+/ai-debug/
 /ai-*.md
 /metta-interlingua/
 /scratch-review/

README.md

@@ -1,6 +1,6 @@
 # MeTTaScript
 
-MeTTaScript is a metagraph rewriting database, written in pure TypeScript. You store facts in a space, query them by pattern, and compute by writing rewrite rules over the same facts, all with the same pattern-matching mechanism.
+MeTTaScript is a metagraph database and reasoning engine, written in pure TypeScript. You store facts in a space, query them by pattern, derive new facts with rewrite rules, and let a query fan out to search every answer, all through one pattern-matching mechanism. Querying and computing are the same act of matching, so the library that holds your data also runs recursive inference and non-deterministic search over it.
 
 A metagraph is the most expressive of the graph data models. A graph joins two nodes with an edge, a hypergraph joins any number of nodes, and a metagraph lets links contain other links, so a fact can be about another fact: `(Believes Tom (parent Bob Ann))` is a statement whose subject is itself a statement. Rules live in the space as atoms too, so you compute by rewriting the data itself, and a program can query and rewrite its own rules.
 
@@ -325,6 +325,13 @@ The core list operations run in linear time. `size-atom`, `map-atom`,
 stack, byte-identical to the prelude recursion up to variable renaming, and beat
 PeTTa 2.7x to 5.2x at N=100000.
 
+Deep recursion scales past the native stack. A deep reducible computation runs
+through a heap continuation instead of the host call stack, so a reduction tens
+of thousands of levels deep returns a value rather than a `StackOverflow`. The
+depth bound is a `max-stack-depth` limit you set, deterministic and independent
+of the V8 stack size, so the same program cuts at the same place in every
+runtime.
+
 The full per-program tables, memory figures, and the nondeterminism and
 bounded-backward-chaining benchmarks are in
 [`RESULTS.md`](packages/node/bench/RESULTS.md),

RELEASE_NOTES.md

@@ -1,3 +1,32 @@
+# MeTTaScript 2.3.0
+
+Deep recursion now scales past the native stack. A reduction that nests tens of thousands of levels deep, a
+long grounded-operation spine or the result of a deeply recursive rule, runs on the engine's heap continuation
+instead of the JavaScript call stack, so it returns a value where it used to overflow. Every terminating
+program from 2.2.0 produces the same output, validated byte-identical across the full corpus, so upgrading is
+safe.
+
+## Deep computation on the heap continuation
+
+Before this release, a deeply nested reducible computation recursed to the term's depth through the evaluator
+and its term-walk predicates, and could exhaust the host stack before the language-level `max-stack-depth`
+bound applied. A reducible argument now hands off to the engine's heap-continuation driver at the depth-neutral
+boundary, where the current application has not taken a user-equation call lease or has tail-transferred into a
+constructor or grounded operation. The driver carries the same evaluation depth, bindings, state, and fuel, so
+`max-stack-depth` accounting is unchanged: recursion is still cut at exactly the limit you set, and that cut is
+deterministic and independent of the V8 stack size.
+
+The term walks a deep result drives are now iterative rather than recursive, byte-identical to before: the
+normal-form and type checks, structural equality (a fast recursive path with an iterative fallback), the
+table-key check, and the printer. A grounded-operation spine 50,000 levels deep returns its value, and the
+`differential`, `deterministic-depth`, and `tail-trampoline` suites confirm the behavior is unchanged.
+
+## Docs
+
+The website and README are repositioned around what the engine does: a metagraph database and reasoning engine
+you drive from TypeScript, with rules, recursive inference, and non-deterministic search, not only a query
+store. The TypeScript-first examples and the getting-started path are unchanged.
+
 # MeTTaScript 2.2.0
 
 Exposes the import resolver as a reusable, host-agnostic function. The transitive, cycle-safe import

compat/browser/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@metta-ts/browser",
-  "version": "2.2.0",
+  "version": "2.3.0",
   "license": "MIT",
   "type": "module",
   "main": "./dist/index.js",

compat/core/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@metta-ts/core",
-  "version": "2.2.0",
+  "version": "2.3.0",
   "license": "MIT",
   "type": "module",
   "main": "./dist/index.js",

compat/das-client/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@metta-ts/das-client",
-  "version": "2.2.0",
+  "version": "2.3.0",
   "license": "MIT",
   "type": "module",
   "main": "./dist/index.js",

compat/das-gateway/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@metta-ts/das-gateway",
-  "version": "2.2.0",
+  "version": "2.3.0",
   "license": "MIT",
   "type": "module",
   "main": "./dist/index.js",

compat/debug/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@metta-ts/debug",
-  "version": "2.2.0",
+  "version": "2.3.0",
   "license": "MIT",
   "type": "module",
   "main": "./dist/index.js",

compat/edsl/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@metta-ts/edsl",
-  "version": "2.2.0",
+  "version": "2.3.0",
   "license": "MIT",
   "type": "module",
   "main": "./dist/index.js",

compat/grapher/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@metta-ts/grapher",
-  "version": "2.2.0",
+  "version": "2.3.0",
   "license": "MIT",
   "type": "module",
   "main": "./dist/index.js",