feat: add portable liblecore ABI-0 kernel

.gitignore

@@ -11,6 +11,8 @@ holographic_vsa_complete.zip
 /dist
 /build
 /build_pkg
+/native/liblecore/build*/
+/native/liblecore/out/
 *.egg-info
 repo.zip
 /temp

README.md

@@ -171,6 +171,10 @@ Like leOS, leCore is **free and open source**, and the work that keeps it free i
 
 ## Learning more
 
+- **[`native/liblecore/README.md`](native/liblecore/README.md)** — build and use the ABI-0 `liblecore` C11 preview,
+  including its API contract, CMake/`pkg-config` consumption, current capabilities, and limitations.
+- **[`PRD.md`](PRD.md) and [`ENG.md`](ENG.md)** — the product vision, native ABI strategy, adoption gates, and
+  dependency-ordered backlog for the `liblecore` portable C kernel.
 - **[`FEATURE_GUIDE.md`](FEATURE_GUIDE.md)** — a **hands-on how-to** for the most recently added features: composable
   materials/textures, the describe-a-scene authoring flow (naming, texturing, external files), external-asset
   relocation and the queryable file map, the message-bus + optional-agent harness, and the opt-in language layer. Every

REFERENCE.md

@@ -1,7 +1,7 @@
 # leCore -- Code Reference
 
 *Auto-generated by `docgen.py` -- do not edit by hand; edit the module docstrings instead and re-run it.*
-*620 modules, 216,511 lines of engine code.*
+*620 modules, 216,588 lines of engine code.*
 
 > **New here? Read this first.** leCore represents *everything* -- memory, geometry, physics, rendering -- as
 > points in one very high-dimensional space (hypervectors), and combines them with a tiny algebra: **bind**
@@ -486,7 +486,7 @@
 | [`holographic_recipeops.py`](#holographic-recipeops) | StructureRecipe validator + edit operators (ARCH-1): the recipe equivalent of the mesh Euler operators. | 264 |
 | [`holographic_reclock.py`](#holographic-reclock) | holographic_reclock.py -- sample when an AXIS moves, not when time passes ("make the boring property the | 313 |
 | [`holographic_recurrent.py`](#holographic-recurrent) | A gradient-free RECURRENT layer for the holographic engine: reservoir computing. | 456 |
-| [`holographic_reference.py`](#holographic-reference) | Reference implementations + the conformance harness (ISA-2): the teeth of the ISA contract (ISA.md). | 172 |
+| [`holographic_reference.py`](#holographic-reference) | Reference implementations + the conformance harness (ISA-2): the teeth of the ISA contract (ISA.md). | 249 |
 | [`holographic_refine.py`](#holographic-refine) | holographic_refine.py -- the pipeline middle: produce a result, have a CRITIC judge it, adjust, retry. | 122 |
 | [`holographic_refresh.py`](#holographic-refresh) | holographic_refresh.py -- W4: information-rate rendering. Shade the news, reproject the rest. | 211 |
 | [`holographic_regimegate.py`](#holographic-regimegate) | holographic_regimegate.py -- RE-ENABLE a shelved method behind a detector (the adaptive-dispatch pattern). | 76 |
@@ -18952,8 +18952,14 @@
 - `def ref_involution(a)` -- The reversal used to invert bind: inv[0] = a[0], inv[i] = a[D-i]. Exactly self-inverse.
 - `def ref_unbind(composite, a)` -- Unbind by its definition: bind the composite with the involution of the key.
 - `def ref_permute(vec, shift)` -- Cyclic shift by its definition (numpy's roll convention): out[i] = vec[(i - shift) mod D]. Exact.
-- `def ref_bundle(vectors)` -- Superpose then renormalize; a zero-sum bundle returns the zero vector (the pinned edge).
-- `def ref_cosine(a, b)` -- dot / (|a| |b|); zero norm -> 0.0 (the pinned edge).
+- `def ref_bundle(vectors)` -- Superpose in row/index order, then normalize; a zero-sum bundle stays zero.
+- `def ref_cosine(a, b)` -- Ascending-order dot / (|a| |b|); zero norm -> 0.0.
+- `def ref_normalize(a)` -- Ascending-order normalization: zero stays zero; non-finite values propagate.
+- `def ref_dot(a, b)` -- Definition of the ordered f64 dot utility: multiply/accumulate from the lowest index upward.
+- `def ref_dot_many(query, matrix)` -- Apply ref_dot to codebook rows in stable ascending order.
+- `def ref_cosine_many(query, matrix)` -- Apply ref_cosine to codebook rows in stable ascending order.
+- `def ref_cleanup(query, codebook)` -- Return the frozen cleanup decision and score, including NumPy's first-NaN argmax behavior.
+- `def ref_cosine_many_f64_f32(query, matrix)` -- Definition of the mixed f64-query/f32-corpus utility planned for NoSQLite.
 - `def value_conformant(x, y, tol)` -- True iff two CONTINUOUS outputs agree within numeric tolerance (the TOL class).
 - `def exact_conformant(x, y)` -- True iff two outputs are bit-for-bit identical (the EXACT class: a reindex, an involution).
 - `def decision_conformant(sims_a, sims_b)` -- True iff two similarity vectors yield the SAME cleanup decision under the contract's tie-break. This is