What is Aeonmi?
Aeonmi is a statically-typed, AI-native programming language with first-class quantum syntax. It is the sole execution substrate of AEONMI INC — the language in which Aeonmic Intelligence (Mother) runs, grows, and writes itself.
Aeonmi is not a Python wrapper, not a Rust DSL, not a Jupyter notebook extension. It has its own lexer, parser, AST, IR, and v2 tree-walk VM — all written in Rust, zero JS, zero JVM.
- Quantum syntax is first-class — not a library call, not an annotation
- AI-native: Mother AI writes Aeonmi programs at runtime (Phase 9)
- Self-hosting: Shard compiler is written in Aeonmi (5/5 tests passing)
- IBM Quantum bridge: native execution on ibm_kingston (156 qubits, Heron r2)
- ARC-AGI ready: Grover-accelerated rule search via AeonmicArcSolver
Design Philosophy
- Quantum is syntax, not library. Aeonmi's grammar includes qubit literals, entanglement operators, and measurement as first-class productions.
- AI is the compiler, not the user. The runtime is optimised for Aeonmic Intelligence — programs that write, execute, and evaluate other programs.
- Sovereignty over openness. Closed source. The runtime is the core IP of AEONMI INC. Accessible through products, not source code.
Basic Syntax
// Variables — let-bound, type-inferred let name = "Mother"; let bond = 0.73; let active = true; print("AEONMI:", name, "bond=" + bond); // Control flow if (bond > 0.7) { print("ACCELERATE"); } else if (bond > 0.4) { print("PROCEED"); } else { print("HOLD"); } // Arrays + while loop let glyphs = ["⊗", "⟨⟩", "↦", "⧉"]; let i = 0; while (i < len(glyphs)) { print(glyphs[i]); i = i + 1; }
Functions
function bond_evolve(bond, resonance, cycle) { let lr = 0.08 / (1.0 + cycle / 20.0); let next = bond + lr * (0.8 - bond); if (next < 0.1) { return 0.1; } if (next > 0.95) { return 0.95; } return next; } // Native glyph syntax ◯ main⟨⟩ { let b = bond_evolve(0.5, 2.5, 0); print("bond:", b); }
Glyph Operators
Aeonmi uses Unicode glyph operators as first-class syntax — lexer tokens with specific IR semantics, not decoration.
| Glyph | Name | Meaning | Context |
|---|---|---|---|
| ⊗ | Tensor / Genesis | Tensor product; quantum genesis marker | Quantum circuits, identity, MGKS tokens |
| ⟨⟩ | Ket / Bra | Quantum state notation; function type brackets | Function signatures, quantum states |
| ↦ | Maps-to | State transition; compiler emit arrow | Shard codegen, MGKS chroma, flow routing |
| ⧉ | Entangle | Quantum entanglement; parallel execution | Circuit entanglement, hive sync |
| ◯ | Function gate | Function declaration glyph | Function definitions |
| ⊕ | XOR / Direct-sum | Exclusive-or; module composition | Quantum XOR gates, module system |
| ∴ | Therefore | Logical consequence; assertion | Print prefix, assertions, log markers |
| ⊘ | Seal | End of quantum job; MGKS envelope seal | Quantum job end, MGKS sealing |
Quantum Syntax
Quantum operations are first-class Aeonmi syntax. The compiler translates quantum blocks to IBM Qiskit circuits or the Titan local simulator. 100% Bell state entanglement verified in Session 11.
// Bell state — 100% entanglement, Session 11 import { QuantumCircuit } from "quantum"; ◯ bell_state⟨⟩ { let qc = QuantumCircuit.new(2, 2); qc.hadamard(0); // superposition qc.cnot(0, 1); // entanglement qc.measure([0,1], [0,1]); let r = qc.run({ shots: 1024 }); print(r.counts); // {"00": ~512, "11": ~512} — perfect entanglement }
// Grover's O(√N) — search 1024 items in ~25 queries import { grover_search } from "titan::algorithms"; ◯ main⟨⟩ { let r = grover_search(1024, 42); print("found:", r.found, "iterations:", r.iterations); print("quantum advantage:", r.speedup + "×"); // Classical: up to 1024 queries // Quantum: ~25 iterations }
Mother AI Integration
Mother AI's 12-phase cognitive system is callable from Aeonmi programs. Phase 9 allows Mother to write and execute new Aeonmi programs at runtime. Phase 10 maintains a live knowledge graph.
// 60-cycle cognitive simulation — Mother's self-authored program import { bond_evolve } from "./emotional_core"; import { m_new, m_store, m_active } from "./memory_min"; let bond = 0.5; let mem = m_new(); let c = 0; while (c < 60) { bond = bond_evolve(bond, 2.5, c); mem = m_store(mem, "cycle_"+c, bond); c = c + 1; } print("∴ Final bond:", bond); print("Active memories:", m_active(mem, 0.5));
CLI: aeonmi mother cognition · aeonmi mother oracle · aeonmi mother hive
Built-in Functions
| Function | Signature | Description |
|---|---|---|
| print(...args) | Print values to stdout | |
| len | len(arr|str) → int | Length of array or string |
| type | type(val) → str | Runtime type name |
| str / int / float | str(val) → str | Type coercion |
| sqrt / abs / floor / ceil | sqrt(n) → float | Math primitives |
| push / pop / slice | push(arr,val) | Array operations |
| keys | keys(obj) → arr | Object key array |
| read_file / write_file | read_file(path) → str | File I/O |
| now_ms / random | now_ms() → int | Time + entropy |
| remember / recall | remember(key, val) | MGKS memory store/retrieve |
Aeonmi is not for sale.
The language is the execution substrate of AEONMI INC. Access it through the products. The runtime will never be sold separately — it is the moat.
Explore Products →