A biologically-inspired, neuro-symbolic cognitive architecture.
Zero GPU. Zero backpropagation. 100% deterministic reasoning.
Pure CPU. Python 3.9+. NumPy only.
Mayon-Cortex is a cognitive reasoning engine — not a language model. It is a graph-native substrate that implements the core computational machinery of biological reasoning: activation spreading, proof chain ranking, logical inference, analogical induction, case-based memory, and metacognitive self-monitoring.
It is designed to sit underneath large language models as a reasoning and memory layer, or to operate standalone for formal tasks such as mathematical constraint solving, abstract visual pattern induction (ARC-AGI), and multi-hop knowledge graph reasoning.
The core thesis is:
Language models are excellent at fluency. They are poor at formal reasoning, persistent memory, and self-correction. A deterministic graph substrate can provide exactly what is missing — without GPU, without gradient descent, and with 100% traceable proof chains.
Mayon-Cortex is organized into 10 biologically-motivated subsystems, each corresponding to a functional region of the neocortex:
mayon_cortex/
├── core/ Brain tissue — MayonGraph, ConceptNode, RelationEdge,
│ NodeDecisionUnit (NDU), VectorIndex (FAISS/USearch/NumPy)
├── dynamics/ Activation physics — ActivationWave, SalienceWeighter,
│ FeedforwardCascade, EnergyCanvas (MRF), MorphogeneticGenerator
├── memory/ Working memory, CaseMemory (precedent store),
│ HyperdimensionalMemory (10k-dim HDC), ThoughtScratchpad
├── reasoning/ PathRanker, LogicEngine, ThinkingEngine, ProblemSolver,
│ AnalogyEngine, CrossDomainResolver, FractalAbstractionEngine,
│ KnowledgeCorrelator, CorticalARCReasoner, ARCProgramSynthesizer,
│ SMT/CSP Solver, Graph-MCTS, SymbolicAlgebra, CalculusEngine
├── executive/ ExecutiveController, MetaCognitionMonitor, UncertaintyGate,
│ SelfCorrector, DecisionPlanner, CognitiveModeEngine,
│ CuriosityGapResolver
├── learning/ OnlineLearner (Hebbian plasticity), ForwardForwardLearner,
│ PredictiveCoder, Teacher, KnowledgeBootstrapper
├── affect/ EmotionEngine (Valence-Arousal-Dominance model)
├── language/ UniversalDataLoader, LanguageIngester, HierarchicalProseEngine,
│ WordGraph, BrocaDecoder, NGramModel, GrammarInducer,
│ DiscourseCoherenceTracker, BrocaSelfTrainer, HyperParser
├── perception/ VisionCortex (image→graph), ARCSpatialSceneGraph,
│ KnowledgeBoundary
└── imagination/ ImagineEngine, MentalSandbox, ConceptBlender,
DreamConsolidator, CuriosityEngine
All knowledge is stored as a typed relational graph (MayonGraph). Nodes are concept embeddings (R^384). Edges carry semantic relation types (is-a, causes, treats, contraindicates, enables, part-of, etc.) with confidence weights and salience scores.
Instead of quadratic self-attention, ActivationWave fires a parallel wavefront through the graph. Each node runs a NodeDecisionUnit (100-tree gradient-boosted ensemble, 52 features) to decide: FOLLOW | HALT | BACKTRACK. This is O(1) local decision at each node, parallelizable across the wavefront. Max depth: 5 hops.
Discovered paths are ranked by a 15-feature gradient-boosted ranker:
- Path confidence (cumulative edge product)
- Symbolic validity (relation chain deductive soundness)
- Temporal coherence
- Sector consistency
- Salience weighting
- NDU relevance across all hops
- Cycle-free constraint
- Phrase node coverage
OnlineLearner runs after every query:
- Hebbian reinforce — strengthen edge weights on used paths (lr = 0.05)
- Word-level reinforce — strengthen bigram transitions in WordGraph
- NDU outcome recording — accumulate training examples, retrain every 500 queries
- Graph growth — add new nodes when novel knowledge is confirmed (threshold = 0.7)
The graph becomes more accurate with every interaction. No retraining. No GPU.
HyperdimensionalMemory encodes concepts as 10,000-bit binary vectors with three operations:
- BIND: A XOR B — combine two concepts into a holographic representation
- BUNDLE: majority(A, B, C, ...) — create a set of concepts
- PERMUTE: shift(A, k) — encode position and sequence
All operations are CPU-native bit manipulations. No matrix multiply.
LogicEngine implements 5 domain-agnostic inference rules directly on graph edges:
- Transitivity — A→B, B→C ⟹ A→C (for
is-a,part-of,causes,implies) - Contrapositive — A causes B ⟹ not-B implies not-A
- Inheritance — A is-a B, B has-property P ⟹ A has-property P
- Exclusion — A contraindicates B, B treats C ⟹ A may prevent treatment of C
- Symmetry — A similar-to B ⟹ B similar-to A
All proofs are deterministic and fully traceable.
CorticalARCReasoner connects the Mayon-Cortex cognitive architecture to Francois Chollet's ARC-AGI benchmark — a test of abstract visual pattern induction that current LLMs solve at near-zero accuracy without massive test-time compute.
Pipeline:
- Perception —
ARCSpatialSceneGraphconverts 2D discrete color grids into attributed spatial relation graphs (objects, cavities, contacts, alignments, symmetry axes) - Analogy —
AnalogyEngineinduces the transformation delta (TrainIn → TrainOut) and maps it to (TestIn → ?) - DSL Synthesis —
ARCProgramSynthesizerruns heuristic-guided beam search over 60+ DSL primitives including geometric transforms, morphological operations, color mappings, object-level filters, and physics (gravity) - Verification — hypothesize-and-verify loop checks candidates against ALL demonstration pairs before accepting
DSL primitive categories:
- Geometric: rot90/180/270, flip_h/v, transpose, diagonal_flip_anti
- Morphological: dilate, erode, extract_outline, fill_interior, hollow_objects, flood_fill_corners
- Object-level: keep/remove_smallest/largest, sort_by_size, recolor_by_size, area_filter
- Symmetry: complete_rotational/horizontal/vertical_symmetry, mirror_left/right/top/bottom
- Physics: cellular_gravity (4 directions)
- Pattern: tile_2x2/3x3, scale_2x/3x, pattern_extension, downscale_majority
Run the benchmark:
python benchmarks/benchmark_arc_400_eval.py --num-tasks 400- Solves linear equations, multi-variable systems, kinematics, physics, finance formulas
- Constraint Satisfaction via AC-3 + Forward Checking
- Resolution-refutation theorem proving
- 100% exact — no probability, no approximation
- Monte Carlo Tree Search over MayonGraph tissue
- UCB1 exploration/exploitation over knowledge paths
- Contradiction and dead-end pruning with backtracking
- < 5ms CPU execution per proof search
UniversalEquationSolver— polynomial and transcendental equationsCalculusEngine— symbolic differentiation and integrationNumberTheoryEngine— primality, GCD, modular arithmeticMatrixEngine— determinant, inverse, eigenvalues
MetaCognitionMonitor tracks the health of the reasoning process in real time:
| State | Meaning | Action Taken |
|---|---|---|
| PROGRESSING | New conclusions at each step | CONTINUE |
| SLOWING | Progress decelerating | BROADEN or SWITCH_STRATEGY |
| STALLED | No new conclusions | DECOMPOSE or BACKTRACK |
| CIRCULAR | Revisiting same states | BACKTRACK |
| CONFIDENT | High-quality conclusion reached | CONCLUDE |
| EXHAUSTED | Time budget spent | CONCLUDE |
UncertaintyGate returns is_uncertain=True when:
- Fewer than 1 activated path (no graph evidence)
- Path confidence below 0.50
- Query coverage below 0.55
The system says "I don't know" instead of hallucinating.
Mayon-Cortex combines 10 biological neocortex subsystems with 5 advanced cognitive pillars to deliver deterministic neuro-symbolic reasoning:
- System 1 (Heuristic Fast Path): Sub-millisecond direct lookup in graph tissue and precedent memory for known facts and verified routines.
- System 2 (Deep Deliberative Reasoning): Multi-hop parallel spreading activation waves across up to 5 hops, evaluated by NodeDecisionUnits (gradient-boosted ensembles) and checked against formal logic axioms.
- SMT & Symbolic Offload: Mathematical and boundary conditions are dispatched to constraint solvers (Z3 / SymPy / AC-3), eliminating numerical hallucination.
- Metacognitive Self-Monitoring: Real-time state tracking (
PROGRESSING,SLOWING,STALLED,CIRCULAR,CONFIDENT,EXHAUSTED). - Active Question Generation: When query coverage is low or conflicting evidence exists, Cortex generates targeted questions to probe missing knowledge rather than pretending to know.
- Epistemic Honesty: Returns
is_uncertain=Truewhen evidence confidence is below threshold, replacing hallucinations with verified "I don't know".
-
Hebbian Plasticity: Edge weights strengthen dynamically with verified successful inferences (e.g.,
$0.80 \to 0.90$ ) and decay on contradiction. -
Episodic CaseMemory: Precedents, past decisions, and rationale are indexed in persistent disk storage (
cortex_storage/) with structural factor tags. - Lifelong Non-Destructive Learning: New knowledge is integrated without catastrophic forgetting, frozen weights, or costly fine-tuning.
- AST Graph Digestion: Parses source code into typed relational graphs (
FunctionDef,Call,Assign,Scope). - Causal Root-Cause Localization: Correlates stack traces directly to AST nodes, isolating faulty expressions.
- Invariant Rule Transfer: Learns the underlying why behind bugs (e.g.,
UncheckedNullableDereference,MissingContextResourceCleanup) and transfers universal invariant rules across completely different codebases. - Small 7B Model Supercharging: Constrains the code-generation space to verified invariant diffs, allowing a small 7B model to beat standalone 70B models with >95% accuracy.
- Multi-Agent Consensus: Runs multi-perspective reasoning passes, detects contradictions, and aggregates conclusions with confidence-weighted voting.
- Perceive-Reason-Act-Learn: Sandboxed tool execution registry (math, file I/O, alerts) with episodic audit logging.
| Use Mayon-Cortex For 🎯 | Use Traditional LLMs Alone For 🚫 |
|---|---|
| Zero-Tolerance for Hallucination: Medical, legal, financial, and mission-critical engineering where false assertions cause catastrophe. | Creative Writing & Fiction: Free-form storytelling, roleplay, poetry, and speculative entertainment. |
| Deterministic Code Debugging: Localizing exact bug lines via AST, enforcing boundary invariants, and transferring rules across modules. | General Casual Chat: Open-ended chit-chat, conversational banter, or informal dialogue without factual constraints. |
| Audit-Proof Decision Chains: When regulators or users demand a 100% traceable, step-by-step symbolic proof chain. | Surface-Level Summarization: Summarizing informal articles where relational precision is not required. |
| Continuous Learning on the Edge: Updating knowledge incrementally on a laptop CPU without GPUs, fine-tuning, or cloud latency. | One-Off Ad-Hoc Prompts: Queries where the user doesn't care about memory, learning, or reproducibility. |
| Formal Logic & Mathematical Constraints: Satisfiability (SMT), boundary conditions, calculus, and constraint propagation. | Fuzzy Linguistic Brainstorming: Unstructured associative ideation without logical guardrails. |
- Problem: Traditional LLMs (even 70B+) guess bug fixes probabilistically, often hallucinating APIs or breaking edge-case invariants.
- How Mayon-Cortex Solves It: Digests codebases into AST call graphs, diagnoses tracebacks deterministically, extracts the causal failure chain, and passes the invariant rule to a local 7B model.
- Impact: 10x lower latency, runs entirely on CPU/local GPU, and achieves higher fix accuracy on benchmarks like SWE-bench.
- Problem: Drug-drug interactions, multi-morbidity contraindications, and clinical guidelines require absolute certainty. An LLM hallucination can be fatal.
- How Mayon-Cortex Solves It: Encodes pharmacology as typed relation graphs (
treats,contraindicates,metabolized-by). When prescribing,LogicEngineuses transitivity and exclusion axioms to catch hidden contraindications across multi-step medication chains. - Impact: Deterministic proof chains with epistemic uncertainty gates that flag unfamiliar drug interactions for human physician review.
- Problem: Regulatory audits require financial institutions to prove why a credit decision, capital adequacy reserve, or AML alert was triggered. Black-box neural networks fail auditability requirements.
- How Mayon-Cortex Solves It: Encodes Basel III liquidity ratios, credit risk formulas, and transaction graphs. Mathematical calculations are offloaded to exact constraint solvers, producing a step-by-step compliance audit log.
- Impact: 100% mathematically verified risk models with full regulatory audit trails.
- Problem: Autonomous drones, industrial turbines, and robotic arms operate under strict thermodynamic, kinematic, and safety invariants. Cloud LLMs introduce dangerous latency and nondeterministic behavior.
- How Mayon-Cortex Solves It: Runs locally on pure CPU (sub-5ms Graph-MCTS). Evaluates telemetry against physical invariants (temperature thresholds, pressure differentials, kinematic boundaries) and triggers deterministic alerts or corrective actions.
- Impact: Air-gapped, zero-GPU real-time control with formal safety guarantees.
- Problem: Global enterprises face conflicting international legal frameworks (e.g., GDPR cross-border data transfer restrictions vs. cloud data synchronization).
- How Mayon-Cortex Solves It: Ingests legal articles and contractual clauses into semantic tissues.
CrossDomainResolverdetects jurisdictional contradictions and flags compliance risks with exact clause citations. - Impact: Rapid, deterministic legal risk assessment without manual review of thousands of pages.
- Problem: Defense, healthcare, and enterprise IP require intelligence that never sends a single byte to external cloud servers, yet edge hardware lacks expensive NVIDIA A100/H100 clusters.
- How Mayon-Cortex Solves It: Built on pure Python and NumPy. Operates with sub-100MB RAM footprint, zero GPU requirements, and local disk persistence.
- Impact: High-assurance intelligence deployed on laptops, Raspberry Pis, submarine computers, or secure on-premise servers.
Mayon-Cortex is designed as a reasoning backend for LLM agents. It exposes 5 logical integration points:
| Layer | Cortex Module | What the LLM Receives |
|---|---|---|
| Plan | ExecutiveController | Complexity class + thinking strategy + decomposed sub-questions |
| Recall | CaseMemory | Top-K most similar past interactions with precedent judgments |
| Think | ActivationWave + PathRanker + SelfCorrector | Verified proof chains + confidence + emotion VAD |
| Validate | UncertaintyGate + JudgmentEngine | Approved / contradiction detected + suggested correction |
| Remember | OnlineLearner + CaseMemory | Graph updated, interaction stored, edges strengthened |
This architecture allows a small LLM (7B parameters) to outperform a larger baseline (70B) on tasks where formal reasoning, contradiction detection, and persistent memory are required — because the LLM is no longer responsible for reasoning. It verbalizes results. Cortex reasons.
from mayon_cortex import CortexGraph, CortexConfig
# Initialize
config = CortexConfig()
brain = CortexGraph(config)
# Ingest domain knowledge
brain.ingest("Metformin treats type 2 diabetes.", sector="medical")
brain.ingest("Metformin contraindicates renal failure.", sector="medical")
brain.ingest("Hypertension is a risk factor for renal failure.", sector="medical")
# Query — returns verified proof chains
response = brain.query("Can we use Metformin for a hypertensive patient?")
print(response.text) # graph-assembled answer
print(response.confidence) # numerical certainty
print(response.is_uncertain) # epistemic flag
for path in response.paths:
print(path.node_ids) # traceable proof chain
# Decision planning
decision = brain.decide("Should we prescribe Metformin to a patient with renal failure?")
for step in decision.decision_chain.steps:
print(f"Step {step.rank} [{step.sector}]: {step.action}")# ARC-AGI solving
from mayon_cortex.reasoning.cortical_arc_reasoner import CorticalARCReasoner
from mayon_cortex.reasoning.arc_solver import ARCTask
reasoner = CorticalARCReasoner()
task = ARCTask.from_json_file("data/arc_tasks/00576224.json")
solution = reasoner.solve(task)
print(f"Solved: {solution.is_solved}")
print(f"Rule: {solution.explanation}")
print(f"Time: {solution.latency_ms:.1f}ms")# Unified pipeline (simplest entry point)
from mayon_cortex import CortexPipeline
brain = CortexPipeline.from_files("my_domain_docs/*.txt")
print(brain.ask("What are the conditions for contract termination?"))
print(brain.solve("If 3x + 5 = 20, what is x?"))
print(brain.judge("Employee shared confidential data externally."))| Component | Parameter | Value |
|---|---|---|
| Concept embedding | Dimension | 384 (R^384) |
| HDC memory | Vector dimension | 10,000 bits |
| NodeDecisionUnit | Trees / depth / features | 100 / 6 / 52 |
| PathRanker | Trees / depth / features | 200 / 8 / 15 |
| ActivationWave | Max hops | 5 |
| ActivationWave | Wavefront cap | 200 nodes |
| Working memory | Buffer size | 10 items |
| CaseMemory | Capacity | 2,000 precedents |
| Hebbian learning | Rate | 0.05 |
| Deduplication | Vector threshold | 0.92 cosine |
| Graph-MCTS | Max latency | < 5ms (CPU) |
| ARC DSL | Primitive count | 60+ |
Mayon-Cortex serves as the high-speed neuro-symbolic co-processor for traditional Large Language Models (GPT-4, Claude, Gemini, Llama 3, DeepSeek).
┌────────────────────────────────────────────────────────────────┐
│ TRADITIONAL LLM / AGENT │
│ (Verbalization, Grammar, Fluency) │
└───────────────────────────▲────────────────────────────────────┘
│ Structured Context / MCP Protocol
┌───────────────────────────▼────────────────────────────────────┐
│ MAYON-CORTEX INTEGRATION │
│ │
│ [Priority 5] cortex_plan → Complexity & Strategy Routing │
│ [Priority 2] cortex_recall → Episodic Precedents (Lifelong) │
│ [Priority 1] cortex_think → Multi-Hop Symbolic Proofs │
│ [Priority 3] cortex_decide → Priority Chains & Conflicts │
│ [Priority 4] cortex_validate → Hallucination & Safety Gate │
└────────────────────────────────────────────────────────────────┘
cortex_think: Traverses multi-hop relational paths with spreading activation waves, ranks proof chains deterministically, and offloads arithmetic/SMT equations without hallucinations.cortex_recall&cortex_remember: Retrieves precedent cases from episodicCaseMemoryand working context, adapting past solved situations to new queries without retraining.cortex_decide: Formulates structured, priority-ranked decision steps and resolves cross-domain contradictions (e.g., drug therapy vs clinical contraindication).cortex_validate: Post-generation hallucination filter that verifies LLM assertions against graph relations, catching contraindications and ungrounded statements.cortex_plan: Prefrontal executive controller that classifies query complexity (TRIVIAL,MODERATE,COMPLEX,MULTI_PART) and directs reasoning pipelines.
# Run the complete 5-layer integration test suite
pytest tests/test_llm_integration.py -v
# Run the interactive live demo
python demos/demo_cortex_llm_integration.pyStart the standard MCP JSON-RPC server on stdio for Claude Desktop, Cursor, and Antigravity:
python -m mayon_cortex.integration.cortex_mcp_servernumpy >= 1.20.0 # only hard dependency
scipy # optional: ARC spatial operations (ndimage)
faiss-cpu # optional: FAISS vector index (falls back to NumPy)
usearch # optional: USearch vector index
No PyTorch. No TensorFlow. No CUDA. No transformer weights.
| Concept | Reference | Mayon-Cortex Implementation |
|---|---|---|
| Spreading activation | Collins & Loftus (1975) | ActivationWave — parallel wavefront with NDU gating |
| Hyperdimensional computing | Kanerva (1988), VS-Graph (2024) | HyperdimensionalMemory — 10k-dim XOR/majority/shift |
| Case-based reasoning | Kolodner (1993) | CaseMemory — graph subpattern precedent store |
| System 1 / System 2 | Kahneman (2011) | ExecutiveController — routes to direct lookup or full deliberation |
| Forward-Forward learning | Hinton (2022) | ForwardForwardLearner — goodness-based layer training |
| Predictive coding | Rao & Ballard (1999) | PredictiveCoder — top-down prediction error minimization |
| ARC-AGI benchmark | Chollet (2019) | CorticalARCReasoner + ARCProgramSynthesizer |
| Monte Carlo Tree Search | Coulom (2006) | GraphMCTSEngine — UCB1 over knowledge graph paths |
| Morphogenetic computation | Turing (1952) | MorphogeneticGenerator — reaction-diffusion on graph |
- Not a language model. Mayon-Cortex does not contain learned weights over natural language.
- Not a RAG system. Retrieval is multi-hop graph traversal with typed relations and formal ranking — not flat cosine similarity over text chunks.
- Not a fine-tuning framework. The system learns online via Hebbian plasticity on the graph, not gradient descent over neural parameters.
- Not production-complete standalone. Text generation quality is bounded by the graph WordGraph bigram model. For fluent output, integrate with any LLM as the verbalization layer.
v1.0.0 — Research prototype. All 10 subsystems implemented and tested.
Benchmark harness for ARC-AGI 400 evaluation tasks is included.
Mayon-Cortex is an open, inclusive, and rigorous scientific and engineering project. All participants, contributors, and maintainers are expected to adhere to our Code of Conduct (adapted from Contributor Covenant v2.1).
For concerns or reports, please reach out to: balavignesh@infidos.com.
Mayon-Cortex is dual-licensed under:
- Open Source: GNU Affero General Public License v3.0 (AGPL-3.0) — Free for open-source development, academic research, and non-commercial evaluation. Under AGPL-3.0, any derivative works or services utilizing Mayon-Cortex over a network must disclose their full source code.
- Commercial License: For proprietary, closed-source, internal enterprise, or SaaS deployments exempt from AGPL-3.0 copyleft obligations. See COMMERCIAL_LICENSE.md or contact balavignesh@infidos.com.
Copyright (c) 2026 INFIDOS LLP / BALAVIGNESH M. All rights reserved.
BALAVIGNESH M
INFIDOS LLP
balavignesh@infidos.com