Represent meaning as structured state — then prove you can reconstruct the boundary view.
ANLS is North Star’s native semantic representation research line. Instead of treating every memory as an opaque text blob, an ANLS packet can carry a versioned template, semantic coordinate, slots, deltas, lineage, privacy classification and stable hashes, with a reconstruction receipt binding the packet to its rendered form.
Compression is only one part of the value proposition.
The key research question is whether a semantic representation can remain compact while preserving structure needed for retrieval, lineage, contradiction, deterministic rendering and governance. ANLS is not positioned as a replacement for mature byte-compression codecs.
Meaning is addressable
Templates, slots and semantic classes can make recurring structure explicit instead of re-encoding every record as full literal prose.
Context travels with the packet
Representation metadata includes provenance and version bindings needed to explain where a semantic state came from.
Boundary text stays verifiable
Receipts bind packet, index version and rendered body so a compact internal representation can still be checked against its human-readable view.
80 records. Five representations. Exact byte accounting.
The Phase 82 fixture was project-generated and synthetic: 64 repeat-heavy records plus 16 heterogeneous records. Every representation counted the bytes required for exact reconstruction.
| Cohort | Literal | zlib-9 | Structural | ANLS | ANLS savings |
|---|---|---|---|---|---|
| Repeat-heavy (64) | 23,067 B | 1,897 B | 22,108 B | 10,786 B | 53.2406% |
| Heterogeneous (16) | 4,958 B | 1,310 B | 5,228 B | 4,105 B | 17.2045% |
| Aggregate (80) | 27,975 B | 2,956 B | 27,272 B | 14,833 B | 46.9777% |
Why pursue ANLS if zlib is smaller?
Because byte size and semantic usability answer different questions. A conventional compressor can minimize bytes extremely well. ANLS explores whether the stored representation itself can expose stable semantic slots, coordinates, lineage and deltas that downstream memory/replay systems can reason about directly.
Queryable structure
The representation can expose semantic fields without first pretending decompressed prose is the only canonical computational form.
Versioned semantics
Warm-index and template versions make interpretation dependencies explicit and auditable.
Governed translation
Translation/reconstruction receipts preserve authority-null semantics across representations instead of smuggling permission through format conversion.