Instant Semantic Memory - 83M ops/sec, 0.04ms queries, 100% deterministic
Project description
Cubesquare
Instant Semantic Memory — 83M ops/sec, 0.04ms queries, 100% deterministic.
Embeddings drift. Vectors collapse. Cubesquare doesn't.
Install
pip install cubesquare
Zero dependencies. Works on Python 3.10+.
Quick Start
from cubesquare import CSTMemory
memory = CSTMemory()
# Write content — returns a permanent coordinate
token = memory.write("/src/auth/login.py")
print(f"Basin: {token.basin}, Layer: L{token.layer}")
# Query by meaning — O(1) computation, not O(N) search
results = memory.query("authentication", limit=5)
# Navigate by layer
siblings = memory.L1.siblings(token) # L1: Geometric — file hierarchy
similar = memory.L2.similar(token) # L2: Semantic — meaning clusters
nearby = memory.L3.nearby(token) # L3: Spatial — coordinate proximity
Why Not Embeddings?
| Problem | Embeddings + Vector DB | Cubesquare |
|---|---|---|
| Identity at scale | Vectors crowd together — distinct concepts become indistinguishable | Every input has a unique, permanent coordinate |
| Model dependency | Change embedding model → all vectors shift | No model. The hash IS the identity |
| Determinism | Same text → different vectors across versions | Same text → same coordinate, forever |
| Query cost | O(N) approximate search, 10-50ms+ | O(1) computation, 0.04ms |
| Dependencies | Embedding model + vector DB + GPU | Zero. Python stdlib only |
How It Works
Content → Hash (FNV-1a) → 3D Coordinate (Morton) → Basin (mod 131) → Layer (L1-L9)
The coordinate IS the meaning. No lookup tables, no search, no approximation.
| Concept | What it does | Nearest analog |
|---|---|---|
| Token | Content → 32-bit hex ID | Content hash |
| Morton code | 3D coords → single integer | Geohash (but 3D) |
| Basin (0-130) | Cluster into 131 groups | Consistent hash ring |
| Layer (L1-L9) | Semantic type | Index namespace |
| I-Logic | 5-state routing algebra | Finite state machine |
| SRL | t = √d iteration collapse | Skip list shortcut |
9 Layers
| Layer | Name | Basins | Question |
|---|---|---|---|
| L1 | Geometric | 0-14 | What structure? |
| L2 | Semantic | 15-29 | What meaning? |
| L3 | Spatial | 30-43 | Where? |
| L4 | Functional | 44-58 | What operation? |
| L5 | Probabilistic | 59-72 | How certain? |
| L6 | Emotional | 73-87 | What state? |
| L7 | Frequency | 88-101 | What timing? |
| L8 | Electromagnetic | 102-116 | What force? |
| L9 | Membrane | 117-130 | What boundary? |
I-Logic Algebra
5-state algebra for predicting routing outcomes before execution:
| State | Value | Meaning |
|---|---|---|
| DIRECT | 1 | Pass through |
| INVERSE | -1 | Reflect |
| SPIRAL | +i | Expand |
| ANTI_SPIRAL | -i | Contract |
| ABSORBED | 0 | Terminate |
from cubesquare.i_logic import multiply, ILogicState
result = multiply(ILogicState.SPIRAL, ILogicState.SPIRAL)
# Returns INVERSE (i × i = -1)
Performance
| Tier | Throughput | Use case |
|---|---|---|
| T1 C Internal | 83M ops/sec | Base throughput |
| T2 Batch (1000) | 57M ops/sec | Production |
| T3 Single call | 0.3M ops/sec | Avoid — 190× slower |
# Batch through C — 57M ops/sec
from cubesquare._core import morton_encode_batch_raw, create_coords_array
coords = create_coords_array([100,200,0, 101,201,0, 102,202,0])
results = morton_encode_batch_raw(coords, 3)
CLI
cubesquare --status # System status
cubesquare ilogic multiply SPIRAL INVERSE # I-Logic algebra
cubesquare primitives status # O(1) primitive checks
cubesquare --list # All 35 shells
Verified
- 68/68 pytest tests passing
- 43/43 agent validation checks
- 400/400 Morton roundtrips
- 131/131 basin coverage
- 31 native DLLs loaded
For Contributors
Clone the repo and install in development mode:
git clone https://github.com/Cubesquare-Token/CST.git
cd CST
pip install -e .
Run tests:
pytest tests/ -v # 68 tests
python agent_sandbox/agent_in_loop_validation.py # 43 checks
Project Structure
cubesquare/
├── _core/ # C backend bindings, Morton encoding
├── i_logic/ # 5-state algebra
├── layers/ # L1-L9 semantic layers
├── shells/ # 35 command shells
├── circular/ # Loop detection, SRL
├── primitives/ # O(1) verified operations
├── data/beehive/ # Binary CST index (601KB)
└── native/hex_core/ # 31 DLLs
Documentation
| Document | Description |
|---|---|
| CLAUDE.md | Full technical reference |
| docs/LAYERS_MAP.md | 12-layer architecture |
| docs/VERIFIED_PRIMITIVES.md | O(1) proofs |
MIT License
Created by Jesus Fernandez. Offline-first. Training-free. Deterministic.
Project details
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Filter files by name, interpreter, ABI, and platform.
If you're not sure about the file name format, learn more about wheel file names.
Copy a direct link to the current filters
File details
Details for the file cubesquare-1.0.4.tar.gz.
File metadata
- Download URL: cubesquare-1.0.4.tar.gz
- Upload date:
- Size: 1.6 MB
- Tags: Source
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/6.2.0 CPython/3.13.3
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
71f3608f1a3d6279905b990c85cdb3df460ffa4571b2242455ec1f40c080609e
|
|
| MD5 |
029d19a5eca6cac9c4490fab04caa020
|
|
| BLAKE2b-256 |
86371f01fb8614dfb70a923b1acc2c55122ca80afa6bcafeae8ef975c9962f20
|
File details
Details for the file cubesquare-1.0.4-py3-none-any.whl.
File metadata
- Download URL: cubesquare-1.0.4-py3-none-any.whl
- Upload date:
- Size: 1.6 MB
- Tags: Python 3
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/6.2.0 CPython/3.13.3
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
f27168dc07170e8bc1cef79246622eaef700b84df7a5fcdd581217375af9024f
|
|
| MD5 |
6c9444d1e57a22131df5e052927f1b26
|
|
| BLAKE2b-256 |
5bedd40fd790b40ad13ed2b11764621f5213ee1916e2784a49c54702546ea089
|