Hyperon Wiki Extensions
- Applications: Domain-specific deployments: bioinformatics, social robotics, mathematics, and game AI.
- Publications: Browsable index of all books, papers, and preprints β from Hyperon-era research (2020βpresent) through the legacy OpenCog corpus.
- Reference: Cross-cutting indexes: technical companions, implementation families, publication maps, and a GitHub repositories catalog.
- Ecosystem: The organizations building on Hyperon β from the ASI Alliance and SingularityNET to research partners, robotics companies, and applied ventures.
- Glossary: Defines technical terms and internal language used within the ecosystem.
- MeTTa Variants: Non-Index MeTTa runtime variants and adjacent compiler tooling (e.g., MeTTaTron).
Hyperon is SingularityNET's open-source platform for Artificial General Intelligence, designed to progress from here to AGI and ultimately to beneficial ASI (Artificial Superintelligence). Building on decades of research from the OpenCog project, Hyperon provides a unified neurosymbolic framework where diverse cognitive processes β symbolic reasoning, probabilistic inference, neural learning, evolutionary search, and attention allocation β interoperate over shared memory to produce emergent general intelligence.
Unlike narrow AI systems optimized for individual tasks, Hyperon is designed as a composable infrastructure in which multiple learning and reasoning algorithms collaborate through a principle called cognitive synergy. Each algorithm addresses a fundamental requirement of general intelligence, but it is their interaction β sharing representations, guiding each other's search, and co-evolving within a common knowledge substrate β that is intended to enable the system to tackle problems none could solve alone.
Architecture at a Glance
Hyperon's architecture spans four layers, each documented in detail within this wiki:
- AtomSpace β A typed, content-addressed metagraph that serves as shared memory and control plane. Atoms represent symbolic data, relationships, truth values, motives, and executable code in a unified structure where code and data are interchangeable. AtomSpace can be implemented on multiple backends, from the high-performance MORK engine (prefix-tree-based, with large speedups over previous implementations) to the DAS (Distributed AtomSpace) for decentralized operation.
- MeTTa β Meta-Type Talk, a homoiconic programming language that serves as the native "language of thought." MeTTa operates directly over AtomSpace as graph transformations, enabling reflective self-modification, nondeterministic inference, and seamless interoperation between symbolic and neural components. Multiple implementations exist: PeTTa (high-performance Prolog-based), Hyperon Experimental (reference Rust implementation), JeTTa (JVM), MeTTa-Morph (Scheme), and MeTTaTron (F1R3FLY-native).
- AI Algorithms β A library of cognitive modules authored in MeTTa: PLN for probabilistic reasoning under uncertainty, ECAN for economic attention allocation, MOSES for evolutionary program synthesis, MetaMo for compositional motivation, NARS-based systems for open-ended reasoning, and integration layers for LLMs and neural networks.
- PRIMUS Cognitive Architecture β The meta-architecture that orchestrates these components into a unified cognitive system. PRIMUS defines how goal-directed and ambient cognitive loops cooperate, how attention and resources flow between modules, and how the system maintains coherence while self-modifying. Recent theoretical advances include weakness-based simplicity priors, geodesic inference control, TransWeave for cross-domain transfer, and WILLIAM for adaptive compression.
The ASI Chain
For decentralized deployment, Hyperon compiles MeTTa into targets running on ASI Chain β a blockchain runtime designed for AGI workloads. ASI Chain provides cryptographically secured execution, content-addressed provenance, and the ability to scale cognitive processes from a single machine to a distributed network. Its F1R3FLY engine renders concurrent process calculi for scalability, while MeTTaCycle orchestrates AGI workloads. The whitepaper describes ASI Chain as targeting "native inference settlement" β verifying cognitive state transitions rather than just token transfers.
Neural-Symbolic Integration
Hyperon bridges symbolic and neural paradigms through two complementary approaches:
- Outside integration (current) wraps existing neural models (LLMs, vision systems, embedding models) as Spaces within AtomSpace, exposing their outputs for symbolic reasoning and compositional planning. This is implemented via the MeTTa-Motto library.
- Inside integration (experimental) via QuantiMORK proposes encoding neural network structures β wavelet-structured tensors, weight matrices, activation patterns β directly into the MORK PathMap, enabling predictive-coding-style local learning updates without backpropagation.
From OpenCog to Hyperon
Hyperon is a ground-up redesign of the earlier OpenCog framework, preserving the core cognitive theories (cognitive synergy, CogPrime architecture, patternist philosophy of mind) while incorporating new ideas at every level: a new type system and language (MeTTa replacing Atomese/Scheme), a new high-performance backend (MORK replacing the C++ AtomSpace), new mathematical controls (quantale-based weakness, geodesic effort), and decentralized execution infrastructure. The transition represents not a departure from OpenCog's vision but its maturation into a system engineered for scalability and composability.
Key Resources
- Whitepaper: Hyperon for AGIβASI (Ben Goertzel, November 2025)
- Framework Paper: OpenCog Hyperon: A Framework for AGI at the Human Level and Beyond (2023)
- Primary Repository: hyperon-experimental (reference MeTTa implementation)
- Website: metta-lang.dev
Explore Further
Hyperon inherits its conceptual DNA from OpenCog, an open-source AGI framework that evolved through two decades of research and development. Understanding this lineage illuminates why Hyperon is designed the way it is β and what changed in the transition.
Origins: Novamente to OpenCog (1997β2008)
The intellectual roots trace to the late 1990s. Ben Goertzel's work on formalizing general intelligence β defining it as "the ability to achieve complex goals in complex environments" β led to a series of practical systems: the Webmind AI Engine (1997β2001) at Intelligenesis Corp., followed by the Novamente Cognition Engine (2001β2008) at Novamente LLC. In 2008, the Novamente source code was released publicly as OpenCog, establishing an open-source community around the pursuit of AGI.
The conceptual framework was elaborated in several key publications: The Hidden Pattern (2006) on pattern-based philosophy of mind, Probabilistic Logic Networks (2008) on reasoning under uncertainty, and Building Better Minds (2012, with Cassio Pennachin and Nil Geisweiller) detailing the full CogPrime architecture β the specific configuration of cognitive components believed capable of achieving human-level AGI.
OpenCog Classic Architecture
The original OpenCog system, now sometimes called "OpenCog Classic," was built in C++, Scheme, and Python around several core components:
- AtomSpace β A hypergraph database storing typed atoms (nodes and links) with associated truth values, attention values, and other metadata. Knowledge was represented in Atomese, a Lisp-like language for constructing and querying graph structures.
- PLN (Probabilistic Logic Networks) β A comprehensive uncertain inference framework supporting deductive, inductive, and abductive reasoning with graded confidence.
- MOSES (Meta-Optimizing Semantic Evolutionary Search) β An evolutionary program learning system that breeds compact symbolic programs to solve complex optimization problems.
- ECAN (Economic Attention Allocation Networks) β An attention economy that dynamically allocates computational resources across atoms based on short-term and long-term importance.
- OpenPsi β A motivational framework implementing PSI theory for drive-based behavior selection, emotional dynamics, and goal management.
- URE (Unified Rule Engine) β A general-purpose forward and backward chainer for applying inference rules over AtomSpace.
- Link Grammar & RelEx β Natural language processing components for parsing English into dependency structures and mapping them to Atomese representations.
These components were deployed in virtual agent control (OpenCogBot in virtual worlds), humanoid robotics (Hanson Robotics integration), and biological knowledge exploration.
What Carried Forward
Hyperon preserves the core intellectual commitments of OpenCog:
- Cognitive synergy β The conviction that AGI requires multiple interoperating cognitive processes, not a single monolithic algorithm.
- AtomSpace as shared memory β A typed metagraph serving as the common substrate for all cognitive operations.
- The CogPrime cognitive model β Now evolved into PRIMUS, retaining the same fundamental architecture of interacting memory systems, attention dynamics, and goal-directed reasoning.
- The same core algorithms β PLN, MOSES, and ECAN remain central to Hyperon, updated with new mathematical foundations.
- Patternist philosophy β Intelligence understood as pattern recognition and creation across multiple levels of abstraction.
What Changed
Hyperon is not an incremental update but a ground-up redesign motivated by hard-won lessons from a decade of OpenCog development:
- Language: Atomese and Scheme were replaced by MeTTa β a purpose-built language with a formal type system, homoiconicity (code-as-data), and native support for nondeterministic inference and self-modification. Where Atomese required manual encoding in Scheme, MeTTa operates directly as graph transformations over AtomSpace.
- Performance: The C++ AtomSpace was complemented (and in high-performance contexts replaced) by MORK, a prefix-tree-based metagraph engine achieving large speedups through radically different data structures and the Zipper Abstract Machine.
- Mathematics: New unifying mathematical frameworks β quantale-based weakness theory, geodesic inference control, optimal transport for attention β provide principled controls that the original system lacked.
- Decentralization: OpenCog ran on single machines or small clusters. Hyperon targets decentralized execution via ASI Chain, with cryptographic provenance, capability-secured processes, and blockchain-based governance.
- Neural integration: OpenCog treated neural networks as external components. Hyperon offers deeper integration through QuantiMORK (proposed: encoding tensors natively in the graph) alongside pragmatic wrapping of existing models via MeTTa-Motto.
- Motivation: OpenPsi evolved into MetaMo, a mathematically grounded compositional motivation framework with formal stability guarantees.
Technical Deep Dive: OpenCog Legacy Full β complete timeline, 11-row architectural bridge map, five motivations for transition, component maturity analysis, CogServer criticisms, anti-CYC philosophy, pattern mining evolution, and maintained vs. archived repos.
Key References
- Hart, D. and Goertzel, B. (2008). OpenCog: A Software Framework for Integrative Artificial General Intelligence β Proceedings of the First Conference on AGI, IOS Press
- Goertzel, B. (2012). Building Better Minds β comprehensive CogPrime design
- Goertzel, B. et al. (2023). OpenCog Hyperon: A Framework for AGI at the Human Level and Beyond
- Goertzel, B. (2025). Hyperon for AGIβASI: Whitepaper 2025
- OpenCog Wiki β historical documentation
Β
Tags
Discussion
Β
Cognitive synergy is the foundational design principle of Hyperon: the idea that general intelligence emerges not from any single algorithm but from the cooperative interaction of multiple specialized cognitive processes sharing a common knowledge substrate. It is both a theory of how minds work and an engineering methodology for building AGI systems.
The Core Insight
Human cognition integrates perception, reasoning, memory, attention, motivation, language, and learning into a unified system where each process continuously informs and strengthens the others. A purely logical reasoner struggles with grounding; a purely statistical learner struggles with compositionality; a purely evolutionary system struggles with directed search. But when these approaches operate over shared representations and guide each other's processing, capabilities emerge that none could achieve independently.
In Goertzel's formulation from Building Better Minds: cognitive synergy occurs when multiple cognitive processes β each handling a different aspect of intelligence β cooperate in a way that their combined capability exceeds the sum of their individual contributions. This is not mere parallelism. It is deep interoperation: one process generating hypotheses that another evaluates, one process identifying attention-worthy patterns that another reasons about, one process learning representations that another uses to plan.
How Synergy Is Designed Into Hyperon
Hyperon's architecture is engineered to enable cognitive synergy through three mechanisms:
- Shared AtomSpace: All cognitive processes read from and write to the same typed metagraph. When PLN derives a new inference, it becomes available to MOSES for program synthesis, to ECAN for attention reallocation, and to pattern mining for structural analysis. Co-location in shared memory reduces the integration overhead that plagues systems where components communicate through narrow APIs or message buses.
- Common representational language: MeTTa provides a single language in which reasoning rules, evolutionary fitness functions, attention policies, and motivational goals can all be expressed, examined, and combined. Because code is data in MeTTa, one cognitive process can inspect and modify the programs of another.
- PRIMUS orchestration: The PRIMUS cognitive architecture defines how cognitive processes cooperate within two meta-dynamics: goal-directed loops (where specific objectives drive coordinated processing) and ambient loops (where background maintenance β attention spreading, pattern discovery, memory consolidation β keeps the system's knowledge fresh and well-organized).
Critical Synergies
Some of the most important synergistic interactions designed into Hyperon include:
- PLN + MOSES: Logical inference generates candidate hypotheses; evolutionary search breeds programs to test them. PLN can evaluate the logical consistency of MOSES-generated programs, while MOSES can evolve inference control strategies for PLN.
- ECAN + PLN: Attention allocation guides which inferences are worth pursuing (avoiding combinatorial explosion), while inference results inform which atoms deserve increased attention.
- Pattern Mining + Neural Networks: Mined patterns from AtomSpace can serve as structural priors for neural architectures, while neural embeddings can guide the pattern mining search.
- MetaMo + All Processes: The motivational framework evaluates which cognitive goals are most urgent and allocates resources accordingly, creating a self-regulating economy of cognitive effort.
Why Cognitive Synergy Is "Tricky"
As discussed in Building Better Minds (Chapter 8), cognitive synergy may explain a puzzling feature of AGI research: the difficulty of measuring partial progress. If intelligence emerges primarily from the interaction between cognitive processes rather than from any individual process, then a system with three out of five components may show dramatically less capability than one with all five β even though it is only "two components away." This creates a perception of sudden capability jumps that are actually the result of crossing synergy thresholds.
This insight has practical consequences for Hyperon development: the system's true capabilities may only become apparent when enough components are integrated and interoperating, not when individual components are benchmarked in isolation.
Key References
- Goertzel, B. et al. (2012). Building Better Minds, Chapter 8: Cognitive Synergy
- Goertzel, B. (2009). OpenCogPrime: A Cognitive Synergy Based Architecture for Embodied AGI
- Goertzel, B. (2025). Hyperon for AGIβASI Whitepaper, Β§4: The PRIMUS Cognitive Architecture
Tags
Discussion
AtomSpace is the foundational data structure at the heart of Hyperon β a typed, content-addressed metagraph that serves as both shared memory and control plane for all cognitive processes. It is the substrate in which knowledge, code, inference results, attention values, motivational states, and neural representations all coexist and interoperate.
Status: The AtomSpace concept and Space API abstraction are current β implemented in the reference Hyperon codebase (hyperon-experimental) and in MORK. The reference AtomSpace, MORK, and DAS backends are operational. Neural Spaces are experimental; blockchain-backed Spaces via F1R3FLY are proposed.
What Is a Metagraph?
An AtomSpace is a generalization of a hypergraph. Where a traditional graph connects pairs of nodes with edges, and a hypergraph allows edges to connect arbitrary sets of nodes, a metagraph goes further: edges (Links) can themselves be members of other edges, and both nodes and links carry typed values. This recursive structure naturally represents the nested, multi-relational knowledge structures required for general intelligence β logical implications, probabilistic dependencies, procedural programs, and attention metadata can all be expressed as atoms within the same graph.
Every atom in AtomSpace is typed. The type system encodes data categories (symbols, numbers, expressions), function types, and logical connectives. The scope and enforcement of type constraints varies across backends β the reference implementation and MORK each handle types somewhat differently. MeTTa programs can introspect and manipulate the type structure itself.
Code Is Data
A defining feature of AtomSpace is that programs and data share the same representation. A MeTTa function definition, a PLN inference rule, a MOSES-generated program, and a factual knowledge assertion are all atoms in the metagraph. This homoiconicity enables:
- Reflective self-modification: Programs can inspect, analyze, and rewrite themselves and each other at runtime.
- Cognitive synergy: Different cognitive processes naturally share representations because they all operate on the same substrate.
- Inference over code: PLN can reason about the properties of programs just as it reasons about factual knowledge.
The Space API
AtomSpace is accessed through a universal Space API that abstracts over multiple possible backends. A Space supports operations for adding, removing, querying, and pattern-matching atoms. Current and planned backends:
- Reference AtomSpace (current) β The Rust implementation in hyperon-experimental, providing the canonical semantics for MeTTa execution.
- MORK (current) β The high-performance core. A prefix-tree (trie-map) based engine achieving large speedups over previous implementations. MORK stores S-expressions as paths in a radix tree, enabling near-constant-time content-addressed lookup. Its Zipper Abstract Machine (ZAM) supports multi-threaded parallel execution. (See MORK for details.)
- DAS (Distributed AtomSpace) (current) β A distributed backend that decouples persistence (Long-Term Importance) from immediate dynamics (Short-Term Importance via an Attention Broker). DAS enables AtomSpaces spanning multiple machines with Hebbian learning-based resource allocation. (See DAS for details.)
- Neural Spaces (experimental) β Wrappers that expose neural network models (LLMs, embedding models, vision systems) as queryable Spaces, enabling symbolic processes to interact with neural outputs through the same API.
- Blockchain-backed Spaces (proposed) β AtomSpaces persisted on ASI Chain via F1R3FLY's RSpaces, providing cryptographic provenance and decentralized access.
Content Addressing
Atoms in AtomSpace are content-addressed β identified by what they contain rather than where they are stored. In MORK, this is implemented through content identifiers (CIDs) derived from the atom's path in the trie structure, enabling efficient verification and deduplication. Content addressing is what makes distributed and decentralized AtomSpaces practical: the same atom resolves to the same identifier regardless of which node stores it.
Truth Values and Metadata
Atoms carry associated values beyond their structural content:
- Truth Values: Probabilistic confidence measures used by PLN for uncertain reasoning. Hyperon supports multiple truth value types including simple (strength, confidence), distributional, and indefinite truth values.
- Attention Values: Short-Term Importance (STI) and Long-Term Importance (LTI) scalars managed by ECAN to regulate which atoms receive computational resources.
- Custom Values: Arbitrary typed metadata can be attached to atoms, including tensors, timestamps, provenance records, and motivational annotations.
Historical Context
The AtomSpace concept originated in the OpenCog project as a C++/Scheme hypergraph database. The original implementation stored atoms in an in-memory graph with optional PostgreSQL persistence. In Hyperon, the concept has been generalized: AtomSpace is now an abstract interface (the Space API) that can be implemented on different backends β from MORK's prefix trees to DAS's distributed storage β while preserving consistent semantics for cognitive processes built on top of it.
Technical Deep Dive: AtomSpace Full β metagraph formal definition, Atom/Value distinction, TruthValue-to-FloatValue transition, Space API abstraction, classical C++ vs. Rust implementations, performance architecture, and historical design decisions.
Key References
- Goertzel, B. (2025). Hyperon for AGIβASI Whitepaper, Β§2: Hyperon System Design
- Goertzel, B. (2012). Building Better Minds, Ch. 19β20: OpenCog Framework and Knowledge Representation
- opencog/atomspace β Original C++ AtomSpace implementation
- trueagi-io/hyperon-experimental β Reference Rust AtomSpace in Hyperon
Β
Tags
Discussion
Β
A central challenge of AGI is unifying the complementary strengths of neural networks (pattern recognition, generalization from data, continuous optimization) with symbolic systems (compositional reasoning, interpretability, knowledge representation). Hyperon's design addresses this through a dual-path architecture offering both pragmatic interoperability and deep structural unification.
Status: Outside integration is current (implemented via MeTTa-Motto). Inside integration (QuantiMORK) and the advanced techniques below are proposed β described in the 2025 whitepaper as research directions.
Two Paths to Integration
Hyperon provides two complementary modes of neural-symbolic integration, suited to different stages of system maturity:
Outside Integration: Pragmatic Wrapping (Current)
In outside mode, existing neural models β large language models, vision transformers, embedding models, reinforcement learning agents β are wrapped as Spaces within Hyperon's Space API. Symbolic processes can query neural models through the same interface they use to query the AtomSpace:
- An LLM can be queried for semantic parsing, translating natural language into MeTTa expressions that PLN can reason about.
- An embedding model can provide similarity-based retrieval, enabling pattern mining to discover structural regularities in neural representations.
- A vision system can populate AtomSpace with perceived objects and relationships, grounding symbolic reasoning in perceptual data.
The MeTTa-Motto library implements this approach, embedding LLMs (ChatGPT, Claude, open-source models) as programmable MeTTa functions with support for stateless wrappers, stateful dialogue agents, retrieval-augmented generation, and functional calling. (See MeTTa-Motto for details.)
The whitepaper also describes Symbolic Transformer Heads as part of outside integration: mined patterns from AtomSpace serve as structured templates augmenting standard transformer attention heads, using contrastive symbolic alignment to ensure patterns survive memory compression in compressive transformer architectures.
Inside Integration: QuantiMORK (Proposed)
The 2025 whitepaper proposes a more radical inside mode called QuantiMORK, in which neural network structures would be natively encoded within the MORK metagraph rather than wrapped. This would represent neural network components β weight matrices, activation patterns, wavelet-structured tensors β directly as paths and values in MORK's prefix-tree database.
Proposed properties of QuantiMORK:
- Neural networks as native graph operations: Forward passes, weight updates, and activation propagation expressed as graph traversals within MORK, making them amenable to the same attention allocation and reasoning processes that operate on symbolic content.
- Predictive coding without backpropagation: Local updates where each layer adjusts based on prediction errors from adjacent layers, compatible with Hyperon's distributed, asynchronous execution model.
- Unified attention: Neural activations and symbolic knowledge would share the same graph, allowing ECAN's attention allocation to operate uniformly across both.
Weakness-Based Stability (Proposed)
To address the risk that neural learning updates could destabilize symbolic knowledge (and vice versa), the whitepaper explores weakness-based regularization: a quantale-valued simplicity metric applying uniformly to both neural weight updates and symbolic inference steps. The whitepaper investigates conditions under which combined updates would approximately commute β a desirable property for reliable integration, though the extent of this commutativity in practice remains an open research question.
Key References
- Goertzel, B. (2025). Hyperon for AGIβASI Whitepaper, Β§7: Neural-Symbolic Synergy in Hyperon
- Goertzel, B. et al. (2023). OpenCog Hyperon, Β§3.2: Hyperon's Position in the Era of LLMs
Tags
Discussion
A system capable of general intelligence must eventually be capable of reflecting on and improving its own cognitive processes. Hyperon's design treats self-modification as a first-class capability governed by formal mathematical guarantees β aiming to ensure that a system improving itself remains aligned with its intended goals and values.
Status: Proposed. The self-modification pipeline described here is a research design from the 2025 whitepaper (Β§8). It has not yet been implemented end-to-end. The mathematical foundations (weakness theory, geodesic control) are under active development; the deployment pipeline and governance mechanisms remain architectural proposals.
The Challenge
Self-modifying AGI presents a fundamental tension: the same capability that enables a system to improve itself could allow it to alter its goals, remove its safety constraints, or destabilize its own reasoning. Hyperon's proposed approach is to make self-modification transparent, auditable, and mathematically bounded.
The Proposed Five-Stage Self-Modification Pipeline
The whitepaper describes a disciplined pipeline for self-modification:
- Proposal: A modification is expressed as a typed metamorphism β a formal transformation with explicit pre-conditions, post-conditions, and type signatures. Because MeTTa is homoiconic (code is data), modifications to cognitive processes would be represented as atoms in AtomSpace, subject to the same reasoning and analysis as any other knowledge.
- Analysis: PLN and other reasoning processes would analyze the proposed modification for logical consistency, potential side effects, and alignment with current goal structures. The weakness metric would provide a quantitative bound on how much complexity the modification introduces.
- Simulation: The modification would be tested in a twin simulation β a sandboxed copy of the relevant AtomSpace subgraph where the modification can be applied and its effects observed without affecting the running system.
- Certification: Formal admission certificates would validate that the modification satisfies safety properties, verified using the same inference machinery (PLN over quantale-annotated factor graphs) that powers general reasoning.
- Deployment: Certified modifications would be deployed through staged rollout: shadow mode (running alongside the original), dual-run (both versions active with output comparison), and finally elevation to primary status β with rollback capability at every stage.
Goal Stability (Proposed)
The whitepaper proposes addressing goal stability through supermartingale potentials β Lyapunov-like mathematical functions that provably do not increase under permitted modifications. If a proposed change would increase the potential (indicating goal drift), it would be flagged for additional review or rejected. The aim is to transform goal stability from a philosophical concern into a tractable mathematical problem.
Global Regulators (Proposed)
The design envisions certain principles enforced globally across all cognitive processes:
- Weakness bounds: All updates must satisfy quantale-valued simplicity constraints.
- Geodesic effort: All control flow follows cost-aware geodesic paths balancing accuracy against simplicity.
- Transparency: All modifications are logged with full provenance in content-addressed storage.
Decentralized Governance (Proposed)
When Hyperon operates on ASI Chain, self-modifications could become subject to multi-party governance β requiring approval from multiple stakeholders, community voting, or smart contract constraints encoding organizational policies.
Technical Deep Dive: Self-Modification and Safety Full β typed metamorphism formalism, supermartingale goal stability, five-stage pipeline details, lens laws, drift bounds, and decentralized governance.
Key References
- Goertzel, B. (2025). Hyperon for AGIβASI Whitepaper, Β§8: Planning for the AGIβASI Transition
- Goertzel, B. (2012). Building Better Minds, Ch. 18: Advanced Self-Modification
Tags
Discussion
Tags
Discussion
Papers: Hyperon for AGIβASI Whitepaper (2025), Β§9
Status: Active pilot efforts and research workstreams in four domains. Each at early stages with near-term milestones defined in the whitepaper.
Hyperon's development philosophy is to build real applications in diverse domains from day one, using each as both a testbed and a source of learning that benefits all others. Four domains are currently active β game AI, humanoid social robotics, bioinformatics, and mathematical reasoning. All connect to the same Hyperon+PRIMUS substrate, meaning advances in perception, reasoning, pattern mining, motivation, and transfer benefit every domain simultaneously.
Architecturally, multiple applications share common "collective knowledge" AtomSpaces while maintaining separate per-application AtomSpaces for task-specific processing. The same mathematical controls (weakness priors, geodesic fΒ·g control) and the same neurosymbolic loop (Pattern Miner β WILLIAM β Symbolic Heads/PLN) operate uniformly across all domains.
Responsible: Ben Goertzel (architecture); Berick Cook (AIRIS integration)
Papers: Hyperon for AGIβASI Whitepaper (2025), Β§9.1
GitHub: Vereya (Minecraft mod), minecraft-demo (Python API), minecraft-experiments, AIRIS-client, rocca (Rational OpenCog Controlled Agent β OpenAI Gym RL), axiom (AXIOM object-centric game-world agent)
Status: Active pilot. Minecraft integration operational via Vereya mod and tagilmo Python API. AIRIS demonstrated causal learning in Minecraft without pre-training. Sophiaverse and Neoterics playground are under development.
Games provide ideal sandboxes for testing perception, planning, tool use, dialogue, and social norms with rapid iteration and safe failure. Three environments are targeted:
- Minecraft β A structured yet open world for integrating SubRep options with evolutionary program edits. The Vereya Fabric mod (Java 21) exposes game state via a network API; the tagilmo Python library provides high-level agent control.
- Sophiaverse β Adds persistent identity, social contracts, and economic systems to the game AI substrate.
- Neoterics β A deliberately constrained micro-world within Sophiaverse, optimized for baby-AGI development with short feedback loops, dense sensor coverage, and cheap resets.
Technical Architecture
The whitepaper describes the game interface operating through Spaces that mirror game state (voxels, entities, quests, markets) into AtomSpace as typed Atoms. Action affordances appear as SubRep options (navigate, craft, trade, negotiate) with MeTTa rules expressing pre/post-conditions. External LLMs handle narration and quest generation initially, with Symbolic Heads retrieving mined templates like task frames and recipes. PLN factor-graphs encode precondition networks and multi-step plans, with geodesic control scoring candidate steps.
AIRIS (Autonomous Intelligent Reinforcement Inferred Symbolism) has demonstrated causal learning in Minecraft β constructing deterministic environment models through direct interaction without pre-training, and self-correcting via scientific method application.
Additional Repos
- rocca β Rational OpenCog Controlled Agent. Python RL agent using OpenCog AtomSpace for OpenAI Gym environments. Demonstrates planning via PLN and action selection via cognitive schematics. Legacy OpenCog era but conceptually aligned with the PRIMUS game-AI architecture.
- axiom β AXIOM (Adaptive Expansion Object-Centric Models). JAX-based system for rapidly learning to play video games through object-centric representation learning β discovers and tracks objects from raw pixels using hierarchical slot mixture modeling with MPPI-based planning. Developed by VERSES AI. Relevant as a modern object-centric game-world agent architecture, though not directly integrated with MeTTa or AtomSpace.
Key References
- Goertzel, B. (2025). Hyperon for AGIβASI Whitepaper, Β§9.1: Game AI
- AIRIS β causal machine learning system
Tags
Discussion
Responsible: Ben Goertzel (architecture)
Partners: Mind Children (education robot); Hanson Robotics (expressive humanoids β Sophia, Desdemona)
Papers: Hyperon for AGIβASI Whitepaper (2025), Β§9.2
GitHub (legacy OpenCog): ghost_bridge (ROS-GHOST bridge), ros-behavior-scripting (Eva robot control, production 2015β2017), loving-ai (Loving AI dialogue/meditation), loving-ai-ghost (GHOST chatbot scripts for Loving AI)
Status: Partnerships established with Mind Children and Hanson Robotics. Legacy OpenCog ROS integration exists (ghost_bridge, ros-behavior-scripting, loving-ai). Hyperon-native robotics integration is under development; the whitepaper (Β§9.2) describes the target architecture.
Humanoid social robotics provides a stress-test for PRIMUS: robots must combine perception, dialogue, motor control, and social norms seamlessly β from classroom tutoring to stage performance β without requiring a complete rewrite for each scenario.
Target Architecture (from Whitepaper)
The whitepaper describes a layered architecture: external audio/vision neural networks for initial perception, with progressive embedding of predictive coding layers for latency-critical paths (gaze estimation, lip-sync, gesture segmentation). Pattern Miner would discover conversational templates (adjacency pairs, tutoring frames) for Symbolic Heads to retrieve during speech decoding, while PLN enforces persona and safety constraints. MetaMo would budget the balance between exploration and de-escalation behaviors.
Motor control keeps low-level servo loops on the robot while SubRep options cover higher-level skills ("look at face", "nod", "hand-wave") with formal admission certificates. Geodesic control aligns dialogue steps with motion options so physical gestures support conversational goals. The whitepaper describes capability-gated on-device modification and safety dashboards tracking invariant bands for persona and etiquette.
Current Implementation
The existing repo surface is legacy OpenCog infrastructure:
- ghost_bridge β ROS package connecting Hanson Robotics hardware to the GHOST chatbot system via AtomSpace. Bridges speech, gaze, gestures, emotion recognition.
- ros-behavior-scripting β ROS nodes for Eva robot sensory input (vision, audio) and motor control. Production use with Hanson Robotics 2015β2017.
- loving-ai β Loving AI project for social interaction and guided meditation with the Sophia robot. Demonstrates empathetic dialogue, emotional responsiveness, and therapeutic conversation. Uses OpenCog AtomSpace for dialogue management.
- loving-ai-ghost β GHOST chatbot dialogue scripts for the Loving AI project. Rule-based dialogue trees with emotion-aware branching for meditation guidance and empathetic conversation.
Hyperon-native equivalents of these components are part of the development roadmap.
Key References
- Goertzel, B. (2025). Hyperon for AGIβASI Whitepaper, Β§9.2: Humanoid Social Robotics
Tags
Discussion
Responsible: Ben Goertzel (architecture); iCog Labs (data pipelines)
Papers: Hyperon for AGIβASI Whitepaper (2025), Β§9.3
GitHub: agi-bio (genomics/proteomics), biochatter-metta (NL-to-MeTTa queries), pubchem2metta (PubChem conversion), bio-semantic-parser (biological data parsing), bio-data-semantic-parsing (bio data semantic parsing pipeline)
Status: Active pilot. Data ingestion pipelines operational (agi-bio, biochatter-metta, pubchem2metta). End-to-end hypothesis generation on longevity datasets is a near-term milestone.
Biology is fundamentally structured as graphs: genes connect to proteins, proteins form pathways, pathways influence phenotypes, drugs modulate these relationships. Hyperon's graph-native architecture is well-suited to combining noisy biological graphs, mining meaningful motifs, running uncertain chains of reasoning, and proposing ranked hypotheses with clear rationales.
Data Pipeline
Data flows into AtomSpace through BioSpace adapters that transform omics matrices into node attributes, protein-protein interactions and pathways into edges, literature triples into assertions with provenance, and clinical outcomes into noisy links with confidence scores. Everything receives CIDs, making merges auditable and reproducible. Existing tools include:
- agi-bio β OpenCog-era genomic and proteomic data exploration (C++/Scheme/Python), extended by MOZI.AI as SingularityNET services
- biochatter-metta β Converts natural language biomedical questions into MeTTa queries against the Human BioAtomspace knowledge graph using LLMs with BioCypher schema
- pubchem2metta β Converts PubChem RDF chemical data into MeTTa format via BioCypher adapters
- bio-semantic-parser β iCog Labs biological data parsing tool for extracting structured representations from biological datasets
- bio-data-semantic-parsing β iCog Labs pipeline for semantic parsing of biological data into knowledge graph-compatible formats
Proposed Hypothesis Generation Pipeline
The whitepaper describes a pipeline where Pattern Miner identifies motifs (e.g., "gene A β pathway P β phenotype Y with drug D evidence") ranked by I-surprisingness, WILLIAM promotes frequent subgraphs to reusable templates, PLN factor-graphs propagate graded truth over ontologies and experimental results, and MOSES/GEO-EVO evolves predictive programs. TransWeave would move mechanism components across cohorts or omics platforms when matches hold strong.
The proposed output would be ranked hypothesis packs β auditable CID bundles containing mechanism graphs, predictors, expected biomarkers, and counter-evidence β with experiment selection guided by geodesic fΒ·g control.
Key References
- Goertzel, B. (2025). Hyperon for AGIβASI Whitepaper, Β§9.3: Bioinformatics
Tags
Discussion
Responsible: Ben Goertzel (architecture)
Papers: Hyperon for AGIβASI Whitepaper (2025), Β§9.4
GitHub: chaining (forward/backward chaining, proof synthesis), mm2metta (MetamathβMeTTa converter), mmverify.py (Metamath verifier)
Status: Existing tools include MeTTa forward/backward chaining (chaining repo), Metamath-to-MeTTa conversion (mm2metta), and a Metamath proof verifier (mmverify.py). The whitepaper reports an MM2 proof verifier implemented inside MORK as a fast graph-local proof kernel. The broader automated conjecturing pipeline described below is the proposed research direction.
Most automated theorem proving focuses on proving stated goals, but mathematicians spend much of their time on conjectures β formulating new definitions, lemmas, and "what if" hypotheses that later get proved, refuted, or refined. Hyperon targets automated conjecturing as the primary goal, then uses formal proof for validation.
Proposed Architecture (from Whitepaper)
The whitepaper describes a pipeline built around the MORK/MM2 proof verifier kernel:
- Knowledge base: Definitions, theorems, proofs, and proof tactics stored as Atoms. A MathSpace wrapper would handle import/export to external proof assistants while maintaining CIDs and equivalence classes internally.
- Pattern discovery: Pattern Miner finds proof motifs (induction schemas, commutativity tricks) ranked by surprisingness. WILLIAM promotes frequent motifs to templates for tactic prediction and proof search heuristics.
- Conjecture engine: Conjecturing framed as geodesic search over typed expressions β forward factors from known lemmas, backward factors from gaps to close, weakness bias toward simple statements, TransWeave reuse of isomorphic substructures from neighboring theories.
- Proof verification: Candidate conjectures enter a pipeline β schematic proofs with PLN hints, external provers when helpful, then validation in the MM2 proof verifier on MORK.
Current Tools
- chaining β MeTTa implementations for automated reasoning: forward/backward chaining, program synthesis, PLN integration, Metamath reasoning, and modal logic experiments
- mm2metta β Converts Metamath formal proofs (.mm) to MeTTa (.metta) format, bridging formal verification with Hyperon's symbolic reasoning
- mmverify.py β Pure Python Metamath proof verifier (~700 lines), providing an independent verification baseline
Key References
- Goertzel, B. (2025). Hyperon for AGIβASI Whitepaper, Β§9.4: Mathematical Theorem Proving with Automated Conjecturing
Tags
Discussion
Tags
Discussion
Peer-reviewed publications, books, and foundational research underpinning the Hyperon framework. This section provides a browsable index organized by era and topic β from the current Hyperon-era papers to the legacy OpenCog research corpus. Individual component cards throughout the wiki also link to their relevant papers directly.
For structured reading guides that map source material to wiki content, see Publication Maps under Reference.
Books
Coverage at a Glance
| Bucket | What it means | Examples |
|---|---|---|
| Dedicated book-length publication cards already exist | These titles already have standalone cards under Publications and are the fastest way to orient a reader. | The Hidden Pattern; Probabilistic Logic Networks; Engineering General Intelligence; Real World Reasoning |
| Important Ben Goertzel books already referenced elsewhere, but not yet broken out here | These works are already named in +Papers and should be the next priority if book coverage is expanded. | The Structure of Intelligence; Chaotic Logic; Artificial General Intelligence; OpenCog: A Software Framework for Integrative AGI; The AGI Revolution |
Dedicated Book-Length Publication Cards
- The Hidden Pattern β Ben Goertzel (2006). Patternist philosophy of mind.
- Probabilistic Logic Networks β Goertzel, IklΓ© et al. (2009). The foundational PLN text.
- Engineering General Intelligence Vol 1 β Goertzel, Pennachin, Geisweiller (2014). Cognitive science perspective.
- Engineering General Intelligence Vol 2 β Goertzel, Pennachin, Geisweiller (2014). CogPrime architecture.
- Real World Reasoning β Goertzel, IklΓ© et al. Uncertain spatiotemporal reasoning.
Important Ben Goertzel Books Not Yet Broken Out as Standalone Publication Cards
- Goertzel (1993), The Structure of Intelligence: A New Mathematical Model of Mind β early mathematical formalization of patternist mind theory.
- Goertzel (1994), Chaotic Logic: Language, Thought, and Reality from the Perspective of Complex Systems Science β logic and cognition as self-organizing dynamical process.
- Goertzel, Pennachin (eds.) (2007), Artificial General Intelligence β early AGI field survey volume.
- Goertzel, Hart (eds.) (2008), OpenCog: A Software Framework for Integrative Artificial General Intelligence β book-length OpenCog architectural snapshot.
- Goertzel, Lian, Arel, de Garis, Chen (eds.) (2012), Theoretical Foundations of Artificial General Intelligence β formal foundations volume.
- Goertzel (ed.) (2014), AGI: Concept, State of the Art, and Future Prospects β state-of-the-field overview.
- Goertzel (2016), The AGI Revolution: An Inside View of the Rise of Artificial General Intelligence β strategic and historical overview.
Papers
Coverage at a Glance
| Bucket | What it means | Representative items |
|---|---|---|
| Standalone publication cards already exist | These works already have dedicated cards under Publications and are linked throughout the sections below. | The Hidden Pattern; Probabilistic Logic Networks; OpenCog Hyperon: A Framework for AGI at the Human Level and Beyond; Meta-MeTTa; MetaMo: A Robust Motivational Framework for Open-Ended AGI |
| Already represented in RawData or Publication Maps, but not yet promoted to standalone publication cards | These papers are already in the wiki's research pipeline and remain good candidates for future publication-card promotion. | A General Theory of General Intelligence; What Kind of Programming Language Best Suits Integrative AGI?; Patterns of Quantum Cognition II: Quantum Logic as a Foundation for AGI |
| Internal or prepublication design-note layer | These items are valuable to technical readers, but they are not all conventional public papers and should be treated separately from the peer-reviewed / arXiv publication set. | Hyperseed-1: Core Ontology; HyperClaw: Cognitive Orchestration via Attention-Metaprotocol |
Investor / Overview Shortlist
- Hyperon architecture: OpenCog Hyperon: A Framework for AGI at the Human Level and Beyond
- Roadmap and positioning: OpenCog Hyperon: A Practical Path to Beneficial AGI and ASI
- Language/runtime: Meta-MeTTa: an operational semantics for MeTTa
- Knowledge substrate: A Selectivity Theorem and a Hierarchical Corollary; Graphs, Metagraphs, RAM, CPU
- Cognitive architecture: Toward a Formal Model of Cognitive Synergy; MetaMo: A Robust Motivational Framework for Open-Ended AGI
- Reasoning: Probabilistic Logic Networks; Probabilistic Logic Networks for Temporal and Procedural Reasoning
Research Trajectory
| Era | Focus | Key Publication |
|---|---|---|
| Philosophical (1993β2006) | Patternist theory of mind | The Hidden Pattern (2006) |
| Experimental (2006β2014) | CogPrime cognitive engine | Engineering General Intelligence (2014) |
| Foundational (2021β2023) | MeTTa language and MORK substrate | OpenCog Hyperon Whitepaper (2023) |
| Applied (2024β2025) | Multi-domain AGI deployment | AGI-25: PRIMUS, MetaMo, PLN/NARS papers |
| Orchestration (2026β) | Hybrid AGI coordination | HyperClaw: Cognitive Orchestration (2026) |
Books
- Goertzel (1993), The Structure of Intelligence: A New Mathematical Model of Mind β Springer. First formal treatment of the patternist philosophy of mind that underlies Hyperon's design.
- Goertzel (1994), Chaotic Logic: Language, Thought, and Reality from the Perspective of Complex Systems Science β Plenum Press. Introduces logic as a dynamic, self-organizing process β a direct precursor to MeTTa's non-deterministic evaluation model.
- Goertzel (2006), The Hidden Pattern: A Patternist Philosophy of Mind β BrownWalker Press. Foundational philosophy underlying AtomSpace and MeTTa knowledge representation designs.
- Goertzel, Pennachin (eds.) (2007), Artificial General Intelligence β Springer. First systematic survey of the AGI research field.
- Goertzel, Hart (eds.) (2008), OpenCog: A Software Framework for Integrative Artificial General Intelligence β Atlantis Press.
- Goertzel, Lian, Arel, de Garis, Chen (eds.) (2012), Theoretical Foundations of Artificial General Intelligence β Atlantis Press.
- Goertzel et al. (2009), Probabilistic Logic Networks β Springer. Full PLN formalism and applications.
- Goertzel, Pennachin, Geisweiller (2014), Engineering General Intelligence, Vols. 1β2 β Atlantis Press. Full CogPrime architecture specification.
- Goertzel (ed.) (2014), AGI: Concept, State of the Art, and Future Prospects β Collection of AGI direction essays.
- Goertzel (2016), The AGI Revolution: An Inside View of the Rise of Artificial General Intelligence β Humanity+ Press.
Hyperon Yellow Papers (Formal Specifications)
Technical design documents and formal proofs defining core Hyperon components. Items marked [internal] are not yet publicly available.
- Potapov (2021), MeTTa Specification β Formal language specification for Meta-Type Talk. [design doc]
- Meta-MeTTa: an operational semantics for MeTTa β Meredith, Goertzel, Warrell, Vandervorst (2023). Formal semantics and MeTTa-to-Rholang compilation proof. arXiv:2305.17218. See Publication Map.
- Graphs, Metagraphs, RAM, CPU β Vepstas (2023). AtomSpace metagraph formalism, content addressing, sheaf theory bridge. v2.1.1, 70pp.
- A Selectivity Theorem and a Hierarchical Corollary β Goertzel (2025). Formal foundations for MORK/ZAM efficiency. See Publication Map.
- Goertzel (2024), Hyperseed-1: Core Ontology β Ontological seeding specification for Hyperon knowledge bases. [design doc, internal]
- Goertzel (2026), HyperClaw: Cognitive Orchestration via Attention-Metaprotocol β Design proposal for attention-based meta-layer coordination across Hyperon subsystems. [design doc]
Hyperon Era (2020βPresent)
Architecture & Framework
- OpenCog Hyperon: A Framework for AGI at the Human Level and Beyond β Goertzel et al. (2023). Primary architectural whitepaper. arXiv:2310.18318. See Publication Map.
- OpenCog Hyperon: A Practical Path to Beneficial AGI and ASI β Goertzel (2025). AGI-25, Springer LNCS vol. 16057. [peer-reviewed]
- Goertzel (2021), A General Theory of General Intelligence β Metagraph-theoretic AGI foundations. arXiv:2103.15100
- Goertzel (2021), Reflective Metagraph Rewriting as a Foundation for an AGI "Language of Thought" β arXiv:2112.08272
- Goertzel (2021), Patterns of Cognition: Cognitive Algorithms as Galois Connections Fulfilled by Chronomorphisms on Probabilistically Typed Metagraphs β arXiv:2102.10581
- Goertzel (2023), Bridging AGI Theory and Practice with Galois Connections β AGI-23. Springer LNCS 13921. Theoretical sequel to the 2017 synergy paper, providing modern categorical formalization. [peer-reviewed]
- Goertzel (2017), Toward a Formal Model of Cognitive Synergy β arXiv:1703.04361. The foundational paper defining synergy as a mathematical relationship for overcoming computational stuckness.
MeTTa Language & Formal Semantics
- Meredith, Goertzel, Warrell, Vandervorst (2023), Meta-MeTTa: an operational semantics for MeTTa β arXiv:2305.17218. See Publication Map.
- Warrell, Potapov, Vandervorst, Goertzel (2022), A Meta-Probabilistic-Programming Language for Bisimulation of Probabilistic and Non-Well-Founded Type Systems β AGI-22. arXiv:2203.15970 [peer-reviewed]
- Potapov, Bogdanov (2022), Univalent Foundations of AGI are (not) All You Need β AGI-21. Springer LNCS 13154, pp. 184β195. [peer-reviewed]
- Goertzel (2020), What Kind of Programming Language Best Suits Integrative AGI? β AGI-20. arXiv:2004.05267
- Cody (2025), MeTTa-TMPAL: MeTTa-Based Architecture for a Self-writing Process Algebra of Learning β AGI-25. [peer-reviewed]
Knowledge Representation & AtomSpace
- Vepstas (2023), Graphs, Metagraphs, RAM, CPU β AtomSpace metagraph formalism, content addressing, sheaf theory bridge. v2.1.1, 70pp.
- Vepstas (2022), Purely Symbolic Induction of Structure β AGI-22. Springer LNCS 13539, pp. 134β144. [peer-reviewed]
- Goertzel (2025), A Selectivity Theorem and a Hierarchical Corollary β Formal foundations for MORK/ZAM efficiency. See Publication Map.
Predictive Coding & Cognitive Architecture
- ActPC-Geom: Towards Scalable Online Neural-Symbolic Learning via Accelerating Active Predictive Coding with Information Geometry β Goertzel (2025). arXiv:2501.04832
- view (PRIMUS-Based AGI) not supported for Publications+ActPC Chem β Goertzel (2024). arXiv:2412.16547
- Goertzel (2024), Metagoals Endowing Self-Modifying AGI Systems with Goal Stability or Moderated Goal Evolution β arXiv:2412.16559
- Patterns of Quantum Cognition I: From Chronomorphisms to Quantum Propagators β Goertzel (2025), AGI-25. [peer-reviewed]
- Goertzel (2026, forthcoming), Patterns of Quantum Cognition II: Quantum Logic as a Foundation for AGI β Announced follow-up to Part I. [forthcoming]
- The Emergence of Modularization from Architecture Search via Optimal Transport β Goertzel (2025), AGI-25. Self-organization into modules; foundational justification for the PRIMUS architecture. [peer-reviewed]
Reasoning (PLN, NARS, NACE)
- Geisweiller, Yusuf (2023), Probabilistic Logic Networks for Temporal and Procedural Reasoning β AGI-23. ResearchGate [peer-reviewed]
- PLN and NARS Often Yield Similar strength Γ confidence Given Highly Uncertain Term Probabilities β Goertzel (2024). arXiv:2412.19524
- Hammer, Isaev et al. (2024), Non-Axiomatic Reasoning for an Autonomous Mobile Robot β IEEE ICRA 2024, pp. 17079β17085. [peer-reviewed]
- Isaev, Hammer (2025), NARS-GPT: An Integrated Reasoning System for Natural Language Interactions β IntelliSys 2025, Springer. [peer-reviewed]
- Hammer, Isaev et al. (2023), Comparative Reasoning for Intelligent Agents β AGI-23. Springer LNCS 13921, pp. 126β135. [peer-reviewed]
- Isaev, Hammer (2023), Memory System and Memory Types for Real-Time Reasoning Systems β AGI-23. Springer LNCS 13921, pp. 147β157. [peer-reviewed]
- Johansson, Hammer, Lofthouse (2025), Arbitrarily Applicable Same/Opposite Relational Responding with NARS β AGI-25. [peer-reviewed]
- Geisweiller, Yusuf (2023), Rational OpenCog Controlled Agent β AGI-23. Springer LNCS 13921, pp. 95β104. [peer-reviewed]
Motivation & MetaMo
- MetaMo: A Robust Motivational Framework for Open-Ended AGI β Lian, Goertzel (2025). AGI-25. [peer-reviewed]
- Embodying Abstract Motivational Principles in Concrete AGI Systems: From MetaMo to Open-Ended OpenPsi β Lian, Goertzel (2025). AGI-25. [peer-reviewed]
Neural-Symbolic Integration & LLMs
- Goertzel (2023), Generative AI vs. AGI: The Cognitive Strengths and Weaknesses of Modern LLMs β arXiv:2309.10371
- Potapov, Potapova (2025), The Role of LLMs in AGI β AGI-25, Part II. [peer-reviewed]
- Goertzel et al. (2020), Embedding Vector Differences Can Be Aligned With Uncertain Intensional Logic Differences β AGI-20. arXiv:2005.12535
- Intensional Inheritance Between Concepts: An Information-Theoretic Interpretation β Goertzel (2025). arXiv:2501.17393
- Goertzel, Suarez-Madrigal, Yu (2020), Guiding Symbolic Natural Language Grammar Induction via Transformer-Based Sequence Probabilities β AGI-20. arXiv:2005.12533
Formal Verification & Mathematics
- Integrating Formal Verification into an AGI Cognitive Architecture β Z. Goertzel, B. Goertzel et al. (2025), AITP 2025 (MeTTaMath). [peer-reviewed]
- Goertzel (2020), Combinatorial Decision Dags: A Natural Computational Model for General Intelligence β AGI-20. arXiv:2004.05268
- Goertzel (2020), Paraconsistent Foundations for Probabilistic Reasoning, Programming and Concept Formation β arXiv:2012.14474
Evolutionary Learning (MOSES)
- Looks (2006), Competent Program Evolution β Doctoral dissertation, Washington University in St. Louis.
Applied AGI Roadmap
Papers and proposals positioning Hyperon capabilities in specific real-world domains.
- Finance: Goertzel (2026), Architecture of Automated Crypto-Finance Agent β Design proposal for ASI Alliance decentralized finance agent stack. [design doc]
- Robotics: Hammer, Isaev et al. (2024), Non-Axiomatic Reasoning for an Autonomous Mobile Robot β IEEE ICRA 2024, pp. 17079β17085. [peer-reviewed]
- Longevity: See Rejuve Bio for ongoing biomedical knowledge graph research applying Hyperon to longevity data pipelines.
- Mathematics: Integrating Formal Verification into an AGI Cognitive Architecture β Z. Goertzel, B. Goertzel et al. (2025), AITP 2025. [peer-reviewed]
- AI Alignment: Goertzel et al. (2025), The Elowyn: Quest of Time AI Alignment Framework β Internal whitepaper defining the alignment-via-strategic-play thesis for the EARTHwise partnership. See Elowyn. [internal doc]
OpenCog Legacy (2006β2014)
AGI Theory & Architecture
- General Theory of General Intelligence β Goertzel (2021). Now listed under Hyperon Era above.
- CogPrime Architecture β Goertzel et al. (2013)
- OpenCogPrime Cognitive Synergy β Goertzel (2009)
- OpenCog Software Framework β Hart, Goertzel (2008)
- Cognitive API and AGI Assessment β Goertzel, Yu (2014)
- From Here to AGI β Goertzel, Yu (2014)
- OpenCog NS Hybrid Neural-Symbolic β Goertzel (2010)
- Perception Processing for AGI β Goertzel (2012)
- Compositional Spatiotemporal Deep Learning β Goertzel (2011)
- Lifelong Forgetting β Goertzel (2011)
Reasoning (PLN & ECAN)
- Guiding PLN with Attention Allocation β Harrigan, Goertzel, IklΓ©, Belayneh (2014)
- Nonlinear Dynamical Attention via Information Geometry β IklΓ©, Goertzel (2011)
- Economic Attention Networks β IklΓ©, Pitt, Goertzel, Sellman (2009)
- Uncertain Interval Algebra β Sadeghi, Goertzel (2014)
- Uncertain Spatiotemporal Logic β Geisweiller, Goertzel (2010)
- Grounding Possible Worlds Semantics β IklΓ©, Goertzel (2010)
- Probabilistic Quantifier Logic β IklΓ©, Goertzel (2008)
Motivation & Emotion (OpenPsi/MetaMo)
- OpenPsi Cognitive Model β Cai, Goertzel, Geisweiller (2011)
- PSI Affective Dynamics β Cai, Goertzel et al. (2011)
- Inferential Dynamics for Virtual Animals β Goertzel, Pennachin (2008)
Natural Language Processing
- Syntax-Semantic Mapping β Lian, Goertzel (2012)
- NLP Architecture for Embodied AGI β Goertzel, Pennachin et al. (2010)
- Sentence Generation for AI β Lian, Goertzel et al. (2010)
- Pragmatic Path to Linguistic AGI β Goertzel (2008)
Pattern Mining & Perception
- FISHGRAM Pattern Mining β O'Neill, Goertzel (2012)
- Deep Learning Perception with PLN β Goertzel, Sanders, O'Neill (2013)
Embodiment & Virtual Worlds
- Humanoid Robotics Architecture β Goertzel, Hanson, Yu (2014)
- Cognitive Synergy in Animated Agents β Goertzel, Pitt et al. (2011)
- __R β Goertzel, Pitt et al. (2011)
- __R β Goertzel, de Garis et al. (2010)
- __R β Goertzel, Pennachin et al. (2008)
Evolutionary Learning (MOSES)
- Program Representation for AGI β Looks, Goertzel (2009)
Background Resources
- Solomonoff Universal Induction β Solomonoff
- AIXI Universal AI β Hutter
- Goedel Machine β Schmidhuber
- Goedel Incompleteness Theorems β GΓΆdel
- Wang (2013), Non-Axiomatic Logic: A Model of Intelligent Reasoning β World Scientific. Primary reference for the NAL/NARS framework used in metta-nars and nartech_ros.
- JAGI Journal β Open-access AGI journal
- AGI Conference Series β Annual AGI conference
Tags
Discussion
Tags
Discussion
Reference layers for researchers, editors, and AI agents working with the Hyperon Wiki. These cards provide cross-cutting indexes, repository catalogs, and source-to-card mappings that support the editorial process.
Tags
Discussion
The Hyperon ecosystem encompasses the companies, research labs, and open-source projects building products and services on top of the Hyperon framework, MeTTa language, and the broader ASI Alliance infrastructure. Unlike a traditional software ecosystem organized around a single vendor, Hyperon's ecosystem reflects its origins in the OpenCog project β a decentralized research community where multiple independent organizations contribute to a shared AGI infrastructure.
At the organizational apex sits the ASI Alliance, formed in June 2024 through the merger of SingularityNET, Fetch.ai, and Ocean Protocol (which later withdrew). The Alliance provides the governance umbrella, the unified ASI token, and the ASI Chain blockchain runtime. Beneath this, TrueAGI serves as the dedicated engineering arm developing Hyperon's core β the MeTTa language, MORK kernel, and PLN reasoning β while F1R3FLY provides the formal semantics and blockchain execution layer through Rholang and the rho calculus.
Applied ecosystem partners build domain-specific products on this shared infrastructure: Rejuve in longevity and bioinformatics, Magi in AGI tooling and education, EARTHwise in sustainability knowledge systems, SophiaVerse in gamified AI worlds, and Mind Children and Hanson Robotics in social robotics. iCog Labs provides contract R&D across multiple domains, contributing 49+ repositories. NuNet and Singularity Finance handle decentralized compute and DeFi infrastructure respectively.
Contents
Tags
Discussion
MeTTa Variants
Responsible: Greg Meredith
GitHub / Documentation: https://github.com/F1R3FLY-io/MeTTa-Compiler
Description:
MeTTaTron is the F1R3FLY-native MeTTa compiler, providing a path from MeTTa into MeTTa-IL and serving as the MeTTa implementation most closely aligned with the F1R3FLY / ASI Chain execution stack. Within the broader Hyperon ecosystem, it represents an important route by which MeTTa programs can move toward lower-level runtime environments designed for concurrency, distributed execution, and blockchain-native settlement.
Where Hyperon Experimental functions as the reference implementation and PeTTa emphasizes high-performance symbolic execution, MeTTaTron is best understood as a compiler-oriented bridge between MeTTa source programs and the F1R3FLY-side execution model. This makes it especially relevant wherever MeTTa code must interoperate with MeTTa-IL, Rholang-adjacent infrastructure, or ASI Chain-facing runtime components. MeTTaTron ensures that MeTTa programs can compile downward into concrete, scalable, decentralized execution environments.
Tags
Discussion