SnapKitty Parallel Swarm Computation
The computation is the interface.
Enter text. Watch five computational processes execute in parallel. Every visual element traces back to an actual computational value.
Five Swarms
| Swarm | Algorithm | Source |
|---|---|---|
| Resonance Words | GF(2⁶⁴−2³²+1) field elements + lattice routing | j-matrix-twin/resonance_word.ijs |
| SUBLEQ Attention | 256-cell integer memory, subtract-and-branch | j-matrix-twin/subleq_attention.ijs |
| ICP-DAG | Governance: EVIDENCE→CLAIM→PROOF→DECISION→EXECUTION | ICP-DAG.m + ICP-DAG.lp |
| Fibonacci Anyons | τ⊗τ=1⊕τ fusion (classical sim) | FibonacciAnyon.lean |
| Jordan Algebra | T(ρ)=φ⁻¹UρU†+φ⁻²ρ → [U,ρ*]=0 | JordanMatrixProof.lean (0 sorry) |
Four Views
Parallel Swarms
3D visualization of all five swarms executing on a shared timeline. Scrub through ticks. Click any node to inspect its exact computational state.
Algorithmic Art
Three art styles — all generated from the actual execution:
- Radial Mandala — each ring is a swarm, angles are event indices, radii encode state values
- Bit Constellation — 64-bit Resonance Word bit patterns + SUBLEQ branch path diagram
- Convergence Analysis — Jordan fixed-point curve + SUBLEQ trace + anyon fusion tree
Research
Raw computation tables. Summary statistics. Swarm event lists. All benchmarks correctly marked "unavailable" where data does not exist.
Visual Mapping
Documents exactly how every computational value becomes a visual property. See SWARM_VISUALIZATION.md.
Research Status
| Component | Status |
|---|---|
| SUBLEQ VM (Rust/WASM) | ✓ Implemented |
| Resonance Word format | ✓ Implemented (bug fix applied) |
| ICP-DAG (MUMPS + ASP) | ✓ Implemented |
| Entropy theorem (Lean 4) | ✓ 0 sorry |
| Jordan proof (Lean 4) | ✓ 0 sorry |
| Fibonacci anyon sim | ✓ Classical simulation |
| Pentagon/hexagon axioms | ✗ Empty in Lean |
| SUBLEQ vs softmax benchmark | ✗ Not yet run |
| Hallucination rate benchmark | ✗ Not yet run |
Scientific Integrity
The quantum swarm is a classical simulation of the Fibonacci anyon model. No quantum advantage is claimed. No quantum hardware is involved.
Benchmarks say "unavailable" when the data does not exist.
The visualization communicates the architecture — it does not prove performance.
License
Apache-2.0 (Space code) · BSL-1.1 / AGPL-3.0 / MPL-2.0 (research core) Patent Pending — Bel Esprit D'Accord Irrevocable Trust
Citation
@software{snapkitty2026,
author = {Westerhoff, Jessica},
title = {SnapKitty: Parallel Swarm Computation Visualization},
year = {2026},
url = {https://huggingface.co/Snapkitty/snapkitty-algo-art}
}