A decentralized, autonomous AGI system for optimal resource allocation to solve human needs
# Clone and navigate
cd project-gnosis
# Run basic allocation test
.\test-scenario1.ps1
# That's it! β¨First run: 2-5 minutes (builds Docker containers)
Subsequent runs: 30-60 seconds
GNOSTRA is a Sovereign Machine - an autonomous AGI system designed to:
- Identify bottlenecks in human needs using a 12-pillar framework
- Optimally allocate resources using constraint programming (OR-Tools)
- Learn and adapt through reinforcement learning
- Verify all decisions with counterfactual analysis
- Provide cryptographic proof for every allocation
"Maximize the NeedIndex by resolving the primary bottleneck"
The system uses a non-compensatory objective function - it cannot ignore critical failures even if other areas are thriving. A 0% "Biological Viability" pillar cannot be offset by a 500% "Play" pillar.
What: Core allocation loop with cryptographic verification
Time: 2-5 min (first), 30-60 sec (subsequent)
Command:
.\test-scenario1.ps1Validates:
- β Resource allocation optimization
- β Cryptographic signatures
- β End-to-end data flow
- β Neo4j storage
- β NATS messaging
What: Complete autonomous learning system
Time: 3-7 min (first), 1-2 min (subsequent)
Command:
.\test-scenario2-m3.ps1Validates:
- β Digital twin simulation
- β Reinforcement learning (Multi-Armed Bandit)
- β Policy adaptation
- β Counterfactual evaluation
- β Autonomous operation
βββββββββββββββββββββββββββββββββββββββββββββββββββββββββββ
β GNOSTRA AGI System β
βββββββββββββββββββββββββββββββββββββββββββββββββββββββββββ
Infrastructure:
βββ Neo4j 5.26 (Knowledge Graph)
βββ NATS 2.10 (Message Bus)
Core Services:
βββ API Host (Rust) - gRPC Server
βββ Allocator (Python) - CP-SAT Optimization
βββ Storage - Event log + Graph state
M3 Learning Loop:
βββ Simulator - Digital twin scenarios
βββ Learner - RL policy optimization
βββ Evaluator - Counterfactual analysis
Human Interface:
βββ Qt/QML HMI Client
- Docker Desktop
- PowerShell (Windows) or Bash (Linux/Mac)
- Rust 1.70+ & Cargo
- Python 3.11+
- Docker (for Neo4j & NATS)
- Qt 6.8+ (for HMI client)
- Docker Simplified Testing β START HERE
- Quick Test Guide - Alternative manual approach
- Testing Guide - Detailed scenarios
- Blueprint - Philosophy and architecture
- M3 Complete - Learning loop achievements
- Operators Manual - Production operations
- Service Architecture
- API Reference
- Data Schemas - JSON Schema definitions
# Run basic test
.\test-scenario1.ps1
# Run M3 learning loop
.\test-scenario2-m3.ps1
# Get allocator public key
.\get-allocator-public-key.ps1
# Stop all services
.\stop-all.ps1
# View logs
docker-compose logs -f allocator
docker-compose logs -f learner
# Check service status
docker-compose ps
# Clean up everything
.\stop-all.ps1 # Then select 'y' to remove volumes[PHASE 1: SETUP] - Services initialized
[PHASE 2: INGRESS] - Data validated and stored
[PHASE 3: NEEDS COMPILER] - Bottleneck identified
[PHASE 4: ALLOCATOR] - Optimal solution found
[PHASE 5: COMPLETE] - Plan ID: plan_abc123...
[METRIC] Scenario started
[MAB Update] Q-value updated (learning)
[POLICY] New policy selected
[AUDIT] Regret calculated
Lower Q-values β Better policies
Lower regret β Better decisions
- β Constraint-based optimization (CP-SAT)
- β 12-pillar needs assessment
- β Cryptographic verification (Ed25519)
- β Reinforcement learning (MAB)
- β Counterfactual evaluation
- β Autonomous adaptation
- β NATS messaging
- β Neo4j storage
- β gRPC API
- β Qt HMI client
- β³ Privacy layer (PII vaults)
- β³ Zero-knowledge proofs
- β³ DID-based identity
- β³ Dispute resolution
- β³ Meta-governance
This is an active research project. Contributions welcome!
- Make changes to code
- Rebuild affected services:
docker-compose build allocator docker-compose up -d allocator
- Test changes:
docker-compose logs -f allocator
Phase: M3 (Learning Loop) - β
Complete
Services: 9 microservices
Languages: Rust, Python
Infrastructure: Docker, Neo4j, NATS
Testing: Automated via Docker Compose
Basic Test (Scenario 1):
- Allocation time: < 5 seconds
- Plan verification: < 500ms
- Success rate: 100%
M3 Loop (Scenario 2):
- Learning convergence: 50-100 iterations
- Regret at convergence: < 0.05
- System throughput: 10+ plans/minute
- Start Testing:
.\test-scenario1.ps1 - View Logs:
docker-compose logs -f - Neo4j Browser: http://localhost:7474 (neo4j/password)
- NATS Monitor: http://localhost:8222
- Allocator API: http://localhost:8000/docs
To be determined - Research project
Built with:
- OR-Tools - Constraint optimization
- Neo4j - Graph database
- NATS - Message broker
- Rust - Systems programming
- Python - Scientific computing
- Qt - GUI framework
Ready to test the AGI? Run .\test-scenario1.ps1 π
Last Updated: 2025-11-09
by ASTRA MATRIX