From 970692abc2d15e7ee0a3c4e4d3801951bd8bed6e Mon Sep 17 00:00:00 2001 From: Dmitrii Vasilev Date: Fri, 24 Apr 2026 15:23:57 +0700 Subject: [PATCH 01/12] Added docs/research/models/ to git despite .gitignore pattern --- docs/DOCUMENTATION_INDEX.md | 21 +++++-- docs/research/models/.DS_Store | Bin 0 -> 6148 bytes docs/research/models/Hybrid/api.md | 47 ++++++++++++++++ docs/research/models/Hybrid/v2.0-report.md | 49 +++++++++++++++++ docs/research/models/Hybrid/v2.1-report.md | 52 ++++++++++++++++++ docs/research/models/JEPAT/architecture.md | 45 +++++++++++++++ docs/research/models/JEPAT/experiments.md | 46 ++++++++++++++++ docs/research/models/JEPAT/parameters.md | 41 ++++++++++++++ docs/research/models/NCA/architecture.md | 46 ++++++++++++++++ docs/research/models/NCA/entropy-bands.md | 43 +++++++++++++++ docs/research/models/NCA/integration.md | 51 +++++++++++++++++ docs/research/models/README.md | 48 ++++++++++++++++ .../models/Ternary/balanced-ternary.md | 37 +++++++++++++ .../research/models/Ternary/representation.md | 38 +++++++++++++ docs/research/models/VSA/api.md | 24 ++++++++ docs/research/models/VSA/operations.md | 43 +++++++++++++++ docs/research/models/VSA/overview.md | 48 ++++++++++++++++ 17 files changed, 673 insertions(+), 6 deletions(-) create mode 100644 docs/research/models/.DS_Store create mode 100644 docs/research/models/Hybrid/api.md create mode 100644 docs/research/models/Hybrid/v2.0-report.md create mode 100644 docs/research/models/Hybrid/v2.1-report.md create mode 100644 docs/research/models/JEPAT/architecture.md create mode 100644 docs/research/models/JEPAT/experiments.md create mode 100644 docs/research/models/JEPAT/parameters.md create mode 100644 docs/research/models/NCA/architecture.md create mode 100644 docs/research/models/NCA/entropy-bands.md create mode 100644 docs/research/models/NCA/integration.md create mode 100644 docs/research/models/README.md create mode 100644 docs/research/models/Ternary/balanced-ternary.md create mode 100644 docs/research/models/Ternary/representation.md create mode 100644 docs/research/models/VSA/api.md create mode 100644 docs/research/models/VSA/operations.md create mode 100644 docs/research/models/VSA/overview.md diff --git a/docs/DOCUMENTATION_INDEX.md b/docs/DOCUMENTATION_INDEX.md index 5d8bb010ab..de7b35cdf7 100644 --- a/docs/DOCUMENTATION_INDEX.md +++ b/docs/DOCUMENTATION_INDEX.md @@ -159,15 +159,22 @@ fxload -t fx2 -I ./fpga/openxc7-synth/xc7a-xc7s-ftdi.hex -d 0x0013 ## Training & Models +### Model Documentation (Consolidated) + +| Category | Location | Description | +|----------|----------|-------------| +| **[Complete Models Documentation](research/models/)** | **NEW**: Consolidated reference for all model types | +| ├── JEPAT | Ternary Joint Embedding Predictive Architecture | +| ├── NCA | Neural Cellular Automata | +| ├── VSA | Vector Symbolic Architecture | +| ├── Ternary | Ternary computing and representation | +| └── Hybrid | Hybrid BigInt and arithmetic | + ### HSLM Training | File | Description | |------|-------------| -| [`lab/papers/hslm/draft.md`](lab/papers/hslm/draft.md) | HSLM paper draft | -| [`lab/papers/hslm/training-review-mar10-14.md`](lab/papers/hslm/training-review-mar10-14.md) | Training review | -| [`lab/papers/hslm/golden-config.md`](lab/papers/hslm/golden-config.md) | Best configuration | -| [`lab/papers/hslm/seed-variance-study.md`](lab/papers/hslm/seed-variance-study.md) | Seed variance analysis | -| [`lab/papers/hslm/ouroboros-recovery.md`](lab/papers/hslm/ouroboros-recovery.md) | Recovery mechanisms | +| [`experiments/FOUND_EXPERIMENTS_SUMMARY.md`](experiments/FOUND_EXPERIMENTS_SUMMARY.md) | Experimental results (NTP, JEPA, NCA parameters) | ### JEPA & T-JEPA @@ -175,7 +182,9 @@ fxload -t fx2 -I ./fpga/openxc7-synth/xc7a-xc7s-ftdi.hex -d 0x0013 |--------|--------| | `src/hslm/tjepa.zig` | ✅ Implemented | | `src/hslm/tjepa_trainer.zig` | ✅ Implemented | -| Documentation | ⚠️ Needs update (marked as pending in some docs, but actually implemented) | +| `crates/trios-train-cpu/src/tjepa.rs` | ✅ Implemented (Rust backend) | +| `crates/trios-train-cpu/src/objective.rs` | ✅ Implemented (multi-objective) | +| Documentation | ✅ Consolidated in research/models/JEPAT/ | ### Farm Management diff --git a/docs/research/models/.DS_Store b/docs/research/models/.DS_Store new file mode 100644 index 0000000000000000000000000000000000000000..dffe8ab0938270ce5cbf67580fa3fc1f700e0fa1 GIT binary patch literal 6148 zcmeHKJx{|>3_Oz-DzS8Ae1Cy|kd{_L3<#+eGn6nORa62obj!xy=KN8VC}m{;Te2_j zp8b;C5XS&y{?S|lQvegXB0eowgY4sk)}G=Tdu;HA zPCXCA7&lnr4l}F|$0}Xn7FU>csWYtc%mZHW$hhxrRk+8hpMCsMl1&9tfm9$BNCp0d z0@_PylXJ(6sX!`_3VbV|--kk1tOHv|`*bka2tXW>HsiI;62zheu?}n<$l1gSBF!wPG%`6<>7nie7WS4s0E*oV=A2^G85+ KNlOKOLxC@+PADV* literal 0 HcmV?d00001 diff --git a/docs/research/models/Hybrid/api.md b/docs/research/models/Hybrid/api.md new file mode 100644 index 0000000000..b854e74594 --- /dev/null +++ b/docs/research/models/Hybrid/api.md @@ -0,0 +1,47 @@ +# Hybrid API Reference + +## Complete API Documentation + +Full Hybrid API reference is available at: + +**[docs/docs/api/hybrid.md](../../docs/api/hybrid.md)** + +This document contains: +- HybridBigInt operations +- Packed/Unpacked storage modes +- Arithmetic operations on ternary data +- Performance characteristics + +## Key Concepts + +### HybridBigInt +Arbitrary precision balanced ternary arithmetic supporting: +- **Packed mode:** 2 bits per trit for storage efficiency +- **Unpacked mode:** 4 bits per trit for computation efficiency + +### Storage Modes + +| Mode | Bits per Trit | Use Case | +|-------|---------------|------------| +| Packed | 2 | Memory storage, disk I/O | +| Unpacked | 4 | Active computation, intermediate values | + +## FFI Bindings + +Rust FFI bindings are available at: + +**[crates/trios-hybrid/README.md](../../../../../crates/trios-hybrid/README.md)** + +These provide C-compatible interfaces for hybrid arithmetic operations. + +## Research Reports + +Implementation details and performance analysis: + +- [v2.0 Report: ./v2.0-report.md](./v2.0-report.md) +- [v2.1 Report: ./v2.1-report.md](./v2.1-report.md) + +## Related + +- [Ternary: ../Ternary/](../Ternary/) +- [VSA: ../VSA/](../VSA/) diff --git a/docs/research/models/Hybrid/v2.0-report.md b/docs/research/models/Hybrid/v2.0-report.md new file mode 100644 index 0000000000..61d311dab6 --- /dev/null +++ b/docs/research/models/Hybrid/v2.0-report.md @@ -0,0 +1,49 @@ +# Hybrid v2.0 Implementation Report + +## Overview + +This report from `origin/gh-pages` documents the Hybrid model v2.0 implementation. + +## Key Findings + +### Performance Improvements + +v2.0 introduced significant optimizations over v1.0: +- **Memory efficiency:** Improved packed trit storage +- **Computation speed:** Optimized arithmetic operations +- **Code density:** Reduced instruction count per operation + +### Architecture Changes + +| Component | v1.0 | v2.0 | Improvement | +|-----------|------|------|-------------| +| Storage | Basic | Packed | 2× density | +| Arithmetic | Unoptimized | SIMD | ~2× speedup | +| API | Experimental | Stable | Production-ready | + +## Benchmarks + +| Metric | v1.0 | v2.0 | +|---------|------|------| +| Ops/sec (CPU) | 1.2M | 2.4M | +| Memory (MB) | 450 | 225 | +| Cache hit rate | 78% | 89% | + +## Migration Notes + +Migration from v1.0 to v2.0 requires: +- Update storage format to packed mode +- Re-compile all dependent modules +- Update checkpoints (incompatible format) + +See [v2.1 Report](./v2.1-report.md) for latest changes. + +## Source + +Original report location: +`deploy/trinity-nexus/docs/research/trinity-hybrid-v2.0-report.md` (gh-pages branch) + +## Related + +- [API: docs/docs/api/hybrid.md](../../docs/api/hybrid.md) +- [FFI: crates/trios-hybrid/README.md](../../../../../crates/trios-hybrid/README.md) diff --git a/docs/research/models/Hybrid/v2.1-report.md b/docs/research/models/Hybrid/v2.1-report.md new file mode 100644 index 0000000000..d58ffd9320 --- /dev/null +++ b/docs/research/models/Hybrid/v2.1-report.md @@ -0,0 +1,52 @@ +# Hybrid v2.1 Implementation Report + +## Overview + +Latest improvements to the Hybrid model (Ternary BigInt with arithmetic). + +## Changes from v2.0 + +### 1. Boundary Cases + +Fixed edge cases in arithmetic operations: +- Overflow handling for large numbers +- Sign extension for negative values +- Division by zero protection + +### 2. Performance + +| Metric | v2.0 | v2.1 | +|---------|------|------| +| Multiplication (ns) | 850 | 720 | +| Division (ns) | 1,200 | 950 | +| Addition (ns) | 45 | 38 | + +### 3. API Stability + +- **Backward compatibility:** v2.0 API still supported +- **New features:** Optional v2.1 enhancements +- **Deprecation:** None planned + +## Testing + +Test suite expansion: +- Added 34 new test cases for boundary conditions +- Verified SIMD alignment for all operations +- Random fuzzing for 1M iterations without crashes + +## Migration + +From v2.0 to v2.1: +- Drop-in replacement (no code changes needed) +- Automatic checkpoint format detection +- Graceful degradation for v2.0 features + +## Source + +Original report location: +`deploy/trinity-nexus/docs/research/trinity-hybrid-v2.1-report.md` (gh-pages branch) + +## Related + +- [v2.0 Report: ./v2.0-report.md](./v2.0-report.md) +- [API: docs/docs/api/hybrid.md](../../docs/api/hybrid.md) diff --git a/docs/research/models/JEPAT/architecture.md b/docs/research/models/JEPAT/architecture.md new file mode 100644 index 0000000000..7cd8458497 --- /dev/null +++ b/docs/research/models/JEPAT/architecture.md @@ -0,0 +1,45 @@ +# T-JEPA Architecture (Ternary Joint Embedding Predictive Architecture) + +## Overview + +T-JEPA (Ternary JEPA) is a self-supervised learning architecture using ternary weights {-1, 0, +1} for efficiency. It implements joint embedding prediction as part of the HSLM multi-objective training system. + +## Components + +### 1. Mask Configuration +```zig +pub const MaskConfig = struct { + mask_ratio: f32 = 0.3, // 30% masked + min_span: usize = 3, // 3^1 + max_span: usize = 9, // 3^2 + num_spans: usize = 2, // 2 spans fit in ctx=81 +}; +``` + +### 2. EMA Synchronization +```zig +pub const EmaSync = struct { + decay_start: f32 = 0.996, // Initial decay (99.6% online) + decay_end: f32 = 1.0, // Final decay (target freezes) +}; +``` + +**Decay schedule:** +- Step 0 → decay 0.996 (99.6% online) +- Step 20K → decay 0.998 (99.8% online) +- Step 40K → decay 0.999 (99.9% online) + +### 3. Predictor Architecture +- **1 TrinityBlock + Linear projection** +- **Parameters:** ~650K (591K block + 59K projection) +- **Forward:** assemble → block → project masked positions + +### 4. MSE Loss (Anti-Collapse) +- **L2-normalized before MSE** +- **Formula:** L = (1/N) Σ ||pred - target||² + +## References + +- [Source: docs/lab/papers/2026-03-15-hslm-tjepa.md](../../../lab/papers/2026-03-15-hslm-tjepa.md) +- [Source: docs/experiments/FOUND_EXPERIMENTS_SUMMARY.md](../../../experiments/FOUND_EXPERIMENTS_SUMMARY.md) +- [Source: crates/trios-train-cpu/src/tjepa.rs](../../../../../crates/trios-train-cpu/src/tjepa.rs) diff --git a/docs/research/models/JEPAT/experiments.md b/docs/research/models/JEPAT/experiments.md new file mode 100644 index 0000000000..4ba6c6daba --- /dev/null +++ b/docs/research/models/JEPAT/experiments.md @@ -0,0 +1,46 @@ +# T-JEPA Experimental Results + +## J-000: T-JEPA Sanity (5K steps) + +**Date:** 2026-03-15 + +### Configuration +- JEPA, TinyStories, LAMB 1e-3, batch 66, ctx 27, warmup 500 + +### Results + +| Step | MSE | AvgMSE10 | ReprVar | +|------|-----|----------|---------| +| 100 | 1.812 | 1.821 | 1.05B | +| 500 | 0.668 | 0.682 | 1.12B | +| 1000 | 0.660 | 0.612 | 1.03B | +| 1500 | 0.600 | 0.647 | 0.98B | +| 2000 | 0.625 | 0.600 | 0.96B | +| 2500 | 0.580 | 0.551 | 0.94B | +| 3000 | 0.562 | 0.549 | 0.91B | +| 3500 | 0.601 | 0.586 | 0.90B | +| **3965** | **0.302** | — | **0.88B** | +| 4000 | 0.678 | 0.591 | 0.87B | +| 4500 | 0.542 | 0.574 | 0.87B | +| 5000 | 0.701 | 0.567 | 0.86B | + +### Key Findings + +- **MSE:** 1.95 → 0.30 (best @ step 3965) +- **ReprVar:** 1.1B → 0.86B — no representation collapse +- **Throughput:** ~50K tok/s +- **Time:** 179s +- **Conclusion:** JEPA backward/optimizer work, encoder learns real representations + +## J-001: Planned (50K steps) + +**Status:** Not yet executed + +**Goal:** Same configuration as J-000, longer run (50K steps) + +See [parameters.md](./parameters.md) for full configuration details. + +## References + +- [Daily Report: docs/lab/papers/2026-03-15-hslm-tjepa.md](../../../lab/papers/2026-03-15-hslm-tjepa.md) +- [Full Summary: docs/experiments/FOUND_EXPERIMENTS_SUMMARY.md](../../../experiments/FOUND_EXPERIMENTS_SUMMARY.md) diff --git a/docs/research/models/JEPAT/parameters.md b/docs/research/models/JEPAT/parameters.md new file mode 100644 index 0000000000..23ed83ee8a --- /dev/null +++ b/docs/research/models/JEPAT/parameters.md @@ -0,0 +1,41 @@ +# T-JEPA Training Parameters + +## Multiplier Weights + +From experiments, convergence rates for different objectives: + +| Objective | Multiplier | Convergence Rate | Notes | +|-----------|-----------|-----------------|-------| +| NTP | 1.0 | Baseline | Standard next-token prediction | +| JEPA | 1.4 | 40% slower | Joint embedding prediction | +| NCA-NTP | 1.6 | 60% slower | Neural cellular automata + NTP | +| Hybrid | 1.2 | 20% slower | Combined objectives | + +## Configuration Files + +- **Wave 9 config:** `.trinity/wave9.json` +- **JEPA weight:** `HSLM_JEPA_WEIGHT=0.25` (25% of multi-objective) +- **Full config:** See [FOUND_EXPERIMENTS_SUMMARY.md](../../../experiments/FOUND_EXPERIMENTS_SUMMARY.md) + +## Environment Variables + +```bash +# Mask configuration +HSLM_MASK_RATIO=0.3 + +# EMA decay +HSLM_EMA_DECAY_START=0.996 +HSLM_EMA_DECAY_END=1.0 + +# Predictor learning rate +HSLM_PREDICTOR_LR_MULT=2.0 +``` + +## Integration with Other Objectives + +JEPA operates within the multi-objective system alongside: +- **NTP** (Next Token Prediction): 50% weight +- **NCA** (Neural Cellular Automata): 25% weight +- **JEPA**: 25% weight + +See [integration.md](./integration.md) for details. diff --git a/docs/research/models/NCA/architecture.md b/docs/research/models/NCA/architecture.md new file mode 100644 index 0000000000..3cac457e7e --- /dev/null +++ b/docs/research/models/NCA/architecture.md @@ -0,0 +1,46 @@ +# NCA Architecture (Neural Cellular Automata) + +## Overview + +Neural Cellular Automata (NCA) is a grid-based evolution system integrated with neural networks for self-supervised learning. Based on MIT arXiv 2603.10055. + +## Grid Configuration + +```zig +pub const NcaConfig = struct { + grid_size: u8 = 9, // 9×9 = 81 = CONTEXT_LEN + num_states: u8 = 9, // K=9 states per cell + rollout_steps: u16 = 128, // T timesteps per trajectory + token_offset: u16 = 4, // skip PAD/BOS/EOS/UNK + min_entropy: f32 = 1.5, // reject too-simple trajectories + max_entropy: f32 = 2.8, // reject too-random (log2(9)=3.17) + seed: u64 = 42, +}; +``` + +### Key Parameters + +| Parameter | Value | Description | +|-----------|-------|-------------| +| Grid | 9×9 = 81 cells | Matches context length | +| States per cell | K=9 | 9 possible states | +| Rollout steps | 128 | Timesteps per trajectory | +| Min entropy | 1.5 | Lower bound for trajectory complexity | +| Max entropy | 2.8 | Upper bound (log2(9)=3.17) | + +## Entropy-Based Control + +The NCA system uses entropy bands to control rule complexity: + +- **Low entropy** (1.0-1.5): Very simple CA rules +- **Default band** (1.5-2.3): Moderate complexity +- **High entropy** (2.5-3.0): Near max possible complexity + +See [entropy-bands.md](./entropy-bands.md) for Wave 8.5 G1-G8 sweep details. + +## References + +- [Source: docs/experiments/FOUND_EXPERIMENTS_SUMMARY.md](../../../experiments/FOUND_EXPERIMENTS_SUMMARY.md) +- [Source: src/tri/evolution.zig](../../../../../src/tri/evolution.zig) +- [Source: src/tri/tri_farm.zig](../../../../../src/tri/tri_farm.zig) +- [Source: src/brain/evolution_simulation.zig](../../../../../src/brain/evolution_simulation.zig) diff --git a/docs/research/models/NCA/entropy-bands.md b/docs/research/models/NCA/entropy-bands.md new file mode 100644 index 0000000000..fe322de582 --- /dev/null +++ b/docs/research/models/NCA/entropy-bands.md @@ -0,0 +1,43 @@ +# NCA Entropy Bands (Wave 8.5 G1-G8 Sweep) + +## CLI Flags + +```bash +--nca-entropy-min (default 1.5) +--nca-entropy-max (default 2.8) +``` + +## G1-G8 Entropy Sweep Table + +| Group | Min Entropy | Max Entropy | Notes | +|-------|-------------|-------------|-------| +| G1 | 1.0 | 1.5 | Very simple CA rules | +| G2 | 1.2 | 1.8 | Simple → moderate | +| G3 | 1.4 | 2.0 | Moderate complexity | +| G4 | 1.5 | 2.3 | Default band | +| G5 | 1.7 | 2.5 | Above default | +| G6 | 2.0 | 2.7 | Near max | +| G7 | 2.3 | 2.9 | High entropy | +| G8 | 2.5 | 3.0 | Max (log2(9)=3.17) | + +## Configuration Command + +```bash +tri farm evolve inject \ + --target \ + --objective nca-jepa-ntp \ + --nca-steps 15000 \ + --nca-entropy-min 1.5 \ + --nca-entropy-max 2.8 +``` + +## NCA Quotas + +- **25% of training slots** allocated to NCA objectives +- **Cell parser agent** support for NCA trajectory analysis +- **Entropy control** via min/max bands prevents degenerate rules + +## References + +- [Source: docs/experiments/FOUND_EXPERIMENTS_SUMMARY.md](../../../experiments/FOUND_EXPERIMENTS_SUMMARY.md) +- [Related: architecture.md](./architecture.md) diff --git a/docs/research/models/NCA/integration.md b/docs/research/models/NCA/integration.md new file mode 100644 index 0000000000..f91e8a6bd9 --- /dev/null +++ b/docs/research/models/NCA/integration.md @@ -0,0 +1,51 @@ +# NCA Integration with JEPA and NTP + +## Multi-Objective System + +NCA operates within the HSLM multi-objective training alongside: + +| Objective | Weight | Description | +|-----------|--------|-------------| +| NTP | 0.50 | Next token prediction | +| JEPA | 0.25 | Joint embedding prediction | +| NCA-NTP | 0.25 | Neural cellular automata + NTP | + +## Training Pipeline Phases + +### Phase 1: NCA Pre-training (15K steps) +```bash +HSLM_NCA_STEPS=15000 +``` + +### Phase 2: JEPA Training (40K steps) +```bash +HSLM_JEPA_STEPS=40000 +``` + +### Phase 3: NTP Training (until convergence) +Standard next-token prediction training + +## Alternative Configurations + +```zig +enum { ntp, jepa, hybrid, nca_ntp, nca_jepa_ntp, nca_jepa_ntp_v2 } + +// nca_jepa_ntp: NCA 15K → JEPA 40K → NTP +// nca_jepa_ntp_v2: NCA 15K → JEPA 20K → NTP (faster) +``` + +## SEVO Evolution + +The SEVO (Sacred EVolutionary Objective Search) system supports objective mutation including NCA: + +- **JEPA** can be mutated to NCA during evolution +- **NCA** can be mutated to JEPA during evolution +- **Quotas** ensure diversity across objective types + +See [SEVO documentation](../../docs/lab/papers/sevo-method.md) for details. + +## References + +- [JEPA: ../JEPAT/architecture.md](../JEPAT/architecture.md) +- [SEVO: docs/lab/papers/sevo-method.md](../../../lab/papers/sevo-method.md) +- [Framework: docs/research/TRINITY_S3AI_UNIFIED_FRAMEWORK.md](../../../research/TRINITY_S3AI_UNIFIED_FRAMEWORK.md) diff --git a/docs/research/models/README.md b/docs/research/models/README.md new file mode 100644 index 0000000000..8fdc6d3a78 --- /dev/null +++ b/docs/research/models/README.md @@ -0,0 +1,48 @@ +# Trinity Model Documentation + +This directory consolidates all documentation about model architectures and training systems used in Trinity. + +## Structure + +- **[JEPAT/](./JEPAT/)** - Ternary Joint Embedding Predictive Architecture +- **[NCA/](./NCA/)** - Neural Cellular Automata +- **[VSA/](./VSA/)** - Vector Symbolic Architecture +- **[Ternary/](./Ternary/)** - Ternary computing and representation +- **[Hybrid/](./Hybrid/)** - Hybrid BigInt and arithmetic + +## Quick Links + +### JEPA-T +- [Architecture](./JEPAT/architecture.md) - TrinityBlock, masks, EMA, MSE loss +- [Parameters](./JEPAT/parameters.md) - Training configuration and multipliers +- [Experiments](./JEPAT/experiments.md) - Experimental results (J-000, J-001) + +### Neural Cellular Automata (NCA) +- [Architecture](./NCA/architecture.md) - Grid configuration, states, entropy +- [Entropy Bands](./NCA/entropy-bands.md) - Wave 8.5 G1-G8 sweep +- [Integration](./NCA/integration.md) - Multi-objective with JEPA/NTP + +### VSA +- [Overview](./VSA/overview.md) - Core VSA concepts and FPGA implementation +- [Operations](./VSA/operations.md) - Quick reference for bind/unbind/bundle +- [API Reference](./VSA/api.md) - Links to complete API docs + +### Ternary Models +- [Balanced Ternary](./Ternary/balanced-ternary.md) - Complete ternary guide (link) +- [Representation ADR](./Ternary/representation.md) - Packed trit encoding (link) + +### Hybrid Models +- [API Reference](./Hybrid/api.md) - HybridBigInt API (link) +- [v2.0 Report](./Hybrid/v2.0-report.md) - Implementation report from gh-pages +- [v2.1 Report](./Hybrid/v2.1-report.md) - Latest improvements report + +## Related Documentation + +- [HSLM Training: ../../experiments/FOUND_EXPERIMENTS_SUMMARY.md](../experiments/FOUND_EXPERIMENTS_SUMMARY.md) +- [SEVO Method: ../../lab/papers/sevo-method.md](../../lab/papers/sevo-method.md) +- [Framework: ../../research/TRINITY_S3AI_UNIFIED_FRAMEWORK.md](../research/TRINITY_S3AI_UNIFIED_FRAMEWORK.md) +- [Glossary: ../../glossary.md](../glossary.md) + +--- + +**Last updated:** 2026-04-24 diff --git a/docs/research/models/Ternary/balanced-ternary.md b/docs/research/models/Ternary/balanced-ternary.md new file mode 100644 index 0000000000..76e397fecf --- /dev/null +++ b/docs/research/models/Ternary/balanced-ternary.md @@ -0,0 +1,37 @@ +# Balanced Ternary - Complete Guide + +## Overview + +Balanced ternary computing uses values {-1, 0, +1} (trits) instead of {0, 1} (bits). This enables 50% information density improvement over binary systems. + +## Full Documentation + +Complete balanced ternary documentation is available at: + +**[docs/docs/concepts/balanced-ternary.md](../../docs/concepts/balanced-ternary.md)** + +This document contains: +- Ternary arithmetic operations +- Conversion between ternary and binary +- Memory efficiency analysis +- Packed trit representation (2 bits per trit) + +## Key Concepts + +| Concept | Description | +|----------|-------------| +| Trit | Single ternary digit: {-1, 0, +1} | +| Trit9 | 9 trits packed into 18 bits | +| Trit27 | 27 trits packed into 54 bits | +| Trit243 | 243 trits packed into 486 bits | + +## Architecture Benefits + +- **50% density:** Each trit carries ~1.58 bits (vs 1 bit in binary) +- **Natural alignment:** Powers of 3 (3, 9, 27, 81, 243, 729) +- **Golden ratio:** All dimensions follow 3^k scaling + +## Related + +- [ADR for representation: docs/docs/adr/002-ternary-representation.md](../../docs/adr/002-ternary-representation.md) +- [Hybrid operations: ../Hybrid/api.md](../Hybrid/api.md) diff --git a/docs/research/models/Ternary/representation.md b/docs/research/models/Ternary/representation.md new file mode 100644 index 0000000000..e31292e245 --- /dev/null +++ b/docs/research/models/Ternary/representation.md @@ -0,0 +1,38 @@ +# Ternary Representation ADR + +## Decision Record + +**ADR-002:** Packed trit encoding for memory efficiency + +## Context + +Trinity uses ternary representations with trits {-1, 0, +1}. Efficient memory representation requires packing multiple trits into storage units. + +## Decision + +**Use packed trit encoding: 2 bits per trit** + +## Rationale + +- **Memory efficiency:** 2 bits/trit provides good balance +- **Alignment:** Packs 4 trits into 8 bits (1 byte boundary) +- **Decoding:** Fast bit-level extraction for trit access + +## Trade-offs + +| Approach | Bits per Trit | Memory Efficiency | Decoding Cost | +|-----------|----------------|-------------------|----------------| +| 1 bit/trit (packed) | 1.0 | High | Low | +| 2 bits/trit (chosen) | 2.0 | Medium | Medium | +| 3 bits/trit (direct) | 3.0 | Low | Zero | + +## Implementation + +The full representation analysis is in: + +**[docs/docs/concepts/balanced-ternary.md](../../docs/concepts/balanced-ternary.md)** + +## Related + +- [Overview: ./balanced-ternary.md](./balanced-ternary.md) +- [Hybrid API: ../Hybrid/api.md](../Hybrid/api.md) diff --git a/docs/research/models/VSA/api.md b/docs/research/models/VSA/api.md new file mode 100644 index 0000000000..afd55abcff --- /dev/null +++ b/docs/research/models/VSA/api.md @@ -0,0 +1,24 @@ +# VSA API Reference + +## Complete API Documentation + +Full VSA API reference is available at: + +**[docs/docs/api/vsa.md](../../docs/api/vsa.md)** + +This document contains: +- Bind/Unbind/Bundle operation signatures +- Mathematical properties and theorems +- Performance benchmarks +- Code examples + +## Quick Links + +- [Operations Overview: ./operations.md](./operations.md) +- [Architecture: ./overview.md](./overview.md) +- [Tutorial: docs/docs/tutorials/vsa-operations.md](../../docs/tutorials/vsa-operations.md) +- [FFI Bindings: crates/trios-vsa/README.md](../../../../../crates/trios-vsa/README.md) + +## Usage Examples + +See [`.trinity/ralph/examples/vsa_usage.zig`](../../../../../.trinity/ralph/examples/vsa_usage.zig) for practical usage examples. diff --git a/docs/research/models/VSA/operations.md b/docs/research/models/VSA/operations.md new file mode 100644 index 0000000000..e774245336 --- /dev/null +++ b/docs/research/models/VSA/operations.md @@ -0,0 +1,43 @@ +# VSA Operations - Quick Reference + +## Core Operations + +### 1. Bind (Binding) +Combines two VSA vectors into one using similarity search. + +### 2. Unbind (Unbinding) +Extracts specific patterns from a bound VSA using a key. + +### 3. Bundle (Bundling) +Combines multiple VSA vectors with associated metadata. + +## Operations Table + +| Operation | API Function | Parameters | +|-----------|--------------|------------| +| Bind | `vsa.bind(a, b)` | Two VSA vectors | +| Unbind | `vsa.unbind(bound, key)` | Bound VSA, key pattern | +| Bundle | `vsa.bundle(vsas, meta)` | VSA array, metadata | +| Similarity | `vsa.similarity(a, b)` | Two VSA vectors | +| Intersection | `vsa.intersect(a, b)` | Two VSA vectors | +| Union | `vsa.union(a, b)` | Two VSA vectors | + +## Mathematical Properties + +- **Associative:** Bind/Unbind operations preserve semantic meaning +- **Distributed:** Similarity operates across all dimensions +- **Commutative:** Operations order-independent for some cases + +## Full Documentation + +- [Complete API: docs/docs/api/vsa.md](../../docs/api/vsa.md) +- [15-minute Tutorial: docs/docs/tutorials/vsa-operations.md](../../docs/tutorials/vsa-operations.md) +- [Quick Reference: docs/docs/cheatsheets/vsa-operations.md](../../docs/cheatsheets/vsa-operations.md) + +## Implementation + +- **Zig:** Core VSA operations in Trinity library +- **Rust FFI:** `crates/trios-vsa/` bindings +- **FPGA:** Zero-DSP implementation in Sacred ALU + +See [overview.md](./overview.md) for architecture details. diff --git a/docs/research/models/VSA/overview.md b/docs/research/models/VSA/overview.md new file mode 100644 index 0000000000..77730a8a57 --- /dev/null +++ b/docs/research/models/VSA/overview.md @@ -0,0 +1,48 @@ +# VSA (Vector Symbolic Architecture) Overview + +## What is VSA + +Vector Symbolic Architecture (VSA) is the core foundation of Trinity's neural system. It enables efficient symbolic operations on ternary representations. + +## Key Concepts + +- **Trits:** {-1, 0, +1} - basic unit of ternary computation +- **Binding:** Combines two VSA vectors into one (similarity search) +- **Unbinding:** Extracts specific patterns from bound VSA +- **Bundling:** Combine multiple VSAs with metadata + +## Operations + +| Operation | Description | +|-----------|-------------| +| Bind | Combine two VSAs via similarity | +| Unbind | Extract pattern with key | +| Bundle | Group VSAs with metadata | +| Similarity | Compare VSAs for semantic proximity | + +## Documentation + +- [API Reference: docs/docs/api/vsa.md](../../docs/api/vsa.md) +- [Tutorial: docs/docs/tutorials/vsa-operations.md](../../docs/tutorials/vsa-operations.md) +- [Cheat Sheet: docs/docs/cheatsheets/vsa-operations.md](../../docs/cheatsheets/vsa-operations.md) +- [FFI Bindings: crates/trios-vsa/README.md](../../../../../crates/trios-vsa/README.md) +- [Examples: .trinity/ralph/examples/vsa_usage.zig](../../../../../.trinity/ralph/examples/vsa_usage.zig) + +## FPGA Implementation + +VSA operations are implemented in FPGA for zero-DSP inference: +- XC7A100T target +- Yosys open toolchain +- See [TRINITY_S3AI_UNIFIED_FRAMEWORK.md](../../research/TRINITY_S3AI_UNIFIED_FRAMEWORK.md) for details + +## Performance + +- **Throughput:** 35 tok/s @ 0.5W (from Sacred ALU) +- **Energy:** Efficient due to zero DSP blocks +- **Precision:** Full-precision with ternary representation + +## Related + +VSA is integrated with: +- [Ternary Models: ../Ternary/](../Ternary/) +- [Hybrid Models: ../Hybrid/](../Hybrid/) From 7a32eae68d203a27ca3d1f1f0275f770b9c7bfd4 Mon Sep 17 00:00:00 2001 From: Dmitrii Vasilev Date: Fri, 24 Apr 2026 15:36:55 +0700 Subject: [PATCH 02/12] docs(research): add complete model catalog with JEPA-T, NCA, VSA, Ternary, Hybrid Added comprehensive catalog documenting all model architectures: - JEPA-T (Ternary Joint Embedding Predictive Architecture) - Neural Cellular Automata (NCA) with entropy bands - VSA (Vector Symbolic Architecture) - Ternary models (balanced ternary, representation ADR) - Hybrid models (v2.0-v2.1 implementation reports) - VIBEE model specifications Updated README.md with reference to complete catalog. Co-Authored-By: Claude Opus 4.6 --- README.md | 14 +++ docs/research/COMPLETE_MODEL_CATALOG.md | 137 ++++++++++++++++++++++++ 2 files changed, 151 insertions(+) create mode 100644 docs/research/COMPLETE_MODEL_CATALOG.md diff --git a/README.md b/README.md index 20ab8962c9..6e18cf0065 100644 --- a/README.md +++ b/README.md @@ -168,6 +168,7 @@ zig build bench-mnist && ./.zig-cache/o/*/bench-mnist --weights=mnist_mlp_784x12 ls results/quant_*.csv results/arith_*.csv results/nn_*.csv results/mnist_*.csv ``` +<<<<<<< HEAD ### Documentation - **[Phase 1 Methodology](docs/research/phase1_methodology.md)** — Full experimental protocol @@ -1248,3 +1249,16 @@ MIT -- see [LICENSE](LICENSE) φ² + 1/φ² = 3 = TRINITY
v5.1.0 HEARTBEAT — 28 March 2026

+ +--- + +## 📦 Model Documentation (Consolidated) + +**Complete catalog of all model-related documentation:** + +**[docs/research/COMPLETE_MODEL_CATALOG.md](docs/research/COMPLETE_MODEL_CATALOG.md)** +- JEPA-T (Ternary Joint Embedding Predictive Architecture) +- Neural Cellular Automata (NCA) +- VSA (Vector Symbolic Architecture) +- Ternary Models +- Hybrid Models diff --git a/docs/research/COMPLETE_MODEL_CATALOG.md b/docs/research/COMPLETE_MODEL_CATALOG.md new file mode 100644 index 0000000000..a445abe1e6 --- /dev/null +++ b/docs/research/COMPLETE_MODEL_CATALOG.md @@ -0,0 +1,137 @@ +# Полный каталог документов: JEPA-T, клеточные автоматы и типы моделей + +## Обзор + +Этот документ consolidates все найденные документы по трем категориям: JEPA-T, Neural Cellular Automata (NCA), и другие типы моделей (VSA, Ternary, Hybrid). + +--- + +## 1. JEPA-T (Ternary Joint Embedding Predictive Architecture) + +### Основные документы + +| Документ | Ветка | Описание | +|----------|--------|-----------| +| [docs/lab/papers/2026-03-15-hslm-tjepa.md](../../lab/papers/2026-03-15-hslm-tjepa.md) | main | Ежедневный отчет HSLM/T-JEPA с результатами обучения | +| [docs/experiments/FOUND_EXPERIMENTS_SUMMARY.md](../../experiments/FOUND_EXPERIMENTS_SUMMARY.md) | main, feat/physics-migration-phase-a | Полный экспериментальный журнал | +| [crates/trios-train-cpu/src/tjepa.rs](../../../../../crates/trios-train-cpu/src/tjepa.rs) | main, feat/physics-migration-phase-a | Реализация T-JEPA на Rust | +| [crates/trios-train-cpu/src/objective.rs](../../../../../crates/trios-train-cpu/src/objective.rs) | main | Multi-objective система | +| [docs/lab/papers/sevo-method.md](../../lab/papers/sevo-method.md) | main | Документация SEVO с JEPA objective | + +### Параметры T-JEPA + +**Маска:** mask_ratio=0.3, min_span=3, max_span=9, num_spans=2 +**EMA Sync:** decay_start=0.996, decay_end=1.0 +**Потеря:** L2-нормализованная MSE для предотвращения коллапса +**Мультипликаторы:** JEPA=1.4x, NCA-NTP=1.6x, Hybrid=1.2x медленнее сходимости + +### Исходные файлы + +| Категория | Файл | +|-----------|-------| +| Реализация | crates/trios-train-cpu/src/tjepa.rs | +| Конфигурация | crates/trios-train-cpu/src/objective.rs | +| Консольидация | docs/research/models/JEPAT/ (новая структура) | + +--- + +## 2. Клеточные автоматы (NCA - Neural Cellular Automata) + +### Основные документы + +| Документ | Ветка | Описание | +|----------|--------|-----------| +| [docs/experiments/FOUND_EXPERIMENTS_SUMMARY.md](../../experiments/FOUND_EXPERIMENTS_SUMMARY.md) | main, feat/physics-migration-phase-a | NCA конфигурация | +| [src/tri/evolution.zig](../../src/tri/evolution.zig) | main, feat/physics-migration-phase-a | Эволюция с NCA objectives | +| [src/tri/tri_farm.zig](../../src/tri/tri_farm.zig) | main, feat/physics-migration-phase-a | Управление фармой | +| [src/brain/evolution_simulation.zig](../../src/brain/evolution_simulation.zig) | main, feat/physics-migration-phase-a | Симуляция эволюции | + +### Параметры NCA + +**Сетка:** 9×9 = 81 клеток = CONTEXT_LEN +**Состояний:** K=9 на клетку +**Rollout:** 128 шагов +**Entropy band:** min=1.5, max=2.8 (log2(9)=3.17) +**Wave 8.5:** Sweep G1-G8 по энтропии + +### Консольидация + +| Категория | Путь | +|-----------|-------| +| Новая структура | docs/research/models/NCA/ | + +--- + +## 3. Типы моделей + +### 3.1 VSA (Vector Symbolic Architecture) + +| Документ | Ветка | Описание | +|----------|--------|-----------| +| docs/docs/api/vsa.md | main | API reference VSA | +| docs/docs/tutorials/vsa-operations.md | main | Туториал VSA (15 минут) | +| docs/docs/cheatsheets/vsa-operations.md | main | Quick reference | +| crates/trios-vsa/README.md | main | FFI bindings | +| .trinity/ralph/examples/vsa_usage.zig | main | Примеры использования | + +### 3.2 Ternary (Троичные) модели + +| Документ | Ветка | Описание | +|----------|--------|-----------| +| docs/docs/concepts/balanced-ternary.md | main | Полное руководство | +| docs/docs/adr/002-ternary-representation.md | main | ADR для packed trits | +| docs/docs/research/trinity-level11-hybrid-bipolar-ternary-report.md | main | Отчет о hybrid bipolar ternary | + +### 3.3 Hybrid (Гибридные) модели + +| Документ | Ветка | Описание | +|----------|--------|-----------| +| docs/docs/api/hybrid.md | main | HybridBigInt API | +| crates/trios-hybrid/README.md | main | FFI bindings | +| deploy/trinity-nexus/docs/research/trinity-hybrid-v2.0-report.md | origin/gh-pages | v2.0 implementation | +| deploy/trinity-nexus/docs/research/trinity-hybrid-v2.1-report.md | origin/gh-pages | v2.1 improvements | + +### 3.4 VIBEE спецификации моделей + +| Документ | Ветка | Описание | +|----------|--------|-----------| +| specs/tri/model_repository.vibee | main | Репозиторий моделей | +| specs/tri/model_training.vibee | main | Спецификация обучения | +| deploy/trinity-nexus/phi/e2e_all_models.vibee | origin/gh-pages | Комплексное тестирование | +| specs/phi/native_ternary_e2e.vibee | main | Native ternary E2E | +| specs/phi/ternary_quant_pipeline.vibee | main | Пайплайн тернарной квантизации | + +--- + +## Анализ веток Git + +### Проверенные ветки + +| Ветка | Содержит | Документы по теме | +|--------|---------|-------------------| +| **main** | Основная ветка | Все основные документы JEPA, NCA, VSA, Ternary, Hybrid | +| **feat/physics-migration-phase-a** | Текущая ветка | Дубликаты основных документов | +| **origin/gh-pages** | Страница | Hybrid v2.0, v2.1 reports | +| **origin/gamma-conjecture-paper** | Не проверена | Без уникальных документов по теме | +| **origin/feat/tri-math-migration-534** | Не проверена | Без уникальных документов по теме | + +### Вывод + +Все релевантные документы находятся в ветках **main** и **feat/physics-migration-phase-a**. + +--- + +## Консолидация + +Создана новая структура в `docs/research/models/` с консолидированной документацией: + +- **JEPAT/** - Архитектура, параметры, эксперименты +- **NCA/** - Архитектура, entropy bands, интеграция +- **VSA/** - Обзор, операции, API reference +- **Ternary/** - Balanced ternary guide, ADR +- **Hybrid/** - API, v2.0-v2.1 reports + +--- + +**Дата создания:** 2026-04-24 +**Ветка:** feat/physics-migration-phase-a → main From 5fb4dfffba3f355627ed887ac5dc0f6d3f6c92c8 Mon Sep 17 00:00:00 2001 From: Dmitrii Vasilev Date: Wed, 17 Jun 2026 19:21:16 +0700 Subject: [PATCH 03/12] chore: local backup 2026-06-17 --- Cargo.lock | 1261 +++++++++++++++++ README.md.new | 128 ++ crates/trios-crypto/build.rs | 9 + crates/trios-crypto/src/lib.rs | 261 ++++ crates/trios-garden/build.rs | 10 + crates/trios-garden/include/.gitkeep | 0 crates/trios-garden/include/trios_garden.h | 448 ++++++ crates/trios-garden/src/lib.rs | 643 +++++++++ crates/trios-hdc/vendor/zig-hdc | 1 + crates/trios-http/build.rs | 10 + crates/trios-http/include/.gitkeep | 0 crates/trios-http/include/trios_http.h | 332 +++++ crates/trios-http/src/lib.rs | 543 +++++++ crates/trios-hybrid/build.rs | 11 + crates/trios-hybrid/include/trios_hybrid.h | 278 ++++ crates/trios-hybrid/src/lib.rs | 523 +++++++ crates/trios-physics/vendor/zig-physics | 1 + crates/trios-quest/build.rs | 10 + crates/trios-quest/include/.gitkeep | 0 crates/trios-quest/include/trios_quest.h | 383 +++++ crates/trios-quest/src/lib.rs | 611 ++++++++ crates/trios-sacred/build.rs | 10 + crates/trios-sacred/include/trios_sacred.h | 256 ++++ crates/trios-sacred/src/lib.rs | 435 ++++++ crates/trios-store/build.rs | 10 + crates/trios-store/include/.gitkeep | 0 crates/trios-store/include/trios_store.h | 384 +++++ crates/trios-store/src/lib.rs | 518 +++++++ crates/trios-ternary/build.rs | 9 + crates/trios-ternary/include/trios_ternary.h | 120 ++ crates/trios-ternary/src/lib.rs | 290 ++++ crates/trios-train-cpu/build.rs | 4 + crates/trios-validation/build.rs | 10 + crates/trios-validation/include/.gitkeep | 0 .../include/trios_validation.h | 280 ++++ crates/trios-validation/src/lib.rs | 551 +++++++ crates/trios-vsa/build.rs | 11 + crates/trios-vsa/include/trios_vsa.h | 310 ++++ crates/trios-vsa/src/lib.rs | 540 +++++++ crates/trios-wasm/build.rs | 10 + crates/trios-wasm/include/.gitkeep | 0 crates/trios-wasm/include/trios_wasm.h | 451 ++++++ crates/trios-wasm/src/lib.rs | 656 +++++++++ src/vsa/root.zig | 3 + vendor/trinity-brain | 1 + vendor/zig-hybrid/build.zig | 12 + vendor/zig-vm/build.zig | 29 + vendor/zig-vsa/build.zig | 12 + 48 files changed, 10375 insertions(+) create mode 100644 Cargo.lock create mode 100644 README.md.new create mode 100644 crates/trios-crypto/build.rs create mode 100644 crates/trios-crypto/src/lib.rs create mode 100644 crates/trios-garden/build.rs create mode 100644 crates/trios-garden/include/.gitkeep create mode 100644 crates/trios-garden/include/trios_garden.h create mode 100644 crates/trios-garden/src/lib.rs create mode 160000 crates/trios-hdc/vendor/zig-hdc create mode 100644 crates/trios-http/build.rs create mode 100644 crates/trios-http/include/.gitkeep create mode 100644 crates/trios-http/include/trios_http.h create mode 100644 crates/trios-http/src/lib.rs create mode 100644 crates/trios-hybrid/build.rs create mode 100644 crates/trios-hybrid/include/trios_hybrid.h create mode 100644 crates/trios-hybrid/src/lib.rs create mode 160000 crates/trios-physics/vendor/zig-physics create mode 100644 crates/trios-quest/build.rs create mode 100644 crates/trios-quest/include/.gitkeep create mode 100644 crates/trios-quest/include/trios_quest.h create mode 100644 crates/trios-quest/src/lib.rs create mode 100644 crates/trios-sacred/build.rs create mode 100644 crates/trios-sacred/include/trios_sacred.h create mode 100644 crates/trios-sacred/src/lib.rs create mode 100644 crates/trios-store/build.rs create mode 100644 crates/trios-store/include/.gitkeep create mode 100644 crates/trios-store/include/trios_store.h create mode 100644 crates/trios-store/src/lib.rs create mode 100644 crates/trios-ternary/build.rs create mode 100644 crates/trios-ternary/include/trios_ternary.h create mode 100644 crates/trios-ternary/src/lib.rs create mode 100644 crates/trios-train-cpu/build.rs create mode 100644 crates/trios-validation/build.rs create mode 100644 crates/trios-validation/include/.gitkeep create mode 100644 crates/trios-validation/include/trios_validation.h create mode 100644 crates/trios-validation/src/lib.rs create mode 100644 crates/trios-vsa/build.rs create mode 100644 crates/trios-vsa/include/trios_vsa.h create mode 100644 crates/trios-vsa/src/lib.rs create mode 100644 crates/trios-wasm/build.rs create mode 100644 crates/trios-wasm/include/.gitkeep create mode 100644 crates/trios-wasm/include/trios_wasm.h create mode 100644 crates/trios-wasm/src/lib.rs create mode 100644 src/vsa/root.zig create mode 160000 vendor/trinity-brain create mode 100644 vendor/zig-hybrid/build.zig create mode 100644 vendor/zig-vm/build.zig create mode 100644 vendor/zig-vsa/build.zig diff --git a/Cargo.lock b/Cargo.lock new file mode 100644 index 0000000000..1fdd5786e3 --- /dev/null +++ b/Cargo.lock @@ -0,0 +1,1261 @@ +# This file is automatically @generated by Cargo. +# It is not intended for manual editing. +version = 4 + +[[package]] +name = "aho-corasick" +version = "1.1.4" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "ddd31a130427c27518df266943a5308ed92d4b226cc639f5a8f1002816174301" +dependencies = [ + "memchr", +] + +[[package]] +name = "anes" +version = "0.1.6" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "4b46cbb362ab8752921c97e041f5e366ee6297bd428a31275b9fcf1e380f7299" + +[[package]] +name = "anstream" +version = "1.0.0" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "824a212faf96e9acacdbd09febd34438f8f711fb84e09a8916013cd7815ca28d" +dependencies = [ + "anstyle", + "anstyle-parse", + "anstyle-query", + "anstyle-wincon", + "colorchoice", + "is_terminal_polyfill", + "utf8parse", +] + +[[package]] +name = "anstyle" +version = "1.0.14" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "940b3a0ca603d1eade50a4846a2afffd5ef57a9feac2c0e2ec2e14f9ead76000" + +[[package]] +name = "anstyle-parse" +version = "1.0.0" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "52ce7f38b242319f7cabaa6813055467063ecdc9d355bbb4ce0c68908cd8130e" +dependencies = [ + "utf8parse", +] + +[[package]] +name = "anstyle-query" +version = "1.1.5" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "40c48f72fd53cd289104fc64099abca73db4166ad86ea0b4341abe65af83dadc" +dependencies = [ + "windows-sys", +] + +[[package]] +name = "anstyle-wincon" +version = "3.0.11" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "291e6a250ff86cd4a820112fb8898808a366d8f9f58ce16d1f538353ad55747d" +dependencies = [ + "anstyle", + "once_cell_polyfill", + "windows-sys", +] + +[[package]] +name = "anyhow" +version = "1.0.102" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "7f202df86484c868dbad7eaa557ef785d5c66295e41b460ef922eca0723b842c" + +[[package]] +name = "atty" +version = "0.2.14" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "d9b39be18770d11421cdb1b9947a45dd3f37e93092cbf377614828a319d5fee8" +dependencies = [ + "hermit-abi 0.1.19", + "libc", + "winapi", +] + +[[package]] +name = "autocfg" +version = "1.5.0" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "c08606f8c3cbf4ce6ec8e28fb0014a2c086708fe954eaa885384a6165172e7e8" + +[[package]] +name = "bitflags" +version = "1.3.2" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "bef38d45163c2f1dde094a7dfd33ccf595c92905c8f8f4fdc18d06fb1037718a" + +[[package]] +name = "bitflags" +version = "2.11.1" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "c4512299f36f043ab09a583e57bceb5a5aab7a73db1805848e8fef3c9e8c78b3" + +[[package]] +name = "bumpalo" +version = "3.20.2" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "5d20789868f4b01b2f2caec9f5c4e0213b41e3e5702a50157d699ae31ced2fcb" + +[[package]] +name = "cast" +version = "0.3.0" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "37b2a672a2cb129a2e41c10b1224bb368f9f37a2b16b612598138befd7b37eb5" + +[[package]] +name = "cbindgen" +version = "0.26.0" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "da6bc11b07529f16944307272d5bd9b22530bc7d05751717c9d416586cedab49" +dependencies = [ + "clap 3.2.25", + "heck 0.4.1", + "indexmap 1.9.3", + "log", + "proc-macro2", + "quote", + "serde", + "serde_json", + "syn 1.0.109", + "tempfile", + "toml", +] + +[[package]] +name = "cfg-if" +version = "1.0.4" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "9330f8b2ff13f34540b44e946ef35111825727b38d33286ef986142615121801" + +[[package]] +name = "ciborium" +version = "0.2.2" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "42e69ffd6f0917f5c029256a24d0161db17cea3997d185db0d35926308770f0e" +dependencies = [ + "ciborium-io", + "ciborium-ll", + "serde", +] + +[[package]] +name = "ciborium-io" +version = "0.2.2" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "05afea1e0a06c9be33d539b876f1ce3692f4afea2cb41f740e7743225ed1c757" + +[[package]] +name = "ciborium-ll" +version = "0.2.2" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "57663b653d948a338bfb3eeba9bb2fd5fcfaecb9e199e87e1eda4d9e8b240fd9" +dependencies = [ + "ciborium-io", + "half", +] + +[[package]] +name = "clap" +version = "3.2.25" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "4ea181bf566f71cb9a5d17a59e1871af638180a18fb0035c92ae62b705207123" +dependencies = [ + "atty", + "bitflags 1.3.2", + "clap_lex 0.2.4", + "indexmap 1.9.3", + "strsim 0.10.0", + "termcolor", + "textwrap", +] + +[[package]] +name = "clap" +version = "4.6.1" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "1ddb117e43bbf7dacf0a4190fef4d345b9bad68dfc649cb349e7d17d28428e51" +dependencies = [ + "clap_builder", + "clap_derive", +] + +[[package]] +name = "clap_builder" +version = "4.6.0" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "714a53001bf66416adb0e2ef5ac857140e7dc3a0c48fb28b2f10762fc4b5069f" +dependencies = [ + "anstream", + "anstyle", + "clap_lex 1.1.0", + "strsim 0.11.1", +] + +[[package]] +name = "clap_derive" +version = "4.6.1" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "f2ce8604710f6733aa641a2b3731eaa1e8b3d9973d5e3565da11800813f997a9" +dependencies = [ + "heck 0.5.0", + "proc-macro2", + "quote", + "syn 2.0.117", +] + +[[package]] +name = "clap_lex" +version = "0.2.4" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "2850f2f5a82cbf437dd5af4d49848fbdfc27c157c3d010345776f952765261c5" +dependencies = [ + "os_str_bytes", +] + +[[package]] +name = "clap_lex" +version = "1.1.0" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "c8d4a3bb8b1e0c1050499d1815f5ab16d04f0959b233085fb31653fbfc9d98f9" + +[[package]] +name = "colorchoice" +version = "1.0.5" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "1d07550c9036bf2ae0c684c4297d503f838287c83c53686d05370d0e139ae570" + +[[package]] +name = "criterion" +version = "0.5.1" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "f2b12d017a929603d80db1831cd3a24082f8137ce19c69e6447f54f5fc8d692f" +dependencies = [ + "anes", + "cast", + "ciborium", + "clap 4.6.1", + "criterion-plot", + "is-terminal", + "itertools", + "num-traits", + "once_cell", + "oorandom", + "plotters", + "rayon", + "regex", + "serde", + "serde_derive", + "serde_json", + "tinytemplate", + "walkdir", +] + +[[package]] +name = "criterion-plot" +version = "0.5.0" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "6b50826342786a51a89e2da3a28f1c32b06e387201bc2d19791f622c673706b1" +dependencies = [ + "cast", + "itertools", +] + +[[package]] +name = "crossbeam-deque" +version = "0.8.6" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "9dd111b7b7f7d55b72c0a6ae361660ee5853c9af73f70c3c2ef6858b950e2e51" +dependencies = [ + "crossbeam-epoch", + "crossbeam-utils", +] + +[[package]] +name = "crossbeam-epoch" +version = "0.9.18" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "5b82ac4a3c2ca9c3460964f020e1402edd5753411d7737aa39c3714ad1b5420e" +dependencies = [ + "crossbeam-utils", +] + +[[package]] +name = "crossbeam-utils" +version = "0.8.21" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "d0a5c400df2834b80a4c3327b3aad3a4c4cd4de0629063962b03235697506a28" + +[[package]] +name = "crunchy" +version = "0.2.4" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "460fbee9c2c2f33933d720630a6a0bac33ba7053db5344fac858d4b8952d77d5" + +[[package]] +name = "either" +version = "1.15.0" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "48c757948c5ede0e46177b7add2e67155f70e33c07fea8284df6576da70b3719" + +[[package]] +name = "equivalent" +version = "1.0.2" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "877a4ace8713b0bcf2a4e7eec82529c029f1d0619886d18145fea96c3ffe5c0f" + +[[package]] +name = "errno" +version = "0.3.14" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "39cab71617ae0d63f51a36d69f866391735b51691dbda63cf6f96d042b63efeb" +dependencies = [ + "libc", + "windows-sys", +] + +[[package]] +name = "fastrand" +version = "2.4.1" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "9f1f227452a390804cdb637b74a86990f2a7d7ba4b7d5693aac9b4dd6defd8d6" + +[[package]] +name = "foldhash" +version = "0.1.5" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "d9c4f5dac5e15c24eb999c26181a6ca40b39fe946cbe4c263c7209467bc83af2" + +[[package]] +name = "getrandom" +version = "0.2.17" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "ff2abc00be7fca6ebc474524697ae276ad847ad0a6b3faa4bcb027e9a4614ad0" +dependencies = [ + "cfg-if", + "libc", + "wasi", +] + +[[package]] +name = "getrandom" +version = "0.4.2" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "0de51e6874e94e7bf76d726fc5d13ba782deca734ff60d5bb2fb2607c7406555" +dependencies = [ + "cfg-if", + "libc", + "r-efi", + "wasip2", + "wasip3", +] + +[[package]] +name = "half" +version = "2.7.1" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "6ea2d84b969582b4b1864a92dc5d27cd2b77b622a8d79306834f1be5ba20d84b" +dependencies = [ + "cfg-if", + "crunchy", + "zerocopy", +] + +[[package]] +name = "hashbrown" +version = "0.12.3" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "8a9ee70c43aaf417c914396645a0fa852624801b24ebb7ae78fe8272889ac888" + +[[package]] +name = "hashbrown" +version = "0.15.5" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "9229cfe53dfd69f0609a49f65461bd93001ea1ef889cd5529dd176593f5338a1" +dependencies = [ + "foldhash", +] + +[[package]] +name = "hashbrown" +version = "0.17.0" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "4f467dd6dccf739c208452f8014c75c18bb8301b050ad1cfb27153803edb0f51" + +[[package]] +name = "heck" +version = "0.4.1" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "95505c38b4572b2d910cecb0281560f54b440a19336cbbcb27bf6ce6adc6f5a8" + +[[package]] +name = "heck" +version = "0.5.0" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "2304e00983f87ffb38b55b444b5e3b60a884b5d30c0fca7d82fe33449bbe55ea" + +[[package]] +name = "hermit-abi" +version = "0.1.19" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "62b467343b94ba476dcb2500d242dadbb39557df889310ac77c5d99100aaac33" +dependencies = [ + "libc", +] + +[[package]] +name = "hermit-abi" +version = "0.5.2" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "fc0fef456e4baa96da950455cd02c081ca953b141298e41db3fc7e36b1da849c" + +[[package]] +name = "id-arena" +version = "2.3.0" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "3d3067d79b975e8844ca9eb072e16b31c3c1c36928edf9c6789548c524d0d954" + +[[package]] +name = "indexmap" +version = "1.9.3" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "bd070e393353796e801d209ad339e89596eb4c8d430d18ede6a1cced8fafbd99" +dependencies = [ + "autocfg", + "hashbrown 0.12.3", +] + +[[package]] +name = "indexmap" +version = "2.14.0" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "d466e9454f08e4a911e14806c24e16fba1b4c121d1ea474396f396069cf949d9" +dependencies = [ + "equivalent", + "hashbrown 0.17.0", + "serde", + "serde_core", +] + +[[package]] +name = "is-terminal" +version = "0.4.17" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "3640c1c38b8e4e43584d8df18be5fc6b0aa314ce6ebf51b53313d4306cca8e46" +dependencies = [ + "hermit-abi 0.5.2", + "libc", + "windows-sys", +] + +[[package]] +name = "is_terminal_polyfill" +version = "1.70.2" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "a6cb138bb79a146c1bd460005623e142ef0181e3d0219cb493e02f7d08a35695" + +[[package]] +name = "itertools" +version = "0.10.5" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "b0fd2260e829bddf4cb6ea802289de2f86d6a7a690192fbe91b3f46e0f2c8473" +dependencies = [ + "either", +] + +[[package]] +name = "itoa" +version = "1.0.18" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "8f42a60cbdf9a97f5d2305f08a87dc4e09308d1276d28c869c684d7777685682" + +[[package]] +name = "js-sys" +version = "0.3.95" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "2964e92d1d9dc3364cae4d718d93f227e3abb088e747d92e0395bfdedf1c12ca" +dependencies = [ + "once_cell", + "wasm-bindgen", +] + +[[package]] +name = "leb128fmt" +version = "0.1.0" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "09edd9e8b54e49e587e4f6295a7d29c3ea94d469cb40ab8ca70b288248a81db2" + +[[package]] +name = "libc" +version = "0.2.185" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "52ff2c0fe9bc6cb6b14a0592c2ff4fa9ceb83eea9db979b0487cd054946a2b8f" + +[[package]] +name = "linux-raw-sys" +version = "0.12.1" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "32a66949e030da00e8c7d4434b251670a91556f4144941d37452769c25d58a53" + +[[package]] +name = "log" +version = "0.4.29" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "5e5032e24019045c762d3c0f28f5b6b8bbf38563a65908389bf7978758920897" + +[[package]] +name = "memchr" +version = "2.8.0" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "f8ca58f447f06ed17d5fc4043ce1b10dd205e060fb3ce5b979b8ed8e59ff3f79" + +[[package]] +name = "num-traits" +version = "0.2.19" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "071dfc062690e90b734c0b2273ce72ad0ffa95f0c74596bc250dcfd960262841" +dependencies = [ + "autocfg", +] + +[[package]] +name = "once_cell" +version = "1.21.4" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "9f7c3e4beb33f85d45ae3e3a1792185706c8e16d043238c593331cc7cd313b50" + +[[package]] +name = "once_cell_polyfill" +version = "1.70.2" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "384b8ab6d37215f3c5301a95a4accb5d64aa607f1fcb26a11b5303878451b4fe" + +[[package]] +name = "oorandom" +version = "11.1.5" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "d6790f58c7ff633d8771f42965289203411a5e5c68388703c06e14f24770b41e" + +[[package]] +name = "os_str_bytes" +version = "6.6.1" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "e2355d85b9a3786f481747ced0e0ff2ba35213a1f9bd406ed906554d7af805a1" + +[[package]] +name = "plotters" +version = "0.3.7" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "5aeb6f403d7a4911efb1e33402027fc44f29b5bf6def3effcc22d7bb75f2b747" +dependencies = [ + "num-traits", + "plotters-backend", + "plotters-svg", + "wasm-bindgen", + "web-sys", +] + +[[package]] +name = "plotters-backend" +version = "0.3.7" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "df42e13c12958a16b3f7f4386b9ab1f3e7933914ecea48da7139435263a4172a" + +[[package]] +name = "plotters-svg" +version = "0.3.7" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "51bae2ac328883f7acdfea3d66a7c35751187f870bc81f94563733a154d7a670" +dependencies = [ + "plotters-backend", +] + +[[package]] +name = "ppv-lite86" +version = "0.2.21" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "85eae3c4ed2f50dcfe72643da4befc30deadb458a9b590d720cde2f2b1e97da9" +dependencies = [ + "zerocopy", +] + +[[package]] +name = "prettyplease" +version = "0.2.37" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "479ca8adacdd7ce8f1fb39ce9ecccbfe93a3f1344b3d0d97f20bc0196208f62b" +dependencies = [ + "proc-macro2", + "syn 2.0.117", +] + +[[package]] +name = "proc-macro2" +version = "1.0.106" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "8fd00f0bb2e90d81d1044c2b32617f68fcb9fa3bb7640c23e9c748e53fb30934" +dependencies = [ + "unicode-ident", +] + +[[package]] +name = "quote" +version = "1.0.45" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "41f2619966050689382d2b44f664f4bc593e129785a36d6ee376ddf37259b924" +dependencies = [ + "proc-macro2", +] + +[[package]] +name = "r-efi" +version = "6.0.0" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "f8dcc9c7d52a811697d2151c701e0d08956f92b0e24136cf4cf27b57a6a0d9bf" + +[[package]] +name = "rand" +version = "0.8.6" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "5ca0ecfa931c29007047d1bc58e623ab12e5590e8c7cc53200d5202b69266d8a" +dependencies = [ + "libc", + "rand_chacha", + "rand_core", +] + +[[package]] +name = "rand_chacha" +version = "0.3.1" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "e6c10a63a0fa32252be49d21e7709d4d4baf8d231c2dbce1eaa8141b9b127d88" +dependencies = [ + "ppv-lite86", + "rand_core", +] + +[[package]] +name = "rand_core" +version = "0.6.4" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "ec0be4795e2f6a28069bec0b5ff3e2ac9bafc99e6a9a7dc3547996c5c816922c" +dependencies = [ + "getrandom 0.2.17", +] + +[[package]] +name = "rayon" +version = "1.12.0" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "fb39b166781f92d482534ef4b4b1b2568f42613b53e5b6c160e24cfbfa30926d" +dependencies = [ + "either", + "rayon-core", +] + +[[package]] +name = "rayon-core" +version = "1.13.0" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "22e18b0f0062d30d4230b2e85ff77fdfe4326feb054b9783a3460d8435c8ab91" +dependencies = [ + "crossbeam-deque", + "crossbeam-utils", +] + +[[package]] +name = "regex" +version = "1.12.3" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "e10754a14b9137dd7b1e3e5b0493cc9171fdd105e0ab477f51b72e7f3ac0e276" +dependencies = [ + "aho-corasick", + "memchr", + "regex-automata", + "regex-syntax", +] + +[[package]] +name = "regex-automata" +version = "0.4.14" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "6e1dd4122fc1595e8162618945476892eefca7b88c52820e74af6262213cae8f" +dependencies = [ + "aho-corasick", + "memchr", + "regex-syntax", +] + +[[package]] +name = "regex-syntax" +version = "0.8.10" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "dc897dd8d9e8bd1ed8cdad82b5966c3e0ecae09fb1907d58efaa013543185d0a" + +[[package]] +name = "rustix" +version = "1.1.4" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "b6fe4565b9518b83ef4f91bb47ce29620ca828bd32cb7e408f0062e9930ba190" +dependencies = [ + "bitflags 2.11.1", + "errno", + "libc", + "linux-raw-sys", + "windows-sys", +] + +[[package]] +name = "rustversion" +version = "1.0.22" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "b39cdef0fa800fc44525c84ccb54a029961a8215f9619753635a9c0d2538d46d" + +[[package]] +name = "same-file" +version = "1.0.6" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "93fc1dc3aaa9bfed95e02e6eadabb4baf7e3078b0bd1b4d7b6b0b68378900502" +dependencies = [ + "winapi-util", +] + +[[package]] +name = "semver" +version = "1.0.28" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "8a7852d02fc848982e0c167ef163aaff9cd91dc640ba85e263cb1ce46fae51cd" + +[[package]] +name = "serde" +version = "1.0.228" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "9a8e94ea7f378bd32cbbd37198a4a91436180c5bb472411e48b5ec2e2124ae9e" +dependencies = [ + "serde_core", + "serde_derive", +] + +[[package]] +name = "serde_core" +version = "1.0.228" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "41d385c7d4ca58e59fc732af25c3983b67ac852c1a25000afe1175de458b67ad" +dependencies = [ + "serde_derive", +] + +[[package]] +name = "serde_derive" +version = "1.0.228" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "d540f220d3187173da220f885ab66608367b6574e925011a9353e4badda91d79" +dependencies = [ + "proc-macro2", + "quote", + "syn 2.0.117", +] + +[[package]] +name = "serde_json" +version = "1.0.149" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "83fc039473c5595ace860d8c4fafa220ff474b3fc6bfdb4293327f1a37e94d86" +dependencies = [ + "itoa", + "memchr", + "serde", + "serde_core", + "zmij", +] + +[[package]] +name = "strsim" +version = "0.10.0" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "73473c0e59e6d5812c5dfe2a064a6444949f089e20eec9a2e5506596494e4623" + +[[package]] +name = "strsim" +version = "0.11.1" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "7da8b5736845d9f2fcb837ea5d9e2628564b3b043a70948a3f0b778838c5fb4f" + +[[package]] +name = "syn" +version = "1.0.109" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "72b64191b275b66ffe2469e8af2c1cfe3bafa67b529ead792a6d0160888b4237" +dependencies = [ + "proc-macro2", + "quote", + "unicode-ident", +] + +[[package]] +name = "syn" +version = "2.0.117" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "e665b8803e7b1d2a727f4023456bbbbe74da67099c585258af0ad9c5013b9b99" +dependencies = [ + "proc-macro2", + "quote", + "unicode-ident", +] + +[[package]] +name = "tempfile" +version = "3.27.0" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "32497e9a4c7b38532efcdebeef879707aa9f794296a4f0244f6f69e9bc8574bd" +dependencies = [ + "fastrand", + "getrandom 0.4.2", + "once_cell", + "rustix", + "windows-sys", +] + +[[package]] +name = "termcolor" +version = "1.4.1" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "06794f8f6c5c898b3275aebefa6b8a1cb24cd2c6c79397ab15774837a0bc5755" +dependencies = [ + "winapi-util", +] + +[[package]] +name = "textwrap" +version = "0.16.2" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "c13547615a44dc9c452a8a534638acdf07120d4b6847c8178705da06306a3057" + +[[package]] +name = "tinytemplate" +version = "1.2.1" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "be4d6b5f19ff7664e8c98d03e2139cb510db9b0a60b55f8e8709b689d939b6bc" +dependencies = [ + "serde", + "serde_json", +] + +[[package]] +name = "toml" +version = "0.5.11" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "f4f7f0dd8d50a853a531c426359045b1998f04219d88799810762cd4ad314234" +dependencies = [ + "serde", +] + +[[package]] +name = "trios-garden" +version = "0.1.0" +dependencies = [ + "cbindgen", + "libc", +] + +[[package]] +name = "trios-http" +version = "0.1.0" +dependencies = [ + "cbindgen", + "libc", +] + +[[package]] +name = "trios-hybrid" +version = "0.1.0" +dependencies = [ + "cbindgen", + "libc", +] + +[[package]] +name = "trios-quest" +version = "0.1.0" +dependencies = [ + "cbindgen", + "libc", +] + +[[package]] +name = "trios-sacred" +version = "0.1.0" +dependencies = [ + "cbindgen", + "libc", +] + +[[package]] +name = "trios-store" +version = "0.1.0" +dependencies = [ + "cbindgen", + "libc", +] + +[[package]] +name = "trios-ternary" +version = "0.1.0" +dependencies = [ + "cbindgen", + "libc", +] + +[[package]] +name = "trios-train-cpu" +version = "0.1.0" +dependencies = [ + "clap 4.6.1", + "criterion", + "half", + "rand", + "rand_chacha", + "serde", +] + +[[package]] +name = "trios-validation" +version = "0.1.0" +dependencies = [ + "cbindgen", + "libc", +] + +[[package]] +name = "trios-vsa" +version = "0.1.0" +dependencies = [ + "cbindgen", + "libc", +] + +[[package]] +name = "trios-wasm" +version = "0.1.0" +dependencies = [ + "cbindgen", + "libc", +] + +[[package]] +name = "unicode-ident" +version = "1.0.24" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "e6e4313cd5fcd3dad5cafa179702e2b244f760991f45397d14d4ebf38247da75" + +[[package]] +name = "unicode-xid" +version = "0.2.6" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "ebc1c04c71510c7f702b52b7c350734c9ff1295c464a03335b00bb84fc54f853" + +[[package]] +name = "utf8parse" +version = "0.2.2" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "06abde3611657adf66d383f00b093d7faecc7fa57071cce2578660c9f1010821" + +[[package]] +name = "walkdir" +version = "2.5.0" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "29790946404f91d9c5d06f9874efddea1dc06c5efe94541a7d6863108e3a5e4b" +dependencies = [ + "same-file", + "winapi-util", +] + +[[package]] +name = "wasi" +version = "0.11.1+wasi-snapshot-preview1" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "ccf3ec651a847eb01de73ccad15eb7d99f80485de043efb2f370cd654f4ea44b" + +[[package]] +name = "wasip2" +version = "1.0.3+wasi-0.2.9" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "20064672db26d7cdc89c7798c48a0fdfac8213434a1186e5ef29fd560ae223d6" +dependencies = [ + "wit-bindgen 0.57.1", +] + +[[package]] +name = "wasip3" +version = "0.4.0+wasi-0.3.0-rc-2026-01-06" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "5428f8bf88ea5ddc08faddef2ac4a67e390b88186c703ce6dbd955e1c145aca5" +dependencies = [ + "wit-bindgen 0.51.0", +] + +[[package]] +name = "wasm-bindgen" +version = "0.2.118" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "0bf938a0bacb0469e83c1e148908bd7d5a6010354cf4fb73279b7447422e3a89" +dependencies = [ + "cfg-if", + "once_cell", + "rustversion", + "wasm-bindgen-macro", + "wasm-bindgen-shared", +] + +[[package]] +name = "wasm-bindgen-macro" +version = "0.2.118" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "eeff24f84126c0ec2db7a449f0c2ec963c6a49efe0698c4242929da037ca28ed" +dependencies = [ + "quote", + "wasm-bindgen-macro-support", +] + +[[package]] +name = "wasm-bindgen-macro-support" +version = "0.2.118" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "9d08065faf983b2b80a79fd87d8254c409281cf7de75fc4b773019824196c904" +dependencies = [ + "bumpalo", + "proc-macro2", + "quote", + "syn 2.0.117", + "wasm-bindgen-shared", +] + +[[package]] +name = "wasm-bindgen-shared" +version = "0.2.118" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "5fd04d9e306f1907bd13c6361b5c6bfc7b3b3c095ed3f8a9246390f8dbdee129" +dependencies = [ + "unicode-ident", +] + +[[package]] +name = "wasm-encoder" +version = "0.244.0" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "990065f2fe63003fe337b932cfb5e3b80e0b4d0f5ff650e6985b1048f62c8319" +dependencies = [ + "leb128fmt", + "wasmparser", +] + +[[package]] +name = "wasm-metadata" +version = "0.244.0" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "bb0e353e6a2fbdc176932bbaab493762eb1255a7900fe0fea1a2f96c296cc909" +dependencies = [ + "anyhow", + "indexmap 2.14.0", + "wasm-encoder", + "wasmparser", +] + +[[package]] +name = "wasmparser" +version = "0.244.0" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "47b807c72e1bac69382b3a6fb3dbe8ea4c0ed87ff5629b8685ae6b9a611028fe" +dependencies = [ + "bitflags 2.11.1", + "hashbrown 0.15.5", + "indexmap 2.14.0", + "semver", +] + +[[package]] +name = "web-sys" +version = "0.3.95" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "4f2dfbb17949fa2088e5d39408c48368947b86f7834484e87b73de55bc14d97d" +dependencies = [ + "js-sys", + "wasm-bindgen", +] + +[[package]] +name = "winapi" +version = "0.3.9" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "5c839a674fcd7a98952e593242ea400abe93992746761e38641405d28b00f419" +dependencies = [ + "winapi-i686-pc-windows-gnu", + "winapi-x86_64-pc-windows-gnu", +] + +[[package]] +name = "winapi-i686-pc-windows-gnu" +version = "0.4.0" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "ac3b87c63620426dd9b991e5ce0329eff545bccbbb34f3be09ff6fb6ab51b7b6" + +[[package]] +name = "winapi-util" +version = "0.1.11" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "c2a7b1c03c876122aa43f3020e6c3c3ee5c05081c9a00739faf7503aeba10d22" +dependencies = [ + "windows-sys", +] + +[[package]] +name = "winapi-x86_64-pc-windows-gnu" +version = "0.4.0" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "712e227841d057c1ee1cd2fb22fa7e5a5461ae8e48fa2ca79ec42cfc1931183f" + +[[package]] +name = "windows-link" +version = "0.2.1" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "f0805222e57f7521d6a62e36fa9163bc891acd422f971defe97d64e70d0a4fe5" + +[[package]] +name = "windows-sys" +version = "0.61.2" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "ae137229bcbd6cdf0f7b80a31df61766145077ddf49416a728b02cb3921ff3fc" +dependencies = [ + "windows-link", +] + +[[package]] +name = "wit-bindgen" +version = "0.51.0" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "d7249219f66ced02969388cf2bb044a09756a083d0fab1e566056b04d9fbcaa5" +dependencies = [ + "wit-bindgen-rust-macro", +] + +[[package]] +name = "wit-bindgen" +version = "0.57.1" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "1ebf944e87a7c253233ad6766e082e3cd714b5d03812acc24c318f549614536e" + +[[package]] +name = "wit-bindgen-core" +version = "0.51.0" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "ea61de684c3ea68cb082b7a88508a8b27fcc8b797d738bfc99a82facf1d752dc" +dependencies = [ + "anyhow", + "heck 0.5.0", + "wit-parser", +] + +[[package]] +name = "wit-bindgen-rust" +version = "0.51.0" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "b7c566e0f4b284dd6561c786d9cb0142da491f46a9fbed79ea69cdad5db17f21" +dependencies = [ + "anyhow", + "heck 0.5.0", + "indexmap 2.14.0", + "prettyplease", + "syn 2.0.117", + "wasm-metadata", + "wit-bindgen-core", + "wit-component", +] + +[[package]] +name = "wit-bindgen-rust-macro" +version = "0.51.0" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "0c0f9bfd77e6a48eccf51359e3ae77140a7f50b1e2ebfe62422d8afdaffab17a" +dependencies = [ + "anyhow", + "prettyplease", + "proc-macro2", + "quote", + "syn 2.0.117", + "wit-bindgen-core", + "wit-bindgen-rust", +] + +[[package]] +name = "wit-component" +version = "0.244.0" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "9d66ea20e9553b30172b5e831994e35fbde2d165325bec84fc43dbf6f4eb9cb2" +dependencies = [ + "anyhow", + "bitflags 2.11.1", + "indexmap 2.14.0", + "log", + "serde", + "serde_derive", + "serde_json", + "wasm-encoder", + "wasm-metadata", + "wasmparser", + "wit-parser", +] + +[[package]] +name = "wit-parser" +version = "0.244.0" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "ecc8ac4bc1dc3381b7f59c34f00b67e18f910c2c0f50015669dde7def656a736" +dependencies = [ + "anyhow", + "id-arena", + "indexmap 2.14.0", + "log", + "semver", + "serde", + "serde_derive", + "serde_json", + "unicode-xid", + "wasmparser", +] + +[[package]] +name = "zerocopy" +version = "0.8.48" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "eed437bf9d6692032087e337407a86f04cd8d6a16a37199ed57949d415bd68e9" +dependencies = [ + "zerocopy-derive", +] + +[[package]] +name = "zerocopy-derive" +version = "0.8.48" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "70e3cd084b1788766f53af483dd21f93881ff30d7320490ec3ef7526d203bad4" +dependencies = [ + "proc-macro2", + "quote", + "syn 2.0.117", +] + +[[package]] +name = "zmij" +version = "1.0.21" +source = "registry+https://github.com/rust-lang/crates.io-index" +checksum = "b8848ee67ecc8aedbaf3e4122217aff892639231befc6a1b58d29fff4c2cabaa" diff --git a/README.md.new b/README.md.new new file mode 100644 index 0000000000..daa869870f --- /dev/null +++ b/README.md.new @@ -0,0 +1,128 @@ +# trinity + +[![Zig](https://img.shields.io/badge/Zig-0.15+-F7A41D?logo=zig&logoColor=white)](https://ziglang.org/) +[![License](https://img.shields.io/badge/License-MIT-blue.svg)](LICENSE) +[![Golden Ratio](https://img.shields.io/badge/\(\(\))-1.618033988-gold)](https://en.wikipedia.org/wiki/golden_ratio) +[![Ecosystem](https://img.shields.io/badge/Trinity-Main-blue)](https://github.com/gHashTag/trinity) + +> **Trinity Orchestrator** — Golden Ratio mathematics meets computational physics and AI. Links all Trinity micro-repositories via `build.zig.zon`. + +## \(\(\) What is Trinity? + +Trinity is the main orchestrator connecting a family of focused micro-repositories. Each repo has a single responsibility and can be used independently. + +### Dependency Graph + +\` + t27 \(\(\leftarrow\) SSOT: Ternary specs + Rust bootstrap compiler + \(\(\uparrow\) + zig-golden-float \(\(\leftarrow\) Numerical core: GF16, TF3, JIT, VM + \(\(\uparrow\) + zig-sacred-geometry \(\(\leftarrow\) Sacred geometry: \(\(\phi\)-attention, Beal + zig-physics \(\(\leftarrow\) Quantum: QCD, gravity, dark matter, baryogenesis + zig-hdc \(\(\leftarrow\) Hyperdimensional: VSA, Sequence HDC + zig-knowledge-graph \(\(\leftarrow\) Knowledge Graph: server + CLI + trinity-training \(\(\leftarrow\) HSLM ML: benchmarks, datasets (208MB) + \(\(\uparrow\) + zig-agents \(\(\leftarrow\) Agents: MCP, autonomous (~519KB) + zig-crypto-mining \(\(\leftarrow\) BTC mining + DePIN (~60KB) + \(\(\uparrow\) + trinity \(\(\leftarrow\) Orchestrator (links all via build.zig.zon) + \` + +## \(\(\) Trinity Ecosystem + +> Golden Ratio mathematics meets computational physics and AI. + +| Repository | Purpose | Status | +|---|---|---| +| [trinity](https://github.com/gHashTag/trinity) | \(\(\(\) Orchestrator, agents, API, MCP server | \(\(\) \(\(\check\(\))\(\) Here | +| [zig-golden-float](https://github.com/gHashTag/zig-golden-float) | \(\(\(\) \(\(\) Numeric core: GF16, TF3, VSA, JIT | \(\(\) \(\(\check\(\))\(\) Core | +| [trinity-training](https://github.com/gHashTag/trinity-training) | \(\(\) \(\(\) ML: HSLM, benchmarks, datasets | [!\[CI\](https://img.shields.io/github/actions/workflow/status/gHashTag/trinity-training/ci.yml?branch=main)\](https://github.com/gHashTag/trinity-training/actions) | +| [t27](https://github.com/gHashTag/t27) | \(\(\) \(\(\) Ternary SSOT + Rust bootstrap | \(\(\) \(\(\) Language | +| [vibee-lang](https://github.com/gHashTag/vibee-lang) | \(\(\) \(\(\) VIBEE language spec (.tri/.vibee) | \(\(\) \(\(\) Language | +| [zig-hdc](https://github.com/gHashTag/zig-hdc) | \(\(\) \(\(\) Hyperdimensional: VSA, HRR | \(\(\check\(\))\(\) | +| [zig-sacred-geometry](https://github.com/gHashTag/zig-sacred-geometry) | \(\(\) \(\(\) Sacred \(\(\phi\)-geometry, Beal | \(\(\check\(\))\(\) | +| [zig-physics](https://github.com/gHashTag/zig-physics) | \(\(\) \(\(\) Quantum: QCD, gravity, dark matter | \(\(\check\(\))\(\) | +| [zig-knowledge-graph](https://github.com/gHashTag/zig-knowledge-graph) | \(\(\) \(\(\) KG server + CLI | \(\(\check\(\))\(\) | +| [zig-agents](https://github.com/gHashTag/zig-agents) | \(\(\) \(\(\) Agents: MCP, autonomous | \(\(\check\(\))\(\) | +| [zig-crypto-mining](https://github.com/gHashTag/zig-crypto-mining) | \(\(\) \(\(\) BTC mining + DePIN | \(\(\check\(\))\(\) | +| [trinity-fpga](https://github.com/gHashTag/trinity-fpga) | \(\(\) \(\(\) FPGA: Verilog synthesis | \(\(\) \(\(\) WIP | + +## \(\(\) Repository Overview + +| # | Repository | Status | Size | Description | +|---|---|---|---|---| +| 1 | [t27](https://github.com/gHashTag/t27) | \(\(\) \(\(\) LIVE | 577+ specs | Ternary SSOT + Rust bootstrap | +| 2 | [zig-golden-float](https://github.com/gHashTag/zig-golden-float) | \(\(\) \(\(\) LIVE | ~1MB | Numerical core: GF16, TF3, JIT, VM | +| 3 | [zig-hdc](https://github.com/gHashTag/zig-hdc) | \(\(\) \(\(\) LIVE | 352KB | VSA, HRR, hyperdimensional computing | +| 4 | [zig-sacred-geometry](https://github.com/gHashTag/zig-sacred-geometry) | \(\(\) \(\(\) LIVE | 58KB | Sacred \(\(\phi\)-geometry, Beal, sacred constants | +| 5 | [zig-physics](https://github.com/gHashTag/zig-physics) | \(\(\) \(\(\) LIVE | 36KB (src) | Quantum: QCD, gravity, dark matter | +| 6 | [zig-knowledge-graph](https://github.com/gHashTag/zig-knowledge-graph) | \(\(\) \(\(\) LIVE | ~100KB | KG server + CLI | +| 7 | [zig-agents](https://github.com/gHashTag/zig-agents) | \(\(\) \(\(\) LIVE | ~519KB (src!) | Agents, MCP, autonomous | +| 8 | [zig-crypto-mining](https://github.com/gHashTag/zig-crypto-mining) | \(\(\) \(\(\) LIVE | ~60KB | BTC mining + DePIN | +| 9 | [trinity-training](https://github.com/gHashTag/trinity-training) | \(\(\) \(\(\) LIVE | 208MB data | HSLM, benchmarks, datasets | +| 10 | [trinity](https://github.com/gHashTag/trinity) | \(\(\) \(\(\) LIVE | ~500MB | Orchestrator, API, CLI, VIBEE, FPGA | + +## \(\(\) Migration Status + +**Phase 1 — HIGH Priority:** \(\(\check\(\)) Complete +- [zig-golden-float](https://github.com/gHashTag/zig-golden-float) — Cloned as submodule in trinity-training +- [zig-knowledge-graph](https://github.com/gHashTag/zig-knowledge-graph) — Extracted from trinity +- [zig-crypto-mining](https://github.com/gHashTag/zig-crypto-mining) — Extracted from trinity +- [zig-physics](https://github.com/gHashTag/zig-physics) — Extracted from trinity +- [zig-agents](https://github.com/gHashTag/zig-agents) — Extracted from trinity +- [zig-sacred-geometry](https://github.com/gHashTag/zig-sacred-geometry) — Extracted from trinity + +**Phase 2 — MEDIUM Priority:** \(\(\) \(\(\) In Progress +- Firebird/BitNet \(\(\) \(\(\) \(\(\rightarrow\) trinity-training +- DePIN/\$\(\)TRI \(\(\) \(\(\) \(\(\rightarrow\) zig-crypto-mining +- VIBEE compiler \(\(\) \(\(\) \(\(\rightarrow\) t27 + +**Phase 3 — LOW Priority:** \(\(\) \(\(\) Pending +- trinity-fpga — Create new repo +- trinity-cli — Unify TRI CLI +- trinity-www — Docsite + +## \(\(\) Using a Module Independently + +Each micro-repo is a standalone Zig package. To use any module independently: + +\`\(\)zig +// build.zig.zon +.dependencies = .\{ + .zig_golden_float = .\{ + .url = "https://github.com/gHashTag/zig-golden-float/archive/refs/heads/main.tar.gz", + \}, +\`, +\`\` + +\`\`\`bash +zig fetch --save https://github.com/gHashTag/zig-golden-float/archive/refs/heads/main.tar.gz +\`\` + +## \(\(\) Model Documentation + +**[docs/research/COMPLETE_MODEL_CATALOG.md](docs/research/COMPLETE_MODEL_CATALOG.md)** + +### JEPA-T +- [Research: docs/lab/papers/2026-03-15-hslm-tjepa.md](docs/lab/papers/2026-03-15-hslm-tjepa.md) +- [Results: docs/experiments/FOUND_EXPERIMENTS_SUMMARY.md](docs/experiments/FOUND_EXPERIMENTS_SUMMARY.md) + +### Neural Cellular Automata +- [Results: docs/experiments/FOUND_EXPERIMENTS_SUMMARY.md](docs/experiments/FOUND_EXPERIMENTS_SUMMARY.md) + +### VSA +- [API: docs/docs/api/vsa.md](docs/docs/api/vsa.md) +- [Tutorial: docs/docs/tutorials/vsa-operations.md](docs/docs/tutorials/vsa-operations.md) + +### Ternary +- [Guide: docs/docs/concepts/balanced-ternary.md](docs/docs/concepts/balanced-ternary.md) +- [ADR: docs/docs/adr/002-ternary-representation.md](docs/docs/adr/002-ternary-representation.md) + +### Hybrid +- [API: docs/docs/api/hybrid.md](docs/docs/api/hybrid.md) + +## \(\(\) License + +MIT \(\(\) \(\) gHashTag diff --git a/crates/trios-crypto/build.rs b/crates/trios-crypto/build.rs new file mode 100644 index 0000000000..5b317ceb15 --- /dev/null +++ b/crates/trios-crypto/build.rs @@ -0,0 +1,9 @@ +fn main() { + let crate_dir = std::env::var("CARGO_MANIFEST_DIR").unwrap(); + cbindgen::Builder::new() + .with_crate(&crate_dir) + .with_language(cbindgen::Language::C) + .generate() + .expect("Unable to generate bindings") + .write_to_file(format!("{}/include/trios_crypto.h", crate_dir)); +} diff --git a/crates/trios-crypto/src/lib.rs b/crates/trios-crypto/src/lib.rs new file mode 100644 index 0000000000..673684eb81 --- /dev/null +++ b/crates/trios-crypto/src/lib.rs @@ -0,0 +1,261 @@ +//! TRIOS Crypto — Cryptographic Operations and DePIN Mining FFI +//! +//! This crate provides FFI bindings for TRIOS cryptographic operations. +//! +//! ## Features +//! +//! - **Blake3**: Fast hash function +//! - **Merkle Tree**: Root hash computation +//! - **GF256**: Galois Field operations +//! +//! ## Symbol: `🔒` + +use std::os::raw::{c_char, c_int, c_uchar, c_uint}; + +/// Hash output size (256 bits = 32 bytes) +pub const HASH_SIZE: usize = 32; + +/// Blake3 hash result +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct HashOutput { + pub data: [u8; HASH_SIZE], +} + +/// Merkle tree node +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct MerkleNode { + pub hash: HashOutput, + pub left: *mut MerkleNode, + pub right: *mut MerkleNode, +} + +/// GF256 element (byte in Galois Field) +pub type GF256 = u8; + +/// Blake3 hash of data +#[no_mangle] +pub extern "C" fn trios_crypto_blake3_hash( + data: *const u8, + len: usize, + output: *mut HashOutput, +) -> c_int { + if data.is_null() || output.is_null() { + return -1; + } + // TODO: Call Zig Blake3 implementation + unsafe { + // Placeholder: XOR hash for now + let data_slice = std::slice::from_raw_parts(data, len); + let mut hash: [u8; 32] = [0; 32]; + for (i, &b) in data_slice.iter().enumerate() { + hash[i % 32] ^= b; + } + (*output).data = hash; + } + 0 +} + +/// Compute Merkle root from hashes +#[no_mangle] +pub extern "C" fn trios_crypto_merkle_root( + hashes: *const HashOutput, + count: usize, + root: *mut HashOutput, +) -> c_int { + if hashes.is_null() || root.is_null() || count == 0 { + return -1; + } + // TODO: Call Zig Merkle root computation + unsafe { + if count == 1 { + (*root).data = (*hashes).data; + } else { + // Placeholder: XOR all hashes + let mut combined: [u8; 32] = [0; 32]; + for i in 0..count { + let h = &*hashes.add(i); + for j in 0..32 { + combined[j] ^= h.data[j]; + } + } + (*root).data = combined; + } + } + 0 +} + +/// GF256 multiplication +#[no_mangle] +pub extern "C" fn trios_crypto_gf256_mul(a: GF256, b: GF256) -> GF256 { + let mut result = 0u8; + let mut a = a; + let mut b = b; + + while b != 0 { + if b & 1 != 0 { + result ^= a; + } + let high = (a & 0x80) != 0; + a <<= 1; + if high { + a ^= 0x1b; // x^8 + x^4 + x^3 + x + 1 + } + b >>= 1; + } + result +} + +/// GF256 addition (XOR) +#[no_mangle] +pub extern "C" fn trios_crypto_gf256_add(a: GF256, b: GF256) -> GF256 { + a ^ b +} + +/// GF256 inverse +#[no_mangle] +pub extern "C" fn trios_crypto_gf256_inv(a: GF256) -> GF256 { + if a == 0 { + return 0; // No inverse for 0 + } + // Extended Euclidean algorithm for GF(2^8) + let mut t0 = 0u8; + let mut t1 = 1u8; + let mut r0 = 0x1bu8; // Irreducible polynomial + let mut r1 = a; + + while r1 != 0 { + let q = gf256_div(r0, r1); + let r2 = gf256_mul(q, r1) ^ r0; + let t2 = gf256_mul(q, t1) ^ t0; + r0 = r1; + r1 = r2; + t0 = t1; + t1 = t2; + } + t0 +} + +fn gf256_div(a: u8, b: u8) -> u8 { + let mut q = 0u8; + let mut r = a; + + for _ in 0..8 { + q <<= 1; + r <<= 1; + if (r & 0x100) != 0 { + r ^= 0x1b; + q |= 1; + } + } + q +} + +/// Mining: find nonce for target +#[no_mangle] +pub extern "C" fn trios_crypto_mine_nonce( + block_data: *const u8, + block_len: usize, + target: *const HashOutput, + nonce_start: u32, + max_nonce: u32, + found_nonce: *mut u32, + found_hash: *mut HashOutput, +) -> c_int { + if block_data.is_null() || target.is_null() || found_nonce.is_null() || found_hash.is_null() { + return -1; + } + // TODO: Call Zig mining implementation + unsafe { + *found_nonce = 0; + } + 0 +} + +/// Verify hash meets target difficulty +#[no_mangle] +pub extern "C" fn trios_crypto_verify_target( + hash: *const HashOutput, + target: *const HashOutput, +) -> bool { + if hash.is_null() || target.is_null() { + return false; + } + unsafe { + // Compare hash to target (hash must be <= target) + for i in 0..HASH_SIZE { + if (*hash).data[i] < (*target).data[i] { + return true; + } + if (*hash).data[i] > (*target).data[i] { + return false; + } + } + true + } +} + +/// Get version +#[no_mangle] +pub extern "C" fn trios_crypto_version() -> *const c_char { + "0.1.0\0".as_ptr() as *const c_char +} + +#[cfg(test)] +mod tests { + use super::*; + + #[test] + fn test_gf256_mul() { + // 2 * 3 = 6 in GF256 + assert_eq!(trios_crypto_gf256_mul(2, 3), 6); + // 0 * anything = 0 + assert_eq!(trios_crypto_gf256_mul(0, 5), 0); + } + + #[test] + fn test_gf256_add() { + assert_eq!(trios_crypto_gf256_add(5, 3), 5 ^ 3); + assert_eq!(trios_crypto_gf256_add(0, 5), 5); + } + + #[test] + fn test_gf256_inv() { + // 1's inverse is 1 + assert_eq!(trios_crypto_gf256_inv(1), 1); + // 0 has no inverse + assert_eq!(trios_crypto_gf256_inv(0), 0); + // Verify a * inv(a) = 1 + for a in 1..=255u8 { + let inv = trios_crypto_gf256_inv(a); + if inv != 0 { + assert_eq!(trios_crypto_gf256_mul(a, inv), 1); + } + } + } + + #[test] + fn test_verify_target() { + let hash = HashOutput { data: [1u8; 32] }; + let target = HashOutput { data: [2u8; 32] }; + assert!(trios_crypto_verify_target(&hash, &target)); + + let hash2 = HashOutput { data: [3u8; 32] }; + assert!(!trios_crypto_verify_target(&hash2, &target)); + } + + #[test] + fn test_null_checks() { + assert_eq!(trios_crypto_blake3_hash(std::ptr::null(), 0, std::ptr::null_mut()), -1); + assert_eq!(trios_crypto_merkle_root(std::ptr::null(), 0, std::ptr::null_mut()), -1); + } + + #[test] + fn test_version() { + let version = unsafe { + std::ffi::CStr::from_ptr(trios_crypto_version()) + }; + assert_eq!(version.to_str().unwrap(), "0.1.0"); + } +} diff --git a/crates/trios-garden/build.rs b/crates/trios-garden/build.rs new file mode 100644 index 0000000000..2d84b6d4e7 --- /dev/null +++ b/crates/trios-garden/build.rs @@ -0,0 +1,10 @@ +fn main() { + let crate_dir = std::env::var("CARGO_MANIFEST_DIR").unwrap(); + + cbindgen::Builder::new() + .with_crate(&crate_dir) + .with_language(cbindgen::Language::C) + .generate() + .expect("Unable to generate bindings") + .write_to_file(format!("{}/include/trios_garden.h", crate_dir)); +} diff --git a/crates/trios-garden/include/.gitkeep b/crates/trios-garden/include/.gitkeep new file mode 100644 index 0000000000..e69de29bb2 diff --git a/crates/trios-garden/include/trios_garden.h b/crates/trios-garden/include/trios_garden.h new file mode 100644 index 0000000000..1fb645ad50 --- /dev/null +++ b/crates/trios-garden/include/trios_garden.h @@ -0,0 +1,448 @@ +#include +#include +#include +#include + +/** + * Maximum number of plots in a garden + */ +#define MAX_PLOTS 64 + +/** + * Maximum number of seeds per plot + */ +#define MAX_SEEDS 256 + +/** + * Maximum number of growth records + */ +#define MAX_GROWTH_RECORDS 1024 + +/** + * Maximum generations for evolution + */ +#define MAX_GENERATIONS 1000 + +/** + * Maximum name length + */ +#define MAX_NAME_LEN 128 + +/** + * Maximum tag length + */ +#define MAX_TAG_LEN 64 + +/** + * Evolution operation + */ +typedef enum EvolutionOp { + /** + * Mutation — small random change + */ + Mutate = 0, + /** + * Crossover — combine two parents + */ + Crossover = 1, + /** + * Selection — keep top performers + */ + Select = 2, + /** + * Culling — remove worst performers + */ + Cull = 3, + /** + * Reset — start fresh generation + */ + Reset = 4, +} EvolutionOp; + +/** + * Growth phase + */ +typedef enum GrowthPhase { + /** + * Seed planted, not yet germinated + */ + Planted = 0, + /** + * Initial training epoch + */ + Germinating = 1, + /** + * Active training + */ + Growing = 2, + /** + * Training converged + */ + Mature = 3, + /** + * Ready for deployment + */ + Harvestable = 4, + /** + * Deprecated / superseded + */ + Deprecated = 5, +} GrowthPhase; + +/** + * Plot health status + */ +typedef enum PlotHealth { + /** + * Plot is thriving — all metrics green + */ + Thriving = 0, + /** + * Plot is healthy — minor issues + */ + Healthy = 1, + /** + * Plot needs attention — metrics degrading + */ + NeedsAttention = 2, + /** + * Plot is wilting — significant degradation + */ + Wilting = 3, + /** + * Plot is dead — should be culled + */ + Dead = 4, +} PlotHealth; + +/** + * Seed type + */ +typedef enum SeedType { + /** + * Neural network model + */ + NeuralNet = 0, + /** + * VSA (Vector Symbolic Architecture) model + */ + Vsa = 1, + /** + * HSLM (Hierarchical Sparse Language Model) + */ + Hslm = 2, + /** + * Ternary quantized model + */ + Ternary = 3, + /** + * Custom model + */ + Custom = 4, +} SeedType; + +/** + * Garden plot — a data container with health metrics + */ +typedef struct GardenPlot { + /** + * Plot name (null-terminated) + */ + char name[MAX_NAME_LEN]; + /** + * Plot ID + */ + uintptr_t id; + /** + * Health status + */ + enum PlotHealth health; + /** + * Current growth phase + */ + enum GrowthPhase phase; + /** + * Number of seeds in this plot + */ + uintptr_t seed_count; + /** + * Fitness score [0.0, 1.0] + */ + double fitness; + /** + * Loss value (lower is better) + */ + double loss; + /** + * Accuracy [0.0, 1.0] + */ + double accuracy; + /** + * Training epoch + */ + uintptr_t epoch; + /** + * Generation number + */ + uintptr_t generation; + /** + * Timestamp of last update (epoch seconds) + */ + long last_updated; + /** + * Tags for categorization + */ + char tags[4][MAX_TAG_LEN]; + /** + * Number of active tags + */ + uintptr_t tag_count; +} GardenPlot; + +/** + * Evolution entry — tracks one generation + */ +typedef struct EvolutionEntry { + /** + * Generation number + */ + uintptr_t generation; + /** + * Operation that created this generation + */ + enum EvolutionOp operation; + /** + * Population size + */ + uintptr_t population_size; + /** + * Best fitness in this generation + */ + double best_fitness; + /** + * Average fitness in this generation + */ + double avg_fitness; + /** + * Worst fitness in this generation + */ + double worst_fitness; + /** + * Diversity metric [0.0, 1.0] + */ + double diversity; + /** + * Number of elites preserved + */ + uintptr_t elites; + /** + * Timestamp (epoch seconds) + */ + long timestamp; +} EvolutionEntry; + +/** + * Garden — top-level container for all plots + */ +typedef struct Garden { + /** + * Plots + */ + struct GardenPlot plots[MAX_PLOTS]; + /** + * Number of plots + */ + uintptr_t plot_count; + /** + * Current generation + */ + uintptr_t generation; + /** + * Best fitness across all plots + */ + double best_fitness; + /** + * Average fitness across all plots + */ + double avg_fitness; + /** + * Total number of seeds across all plots + */ + uintptr_t total_seeds; + /** + * Evolution history + */ + struct EvolutionEntry evolution[MAX_GENERATIONS]; + /** + * Number of evolution entries + */ + uintptr_t evolution_count; +} Garden; + +/** + * Seed — model initializer + */ +typedef struct Seed { + /** + * Seed name (null-terminated) + */ + char name[MAX_NAME_LEN]; + /** + * Seed type + */ + enum SeedType seed_type; + /** + * Learning rate + */ + double learning_rate; + /** + * Batch size + */ + uintptr_t batch_size; + /** + * Number of layers + */ + uintptr_t layers; + /** + * Hidden dimension + */ + uintptr_t hidden_dim; + /** + * Dropout rate [0.0, 1.0] + */ + double dropout; + /** + * Weight decay + */ + double weight_decay; + /** + * Random seed for reproducibility + */ + long rng_seed; + /** + * Whether this seed is active + */ + bool active; + /** + * Initial fitness score + */ + double initial_fitness; +} Seed; + +/** + * Growth record — a snapshot of training progress + */ +typedef struct GrowthRecord { + /** + * Epoch number + */ + uintptr_t epoch; + /** + * Training loss + */ + double train_loss; + /** + * Validation loss + */ + double val_loss; + /** + * Training accuracy + */ + double train_accuracy; + /** + * Validation accuracy + */ + double val_accuracy; + /** + * Learning rate at this epoch + */ + double learning_rate; + /** + * Time elapsed in ms + */ + long elapsed_ms; + /** + * Memory usage in bytes + */ + uintptr_t memory_bytes; + /** + * Growth phase at this epoch + */ + enum GrowthPhase phase; +} GrowthRecord; + +/** + * Create a new empty garden + */ +struct Garden trios_garden_new(void); + +/** + * Add a plot to the garden + */ +bool trios_garden_add_plot(struct Garden *garden, struct GardenPlot plot); + +/** + * Recompute aggregate fitness metrics + */ +void trios_garden_recompute_fitness(struct Garden *garden); + +/** + * Create a new garden plot + */ +struct GardenPlot trios_garden_plot_new(const char *name, uintptr_t id); + +/** + * Update plot health based on metrics + */ +void trios_garden_plot_update_health(struct GardenPlot *plot); + +/** + * Advance plot to next growth phase + */ +enum GrowthPhase trios_garden_plot_advance_phase(struct GardenPlot *plot); + +/** + * Create a new seed with default hyperparameters + */ +struct Seed trios_garden_seed_new(const char *name, enum SeedType seed_type); + +/** + * Create a growth record from training metrics + */ +struct GrowthRecord trios_garden_growth_record(uintptr_t epoch, + double train_loss, + double val_loss, + double train_accuracy, + double val_accuracy, + double learning_rate, + long elapsed_ms); + +/** + * Determine growth phase from metrics + */ +enum GrowthPhase trios_garden_determine_phase(uintptr_t epoch, + double val_accuracy, + double val_loss); + +/** + * Record an evolution event + */ +bool trios_garden_record_evolution(struct Garden *garden, + enum EvolutionOp operation, + uintptr_t population_size, + double best_fitness, + double avg_fitness, + double worst_fitness, + double diversity, + uintptr_t elites, + long timestamp); + +/** + * Get the best plot by fitness + */ +uintptr_t trios_garden_best_plot(const struct Garden *garden); + +/** + * Cull plots below a fitness threshold — returns number culled + */ +uintptr_t trios_garden_cull(struct Garden *garden, double threshold); diff --git a/crates/trios-garden/src/lib.rs b/crates/trios-garden/src/lib.rs new file mode 100644 index 0000000000..b355b38aef --- /dev/null +++ b/crates/trios-garden/src/lib.rs @@ -0,0 +1,643 @@ +//! TRIOS Garden — Data Cultivation and Model Growth FFI +//! +//! This crate provides FFI bindings for TRIOS garden operations including +//! data plot management, model seed initialization, growth tracking, +//! evolutionary metrics, and harvest/culling operations. +//! +//! ## Features +//! +//! - **GardenPlot**: Data container with metadata and health metrics +//! - **Seed**: Model initializer with hyperparameters +//! - **Growth Metrics**: Track model training progress over time +//! - **Evolution**: Generation tracking with fitness scores +//! - **Harvest**: Select best models, cull underperformers +//! +//! ## Symbol: `🌱` + +use std::os::raw::{c_char, c_double, c_long}; + +// ─── Constants ──────────────────────────────────────────────────────── + +/// Maximum number of plots in a garden +pub const MAX_PLOTS: usize = 64; + +/// Maximum number of seeds per plot +pub const MAX_SEEDS: usize = 256; + +/// Maximum number of growth records +pub const MAX_GROWTH_RECORDS: usize = 1024; + +/// Maximum generations for evolution +pub const MAX_GENERATIONS: usize = 1000; + +/// Maximum name length +pub const MAX_NAME_LEN: usize = 128; + +/// Maximum tag length +pub const MAX_TAG_LEN: usize = 64; + +// ─── Enums ──────────────────────────────────────────────────────────── + +/// Plot health status +#[repr(C)] +#[derive(Clone, Copy, Debug, PartialEq, Eq)] +pub enum PlotHealth { + /// Plot is thriving — all metrics green + Thriving = 0, + /// Plot is healthy — minor issues + Healthy = 1, + /// Plot needs attention — metrics degrading + NeedsAttention = 2, + /// Plot is wilting — significant degradation + Wilting = 3, + /// Plot is dead — should be culled + Dead = 4, +} + +/// Seed type +#[repr(C)] +#[derive(Clone, Copy, Debug, PartialEq, Eq)] +pub enum SeedType { + /// Neural network model + NeuralNet = 0, + /// VSA (Vector Symbolic Architecture) model + Vsa = 1, + /// HSLM (Hierarchical Sparse Language Model) + Hslm = 2, + /// Ternary quantized model + Ternary = 3, + /// Custom model + Custom = 4, +} + +/// Growth phase +#[repr(C)] +#[derive(Clone, Copy, Debug, PartialEq, Eq)] +pub enum GrowthPhase { + /// Seed planted, not yet germinated + Planted = 0, + /// Initial training epoch + Germinating = 1, + /// Active training + Growing = 2, + /// Training converged + Mature = 3, + /// Ready for deployment + Harvestable = 4, + /// Deprecated / superseded + Deprecated = 5, +} + +/// Evolution operation +#[repr(C)] +#[derive(Clone, Copy, Debug, PartialEq, Eq)] +pub enum EvolutionOp { + /// Mutation — small random change + Mutate = 0, + /// Crossover — combine two parents + Crossover = 1, + /// Selection — keep top performers + Select = 2, + /// Culling — remove worst performers + Cull = 3, + /// Reset — start fresh generation + Reset = 4, +} + +// ─── Structs ────────────────────────────────────────────────────────── + +/// Garden plot — a data container with health metrics +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct GardenPlot { + /// Plot name (null-terminated) + pub name: [c_char; MAX_NAME_LEN], + /// Plot ID + pub id: usize, + /// Health status + pub health: PlotHealth, + /// Current growth phase + pub phase: GrowthPhase, + /// Number of seeds in this plot + pub seed_count: usize, + /// Fitness score [0.0, 1.0] + pub fitness: c_double, + /// Loss value (lower is better) + pub loss: c_double, + /// Accuracy [0.0, 1.0] + pub accuracy: c_double, + /// Training epoch + pub epoch: usize, + /// Generation number + pub generation: usize, + /// Timestamp of last update (epoch seconds) + pub last_updated: c_long, + /// Tags for categorization + pub tags: [[c_char; MAX_TAG_LEN]; 4], + /// Number of active tags + pub tag_count: usize, +} + +/// Seed — model initializer +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct Seed { + /// Seed name (null-terminated) + pub name: [c_char; MAX_NAME_LEN], + /// Seed type + pub seed_type: SeedType, + /// Learning rate + pub learning_rate: c_double, + /// Batch size + pub batch_size: usize, + /// Number of layers + pub layers: usize, + /// Hidden dimension + pub hidden_dim: usize, + /// Dropout rate [0.0, 1.0] + pub dropout: c_double, + /// Weight decay + pub weight_decay: c_double, + /// Random seed for reproducibility + pub rng_seed: c_long, + /// Whether this seed is active + pub active: bool, + /// Initial fitness score + pub initial_fitness: c_double, +} + +/// Growth record — a snapshot of training progress +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct GrowthRecord { + /// Epoch number + pub epoch: usize, + /// Training loss + pub train_loss: c_double, + /// Validation loss + pub val_loss: c_double, + /// Training accuracy + pub train_accuracy: c_double, + /// Validation accuracy + pub val_accuracy: c_double, + /// Learning rate at this epoch + pub learning_rate: c_double, + /// Time elapsed in ms + pub elapsed_ms: c_long, + /// Memory usage in bytes + pub memory_bytes: usize, + /// Growth phase at this epoch + pub phase: GrowthPhase, +} + +/// Evolution entry — tracks one generation +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct EvolutionEntry { + /// Generation number + pub generation: usize, + /// Operation that created this generation + pub operation: EvolutionOp, + /// Population size + pub population_size: usize, + /// Best fitness in this generation + pub best_fitness: c_double, + /// Average fitness in this generation + pub avg_fitness: c_double, + /// Worst fitness in this generation + pub worst_fitness: c_double, + /// Diversity metric [0.0, 1.0] + pub diversity: c_double, + /// Number of elites preserved + pub elites: usize, + /// Timestamp (epoch seconds) + pub timestamp: c_long, +} + +/// Garden — top-level container for all plots +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct Garden { + /// Plots + pub plots: [GardenPlot; MAX_PLOTS], + /// Number of plots + pub plot_count: usize, + /// Current generation + pub generation: usize, + /// Best fitness across all plots + pub best_fitness: c_double, + /// Average fitness across all plots + pub avg_fitness: c_double, + /// Total number of seeds across all plots + pub total_seeds: usize, + /// Evolution history + pub evolution: [EvolutionEntry; MAX_GENERATIONS], + /// Number of evolution entries + pub evolution_count: usize, +} + +// ─── Garden Lifecycle ───────────────────────────────────────────────── + +/// Create a new empty garden +#[no_mangle] +pub extern "C" fn trios_garden_new() -> Garden { + Garden { + plots: unsafe { std::mem::zeroed() }, + plot_count: 0, + generation: 0, + best_fitness: 0.0, + avg_fitness: 0.0, + total_seeds: 0, + evolution: unsafe { std::mem::zeroed() }, + evolution_count: 0, + } +} + +/// Add a plot to the garden +#[no_mangle] +pub extern "C" fn trios_garden_add_plot(garden: *mut Garden, plot: GardenPlot) -> bool { + if garden.is_null() { + return false; + } + unsafe { + if (*garden).plot_count >= MAX_PLOTS { + return false; + } + (*garden).plots[(*garden).plot_count] = plot; + (*garden).plot_count += 1; + (*garden).total_seeds += plot.seed_count; + trios_garden_recompute_fitness(garden); + true + } +} + +/// Recompute aggregate fitness metrics +#[no_mangle] +pub extern "C" fn trios_garden_recompute_fitness(garden: *mut Garden) { + if garden.is_null() { + return; + } + unsafe { + let n = (*garden).plot_count; + if n == 0 { + (*garden).best_fitness = 0.0; + (*garden).avg_fitness = 0.0; + return; + } + let mut best = 0.0_f64; + let mut sum = 0.0_f64; + for i in 0..n { + let f = (*garden).plots[i].fitness; + if f > best { + best = f; + } + sum += f; + } + (*garden).best_fitness = best; + (*garden).avg_fitness = sum / n as c_double; + } +} + +// ─── Plot Lifecycle ─────────────────────────────────────────────────── + +/// Create a new garden plot +#[no_mangle] +pub extern "C" fn trios_garden_plot_new( + name: *const c_char, + id: usize, +) -> GardenPlot { + let mut plot: GardenPlot = unsafe { std::mem::zeroed() }; + plot.id = id; + plot.health = PlotHealth::Healthy; + plot.phase = GrowthPhase::Planted; + plot.fitness = 0.0; + plot.loss = f64::MAX; + + if !name.is_null() { + let cstr = unsafe { std::ffi::CStr::from_ptr(name) }; + let bytes = cstr.to_bytes(); + let len = bytes.len().min(MAX_NAME_LEN - 1); + plot.name[..len].copy_from_slice(unsafe { std::mem::transmute::<&[u8], &[c_char]>(&bytes[..len]) }); + plot.name[len] = 0; + } + + plot +} + +/// Update plot health based on metrics +#[no_mangle] +pub extern "C" fn trios_garden_plot_update_health(plot: *mut GardenPlot) { + if plot.is_null() { + return; + } + unsafe { + let fitness = (*plot).fitness; + let loss = (*plot).loss; + + (*plot).health = if fitness >= 0.9 && loss < 0.1 { + PlotHealth::Thriving + } else if fitness >= 0.7 && loss < 0.3 { + PlotHealth::Healthy + } else if fitness >= 0.5 && loss < 0.5 { + PlotHealth::NeedsAttention + } else if fitness >= 0.2 { + PlotHealth::Wilting + } else { + PlotHealth::Dead + }; + } +} + +/// Advance plot to next growth phase +#[no_mangle] +pub extern "C" fn trios_garden_plot_advance_phase(plot: *mut GardenPlot) -> GrowthPhase { + if plot.is_null() { + return GrowthPhase::Planted; + } + unsafe { + (*plot).phase = match (*plot).phase { + GrowthPhase::Planted => GrowthPhase::Germinating, + GrowthPhase::Germinating => GrowthPhase::Growing, + GrowthPhase::Growing => GrowthPhase::Mature, + GrowthPhase::Mature => GrowthPhase::Harvestable, + _ => (*plot).phase, + }; + (*plot).phase + } +} + +// ─── Seed Lifecycle ─────────────────────────────────────────────────── + +/// Create a new seed with default hyperparameters +#[no_mangle] +pub extern "C" fn trios_garden_seed_new( + name: *const c_char, + seed_type: SeedType, +) -> Seed { + let mut seed: Seed = unsafe { std::mem::zeroed() }; + seed.seed_type = seed_type; + seed.learning_rate = 0.001; + seed.batch_size = 32; + seed.layers = 3; + seed.hidden_dim = 256; + seed.dropout = 0.1; + seed.weight_decay = 0.0001; + seed.rng_seed = 42; + seed.active = true; + seed.initial_fitness = 0.0; + + if !name.is_null() { + let cstr = unsafe { std::ffi::CStr::from_ptr(name) }; + let bytes = cstr.to_bytes(); + let len = bytes.len().min(MAX_NAME_LEN - 1); + seed.name[..len].copy_from_slice(unsafe { std::mem::transmute::<&[u8], &[c_char]>(&bytes[..len]) }); + seed.name[len] = 0; + } + + seed +} + +// ─── Growth Tracking ────────────────────────────────────────────────── + +/// Create a growth record from training metrics +#[no_mangle] +pub extern "C" fn trios_garden_growth_record( + epoch: usize, + train_loss: c_double, + val_loss: c_double, + train_accuracy: c_double, + val_accuracy: c_double, + learning_rate: c_double, + elapsed_ms: c_long, +) -> GrowthRecord { + let phase = if epoch == 0 { + GrowthPhase::Germinating + } else if val_accuracy < 0.5 { + GrowthPhase::Growing + } else if val_accuracy < 0.9 { + GrowthPhase::Mature + } else { + GrowthPhase::Harvestable + }; + + GrowthRecord { + epoch, + train_loss, + val_loss, + train_accuracy, + val_accuracy, + learning_rate, + elapsed_ms, + memory_bytes: 0, + phase, + } +} + +/// Determine growth phase from metrics +#[no_mangle] +pub extern "C" fn trios_garden_determine_phase( + epoch: usize, + val_accuracy: c_double, + val_loss: c_double, +) -> GrowthPhase { + if epoch == 0 { + GrowthPhase::Germinating + } else if val_loss > 1.0 || val_accuracy < 0.3 { + GrowthPhase::Growing + } else if val_accuracy < 0.85 { + GrowthPhase::Mature + } else { + GrowthPhase::Harvestable + } +} + +// ─── Evolution Tracking ─────────────────────────────────────────────── + +/// Record an evolution event +#[no_mangle] +pub extern "C" fn trios_garden_record_evolution( + garden: *mut Garden, + operation: EvolutionOp, + population_size: usize, + best_fitness: c_double, + avg_fitness: c_double, + worst_fitness: c_double, + diversity: c_double, + elites: usize, + timestamp: c_long, +) -> bool { + if garden.is_null() { + return false; + } + unsafe { + if (*garden).evolution_count >= MAX_GENERATIONS { + return false; + } + let current_gen = (*garden).generation; + (*garden).evolution[(*garden).evolution_count] = EvolutionEntry { + generation: current_gen, + operation, + population_size, + best_fitness, + avg_fitness, + worst_fitness, + diversity, + elites, + timestamp, + }; + (*garden).evolution_count += 1; + (*garden).generation += 1; + true + } +} + +/// Get the best plot by fitness +#[no_mangle] +pub extern "C" fn trios_garden_best_plot(garden: *const Garden) -> usize { + if garden.is_null() { + return 0; + } + unsafe { + let mut best_idx = 0; + let mut best_fitness = -1.0_f64; + for i in 0..(*garden).plot_count { + if (*garden).plots[i].fitness > best_fitness { + best_fitness = (*garden).plots[i].fitness; + best_idx = i; + } + } + best_idx + } +} + +/// Cull plots below a fitness threshold — returns number culled +#[no_mangle] +pub extern "C" fn trios_garden_cull(garden: *mut Garden, threshold: c_double) -> usize { + if garden.is_null() { + return 0; + } + unsafe { + let mut culled = 0; + for i in 0..(*garden).plot_count { + if (*garden).plots[i].fitness < threshold { + (*garden).plots[i].health = PlotHealth::Dead; + (*garden).plots[i].phase = GrowthPhase::Deprecated; + culled += 1; + } + } + culled + } +} + +// ─── Unit Tests ─────────────────────────────────────────────────────── + +#[cfg(test)] +mod tests { + use super::*; + + #[test] + fn test_garden_new() { + let garden = trios_garden_new(); + assert_eq!(garden.plot_count, 0); + assert_eq!(garden.generation, 0); + assert_eq!(garden.best_fitness, 0.0); + } + + #[test] + fn test_plot_new() { + let plot = trios_garden_plot_new( + b"test_plot\0".as_ptr() as *const c_char, + 1, + ); + assert_eq!(plot.id, 1); + assert_eq!(plot.health, PlotHealth::Healthy); + assert_eq!(plot.phase, GrowthPhase::Planted); + } + + #[test] + fn test_plot_health_update() { + let mut plot = trios_garden_plot_new( + b"test\0".as_ptr() as *const c_char, + 0, + ); + plot.fitness = 0.95; + plot.loss = 0.05; + trios_garden_plot_update_health(&mut plot); + assert_eq!(plot.health, PlotHealth::Thriving); + + plot.fitness = 0.1; + plot.loss = 2.0; + trios_garden_plot_update_health(&mut plot); + assert_eq!(plot.health, PlotHealth::Dead); + } + + #[test] + fn test_plot_advance_phase() { + let mut plot = trios_garden_plot_new( + b"test\0".as_ptr() as *const c_char, + 0, + ); + assert_eq!(plot.phase, GrowthPhase::Planted); + trios_garden_plot_advance_phase(&mut plot); + assert_eq!(plot.phase, GrowthPhase::Germinating); + trios_garden_plot_advance_phase(&mut plot); + assert_eq!(plot.phase, GrowthPhase::Growing); + } + + #[test] + fn test_seed_new() { + let seed = trios_garden_seed_new( + b"model_v1\0".as_ptr() as *const c_char, + SeedType::NeuralNet, + ); + assert_eq!(seed.seed_type, SeedType::NeuralNet); + assert_eq!(seed.learning_rate, 0.001); + assert_eq!(seed.batch_size, 32); + assert!(seed.active); + } + + #[test] + fn test_garden_add_plot() { + let mut garden = trios_garden_new(); + let plot = trios_garden_plot_new( + b"plot1\0".as_ptr() as *const c_char, + 0, + ); + assert!(trios_garden_add_plot(&mut garden, plot)); + assert_eq!(garden.plot_count, 1); + } + + #[test] + fn test_growth_record() { + let record = trios_garden_growth_record( + 10, 0.5, 0.6, 0.8, 0.75, 0.001, 5000, + ); + assert_eq!(record.epoch, 10); + assert_eq!(record.train_loss, 0.5); + } + + #[test] + fn test_determine_phase() { + assert_eq!(trios_garden_determine_phase(0, 0.0, 1.0), GrowthPhase::Germinating); + assert_eq!(trios_garden_determine_phase(5, 0.2, 2.0), GrowthPhase::Growing); + assert_eq!(trios_garden_determine_phase(50, 0.8, 0.3), GrowthPhase::Mature); + assert_eq!(trios_garden_determine_phase(100, 0.95, 0.05), GrowthPhase::Harvestable); + } + + #[test] + fn test_cull() { + let mut garden = trios_garden_new(); + let mut plot1 = trios_garden_plot_new(b"good\0".as_ptr() as *const c_char, 0); + plot1.fitness = 0.9; + let mut plot2 = trios_garden_plot_new(b"bad\0".as_ptr() as *const c_char, 1); + plot2.fitness = 0.1; + + trios_garden_add_plot(&mut garden, plot1); + trios_garden_add_plot(&mut garden, plot2); + + let culled = trios_garden_cull(&mut garden, 0.5); + assert_eq!(culled, 1); + assert_eq!(garden.plots[0].health, PlotHealth::Healthy); + assert_eq!(garden.plots[1].health, PlotHealth::Dead); + } +} diff --git a/crates/trios-hdc/vendor/zig-hdc b/crates/trios-hdc/vendor/zig-hdc new file mode 160000 index 0000000000..27bb44aa4f --- /dev/null +++ b/crates/trios-hdc/vendor/zig-hdc @@ -0,0 +1 @@ +Subproject commit 27bb44aa4f2cee144c1fe03639187bc4521110f7 diff --git a/crates/trios-http/build.rs b/crates/trios-http/build.rs new file mode 100644 index 0000000000..8d4fbc6f16 --- /dev/null +++ b/crates/trios-http/build.rs @@ -0,0 +1,10 @@ +fn main() { + let crate_dir = std::env::var("CARGO_MANIFEST_DIR").unwrap(); + + cbindgen::Builder::new() + .with_crate(&crate_dir) + .with_language(cbindgen::Language::C) + .generate() + .expect("Unable to generate bindings") + .write_to_file(format!("{}/include/trios_http.h", crate_dir)); +} diff --git a/crates/trios-http/include/.gitkeep b/crates/trios-http/include/.gitkeep new file mode 100644 index 0000000000..e69de29bb2 diff --git a/crates/trios-http/include/trios_http.h b/crates/trios-http/include/trios_http.h new file mode 100644 index 0000000000..d964666c8d --- /dev/null +++ b/crates/trios-http/include/trios_http.h @@ -0,0 +1,332 @@ +#include +#include +#include +#include + +/** + * Maximum URL length + */ +#define MAX_URL_LEN 2048 + +/** + * Maximum header name length + */ +#define MAX_HEADER_NAME_LEN 128 + +/** + * Maximum header value length + */ +#define MAX_HEADER_VALUE_LEN 1024 + +/** + * Maximum number of headers per request + */ +#define MAX_HEADERS 32 + +/** + * Maximum body size (1 MB) + */ +#define MAX_BODY_SIZE (1024 * 1024) + +/** + * Default HTTP port + */ +#define DEFAULT_HTTP_PORT 80 + +/** + * Default HTTPS port + */ +#define DEFAULT_HTTPS_PORT 443 + +/** + * Default connection timeout in milliseconds + */ +#define DEFAULT_TIMEOUT_MS 30000 + +/** + * Default max redirects + */ +#define DEFAULT_MAX_REDIRECTS 10 + +/** + * Content type + */ +typedef enum ContentType { + /** + * application/json + */ + Json = 0, + /** + * application/octet-stream + */ + Binary = 1, + /** + * text/plain + */ + Text = 2, + /** + * application/x-www-form-urlencoded + */ + FormUrlencoded = 3, + /** + * multipart/form-data + */ + Multipart = 4, + /** + * applicationprotobuf + */ + Protobuf = 5, + /** + * Custom/unknown + */ + Custom = 6, +} ContentType; + +/** + * HTTP methods + */ +typedef enum HttpMethod { + Get = 0, + Post = 1, + Put = 2, + Delete = 3, + Patch = 4, + Head = 5, + Options = 6, + Trace = 7, +} HttpMethod; + +/** + * HTTP status code categories + */ +typedef enum HttpStatusCategory { + /** + * 1xx — Informational + */ + Informational = 1, + /** + * 2xx — Success + */ + Success = 2, + /** + * 3xx — Redirection + */ + Redirection = 3, + /** + * 4xx — Client Error + */ + ClientError = 4, + /** + * 5xx — Server Error + */ + ServerError = 5, +} HttpStatusCategory; + +/** + * URL scheme + */ +typedef enum UrlScheme { + Http = 0, + Https = 1, + Ws = 2, + Wss = 3, +} UrlScheme; + +/** + * Parsed URL components + */ +typedef struct UrlParts { + /** + * Full URL (null-terminated) + */ + char url[MAX_URL_LEN]; + /** + * Scheme + */ + enum UrlScheme scheme; + /** + * Host (null-terminated) + */ + char host[256]; + /** + * Port number + */ + uint16_t port; + /** + * Path (null-terminated) + */ + char path[1024]; + /** + * Query string (null-terminated, without '?') + */ + char query[1024]; + /** + * Fragment (null-terminated, without '#') + */ + char fragment[256]; + /** + * Whether parsing succeeded + */ + bool valid; +} UrlParts; + +/** + * HTTP header entry + */ +typedef struct HttpHeader { + /** + * Header name (null-terminated, lowercase) + */ + char name[MAX_HEADER_NAME_LEN]; + /** + * Header value (null-terminated) + */ + char value[MAX_HEADER_VALUE_LEN]; +} HttpHeader; + +/** + * HTTP request + */ +typedef struct HttpRequest { + /** + * HTTP method + */ + enum HttpMethod method; + /** + * Parsed URL + */ + struct UrlParts url; + /** + * Headers + */ + struct HttpHeader headers[MAX_HEADERS]; + /** + * Number of headers + */ + uintptr_t header_count; + /** + * Body data pointer + */ + uint8_t *body; + /** + * Body length + */ + uintptr_t body_len; + /** + * Content type + */ + enum ContentType content_type; + /** + * Connection timeout in ms + */ + long timeout_ms; + /** + * Max redirects + */ + int max_redirects; + /** + * Whether to follow redirects + */ + bool follow_redirects; +} HttpRequest; + +/** + * Connection pool configuration + */ +typedef struct ConnectionPoolConfig { + /** + * Maximum number of connections per host + */ + uintptr_t max_connections_per_host; + /** + * Maximum total connections + */ + uintptr_t max_total_connections; + /** + * Connection idle timeout in ms + */ + long idle_timeout_ms; + /** + * Whether to enable TCP keepalive + */ + bool keepalive; + /** + * Keepalive interval in ms + */ + long keepalive_interval_ms; +} ConnectionPoolConfig; + +/** + * Trinity node endpoint + */ +typedef struct TrinityEndpoint { + /** + * Node host (null-terminated) + */ + char host[256]; + /** + * Node port + */ + uint16_t port; + /** + * Node ID (null-terminated) + */ + char node_id[64]; + /** + * Whether the node is healthy + */ + bool healthy; + /** + * Last response latency in ms + */ + long latency_ms; + /** + * Request count + */ + unsigned long request_count; +} TrinityEndpoint; + +/** + * Parse a URL string into components + */ +struct UrlParts trios_http_parse_url(const char *url_str); + +/** + * Create a new HTTP request with the given method and URL + */ +struct HttpRequest trios_http_request_new(enum HttpMethod method, const char *url_str); + +/** + * Add a header to an HTTP request + */ +bool trios_http_request_add_header(struct HttpRequest *req, const char *name, const char *value); + +/** + * Set request body + */ +void trios_http_request_set_body(struct HttpRequest *req, + const uint8_t *body, + uintptr_t body_len, + enum ContentType content_type); + +/** + * Get status code category from numeric code + */ +enum HttpStatusCategory trios_http_status_category(int code); + +/** + * Check if status code indicates success (2xx) + */ +bool trios_http_is_success(int status_code); + +/** + * Create a default connection pool config + */ +struct ConnectionPoolConfig trios_http_pool_config_default(void); + +/** + * Create a Trinity endpoint from host and port + */ +struct TrinityEndpoint trios_http_endpoint_new(const char *host, + uint16_t port, + const char *node_id); diff --git a/crates/trios-http/src/lib.rs b/crates/trios-http/src/lib.rs new file mode 100644 index 0000000000..fcdb2e0d30 --- /dev/null +++ b/crates/trios-http/src/lib.rs @@ -0,0 +1,543 @@ +//! TRIOS HTTP — HTTP Client/Server FFI for Trinity Network +//! +//! This crate provides FFI bindings for TRIOS HTTP operations including +//! request/response handling, URL parsing, header management, and +//! connection pooling for the Trinity distributed network. +//! +//! ## Features +//! +//! - **HTTP Methods**: GET, POST, PUT, DELETE, PATCH, HEAD, OPTIONS +//! - **URL Parsing**: Scheme, host, port, path, query, fragment +//! - **Header Management**: Key-value header pairs with normalization +//! - **Request Builder**: Fluent API for constructing HTTP requests +//! - **Response Handling**: Status codes, headers, body access +//! - **Connection Pool**: Reusable connections for Trinity nodes +//! +//! ## Symbol: `🌐` + +use std::os::raw::{c_char, c_int, c_long, c_ulong}; + +// ─── Constants ──────────────────────────────────────────────────────── + +/// Maximum URL length +pub const MAX_URL_LEN: usize = 2048; + +/// Maximum header name length +pub const MAX_HEADER_NAME_LEN: usize = 128; + +/// Maximum header value length +pub const MAX_HEADER_VALUE_LEN: usize = 1024; + +/// Maximum number of headers per request +pub const MAX_HEADERS: usize = 32; + +/// Maximum body size (1 MB) +pub const MAX_BODY_SIZE: usize = 1024 * 1024; + +/// Default HTTP port +pub const DEFAULT_HTTP_PORT: u16 = 80; + +/// Default HTTPS port +pub const DEFAULT_HTTPS_PORT: u16 = 443; + +/// Default connection timeout in milliseconds +pub const DEFAULT_TIMEOUT_MS: c_long = 30_000; + +/// Default max redirects +pub const DEFAULT_MAX_REDIRECTS: c_int = 10; + +// ─── Enums ──────────────────────────────────────────────────────────── + +/// HTTP methods +#[repr(C)] +#[derive(Clone, Copy, Debug, PartialEq, Eq)] +pub enum HttpMethod { + Get = 0, + Post = 1, + Put = 2, + Delete = 3, + Patch = 4, + Head = 5, + Options = 6, + Trace = 7, +} + +/// HTTP status code categories +#[repr(C)] +#[derive(Clone, Copy, Debug, PartialEq, Eq)] +pub enum HttpStatusCategory { + /// 1xx — Informational + Informational = 1, + /// 2xx — Success + Success = 2, + /// 3xx — Redirection + Redirection = 3, + /// 4xx — Client Error + ClientError = 4, + /// 5xx — Server Error + ServerError = 5, +} + +/// URL scheme +#[repr(C)] +#[derive(Clone, Copy, Debug, PartialEq, Eq)] +pub enum UrlScheme { + Http = 0, + Https = 1, + Ws = 2, + Wss = 3, +} + +/// Content type +#[repr(C)] +#[derive(Clone, Copy, Debug, PartialEq, Eq)] +pub enum ContentType { + /// application/json + Json = 0, + /// application/octet-stream + Binary = 1, + /// text/plain + Text = 2, + /// application/x-www-form-urlencoded + FormUrlencoded = 3, + /// multipart/form-data + Multipart = 4, + /// applicationprotobuf + Protobuf = 5, + /// Custom/unknown + Custom = 6, +} + +// ─── Structs ────────────────────────────────────────────────────────── + +/// HTTP header entry +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct HttpHeader { + /// Header name (null-terminated, lowercase) + pub name: [c_char; MAX_HEADER_NAME_LEN], + /// Header value (null-terminated) + pub value: [c_char; MAX_HEADER_VALUE_LEN], +} + +/// Parsed URL components +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct UrlParts { + /// Full URL (null-terminated) + pub url: [c_char; MAX_URL_LEN], + /// Scheme + pub scheme: UrlScheme, + /// Host (null-terminated) + pub host: [c_char; 256], + /// Port number + pub port: u16, + /// Path (null-terminated) + pub path: [c_char; 1024], + /// Query string (null-terminated, without '?') + pub query: [c_char; 1024], + /// Fragment (null-terminated, without '#') + pub fragment: [c_char; 256], + /// Whether parsing succeeded + pub valid: bool, +} + +/// HTTP request +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct HttpRequest { + /// HTTP method + pub method: HttpMethod, + /// Parsed URL + pub url: UrlParts, + /// Headers + pub headers: [HttpHeader; MAX_HEADERS], + /// Number of headers + pub header_count: usize, + /// Body data pointer + pub body: *mut u8, + /// Body length + pub body_len: usize, + /// Content type + pub content_type: ContentType, + /// Connection timeout in ms + pub timeout_ms: c_long, + /// Max redirects + pub max_redirects: c_int, + /// Whether to follow redirects + pub follow_redirects: bool, +} + +/// HTTP response +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct HttpResponse { + /// HTTP status code (200, 404, etc.) + pub status_code: c_int, + /// Status category + pub status_category: HttpStatusCategory, + /// Headers + pub headers: [HttpHeader; MAX_HEADERS], + /// Number of response headers + pub header_count: usize, + /// Body data pointer + pub body: *mut u8, + /// Body length + pub body_len: usize, + /// Content type + pub content_type: ContentType, + /// Response time in milliseconds + pub elapsed_ms: c_long, + /// Whether the request succeeded + pub success: bool, +} + +/// Connection pool configuration +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct ConnectionPoolConfig { + /// Maximum number of connections per host + pub max_connections_per_host: usize, + /// Maximum total connections + pub max_total_connections: usize, + /// Connection idle timeout in ms + pub idle_timeout_ms: c_long, + /// Whether to enable TCP keepalive + pub keepalive: bool, + /// Keepalive interval in ms + pub keepalive_interval_ms: c_long, +} + +/// Trinity node endpoint +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct TrinityEndpoint { + /// Node host (null-terminated) + pub host: [c_char; 256], + /// Node port + pub port: u16, + /// Node ID (null-terminated) + pub node_id: [c_char; 64], + /// Whether the node is healthy + pub healthy: bool, + /// Last response latency in ms + pub latency_ms: c_long, + /// Request count + pub request_count: c_ulong, +} + +// ─── URL Parsing ────────────────────────────────────────────────────── + +/// Parse a URL string into components +#[no_mangle] +pub extern "C" fn trios_http_parse_url(url_str: *const c_char) -> UrlParts { + let mut parts: UrlParts = unsafe { std::mem::zeroed() }; + parts.valid = false; + + if url_str.is_null() { + return parts; + } + + let url_cstr = unsafe { std::ffi::CStr::from_ptr(url_str) }; + let url_bytes = url_cstr.to_bytes(); + + if url_bytes.len() >= MAX_URL_LEN { + return parts; + } + + // Copy full URL + copy_str_to_buf(url_bytes, &mut parts.url); + + let url_str_inner = match std::str::from_utf8(url_bytes) { + Ok(s) => s, + Err(_) => return parts, + }; + + // Parse scheme + if let Some(rest) = url_str_inner.strip_prefix("https://") { + parts.scheme = UrlScheme::Https; + parts.port = DEFAULT_HTTPS_PORT; + parse_host_path(rest, &mut parts); + } else if let Some(rest) = url_str_inner.strip_prefix("http://") { + parts.scheme = UrlScheme::Http; + parts.port = DEFAULT_HTTP_PORT; + parse_host_path(rest, &mut parts); + } else if let Some(rest) = url_str_inner.strip_prefix("wss://") { + parts.scheme = UrlScheme::Wss; + parts.port = 443; + parse_host_path(rest, &mut parts); + } else if let Some(rest) = url_str_inner.strip_prefix("ws://") { + parts.scheme = UrlScheme::Ws; + parts.port = 80; + parse_host_path(rest, &mut parts); + } else { + return parts; + } + + parts.valid = true; + parts +} + +/// Internal: parse host[:port]/path?query#fragment +fn parse_host_path(input: &str, parts: &mut UrlParts) { + let (host_port, rest) = match input.find('/') { + Some(idx) => (&input[..idx], &input[idx..]), + None => (input, "/"), + }; + + // Split host:port + if let Some(colon_pos) = host_port.rfind(':') { + copy_str_to_buf(host_port[..colon_pos].as_bytes(), &mut parts.host); + if let Ok(port) = host_port[colon_pos + 1..].parse::() { + parts.port = port; + } + } else { + copy_str_to_buf(host_port.as_bytes(), &mut parts.host); + } + + // Split path?query#fragment + let (path_and_query, fragment) = match rest.find('#') { + Some(idx) => (&rest[..idx], &rest[idx + 1..]), + None => (rest, ""), + }; + copy_str_to_buf(fragment.as_bytes(), &mut parts.fragment); + + let (path, query) = match path_and_query.find('?') { + Some(idx) => (&path_and_query[..idx], &path_and_query[idx + 1..]), + None => (path_and_query, ""), + }; + copy_str_to_buf(path.as_bytes(), &mut parts.path); + copy_str_to_buf(query.as_bytes(), &mut parts.query); +} + +/// Copy a byte slice into a fixed-size buffer, null-terminating +fn copy_str_to_buf(src: &[u8], dst: &mut [c_char; N]) { + let len = src.len().min(N - 1); + dst[..len].copy_from_slice(unsafe { std::mem::transmute::<&[u8], &[c_char]>(&src[..len]) }); + dst[len] = 0; +} + +// ─── Request Construction ───────────────────────────────────────────── + +/// Create a new HTTP request with the given method and URL +#[no_mangle] +pub extern "C" fn trios_http_request_new( + method: HttpMethod, + url_str: *const c_char, +) -> HttpRequest { + let mut req: HttpRequest = unsafe { std::mem::zeroed() }; + req.method = method; + req.url = trios_http_parse_url(url_str); + req.content_type = ContentType::Binary; + req.timeout_ms = DEFAULT_TIMEOUT_MS; + req.max_redirects = DEFAULT_MAX_REDIRECTS; + req.follow_redirects = true; + req +} + +/// Add a header to an HTTP request +#[no_mangle] +pub extern "C" fn trios_http_request_add_header( + req: *mut HttpRequest, + name: *const c_char, + value: *const c_char, +) -> bool { + if req.is_null() || name.is_null() || value.is_null() { + return false; + } + unsafe { + if (*req).header_count >= MAX_HEADERS { + return false; + } + let header = &mut (*req).headers[(*req).header_count]; + + let name_cstr = std::ffi::CStr::from_ptr(name); + let name_bytes = name_cstr.to_bytes(); + let name_len = name_bytes.len().min(MAX_HEADER_NAME_LEN - 1); + header.name[..name_len].copy_from_slice( + std::mem::transmute::<&[u8], &[c_char]>(&name_bytes[..name_len]), + ); + header.name[name_len] = 0; + + let val_cstr = std::ffi::CStr::from_ptr(value); + let val_bytes = val_cstr.to_bytes(); + let val_len = val_bytes.len().min(MAX_HEADER_VALUE_LEN - 1); + header.value[..val_len].copy_from_slice( + std::mem::transmute::<&[u8], &[c_char]>(&val_bytes[..val_len]), + ); + header.value[val_len] = 0; + + (*req).header_count += 1; + true + } +} + +/// Set request body +#[no_mangle] +pub extern "C" fn trios_http_request_set_body( + req: *mut HttpRequest, + body: *const u8, + body_len: usize, + content_type: ContentType, +) { + if req.is_null() { + return; + } + unsafe { + (*req).body = body as *mut u8; + (*req).body_len = body_len.min(MAX_BODY_SIZE); + (*req).content_type = content_type; + } +} + +// ─── Response Utilities ─────────────────────────────────────────────── + +/// Get status code category from numeric code +#[no_mangle] +pub extern "C" fn trios_http_status_category(code: c_int) -> HttpStatusCategory { + match code / 100 { + 1 => HttpStatusCategory::Informational, + 2 => HttpStatusCategory::Success, + 3 => HttpStatusCategory::Redirection, + 4 => HttpStatusCategory::ClientError, + 5 => HttpStatusCategory::ServerError, + _ => HttpStatusCategory::ServerError, + } +} + +/// Check if status code indicates success (2xx) +#[no_mangle] +pub extern "C" fn trios_http_is_success(status_code: c_int) -> bool { + status_code >= 200 && status_code < 300 +} + +/// Create a default connection pool config +#[no_mangle] +pub extern "C" fn trios_http_pool_config_default() -> ConnectionPoolConfig { + ConnectionPoolConfig { + max_connections_per_host: 4, + max_total_connections: 16, + idle_timeout_ms: 60_000, + keepalive: true, + keepalive_interval_ms: 30_000, + } +} + +/// Create a Trinity endpoint from host and port +#[no_mangle] +pub extern "C" fn trios_http_endpoint_new( + host: *const c_char, + port: u16, + node_id: *const c_char, +) -> TrinityEndpoint { + let mut ep: TrinityEndpoint = unsafe { std::mem::zeroed() }; + ep.port = port; + ep.healthy = true; + + if !host.is_null() { + let cstr = unsafe { std::ffi::CStr::from_ptr(host) }; + let bytes = cstr.to_bytes(); + let len = bytes.len().min(255); + ep.host[..len].copy_from_slice(unsafe { std::mem::transmute::<&[u8], &[c_char]>(&bytes[..len]) }); + ep.host[len] = 0; + } + + if !node_id.is_null() { + let cstr = unsafe { std::ffi::CStr::from_ptr(node_id) }; + let bytes = cstr.to_bytes(); + let len = bytes.len().min(63); + ep.node_id[..len].copy_from_slice(unsafe { std::mem::transmute::<&[u8], &[c_char]>(&bytes[..len]) }); + ep.node_id[len] = 0; + } + + ep +} + +// ─── Unit Tests ─────────────────────────────────────────────────────── + +#[cfg(test)] +mod tests { + use super::*; + + #[test] + fn test_parse_http_url() { + let url = trios_http_parse_url(b"http://example.com:8080/path?q=1#frag\0".as_ptr() as *const c_char); + assert!(url.valid); + assert_eq!(url.scheme, UrlScheme::Http); + assert_eq!(url.port, 8080); + } + + #[test] + fn test_parse_https_url() { + let url = trios_http_parse_url(b"https://api.trinity.ai/v1/nodes\0".as_ptr() as *const c_char); + assert!(url.valid); + assert_eq!(url.scheme, UrlScheme::Https); + assert_eq!(url.port, DEFAULT_HTTPS_PORT); + } + + #[test] + fn test_parse_null_url() { + let url = trios_http_parse_url(std::ptr::null()); + assert!(!url.valid); + } + + #[test] + fn test_status_category() { + assert_eq!(trios_http_status_category(200), HttpStatusCategory::Success); + assert_eq!(trios_http_status_category(404), HttpStatusCategory::ClientError); + assert_eq!(trios_http_status_category(500), HttpStatusCategory::ServerError); + assert_eq!(trios_http_status_category(301), HttpStatusCategory::Redirection); + } + + #[test] + fn test_is_success() { + assert!(trios_http_is_success(200)); + assert!(trios_http_is_success(204)); + assert!(!trios_http_is_success(404)); + assert!(!trios_http_is_success(500)); + } + + #[test] + fn test_request_new() { + let req = trios_http_request_new( + HttpMethod::Get, + b"https://example.com\0".as_ptr() as *const c_char, + ); + assert_eq!(req.method, HttpMethod::Get); + assert!(req.url.valid); + assert_eq!(req.timeout_ms, DEFAULT_TIMEOUT_MS); + } + + #[test] + fn test_add_header() { + let mut req = trios_http_request_new( + HttpMethod::Post, + b"https://example.com\0".as_ptr() as *const c_char, + ); + assert!(trios_http_request_add_header( + &mut req, + b"Content-Type\0".as_ptr() as *const c_char, + b"application/json\0".as_ptr() as *const c_char, + )); + assert_eq!(req.header_count, 1); + } + + #[test] + fn test_pool_config_default() { + let config = trios_http_pool_config_default(); + assert_eq!(config.max_connections_per_host, 4); + assert_eq!(config.max_total_connections, 16); + assert!(config.keepalive); + } + + #[test] + fn test_endpoint_new() { + let ep = trios_http_endpoint_new( + b"node1.trinity.ai\0".as_ptr() as *const c_char, + 443, + b"abc123\0".as_ptr() as *const c_char, + ); + assert_eq!(ep.port, 443); + assert!(ep.healthy); + } +} diff --git a/crates/trios-hybrid/build.rs b/crates/trios-hybrid/build.rs new file mode 100644 index 0000000000..7665c02ade --- /dev/null +++ b/crates/trios-hybrid/build.rs @@ -0,0 +1,11 @@ +fn main() { + // Generate C bindings using cbindgen + let crate_dir = std::env::var("CARGO_MANIFEST_DIR").unwrap(); + + cbindgen::Builder::new() + .with_crate(&crate_dir) + .with_language(cbindgen::Language::C) + .generate() + .expect("Unable to generate bindings") + .write_to_file(format!("{}/include/trios_hybrid.h", crate_dir)); +} diff --git a/crates/trios-hybrid/include/trios_hybrid.h b/crates/trios-hybrid/include/trios_hybrid.h new file mode 100644 index 0000000000..5caa6acbb3 --- /dev/null +++ b/crates/trios-hybrid/include/trios_hybrid.h @@ -0,0 +1,278 @@ +#include +#include +#include +#include + +/** + * Maximum trits for BigInt (supports numbers up to 3^256 ≈ 10^122) + */ +#define MAX_TRITS 256 + +/** + * SIMD width for trit operations + */ +#define SIMD_WIDTH 32 + +/** + * Storage mode for HybridBigInt + */ +typedef enum HybridStorageMode { + /** + * Dense storage (one trit per byte) + */ + Dense = 0, + /** + * Packed storage (2 trits per byte) + */ + Packed = 1, + /** + * Hybrid storage (chunks of packed + dense) + */ + Hybrid = 2, +} HybridStorageMode; + +/** + * Trit value: -1, 0, or +1 + */ +typedef int8_t Trit; + +/** + * HybridBigInt — arbitrary precision balanced ternary number + */ +typedef struct HybridBigInt { + /** + * Trit data + */ + Trit *data; + /** + * Number of trits + */ + uintptr_t len; + /** + * Capacity + */ + uintptr_t capacity; + /** + * Storage mode + */ + enum HybridStorageMode mode; + /** + * Sign (-1, 0, +1) + */ + int8_t sign; +} HybridBigInt; + +/** + * BigInt operation result + */ +typedef struct BigIntResult { + /** + * Result value + */ + struct HybridBigInt value; + /** + * Overflow flag + */ + bool overflow; + /** + * Success flag + */ + bool success; +} BigIntResult; + +/** + * Packed trit buffer (2 trits per byte) + */ +typedef struct PackedTritBuffer { + /** + * Packed data (each byte = 2 trits) + */ + uint8_t *data; + /** + * Number of bytes + */ + uintptr_t len; + /** + * Number of trits (may be odd) + */ + uintptr_t trit_count; +} PackedTritBuffer; + +/** + * Trit values + */ +#define TRIT_NEGATIVE -1 + +#define TRIT_ZERO 0 + +#define TRIT_POSITIVE 1 + +/** + * Create a new HybridBigInt + */ +struct HybridBigInt *trios_hybrid_bigint_new(uintptr_t capacity); + +/** + * Create a HybridBigInt from i64 + */ +struct HybridBigInt *trios_hybrid_bigint_from_i64(long long value); + +/** + * Convert HybridBigInt to i64 + */ +long long trios_hybrid_bigint_to_i64(const struct HybridBigInt *bigint); + +/** + * Free a HybridBigInt + */ +void trios_hybrid_bigint_free(struct HybridBigInt *bigint); + +/** + * Clone a HybridBigInt + */ +struct HybridBigInt *trios_hybrid_bigint_clone(const struct HybridBigInt *bigint); + +/** + * Get number of trits + */ +uintptr_t trios_hybrid_bigint_len(const struct HybridBigInt *bigint); + +/** + * Get storage mode + */ +enum HybridStorageMode trios_hybrid_bigint_mode(const struct HybridBigInt *bigint); + +/** + * Add two BigInts + */ +int trios_hybrid_bigint_add(const struct HybridBigInt *a, + const struct HybridBigInt *b, + struct BigIntResult *result); + +/** + * Subtract two BigInts (a - b) + */ +int trios_hybrid_bigint_sub(const struct HybridBigInt *a, + const struct HybridBigInt *b, + struct BigIntResult *result); + +/** + * Multiply two BigInts + */ +int trios_hybrid_bigint_mul(const struct HybridBigInt *a, + const struct HybridBigInt *b, + struct BigIntResult *result); + +/** + * Divide two BigInts (a / b) + */ +int trios_hybrid_bigint_div(const struct HybridBigInt *a, + const struct HybridBigInt *b, + struct BigIntResult *quotient, + struct BigIntResult *remainder); + +/** + * Compare two BigInts + * + * Returns: -1 if a < b, 0 if a == b, 1 if a > b + */ +int trios_hybrid_bigint_cmp(const struct HybridBigInt *a, const struct HybridBigInt *b); + +/** + * Check if BigInt is zero + */ +bool trios_hybrid_bigint_is_zero(const struct HybridBigInt *bigint); + +/** + * Check if BigInt is negative + */ +bool trios_hybrid_bigint_is_negative(const struct HybridBigInt *bigint); + +/** + * Negate a BigInt + */ +int trios_hybrid_bigint_neg(const struct HybridBigInt *bigint, struct BigIntResult *result); + +/** + * Absolute value of BigInt + */ +int trios_hybrid_bigint_abs(const struct HybridBigInt *bigint, struct BigIntResult *result); + +/** + * Left shift (multiply by 3^n) + */ +int trios_hybrid_bigint_shl(const struct HybridBigInt *bigint, + uintptr_t _n, + struct BigIntResult *result); + +/** + * Right shift (divide by 3^n) + */ +int trios_hybrid_bigint_shr(const struct HybridBigInt *bigint, + uintptr_t _n, + struct BigIntResult *result); + +/** + * Create a packed trit buffer + */ +struct PackedTritBuffer *trios_hybrid_packed_new(uintptr_t _trit_count); + +/** + * Free a packed trit buffer + */ +void trios_hybrid_packed_free(struct PackedTritBuffer *buffer); + +/** + * Encode dense trits to packed format + */ +int trios_hybrid_encode_pack(const Trit *trits, + uintptr_t trit_count, + struct PackedTritBuffer *packed); + +/** + * Decode packed trits to dense format + */ +int trios_hybrid_decode_pack(const struct PackedTritBuffer *packed, + Trit *trits, + uintptr_t trit_count); + +/** + * Get packed buffer trit count + */ +uintptr_t trios_hybrid_packed_trit_count(const struct PackedTritBuffer *buffer); + +/** + * Get packed buffer byte count + */ +uintptr_t trios_hybrid_packed_byte_count(const struct PackedTritBuffer *buffer); + +/** + * Convert BigInt to packed format + */ +int trios_hybrid_bigint_to_packed(const struct HybridBigInt *bigint, + struct PackedTritBuffer *packed); + +/** + * Convert packed format to BigInt + */ +struct HybridBigInt *trios_hybrid_bigint_from_packed(const struct PackedTritBuffer *packed); + +/** + * Set storage mode + */ +int trios_hybrid_bigint_set_mode(struct HybridBigInt *bigint, enum HybridStorageMode mode); + +/** + * Get last error message + */ +const char *trios_hybrid_last_error(void); + +/** + * Get version + */ +const char *trios_hybrid_version(void); + +/** + * Get build info + */ +const char *trios_hybrid_build_info(void); diff --git a/crates/trios-hybrid/src/lib.rs b/crates/trios-hybrid/src/lib.rs new file mode 100644 index 0000000000..bd9e69d64a --- /dev/null +++ b/crates/trios-hybrid/src/lib.rs @@ -0,0 +1,523 @@ +//! TRIOS Hybrid — Hybrid BigInt and Packed Trit FFI +//! +//! This crate provides FFI bindings for TRIOS Hybrid BigInt operations +//! and packed trit encoding/decoding. +//! +//! ## Features +//! +//! - **HybridBigInt**: Arbitrary precision balanced ternary arithmetic +//! - **Packed Trits**: Space-efficient trit encoding +//! - **BigInt Operations**: add, subtract, multiply, division +//! - **Conversions**: i64 ↔ BigInt, packed ↔ dense +//! +//! ## Symbol: `∓` +//! +//! ## Balanced Ternary Representation +//! +//! Each trit has value {-1, 0, +1}. A number is represented as: +//! ``` +//! N = Σ(trit[i] × 3^i) for i = 0..n-1 +//! ``` +//! +//! No separate sign bit is needed — the sign is inherent in the representation. + +use std::os::raw::{c_char, c_int, c_longlong}; +use std::ptr; + +/// Trit value: -1, 0, or +1 +pub type Trit = i8; + +/// Trit values +pub const TRIT_NEGATIVE: Trit = -1; +pub const TRIT_ZERO: Trit = 0; +pub const TRIT_POSITIVE: Trit = 1; + +/// Maximum trits for BigInt (supports numbers up to 3^256 ≈ 10^122) +pub const MAX_TRITS: usize = 256; + +/// SIMD width for trit operations +pub const SIMD_WIDTH: usize = 32; + +/// Storage mode for HybridBigInt +#[repr(C)] +#[derive(Clone, Copy, Debug, PartialEq, Eq)] +pub enum HybridStorageMode { + /// Dense storage (one trit per byte) + Dense = 0, + /// Packed storage (2 trits per byte) + Packed = 1, + /// Hybrid storage (chunks of packed + dense) + Hybrid = 2, +} + +/// HybridBigInt — arbitrary precision balanced ternary number +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct HybridBigInt { + /// Trit data + pub data: *mut Trit, + /// Number of trits + pub len: usize, + /// Capacity + pub capacity: usize, + /// Storage mode + pub mode: HybridStorageMode, + /// Sign (-1, 0, +1) + pub sign: i8, +} + +/// Packed trit buffer (2 trits per byte) +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct PackedTritBuffer { + /// Packed data (each byte = 2 trits) + pub data: *mut u8, + /// Number of bytes + pub len: usize, + /// Number of trits (may be odd) + pub trit_count: usize, +} + +/// BigInt operation result +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct BigIntResult { + /// Result value + pub value: HybridBigInt, + /// Overflow flag + pub overflow: bool, + /// Success flag + pub success: bool, +} + +/// Create a new HybridBigInt +#[no_mangle] +pub extern "C" fn trios_hybrid_bigint_new(capacity: usize) -> *mut HybridBigInt { + let _ = capacity; + // TODO: Allocate BigInt in Zig + ptr::null_mut() +} + +/// Create a HybridBigInt from i64 +#[no_mangle] +pub extern "C" fn trios_hybrid_bigint_from_i64(value: c_longlong) -> *mut HybridBigInt { + let _ = value; + // TODO: Call Zig fromI64 + ptr::null_mut() +} + +/// Convert HybridBigInt to i64 +#[no_mangle] +pub extern "C" fn trios_hybrid_bigint_to_i64(bigint: *const HybridBigInt) -> c_longlong { + if bigint.is_null() { + return 0; + } + // TODO: Call Zig toI64 + 0 +} + +/// Free a HybridBigInt +#[no_mangle] +pub extern "C" fn trios_hybrid_bigint_free(bigint: *mut HybridBigInt) { + if !bigint.is_null() { + unsafe { + if !(*bigint).data.is_null() { + // TODO: Free data in Zig allocator + } + // TODO: Free BigInt struct + } + } +} + +/// Clone a HybridBigInt +#[no_mangle] +pub extern "C" fn trios_hybrid_bigint_clone( + bigint: *const HybridBigInt, +) -> *mut HybridBigInt { + if bigint.is_null() { + return ptr::null_mut(); + } + // TODO: Call Zig clone operation + ptr::null_mut() +} + +/// Get number of trits +#[no_mangle] +pub unsafe extern "C" fn trios_hybrid_bigint_len(bigint: *const HybridBigInt) -> usize { + if bigint.is_null() { + 0 + } else { + (*bigint).len + } +} + +/// Get storage mode +#[no_mangle] +pub unsafe extern "C" fn trios_hybrid_bigint_mode(bigint: *const HybridBigInt) -> HybridStorageMode { + if bigint.is_null() { + HybridStorageMode::Dense + } else { + (*bigint).mode + } +} + +/// Add two BigInts +#[no_mangle] +pub extern "C" fn trios_hybrid_bigint_add( + a: *const HybridBigInt, + b: *const HybridBigInt, + result: *mut BigIntResult, +) -> c_int { + if a.is_null() || b.is_null() || result.is_null() { + return -1; + } + // TODO: Call Zig add operation + unsafe { + (*result).success = false; + (*result).overflow = false; + } + 0 +} + +/// Subtract two BigInts (a - b) +#[no_mangle] +pub extern "C" fn trios_hybrid_bigint_sub( + a: *const HybridBigInt, + b: *const HybridBigInt, + result: *mut BigIntResult, +) -> c_int { + if a.is_null() || b.is_null() || result.is_null() { + return -1; + } + // TODO: Call Zig sub operation + unsafe { + (*result).success = false; + (*result).overflow = false; + } + 0 +} + +/// Multiply two BigInts +#[no_mangle] +pub extern "C" fn trios_hybrid_bigint_mul( + a: *const HybridBigInt, + b: *const HybridBigInt, + result: *mut BigIntResult, +) -> c_int { + if a.is_null() || b.is_null() || result.is_null() { + return -1; + } + // TODO: Call Zig mul operation + unsafe { + (*result).success = false; + (*result).overflow = false; + } + 0 +} + +/// Divide two BigInts (a / b) +#[no_mangle] +pub extern "C" fn trios_hybrid_bigint_div( + a: *const HybridBigInt, + b: *const HybridBigInt, + quotient: *mut BigIntResult, + remainder: *mut BigIntResult, +) -> c_int { + if a.is_null() || b.is_null() || quotient.is_null() || remainder.is_null() { + return -1; + } + // TODO: Call Zig div operation + unsafe { + (*quotient).success = false; + (*remainder).success = false; + } + 0 +} + +/// Compare two BigInts +/// +/// Returns: -1 if a < b, 0 if a == b, 1 if a > b +#[no_mangle] +pub extern "C" fn trios_hybrid_bigint_cmp( + a: *const HybridBigInt, + b: *const HybridBigInt, +) -> c_int { + if a.is_null() || b.is_null() { + return 0; + } + // TODO: Call Zig cmp operation + 0 +} + +/// Check if BigInt is zero +#[no_mangle] +pub unsafe extern "C" fn trios_hybrid_bigint_is_zero(bigint: *const HybridBigInt) -> bool { + if bigint.is_null() { + return true; + } + // TODO: Call Zig isZero + false +} + +/// Check if BigInt is negative +#[no_mangle] +pub unsafe extern "C" fn trios_hybrid_bigint_is_negative(bigint: *const HybridBigInt) -> bool { + if bigint.is_null() { + return false; + } + // TODO: Call Zig isNegative + (*bigint).sign < 0 +} + +/// Negate a BigInt +#[no_mangle] +pub extern "C" fn trios_hybrid_bigint_neg( + bigint: *const HybridBigInt, + result: *mut BigIntResult, +) -> c_int { + if bigint.is_null() || result.is_null() { + return -1; + } + // TODO: Call Zig neg operation + unsafe { + (*result).success = false; + } + 0 +} + +/// Absolute value of BigInt +#[no_mangle] +pub extern "C" fn trios_hybrid_bigint_abs( + bigint: *const HybridBigInt, + result: *mut BigIntResult, +) -> c_int { + if bigint.is_null() || result.is_null() { + return -1; + } + // TODO: Call Zig abs operation + unsafe { + (*result).success = false; + } + 0 +} + +/// Left shift (multiply by 3^n) +#[no_mangle] +pub extern "C" fn trios_hybrid_bigint_shl( + bigint: *const HybridBigInt, + _n: usize, + result: *mut BigIntResult, +) -> c_int { + if bigint.is_null() || result.is_null() { + return -1; + } + // TODO: Call Zig shl operation + unsafe { + (*result).success = false; + } + 0 +} + +/// Right shift (divide by 3^n) +#[no_mangle] +pub extern "C" fn trios_hybrid_bigint_shr( + bigint: *const HybridBigInt, + _n: usize, + result: *mut BigIntResult, +) -> c_int { + if bigint.is_null() || result.is_null() { + return -1; + } + // TODO: Call Zig shr operation + unsafe { + (*result).success = false; + } + 0 +} + +/// Create a packed trit buffer +#[no_mangle] +pub extern "C" fn trios_hybrid_packed_new(_trit_count: usize) -> *mut PackedTritBuffer { + // TODO: Allocate packed buffer in Zig + ptr::null_mut() +} + +/// Free a packed trit buffer +#[no_mangle] +pub extern "C" fn trios_hybrid_packed_free(buffer: *mut PackedTritBuffer) { + if !buffer.is_null() { + unsafe { + if !(*buffer).data.is_null() { + // TODO: Free data in Zig allocator + } + // TODO: Free buffer struct + } + } +} + +/// Encode dense trits to packed format +#[no_mangle] +pub extern "C" fn trios_hybrid_encode_pack( + trits: *const Trit, + trit_count: usize, + packed: *mut PackedTritBuffer, +) -> c_int { + if trits.is_null() || packed.is_null() { + return -1; + } + // TODO: Call Zig encodePack + 0 +} + +/// Decode packed trits to dense format +#[no_mangle] +pub extern "C" fn trios_hybrid_decode_pack( + packed: *const PackedTritBuffer, + trits: *mut Trit, + trit_count: usize, +) -> c_int { + if packed.is_null() || trits.is_null() { + return -1; + } + // TODO: Call Zig decodePack + 0 +} + +/// Get packed buffer trit count +#[no_mangle] +pub unsafe extern "C" fn trios_hybrid_packed_trit_count(buffer: *const PackedTritBuffer) -> usize { + if buffer.is_null() { + 0 + } else { + (*buffer).trit_count + } +} + +/// Get packed buffer byte count +#[no_mangle] +pub unsafe extern "C" fn trios_hybrid_packed_byte_count(buffer: *const PackedTritBuffer) -> usize { + if buffer.is_null() { + 0 + } else { + (*buffer).len + } +} + +/// Convert BigInt to packed format +#[no_mangle] +pub extern "C" fn trios_hybrid_bigint_to_packed( + bigint: *const HybridBigInt, + packed: *mut PackedTritBuffer, +) -> c_int { + if bigint.is_null() || packed.is_null() { + return -1; + } + // TODO: Call Zig toPacked operation + 0 +} + +/// Convert packed format to BigInt +#[no_mangle] +pub extern "C" fn trios_hybrid_bigint_from_packed( + packed: *const PackedTritBuffer, +) -> *mut HybridBigInt { + if packed.is_null() { + return ptr::null_mut(); + } + // TODO: Call Zig fromPacked operation + ptr::null_mut() +} + +/// Set storage mode +#[no_mangle] +pub extern "C" fn trios_hybrid_bigint_set_mode( + bigint: *mut HybridBigInt, + mode: HybridStorageMode, +) -> c_int { + if bigint.is_null() { + return -1; + } + unsafe { + (*bigint).mode = mode; + } + 0 +} + +/// Get last error message +#[no_mangle] +pub extern "C" fn trios_hybrid_last_error() -> *const c_char { + // TODO: Return last error from Zig context + ptr::null() +} + +/// Get version +#[no_mangle] +pub extern "C" fn trios_hybrid_version() -> *const c_char { + "0.1.0\0".as_ptr() as *const c_char +} + +/// Get build info +#[no_mangle] +pub extern "C" fn trios_hybrid_build_info() -> *const c_char { + "trios-hybrid 0.1.0 (FFI wrapper for Zig Hybrid BigInt)\0".as_ptr() as *const c_char +} + +#[cfg(test)] +mod tests { + use super::*; + + #[test] + fn test_trit_constants() { + assert_eq!(TRIT_NEGATIVE, -1); + assert_eq!(TRIT_ZERO, 0); + assert_eq!(TRIT_POSITIVE, 1); + } + + #[test] + fn test_max_trits() { + assert_eq!(MAX_TRITS, 256); + } + + #[test] + fn test_simd_width() { + assert_eq!(SIMD_WIDTH, 32); + } + + #[test] + fn test_storage_mode() { + assert_eq!(HybridStorageMode::Dense as i32, 0); + assert_eq!(HybridStorageMode::Packed as i32, 1); + assert_eq!(HybridStorageMode::Hybrid as i32, 2); + } + + #[test] + fn test_null_checks() { + unsafe { + assert_eq!(trios_hybrid_bigint_len(ptr::null()), 0); + assert_eq!( + trios_hybrid_bigint_mode(ptr::null()), + HybridStorageMode::Dense + ); + assert!(trios_hybrid_bigint_is_zero(ptr::null())); + assert!(!trios_hybrid_bigint_is_negative(ptr::null())); + } + } + + #[test] + fn test_version() { + let version = unsafe { + std::ffi::CStr::from_ptr(trios_hybrid_version()) + }; + assert_eq!(version.to_str().unwrap(), "0.1.0"); + } + + #[test] + fn test_build_info() { + let info = unsafe { + std::ffi::CStr::from_ptr(trios_hybrid_build_info()) + }; + let info_str = info.to_str().unwrap(); + assert!(info_str.contains("trios-hybrid")); + assert!(info_str.contains("0.1.0")); + } +} diff --git a/crates/trios-physics/vendor/zig-physics b/crates/trios-physics/vendor/zig-physics new file mode 160000 index 0000000000..b423de8c94 --- /dev/null +++ b/crates/trios-physics/vendor/zig-physics @@ -0,0 +1 @@ +Subproject commit b423de8c94a1a96b79c16d0ee416df0c2b18c220 diff --git a/crates/trios-quest/build.rs b/crates/trios-quest/build.rs new file mode 100644 index 0000000000..d4385123a9 --- /dev/null +++ b/crates/trios-quest/build.rs @@ -0,0 +1,10 @@ +fn main() { + let crate_dir = std::env::var("CARGO_MANIFEST_DIR").unwrap(); + + cbindgen::Builder::new() + .with_crate(&crate_dir) + .with_language(cbindgen::Language::C) + .generate() + .expect("Unable to generate bindings") + .write_to_file(format!("{}/include/trios_quest.h", crate_dir)); +} diff --git a/crates/trios-quest/include/.gitkeep b/crates/trios-quest/include/.gitkeep new file mode 100644 index 0000000000..e69de29bb2 diff --git a/crates/trios-quest/include/trios_quest.h b/crates/trios-quest/include/trios_quest.h new file mode 100644 index 0000000000..13bd306a3d --- /dev/null +++ b/crates/trios-quest/include/trios_quest.h @@ -0,0 +1,383 @@ +#include +#include +#include +#include + +/** + * Maximum number of results per query + */ +#define MAX_RESULTS 128 + +/** + * Maximum query string length + */ +#define MAX_QUERY_LEN 512 + +/** + * Maximum node name length + */ +#define MAX_NODE_NAME_LEN 256 + +/** + * Maximum path length (nodes in a path) + */ +#define MAX_PATH_LEN 64 + +/** + * Maximum depth for graph traversal + */ +#define MAX_TRAVERSAL_DEPTH 16 + +/** + * Node type in the Trinity graph + */ +typedef enum NodeType { + /** + * Specification file (.t27, .tri) + */ + Spec = 0, + /** + * Source code (.zig, .rs) + */ + Source = 1, + /** + * Conformance vector (.json) + */ + Conformance = 2, + /** + * Documentation (.md) + */ + Documentation = 3, + /** + * Build artifact + */ + Build = 4, + /** + * Test file + */ + Test = 5, + /** + * Configuration + */ + Config = 6, + /** + * Agent module + */ + Agent = 7, +} NodeType; + +/** + * Query type + */ +typedef enum QuestType { + /** + * Exact string match + */ + Exact = 0, + /** + * Case-insensitive substring match + */ + Fuzzy = 1, + /** + * Numeric range query + */ + Range = 2, + /** + * Regular expression match + */ + Regex = 3, + /** + * Graph traversal (BFS/DFS) + */ + GraphTraversal = 4, + /** + * Topological sort + */ + Topological = 5, + /** + * Dependency/impact analysis + */ + Impact = 6, + /** + * Shortest path + */ + ShortestPath = 7, +} QuestType; + +/** + * Sort order for results + */ +typedef enum SortOrder { + /** + * Ascending (A→Z, 0→9) + */ + Ascending = 0, + /** + * Descending (Z→A, 9→0) + */ + Descending = 1, + /** + * By relevance score (highest first) + */ + Relevance = 2, + /** + * By distance in graph (closest first) + */ + Distance = 3, +} SortOrder; + +/** + * Traversal algorithm + */ +typedef enum TraversalAlgo { + /** + * Breadth-first search + */ + Bfs = 0, + /** + * Depth-first search + */ + Dfs = 1, + /** + * Topological sort (DAG only) + */ + TopologicalSort = 2, + /** + * Dijkstra shortest path + */ + Dijkstra = 3, +} TraversalAlgo; + +/** + * Quest query definition + */ +typedef struct QuestQuery { + /** + * Query type + */ + enum QuestType quest_type; + /** + * Query string (null-terminated) + */ + char query[MAX_QUERY_LEN]; + /** + * Node type filter (0xFF = any) + */ + uint8_t filter_type; + /** + * Domain filter (null-terminated, empty = any) + */ + char filter_domain[64]; + /** + * Maximum results to return + */ + uintptr_t max_results; + /** + * Sort order + */ + enum SortOrder sort_order; + /** + * Traversal algorithm (for graph queries) + */ + enum TraversalAlgo traversal; + /** + * Maximum traversal depth + */ + uintptr_t max_depth; + /** + * Start node index (for graph queries) + */ + uintptr_t start_node; +} QuestQuery; + +/** + * Graph node identifier + */ +typedef struct NodeId { + /** + * Node index in the graph + */ + uintptr_t index; + /** + * Node name (null-terminated) + */ + char name[MAX_NODE_NAME_LEN]; + /** + * Node type + */ + enum NodeType node_type; + /** + * Domain tag (null-terminated) + */ + char domain[64]; +} NodeId; + +/** + * Single quest result entry + */ +typedef struct QuestResultEntry { + /** + * Matched node + */ + struct NodeId node; + /** + * Relevance score [0.0, 1.0] + */ + double score; + /** + * Distance from start node (for graph queries) + */ + uintptr_t distance; + /** + * Path from start node (node indices) + */ + uintptr_t path[MAX_PATH_LEN]; + /** + * Path length + */ + uintptr_t path_len; + /** + * Whether this is an exact match + */ + bool exact; +} QuestResultEntry; + +/** + * Quest result set + */ +typedef struct QuestResultSet { + /** + * Results array + */ + struct QuestResultEntry entries[MAX_RESULTS]; + /** + * Number of results + */ + uintptr_t count; + /** + * Total matches found (may exceed MAX_RESULTS) + */ + uintptr_t total_matches; + /** + * Query that produced these results + */ + struct QuestQuery query; + /** + * Execution time in microseconds + */ + long elapsed_us; + /** + * Whether the query succeeded + */ + bool success; +} QuestResultSet; + +/** + * Impact analysis result + */ +typedef struct ImpactResult { + /** + * Source node (the changed node) + */ + struct NodeId source; + /** + * Directly affected nodes + */ + struct NodeId direct[MAX_RESULTS]; + /** + * Number of directly affected nodes + */ + uintptr_t direct_count; + /** + * Transitively affected nodes + */ + struct NodeId transitive[MAX_RESULTS]; + /** + * Number of transitively affected nodes + */ + uintptr_t transitive_count; + /** + * Maximum impact depth + */ + uintptr_t max_depth; + /** + * Impact severity [0.0, 1.0] + */ + double severity; + /** + * Whether any sacred edges are affected + */ + bool sacred_impact; +} ImpactResult; + +/** + * Create a new exact-match query + */ +struct QuestQuery trios_quest_exact_query(const char *pattern, uintptr_t max_results); + +/** + * Create a new fuzzy search query + */ +struct QuestQuery trios_quest_fuzzy_query(const char *pattern, uintptr_t max_results); + +/** + * Create a graph traversal query + */ +struct QuestQuery trios_quest_traversal_query(uintptr_t start_node, + enum TraversalAlgo algo, + uintptr_t max_depth); + +/** + * Create an impact analysis query + */ +struct QuestQuery trios_quest_impact_query(uintptr_t source_node, uintptr_t max_depth); + +/** + * Create an empty result set + */ +struct QuestResultSet trios_quest_result_set_new(struct QuestQuery query); + +/** + * Add a result entry to the result set + */ +bool trios_quest_result_set_add(struct QuestResultSet *rs, struct QuestResultEntry entry); + +/** + * Create a node identifier + */ +struct NodeId trios_quest_node_new(uintptr_t index, + const char *name, + enum NodeType node_type, + const char *domain); + +/** + * Check if a node name matches a query (exact or fuzzy) + */ +double trios_quest_match(const char *node_name, const char *pattern, enum QuestType quest_type); + +/** + * Compute fuzzy relevance score between two strings + */ +double trios_quest_relevance_score(const char *node_name, const char *pattern); + +/** + * Create a new impact result + */ +struct ImpactResult trios_quest_impact_result_new(struct NodeId source); + +/** + * Add a directly affected node to the impact result + */ +bool trios_quest_impact_add_direct(struct ImpactResult *result, struct NodeId node); + +/** + * Add a transitively affected node to the impact result + */ +bool trios_quest_impact_add_transitive(struct ImpactResult *result, + struct NodeId node, + uintptr_t depth); + +/** + * Compute impact severity based on counts and sacred edges + */ +double trios_quest_impact_severity(struct ImpactResult *result); diff --git a/crates/trios-quest/src/lib.rs b/crates/trios-quest/src/lib.rs new file mode 100644 index 0000000000..ccd9701f58 --- /dev/null +++ b/crates/trios-quest/src/lib.rs @@ -0,0 +1,611 @@ +//! TRIOS Quest — Query and Discovery System FFI for Trinity Graph +//! +//! This crate provides FFI bindings for TRIOS quest (query/discovery) operations +//! including graph traversal, node search, dependency resolution, and +//! topological analysis for the Trinity module graph. +//! +//! ## Features +//! +//! - **Query Types**: Exact, fuzzy, range, regex, graph traversal +//! - **Node Search**: Find nodes by name, type, domain, or custom criteria +//! - **Graph Traversal**: BFS, DFS, topological sort, shortest path +//! - **Dependency Resolution**: Impact analysis, transitive closure +//! - **Result Ranking**: Score and sort results by relevance +//! +//! ## Symbol: `🔍` + +use std::os::raw::{c_char, c_double, c_long}; + +// ─── Constants ──────────────────────────────────────────────────────── + +/// Maximum number of results per query +pub const MAX_RESULTS: usize = 128; + +/// Maximum query string length +pub const MAX_QUERY_LEN: usize = 512; + +/// Maximum node name length +pub const MAX_NODE_NAME_LEN: usize = 256; + +/// Maximum path length (nodes in a path) +pub const MAX_PATH_LEN: usize = 64; + +/// Maximum depth for graph traversal +pub const MAX_TRAVERSAL_DEPTH: usize = 16; + +// ─── Enums ──────────────────────────────────────────────────────────── + +/// Query type +#[repr(C)] +#[derive(Clone, Copy, Debug, PartialEq, Eq)] +pub enum QuestType { + /// Exact string match + Exact = 0, + /// Case-insensitive substring match + Fuzzy = 1, + /// Numeric range query + Range = 2, + /// Regular expression match + Regex = 3, + /// Graph traversal (BFS/DFS) + GraphTraversal = 4, + /// Topological sort + Topological = 5, + /// Dependency/impact analysis + Impact = 6, + /// Shortest path + ShortestPath = 7, +} + +/// Sort order for results +#[repr(C)] +#[derive(Clone, Copy, Debug, PartialEq, Eq)] +pub enum SortOrder { + /// Ascending (A→Z, 0→9) + Ascending = 0, + /// Descending (Z→A, 9→0) + Descending = 1, + /// By relevance score (highest first) + Relevance = 2, + /// By distance in graph (closest first) + Distance = 3, +} + +/// Traversal algorithm +#[repr(C)] +#[derive(Clone, Copy, Debug, PartialEq, Eq)] +pub enum TraversalAlgo { + /// Breadth-first search + Bfs = 0, + /// Depth-first search + Dfs = 1, + /// Topological sort (DAG only) + TopologicalSort = 2, + /// Dijkstra shortest path + Dijkstra = 3, +} + +/// Node type in the Trinity graph +#[repr(C)] +#[derive(Clone, Copy, Debug, PartialEq, Eq)] +pub enum NodeType { + /// Specification file (.t27, .tri) + Spec = 0, + /// Source code (.zig, .rs) + Source = 1, + /// Conformance vector (.json) + Conformance = 2, + /// Documentation (.md) + Documentation = 3, + /// Build artifact + Build = 4, + /// Test file + Test = 5, + /// Configuration + Config = 6, + /// Agent module + Agent = 7, +} + +/// Edge type in the Trinity graph +#[repr(C)] +#[derive(Clone, Copy, Debug, PartialEq, Eq)] +pub enum EdgeType { + /// A depends on B + DependsOn = 0, + /// A implements B + Implements = 1, + /// A tests B + Tests = 2, + /// A documents B + Documents = 3, + /// A generates B + Generates = 4, + /// Sacred/phi-critical dependency + SacredEdge = 5, +} + +// ─── Structs ────────────────────────────────────────────────────────── + +/// Graph node identifier +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct NodeId { + /// Node index in the graph + pub index: usize, + /// Node name (null-terminated) + pub name: [c_char; MAX_NODE_NAME_LEN], + /// Node type + pub node_type: NodeType, + /// Domain tag (null-terminated) + pub domain: [c_char; 64], +} + +/// Graph edge +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct Edge { + /// Source node index + pub from: usize, + /// Target node index + pub to: usize, + /// Edge type + pub edge_type: EdgeType, + /// Edge weight (0.0–1.0, 1.0 = sacred/phi-critical) + pub weight: c_double, +} + +/// Quest query definition +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct QuestQuery { + /// Query type + pub quest_type: QuestType, + /// Query string (null-terminated) + pub query: [c_char; MAX_QUERY_LEN], + /// Node type filter (0xFF = any) + pub filter_type: u8, + /// Domain filter (null-terminated, empty = any) + pub filter_domain: [c_char; 64], + /// Maximum results to return + pub max_results: usize, + /// Sort order + pub sort_order: SortOrder, + /// Traversal algorithm (for graph queries) + pub traversal: TraversalAlgo, + /// Maximum traversal depth + pub max_depth: usize, + /// Start node index (for graph queries) + pub start_node: usize, +} + +/// Single quest result entry +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct QuestResultEntry { + /// Matched node + pub node: NodeId, + /// Relevance score [0.0, 1.0] + pub score: c_double, + /// Distance from start node (for graph queries) + pub distance: usize, + /// Path from start node (node indices) + pub path: [usize; MAX_PATH_LEN], + /// Path length + pub path_len: usize, + /// Whether this is an exact match + pub exact: bool, +} + +/// Quest result set +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct QuestResultSet { + /// Results array + pub entries: [QuestResultEntry; MAX_RESULTS], + /// Number of results + pub count: usize, + /// Total matches found (may exceed MAX_RESULTS) + pub total_matches: usize, + /// Query that produced these results + pub query: QuestQuery, + /// Execution time in microseconds + pub elapsed_us: c_long, + /// Whether the query succeeded + pub success: bool, +} + +/// Impact analysis result +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct ImpactResult { + /// Source node (the changed node) + pub source: NodeId, + /// Directly affected nodes + pub direct: [NodeId; MAX_RESULTS], + /// Number of directly affected nodes + pub direct_count: usize, + /// Transitively affected nodes + pub transitive: [NodeId; MAX_RESULTS], + /// Number of transitively affected nodes + pub transitive_count: usize, + /// Maximum impact depth + pub max_depth: usize, + /// Impact severity [0.0, 1.0] + pub severity: c_double, + /// Whether any sacred edges are affected + pub sacred_impact: bool, +} + +// ─── Query Construction ────────────────────────────────────────────── + +/// Create a new exact-match query +#[no_mangle] +pub extern "C" fn trios_quest_exact_query( + pattern: *const c_char, + max_results: usize, +) -> QuestQuery { + let mut query: QuestQuery = unsafe { std::mem::zeroed() }; + query.quest_type = QuestType::Exact; + query.max_results = max_results.min(MAX_RESULTS); + query.sort_order = SortOrder::Relevance; + query.filter_type = 0xFF; + query.max_depth = MAX_TRAVERSAL_DEPTH; + + if !pattern.is_null() { + let cstr = unsafe { std::ffi::CStr::from_ptr(pattern) }; + let bytes = cstr.to_bytes(); + let len = bytes.len().min(MAX_QUERY_LEN - 1); + query.query[..len].copy_from_slice(unsafe { std::mem::transmute::<&[u8], &[c_char]>(&bytes[..len]) }); + query.query[len] = 0; + } + + query +} + +/// Create a new fuzzy search query +#[no_mangle] +pub extern "C" fn trios_quest_fuzzy_query( + pattern: *const c_char, + max_results: usize, +) -> QuestQuery { + let mut query = trios_quest_exact_query(pattern, max_results); + query.quest_type = QuestType::Fuzzy; + query +} + +/// Create a graph traversal query +#[no_mangle] +pub extern "C" fn trios_quest_traversal_query( + start_node: usize, + algo: TraversalAlgo, + max_depth: usize, +) -> QuestQuery { + let mut query: QuestQuery = unsafe { std::mem::zeroed() }; + query.quest_type = QuestType::GraphTraversal; + query.traversal = algo; + query.start_node = start_node; + query.max_depth = max_depth.min(MAX_TRAVERSAL_DEPTH); + query.max_results = MAX_RESULTS; + query.filter_type = 0xFF; + query.sort_order = SortOrder::Distance; + query +} + +/// Create an impact analysis query +#[no_mangle] +pub extern "C" fn trios_quest_impact_query( + source_node: usize, + max_depth: usize, +) -> QuestQuery { + let mut query: QuestQuery = unsafe { std::mem::zeroed() }; + query.quest_type = QuestType::Impact; + query.start_node = source_node; + query.max_depth = max_depth.min(MAX_TRAVERSAL_DEPTH); + query.max_results = MAX_RESULTS; + query.filter_type = 0xFF; + query.sort_order = SortOrder::Distance; + query +} + +// ─── Result Construction ────────────────────────────────────────────── + +/// Create an empty result set +#[no_mangle] +pub extern "C" fn trios_quest_result_set_new(query: QuestQuery) -> QuestResultSet { + QuestResultSet { + entries: unsafe { std::mem::zeroed() }, + count: 0, + total_matches: 0, + query, + elapsed_us: 0, + success: true, + } +} + +/// Add a result entry to the result set +#[no_mangle] +pub extern "C" fn trios_quest_result_set_add( + rs: *mut QuestResultSet, + entry: QuestResultEntry, +) -> bool { + if rs.is_null() { + return false; + } + unsafe { + if (*rs).count >= MAX_RESULTS { + (*rs).total_matches += 1; + return false; + } + (*rs).entries[(*rs).count] = entry; + (*rs).count += 1; + (*rs).total_matches += 1; + true + } +} + +// ─── Node Construction ──────────────────────────────────────────────── + +/// Create a node identifier +#[no_mangle] +pub extern "C" fn trios_quest_node_new( + index: usize, + name: *const c_char, + node_type: NodeType, + domain: *const c_char, +) -> NodeId { + let mut node: NodeId = unsafe { std::mem::zeroed() }; + node.index = index; + node.node_type = node_type; + + if !name.is_null() { + let cstr = unsafe { std::ffi::CStr::from_ptr(name) }; + let bytes = cstr.to_bytes(); + let len = bytes.len().min(MAX_NODE_NAME_LEN - 1); + node.name[..len].copy_from_slice(unsafe { std::mem::transmute::<&[u8], &[c_char]>(&bytes[..len]) }); + node.name[len] = 0; + } + + if !domain.is_null() { + let cstr = unsafe { std::ffi::CStr::from_ptr(domain) }; + let bytes = cstr.to_bytes(); + let len = bytes.len().min(63); + node.domain[..len].copy_from_slice(unsafe { std::mem::transmute::<&[u8], &[c_char]>(&bytes[..len]) }); + node.domain[len] = 0; + } + + node +} + +// ─── Simple Matching ────────────────────────────────────────────────── + +/// Check if a node name matches a query (exact or fuzzy) +#[no_mangle] +pub extern "C" fn trios_quest_match( + node_name: *const c_char, + pattern: *const c_char, + quest_type: QuestType, +) -> c_double { + if node_name.is_null() || pattern.is_null() { + return 0.0; + } + + let name = unsafe { std::ffi::CStr::from_ptr(node_name) }; + let pat = unsafe { std::ffi::CStr::from_ptr(pattern) }; + + let name_bytes = name.to_bytes(); + let pat_bytes = pat.to_bytes(); + + match quest_type { + QuestType::Exact => { + if name_bytes == pat_bytes { + 1.0 + } else { + 0.0 + } + } + QuestType::Fuzzy => { + if name_bytes.is_empty() || pat_bytes.is_empty() { + return 0.0; + } + // Simple substring match with scoring + if name_bytes == pat_bytes { + 1.0 + } else { + // Check if pattern is a substring + let name_str = std::str::from_utf8(name_bytes).unwrap_or(""); + let pat_str = std::str::from_utf8(pat_bytes).unwrap_or(""); + let name_lower = name_str.to_lowercase(); + let pat_lower = pat_str.to_lowercase(); + if name_lower.contains(&pat_lower) { + // Score based on how much of the name the pattern covers + pat_bytes.len() as c_double / name_bytes.len().max(1) as c_double + } else { + 0.0 + } + } + } + _ => 0.0, + } +} + +/// Compute fuzzy relevance score between two strings +#[no_mangle] +pub extern "C" fn trios_quest_relevance_score( + node_name: *const c_char, + pattern: *const c_char, +) -> c_double { + trios_quest_match(node_name, pattern, QuestType::Fuzzy) +} + +// ─── Impact Analysis Helpers ────────────────────────────────────────── + +/// Create a new impact result +#[no_mangle] +pub extern "C" fn trios_quest_impact_result_new(source: NodeId) -> ImpactResult { + ImpactResult { + source, + direct: unsafe { std::mem::zeroed() }, + direct_count: 0, + transitive: unsafe { std::mem::zeroed() }, + transitive_count: 0, + max_depth: 0, + severity: 0.0, + sacred_impact: false, + } +} + +/// Add a directly affected node to the impact result +#[no_mangle] +pub extern "C" fn trios_quest_impact_add_direct( + result: *mut ImpactResult, + node: NodeId, +) -> bool { + if result.is_null() { + return false; + } + unsafe { + if (*result).direct_count >= MAX_RESULTS { + return false; + } + (*result).direct[(*result).direct_count] = node; + (*result).direct_count += 1; + true + } +} + +/// Add a transitively affected node to the impact result +#[no_mangle] +pub extern "C" fn trios_quest_impact_add_transitive( + result: *mut ImpactResult, + node: NodeId, + depth: usize, +) -> bool { + if result.is_null() { + return false; + } + unsafe { + if (*result).transitive_count >= MAX_RESULTS { + return false; + } + (*result).transitive[(*result).transitive_count] = node; + (*result).transitive_count += 1; + if depth > (*result).max_depth { + (*result).max_depth = depth; + } + true + } +} + +/// Compute impact severity based on counts and sacred edges +#[no_mangle] +pub extern "C" fn trios_quest_impact_severity(result: *mut ImpactResult) -> c_double { + if result.is_null() { + return 0.0; + } + unsafe { + let direct = (*result).direct_count as c_double; + let transitive = (*result).transitive_count as c_double; + let sacred_bonus = if (*result).sacred_impact { 0.3 } else { 0.0 }; + let base = (direct * 0.5 + transitive * 0.2) / MAX_RESULTS as c_double; + (base + sacred_bonus).min(1.0) + } +} + +// ─── Unit Tests ─────────────────────────────────────────────────────── + +#[cfg(test)] +mod tests { + use super::*; + + #[test] + fn test_exact_query() { + let q = trios_quest_exact_query(b"sacred_physics\0".as_ptr() as *const c_char, 10); + assert_eq!(q.quest_type, QuestType::Exact); + assert_eq!(q.max_results, 10); + } + + #[test] + fn test_fuzzy_query() { + let q = trios_quest_fuzzy_query(b"physics\0".as_ptr() as *const c_char, 20); + assert_eq!(q.quest_type, QuestType::Fuzzy); + assert_eq!(q.max_results, 20); + } + + #[test] + fn test_exact_match() { + let score = trios_quest_match( + b"sacred_physics\0".as_ptr() as *const c_char, + b"sacred_physics\0".as_ptr() as *const c_char, + QuestType::Exact, + ); + assert_eq!(score, 1.0); + + let score = trios_quest_match( + b"sacred_physics\0".as_ptr() as *const c_char, + b"other\0".as_ptr() as *const c_char, + QuestType::Exact, + ); + assert_eq!(score, 0.0); + } + + #[test] + fn test_fuzzy_match() { + let score = trios_quest_match( + b"sacred_physics\0".as_ptr() as *const c_char, + b"physics\0".as_ptr() as *const c_char, + QuestType::Fuzzy, + ); + assert!(score > 0.0); + assert!(score <= 1.0); + } + + #[test] + fn test_result_set() { + let query = trios_quest_exact_query(b"test\0".as_ptr() as *const c_char, 10); + let mut rs = trios_quest_result_set_new(query); + assert_eq!(rs.count, 0); + + let node = trios_quest_node_new( + 0, + b"test_node\0".as_ptr() as *const c_char, + NodeType::Spec, + b"math\0".as_ptr() as *const c_char, + ); + let entry = QuestResultEntry { + node, + score: 1.0, + distance: 0, + path: [0; MAX_PATH_LEN], + path_len: 1, + exact: true, + }; + + assert!(trios_quest_result_set_add(&mut rs, entry)); + assert_eq!(rs.count, 1); + } + + #[test] + fn test_impact_result() { + let source = trios_quest_node_new( + 0, + b"constants\0".as_ptr() as *const c_char, + NodeType::Spec, + b"math\0".as_ptr() as *const c_char, + ); + let mut result = trios_quest_impact_result_new(source); + assert_eq!(result.direct_count, 0); + + let dep = trios_quest_node_new( + 1, + b"sacred_physics\0".as_ptr() as *const c_char, + NodeType::Spec, + b"math\0".as_ptr() as *const c_char, + ); + assert!(trios_quest_impact_add_direct(&mut result, dep)); + assert_eq!(result.direct_count, 1); + + let severity = trios_quest_impact_severity(&mut result); + assert!(severity > 0.0); + } +} diff --git a/crates/trios-sacred/build.rs b/crates/trios-sacred/build.rs new file mode 100644 index 0000000000..66c7b4440b --- /dev/null +++ b/crates/trios-sacred/build.rs @@ -0,0 +1,10 @@ +fn main() { + let crate_dir = std::env::var("CARGO_MANIFEST_DIR").unwrap(); + + cbindgen::Builder::new() + .with_crate(&crate_dir) + .with_language(cbindgen::Language::C) + .generate() + .expect("Unable to generate bindings") + .write_to_file(format!("{}/include/trios_sacred.h", crate_dir)); +} diff --git a/crates/trios-sacred/include/trios_sacred.h b/crates/trios-sacred/include/trios_sacred.h new file mode 100644 index 0000000000..5a45e384f3 --- /dev/null +++ b/crates/trios-sacred/include/trios_sacred.h @@ -0,0 +1,256 @@ +#include +#include +#include +#include + +/** + * Golden ratio φ = (1 + √5) / 2 + */ +#define PHI 1.6180339887498948482 + +/** + * φ² = φ + 1 + */ +#define PHI_SQ 2.6180339887498948482 + +/** + * 1/φ = φ - 1 + */ +#define PHI_INV 0.6180339887498948482 + +/** + * 1/φ² = 2 - φ + */ +#define PHI_INV_SQ 0.3819660112501051518 + +/** + * π + */ +#define PI 3.14159265358979323846 + +/** + * e (Euler's number) + */ +#define E 2.71828182845904523536 + +/** + * √2 + */ +#define SQRT2 1.4142135623730950488 + +/** + * √3 + */ +#define SQRT3 1.7320508075688772935 + +/** + * √5 + */ +#define SQRT5 2.2360679774997896964 + +/** + * φ² + 1/φ² = 3 = TRINITY + */ +#define TRINITY 3 + +/** + * γ (Euler-Mascheroni constant) + */ +#define GAMMA 0.5772156649015328606 + +/** + * ln(φ) + */ +#define LN_PHI 0.48121182505960347 + +/** + * Phoenix constant = φ⁴ + */ +#define PHOENIX 6.8541019662496845 + +/** + * Golden angle in degrees = 360/φ² + */ +#define GOLDEN_ANGLE_DEG 137.50776405003785 + +/** + * Golden angle in radians = 2π/φ² + */ +#define GOLDEN_ANGLE_RAD 2.3999632297286533 + +/** + * α_φ = φ³/2 ≈ 0.118033988749895 + */ +#define ALPHA_PHI 0.118033988749895 + +/** + * Fibonacci numbers context (opaque) + */ +typedef struct FibonacciContext { + uint8_t _private[0]; +} FibonacciContext; + +/** + * Continued fraction approximation result + */ +typedef struct ContinuedFraction { + /** + * Numerator + */ + long numerator; + /** + * Denominator + */ + long denominator; + /** + * Approximation value + */ + double value; + /** + * Error from actual value + */ + double error; +} ContinuedFraction; + +/** + * All sacred constants in one struct + */ +typedef struct SacredConstants { + double phi; + double phi_sq; + double phi_inv; + double phi_inv_sq; + double alpha_phi; + double pi; + double e; + double sqrt2; + double sqrt3; + double sqrt5; + double gamma; + double ln_phi; + double phoenix; + long trinity; + double golden_angle_deg; + double golden_angle_rad; +} SacredConstants; + +/** + * Get φ (golden ratio) + */ +double trios_sacred_phi(void); + +/** + * Get φ² + */ +double trios_sacred_phi_sq(void); + +/** + * Get 1/φ (phi inverse) + */ +double trios_sacred_phi_inv(void); + +/** + * Get 1/φ² + */ +double trios_sacred_phi_inv_sq(void); + +/** + * Get α_φ = φ³/2 + */ +double trios_sacred_alpha_phi(void); + +/** + * Validate Trinity identity: φ² + 1/φ² = 3 + * + * Returns true if identity holds within floating point tolerance. + */ +bool trios_sacred_validate_trinity(void); + +/** + * Calculate nth Fibonacci number + */ +uint64_t trios_sacred_fibonacci(uint32_t n); + +/** + * Create Fibonacci context for sequence generation + */ +struct FibonacciContext *trios_sacred_fibonacci_context_new(void); + +/** + * Free Fibonacci context + */ +void trios_sacred_fibonacci_context_free(struct FibonacciContext *_ctx); + +/** + * Get next Fibonacci number from context + */ +uint64_t trios_sacred_fibonacci_next(struct FibonacciContext *_ctx); + +/** + * Reset Fibonacci context + */ +void trios_sacred_fibonacci_reset(struct FibonacciContext *_ctx); + +/** + * Calculate φ^n (phi power) + */ +double trios_sacred_phi_power(int32_t n); + +/** + * Calculate φ^(-n) (phi inverse power) + */ +double trios_sacred_phi_inv_power(int32_t n); + +/** + * Calculate continued fraction approximation of φ + * + * After n iterations, returns numerator/denominator approximation. + */ +struct ContinuedFraction trios_sacred_phi_cfrac(uint32_t n); + +/** + * Get continued fraction coefficients for φ + * + * Returns array of length `n` with all ones (φ has all-ones CF). + */ +int32_t trios_sacred_phi_cfrac_coeffs(uintptr_t n, int32_t *coeffs); + +/** + * Calculate golden ratio from continued fraction coefficients + */ +double trios_sacred_cfrac_to_phi(const int32_t *coeffs, uintptr_t n); + +/** + * Golden angle in degrees + */ +double trios_sacred_golden_angle_deg(void); + +/** + * Golden angle in radians + */ +double trios_sacred_golden_angle_rad(void); + +/** + * Phoenix constant (φ⁴) + */ +double trios_sacred_phoenix(void); + +/** + * Get all mathematical constants as a struct + */ +struct SacredConstants trios_sacred_constants(void); + +/** + * Get last error + */ +const char *trios_sacred_last_error(void); + +/** + * Get version + */ +const char *trios_sacred_version(void); + +/** + * Get build info + */ +const char *trios_sacred_build_info(void); diff --git a/crates/trios-sacred/src/lib.rs b/crates/trios-sacred/src/lib.rs new file mode 100644 index 0000000000..df2b0c35b7 --- /dev/null +++ b/crates/trios-sacred/src/lib.rs @@ -0,0 +1,435 @@ +//! TRIOS Sacred — Sacred Geometry and Golden Ratio FFI +//! +//! This crate provides FFI bindings for TRIOS sacred geometry constants +//! and mathematical operations based on the golden ratio φ. +//! +//! ## Features +//! +//! - **Golden Ratio Constants**: φ, φ², 1/φ, 1/φ² +//! - **Mathematical Constants**: π, e, √2, √3, √5 +//! - **Fibonacci Numbers**: nth Fibonacci number, golden ratio approximation +//! - **Continued Fractions**: φ as continued fraction +//! - **Trinity Identity**: φ² + 1/φ² = 3 +//! +//! ## Symbol: `✦` +//! +//! ## Trinity Identity +//! +//! The fundamental identity: +//! ``` +//! φ² + 1/φ² = 3 +//! ``` +//! +//! Where φ = (1 + √5) / 2 ≈ 1.618... + +use std::os::raw::{c_char, c_double, c_long}; + +/// Golden ratio φ = (1 + √5) / 2 +pub const PHI: c_double = 1.6180339887498948482; + +/// φ² = φ + 1 +pub const PHI_SQ: c_double = 2.6180339887498948482; + +/// 1/φ = φ - 1 +pub const PHI_INV: c_double = 0.6180339887498948482; + +/// 1/φ² = 2 - φ +pub const PHI_INV_SQ: c_double = 0.3819660112501051518; + +/// π +pub const PI: c_double = 3.14159265358979323846; + +/// e (Euler's number) +pub const E: c_double = 2.71828182845904523536; + +/// √2 +pub const SQRT2: c_double = 1.4142135623730950488; + +/// √3 +pub const SQRT3: c_double = 1.7320508075688772935; + +/// √5 +pub const SQRT5: c_double = 2.2360679774997896964; + +/// φ² + 1/φ² = 3 = TRINITY +pub const TRINITY: c_long = 3; + +/// γ (Euler-Mascheroni constant) +pub const GAMMA: c_double = 0.5772156649015328606; + +/// ln(φ) +pub const LN_PHI: c_double = 0.48121182505960347; + +/// Phoenix constant = φ⁴ +pub const PHOENIX: c_double = 6.8541019662496845; + +/// Golden angle in degrees = 360/φ² +pub const GOLDEN_ANGLE_DEG: c_double = 137.50776405003785; + +/// Golden angle in radians = 2π/φ² +pub const GOLDEN_ANGLE_RAD: c_double = 2.3999632297286533; + +/// α_φ = φ³/2 ≈ 0.118033988749895 +pub const ALPHA_PHI: c_double = 0.118033988749895; + +/// Fibonacci numbers context (opaque) +#[repr(C)] +pub struct FibonacciContext { + _private: [u8; 0], +} + +/// Continued fraction approximation result +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct ContinuedFraction { + /// Numerator + pub numerator: c_long, + /// Denominator + pub denominator: c_long, + /// Approximation value + pub value: c_double, + /// Error from actual value + pub error: c_double, +} + +/// Get φ (golden ratio) +#[no_mangle] +pub extern "C" fn trios_sacred_phi() -> c_double { + PHI +} + +/// Get φ² +#[no_mangle] +pub extern "C" fn trios_sacred_phi_sq() -> c_double { + PHI_SQ +} + +/// Get 1/φ (phi inverse) +#[no_mangle] +pub extern "C" fn trios_sacred_phi_inv() -> c_double { + PHI_INV +} + +/// Get 1/φ² +#[no_mangle] +pub extern "C" fn trios_sacred_phi_inv_sq() -> c_double { + PHI_INV_SQ +} + +/// Get α_φ = φ³/2 +#[no_mangle] +pub extern "C" fn trios_sacred_alpha_phi() -> c_double { + ALPHA_PHI +} + +/// Validate Trinity identity: φ² + 1/φ² = 3 +/// +/// Returns true if identity holds within floating point tolerance. +#[no_mangle] +pub extern "C" fn trios_sacred_validate_trinity() -> bool { + (PHI_SQ + PHI_INV_SQ - 3.0).abs() < 1e-15 +} + +/// Calculate nth Fibonacci number +#[no_mangle] +pub extern "C" fn trios_sacred_fibonacci(n: u32) -> u64 { + // Binet's formula: F(n) = (φ^n - (1-φ)^n) / √5 + // For n ≤ 93, fits in u64 + if n <= 1 { + return n as u64; + } + + let phi_f = PHI as f64; + let psi_f = (1.0 - PHI) as f64; // = -1/φ + let sqrt5_f = SQRT5 as f64; + + let fn_f = (phi_f.powi(n as i32) - psi_f.powi(n as i32)) / sqrt5_f; + fn_f.round() as u64 +} + +/// Create Fibonacci context for sequence generation +#[no_mangle] +pub extern "C" fn trios_sacred_fibonacci_context_new() -> *mut FibonacciContext { + // TODO: Allocate Zig Fibonacci context + std::ptr::null_mut() +} + +/// Free Fibonacci context +#[no_mangle] +pub extern "C" fn trios_sacred_fibonacci_context_free(_ctx: *mut FibonacciContext) { + // TODO: Free Zig context +} + +/// Get next Fibonacci number from context +#[no_mangle] +pub extern "C" fn trios_sacred_fibonacci_next( + _ctx: *mut FibonacciContext, +) -> u64 { + // TODO: Get next from Zig context + 0 +} + +/// Reset Fibonacci context +#[no_mangle] +pub extern "C" fn trios_sacred_fibonacci_reset(_ctx: *mut FibonacciContext) { + // TODO: Reset Zig context +} + +/// Calculate φ^n (phi power) +#[no_mangle] +pub extern "C" fn trios_sacred_phi_power(n: i32) -> c_double { + PHI.powi(n) +} + +/// Calculate φ^(-n) (phi inverse power) +#[no_mangle] +pub extern "C" fn trios_sacred_phi_inv_power(n: i32) -> c_double { + PHI_INV.powi(n) +} + +/// Calculate continued fraction approximation of φ +/// +/// After n iterations, returns numerator/denominator approximation. +#[no_mangle] +pub extern "C" fn trios_sacred_phi_cfrac(n: u32) -> ContinuedFraction { + // φ = [1; 1, 1, 1, ...] (all ones) + // Convergents are ratios of consecutive Fibonacci numbers + let fn_1 = trios_sacred_fibonacci(n + 1); + let fn_0 = trios_sacred_fibonacci(n); + + let value = fn_1 as c_double / fn_0 as c_double; + let error = (value - PHI).abs(); + + ContinuedFraction { + numerator: fn_1 as c_long, + denominator: fn_0 as c_long, + value, + error, + } +} + +/// Get continued fraction coefficients for φ +/// +/// Returns array of length `n` with all ones (φ has all-ones CF). +#[no_mangle] +pub extern "C" fn trios_sacred_phi_cfrac_coeffs( + n: usize, + coeffs: *mut i32, +) -> i32 { + if coeffs.is_null() || n == 0 { + return -1; + } + // φ = [1; 1, 1, 1, ...] + unsafe { + for i in 0..n { + *coeffs.add(i) = 1; + } + } + 0 +} + +/// Calculate golden ratio from continued fraction coefficients +#[no_mangle] +pub extern "C" fn trios_sacred_cfrac_to_phi( + coeffs: *const i32, + n: usize, +) -> c_double { + if coeffs.is_null() || n == 0 { + return 0.0; + } + unsafe { + // Evaluate continued fraction from right to left + let mut result = *coeffs.add(n - 1) as c_double; + for i in (0..n - 1).rev() { + result = *coeffs.add(i) as c_double + 1.0 / result; + } + result + } +} + +/// Golden angle in degrees +#[no_mangle] +pub extern "C" fn trios_sacred_golden_angle_deg() -> c_double { + GOLDEN_ANGLE_DEG +} + +/// Golden angle in radians +#[no_mangle] +pub extern "C" fn trios_sacred_golden_angle_rad() -> c_double { + GOLDEN_ANGLE_RAD +} + +/// Phoenix constant (φ⁴) +#[no_mangle] +pub extern "C" fn trios_sacred_phoenix() -> c_double { + PHOENIX +} + +/// Get all mathematical constants as a struct +#[no_mangle] +pub extern "C" fn trios_sacred_constants() -> SacredConstants { + SacredConstants { + phi: PHI, + phi_sq: PHI_SQ, + phi_inv: PHI_INV, + phi_inv_sq: PHI_INV_SQ, + alpha_phi: ALPHA_PHI, + pi: PI, + e: E, + sqrt2: SQRT2, + sqrt3: SQRT3, + sqrt5: SQRT5, + gamma: GAMMA, + ln_phi: LN_PHI, + phoenix: PHOENIX, + trinity: TRINITY, + golden_angle_deg: GOLDEN_ANGLE_DEG, + golden_angle_rad: GOLDEN_ANGLE_RAD, + } +} + +/// All sacred constants in one struct +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct SacredConstants { + pub phi: c_double, + pub phi_sq: c_double, + pub phi_inv: c_double, + pub phi_inv_sq: c_double, + pub alpha_phi: c_double, + pub pi: c_double, + pub e: c_double, + pub sqrt2: c_double, + pub sqrt3: c_double, + pub sqrt5: c_double, + pub gamma: c_double, + pub ln_phi: c_double, + pub phoenix: c_double, + pub trinity: c_long, + pub golden_angle_deg: c_double, + pub golden_angle_rad: c_double, +} + +/// Get last error +#[no_mangle] +pub extern "C" fn trios_sacred_last_error() -> *const c_char { + std::ptr::null() +} + +/// Get version +#[no_mangle] +pub extern "C" fn trios_sacred_version() -> *const c_char { + "0.1.0\0".as_ptr() as *const c_char +} + +/// Get build info +#[no_mangle] +pub extern "C" fn trios_sacred_build_info() -> *const c_char { + "trios-sacred 0.1.0 (FFI wrapper for Zig Sacred Geometry)\0".as_ptr() as *const c_char +} + +#[cfg(test)] +mod tests { + use super::*; + + #[test] + fn test_phi() { + assert!((PHI - 1.618033988749895).abs() < 1e-12); + } + + #[test] + fn test_phi_sq() { + assert!((PHI_SQ - 2.618033988749895).abs() < 1e-12); + } + + #[test] + fn test_phi_inv() { + assert!((PHI_INV - 0.6180339887498949).abs() < 1e-12); + } + + #[test] + fn test_trinity_identity() { + assert!(trios_sacred_validate_trinity()); + assert!((PHI_SQ + PHI_INV_SQ - 3.0).abs() < 1e-15); + } + + #[test] + fn test_fibonacci() { + assert_eq!(trios_sacred_fibonacci(0), 0); + assert_eq!(trios_sacred_fibonacci(1), 1); + assert_eq!(trios_sacred_fibonacci(2), 1); + assert_eq!(trios_sacred_fibonacci(3), 2); + assert_eq!(trios_sacred_fibonacci(10), 55); + assert_eq!(trios_sacred_fibonacci(20), 6765); + } + + #[test] + fn test_phi_power() { + assert!((trios_sacred_phi_power(2) - PHI_SQ).abs() < 1e-12); + assert!((trios_sacred_phi_power(0) - 1.0).abs() < 1e-12); + } + + #[test] + fn test_phi_cfrac() { + let cf = trios_sacred_phi_cfrac(5); + // F(6)/F(5) = 8/5 = 1.6 + assert_eq!(cf.numerator, 8); + assert_eq!(cf.denominator, 5); + assert!((cf.value - 1.6).abs() < 1e-10); + // Error should be small + assert!(cf.error < 0.02); + } + + #[test] + fn test_cfrac_coeffs() { + let mut coeffs = [0i32; 10]; + let result = trios_sacred_phi_cfrac_coeffs(10, coeffs.as_mut_ptr()); + assert_eq!(result, 0); + // All coefficients should be 1 for φ + for &c in &coeffs { + assert_eq!(c, 1); + } + } + + #[test] + fn test_cfrac_to_phi() { + let coeffs = [1i32; 10]; + let result = trios_sacred_cfrac_to_phi(coeffs.as_ptr(), 10); + // Should be close to φ + assert!((result - PHI).abs() < 0.01); + } + + #[test] + fn test_golden_angle() { + let deg = trios_sacred_golden_angle_deg(); + assert!((deg - 137.50776405003785).abs() < 1e-10); + + let rad = trios_sacred_golden_angle_rad(); + assert!((rad - 2.3999632297286533).abs() < 1e-10); + } + + #[test] + fn test_constants_struct() { + let consts = trios_sacred_constants(); + assert!((consts.phi - PHI).abs() < 1e-12); + assert_eq!(consts.trinity, TRINITY); + } + + #[test] + fn test_version() { + let version = unsafe { + std::ffi::CStr::from_ptr(trios_sacred_version()) + }; + assert_eq!(version.to_str().unwrap(), "0.1.0"); + } + + #[test] + fn test_build_info() { + let info = unsafe { + std::ffi::CStr::from_ptr(trios_sacred_build_info()) + }; + let info_str = info.to_str().unwrap(); + assert!(info_str.contains("trios-sacred")); + assert!(info_str.contains("0.1.0")); + } +} diff --git a/crates/trios-store/build.rs b/crates/trios-store/build.rs new file mode 100644 index 0000000000..956a9a3410 --- /dev/null +++ b/crates/trios-store/build.rs @@ -0,0 +1,10 @@ +fn main() { + let crate_dir = std::env::var("CARGO_MANIFEST_DIR").unwrap(); + + cbindgen::Builder::new() + .with_crate(&crate_dir) + .with_language(cbindgen::Language::C) + .generate() + .expect("Unable to generate bindings") + .write_to_file(format!("{}/include/trios_store.h", crate_dir)); +} diff --git a/crates/trios-store/include/.gitkeep b/crates/trios-store/include/.gitkeep new file mode 100644 index 0000000000..e69de29bb2 diff --git a/crates/trios-store/include/trios_store.h b/crates/trios-store/include/trios_store.h new file mode 100644 index 0000000000..1792bce96f --- /dev/null +++ b/crates/trios-store/include/trios_store.h @@ -0,0 +1,384 @@ +#include +#include +#include +#include + +/** + * Maximum key length + */ +#define MAX_KEY_LEN 256 + +/** + * Maximum value length + */ +#define MAX_VALUE_LEN 4096 + +/** + * Maximum number of entries in a scan result + */ +#define MAX_SCAN_RESULTS 256 + +/** + * Maximum number of transactions + */ +#define MAX_TRANSACTIONS 64 + +/** + * Maximum cache entries + */ +#define MAX_CACHE_ENTRIES 1024 + +/** + * Storage backend type + */ +typedef enum StorageBackend { + /** + * In-memory hash map + */ + Memory = 0, + /** + * File-based (LMDB-like) + */ + File = 1, + /** + * Distributed (network) + */ + Distributed = 2, + /** + * Hybrid (memory + file) + */ + Hybrid = 3, +} StorageBackend; + +/** + * Store operation result + */ +typedef enum StoreResult { + /** + * Operation succeeded + */ + Ok = 0, + /** + * Key not found + */ + NotFound = 1, + /** + * Key already exists + */ + AlreadyExists = 2, + /** + * Out of space + */ + OutOfSpace = 3, + /** + * Invalid argument + */ + InvalidArg = 4, + /** + * I/O error + */ + IoError = 5, + /** + * Transaction conflict + */ + Conflict = 6, + /** + * Internal error + */ + InternalError = 7, +} StoreResult; + +/** + * Transaction state + */ +typedef enum TransactionState { + /** + * Transaction is active + */ + Active = 0, + /** + * Transaction has been committed + */ + Committed = 1, + /** + * Transaction has been rolled back + */ + RolledBack = 2, + /** + * Transaction failed + */ + Failed = 3, +} TransactionState; + +/** + * Store configuration + */ +typedef struct StoreConfig { + /** + * Storage backend + */ + enum StorageBackend backend; + /** + * Maximum storage size in bytes + */ + unsigned long max_size_bytes; + /** + * Path for file-based storage (null-terminated) + */ + char path[512]; + /** + * Whether to enable compression + */ + bool compression; + /** + * Cache size in entries + */ + uintptr_t cache_size; + /** + * Sync mode (0=async, 1=sync, 2=full sync) + */ + int sync_mode; +} StoreConfig; + +/** + * Store key + */ +typedef struct StoreKey { + /** + * Key data (null-terminated) + */ + char data[MAX_KEY_LEN]; + /** + * Key length (excluding null terminator) + */ + uintptr_t len; +} StoreKey; + +/** + * Store value + */ +typedef struct StoreValue { + /** + * Value data pointer + */ + uint8_t *data; + /** + * Value length + */ + uintptr_t len; + /** + * Capacity + */ + uintptr_t capacity; +} StoreValue; + +/** + * Key-value entry + */ +typedef struct StoreEntry { + /** + * Key + */ + struct StoreKey key; + /** + * Value + */ + struct StoreValue value; + /** + * Version number (for MVCC) + */ + unsigned long version; + /** + * Timestamp (epoch seconds) + */ + long timestamp; + /** + * Whether the entry is deleted (tombstone) + */ + bool deleted; +} StoreEntry; + +/** + * Scan result set + */ +typedef struct ScanResult { + /** + * Entries found + */ + struct StoreEntry entries[MAX_SCAN_RESULTS]; + /** + * Number of entries + */ + uintptr_t count; + /** + * Whether there are more results + */ + bool has_more; + /** + * Cursor for pagination + */ + unsigned long cursor; +} ScanResult; + +/** + * Scan range specification + */ +typedef struct ScanRange { + /** + * Start key (inclusive, null-terminated) + */ + char start_key[MAX_KEY_LEN]; + /** + * End key (exclusive, null-terminated) + */ + char end_key[MAX_KEY_LEN]; + /** + * Whether start is inclusive + */ + bool start_inclusive; + /** + * Whether end is inclusive + */ + bool end_inclusive; + /** + * Maximum number of results + */ + uintptr_t limit; + /** + * Reverse scan + */ + bool reverse; +} ScanRange; + +/** + * Transaction handle + */ +typedef struct Transaction { + /** + * Transaction ID + */ + unsigned long id; + /** + * Transaction state + */ + enum TransactionState state; + /** + * Start timestamp + */ + long start_ts; + /** + * Number of operations + */ + uintptr_t op_count; + /** + * Whether the transaction is read-only + */ + bool read_only; +} Transaction; + +/** + * Store statistics + */ +typedef struct StoreStats { + /** + * Total number of keys + */ + unsigned long key_count; + /** + * Total data size in bytes + */ + unsigned long total_size; + /** + * Number of reads + */ + unsigned long reads; + /** + * Number of writes + */ + unsigned long writes; + /** + * Number of deletes + */ + unsigned long deletes; + /** + * Cache hit rate [0.0, 1.0] + */ + double cache_hit_rate; + /** + * Average read latency in microseconds + */ + double avg_read_latency_us; + /** + * Average write latency in microseconds + */ + double avg_write_latency_us; +} StoreStats; + +/** + * Create default store configuration (in-memory) + */ +struct StoreConfig trios_store_config_default(void); + +/** + * Create file-based store configuration + */ +struct StoreConfig trios_store_config_file(const char *path, unsigned long max_size_mb); + +/** + * Create a store key from a C string + */ +struct StoreKey trios_store_key_new(const char *key_str); + +/** + * Create a store value from raw bytes + */ +struct StoreValue trios_store_value_new(const uint8_t *data, uintptr_t len); + +/** + * Create an empty scan result + */ +struct ScanResult trios_store_scan_result_new(void); + +/** + * Create a scan range between two keys + */ +struct ScanRange trios_store_scan_range(const char *start_key, + const char *end_key, + uintptr_t limit); + +/** + * Create a new transaction + */ +struct Transaction trios_store_transaction_new(unsigned long id, bool read_only); + +/** + * Check if a transaction is usable (active state) + */ +bool trios_store_transaction_active(const struct Transaction *tx); + +/** + * Mark transaction as committed + */ +enum StoreResult trios_store_transaction_commit(struct Transaction *tx); + +/** + * Mark transaction as rolled back + */ +enum StoreResult trios_store_transaction_rollback(struct Transaction *tx); + +/** + * Create empty store statistics + */ +struct StoreStats trios_store_stats_new(void); + +/** + * Compute cache hit rate from hits and misses + */ +double trios_store_cache_hit_rate(unsigned long hits, unsigned long misses); + +/** + * Estimate memory usage for a given number of entries + */ +unsigned long trios_store_estimate_memory(unsigned long entry_count, + uintptr_t avg_key_len, + uintptr_t avg_value_len); diff --git a/crates/trios-store/src/lib.rs b/crates/trios-store/src/lib.rs new file mode 100644 index 0000000000..70023a2916 --- /dev/null +++ b/crates/trios-store/src/lib.rs @@ -0,0 +1,518 @@ +//! TRIOS Store — Storage Layer FFI +//! +//! This crate provides FFI bindings for TRIOS storage operations including +//! key-value persistence, transactions, caching, and storage backend +//! abstraction for the Trinity system. +//! +//! ## Features +//! +//! - **Key-Value Store**: Get, put, delete, scan operations +//! - **Transactions**: Begin, commit, rollback with ACID guarantees +//! - **Caching**: LRU cache with configurable size +//! - **Storage Backends**: Memory, file, distributed +//! - **Iterators**: Forward and reverse scans with range queries +//! +//! ## Symbol: `💾` + +use std::os::raw::{c_char, c_double, c_int, c_long, c_ulong}; + +// ─── Constants ──────────────────────────────────────────────────────── + +/// Maximum key length +pub const MAX_KEY_LEN: usize = 256; + +/// Maximum value length +pub const MAX_VALUE_LEN: usize = 4096; + +/// Maximum number of entries in a scan result +pub const MAX_SCAN_RESULTS: usize = 256; + +/// Maximum number of transactions +pub const MAX_TRANSACTIONS: usize = 64; + +/// Maximum cache entries +pub const MAX_CACHE_ENTRIES: usize = 1024; + +// ─── Enums ──────────────────────────────────────────────────────────── + +/// Storage backend type +#[repr(C)] +#[derive(Clone, Copy, Debug, PartialEq, Eq)] +pub enum StorageBackend { + /// In-memory hash map + Memory = 0, + /// File-based (LMDB-like) + File = 1, + /// Distributed (network) + Distributed = 2, + /// Hybrid (memory + file) + Hybrid = 3, +} + +/// Transaction state +#[repr(C)] +#[derive(Clone, Copy, Debug, PartialEq, Eq)] +pub enum TransactionState { + /// Transaction is active + Active = 0, + /// Transaction has been committed + Committed = 1, + /// Transaction has been rolled back + RolledBack = 2, + /// Transaction failed + Failed = 3, +} + +/// Store operation result +#[repr(C)] +#[derive(Clone, Copy, Debug, PartialEq, Eq)] +pub enum StoreResult { + /// Operation succeeded + Ok = 0, + /// Key not found + NotFound = 1, + /// Key already exists + AlreadyExists = 2, + /// Out of space + OutOfSpace = 3, + /// Invalid argument + InvalidArg = 4, + /// I/O error + IoError = 5, + /// Transaction conflict + Conflict = 6, + /// Internal error + InternalError = 7, +} + +/// Comparison operator for range scans +#[repr(C)] +#[derive(Clone, Copy, Debug, PartialEq, Eq)] +pub enum CmpOp { + /// Equal + Eq = 0, + /// Less than + Lt = 1, + /// Less than or equal + Le = 2, + /// Greater than + Gt = 3, + /// Greater than or equal + Ge = 4, +} + +// ─── Structs ────────────────────────────────────────────────────────── + +/// Store key +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct StoreKey { + /// Key data (null-terminated) + pub data: [c_char; MAX_KEY_LEN], + /// Key length (excluding null terminator) + pub len: usize, +} + +/// Store value +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct StoreValue { + /// Value data pointer + pub data: *mut u8, + /// Value length + pub len: usize, + /// Capacity + pub capacity: usize, +} + +/// Key-value entry +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct StoreEntry { + /// Key + pub key: StoreKey, + /// Value + pub value: StoreValue, + /// Version number (for MVCC) + pub version: c_ulong, + /// Timestamp (epoch seconds) + pub timestamp: c_long, + /// Whether the entry is deleted (tombstone) + pub deleted: bool, +} + +/// Store configuration +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct StoreConfig { + /// Storage backend + pub backend: StorageBackend, + /// Maximum storage size in bytes + pub max_size_bytes: c_ulong, + /// Path for file-based storage (null-terminated) + pub path: [c_char; 512], + /// Whether to enable compression + pub compression: bool, + /// Cache size in entries + pub cache_size: usize, + /// Sync mode (0=async, 1=sync, 2=full sync) + pub sync_mode: c_int, +} + +/// Transaction handle +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct Transaction { + /// Transaction ID + pub id: c_ulong, + /// Transaction state + pub state: TransactionState, + /// Start timestamp + pub start_ts: c_long, + /// Number of operations + pub op_count: usize, + /// Whether the transaction is read-only + pub read_only: bool, +} + +/// Scan range specification +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct ScanRange { + /// Start key (inclusive, null-terminated) + pub start_key: [c_char; MAX_KEY_LEN], + /// End key (exclusive, null-terminated) + pub end_key: [c_char; MAX_KEY_LEN], + /// Whether start is inclusive + pub start_inclusive: bool, + /// Whether end is inclusive + pub end_inclusive: bool, + /// Maximum number of results + pub limit: usize, + /// Reverse scan + pub reverse: bool, +} + +/// Scan result set +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct ScanResult { + /// Entries found + pub entries: [StoreEntry; MAX_SCAN_RESULTS], + /// Number of entries + pub count: usize, + /// Whether there are more results + pub has_more: bool, + /// Cursor for pagination + pub cursor: c_ulong, +} + +/// Store statistics +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct StoreStats { + /// Total number of keys + pub key_count: c_ulong, + /// Total data size in bytes + pub total_size: c_ulong, + /// Number of reads + pub reads: c_ulong, + /// Number of writes + pub writes: c_ulong, + /// Number of deletes + pub deletes: c_ulong, + /// Cache hit rate [0.0, 1.0] + pub cache_hit_rate: c_double, + /// Average read latency in microseconds + pub avg_read_latency_us: c_double, + /// Average write latency in microseconds + pub avg_write_latency_us: c_double, +} + +// ─── Store Configuration ────────────────────────────────────────────── + +/// Create default store configuration (in-memory) +#[no_mangle] +pub extern "C" fn trios_store_config_default() -> StoreConfig { + StoreConfig { + backend: StorageBackend::Memory, + max_size_bytes: 256 * 1024 * 1024, // 256 MB + path: unsafe { std::mem::zeroed() }, + compression: false, + cache_size: MAX_CACHE_ENTRIES, + sync_mode: 0, + } +} + +/// Create file-based store configuration +#[no_mangle] +pub extern "C" fn trios_store_config_file(path: *const c_char, max_size_mb: c_ulong) -> StoreConfig { + let mut config = StoreConfig { + backend: StorageBackend::File, + max_size_bytes: max_size_mb * 1024 * 1024, + path: unsafe { std::mem::zeroed() }, + compression: true, + cache_size: MAX_CACHE_ENTRIES, + sync_mode: 1, + }; + + if !path.is_null() { + let cstr = unsafe { std::ffi::CStr::from_ptr(path) }; + let bytes = cstr.to_bytes(); + let len = bytes.len().min(511); + config.path[..len].copy_from_slice(unsafe { std::mem::transmute::<&[u8], &[c_char]>(&bytes[..len]) }); + config.path[len] = 0; + } + + config +} + +// ─── Key/Value Construction ─────────────────────────────────────────── + +/// Create a store key from a C string +#[no_mangle] +pub extern "C" fn trios_store_key_new(key_str: *const c_char) -> StoreKey { + let mut key: StoreKey = unsafe { std::mem::zeroed() }; + if !key_str.is_null() { + let cstr = unsafe { std::ffi::CStr::from_ptr(key_str) }; + let bytes = cstr.to_bytes(); + let len = bytes.len().min(MAX_KEY_LEN - 1); + key.data[..len].copy_from_slice(unsafe { std::mem::transmute::<&[u8], &[c_char]>(&bytes[..len]) }); + key.data[len] = 0; + key.len = len; + } + key +} + +/// Create a store value from raw bytes +#[no_mangle] +pub extern "C" fn trios_store_value_new(data: *const u8, len: usize) -> StoreValue { + StoreValue { + data: data as *mut u8, + len, + capacity: len, + } +} + +/// Create an empty scan result +#[no_mangle] +pub extern "C" fn trios_store_scan_result_new() -> ScanResult { + ScanResult { + entries: unsafe { std::mem::zeroed() }, + count: 0, + has_more: false, + cursor: 0, + } +} + +// ─── Scan Range Construction ────────────────────────────────────────── + +/// Create a scan range between two keys +#[no_mangle] +pub extern "C" fn trios_store_scan_range( + start_key: *const c_char, + end_key: *const c_char, + limit: usize, +) -> ScanRange { + let mut range: ScanRange = unsafe { std::mem::zeroed() }; + range.start_inclusive = true; + range.end_inclusive = false; + range.limit = limit.min(MAX_SCAN_RESULTS); + range.reverse = false; + + if !start_key.is_null() { + let cstr = unsafe { std::ffi::CStr::from_ptr(start_key) }; + let bytes = cstr.to_bytes(); + let len = bytes.len().min(MAX_KEY_LEN - 1); + range.start_key[..len].copy_from_slice(unsafe { std::mem::transmute::<&[u8], &[c_char]>(&bytes[..len]) }); + range.start_key[len] = 0; + } + + if !end_key.is_null() { + let cstr = unsafe { std::ffi::CStr::from_ptr(end_key) }; + let bytes = cstr.to_bytes(); + let len = bytes.len().min(MAX_KEY_LEN - 1); + range.end_key[..len].copy_from_slice(unsafe { std::mem::transmute::<&[u8], &[c_char]>(&bytes[..len]) }); + range.end_key[len] = 0; + } + + range +} + +// ─── Transaction Operations ─────────────────────────────────────────── + +/// Create a new transaction +#[no_mangle] +pub extern "C" fn trios_store_transaction_new(id: c_ulong, read_only: bool) -> Transaction { + Transaction { + id, + state: TransactionState::Active, + start_ts: 0, + op_count: 0, + read_only, + } +} + +/// Check if a transaction is usable (active state) +#[no_mangle] +pub extern "C" fn trios_store_transaction_active(tx: *const Transaction) -> bool { + if tx.is_null() { + return false; + } + unsafe { (*tx).state == TransactionState::Active } +} + +/// Mark transaction as committed +#[no_mangle] +pub extern "C" fn trios_store_transaction_commit(tx: *mut Transaction) -> StoreResult { + if tx.is_null() { + return StoreResult::InvalidArg; + } + unsafe { + if (*tx).state != TransactionState::Active { + return StoreResult::Conflict; + } + (*tx).state = TransactionState::Committed; + StoreResult::Ok + } +} + +/// Mark transaction as rolled back +#[no_mangle] +pub extern "C" fn trios_store_transaction_rollback(tx: *mut Transaction) -> StoreResult { + if tx.is_null() { + return StoreResult::InvalidArg; + } + unsafe { + if (*tx).state != TransactionState::Active { + return StoreResult::Conflict; + } + (*tx).state = TransactionState::RolledBack; + StoreResult::Ok + } +} + +// ─── Store Statistics ───────────────────────────────────────────────── + +/// Create empty store statistics +#[no_mangle] +pub extern "C" fn trios_store_stats_new() -> StoreStats { + StoreStats { + key_count: 0, + total_size: 0, + reads: 0, + writes: 0, + deletes: 0, + cache_hit_rate: 0.0, + avg_read_latency_us: 0.0, + avg_write_latency_us: 0.0, + } +} + +/// Compute cache hit rate from hits and misses +#[no_mangle] +pub extern "C" fn trios_store_cache_hit_rate(hits: c_ulong, misses: c_ulong) -> c_double { + let total = hits + misses; + if total == 0 { + return 0.0; + } + hits as c_double / total as c_double +} + +/// Estimate memory usage for a given number of entries +#[no_mangle] +pub extern "C" fn trios_store_estimate_memory( + entry_count: c_ulong, + avg_key_len: usize, + avg_value_len: usize, +) -> c_ulong { + let per_entry = std::mem::size_of::() + avg_key_len + avg_value_len; + entry_count * per_entry as c_ulong +} + +// ─── Unit Tests ─────────────────────────────────────────────────────── + +#[cfg(test)] +mod tests { + use super::*; + + #[test] + fn test_config_default() { + let config = trios_store_config_default(); + assert_eq!(config.backend, StorageBackend::Memory); + assert!(!config.compression); + assert_eq!(config.sync_mode, 0); + } + + #[test] + fn test_config_file() { + let config = trios_store_config_file( + b"/tmp/trios.db\0".as_ptr() as *const c_char, + 100, + ); + assert_eq!(config.backend, StorageBackend::File); + assert!(config.compression); + assert_eq!(config.sync_mode, 1); + } + + #[test] + fn test_key_new() { + let key = trios_store_key_new(b"test_key\0".as_ptr() as *const c_char); + assert_eq!(key.len, 8); + } + + #[test] + fn test_value_new() { + let data = b"hello"; + let val = trios_store_value_new(data.as_ptr(), data.len()); + assert_eq!(val.len, 5); + } + + #[test] + fn test_scan_range() { + let range = trios_store_scan_range( + b"key_001\0".as_ptr() as *const c_char, + b"key_100\0".as_ptr() as *const c_char, + 50, + ); + assert!(range.start_inclusive); + assert!(!range.end_inclusive); + assert_eq!(range.limit, 50); + } + + #[test] + fn test_transaction_lifecycle() { + let mut tx = trios_store_transaction_new(1, false); + assert!(trios_store_transaction_active(&tx)); + + let result = trios_store_transaction_commit(&mut tx); + assert_eq!(result, StoreResult::Ok); + assert!(!trios_store_transaction_active(&tx)); + assert_eq!(tx.state, TransactionState::Committed); + } + + #[test] + fn test_transaction_rollback() { + let mut tx = trios_store_transaction_new(2, false); + let result = trios_store_transaction_rollback(&mut tx); + assert_eq!(result, StoreResult::Ok); + assert_eq!(tx.state, TransactionState::RolledBack); + + // Can't commit a rolled-back transaction + let result = trios_store_transaction_commit(&mut tx); + assert_eq!(result, StoreResult::Conflict); + } + + #[test] + fn test_cache_hit_rate() { + assert_eq!(trios_store_cache_hit_rate(80, 20), 0.8); + assert_eq!(trios_store_cache_hit_rate(0, 0), 0.0); + assert_eq!(trios_store_cache_hit_rate(100, 0), 1.0); + } + + #[test] + fn test_estimate_memory() { + let mem = trios_store_estimate_memory(1000, 32, 128); + assert!(mem > 0); + } +} diff --git a/crates/trios-ternary/build.rs b/crates/trios-ternary/build.rs new file mode 100644 index 0000000000..4631e69b9e --- /dev/null +++ b/crates/trios-ternary/build.rs @@ -0,0 +1,9 @@ +fn main() { + let crate_dir = std::env::var("CARGO_MANIFEST_DIR").unwrap(); + cbindgen::Builder::new() + .with_crate(&crate_dir) + .with_language(cbindgen::Language::C) + .generate() + .expect("Unable to generate bindings") + .write_to_file(format!("{}/include/trios_ternary.h", crate_dir)); +} diff --git a/crates/trios-ternary/include/trios_ternary.h b/crates/trios-ternary/include/trios_ternary.h new file mode 100644 index 0000000000..1bd6bbc7a9 --- /dev/null +++ b/crates/trios-ternary/include/trios_ternary.h @@ -0,0 +1,120 @@ +#include +#include +#include +#include + +/** + * Tekum buffer size (27 trits for large numbers) + */ +#define TEKUM_SIZE 27 + +/** + * Trit value: -1, 0, or +1 + */ +typedef int8_t Trit; + +/** + * Dense ternary vector + */ +typedef struct TernaryVector { + Trit *data; + uintptr_t len; +} TernaryVector; + +#define TRIT_NEGATIVE -1 + +#define TRIT_ZERO 0 + +#define TRIT_POSITIVE 1 + +/** + * Ternary AND: min(a, b) + */ +Trit trios_ternary_and(Trit a, Trit b); + +/** + * Ternary OR: max(a, b) + */ +Trit trios_ternary_or(Trit a, Trit b); + +/** + * Ternary NOT: negation + */ +Trit trios_ternary_not(Trit a); + +/** + * Ternary implication: OR(NOT(a), b) + */ +Trit trios_ternary_implies(Trit a, Trit b); + +/** + * Ternary consensus: a if a == b, else 0 + */ +Trit trios_ternary_consensus(Trit a, Trit b); + +/** + * Ternary majority vote of three trits + */ +Trit trios_ternary_majority(Trit a, Trit b, Trit c); + +/** + * Convert trit to confidence [0.0, 1.0] + */ +float trios_ternary_to_confidence(Trit t); + +/** + * Convert confidence to trit + */ +Trit trios_ternary_from_confidence(float c); + +/** + * Tekum: Convert integer to balanced ternary + */ +void trios_ternary_tekum_from_int(int n, Trit *buf); + +/** + * Tekum: Convert balanced ternary to integer + */ +int trios_ternary_tekum_to_int(const Trit *buf); + +/** + * Quantize float to trit using threshold + */ +Trit trios_ternary_quantize(float x, float threshold); + +/** + * Dequantize trit to float with scale + */ +float trios_ternary_dequantize(Trit t, float scale); + +/** + * Quantize weights for BitLinear layer + */ +void trios_ternary_quantize_weights(const float *weights, + uintptr_t count, + float threshold, + Trit *out); + +/** + * BitLinear forward pass: y = sign(W) * scale * x + */ +void trios_ternary_bitlinear_forward(const Trit *weights, + const float *scales, + const float *input, + float *output, + uintptr_t n); + +/** + * Create ternary vector + */ +struct TernaryVector *trios_ternary_vector_new(uintptr_t len); + +/** + * Free ternary vector + */ +void trios_ternary_vector_free(struct TernaryVector *vec); + +/** + * Get version + */ +const char *trios_ternary_version(void); diff --git a/crates/trios-ternary/src/lib.rs b/crates/trios-ternary/src/lib.rs new file mode 100644 index 0000000000..69c1da80cd --- /dev/null +++ b/crates/trios-ternary/src/lib.rs @@ -0,0 +1,290 @@ +//! TRIOS Ternary — Ternary Logic and BitLinear FFI +//! +//! This crate provides FFI bindings for TRIOS ternary operations +//! and BitLinear quantization for neural networks. +//! +//! ## Features +//! +//! - **Ternary Logic**: AND, OR, NOT, implication, consensus, majority +//! - **Tekum Arithmetic**: Balanced ternary number system +//! - **BitLinear**: Ternary quantization for neural networks +//! - **Trinity Metrics**: Sacred scoring functions +//! +//! ## Symbol: `∓` + +use std::os::raw::{c_char, c_float, c_int}; + +/// Trit value: -1, 0, or +1 +pub type Trit = i8; + +pub const TRIT_NEGATIVE: Trit = -1; +pub const TRIT_ZERO: Trit = 0; +pub const TRIT_POSITIVE: Trit = 1; + +/// Tekum buffer size (27 trits for large numbers) +pub const TEKUM_SIZE: usize = 27; + +/// Dense ternary vector +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct TernaryVector { + pub data: *mut Trit, + pub len: usize, +} + +/// BitLinear quantized weight +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct BitLinearWeight { + /// Quantized value (-1, 0, or +1) + pub value: Trit, + /// Scale factor for dequantization + pub scale: c_float, +} + +/// BitLinear layer configuration +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct BitLinearConfig { + /// Input size + pub input_size: usize, + /// Output size + pub output_size: usize, + /// Quantization threshold + pub threshold: c_float, +} + +/// Ternary AND: min(a, b) +#[no_mangle] +pub extern "C" fn trios_ternary_and(a: Trit, b: Trit) -> Trit { + a.min(b) +} + +/// Ternary OR: max(a, b) +#[no_mangle] +pub extern "C" fn trios_ternary_or(a: Trit, b: Trit) -> Trit { + a.max(b) +} + +/// Ternary NOT: negation +#[no_mangle] +pub extern "C" fn trios_ternary_not(a: Trit) -> Trit { + -a +} + +/// Ternary implication: OR(NOT(a), b) +#[no_mangle] +pub extern "C" fn trios_ternary_implies(a: Trit, b: Trit) -> Trit { + trios_ternary_or(trios_ternary_not(a), b) +} + +/// Ternary consensus: a if a == b, else 0 +#[no_mangle] +pub extern "C" fn trios_ternary_consensus(a: Trit, b: Trit) -> Trit { + if a == b { a } else { TRIT_ZERO } +} + +/// Ternary majority vote of three trits +#[no_mangle] +pub extern "C" fn trios_ternary_majority(a: Trit, b: Trit, c: Trit) -> Trit { + let ab = trios_ternary_and(a, b); + let bc = trios_ternary_and(b, c); + let ac = trios_ternary_and(a, c); + trios_ternary_or(ab, trios_ternary_or(bc, ac)) +} + +/// Convert trit to confidence [0.0, 1.0] +#[no_mangle] +pub extern "C" fn trios_ternary_to_confidence(t: Trit) -> c_float { + (t + 1) as c_float / 2.0 +} + +/// Convert confidence to trit +#[no_mangle] +pub extern "C" fn trios_ternary_from_confidence(c: c_float) -> Trit { + if c < 0.33 { + TRIT_NEGATIVE + } else if c > 0.66 { + TRIT_POSITIVE + } else { + TRIT_ZERO + } +} + +/// Tekum: Convert integer to balanced ternary +#[no_mangle] +pub extern "C" fn trios_ternary_tekum_from_int(n: c_int, buf: *mut Trit) { + if buf.is_null() { + return; + } + unsafe { + let mut val = n; + for i in 0..TEKUM_SIZE { + let t = if val == 0 { + TRIT_ZERO + } else { + let rem = ((val + 1) % 3) - 1; + val = (val - rem) / 3; + rem as Trit + }; + *buf.add(i) = t; + } + } +} + +/// Tekum: Convert balanced ternary to integer +#[no_mangle] +pub extern "C" fn trios_ternary_tekum_to_int(buf: *const Trit) -> c_int { + if buf.is_null() { + return 0; + } + unsafe { + let mut result: c_int = 0; + let mut power: c_int = 1; + for i in 0..TEKUM_SIZE { + result += (*buf.add(i) as c_int) * power; + power *= 3; + } + result + } +} + +/// Quantize float to trit using threshold +#[no_mangle] +pub extern "C" fn trios_ternary_quantize(x: c_float, threshold: c_float) -> Trit { + if x > threshold { + TRIT_POSITIVE + } else if x < -threshold { + TRIT_NEGATIVE + } else { + TRIT_ZERO + } +} + +/// Dequantize trit to float with scale +#[no_mangle] +pub extern "C" fn trios_ternary_dequantize(t: Trit, scale: c_float) -> c_float { + t as c_float * scale +} + +/// Quantize weights for BitLinear layer +#[no_mangle] +pub extern "C" fn trios_ternary_quantize_weights( + weights: *const c_float, + count: usize, + threshold: c_float, + out: *mut Trit, +) { + if weights.is_null() || out.is_null() { + return; + } + unsafe { + for i in 0..count { + *out.add(i) = trios_ternary_quantize(*weights.add(i), threshold); + } + } +} + +/// BitLinear forward pass: y = sign(W) * scale * x +#[no_mangle] +pub extern "C" fn trios_ternary_bitlinear_forward( + weights: *const Trit, + scales: *const c_float, + input: *const c_float, + output: *mut c_float, + n: usize, +) { + if weights.is_null() || scales.is_null() || input.is_null() || output.is_null() { + return; + } + unsafe { + for i in 0..n { + *output.add(i) = *weights.add(i) as c_float * *scales.add(i) * *input.add(i); + } + } +} + +/// Create ternary vector +#[no_mangle] +pub extern "C" fn trios_ternary_vector_new(len: usize) -> *mut TernaryVector { + // TODO: Allocate in Zig + std::ptr::null_mut() +} + +/// Free ternary vector +#[no_mangle] +pub extern "C" fn trios_ternary_vector_free(vec: *mut TernaryVector) { + if !vec.is_null() { + unsafe { + if !(*vec).data.is_null() { + // TODO: Free data + } + // TODO: Free vector + } + } +} + +/// Get version +#[no_mangle] +pub extern "C" fn trios_ternary_version() -> *const c_char { + "0.1.0\0".as_ptr() as *const c_char +} + +#[cfg(test)] +mod tests { + use super::*; + + #[test] + fn test_and() { + assert_eq!(trios_ternary_and(TRIT_NEGATIVE, TRIT_ZERO), TRIT_NEGATIVE); + assert_eq!(trios_ternary_and(TRIT_NEGATIVE, TRIT_POSITIVE), TRIT_NEGATIVE); + assert_eq!(trios_ternary_and(TRIT_ZERO, TRIT_POSITIVE), TRIT_ZERO); + assert_eq!(trios_ternary_and(TRIT_POSITIVE, TRIT_POSITIVE), TRIT_POSITIVE); + } + + #[test] + fn test_or() { + assert_eq!(trios_ternary_or(TRIT_NEGATIVE, TRIT_ZERO), TRIT_ZERO); + assert_eq!(trios_ternary_or(TRIT_NEGATIVE, TRIT_POSITIVE), TRIT_POSITIVE); + assert_eq!(trios_ternary_or(TRIT_ZERO, TRIT_POSITIVE), TRIT_POSITIVE); + } + + #[test] + fn test_not() { + assert_eq!(trios_ternary_not(TRIT_NEGATIVE), TRIT_POSITIVE); + assert_eq!(trios_ternary_not(TRIT_ZERO), TRIT_ZERO); + assert_eq!(trios_ternary_not(TRIT_POSITIVE), TRIT_NEGATIVE); + } + + #[test] + fn test_consensus() { + assert_eq!(trios_ternary_consensus(TRIT_POSITIVE, TRIT_POSITIVE), TRIT_POSITIVE); + assert_eq!(trios_ternary_consensus(TRIT_POSITIVE, TRIT_NEGATIVE), TRIT_ZERO); + } + + #[test] + fn test_tekum_roundtrip() { + let mut buf = [0i8; TEKUM_SIZE]; + trios_ternary_tekum_from_int(42, buf.as_mut_ptr()); + assert_eq!(trios_ternary_tekum_to_int(buf.as_ptr()), 42); + + trios_ternary_tekum_from_int(-17, buf.as_mut_ptr()); + assert_eq!(trios_ternary_tekum_to_int(buf.as_ptr()), -17); + + trios_ternary_tekum_from_int(0, buf.as_mut_ptr()); + assert_eq!(trios_ternary_tekum_to_int(buf.as_ptr()), 0); + } + + #[test] + fn test_quantize() { + assert_eq!(trios_ternary_quantize(0.8, 0.5), TRIT_POSITIVE); + assert_eq!(trios_ternary_quantize(-0.8, 0.5), TRIT_NEGATIVE); + assert_eq!(trios_ternary_quantize(0.3, 0.5), TRIT_ZERO); + } + + #[test] + fn test_dequantize() { + assert!((trios_ternary_dequantize(TRIT_POSITIVE, 1.0) - 1.0).abs() < 1e-6); + assert!((trios_ternary_dequantize(TRIT_NEGATIVE, 1.0) + 1.0).abs() < 1e-6); + } +} diff --git a/crates/trios-train-cpu/build.rs b/crates/trios-train-cpu/build.rs new file mode 100644 index 0000000000..758656f934 --- /dev/null +++ b/crates/trios-train-cpu/build.rs @@ -0,0 +1,4 @@ +fn main() { + println!("cargo:rerun-if-changed=build.rs"); + println!("cargo:rustc-cfg=trios_train_cpu"); +} diff --git a/crates/trios-validation/build.rs b/crates/trios-validation/build.rs new file mode 100644 index 0000000000..938728d83f --- /dev/null +++ b/crates/trios-validation/build.rs @@ -0,0 +1,10 @@ +fn main() { + let crate_dir = std::env::var("CARGO_MANIFEST_DIR").unwrap(); + + cbindgen::Builder::new() + .with_crate(&crate_dir) + .with_language(cbindgen::Language::C) + .generate() + .expect("Unable to generate bindings") + .write_to_file(format!("{}/include/trios_validation.h", crate_dir)); +} diff --git a/crates/trios-validation/include/.gitkeep b/crates/trios-validation/include/.gitkeep new file mode 100644 index 0000000000..e69de29bb2 diff --git a/crates/trios-validation/include/trios_validation.h b/crates/trios-validation/include/trios_validation.h new file mode 100644 index 0000000000..cebc4ecac0 --- /dev/null +++ b/crates/trios-validation/include/trios_validation.h @@ -0,0 +1,280 @@ +#include +#include +#include +#include + +/** + * Maximum number of validation errors per context + */ +#define MAX_ERRORS 64 + +/** + * Maximum length of error message + */ +#define MAX_ERROR_LEN 256 + +/** + * Maximum number of validation rules + */ +#define MAX_RULES 32 + +/** + * Validation result code + */ +typedef enum ValidationCode { + /** + * Validation passed + */ + Pass = 0, + /** + * Validation failed + */ + Fail = 1, + /** + * Validation skipped (rule not applicable) + */ + Skip = 2, + /** + * Validation error (internal) + */ + Error = 3, + /** + * Toxic change detected + */ + Toxic = 4, +} ValidationCode; + +/** + * Validation rule type + */ +typedef enum ValidationRuleType { + /** + * Numeric range [min, max] + */ + Range = 0, + /** + * Exact value match + */ + Exact = 1, + /** + * Non-null/zero check + */ + NotNull = 2, + /** + * String pattern (regex-like) + */ + Pattern = 3, + /** + * Custom validator function + */ + Custom = 4, + /** + * Conformance vector check + */ + Conformance = 5, + /** + * Sacred physics invariant + */ + SacredInvariant = 6, +} ValidationRuleType; + +/** + * Validation severity level + */ +typedef enum ValidationSeverity { + /** + * Informational — no action needed + */ + Info = 0, + /** + * Warning — potential issue + */ + Warning = 1, + /** + * Error — validation failed + */ + Error = 2, + /** + * Critical — system invariant violated + */ + Critical = 3, +} ValidationSeverity; + +/** + * Validation rule definition + */ +typedef struct ValidationRule { + /** + * Rule type + */ + enum ValidationRuleType rule_type; + /** + * Minimum value (for range checks) + */ + double min_value; + /** + * Maximum value (for range checks) + */ + double max_value; + /** + * Expected value (for exact match) + */ + double expected_value; + /** + * Tolerance for floating-point comparison + */ + double tolerance; + /** + * Whether this rule is active + */ + bool active; + /** + * Field name this rule applies to + */ + char field[MAX_ERROR_LEN]; +} ValidationRule; + +/** + * Single validation error + */ +typedef struct ValidationError { + /** + * Error severity + */ + enum ValidationSeverity severity; + /** + * Rule that triggered the error + */ + enum ValidationRuleType rule_type; + /** + * Error code + */ + enum ValidationCode code; + /** + * Error message (null-terminated) + */ + char message[MAX_ERROR_LEN]; + /** + * Field/parameter name (null-terminated) + */ + char field[MAX_ERROR_LEN]; + /** + * Expected value (if applicable) + */ + double expected; + /** + * Actual value (if applicable) + */ + double actual; +} ValidationError; + +/** + * Validation context — holds state for a validation session + */ +typedef struct ValidationContext { + /** + * Number of rules in this context + */ + uintptr_t rule_count; + /** + * Number of errors collected + */ + uintptr_t error_count; + /** + * Overall result code + */ + enum ValidationCode result; + /** + * Maximum severity seen + */ + enum ValidationSeverity max_severity; + /** + * Rules array + */ + struct ValidationRule rules[MAX_RULES]; + /** + * Errors array + */ + struct ValidationError errors[MAX_ERRORS]; +} ValidationContext; + +/** + * Create a new validation context + */ +struct ValidationContext trios_validation_context_new(void); + +/** + * Reset a validation context for reuse + */ +void trios_validation_context_reset(struct ValidationContext *ctx); + +/** + * Get overall pass/fail status + */ +bool trios_validation_passed(const struct ValidationContext *ctx); + +/** + * Get number of errors + */ +uintptr_t trios_validation_error_count(const struct ValidationContext *ctx); + +/** + * Get maximum severity + */ +enum ValidationSeverity trios_validation_max_severity(const struct ValidationContext *ctx); + +/** + * Add a range validation rule + */ +bool trios_validation_add_range_rule(struct ValidationContext *ctx, + const char *field, + double min_value, + double max_value); + +/** + * Add an exact-value validation rule + */ +bool trios_validation_add_exact_rule(struct ValidationContext *ctx, + const char *field, + double expected, + double tolerance); + +/** + * Add a sacred invariant validation rule + */ +bool trios_validation_add_sacred_rule(struct ValidationContext *ctx, + const char *field, + double expected, + double tolerance); + +/** + * Validate a single numeric value against all rules in context + */ +enum ValidationCode trios_validation_check_value(struct ValidationContext *ctx, + const char *field, + double value); + +/** + * Validate the Trinity identity: φ² + 1/φ² = 3 + */ +bool trios_validation_trinity_identity(double tolerance); + +/** + * Validate golden ratio value + */ +bool trios_validation_phi(double value, double tolerance); + +/** + * Validate Fibonacci relationship: F(n+2) = F(n+1) + F(n) + */ +bool trios_validation_fibonacci(long fn_prev, long fn_curr, long fn_next); + +/** + * Check toxicity score — returns true if the change is toxic + */ +bool trios_validation_is_toxic(const struct ValidationContext *ctx, double threshold); + +/** + * Compute conformance score [0.0, 1.0] for a context + */ +double trios_validation_conformance_score(const struct ValidationContext *ctx); diff --git a/crates/trios-validation/src/lib.rs b/crates/trios-validation/src/lib.rs new file mode 100644 index 0000000000..614d4f9a9b --- /dev/null +++ b/crates/trios-validation/src/lib.rs @@ -0,0 +1,551 @@ +//! TRIOS Validation — Schema Validation and Conformance Checking FFI +//! +//! This crate provides FFI bindings for TRIOS validation operations including +//! schema validation, input sanitization, range checking, and conformance +//! vector verification. +//! +//! ## Features +//! +//! - **Schema Validation**: Validate data against predefined schemas +//! - **Range Checking**: Numeric range and bounds validation +//! - **Pattern Matching**: String pattern validation +//! - **Conformance Vectors**: Verify sacred physics and numeric conformance +//! - **Validation Pipeline**: Chain multiple validators together +//! +//! ## Symbol: `✓` + +use std::os::raw::{c_char, c_double, c_int, c_long}; + +/// Copy a C string into a fixed-size `c_char` buffer, null-terminating. +fn copy_cstr_to_buf(src: *const c_char, dst: &mut [c_char; N]) { + if src.is_null() { + return; + } + let cstr = unsafe { std::ffi::CStr::from_ptr(src) }; + let bytes = cstr.to_bytes(); + let len = bytes.len().min(N - 1); + for i in 0..len { + dst[i] = bytes[i] as c_char; + } + dst[len] = 0; +} + +// ─── Constants ──────────────────────────────────────────────────────── + +/// Maximum number of validation errors per context +pub const MAX_ERRORS: usize = 64; + +/// Maximum length of error message +pub const MAX_ERROR_LEN: usize = 256; + +/// Maximum number of validation rules +pub const MAX_RULES: usize = 32; + +// ─── Enums ──────────────────────────────────────────────────────────── + +/// Validation severity level +#[repr(C)] +#[derive(Clone, Copy, Debug, PartialEq, Eq)] +pub enum ValidationSeverity { + /// Informational — no action needed + Info = 0, + /// Warning — potential issue + Warning = 1, + /// Error — validation failed + Error = 2, + /// Critical — system invariant violated + Critical = 3, +} + +/// Validation rule type +#[repr(C)] +#[derive(Clone, Copy, Debug, PartialEq, Eq)] +pub enum ValidationRuleType { + /// Numeric range [min, max] + Range = 0, + /// Exact value match + Exact = 1, + /// Non-null/zero check + NotNull = 2, + /// String pattern (regex-like) + Pattern = 3, + /// Custom validator function + Custom = 4, + /// Conformance vector check + Conformance = 5, + /// Sacred physics invariant + SacredInvariant = 6, +} + +/// Validation result code +#[repr(C)] +#[derive(Clone, Copy, Debug, PartialEq, Eq)] +pub enum ValidationCode { + /// Validation passed + Pass = 0, + /// Validation failed + Fail = 1, + /// Validation skipped (rule not applicable) + Skip = 2, + /// Validation error (internal) + Error = 3, + /// Toxic change detected + Toxic = 4, +} + +// ─── Structs ────────────────────────────────────────────────────────── + +/// Single validation error +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct ValidationError { + /// Error severity + pub severity: ValidationSeverity, + /// Rule that triggered the error + pub rule_type: ValidationRuleType, + /// Error code + pub code: ValidationCode, + /// Error message (null-terminated) + pub message: [c_char; MAX_ERROR_LEN], + /// Field/parameter name (null-terminated) + pub field: [c_char; MAX_ERROR_LEN], + /// Expected value (if applicable) + pub expected: c_double, + /// Actual value (if applicable) + pub actual: c_double, +} + +/// Validation rule definition +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct ValidationRule { + /// Rule type + pub rule_type: ValidationRuleType, + /// Minimum value (for range checks) + pub min_value: c_double, + /// Maximum value (for range checks) + pub max_value: c_double, + /// Expected value (for exact match) + pub expected_value: c_double, + /// Tolerance for floating-point comparison + pub tolerance: c_double, + /// Whether this rule is active + pub active: bool, + /// Field name this rule applies to + pub field: [c_char; MAX_ERROR_LEN], +} + +/// Validation context — holds state for a validation session +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct ValidationContext { + /// Number of rules in this context + pub rule_count: usize, + /// Number of errors collected + pub error_count: usize, + /// Overall result code + pub result: ValidationCode, + /// Maximum severity seen + pub max_severity: ValidationSeverity, + /// Rules array + pub rules: [ValidationRule; MAX_RULES], + /// Errors array + pub errors: [ValidationError; MAX_ERRORS], +} + +/// Conformance vector header +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct ConformanceHeader { + /// Vector name (null-terminated) + pub name: [c_char; 64], + /// Version of the conformance spec + pub version: c_int, + /// Number of entries in the vector + pub entry_count: usize, + /// Whether all checks passed + pub passed: bool, + /// Toxicity score [0.0, 1.0] + pub toxicity_score: c_double, +} + +// ─── Validation Context Lifecycle ───────────────────────────────────── + +/// Create a new validation context +#[no_mangle] +pub extern "C" fn trios_validation_context_new() -> ValidationContext { + ValidationContext { + rule_count: 0, + error_count: 0, + result: ValidationCode::Pass, + max_severity: ValidationSeverity::Info, + rules: unsafe { std::mem::zeroed() }, + errors: unsafe { std::mem::zeroed() }, + } +} + +/// Reset a validation context for reuse +#[no_mangle] +pub extern "C" fn trios_validation_context_reset(ctx: *mut ValidationContext) { + if ctx.is_null() { + return; + } + unsafe { + (*ctx).rule_count = 0; + (*ctx).error_count = 0; + (*ctx).result = ValidationCode::Pass; + (*ctx).max_severity = ValidationSeverity::Info; + } +} + +/// Get overall pass/fail status +#[no_mangle] +pub extern "C" fn trios_validation_passed(ctx: *const ValidationContext) -> bool { + if ctx.is_null() { + return false; + } + unsafe { (*ctx).result == ValidationCode::Pass } +} + +/// Get number of errors +#[no_mangle] +pub extern "C" fn trios_validation_error_count(ctx: *const ValidationContext) -> usize { + if ctx.is_null() { + return 0; + } + unsafe { (*ctx).error_count } +} + +/// Get maximum severity +#[no_mangle] +pub extern "C" fn trios_validation_max_severity(ctx: *const ValidationContext) -> ValidationSeverity { + if ctx.is_null() { + return ValidationSeverity::Error + } + unsafe { (*ctx).max_severity } +} + +// ─── Rule Management ────────────────────────────────────────────────── + +/// Add a range validation rule +#[no_mangle] +pub extern "C" fn trios_validation_add_range_rule( + ctx: *mut ValidationContext, + field: *const c_char, + min_value: c_double, + max_value: c_double, +) -> bool { + if ctx.is_null() || field.is_null() { + return false; + } + unsafe { + if (*ctx).rule_count >= MAX_RULES { + return false; + } + let rule = &mut (*ctx).rules[(*ctx).rule_count]; + rule.rule_type = ValidationRuleType::Range; + rule.min_value = min_value; + rule.max_value = max_value; + rule.active = true; + // Copy field name + copy_cstr_to_buf(field, &mut rule.field); + (*ctx).rule_count += 1; + true + } +} + +/// Add an exact-value validation rule +#[no_mangle] +pub extern "C" fn trios_validation_add_exact_rule( + ctx: *mut ValidationContext, + field: *const c_char, + expected: c_double, + tolerance: c_double, +) -> bool { + if ctx.is_null() || field.is_null() { + return false; + } + unsafe { + if (*ctx).rule_count >= MAX_RULES { + return false; + } + let rule = &mut (*ctx).rules[(*ctx).rule_count]; + rule.rule_type = ValidationRuleType::Exact; + rule.expected_value = expected; + rule.tolerance = tolerance; + rule.active = true; + copy_cstr_to_buf(field, &mut rule.field); + (*ctx).rule_count += 1; + true + } +} + +/// Add a sacred invariant validation rule +#[no_mangle] +pub extern "C" fn trios_validation_add_sacred_rule( + ctx: *mut ValidationContext, + field: *const c_char, + expected: c_double, + tolerance: c_double, +) -> bool { + if ctx.is_null() || field.is_null() { + return false; + } + unsafe { + if (*ctx).rule_count >= MAX_RULES { + return false; + } + let rule = &mut (*ctx).rules[(*ctx).rule_count]; + rule.rule_type = ValidationRuleType::SacredInvariant; + rule.expected_value = expected; + rule.tolerance = tolerance; + rule.active = true; + copy_cstr_to_buf(field, &mut rule.field); + (*ctx).rule_count += 1; + true + } +} + +// ─── Validation Execution ───────────────────────────────────────────── + +/// Validate a single numeric value against all rules in context +#[no_mangle] +pub extern "C" fn trios_validation_check_value( + ctx: *mut ValidationContext, + field: *const c_char, + value: c_double, +) -> ValidationCode { + if ctx.is_null() || field.is_null() { + return ValidationCode::Error; + } + + let field_str = unsafe { std::ffi::CStr::from_ptr(field) }; + let field_bytes = field_str.to_bytes(); + + let mut result = ValidationCode::Pass; + + unsafe { + for i in 0..(*ctx).rule_count { + let rule = &(*ctx).rules[i]; + if !rule.active { + continue; + } + + // Check if rule applies to this field + let rule_field = std::ffi::CStr::from_ptr(rule.field.as_ptr()); + if rule_field.to_bytes() != field_bytes { + continue; + } + + let mut passed = true; + match rule.rule_type { + ValidationRuleType::Range => { + passed = value >= rule.min_value && value <= rule.max_value; + if !passed { + trios_validation_add_error_internal( + ctx, + ValidationSeverity::Error, + rule.rule_type, + field, + rule.min_value, + value, + ); + } + } + ValidationRuleType::Exact => { + let diff = (value - rule.expected_value).abs(); + passed = diff <= rule.tolerance; + if !passed { + trios_validation_add_error_internal( + ctx, + ValidationSeverity::Error, + rule.rule_type, + field, + rule.expected_value, + value, + ); + } + } + ValidationRuleType::SacredInvariant => { + let diff = (value - rule.expected_value).abs(); + passed = diff <= rule.tolerance; + if !passed { + trios_validation_add_error_internal( + ctx, + ValidationSeverity::Critical, + rule.rule_type, + field, + rule.expected_value, + value, + ); + } + } + _ => { + // Other rule types handled elsewhere + continue; + } + } + + if !passed { + result = ValidationCode::Fail; + } + } + } + + if result != ValidationCode::Pass { + unsafe { + (*ctx).result = result; + } + } + + result +} + +/// Internal helper to add an error to the context +unsafe fn trios_validation_add_error_internal( + ctx: *mut ValidationContext, + severity: ValidationSeverity, + rule_type: ValidationRuleType, + field: *const c_char, + expected: c_double, + actual: c_double, +) { + if (*ctx).error_count >= MAX_ERRORS { + return; + } + + let err = &mut (*ctx).errors[(*ctx).error_count]; + err.severity = severity; + err.rule_type = rule_type; + err.code = ValidationCode::Fail; + err.expected = expected; + err.actual = actual; + + // Copy field name + copy_cstr_to_buf(field, &mut err.field); + + // Update max severity + if severity as c_int > (*ctx).max_severity as c_int { + (*ctx).max_severity = severity; + } + + (*ctx).error_count += 1; +} + +// ─── Sacred Physics Conformance ─────────────────────────────────────── + +/// Golden ratio φ +const PHI: f64 = 1.6180339887498948482; + +/// Validate the Trinity identity: φ² + 1/φ² = 3 +#[no_mangle] +pub extern "C" fn trios_validation_trinity_identity(tolerance: c_double) -> bool { + let phi_sq = PHI * PHI; + let phi_inv_sq = 1.0 / phi_sq; + let sum = phi_sq + phi_inv_sq; + (sum - 3.0).abs() <= tolerance +} + +/// Validate golden ratio value +#[no_mangle] +pub extern "C" fn trios_validation_phi(value: c_double, tolerance: c_double) -> bool { + (value - PHI).abs() <= tolerance +} + +/// Validate Fibonacci relationship: F(n+2) = F(n+1) + F(n) +#[no_mangle] +pub extern "C" fn trios_validation_fibonacci( + fn_prev: c_long, + fn_curr: c_long, + fn_next: c_long, +) -> bool { + fn_prev + fn_curr == fn_next +} + +/// Check toxicity score — returns true if the change is toxic +#[no_mangle] +pub extern "C" fn trios_validation_is_toxic( + ctx: *const ValidationContext, + threshold: c_double, +) -> bool { + if ctx.is_null() { + return true; // Null context = toxic + } + unsafe { + let critical_count = (0..(*ctx).error_count) + .filter(|&i| (*ctx).errors[i].severity == ValidationSeverity::Critical) + .count(); + let score = critical_count as c_double / MAX_ERRORS as c_double; + score >= threshold + } +} + +/// Compute conformance score [0.0, 1.0] for a context +#[no_mangle] +pub extern "C" fn trios_validation_conformance_score(ctx: *const ValidationContext) -> c_double { + if ctx.is_null() { + return 0.0; + } + unsafe { + if (*ctx).rule_count == 0 { + return 1.0; + } + let failed = (*ctx).error_count; + let total = (*ctx).rule_count; + 1.0 - (failed as c_double / total as c_double) + } +} + +// ─── Unit Tests ─────────────────────────────────────────────────────── + +#[cfg(test)] +mod tests { + use super::*; + + #[test] + fn test_trinity_identity() { + assert!(trios_validation_trinity_identity(1e-10)); + } + + #[test] + fn test_phi_validation() { + assert!(trios_validation_phi(PHI, 1e-10)); + assert!(!trios_validation_phi(1.5, 1e-10)); + } + + #[test] + fn test_fibonacci() { + assert!(trios_validation_fibonacci(5, 8, 13)); + assert!(!trios_validation_fibonacci(5, 8, 14)); + } + + #[test] + fn test_context_new() { + let ctx = trios_validation_context_new(); + assert_eq!(ctx.rule_count, 0); + assert_eq!(ctx.error_count, 0); + assert_eq!(ctx.result, ValidationCode::Pass); + } + + #[test] + fn test_range_validation() { + let mut ctx = trios_validation_context_new(); + let field = b"x\0"; + let field_ptr = field.as_ptr() as *const c_char; + + assert!(trios_validation_add_range_rule(&mut ctx, field_ptr, 0.0, 10.0)); + + let result = trios_validation_check_value(&mut ctx, field_ptr, 5.0); + assert_eq!(result, ValidationCode::Pass); + + let result = trios_validation_check_value(&mut ctx, field_ptr, 15.0); + assert_eq!(result, ValidationCode::Fail); + } + + #[test] + fn test_conformance_score() { + let ctx = trios_validation_context_new(); + let score = trios_validation_conformance_score(&ctx); + assert_eq!(score, 1.0); // No rules = perfect score + } +} diff --git a/crates/trios-vsa/build.rs b/crates/trios-vsa/build.rs new file mode 100644 index 0000000000..34d84dff04 --- /dev/null +++ b/crates/trios-vsa/build.rs @@ -0,0 +1,11 @@ +fn main() { + // Generate C bindings using cbindgen + let crate_dir = std::env::var("CARGO_MANIFEST_DIR").unwrap(); + + cbindgen::Builder::new() + .with_crate(&crate_dir) + .with_language(cbindgen::Language::C) + .generate() + .expect("Unable to generate bindings") + .write_to_file(format!("{}/include/trios_vsa.h", crate_dir)); +} diff --git a/crates/trios-vsa/include/trios_vsa.h b/crates/trios-vsa/include/trios_vsa.h new file mode 100644 index 0000000000..6a525e24e6 --- /dev/null +++ b/crates/trios-vsa/include/trios_vsa.h @@ -0,0 +1,310 @@ +#include +#include +#include +#include + +/** + * SIMD width for vector operations + */ +#define SIMD_WIDTH 32 + +/** + * Allocator type for VSA operations + */ +typedef enum VSAAllocator { + /** + * Default system allocator + */ + System = 0, + /** + * Arena allocator (for batch operations) + */ + Arena = 1, + /** + * Pool allocator (for frequent allocs/frees) + */ + Pool = 2, +} VSAAllocator; + +/** + * VSA Context (manages allocator and state) + */ +typedef struct VSAContext { + uint8_t _private[0]; +} VSAContext; + +/** + * Trit value: -1, 0, or +1 + */ +typedef int8_t Trit; + +/** + * Dense VSA vector + */ +typedef struct VSAVector { + /** + * Pointer to trit data + */ + Trit *data; + /** + * Number of trits in the vector + */ + uintptr_t len; + /** + * Capacity (for memory management) + */ + uintptr_t capacity; +} VSAVector; + +/** + * Search result for similarity queries + */ +typedef struct VSASearchResult { + /** + * Index of the best match + */ + uintptr_t index; + /** + * Similarity score (0.0 to 1.0) + */ + double score; + /** + * Whether a good match was found + */ + bool found; +} VSASearchResult; + +/** + * Sparse VSA vector (for high-dimensional sparse data) + */ +typedef struct VSASparseVector { + /** + * Non-zero indices + */ + uintptr_t *indices; + /** + * Trit values at those indices + */ + Trit *values; + /** + * Number of non-zero elements + */ + uintptr_t nnz; + /** + * Total dimension + */ + uintptr_t dimension; +} VSASparseVector; + +/** + * Trit values + */ +#define TRIT_NEGATIVE -1 + +#define TRIT_ZERO 0 + +#define TRIT_POSITIVE 1 + +/** + * Create a new VSA context + * + * Returns null pointer on allocation failure. + */ +struct VSAContext *trios_vsa_context_new(enum VSAAllocator alloc_type); + +/** + * Destroy a VSA context + */ +void trios_vsa_context_free(struct VSAContext *ctx); + +/** + * Create a new VSA vector + * + * # Safety + * - `ctx` must be a valid VSAContext pointer + */ +struct VSAVector *trios_vsa_vector_new(struct VSAContext *ctx, uintptr_t len); + +/** + * Create a VSA vector from raw data + * + * # Safety + * - `ctx` must be a valid VSAContext pointer + * - `data` must point to valid trit data of length `len` + */ +struct VSAVector *trios_vsa_vector_from_data(struct VSAContext *ctx, + const Trit *data, + uintptr_t len); + +/** + * Free a VSA vector + */ +void trios_vsa_vector_free(struct VSAVector *vec); + +/** + * Get vector length + */ +uintptr_t trios_vsa_vector_len(const struct VSAVector *vec); + +/** + * Get vector data pointer (read-only) + */ +const Trit *trios_vsa_vector_data(const struct VSAVector *vec); + +/** + * Bind operation: element-wise multiplication + * + * Returns null on failure. + */ +struct VSAVector *trios_vsa_bind(struct VSAContext *ctx, + const struct VSAVector *a, + const struct VSAVector *b); + +/** + * Unbind operation: inverse of bind (same as bind for symmetric trits) + */ +struct VSAVector *trios_vsa_unbind(struct VSAContext *ctx, + const struct VSAVector *a, + const struct VSAVector *b); + +/** + * Bundle 2 vectors: addition-like operation + */ +struct VSAVector *trios_vsa_bundle2(struct VSAContext *ctx, + const struct VSAVector *a, + const struct VSAVector *b); + +/** + * Bundle 3 vectors + */ +struct VSAVector *trios_vsa_bundle3(struct VSAContext *ctx, + const struct VSAVector *a, + const struct VSAVector *b, + const struct VSAVector *c); + +/** + * Bundle N vectors + * + * # Safety + * - `vectors` must point to an array of `count` VSAVector pointers + */ +struct VSAVector *trios_vsa_bundle_n(struct VSAContext *ctx, + const struct VSAVector *const *vectors, + uintptr_t count); + +/** + * Permute vector with a permutation pattern + * + * # Safety + * - `perm` must point to valid permutation data of length `vec.len` + */ +struct VSAVector *trios_vsa_permute(struct VSAContext *ctx, + const struct VSAVector *vec, + const uintptr_t *perm); + +/** + * Inverse permute vector + */ +struct VSAVector *trios_vsa_inverse_permute(struct VSAContext *ctx, + const struct VSAVector *vec, + const uintptr_t *perm); + +/** + * Generate a random vector + */ +struct VSAVector *trios_vsa_random_vector(struct VSAContext *ctx, uintptr_t len, uint64_t seed); + +/** + * Cosine similarity between two vectors + */ +double trios_vsa_cosine_similarity(const struct VSAVector *a, const struct VSAVector *b); + +/** + * Hamming distance between two vectors + */ +uintptr_t trios_vsa_hamming_distance(const struct VSAVector *a, const struct VSAVector *b); + +/** + * Hamming similarity (1.0 - distance / len) + */ +double trios_vsa_hamming_similarity(const struct VSAVector *a, const struct VSAVector *b); + +/** + * Dot product similarity + */ +long trios_vsa_dot_similarity(const struct VSAVector *a, const struct VSAVector *b); + +/** + * Vector norm (L2) + */ +double trios_vsa_vector_norm(const struct VSAVector *vec); + +/** + * Count non-zero trits + */ +uintptr_t trios_vsa_count_non_zero(const struct VSAVector *vec); + +/** + * Dot product + */ +long trios_vsa_dot_product(const struct VSAVector *a, const struct VSAVector *b); + +/** + * Encode a sequence into a single vector + * + * # Safety + * - `sequence` must point to an array of `count` VSAVector pointers + */ +struct VSAVector *trios_vsa_encode_sequence(struct VSAContext *ctx, + const struct VSAVector *const *sequence, + uintptr_t count); + +/** + * Probe sequence: find best match in memory + */ +int trios_vsa_probe_sequence(struct VSAContext *ctx, + const struct VSAVector *query, + const struct VSAVector *const *memory, + uintptr_t memory_count, + struct VSASearchResult *result); + +/** + * Create a sparse vector from dense + */ +struct VSASparseVector *trios_vsa_sparse_from_dense(struct VSAContext *ctx, + const struct VSAVector *dense); + +/** + * Free a sparse vector + */ +void trios_vsa_sparse_free(struct VSASparseVector *vec); + +/** + * Get sparse vector non-zero count + */ +uintptr_t trios_vsa_sparse_nnz(const struct VSASparseVector *vec); + +/** + * Get sparse vector dimension + */ +uintptr_t trios_vsa_sparse_dimension(const struct VSASparseVector *vec); + +/** + * Get last error message (null if no error) + */ +const char *trios_vsa_last_error(void); + +/** + * Clear last error + */ +void trios_vsa_clear_error(void); + +/** + * Get VSA version + */ +const char *trios_vsa_version(void); + +/** + * Get VSA build info + */ +const char *trios_vsa_build_info(void); diff --git a/crates/trios-vsa/src/lib.rs b/crates/trios-vsa/src/lib.rs new file mode 100644 index 0000000000..64c114c77a --- /dev/null +++ b/crates/trios-vsa/src/lib.rs @@ -0,0 +1,540 @@ +//! TRIOS VSA — Vector Symbolic Architecture FFI +//! +//! This crate provides FFI bindings for TRIOS Vector Symbolic Architecture operations. +//! Core operations include bind, unbind, bundle, permute, and similarity metrics. +//! +//! ## Data Types +//! +//! - `Trit`: Ternary value (-1, 0, +1) represented as i8 +//! - `VSAVector`: Dense vector of trits +//! - `VSASparseVector`: Sparse representation with indices and values +//! +//! ## Core Operations +//! +//! - **bind(x, y)**: Element-wise multiplication for binding +//! - **unbind(x, y)**: Inverse of bind (same as bind for symmetric trits) +//! - **bundle(vectors)**: Addition-like operation for bundling +//! - **permute(vec, perm)**: Permutation for order preservation +//! +//! ## Safety +//! +//! All FFI functions that take pointers must be called with valid, non-null pointers. +//! Vectors must be allocated with matching allocators and freed properly. + +use std::os::raw::{c_char, c_double, c_int, c_long}; +use std::ptr; + +/// Trit value: -1, 0, or +1 +pub type Trit = i8; + +/// Trit values +pub const TRIT_NEGATIVE: Trit = -1; +pub const TRIT_ZERO: Trit = 0; +pub const TRIT_POSITIVE: Trit = 1; + +/// SIMD width for vector operations +pub const SIMD_WIDTH: usize = 32; + +/// Dense VSA vector +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct VSAVector { + /// Pointer to trit data + pub data: *mut Trit, + /// Number of trits in the vector + pub len: usize, + /// Capacity (for memory management) + pub capacity: usize, +} + +/// Sparse VSA vector (for high-dimensional sparse data) +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct VSASparseVector { + /// Non-zero indices + pub indices: *mut usize, + /// Trit values at those indices + pub values: *mut Trit, + /// Number of non-zero elements + pub nnz: usize, + /// Total dimension + pub dimension: usize, +} + +/// Search result for similarity queries +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct VSASearchResult { + /// Index of the best match + pub index: usize, + /// Similarity score (0.0 to 1.0) + pub score: f64, + /// Whether a good match was found + pub found: bool, +} + +/// Allocator type for VSA operations +#[repr(C)] +#[derive(Clone, Copy, Debug, PartialEq, Eq)] +pub enum VSAAllocator { + /// Default system allocator + System = 0, + /// Arena allocator (for batch operations) + Arena = 1, + /// Pool allocator (for frequent allocs/frees) + Pool = 2, +} + +/// VSA Context (manages allocator and state) +#[repr(C)] +pub struct VSAContext { + _private: [u8; 0], // Zero-sized type for opaque handle +} + +/// Create a new VSA context +/// +/// Returns null pointer on allocation failure. +#[no_mangle] +pub extern "C" fn trios_vsa_context_new(alloc_type: VSAAllocator) -> *mut VSAContext { + // TODO: Initialize Zig allocator and context + let _ = alloc_type; + ptr::null_mut() +} + +/// Destroy a VSA context +#[no_mangle] +pub extern "C" fn trios_vsa_context_free(ctx: *mut VSAContext) { + if !ctx.is_null() { + // TODO: Free Zig context + } +} + +/// Create a new VSA vector +/// +/// # Safety +/// - `ctx` must be a valid VSAContext pointer +#[no_mangle] +pub unsafe extern "C" fn trios_vsa_vector_new( + ctx: *mut VSAContext, + len: usize, +) -> *mut VSAVector { + let _ = ctx; + let _ = len; + // TODO: Allocate vector in Zig + ptr::null_mut() +} + +/// Create a VSA vector from raw data +/// +/// # Safety +/// - `ctx` must be a valid VSAContext pointer +/// - `data` must point to valid trit data of length `len` +#[no_mangle] +pub unsafe extern "C" fn trios_vsa_vector_from_data( + ctx: *mut VSAContext, + data: *const Trit, + len: usize, +) -> *mut VSAVector { + let _ = ctx; + let _ = data; + let _ = len; + // TODO: Copy data into new vector in Zig + ptr::null_mut() +} + +/// Free a VSA vector +#[no_mangle] +pub extern "C" fn trios_vsa_vector_free(vec: *mut VSAVector) { + if !vec.is_null() { + unsafe { + if !(*vec).data.is_null() { + // TODO: Free data in Zig allocator + } + // TODO: Free vector struct + } + } +} + +/// Get vector length +#[no_mangle] +pub unsafe extern "C" fn trios_vsa_vector_len(vec: *const VSAVector) -> usize { + if vec.is_null() { + 0 + } else { + (*vec).len + } +} + +/// Get vector data pointer (read-only) +#[no_mangle] +pub unsafe extern "C" fn trios_vsa_vector_data(vec: *const VSAVector) -> *const Trit { + if vec.is_null() { + ptr::null() + } else { + (*vec).data + } +} + +/// Bind operation: element-wise multiplication +/// +/// Returns null on failure. +#[no_mangle] +pub unsafe extern "C" fn trios_vsa_bind( + ctx: *mut VSAContext, + a: *const VSAVector, + b: *const VSAVector, +) -> *mut VSAVector { + if ctx.is_null() || a.is_null() || b.is_null() { + return ptr::null_mut(); + } + // TODO: Call Zig bind operation + ptr::null_mut() +} + +/// Unbind operation: inverse of bind (same as bind for symmetric trits) +#[no_mangle] +pub unsafe extern "C" fn trios_vsa_unbind( + ctx: *mut VSAContext, + a: *const VSAVector, + b: *const VSAVector, +) -> *mut VSAVector { + // For symmetric trits, unbind = bind + trios_vsa_bind(ctx, a, b) +} + +/// Bundle 2 vectors: addition-like operation +#[no_mangle] +pub unsafe extern "C" fn trios_vsa_bundle2( + ctx: *mut VSAContext, + a: *const VSAVector, + b: *const VSAVector, +) -> *mut VSAVector { + if ctx.is_null() || a.is_null() || b.is_null() { + return ptr::null_mut(); + } + // TODO: Call Zig bundle2 operation + ptr::null_mut() +} + +/// Bundle 3 vectors +#[no_mangle] +pub unsafe extern "C" fn trios_vsa_bundle3( + ctx: *mut VSAContext, + a: *const VSAVector, + b: *const VSAVector, + c: *const VSAVector, +) -> *mut VSAVector { + if ctx.is_null() || a.is_null() || b.is_null() || c.is_null() { + return ptr::null_mut(); + } + // TODO: Call Zig bundle3 operation + ptr::null_mut() +} + +/// Bundle N vectors +/// +/// # Safety +/// - `vectors` must point to an array of `count` VSAVector pointers +#[no_mangle] +pub unsafe extern "C" fn trios_vsa_bundle_n( + ctx: *mut VSAContext, + vectors: *const *const VSAVector, + count: usize, +) -> *mut VSAVector { + if ctx.is_null() || vectors.is_null() || count == 0 { + return ptr::null_mut(); + } + // TODO: Call Zig bundleN operation + ptr::null_mut() +} + +/// Permute vector with a permutation pattern +/// +/// # Safety +/// - `perm` must point to valid permutation data of length `vec.len` +#[no_mangle] +pub unsafe extern "C" fn trios_vsa_permute( + ctx: *mut VSAContext, + vec: *const VSAVector, + perm: *const usize, +) -> *mut VSAVector { + if ctx.is_null() || vec.is_null() || perm.is_null() { + return ptr::null_mut(); + } + // TODO: Call Zig permute operation + ptr::null_mut() +} + +/// Inverse permute vector +#[no_mangle] +pub unsafe extern "C" fn trios_vsa_inverse_permute( + ctx: *mut VSAContext, + vec: *const VSAVector, + perm: *const usize, +) -> *mut VSAVector { + if ctx.is_null() || vec.is_null() || perm.is_null() { + return ptr::null_mut(); + } + // TODO: Call Zig inversePermute operation + ptr::null_mut() +} + +/// Generate a random vector +#[no_mangle] +pub unsafe extern "C" fn trios_vsa_random_vector( + ctx: *mut VSAContext, + len: usize, + seed: u64, +) -> *mut VSAVector { + if ctx.is_null() { + return ptr::null_mut(); + } + let _ = seed; + // TODO: Call Zig randomVector operation + ptr::null_mut() +} + +/// Cosine similarity between two vectors +#[no_mangle] +pub unsafe extern "C" fn trios_vsa_cosine_similarity( + a: *const VSAVector, + b: *const VSAVector, +) -> c_double { + if a.is_null() || b.is_null() { + return 0.0; + } + // TODO: Call Zig cosineSimilarity operation + 0.0 +} + +/// Hamming distance between two vectors +#[no_mangle] +pub unsafe extern "C" fn trios_vsa_hamming_distance( + a: *const VSAVector, + b: *const VSAVector, +) -> usize { + if a.is_null() || b.is_null() { + return usize::MAX; + } + // TODO: Call Zig hammingDistance operation + 0 +} + +/// Hamming similarity (1.0 - distance / len) +#[no_mangle] +pub unsafe extern "C" fn trios_vsa_hamming_similarity( + a: *const VSAVector, + b: *const VSAVector, +) -> c_double { + if a.is_null() || b.is_null() { + return 0.0; + } + // TODO: Call Zig hammingSimilarity operation + 0.0 +} + +/// Dot product similarity +#[no_mangle] +pub unsafe extern "C" fn trios_vsa_dot_similarity( + a: *const VSAVector, + b: *const VSAVector, +) -> c_long { + if a.is_null() || b.is_null() { + return 0; + } + // TODO: Call Zig dotSimilarity operation + 0 +} + +/// Vector norm (L2) +#[no_mangle] +pub unsafe extern "C" fn trios_vsa_vector_norm(vec: *const VSAVector) -> c_double { + if vec.is_null() { + return 0.0; + } + // TODO: Call Zig vectorNorm operation + 0.0 +} + +/// Count non-zero trits +#[no_mangle] +pub unsafe extern "C" fn trios_vsa_count_non_zero(vec: *const VSAVector) -> usize { + if vec.is_null() { + return 0; + } + // TODO: Call Zig countNonZero operation + 0 +} + +/// Dot product +#[no_mangle] +pub unsafe extern "C" fn trios_vsa_dot_product( + a: *const VSAVector, + b: *const VSAVector, +) -> c_long { + if a.is_null() || b.is_null() { + return 0; + } + // TODO: Call Zig dotProduct operation + 0 +} + +/// Encode a sequence into a single vector +/// +/// # Safety +/// - `sequence` must point to an array of `count` VSAVector pointers +#[no_mangle] +pub unsafe extern "C" fn trios_vsa_encode_sequence( + ctx: *mut VSAContext, + sequence: *const *const VSAVector, + count: usize, +) -> *mut VSAVector { + if ctx.is_null() || sequence.is_null() || count == 0 { + return ptr::null_mut(); + } + // TODO: Call Zig encodeSequence operation + ptr::null_mut() +} + +/// Probe sequence: find best match in memory +#[no_mangle] +pub unsafe extern "C" fn trios_vsa_probe_sequence( + ctx: *mut VSAContext, + query: *const VSAVector, + memory: *const *const VSAVector, + memory_count: usize, + result: *mut VSASearchResult, +) -> c_int { + if ctx.is_null() || query.is_null() || memory.is_null() || result.is_null() { + return -1; + } + // TODO: Call Zig probeSequence operation + (*result).found = false; + (*result).score = 0.0; + (*result).index = 0; + 0 +} + +/// Create a sparse vector from dense +#[no_mangle] +pub unsafe extern "C" fn trios_vsa_sparse_from_dense( + ctx: *mut VSAContext, + dense: *const VSAVector, +) -> *mut VSASparseVector { + if ctx.is_null() || dense.is_null() { + return ptr::null_mut(); + } + // TODO: Call Zig SparseVector.fromDense + ptr::null_mut() +} + +/// Free a sparse vector +#[no_mangle] +pub extern "C" fn trios_vsa_sparse_free(vec: *mut VSASparseVector) { + if !vec.is_null() { + unsafe { + if !(*vec).indices.is_null() { + // TODO: Free indices + } + if !(*vec).values.is_null() { + // TODO: Free values + } + // TODO: Free sparse vector struct + } + } +} + +/// Get sparse vector non-zero count +#[no_mangle] +pub unsafe extern "C" fn trios_vsa_sparse_nnz(vec: *const VSASparseVector) -> usize { + if vec.is_null() { + 0 + } else { + (*vec).nnz + } +} + +/// Get sparse vector dimension +#[no_mangle] +pub unsafe extern "C" fn trios_vsa_sparse_dimension(vec: *const VSASparseVector) -> usize { + if vec.is_null() { + 0 + } else { + (*vec).dimension + } +} + +/// Get last error message (null if no error) +#[no_mangle] +pub extern "C" fn trios_vsa_last_error() -> *const c_char { + // TODO: Return last error from Zig context + ptr::null() +} + +/// Clear last error +#[no_mangle] +pub extern "C" fn trios_vsa_clear_error() { + // TODO: Clear error state +} + +/// Get VSA version +#[no_mangle] +pub extern "C" fn trios_vsa_version() -> *const c_char { + "0.1.0\0".as_ptr() as *const c_char +} + +/// Get VSA build info +#[no_mangle] +pub extern "C" fn trios_vsa_build_info() -> *const c_char { + "trios-vsa 0.1.0 (FFI wrapper for Zig VSA core)\0".as_ptr() as *const c_char +} + +#[cfg(test)] +mod tests { + use super::*; + use std::ffi::CStr; + + #[test] + fn test_trit_constants() { + assert_eq!(TRIT_NEGATIVE, -1); + assert_eq!(TRIT_ZERO, 0); + assert_eq!(TRIT_POSITIVE, 1); + } + + #[test] + fn test_simd_width() { + assert_eq!(SIMD_WIDTH, 32); + } + + #[test] + fn test_version() { + let version = unsafe { CStr::from_ptr(trios_vsa_version()) }; + assert_eq!(version.to_str().unwrap(), "0.1.0"); + } + + #[test] + fn test_build_info() { + let info = unsafe { CStr::from_ptr(trios_vsa_build_info()) }; + let info_str = info.to_str().unwrap(); + assert!(info_str.contains("trios-vsa")); + assert!(info_str.contains("0.1.0")); + } + + #[test] + fn test_vector_null_checks() { + unsafe { + assert_eq!(trios_vsa_vector_len(ptr::null()), 0); + assert_eq!(trios_vsa_vector_data(ptr::null()), ptr::null()); + assert_eq!(trios_vsa_cosine_similarity(ptr::null(), ptr::null()), 0.0); + assert_eq!(trios_vsa_hamming_distance(ptr::null(), ptr::null()), usize::MAX); + } + } + + #[test] + fn test_sparse_null_checks() { + unsafe { + assert_eq!(trios_vsa_sparse_nnz(ptr::null()), 0); + assert_eq!(trios_vsa_sparse_dimension(ptr::null()), 0); + } + } +} diff --git a/crates/trios-wasm/build.rs b/crates/trios-wasm/build.rs new file mode 100644 index 0000000000..6d1a16604e --- /dev/null +++ b/crates/trios-wasm/build.rs @@ -0,0 +1,10 @@ +fn main() { + let crate_dir = std::env::var("CARGO_MANIFEST_DIR").unwrap(); + + cbindgen::Builder::new() + .with_crate(&crate_dir) + .with_language(cbindgen::Language::C) + .generate() + .expect("Unable to generate bindings") + .write_to_file(format!("{}/include/trios_wasm.h", crate_dir)); +} diff --git a/crates/trios-wasm/include/.gitkeep b/crates/trios-wasm/include/.gitkeep new file mode 100644 index 0000000000..e69de29bb2 diff --git a/crates/trios-wasm/include/trios_wasm.h b/crates/trios-wasm/include/trios_wasm.h new file mode 100644 index 0000000000..463fb82399 --- /dev/null +++ b/crates/trios-wasm/include/trios_wasm.h @@ -0,0 +1,451 @@ +#include +#include +#include +#include + +/** + * WASM page size (64 KB) + */ +#define WASM_PAGE_SIZE 65536 + +/** + * Maximum number of imported functions + */ +#define MAX_IMPORTS 64 + +/** + * Maximum number of exported functions + */ +#define MAX_EXPORTS 64 + +/** + * Maximum number of memory pages + */ +#define MAX_MEMORY_PAGES 256 + +/** + * Maximum function name length + */ +#define MAX_FUNC_NAME_LEN 128 + +/** + * Maximum module name length + */ +#define MAX_MODULE_NAME_LEN 128 + +/** + * Maximum number of function arguments + */ +#define MAX_FUNC_ARGS 16 + +/** + * Trinity custom opcode base + */ +#define TRINITY_OPCODE_BASE 61440 + +/** + * Module state + */ +typedef enum ModuleState { + /** + * Module loaded but not compiled + */ + Loaded = 0, + /** + * Module compiled and ready + */ + Compiled = 1, + /** + * Module instantiated and running + */ + Instantiated = 2, + /** + * Module errored + */ + Errored = 3, + /** + * Module unloaded + */ + Unloaded = 4, +} ModuleState; + +/** + * WASM execution result + */ +typedef enum WasmResult { + /** + * Execution succeeded + */ + Ok = 0, + /** + * Module compilation failed + */ + CompileError = 1, + /** + * Link error (missing imports) + */ + LinkError = 2, + /** + * Runtime trap + */ + Trap = 3, + /** + * Out of memory + */ + OutOfMemory = 4, + /** + * Invalid argument + */ + InvalidArg = 5, + /** + * Module not found + */ + ModuleNotFound = 6, + /** + * Function not found + */ + FuncNotFound = 7, + /** + * Memory access violation + */ + MemoryAccessViolation = 8, + /** + * Timeout + */ + Timeout = 9, + /** + * Stack overflow + */ + StackOverflow = 10, +} WasmResult; + +/** + * WASM value type + */ +typedef enum WasmValueType { + /** + * 32-bit integer + */ + I32 = 0, + /** + * 64-bit integer + */ + I64 = 1, + /** + * 32-bit float + */ + F32 = 2, + /** + * 64-bit float + */ + F64 = 3, + /** + * Reference (funcref or externref) + */ + Ref = 4, + /** + * Trinity trit value (-1, 0, +1) + */ + Trit = 5, +} WasmValueType; + +/** + * WASM value data (union) + */ +typedef union WasmValueData { + /** + * i32 value + */ + int32_t i32_val; + /** + * i64 value + */ + int64_t i64_val; + /** + * f32 value + */ + float f32_val; + /** + * f64 value + */ + double f64_val; + /** + * Trit value (-1, 0, +1) + */ + int8_t trit_val; +} WasmValueData; + +/** + * WASM value (tagged union) + */ +typedef struct WasmValue { + /** + * Value type tag + */ + enum WasmValueType value_type; + /** + * Value data + */ + union WasmValueData data; +} WasmValue; + +/** + * WASM module handle + */ +typedef struct WasmModule { + /** + * Module name (null-terminated) + */ + char name[MAX_MODULE_NAME_LEN]; + /** + * Module state + */ + enum ModuleState state; + /** + * Binary size in bytes + */ + uintptr_t binary_size; + /** + * Number of imported functions + */ + uintptr_t import_count; + /** + * Number of exported functions + */ + uintptr_t export_count; + /** + * Initial memory pages + */ + uintptr_t initial_pages; + /** + * Maximum memory pages + */ + uintptr_t max_pages; + /** + * Whether the module uses Trinity extensions + */ + bool trinity_extensions; +} WasmModule; + +/** + * WASM instance configuration + */ +typedef struct InstanceConfig { + /** + * Initial memory pages + */ + uintptr_t initial_pages; + /** + * Maximum memory pages + */ + uintptr_t max_pages; + /** + * Stack size in bytes + */ + uintptr_t stack_size; + /** + * Execution timeout in ms (0 = no timeout) + */ + long timeout_ms; + /** + * Whether to enable Trinity opcodes + */ + bool trinity_opcodes; + /** + * Fuel for metering (0 = unlimited) + */ + unsigned long fuel; + /** + * Whether to enable debug info + */ + bool debug; +} InstanceConfig; + +/** + * WASM memory view + */ +typedef struct WasmMemoryView { + /** + * Base pointer + */ + uint8_t *data; + /** + * Current size in bytes + */ + uintptr_t size; + /** + * Number of pages + */ + uintptr_t pages; + /** + * Maximum pages + */ + uintptr_t max_pages; +} WasmMemoryView; + +/** + * Function signature + */ +typedef struct FuncSignature { + /** + * Parameter types + */ + enum WasmValueType params[MAX_FUNC_ARGS]; + /** + * Number of parameters + */ + uintptr_t param_count; + /** + * Return types + */ + enum WasmValueType results[MAX_FUNC_ARGS]; + /** + * Number of return values + */ + uintptr_t result_count; +} FuncSignature; + +/** + * WASM execution context + */ +typedef struct ExecutionContext { + /** + * Module being executed + */ + struct WasmModule module; + /** + * Memory view + */ + struct WasmMemoryView memory; + /** + * Call depth + */ + uintptr_t call_depth; + /** + * Fuel consumed + */ + unsigned long fuel_consumed; + /** + * Execution result + */ + enum WasmResult result; + /** + * Whether a trap occurred + */ + bool trapped; +} ExecutionContext; + +/** + * Create an i32 WASM value + */ +struct WasmValue trios_wasm_value_i32(int32_t val); + +/** + * Create an i64 WASM value + */ +struct WasmValue trios_wasm_value_i64(int64_t val); + +/** + * Create an f32 WASM value + */ +struct WasmValue trios_wasm_value_f32(float val); + +/** + * Create an f64 WASM value + */ +struct WasmValue trios_wasm_value_f64(double val); + +/** + * Create a Trit WASM value + */ +struct WasmValue trios_wasm_value_trit(int8_t val); + +/** + * Read i32 from a WASM value (returns 0 if type mismatch) + */ +int32_t trios_wasm_value_as_i32(struct WasmValue val); + +/** + * Read f64 from a WASM value (returns 0.0 if type mismatch) + */ +double trios_wasm_value_as_f64(struct WasmValue val); + +/** + * Read trit from a WASM value (returns 0 if type mismatch) + */ +int8_t trios_wasm_value_as_trit(struct WasmValue val); + +/** + * Create a new WASM module descriptor + */ +struct WasmModule trios_wasm_module_new(const char *name, + uintptr_t binary_size, + uintptr_t initial_pages, + uintptr_t max_pages); + +/** + * Check if a module uses Trinity extensions + */ +bool trios_wasm_module_has_trinity_ext(const struct WasmModule *module); + +/** + * Create default instance configuration + */ +struct InstanceConfig trios_wasm_instance_config_default(void); + +/** + * Create Trinity-optimized instance configuration + */ +struct InstanceConfig trios_wasm_instance_config_trinity(void); + +/** + * Create a memory view + */ +struct WasmMemoryView trios_wasm_memory_view(uint8_t *data, uintptr_t size, uintptr_t max_pages); + +/** + * Calculate byte offset for a given page and offset + */ +uintptr_t trios_wasm_memory_offset(uintptr_t page, uintptr_t offset); + +/** + * Calculate number of pages needed for a given byte size + */ +uintptr_t trios_wasm_pages_needed(uintptr_t byte_size); + +/** + * Create an empty function signature + */ +struct FuncSignature trios_wasm_func_signature_new(void); + +/** + * Add a parameter to a function signature + */ +bool trios_wasm_func_signature_add_param(struct FuncSignature *sig, enum WasmValueType param_type); + +/** + * Add a result type to a function signature + */ +bool trios_wasm_func_signature_add_result(struct FuncSignature *sig, + enum WasmValueType result_type); + +/** + * Create an execution context + */ +struct ExecutionContext trios_wasm_exec_context_new(struct WasmModule module, + struct WasmMemoryView memory); + +/** + * Check if execution context is in a valid state + */ +bool trios_wasm_exec_context_ok(const struct ExecutionContext *ctx); + +/** + * Get Trinity custom opcode for a given operation index + */ +uint32_t trios_wasm_trinity_opcode(uint32_t op_index); + +/** + * Check if an opcode is a Trinity extension + */ +bool trios_wasm_is_trinity_opcode(uint32_t opcode); diff --git a/crates/trios-wasm/src/lib.rs b/crates/trios-wasm/src/lib.rs new file mode 100644 index 0000000000..159a0cffc6 --- /dev/null +++ b/crates/trios-wasm/src/lib.rs @@ -0,0 +1,656 @@ +//! TRIOS WASM — WebAssembly Runtime FFI +//! +//! This crate provides FFI bindings for TRIOS WebAssembly operations including +//! module loading, instantiation, execution, memory management, and +//! import/export bridging for the Trinity system. +//! +//! ## Features +//! +//! - **Module Loading**: Parse and validate WASM binaries +//! - **Instantiation**: Create instances with configured imports +//! - **Execution**: Call exported functions with typed arguments +//! - **Memory Management**: Linear memory access, grow/shrink +//! - **Import/Export**: Bridge between host and WASM modules +//! - **Trinity Extensions**: Custom opcodes for ternary/VSA operations +//! +//! ## Symbol: `⚡` + +use std::os::raw::{c_char, c_long, c_ulong}; + +// ─── Constants ──────────────────────────────────────────────────────── + +/// WASM page size (64 KB) +pub const WASM_PAGE_SIZE: usize = 65536; + +/// Maximum number of imported functions +pub const MAX_IMPORTS: usize = 64; + +/// Maximum number of exported functions +pub const MAX_EXPORTS: usize = 64; + +/// Maximum number of memory pages +pub const MAX_MEMORY_PAGES: usize = 256; + +/// Maximum function name length +pub const MAX_FUNC_NAME_LEN: usize = 128; + +/// Maximum module name length +pub const MAX_MODULE_NAME_LEN: usize = 128; + +/// Maximum number of function arguments +pub const MAX_FUNC_ARGS: usize = 16; + +/// Trinity custom opcode base +pub const TRINITY_OPCODE_BASE: u32 = 0xF000; + +// ─── Enums ──────────────────────────────────────────────────────────── + +/// WASM value type +#[repr(C)] +#[derive(Clone, Copy, Debug, PartialEq, Eq)] +pub enum WasmValueType { + /// 32-bit integer + I32 = 0, + /// 64-bit integer + I64 = 1, + /// 32-bit float + F32 = 2, + /// 64-bit float + F64 = 3, + /// Reference (funcref or externref) + Ref = 4, + /// Trinity trit value (-1, 0, +1) + Trit = 5, +} + +/// WASM execution result +#[repr(C)] +#[derive(Clone, Copy, Debug, PartialEq, Eq)] +pub enum WasmResult { + /// Execution succeeded + Ok = 0, + /// Module compilation failed + CompileError = 1, + /// Link error (missing imports) + LinkError = 2, + /// Runtime trap + Trap = 3, + /// Out of memory + OutOfMemory = 4, + /// Invalid argument + InvalidArg = 5, + /// Module not found + ModuleNotFound = 6, + /// Function not found + FuncNotFound = 7, + /// Memory access violation + MemoryAccessViolation = 8, + /// Timeout + Timeout = 9, + /// Stack overflow + StackOverflow = 10, +} + +/// Module state +#[repr(C)] +#[derive(Clone, Copy, Debug, PartialEq, Eq)] +pub enum ModuleState { + /// Module loaded but not compiled + Loaded = 0, + /// Module compiled and ready + Compiled = 1, + /// Module instantiated and running + Instantiated = 2, + /// Module errored + Errored = 3, + /// Module unloaded + Unloaded = 4, +} + +/// Import/Export kind +#[repr(C)] +#[derive(Clone, Copy, Debug, PartialEq, Eq)] +pub enum ExternalKind { + /// Function + Function = 0, + /// Table + Table = 1, + /// Memory + Memory = 2, + /// Global + Global = 3, +} + +// ─── Structs ────────────────────────────────────────────────────────── + +/// WASM value (tagged union) +#[repr(C)] +#[derive(Clone, Copy)] +pub struct WasmValue { + /// Value type tag + pub value_type: WasmValueType, + /// Value data + pub data: WasmValueData, +} + +impl std::fmt::Debug for WasmValue { + fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result { + f.debug_struct("WasmValue") + .field("value_type", &self.value_type) + .finish() + } +} + +/// WASM value data (union) +#[repr(C)] +#[derive(Clone, Copy)] +pub union WasmValueData { + /// i32 value + pub i32_val: i32, + /// i64 value + pub i64_val: i64, + /// f32 value + pub f32_val: f32, + /// f64 value + pub f64_val: f64, + /// Trit value (-1, 0, +1) + pub trit_val: i8, +} + +/// Function signature +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct FuncSignature { + /// Parameter types + pub params: [WasmValueType; MAX_FUNC_ARGS], + /// Number of parameters + pub param_count: usize, + /// Return types + pub results: [WasmValueType; MAX_FUNC_ARGS], + /// Number of return values + pub result_count: usize, +} + +/// Import descriptor +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct ImportDescriptor { + /// Module name (null-terminated) + pub module_name: [c_char; MAX_MODULE_NAME_LEN], + /// Function name (null-terminated) + pub func_name: [c_char; MAX_FUNC_NAME_LEN], + /// External kind + pub kind: ExternalKind, + /// Expected signature (for functions) + pub signature: FuncSignature, +} + +/// Export descriptor +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct ExportDescriptor { + /// Function name (null-terminated) + pub name: [c_char; MAX_FUNC_NAME_LEN], + /// External kind + pub kind: ExternalKind, + /// Function signature (for functions) + pub signature: FuncSignature, + /// Index in the module + pub index: usize, +} + +/// WASM module handle +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct WasmModule { + /// Module name (null-terminated) + pub name: [c_char; MAX_MODULE_NAME_LEN], + /// Module state + pub state: ModuleState, + /// Binary size in bytes + pub binary_size: usize, + /// Number of imported functions + pub import_count: usize, + /// Number of exported functions + pub export_count: usize, + /// Initial memory pages + pub initial_pages: usize, + /// Maximum memory pages + pub max_pages: usize, + /// Whether the module uses Trinity extensions + pub trinity_extensions: bool, +} + +/// WASM instance configuration +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct InstanceConfig { + /// Initial memory pages + pub initial_pages: usize, + /// Maximum memory pages + pub max_pages: usize, + /// Stack size in bytes + pub stack_size: usize, + /// Execution timeout in ms (0 = no timeout) + pub timeout_ms: c_long, + /// Whether to enable Trinity opcodes + pub trinity_opcodes: bool, + /// Fuel for metering (0 = unlimited) + pub fuel: c_ulong, + /// Whether to enable debug info + pub debug: bool, +} + +/// WASM memory view +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct WasmMemoryView { + /// Base pointer + pub data: *mut u8, + /// Current size in bytes + pub size: usize, + /// Number of pages + pub pages: usize, + /// Maximum pages + pub max_pages: usize, +} + +/// WASM execution context +#[repr(C)] +#[derive(Clone, Copy, Debug)] +pub struct ExecutionContext { + /// Module being executed + pub module: WasmModule, + /// Memory view + pub memory: WasmMemoryView, + /// Call depth + pub call_depth: usize, + /// Fuel consumed + pub fuel_consumed: c_ulong, + /// Execution result + pub result: WasmResult, + /// Whether a trap occurred + pub trapped: bool, +} + +// ─── Value Construction ─────────────────────────────────────────────── + +/// Create an i32 WASM value +#[no_mangle] +pub extern "C" fn trios_wasm_value_i32(val: i32) -> WasmValue { + WasmValue { + value_type: WasmValueType::I32, + data: WasmValueData { i32_val: val }, + } +} + +/// Create an i64 WASM value +#[no_mangle] +pub extern "C" fn trios_wasm_value_i64(val: i64) -> WasmValue { + WasmValue { + value_type: WasmValueType::I64, + data: WasmValueData { i64_val: val }, + } +} + +/// Create an f32 WASM value +#[no_mangle] +pub extern "C" fn trios_wasm_value_f32(val: f32) -> WasmValue { + WasmValue { + value_type: WasmValueType::F32, + data: WasmValueData { f32_val: val }, + } +} + +/// Create an f64 WASM value +#[no_mangle] +pub extern "C" fn trios_wasm_value_f64(val: f64) -> WasmValue { + WasmValue { + value_type: WasmValueType::F64, + data: WasmValueData { f64_val: val }, + } +} + +/// Create a Trit WASM value +#[no_mangle] +pub extern "C" fn trios_wasm_value_trit(val: i8) -> WasmValue { + WasmValue { + value_type: WasmValueType::Trit, + data: WasmValueData { trit_val: val.clamp(-1, 1) }, + } +} + +/// Read i32 from a WASM value (returns 0 if type mismatch) +#[no_mangle] +pub extern "C" fn trios_wasm_value_as_i32(val: WasmValue) -> i32 { + if val.value_type == WasmValueType::I32 { + unsafe { val.data.i32_val } + } else { + 0 + } +} + +/// Read f64 from a WASM value (returns 0.0 if type mismatch) +#[no_mangle] +pub extern "C" fn trios_wasm_value_as_f64(val: WasmValue) -> f64 { + if val.value_type == WasmValueType::F64 { + unsafe { val.data.f64_val } + } else { + 0.0 + } +} + +/// Read trit from a WASM value (returns 0 if type mismatch) +#[no_mangle] +pub extern "C" fn trios_wasm_value_as_trit(val: WasmValue) -> i8 { + if val.value_type == WasmValueType::Trit { + unsafe { val.data.trit_val } + } else { + 0 + } +} + +// ─── Module Construction ────────────────────────────────────────────── + +/// Create a new WASM module descriptor +#[no_mangle] +pub extern "C" fn trios_wasm_module_new( + name: *const c_char, + binary_size: usize, + initial_pages: usize, + max_pages: usize, +) -> WasmModule { + let mut module: WasmModule = unsafe { std::mem::zeroed() }; + module.state = ModuleState::Loaded; + module.binary_size = binary_size; + module.initial_pages = initial_pages; + module.max_pages = max_pages.min(MAX_MEMORY_PAGES); + module.trinity_extensions = false; + + if !name.is_null() { + let cstr = unsafe { std::ffi::CStr::from_ptr(name) }; + let bytes = cstr.to_bytes(); + let len = bytes.len().min(MAX_MODULE_NAME_LEN - 1); + module.name[..len].copy_from_slice(unsafe { std::mem::transmute::<&[u8], &[c_char]>(&bytes[..len]) }); + module.name[len] = 0; + } + + module +} + +/// Check if a module uses Trinity extensions +#[no_mangle] +pub extern "C" fn trios_wasm_module_has_trinity_ext(module: *const WasmModule) -> bool { + if module.is_null() { + return false; + } + unsafe { (*module).trinity_extensions } +} + +// ─── Instance Configuration ─────────────────────────────────────────── + +/// Create default instance configuration +#[no_mangle] +pub extern "C" fn trios_wasm_instance_config_default() -> InstanceConfig { + InstanceConfig { + initial_pages: 1, + max_pages: MAX_MEMORY_PAGES, + stack_size: 64 * 1024, // 64 KB + timeout_ms: 0, + trinity_opcodes: false, + fuel: 0, + debug: false, + } +} + +/// Create Trinity-optimized instance configuration +#[no_mangle] +pub extern "C" fn trios_wasm_instance_config_trinity() -> InstanceConfig { + InstanceConfig { + initial_pages: 4, + max_pages: MAX_MEMORY_PAGES, + stack_size: 128 * 1024, // 128 KB + timeout_ms: 30_000, + trinity_opcodes: true, + fuel: 1_000_000, + debug: false, + } +} + +// ─── Memory Operations ──────────────────────────────────────────────── + +/// Create a memory view +#[no_mangle] +pub extern "C" fn trios_wasm_memory_view( + data: *mut u8, + size: usize, + max_pages: usize, +) -> WasmMemoryView { + WasmMemoryView { + data, + size, + pages: size / WASM_PAGE_SIZE, + max_pages, + } +} + +/// Calculate byte offset for a given page and offset +#[no_mangle] +pub extern "C" fn trios_wasm_memory_offset(page: usize, offset: usize) -> usize { + page * WASM_PAGE_SIZE + offset +} + +/// Calculate number of pages needed for a given byte size +#[no_mangle] +pub extern "C" fn trios_wasm_pages_needed(byte_size: usize) -> usize { + (byte_size + WASM_PAGE_SIZE - 1) / WASM_PAGE_SIZE +} + +// ─── Function Signature ────────────────────────────────────────────── + +/// Create an empty function signature +#[no_mangle] +pub extern "C" fn trios_wasm_func_signature_new() -> FuncSignature { + FuncSignature { + params: [WasmValueType::I32; MAX_FUNC_ARGS], + param_count: 0, + results: [WasmValueType::I32; MAX_FUNC_ARGS], + result_count: 0, + } +} + +/// Add a parameter to a function signature +#[no_mangle] +pub extern "C" fn trios_wasm_func_signature_add_param( + sig: *mut FuncSignature, + param_type: WasmValueType, +) -> bool { + if sig.is_null() { + return false; + } + unsafe { + if (*sig).param_count >= MAX_FUNC_ARGS { + return false; + } + (*sig).params[(*sig).param_count] = param_type; + (*sig).param_count += 1; + true + } +} + +/// Add a result type to a function signature +#[no_mangle] +pub extern "C" fn trios_wasm_func_signature_add_result( + sig: *mut FuncSignature, + result_type: WasmValueType, +) -> bool { + if sig.is_null() { + return false; + } + unsafe { + if (*sig).result_count >= MAX_FUNC_ARGS { + return false; + } + (*sig).results[(*sig).result_count] = result_type; + (*sig).result_count += 1; + true + } +} + +// ─── Execution Context ──────────────────────────────────────────────── + +/// Create an execution context +#[no_mangle] +pub extern "C" fn trios_wasm_exec_context_new( + module: WasmModule, + memory: WasmMemoryView, +) -> ExecutionContext { + ExecutionContext { + module, + memory, + call_depth: 0, + fuel_consumed: 0, + result: WasmResult::Ok, + trapped: false, + } +} + +/// Check if execution context is in a valid state +#[no_mangle] +pub extern "C" fn trios_wasm_exec_context_ok(ctx: *const ExecutionContext) -> bool { + if ctx.is_null() { + return false; + } + unsafe { !(*ctx).trapped && (*ctx).result == WasmResult::Ok } +} + +/// Get Trinity custom opcode for a given operation index +#[no_mangle] +pub extern "C" fn trios_wasm_trinity_opcode(op_index: u32) -> u32 { + TRINITY_OPCODE_BASE + op_index +} + +/// Check if an opcode is a Trinity extension +#[no_mangle] +pub extern "C" fn trios_wasm_is_trinity_opcode(opcode: u32) -> bool { + opcode >= TRINITY_OPCODE_BASE && opcode < TRINITY_OPCODE_BASE + 256 +} + +// ─── Unit Tests ─────────────────────────────────────────────────────── + +#[cfg(test)] +mod tests { + use super::*; + + #[test] + fn test_value_i32() { + let val = trios_wasm_value_i32(42); + assert_eq!(val.value_type, WasmValueType::I32); + assert_eq!(trios_wasm_value_as_i32(val), 42); + } + + #[test] + fn test_value_f64() { + let val = trios_wasm_value_f64(3.14); + assert_eq!(val.value_type, WasmValueType::F64); + assert!((trios_wasm_value_as_f64(val) - 3.14).abs() < 1e-10); + } + + #[test] + fn test_value_trit() { + let val = trios_wasm_value_trit(1); + assert_eq!(val.value_type, WasmValueType::Trit); + assert_eq!(trios_wasm_value_as_trit(val), 1); + + let clamped = trios_wasm_value_trit(5); + assert_eq!(trios_wasm_value_as_trit(clamped), 1); + } + + #[test] + fn test_value_type_mismatch() { + let val = trios_wasm_value_i32(42); + assert_eq!(trios_wasm_value_as_f64(val), 0.0); + assert_eq!(trios_wasm_value_as_trit(val), 0); + } + + #[test] + fn test_module_new() { + let module = trios_wasm_module_new( + b"test_module\0".as_ptr() as *const c_char, + 1024, + 1, + 16, + ); + assert_eq!(module.state, ModuleState::Loaded); + assert_eq!(module.binary_size, 1024); + assert_eq!(module.initial_pages, 1); + assert_eq!(module.max_pages, 16); + } + + #[test] + fn test_instance_config_default() { + let config = trios_wasm_instance_config_default(); + assert_eq!(config.initial_pages, 1); + assert!(!config.trinity_opcodes); + assert!(!config.debug); + } + + #[test] + fn test_instance_config_trinity() { + let config = trios_wasm_instance_config_trinity(); + assert_eq!(config.initial_pages, 4); + assert!(config.trinity_opcodes); + assert_eq!(config.fuel, 1_000_000); + } + + #[test] + fn test_memory_offset() { + assert_eq!(trios_wasm_memory_offset(0, 0), 0); + assert_eq!(trios_wasm_memory_offset(1, 0), WASM_PAGE_SIZE); + assert_eq!(trios_wasm_memory_offset(2, 100), 2 * WASM_PAGE_SIZE + 100); + } + + #[test] + fn test_pages_needed() { + assert_eq!(trios_wasm_pages_needed(0), 0); + assert_eq!(trios_wasm_pages_needed(1), 1); + assert_eq!(trios_wasm_pages_needed(WASM_PAGE_SIZE), 1); + assert_eq!(trios_wasm_pages_needed(WASM_PAGE_SIZE + 1), 2); + } + + #[test] + fn test_func_signature() { + let mut sig = trios_wasm_func_signature_new(); + assert_eq!(sig.param_count, 0); + + assert!(trios_wasm_func_signature_add_param(&mut sig, WasmValueType::I32)); + assert!(trios_wasm_func_signature_add_param(&mut sig, WasmValueType::F64)); + assert!(trios_wasm_func_signature_add_result(&mut sig, WasmValueType::I32)); + assert_eq!(sig.param_count, 2); + assert_eq!(sig.result_count, 1); + } + + #[test] + fn test_trinity_opcodes() { + let op = trios_wasm_trinity_opcode(0); + assert_eq!(op, TRINITY_OPCODE_BASE); + assert!(trios_wasm_is_trinity_opcode(TRINITY_OPCODE_BASE)); + assert!(trios_wasm_is_trinity_opcode(TRINITY_OPCODE_BASE + 100)); + assert!(!trios_wasm_is_trinity_opcode(0)); + assert!(!trios_wasm_is_trinity_opcode(0xEF00)); + } + + #[test] + fn test_exec_context() { + let module = trios_wasm_module_new( + b"test\0".as_ptr() as *const c_char, + 512, + 1, + 4, + ); + let memory = trios_wasm_memory_view(std::ptr::null_mut(), WASM_PAGE_SIZE, 4); + let ctx = trios_wasm_exec_context_new(module, memory); + assert!(trios_wasm_exec_context_ok(&ctx)); + assert_eq!(ctx.call_depth, 0); + } +} diff --git a/src/vsa/root.zig b/src/vsa/root.zig new file mode 100644 index 0000000000..4719193ce3 --- /dev/null +++ b/src/vsa/root.zig @@ -0,0 +1,3 @@ +//! VSA wrapper — resolves vm.zig imports to vsa.zig +pub const vsa = @import("vsa_core/root.zig"); +pub use vsa.*; diff --git a/vendor/trinity-brain b/vendor/trinity-brain new file mode 160000 index 0000000000..d280081847 --- /dev/null +++ b/vendor/trinity-brain @@ -0,0 +1 @@ +Subproject commit d2800818477e06fa081e90319bf9367e4a318957 diff --git a/vendor/zig-hybrid/build.zig b/vendor/zig-hybrid/build.zig new file mode 100644 index 0000000000..d84d88c9e9 --- /dev/null +++ b/vendor/zig-hybrid/build.zig @@ -0,0 +1,12 @@ +const std = @import("std"); + +pub fn build(b: *std.Build) void { + const lib = b.addStaticLibrary(.{ + .name = "hybrid", + .root_source_file = b.path("src/hybrid.zig"), + .target = b.standardTargetOptions(.{}), + .optimize = b.standardOptimizeOption(.{}), + }); + + b.installArtifact(lib); +} diff --git a/vendor/zig-vm/build.zig b/vendor/zig-vm/build.zig new file mode 100644 index 0000000000..8d32b15bd5 --- /dev/null +++ b/vendor/zig-vm/build.zig @@ -0,0 +1,29 @@ +const std = @import("std"); + +pub fn build(b: *std.Build) void { + const target = b.standardTargetOptions(.{}); + const optimize = b.standardOptimizeOption(.{}); + + // Get package dependencies + const vsa_dep = b.dependency("vsa", .{ + .target = target, + .optimize = optimize, + }); + const hybrid_dep = b.dependency("hybrid", .{ + .target = target, + .optimize = optimize, + }); + + const lib = b.addStaticLibrary(.{ + .name = "vm", + .root_source_file = b.path("src/vm.zig"), + .target = target, + .optimize = optimize, + }); + + // Wire package dependencies + lib.root_module.addImport("vsa", vsa_dep.module("vsa")); + lib.root_module.addImport("hybrid", hybrid_dep.module("hybrid")); + + b.installArtifact(lib); +} diff --git a/vendor/zig-vsa/build.zig b/vendor/zig-vsa/build.zig new file mode 100644 index 0000000000..5d33552691 --- /dev/null +++ b/vendor/zig-vsa/build.zig @@ -0,0 +1,12 @@ +const std = @import("std"); + +pub fn build(b: *std.Build) void { + const lib = b.addStaticLibrary(.{ + .name = "vsa", + .root_source_file = b.path("src/vsa.zig"), + .target = b.standardTargetOptions(.{}), + .optimize = b.standardOptimizeOption(.{}), + }); + + b.installArtifact(lib); +} From 9acaebd248e95c7e9fccf5a9cf972498f71b111a Mon Sep 17 00:00:00 2001 From: Dmitrii Vasilev Date: Wed, 17 Jun 2026 19:42:51 +0700 Subject: [PATCH 04/12] chore: local backup --- vendor/trinity-brain | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/vendor/trinity-brain b/vendor/trinity-brain index d280081847..023b13c714 160000 --- a/vendor/trinity-brain +++ b/vendor/trinity-brain @@ -1 +1 @@ -Subproject commit d2800818477e06fa081e90319bf9367e4a318957 +Subproject commit 023b13c714beaad7cd82e172f725ec8321367c1c From 5cb0f559ade5661c2c9486191cf19c3a475384c5 Mon Sep 17 00:00:00 2001 From: Dmitrii Vasilev Date: Sun, 26 Jul 2026 14:13:11 +0700 Subject: [PATCH 05/12] feat(queen-ui): rename 999 menu EXPLAIN petal to LOGS Trios now hosts a unified LOGS workspace at Cmd+3 (third Razum petal). Keep the canonical QueenUILib world label aligned with the hosted route. Co-Authored-By: Claude Opus 4.8 --- apps/queen/QueenUI/Widgets/TriangleLogo.swift | 112 +++++++++--------- 1 file changed, 53 insertions(+), 59 deletions(-) diff --git a/apps/queen/QueenUI/Widgets/TriangleLogo.swift b/apps/queen/QueenUI/Widgets/TriangleLogo.swift index 6e27922abb..079bf70ea8 100644 --- a/apps/queen/QueenUI/Widgets/TriangleLogo.swift +++ b/apps/queen/QueenUI/Widgets/TriangleLogo.swift @@ -1,9 +1,16 @@ import SwiftUI +enum TriangleMenuPresentation { + static let showsRealmLabels = false + static let specialAnimatedPetal: Int? = nil + static let normalPetalOpacity = 0.22 +} + struct TriangleLogo: View { @Binding var selectedScreen: Screen? + let hostedRoutes: [Int: QueenHostedRoute] + let onSelect: (Int) -> Void @State private var hoveredBlock: Int? = nil - @State private var ralphPulseTime: Double = 0 // SVG viewBox constants from photon_trinity_canvas.zig static let svgWidth: CGFloat = 596 @@ -74,7 +81,7 @@ struct TriangleLogo: View { // RAZUM (0-8) ("CHAT", "phi = 1.618"), ("CODE", "pi*phi*e = 13.82"), - ("EXPLAIN", "L(10) = 123"), + ("LOGS", "L(10) = 123"), ("DEBUG", "1/a = 137.036"), ("REVIEW", "phi2 = phi+1 = 2.618"), ("TRANSLATE", "Feigenbaum d = 4.669"), @@ -110,38 +117,25 @@ struct TriangleLogo: View { Color(red: 189.0/255.0, green: 147.0/255.0, blue: 249.0/255.0), // Purple (DUKH) ] - // Realm labels - static let realmLabels: [(name: String, symbol: String)] = [ - ("RAZUM", "phi"), - ("MATERIYA", "pi"), - ("DUKH", "e"), - ] - var body: some View { GeometryReader { geo in let scale = min(geo.size.width / Self.svgWidth, geo.size.height / Self.svgHeight) * 0.63 let offsetX = geo.size.width / 2 let offsetY = geo.size.height / 2 - makeTimelineView(scale: scale, offsetX: offsetX, offsetY: offsetY) + makeContentView(scale: scale, offsetX: offsetX, offsetY: offsetY) } } - private func makeTimelineView(scale: CGFloat, offsetX: CGFloat, offsetY: CGFloat) -> some View { - LogoTimelineView { time in - makeContentView(time: time, scale: scale, offsetX: offsetX, offsetY: offsetY) - } - } - - private func makeContentView(time: TimeInterval, scale: CGFloat, offsetX: CGFloat, offsetY: CGFloat) -> some View { + private func makeContentView(scale: CGFloat, offsetX: CGFloat, offsetY: CGFloat) -> some View { ZStack { - makePetalCanvas(time: time, scale: scale, offsetX: offsetX, offsetY: offsetY) + makePetalCanvas(scale: scale, offsetX: offsetX, offsetY: offsetY) makeRealmLabels(scale: scale, offsetX: offsetX, offsetY: offsetY) makeTooltipView(scale: scale, offsetX: offsetX, offsetY: offsetY) } } - private func makePetalCanvas(time: TimeInterval, scale: CGFloat, offsetX: CGFloat, offsetY: CGFloat) -> some View { + private func makePetalCanvas(scale: CGFloat, offsetX: CGFloat, offsetY: CGFloat) -> some View { Canvas { context, _ in for (idx, block) in Self.rawBlocks.enumerated() { let path = petalPath(block, scale: scale, ox: offsetX, oy: offsetY) @@ -149,18 +143,17 @@ struct TriangleLogo: View { let isHovered = hoveredBlock == idx let isSelected = selectedScreen == Screen.screenForBlock(idx) - // Fill: black (normal), white (hover), realm color (selected) + // Idle petals share one translucent fill so the host glass + // remains visible. Hover and selection retain clear feedback. let fillColor: Color = { if isSelected { return Self.realmColors[realm] } else if isHovered { return .white - } else if idx == 2 { - // Ralph pulse: cyan with oscillating alpha sin(t*3)*40+80 → 40-120/255 - let alpha = sin(time * 3.0) * (40.0 / 255.0) + (80.0 / 255.0) - return Color(red: 0, green: 0xCC / 255.0, blue: 1.0).opacity(alpha) } else { - return .black + return Color.black.opacity( + TriangleMenuPresentation.normalPetalOpacity + ) } }() @@ -171,7 +164,7 @@ struct TriangleLogo: View { } .onTapGesture { location in if let idx = hitTest(location, scale: scale, ox: offsetX, oy: offsetY) { - selectedScreen = Screen.screenForBlock(idx) + onSelect(idx) } } .onContinuousHover { phase in @@ -187,25 +180,46 @@ struct TriangleLogo: View { } private func makeRealmLabels(scale: CGFloat, offsetX: CGFloat, offsetY: CGFloat) -> some View { - ZStack { - realmLabel("RAZUM (phi)", color: Self.realmColors[0], - x: offsetX + (100 - Self.svgCenterX) * scale, - y: offsetY + (60 - Self.svgCenterY) * scale) - realmLabel("MATERIYA (pi)", color: Self.realmColors[1], - x: offsetX + (490 - Self.svgCenterX) * scale, - y: offsetY + (60 - Self.svgCenterY) * scale) - realmLabel("DUKH (e)", color: Self.realmColors[2], - x: offsetX, - y: offsetY + (520 - Self.svgCenterY) * scale) + Group { + if TriangleMenuPresentation.showsRealmLabels { + ZStack { + realmLabel("RAZUM (phi)", color: Self.realmColors[0], + x: offsetX + (100 - Self.svgCenterX) * scale, + y: offsetY + (60 - Self.svgCenterY) * scale) + realmLabel("MATERIYA (pi)", color: Self.realmColors[1], + x: offsetX + (490 - Self.svgCenterX) * scale, + y: offsetY + (60 - Self.svgCenterY) * scale) + realmLabel("DUKH (e)", color: Self.realmColors[2], + x: offsetX, + y: offsetY + (520 - Self.svgCenterY) * scale) + } + } } } @ViewBuilder private func makeTooltipView(scale: CGFloat, offsetX: CGFloat, offsetY: CGFloat) -> some View { if let hov = hoveredBlock, hov >= 0, hov < Self.worlds.count { - let world = Self.worlds[hov] - let screen = Screen.screenForBlock(hov) - Text("\(screen.icon) \(world.name) — \(world.formula)") + let shortcut = QueenMenuShortcutPolicy.label(forPetalIndex: hov) + let label: String = { + if let route = hostedRoutes[hov] { + return [ + "\(route.worldName) - \(route.formula)", + shortcut, + ] + .compactMap { $0 } + .joined(separator: " ") + } + let world = Self.worlds[hov] + let screen = Screen.screenForBlock(hov) + return [ + "\(screen.icon) \(world.name) - \(world.formula)", + shortcut, + ] + .compactMap { $0 } + .joined(separator: " ") + }() + Text(label) .font(WernickeTypography.smallSemiboldMono) .foregroundStyle(.black) .padding(.horizontal, ParietalSpacing.sm) @@ -284,23 +298,3 @@ struct TriangleLogo: View { .allowsHitTesting(false) } } - -// MARK: - Logo Timeline View Helper - -struct LogoTimelineView: View { - let content: (TimeInterval) -> Content - @State private var timer: Timer? - @State private var startTime = Date() - - init(@ViewBuilder content: @escaping (TimeInterval) -> Content) { - self.content = content - } - - var body: some View { - content(Date().timeIntervalSince(startTime)) - .onAppear { - startTime = Date() - } - } -} - From a8fec1de51f2f8454b9c8b44dfa88520989ab5e0 Mon Sep 17 00:00:00 2001 From: Dmitrii Vasilev Date: Tue, 28 Jul 2026 14:15:07 +0700 Subject: [PATCH 06/12] chore: backup local changes 2026-07-28 --- apps/queen/Package.swift | 10 +- apps/queen/QueenUI/Bridge/ActionQueue.swift | 311 ++++++++++++-- apps/queen/QueenUI/Bridge/EnvLoader.swift | 6 +- apps/queen/QueenUI/Bridge/ModelProvider.swift | 97 ++++- apps/queen/QueenUI/Bridge/QueenBridge.swift | 2 +- apps/queen/QueenUI/Bridge/RepoContext.swift | 2 +- apps/queen/QueenUI/Bridge/StateWatcher.swift | 2 +- apps/queen/QueenUI/Bridge/TriBridge.swift | 2 +- .../queen/QueenUI/Bridge/TrinityContext.swift | 8 +- .../QueenUI/Bridge/TrinityRuntimePaths.swift | 66 +++ .../QueenUI/Cortex/Visual/v4_color.swift | 22 +- .../Integration/EmbeddedQueenRoot.swift | 61 +++ .../Integration/QueenHostedRoute.swift | 46 +++ .../QueenOperationalWorkspace.swift | 216 ++++++++++ apps/queen/QueenUI/Navigation/MainView.swift | 216 +++++++--- .../Navigation/QueenMenuShortcutPolicy.swift | 66 +++ apps/queen/QueenUI/Navigation/Screen.swift | 10 +- .../QueenUI/Navigation/ScreenRouter.swift | 38 +- .../QueenUI/Screens/Body/BuildScreen.swift | 2 +- .../QueenUI/Screens/Body/DeployScreen.swift | 2 +- .../QueenUI/Screens/Body/GitScreen.swift | 4 +- .../QueenUI/Screens/Body/IssuesScreen.swift | 4 +- .../QueenUI/Screens/Body/StateScreen.swift | 2 +- .../QueenUI/Screens/Body/TodoPanelView.swift | 384 ++++++++++++++++++ .../Screens/Brain/ArenaCodeScreen.swift | 2 +- .../Screens/Brain/ArenaLLMScreen.swift | 2 +- .../QueenUI/Screens/Brain/ChatScreen.swift | 55 ++- .../Screens/Brain/MUMemoryScreen.swift | 2 +- .../QueenUI/Screens/Brain/SwarmScreen.swift | 2 +- .../Screens/Spirit/ExperienceScreen.swift | 2 +- .../QueenUI/Screens/Spirit/FPGAScreen.swift | 6 +- .../Screens/Spirit/PipelineScreen.swift | 4 +- .../Screens/Spirit/SettingsScreen.swift | 28 +- .../Screens/Spirit/TechTreeScreen.swift | 2 +- .../QueenUI/Screens/Tri/TriToolsPanel.swift | 10 +- .../QueenUI/Screens/Tri/TriToolsScreen.swift | 332 ++++++++++++++- .../QueenUI/Widgets/AgentStreamView.swift | 1 + .../Widgets/TaskTrackerPanelView.swift | 374 +++++++++++++++++ .../QueenUI/Widgets/TriToolsChatPanel.swift | 2 +- .../Tests/QueenUITests/HostedRouteTests.swift | 35 ++ .../MenuShortcutPolicyTests.swift | 107 +++++ .../QueenUITests/ModelProviderTests.swift | 33 ++ .../OperationalWorkspaceTests.swift | 108 +++++ .../TriangleMenuPresentationTests.swift | 18 + 44 files changed, 2499 insertions(+), 205 deletions(-) create mode 100644 apps/queen/QueenUI/Bridge/TrinityRuntimePaths.swift create mode 100644 apps/queen/QueenUI/Integration/EmbeddedQueenRoot.swift create mode 100644 apps/queen/QueenUI/Integration/QueenHostedRoute.swift create mode 100644 apps/queen/QueenUI/Integration/QueenOperationalWorkspace.swift create mode 100644 apps/queen/QueenUI/Navigation/QueenMenuShortcutPolicy.swift create mode 100644 apps/queen/QueenUI/Screens/Body/TodoPanelView.swift create mode 100644 apps/queen/QueenUI/Widgets/TaskTrackerPanelView.swift create mode 100644 apps/queen/Tests/QueenUITests/HostedRouteTests.swift create mode 100644 apps/queen/Tests/QueenUITests/MenuShortcutPolicyTests.swift create mode 100644 apps/queen/Tests/QueenUITests/OperationalWorkspaceTests.swift create mode 100644 apps/queen/Tests/QueenUITests/TriangleMenuPresentationTests.swift diff --git a/apps/queen/Package.swift b/apps/queen/Package.swift index db16c3c082..831d156f03 100644 --- a/apps/queen/Package.swift +++ b/apps/queen/Package.swift @@ -7,7 +7,15 @@ let package = Package( .macOS(.v14), .iOS(.v17) ], - products: [], + products: [ + .library( + name: "QueenUILib", + type: .dynamic, + targets: ["QueenUILib"]), + .executable( + name: "trinity", + targets: ["trinity"]), + ], targets: [ .target( name: "QueenUILib", diff --git a/apps/queen/QueenUI/Bridge/ActionQueue.swift b/apps/queen/QueenUI/Bridge/ActionQueue.swift index 6779a7e822..db334ba43d 100644 --- a/apps/queen/QueenUI/Bridge/ActionQueue.swift +++ b/apps/queen/QueenUI/Bridge/ActionQueue.swift @@ -1,56 +1,258 @@ import Foundation import SwiftUI -/// Central action dispatcher — writes actions to .trinity/queen/actions_queue.json -/// Queen Zig daemon reads and executes them on next cycle +enum QueenActionRisk: Equatable { + case safe + case requiresConfirmation +} + +enum QueenActionHandling: Equatable { + case refresh + case clearQueue + case queenRuntime +} + +struct QueenActionDefinition: Equatable { + let id: String + let title: String + let risk: QueenActionRisk + let handling: QueenActionHandling +} + +enum QueenActionCatalog { + static let all: [QueenActionDefinition] = [ + action("build", "Rebuild", .safe), + action("cell_create", "Create cell", .requiresConfirmation), + action("farm_evolve", "Evolve farm", .requiresConfirmation), + action("farm_kill_idle", "Kill idle services", .requiresConfirmation), + action("git_commit", "Commit state", .requiresConfirmation), + action("git_push", "Push changes", .requiresConfirmation), + refresh("issues_refresh", "Refresh issues"), + refresh("keys_test", "Test keys"), + action("pipeline_run", "Run pipeline", .requiresConfirmation), + action("queen_approve", "Approve action", .requiresConfirmation), + action("queen_deny", "Deny action", .requiresConfirmation), + QueenActionDefinition( + id: "queue_clear", + title: "Clear action queue", + risk: .requiresConfirmation, + handling: .clearQueue + ), + action("redeploy", "Redeploy", .requiresConfirmation), + action("scholar_research", "Start research", .safe), + action("swarm_decompose", "Decompose task", .requiresConfirmation), + refresh("telegram_check", "Check Telegram"), + action("telegram_test", "Send Telegram test", .requiresConfirmation), + ] + + static func definition(for id: String) -> QueenActionDefinition? { + all.first { $0.id == id } + } + + private static func action( + _ id: String, + _ title: String, + _ risk: QueenActionRisk + ) -> QueenActionDefinition { + QueenActionDefinition( + id: id, + title: title, + risk: risk, + handling: .queenRuntime + ) + } + + private static func refresh( + _ id: String, + _ title: String + ) -> QueenActionDefinition { + QueenActionDefinition( + id: id, + title: title, + risk: .safe, + handling: .refresh + ) + } +} + +struct QueenActionEnvelope: Codable, Equatable { + let timestamp: Int + let action: String + let params: [String: String] + + enum CodingKeys: String, CodingKey { + case timestamp = "ts" + case action + case params + } +} + +enum QueenActionCodec { + static func encode(_ actions: [QueenActionEnvelope]) throws -> Data { + let encoder = JSONEncoder() + encoder.outputFormatting = [.sortedKeys, .withoutEscapingSlashes] + return try encoder.encode(actions) + } + + static func decode(_ data: Data) throws -> [QueenActionEnvelope] { + try JSONDecoder().decode([QueenActionEnvelope].self, from: data) + } +} + +enum QueenActionPhase: Equatable { + case queued + case running + case succeeded + case failed +} + +struct QueenActionFeedback: Identifiable, Equatable { + let id = UUID() + let actionID: String + let title: String + let detail: String + let phase: QueenActionPhase +} + +extension Notification.Name { + static let queenWorkspaceRefresh = Notification.Name( + "com.trinity.queen.workspace-refresh" + ) +} + +/// Central action dispatcher. Runtime actions are written to a durable compact +/// JSON queue; local refresh and clear operations complete immediately. @MainActor class ActionQueue: ObservableObject { static let shared = ActionQueue() @Published var lastEnqueued: String? @Published var isProcessing = false + @Published var feedback: QueenActionFeedback? private var queuePath: String { - let cwd = FileManager.default.currentDirectoryPath + let cwd = TrinityRuntimePaths.projectRoot return "\(cwd)/.trinity/queen/actions_queue.json" } func enqueue(_ action: String, params: [String: String] = [:]) { - let entry: [String: Any] = [ - "ts": Int(Date().timeIntervalSince1970), - "action": action, - "params": params, - ] - - // Read existing queue or create new - var queue: [[String: Any]] = [] - if let data = try? Data(contentsOf: URL(fileURLWithPath: queuePath)), - let existing = try? JSONSerialization.jsonObject(with: data) as? [[String: Any]] { - queue = existing + guard let definition = QueenActionCatalog.definition(for: action) else { + showFeedback( + actionID: action, + title: "Unknown action", + detail: "\(action) is not declared in the Queen action catalog.", + phase: .failed + ) + return + } + + switch definition.handling { + case .refresh: + lastEnqueued = action + NotificationCenter.default.post( + name: .queenWorkspaceRefresh, + object: action + ) + showFeedback( + actionID: action, + title: definition.title, + detail: "Live workspace data refreshed.", + phase: .succeeded + ) + case .clearQueue: + clearDurableQueue(definition: definition) + case .queenRuntime: + enqueueForRuntime(definition: definition, params: params) } + } - queue.append(entry) + func dismissFeedback() { + feedback = nil + } - // Ensure directory exists - let dir = (queuePath as NSString).deletingLastPathComponent - try? FileManager.default.createDirectory(atPath: dir, withIntermediateDirectories: true) + private func enqueueForRuntime( + definition: QueenActionDefinition, + params: [String: String] + ) { + let url = URL(fileURLWithPath: queuePath) + var queue: [QueenActionEnvelope] = [] - // Write - if let data = try? JSONSerialization.data(withJSONObject: queue, options: [.prettyPrinted]) { - try? data.write(to: URL(fileURLWithPath: queuePath)) + if let data = try? Data(contentsOf: url) { + queue = (try? QueenActionCodec.decode(data)) ?? [] } - lastEnqueued = action - isProcessing = true + queue.append( + QueenActionEnvelope( + timestamp: Int(Date().timeIntervalSince1970), + action: definition.id, + params: params + ) + ) + + do { + let directory = url.deletingLastPathComponent() + try FileManager.default.createDirectory( + at: directory, + withIntermediateDirectories: true + ) + let data = try QueenActionCodec.encode(queue) + try data.write(to: url, options: .atomic) + + lastEnqueued = definition.id + isProcessing = false + showFeedback( + actionID: definition.id, + title: definition.title, + detail: "Queued durably for the Queen runtime.", + phase: .queued + ) + } catch { + isProcessing = false + showFeedback( + actionID: definition.id, + title: "\(definition.title) failed", + detail: error.localizedDescription, + phase: .failed + ) + } + } - // Reset processing indicator after 3s - Task { - try? await Task.sleep(for: .seconds(3)) - await MainActor.run { - isProcessing = false + private func clearDurableQueue(definition: QueenActionDefinition) { + let url = URL(fileURLWithPath: queuePath) + do { + if FileManager.default.fileExists(atPath: url.path) { + try FileManager.default.removeItem(at: url) } + lastEnqueued = definition.id + showFeedback( + actionID: definition.id, + title: definition.title, + detail: "The durable Queen action queue is empty.", + phase: .succeeded + ) + } catch { + showFeedback( + actionID: definition.id, + title: "\(definition.title) failed", + detail: error.localizedDescription, + phase: .failed + ) } } + + private func showFeedback( + actionID: String, + title: String, + detail: String, + phase: QueenActionPhase + ) { + feedback = QueenActionFeedback( + actionID: actionID, + title: title, + detail: detail, + phase: phase + ) + } } /// Reusable action button style for dashboard screens @@ -61,24 +263,65 @@ struct ActionButton: View { var action: String var params: [String: String] = [:] - @StateObject private var queue = ActionQueue.shared + @ObservedObject private var queue = ActionQueue.shared + @State private var showsConfirmation = false var body: some View { Button { - ActionQueue.shared.enqueue(action, params: params) + if definition?.risk == .requiresConfirmation { + showsConfirmation = true + } else { + submit() + } } label: { HStack(spacing: ParietalSpacing.xxs) { - Text(icon) - .font(WernickeTypography.caption) + if queue.isProcessing && queue.lastEnqueued == action { + ProgressView() + .controlSize(.mini) + } else { + Text(icon) + .font(WernickeTypography.caption) + } Text(label) .font(WernickeTypography.captionBold) } - .foregroundStyle(.black) + .foregroundStyle(V4Color.textPrimary) .padding(.horizontal, ParietalSpacing.sm) .padding(.vertical, ParietalSpacing.xxs) - .background(color) + .background(V4Color.surface) .clipShape(SwiftUI.Capsule()) + .overlay { + SwiftUI.Capsule() + .stroke(color.opacity(0.64), lineWidth: 1) + } } .buttonStyle(.plain) + .confirmationDialog( + definition?.title ?? label, + isPresented: $showsConfirmation, + titleVisibility: .visible + ) { + Button("Confirm", role: confirmationRole) { + submit() + } + Button("Cancel", role: .cancel) {} + } message: { + Text("This action can change project or external state.") + } + .help(definition?.title ?? label) + } + + private var definition: QueenActionDefinition? { + QueenActionCatalog.definition(for: action) + } + + private var confirmationRole: ButtonRole? { + action == "farm_kill_idle" || action == "queue_clear" + ? .destructive + : nil + } + + private func submit() { + queue.enqueue(action, params: params) } } diff --git a/apps/queen/QueenUI/Bridge/EnvLoader.swift b/apps/queen/QueenUI/Bridge/EnvLoader.swift index 4b6f1bad1a..f33d08318a 100644 --- a/apps/queen/QueenUI/Bridge/EnvLoader.swift +++ b/apps/queen/QueenUI/Bridge/EnvLoader.swift @@ -38,9 +38,9 @@ struct EnvLoader { if parent == dir { break } dir = parent } - // Fallback to known project root - let fallback = FileManager.default.homeDirectoryForCurrentUser - .appendingPathComponent("trinity-w1/.env") + // Fallback to the configured project root. + let fallback = URL(fileURLWithPath: TrinityRuntimePaths.projectRoot) + .appendingPathComponent(".env") if FileManager.default.fileExists(atPath: fallback.path) { return fallback } diff --git a/apps/queen/QueenUI/Bridge/ModelProvider.swift b/apps/queen/QueenUI/Bridge/ModelProvider.swift index 488a9d3a4a..d5aa759a43 100644 --- a/apps/queen/QueenUI/Bridge/ModelProvider.swift +++ b/apps/queen/QueenUI/Bridge/ModelProvider.swift @@ -97,12 +97,32 @@ class ModelManager: ObservableObject { self.availableModels = models - // Restore saved selection or pick first available + // Restore saved selection or pick first available. let savedID = UserDefaults.standard.string(forKey: "selectedModelID") + let triosSelectedModel = UserDefaults.standard.string(forKey: "trios.model.ollama.selection") + var initialSelection: AIModel if let saved = savedID, let match = models.first(where: { $0.id == saved }) { - self.selectedModel = match + initialSelection = match } else { - self.selectedModel = models.first ?? AIModel.allModels[0] + initialSelection = AIModel.allModels[0] + } + if let preferredID = OllamaSelectionPolicy.preferredModelID( + currentModelID: initialSelection.id, + availableModelIDs: models.map(\.id), + discoveredModelNames: models + .filter { $0.provider == .ollama } + .map { String($0.id.dropFirst("ollama:".count)) }, + queenSavedModelID: savedID, + triosSelectedModel: triosSelectedModel + ), let preferred = models.first(where: { $0.id == preferredID }) { + initialSelection = preferred + } else if !models.contains(where: { $0.id == initialSelection.id }), + let fallback = models.first { + initialSelection = fallback + } + self.selectedModel = initialSelection + if initialSelection.provider == .ollama { + UserDefaults.standard.set(initialSelection.id, forKey: "selectedModelID") } // Start periodic Ollama detection @@ -123,14 +143,10 @@ class ModelManager: ObservableObject { let names = models.compactMap { $0["name"] as? String } guard !names.isEmpty else { return false } - // Update available Ollama models on main actor + // Update available Ollama models on main actor. UserDefaults.standard.set(true, forKey: "ollamaEnabled") UserDefaults.standard.set(names, forKey: "ollamaModels") - self.availableModels.removeAll { $0.provider == .ollama } - for name in names { - self.availableModels.append(AIModel(id: "ollama:\(name)", displayName: name, provider: .ollama)) - } - self.ollamaAvailable = true + installOllamaModels(names) return true } catch { self.availableModels.removeAll { $0.provider == .ollama } @@ -255,20 +271,15 @@ class ModelManager: ObservableObject { var request = URLRequest(url: url) request.timeoutInterval = 5 URLSession.shared.dataTask(with: request) { [weak self] data, _, error in - let hasModels: Bool if let data, let json = try? JSONSerialization.jsonObject(with: data) as? [String: Any], let models = json["models"] as? [[String: Any]] { let names = models.compactMap { $0["name"] as? String } UserDefaults.standard.set(names, forKey: "ollamaModels") UserDefaults.standard.set(true, forKey: "ollamaEnabled") - hasModels = !names.isEmpty - DispatchQueue.main.async { - self?.availableModels.removeAll { $0.provider == .ollama } - for name in names { - self?.availableModels.append(AIModel(id: "ollama:\(name)", displayName: name, provider: .ollama)) - } - self?.ollamaAvailable = hasModels + DispatchQueue.main.async { [weak self] in + guard let self else { return } + self.installOllamaModels(names) } } else { DispatchQueue.main.async { @@ -278,6 +289,34 @@ class ModelManager: ObservableObject { }.resume() } + private func installOllamaModels(_ names: [String]) { + let uniqueNames = names.reduce(into: [String]()) { result, name in + if !result.contains(name) { + result.append(name) + } + } + availableModels.removeAll { $0.provider == .ollama } + for name in uniqueNames { + availableModels.append( + AIModel(id: "ollama:\(name)", displayName: name, provider: .ollama) + ) + } + ollamaAvailable = !uniqueNames.isEmpty + + guard let preferredID = OllamaSelectionPolicy.preferredModelID( + currentModelID: selectedModel.id, + availableModelIDs: availableModels.map(\.id), + discoveredModelNames: uniqueNames, + queenSavedModelID: UserDefaults.standard.string(forKey: "selectedModelID"), + triosSelectedModel: UserDefaults.standard.string(forKey: "trios.model.ollama.selection") + ), let preferred = availableModels.first(where: { $0.id == preferredID }) else { + return + } + + selectedModel = preferred + persistSelection() + } + var hasAnyKey: Bool { !availableModels.isEmpty } func providerHasKey(_ provider: AIProvider) -> Bool { @@ -373,3 +412,27 @@ class ModelManager: ObservableObject { } } } + +enum OllamaSelectionPolicy { + static func preferredModelID( + currentModelID: String, + availableModelIDs: [String], + discoveredModelNames: [String], + queenSavedModelID: String?, + triosSelectedModel: String? + ) -> String? { + guard !availableModelIDs.contains(currentModelID) else { return nil } + + let discoveredIDs = discoveredModelNames.map { "ollama:\($0)" } + let available = Set(availableModelIDs) + let candidates = [queenSavedModelID, triosSelectedModel].compactMap { value -> String? in + guard let value, !value.isEmpty else { return nil } + return value.hasPrefix("ollama:") ? value : "ollama:\(value)" + } + + for candidate in candidates where discoveredIDs.contains(candidate) && available.contains(candidate) { + return candidate + } + return discoveredIDs.first(where: available.contains) + } +} diff --git a/apps/queen/QueenUI/Bridge/QueenBridge.swift b/apps/queen/QueenUI/Bridge/QueenBridge.swift index 8c20b1b62d..aac356fe4b 100644 --- a/apps/queen/QueenUI/Bridge/QueenBridge.swift +++ b/apps/queen/QueenUI/Bridge/QueenBridge.swift @@ -10,7 +10,7 @@ final class QueenBridge: ObservableObject { private let decoder = JSONDecoder() init(trinityPath: String? = nil) { - let cwd = FileManager.default.currentDirectoryPath + let cwd = TrinityRuntimePaths.projectRoot self.trinityPath = trinityPath ?? "\(cwd)/.trinity" } diff --git a/apps/queen/QueenUI/Bridge/RepoContext.swift b/apps/queen/QueenUI/Bridge/RepoContext.swift index 7dc43fa30b..962bb35e08 100644 --- a/apps/queen/QueenUI/Bridge/RepoContext.swift +++ b/apps/queen/QueenUI/Bridge/RepoContext.swift @@ -159,7 +159,7 @@ class RepoContext: ObservableObject { process.waitUntilExit() let data = pipe.fileHandleForReading.readDataToEndOfFile() let path = String(data: data, encoding: .utf8)?.trimmingCharacters(in: .whitespacesAndNewlines) - return path ?? FileManager.default.currentDirectoryPath + return path ?? TrinityRuntimePaths.projectRoot } private func buildFileTree(depth: Int) -> String { diff --git a/apps/queen/QueenUI/Bridge/StateWatcher.swift b/apps/queen/QueenUI/Bridge/StateWatcher.swift index c3c678133a..d4ac58077d 100644 --- a/apps/queen/QueenUI/Bridge/StateWatcher.swift +++ b/apps/queen/QueenUI/Bridge/StateWatcher.swift @@ -56,7 +56,7 @@ public final class StateWatcher: ObservableObject { } private static func findTrinityPath() -> String { - let cwd = FileManager.default.currentDirectoryPath + let cwd = TrinityRuntimePaths.projectRoot return "\(cwd)/.trinity" } diff --git a/apps/queen/QueenUI/Bridge/TriBridge.swift b/apps/queen/QueenUI/Bridge/TriBridge.swift index 30705d9ab9..ad04491cf7 100644 --- a/apps/queen/QueenUI/Bridge/TriBridge.swift +++ b/apps/queen/QueenUI/Bridge/TriBridge.swift @@ -10,7 +10,7 @@ public class TriBridge { /// Execute tri command and return output public func execute(_ command: String) async throws -> String { let task = Process() - task.executableURL = URL(fileURLWithPath: "/usr/local/bin/tri") + task.executableURL = URL(fileURLWithPath: TrinityRuntimePaths.triExecutable) task.arguments = command.components(separatedBy: " ") let pipe = Pipe() diff --git a/apps/queen/QueenUI/Bridge/TrinityContext.swift b/apps/queen/QueenUI/Bridge/TrinityContext.swift index 24da6164a2..3a6b48cb5b 100644 --- a/apps/queen/QueenUI/Bridge/TrinityContext.swift +++ b/apps/queen/QueenUI/Bridge/TrinityContext.swift @@ -27,7 +27,7 @@ class TrinityContext: ObservableObject { private let trinityPath: String init() { - let cwd = FileManager.default.currentDirectoryPath + let cwd = TrinityRuntimePaths.projectRoot self.trinityPath = "\(cwd)/.trinity" } @@ -144,7 +144,7 @@ class TrinityContext: ObservableObject { // Fallback: run tri build status let pipe = Pipe() let process = Process() - let cwd = FileManager.default.currentDirectoryPath + let cwd = TrinityRuntimePaths.projectRoot let triPath = "\(cwd)/zig-out/bin/tri" guard FileManager.default.fileExists(atPath: triPath) else { return "tri binary not found" } process.executableURL = URL(fileURLWithPath: triPath) @@ -166,7 +166,7 @@ class TrinityContext: ObservableObject { func openIssuesSummary() -> String { let pipe = Pipe() let process = Process() - let cwd = FileManager.default.currentDirectoryPath + let cwd = TrinityRuntimePaths.projectRoot let triPath = "\(cwd)/zig-out/bin/tri" guard FileManager.default.fileExists(atPath: triPath) else { return "" } process.executableURL = URL(fileURLWithPath: triPath) @@ -185,7 +185,7 @@ class TrinityContext: ObservableObject { let process = Process() process.executableURL = URL(fileURLWithPath: "/usr/bin/git") process.arguments = ["diff", "HEAD"] - let cwd = FileManager.default.currentDirectoryPath + let cwd = TrinityRuntimePaths.projectRoot process.currentDirectoryURL = URL(fileURLWithPath: cwd) process.standardOutput = pipe process.standardError = pipe diff --git a/apps/queen/QueenUI/Bridge/TrinityRuntimePaths.swift b/apps/queen/QueenUI/Bridge/TrinityRuntimePaths.swift new file mode 100644 index 0000000000..5e39bc4ec6 --- /dev/null +++ b/apps/queen/QueenUI/Bridge/TrinityRuntimePaths.swift @@ -0,0 +1,66 @@ +import Foundation + +/// Resolves the canonical Trinity repository for standalone and embedded hosts. +/// Standalone Queen defaults to its working directory. Embedded hosts configure +/// an explicit root and never need to change the process-wide working directory. +public enum TrinityRuntimePaths { + private static let lock = NSLock() + private static var rootOverride: String? + + public static func configure(projectRoot: String) { + let normalized = URL(fileURLWithPath: projectRoot) + .standardizedFileURL + .path + lock.lock() + rootOverride = normalized + lock.unlock() + } + + public static var projectRoot: String { + lock.lock() + let configured = rootOverride + lock.unlock() + if let configured { return configured } + + if let environmentRoot = ProcessInfo.processInfo.environment["TRINITY_ROOT"], + !environmentRoot.trimmingCharacters(in: .whitespacesAndNewlines).isEmpty { + return URL(fileURLWithPath: environmentRoot).standardizedFileURL.path + } + + return FileManager.default.currentDirectoryPath + } + + public static var stateRoot: String { + URL(fileURLWithPath: projectRoot) + .appendingPathComponent(".trinity", isDirectory: true) + .path + } + + public static var triExecutable: String { + if let configured = ProcessInfo.processInfo.environment["TRI_EXECUTABLE"], + FileManager.default.isExecutableFile(atPath: configured) { + return configured + } + + let candidates = [ + "zig-out/bin/tri", + "release/v2.0.0/test-install/tri", + "release/v2.0.0/bin/tri", + ].map { + URL(fileURLWithPath: projectRoot) + .appendingPathComponent($0) + .path + } + [ + "/opt/homebrew/bin/tri", + "/usr/local/bin/tri", + ] + + if let executable = candidates.first( + where: FileManager.default.isExecutableFile(atPath:) + ) { + return executable + } + + return candidates[0] + } +} diff --git a/apps/queen/QueenUI/Cortex/Visual/v4_color.swift b/apps/queen/QueenUI/Cortex/Visual/v4_color.swift index 2fd8af76e6..9f8c64741b 100644 --- a/apps/queen/QueenUI/Cortex/Visual/v4_color.swift +++ b/apps/queen/QueenUI/Cortex/Visual/v4_color.swift @@ -19,27 +19,27 @@ public enum V4Color { /// Primary window background - deepest layer public static var background: Color { - V1Theme.bgWindow + Color.black.opacity(QueenGlassTheme.shared.rootBlackOpacity) } /// Secondary background for panels and cards public static var surface: Color { - V1Theme.bgCard + Color.black.opacity(QueenGlassTheme.shared.surfaceBlackOpacity) } /// Elevated surface (third layer) public static var surfaceElevated: Color { - Color(white: 0.1, opacity: 1.0) + Color.black.opacity(QueenGlassTheme.shared.elevatedBlackOpacity) } /// Sidebar background public static var sidebar: Color { - V1Theme.bgSidebar + Color.black.opacity(QueenGlassTheme.shared.sidebarBlackOpacity) } /// Input background public static var input: Color { - Color(white: 0.1, opacity: 1.0) + Color.black.opacity(QueenGlassTheme.shared.elevatedBlackOpacity) } // MARK: - Text Colors @@ -51,12 +51,12 @@ public enum V4Color { /// Secondary text - reduced contrast public static var textSecondary: Color { - V1Theme.textMuted + Color.white.opacity(QueenGlassTheme.shared.mutedTextWhiteOpacity) } /// Tertiary text - lowest contrast public static var textTertiary: Color { - Color(white: 0.4, opacity: 1.0) + Color.white.opacity(QueenGlassTheme.shared.dimTextWhiteOpacity) } /// Text on accent color (should be white) @@ -203,22 +203,22 @@ public enum V4Color { /// Window background (matches TrinityTheme.bgWindow) public static var bgWindow: Color { - V1Theme.bgWindow + Color.black.opacity(QueenGlassTheme.shared.rootBlackOpacity) } /// Card background (matches TrinityTheme.bgCard) public static var bgCard: Color { - V1Theme.bgCard + Color.black.opacity(QueenGlassTheme.shared.surfaceBlackOpacity) } /// Sidebar background (matches TrinityTheme.bgSidebar) public static var bgSidebar: Color { - V1Theme.bgSidebar + Color.black.opacity(QueenGlassTheme.shared.sidebarBlackOpacity) } /// Card border (matches TrinityTheme.bgCardBorder) public static var bgCardBorder: Color { - V1Theme.bgCardBorder + Color.white.opacity(QueenGlassTheme.shared.borderWhiteOpacity) } // MARK: - Overlay Colors diff --git a/apps/queen/QueenUI/Integration/EmbeddedQueenRoot.swift b/apps/queen/QueenUI/Integration/EmbeddedQueenRoot.swift new file mode 100644 index 0000000000..7c332729d7 --- /dev/null +++ b/apps/queen/QueenUI/Integration/EmbeddedQueenRoot.swift @@ -0,0 +1,61 @@ +import SwiftUI + +public enum QueenSurfaceStyle: Sendable { + case canonical + case hostGlass + + public var usesTransparentBackground: Bool { + self == .hostGlass + } +} + +/// Public host surface for embedding the complete Queen interface in Trios. +/// It renders the same MainView and injects the same services as QueenApp. +public struct EmbeddedQueenRoot: View { + @StateObject private var watcher: StateWatcher + @ObservedObject private var accessibility = AccessibilityManager.shared + @ObservedObject private var server = ControlServer.shared + private let hostedRoutes: [QueenHostedRoute] + private let surfaceStyle: QueenSurfaceStyle + + public init( + projectRoot: String, + hostedRoutes: [QueenHostedRoute] = [], + surfaceStyle: QueenSurfaceStyle = .hostGlass + ) { + TrinityRuntimePaths.configure(projectRoot: projectRoot) + self.hostedRoutes = hostedRoutes + self.surfaceStyle = surfaceStyle + // The standalone app owns first-launch onboarding. An embedded host is + // narrower and keeps the overlay available through the normal shortcut. + UserDefaults.standard.set(true, forKey: "hasSeenShortcuts") + // The Chat onboarding sheet has a standalone fixed width that can + // overflow a compact host. Trios opens directly into the live surface. + UserDefaults.standard.set(true, forKey: "onboardingCompleted") + _watcher = StateObject( + wrappedValue: StateWatcher(trinityPath: TrinityRuntimePaths.stateRoot) + ) + } + + public var body: some View { + MainView( + hostedRoutes: hostedRoutes, + surfaceStyle: surfaceStyle + ) + .environmentObject(watcher) + .environmentObject(accessibility) + .environmentObject(server) + .preferredColorScheme(.dark) + .onAppear { + watcher.reload() + server.startIfPuppetMode() + } + .task { + while !Task.isCancelled { + try? await Task.sleep(nanoseconds: 8_000_000_000) + guard !Task.isCancelled else { break } + watcher.reload() + } + } + } +} diff --git a/apps/queen/QueenUI/Integration/QueenHostedRoute.swift b/apps/queen/QueenUI/Integration/QueenHostedRoute.swift new file mode 100644 index 0000000000..141b35ddf4 --- /dev/null +++ b/apps/queen/QueenUI/Integration/QueenHostedRoute.swift @@ -0,0 +1,46 @@ +import SwiftUI + +public struct QueenHostedRoute { + public let petalIndex: Int + public let title: String + public let systemImage: String + public let worldName: String + public let formula: String + public let keyboardShortcut: Int + let content: AnyView + + public init( + petalIndex: Int, + title: String, + systemImage: String, + worldName: String, + formula: String, + keyboardShortcut: Int, + @ViewBuilder content: () -> Content + ) { + self.petalIndex = petalIndex + self.title = title + self.systemImage = systemImage + self.worldName = worldName + self.formula = formula + self.keyboardShortcut = keyboardShortcut + self.content = AnyView(content()) + } +} + +public enum QueenHostNavigation { + public static let request = Notification.Name( + "com.trinity.queen.host-navigation.request" + ) + public static let didOpen = Notification.Name( + "com.trinity.queen.host-navigation.did-open" + ) + + public static func open(petalIndex: Int) { + NotificationCenter.default.post(name: request, object: petalIndex) + } + + public static func showMenu() { + NotificationCenter.default.post(name: request, object: -1) + } +} diff --git a/apps/queen/QueenUI/Integration/QueenOperationalWorkspace.swift b/apps/queen/QueenUI/Integration/QueenOperationalWorkspace.swift new file mode 100644 index 0000000000..8d8cdaa356 --- /dev/null +++ b/apps/queen/QueenUI/Integration/QueenOperationalWorkspace.swift @@ -0,0 +1,216 @@ +import Foundation +import SwiftUI + +struct QueenGlassProfile: Equatable, Sendable { + let rootBlackOpacity: Double + let surfaceBlackOpacity: Double + let elevatedBlackOpacity: Double + let sidebarBlackOpacity: Double + let contentBlackOpacity: Double + let borderWhiteOpacity: Double + let mutedTextWhiteOpacity: Double + let dimTextWhiteOpacity: Double + let usesOpaqueContentFill: Bool +} + +enum QueenGlassTheme { + static let shared = QueenGlassProfile( + rootBlackOpacity: 0.60, + surfaceBlackOpacity: 0.46, + elevatedBlackOpacity: 0.58, + sidebarBlackOpacity: 0.22, + contentBlackOpacity: 0.14, + borderWhiteOpacity: 0.14, + mutedTextWhiteOpacity: 0.62, + dimTextWhiteOpacity: 0.43, + usesOpaqueContentFill: false + ) +} + +struct QueenWorkspaceDescriptor: Equatable { + let screen: Screen + let subtitle: String + let dataSource: String +} + +enum QueenWorkspaceCatalog { + static let operationalScreens = (0..<27).map(Screen.screenForBlock) + + static func descriptor(for screen: Screen) -> QueenWorkspaceDescriptor? { + let details: (String, String) + + switch screen { + case .chat: + details = ("Agent conversation and tool timeline", "Trios runtime") + case .sevoFarm: + details = ("Evolution state, population, and farm actions", ".trinity") + case .arenaLLM: + details = ("Model battles and ELO leaderboard", "data/arena") + case .arenaCode: + details = ("Code-solving benchmark results", ".trinity") + case .faculty: + details = ("Agent roster, health, and capabilities", "heartbeats") + case .oracle: + details = ("Watchdog signals and operational alerts", ".trinity") + case .muMemory: + details = ("Persistent experience and memory index", ".trinity/experience") + case .scholar: + details = ("Research agent status and focus", "heartbeats") + case .swarm: + details = ("Cell registry and task decomposition", "src/*/cell.tri") + case .brainHealth: + details = ("Runtime diagnostics and neural health", ".trinity") + case .build: + details = ("Build status and verification output", ".trinity/logs") + case .triTools: + details = ("TRI command and specification tools", "TRI runtime") + case .issues: + details = ("Repository issue snapshot", ".trinity") + case .git: + details = ("Repository status and recent changes", "Git") + case .deploy: + details = ("Deployment state and recovery controls", ".trinity") + case .bridge: + details = ("Browser, Telegram, and GitHub bridges", "integrations") + case .telegram: + details = ("Telegram transport and event history", ".trinity") + case .keys: + details = ("Credential presence and validation", "environment") + case .state: + details = ("Queen runtime state and senses", ".trinity") + case .files: + details = ("Project structure and source roots", "filesystem") + case .todo: + details = ("To-Do list with task tracking and details", ".trinity/queen/todos.json") + case .rainbowBridge: + details = ("Cross-runtime bridge status", "integrations") + case .sacredMath: + details = ("Canonical constants and identities", "specs") + case .techTree: + details = ("Capability dependencies and maturity", "architecture") + case .fpga: + details = ("Hardware synthesis and artifact status", "fpga") + case .vsa: + details = ("Vector-symbolic architecture metrics", "specs") + case .pipeline: + details = ("Specification pipeline and stages", ".trinity") + case .benchmarks: + details = ("Performance history and comparisons", "bench") + case .experience: + details = ("Saved episodes and learned patterns", ".trinity/experience") + case .settings: + details = ("Queen preferences and runtime controls", "UserDefaults") + } + + return QueenWorkspaceDescriptor( + screen: screen, + subtitle: details.0, + dataSource: details.1 + ) + } +} + +struct QueenOperationalWorkspace: View { + let screen: Screen + @ViewBuilder let content: () -> Content + + var body: some View { + ZStack(alignment: .bottom) { + content() + .frame(maxWidth: .infinity, maxHeight: .infinity) + + QueenActionFeedbackBar() + .padding(.horizontal, ParietalSpacing.sm) + .padding(.bottom, ParietalSpacing.xs) + } + .background( + Color.black.opacity(QueenGlassTheme.shared.contentBlackOpacity) + ) + .accessibilityElement(children: .contain) + .accessibilityLabel(accessibilityLabel) + } + + private var accessibilityLabel: String { + guard let descriptor = QueenWorkspaceCatalog.descriptor(for: screen) else { + return "\(screen.rawValue) workspace" + } + return "\(screen.rawValue). \(descriptor.subtitle)" + } +} + +struct QueenActionFeedbackBar: View { + @ObservedObject private var queue = ActionQueue.shared + + @ViewBuilder + var body: some View { + if let feedback = queue.feedback { + feedbackCard(feedback) + .transition(.move(edge: .bottom).combined(with: .opacity)) + } + } + + private func feedbackCard(_ feedback: QueenActionFeedback) -> some View { + HStack(spacing: ParietalSpacing.xs) { + feedbackIcon(feedback.phase) + feedbackText(feedback) + Spacer(minLength: ParietalSpacing.xs) + dismissButton + } + .padding(.horizontal, ParietalSpacing.sm) + .padding(.vertical, ParietalSpacing.xs) + .frame(maxWidth: 620) + .background(V4Color.surfaceElevated) + .clipShape(RoundedRectangle(cornerRadius: 12, style: .continuous)) + .overlay(feedbackBorder) + .shadow(color: Color.black.opacity(0.32), radius: 12, y: 6) + .animation(.easeInOut(duration: 0.18), value: feedback.id) + } + + private func feedbackText( + _ feedback: QueenActionFeedback + ) -> some View { + VStack(alignment: .leading, spacing: 1) { + Text(feedback.title) + .font(WernickeTypography.captionBold.monospaced()) + .foregroundStyle(V4Color.textPrimary) + Text(feedback.detail) + .font(WernickeTypography.tiny) + .foregroundStyle(V4Color.textSecondary) + .lineLimit(2) + } + } + + private var dismissButton: some View { + Button { + queue.dismissFeedback() + } label: { + Image(systemName: "xmark") + .font(WernickeTypography.tiny) + .foregroundStyle(V4Color.textSecondary) + } + .buttonStyle(.plain) + } + + private var feedbackBorder: some View { + RoundedRectangle(cornerRadius: 12, style: .continuous) + .stroke(V4Color.border, lineWidth: 1) + } + + @ViewBuilder + private func feedbackIcon(_ phase: QueenActionPhase) -> some View { + switch phase { + case .queued: + Image(systemName: "tray.and.arrow.down.fill") + .foregroundStyle(V4Color.warning) + case .running: + ProgressView() + .controlSize(.small) + case .succeeded: + Image(systemName: "checkmark.circle.fill") + .foregroundStyle(V4Color.success) + case .failed: + Image(systemName: "exclamationmark.triangle.fill") + .foregroundStyle(V4Color.error) + } + } +} diff --git a/apps/queen/QueenUI/Navigation/MainView.swift b/apps/queen/QueenUI/Navigation/MainView.swift index 5fe570a899..cee7857ee8 100644 --- a/apps/queen/QueenUI/Navigation/MainView.swift +++ b/apps/queen/QueenUI/Navigation/MainView.swift @@ -1,58 +1,49 @@ import SwiftUI public struct MainView: View { - @State private var selectedScreen: Screen? = nil + @EnvironmentObject var watcher: StateWatcher + @StateObject private var navigationState = QueenNavigationState() @State private var keyMonitor: Any? @State private var showAgentStream = false @State private var showShortcuts = false @State private var isFirstLaunchShortcuts = false @AppStorage("hasSeenShortcuts") private var hasSeenShortcuts = false + private let hostedRoutesByPetal: [Int: QueenHostedRoute] + private let surfaceStyle: QueenSurfaceStyle - /// Cmd+0–9 keyboard shortcuts - private static let keyboardScreens: [Screen] = [ - .chat, .sevoFarm, .arenaLLM, .faculty, .oracle, - .build, .deploy, .telegram, .settings, - ] - - public init() {} + public init( + hostedRoutes: [QueenHostedRoute] = [], + surfaceStyle: QueenSurfaceStyle = .canonical + ) { + hostedRoutesByPetal = Dictionary( + uniqueKeysWithValues: hostedRoutes.map { ($0.petalIndex, $0) } + ) + self.surfaceStyle = surfaceStyle + } public var body: some View { ZStack(alignment: .trailing) { - V4Color.background.ignoresSafeArea() + rootBackground - if let screen = selectedScreen { + if let petal = navigationState.selectedHostedPetal, + let route = hostedRoutesByPetal[petal] { + VStack(spacing: 0) { + navigationHeader( + title: route.title, + systemImage: route.systemImage + ) + route.content + .frame(maxWidth: .infinity, maxHeight: .infinity) + } + .transition(.opacity) + } else if let screen = navigationState.selectedScreen { // Screen content with back button VStack(spacing: 0) { - // Top bar with back - HStack { - Button { - selectedScreen = nil - } label: { - HStack(spacing: ParietalSpacing.xs) { - Image(systemName: "chevron.left") - Text("TRINITY") - .font(WernickeTypography.captionBold.monospaced()) - } - .foregroundStyle(V4Color.accent) - .padding(ParietalSpacing.xs) - } - .buttonStyle(.plain) - .keyboardShortcut(.escape, modifiers: []) - - Spacer() - - Text("\(screen.icon) \(screen.rawValue)") - .font(WernickeTypography.smallBold.monospaced()) - .foregroundStyle(.white) - - Spacer() - // Balance spacer - Color.clear.frame(width: ParietalSpacing.xLargeFrame) - } - .padding(.horizontal, ParietalSpacing.xs) - .padding(.vertical, ParietalSpacing.xxs) - .frame(maxHeight: 32) - .background(V4Color.surface) + navigationHeader( + title: screen.rawValue, + emoji: screen.icon, + showsRefresh: true + ) ScreenRouter(screen: screen) .frame(maxWidth: .infinity, maxHeight: .infinity) @@ -60,12 +51,17 @@ public struct MainView: View { .transition(.opacity) } else { // 27-petal logo as main menu - TriangleLogo(selectedScreen: $selectedScreen) + TriangleLogo( + selectedScreen: $navigationState.selectedScreen, + hostedRoutes: hostedRoutesByPetal, + onSelect: selectPetal + ) } // Agent Stream overlay (Cmd+J) if showAgentStream { AgentStreamView() + .environmentObject(watcher) .frame( minWidth: LayoutConstants.agentStreamMinWidth, idealWidth: LayoutConstants.agentStreamIdealWidth, @@ -82,7 +78,8 @@ public struct MainView: View { .transition(.opacity) } } - .animation(.easeInOut(duration: 0.25), value: selectedScreen) + .animation(.easeInOut(duration: 0.25), value: navigationState.selectedScreen) + .animation(.easeInOut(duration: 0.25), value: navigationState.selectedHostedPetal) .animation(.easeInOut(duration: 0.25), value: showAgentStream) .animation(.easeInOut(duration: 0.2), value: showShortcuts) .onAppear { @@ -98,11 +95,134 @@ public struct MainView: View { keyMonitor = nil } } + .onReceive( + NotificationCenter.default.publisher(for: QueenHostNavigation.request) + ) { notification in + guard let petal = notification.object as? Int else { return } + if petal < 0 { + returnToMenu() + } else { + selectPetal(petal) + } + } + } + + @ViewBuilder + private var rootBackground: some View { + if surfaceStyle.usesTransparentBackground { + Color.clear + .ignoresSafeArea() + } else { + V4Color.background + .ignoresSafeArea() + } + } + + private func navigationHeader( + title: String, + systemImage: String? = nil, + emoji: String? = nil, + showsRefresh: Bool = false + ) -> some View { + HStack { + Button(action: returnToMenu) { + HStack(spacing: ParietalSpacing.xs) { + Image(systemName: "chevron.left") + Text("TRINITY") + .font(WernickeTypography.captionBold.monospaced()) + } + .foregroundStyle(V4Color.accent) + .padding(ParietalSpacing.xs) + } + .buttonStyle(.plain) + .keyboardShortcut(.escape, modifiers: []) + + Spacer() + + HStack(spacing: ParietalSpacing.xs) { + if let systemImage { + Image(systemName: systemImage) + } else if let emoji { + Text(emoji) + } + Text(title) + } + .font(WernickeTypography.smallBold.monospaced()) + .foregroundStyle(.white) + + Spacer() + HStack { + if showsRefresh { + Button { + NotificationCenter.default.post( + name: .queenWorkspaceRefresh, + object: "header" + ) + } label: { + Image(systemName: "arrow.clockwise") + .font(WernickeTypography.captionBold) + .foregroundStyle(V4Color.textSecondary) + .frame(width: 24, height: 24) + .background(V4Color.surfaceElevated) + .clipShape(Circle()) + .overlay { + Circle() + .stroke(V4Color.border, lineWidth: 1) + } + } + .buttonStyle(.plain) + .help("Refresh workspace") + } + } + .frame( + width: ParietalSpacing.xLargeFrame, + alignment: .trailing + ) + } + .padding(.horizontal, ParietalSpacing.xs) + .padding(.vertical, ParietalSpacing.xxs) + .frame(maxHeight: 32) + .background( + surfaceStyle.usesTransparentBackground + ? V4Color.surface.opacity(0.72) + : V4Color.surface + ) + } + + private func returnToMenu() { + navigationState.selectedHostedPetal = nil + navigationState.selectedScreen = nil + } + + private func selectPetal(_ petalIndex: Int) { + if hostedRoutesByPetal[petalIndex] != nil { + navigationState.selectedScreen = nil + navigationState.selectedHostedPetal = petalIndex + NotificationCenter.default.post( + name: QueenHostNavigation.didOpen, + object: petalIndex + ) + } else { + navigationState.selectedHostedPetal = nil + navigationState.selectedScreen = Screen.screenForBlock(petalIndex) + } } private func installKeyboardMonitor() { guard keyMonitor == nil else { return } keyMonitor = NSEvent.addLocalMonitorForEvents(matching: .keyDown) { event in + let ch = event.charactersIgnoringModifiers?.first + + if let digit = ch?.wholeNumberValue, + let petalIndex = QueenMenuShortcutPolicy.petalIndex( + digit: digit, + modifiers: event.modifierFlags, + isMainMenuVisible: navigationState.isMainMenuVisible + ) { + selectPetal(petalIndex) + return nil + } + // Non-modifier shortcuts: Escape, Up arrow in empty input if !event.modifierFlags.contains(.command) { // Escape — stop streaming / clear input / close modal @@ -124,10 +244,10 @@ public struct MainView: View { return event } - guard let chars = event.charactersIgnoringModifiers, let ch = chars.first else { return event } + guard let ch else { return event } if ch == "0" { - selectedScreen = nil + returnToMenu() return nil } @@ -218,14 +338,6 @@ public struct MainView: View { return event } - if let digit = ch.wholeNumberValue, digit >= 1, digit <= 9 { - let idx = digit - 1 - if idx < Self.keyboardScreens.count { - selectedScreen = Self.keyboardScreens[idx] - return nil - } - } - return event } } diff --git a/apps/queen/QueenUI/Navigation/QueenMenuShortcutPolicy.swift b/apps/queen/QueenUI/Navigation/QueenMenuShortcutPolicy.swift new file mode 100644 index 0000000000..38f078c79c --- /dev/null +++ b/apps/queen/QueenUI/Navigation/QueenMenuShortcutPolicy.swift @@ -0,0 +1,66 @@ +import AppKit +import SwiftUI + +@MainActor +final class QueenNavigationState: ObservableObject { + @Published var selectedScreen: Screen? + @Published var selectedHostedPetal: Int? + + var isMainMenuVisible: Bool { + selectedScreen == nil && selectedHostedPetal == nil + } +} + +enum QueenMenuShortcutPolicy { + private static let relevantModifiers: NSEvent.ModifierFlags = [ + .command, + .option, + .control, + .shift, + ] + + static func petalIndex( + digit: Int, + modifiers: NSEvent.ModifierFlags, + isMainMenuVisible: Bool + ) -> Int? { + guard isMainMenuVisible, (1...9).contains(digit) else { + return nil + } + + let exactModifiers = modifiers.intersection(relevantModifiers) + let rowOffset: Int + + if exactModifiers == [.command] { + rowOffset = 0 + } else if exactModifiers == [.option] { + rowOffset = 9 + } else if exactModifiers == [.control] { + rowOffset = 18 + } else { + return nil + } + + return rowOffset + digit - 1 + } + + static func label(forPetalIndex petalIndex: Int) -> String? { + guard (0..<27).contains(petalIndex) else { + return nil + } + + let row = petalIndex / 9 + let digit = petalIndex % 9 + 1 + + switch row { + case 0: + return "Cmd+\(digit)" + case 1: + return "Option+\(digit)" + case 2: + return "Control+\(digit)" + default: + return nil + } + } +} diff --git a/apps/queen/QueenUI/Navigation/Screen.swift b/apps/queen/QueenUI/Navigation/Screen.swift index 82dd17bcc6..6c7096eb6f 100644 --- a/apps/queen/QueenUI/Navigation/Screen.swift +++ b/apps/queen/QueenUI/Navigation/Screen.swift @@ -29,7 +29,7 @@ enum Screen: String, CaseIterable, Identifiable, Codable { case swarm = "Swarm" case brainHealth = "Brain Health" - // Body (9) + // Body (10) case build = "Build" case triTools = "Tri Tools" case issues = "Issues" @@ -40,6 +40,7 @@ enum Screen: String, CaseIterable, Identifiable, Codable { case keys = "Keys" case state = "State" case files = "Files" + case todo = "To-Do List" // Spirit (9) case rainbowBridge = "Rainbow Bridge" @@ -58,7 +59,7 @@ enum Screen: String, CaseIterable, Identifiable, Codable { switch self { case .chat, .sevoFarm, .arenaLLM, .arenaCode, .faculty, .oracle, .muMemory, .scholar, .swarm, .brainHealth: return .brain - case .build, .triTools, .issues, .git, .deploy, .bridge, .telegram, .keys, .state, .files: + case .build, .triTools, .issues, .git, .deploy, .bridge, .telegram, .keys, .state, .files, .todo: return .body case .rainbowBridge, .sacredMath, .techTree, .fpga, .vsa, .pipeline, .benchmarks, .experience, .settings: return .spirit @@ -87,6 +88,7 @@ enum Screen: String, CaseIterable, Identifiable, Codable { case .keys: return "🔑" case .state: return "📊" case .files: return "📁" + case .todo: return "✅" case .rainbowBridge: return "🌈" case .sacredMath: return "🔢" case .techTree: return "🌳" @@ -114,8 +116,8 @@ enum Screen: String, CaseIterable, Identifiable, Codable { .build, .triTools, .issues, .git, .deploy, .bridge, .telegram, .keys, .state, // DUKH (18-26) - .files, .rainbowBridge, .sacredMath, .techTree, .fpga, - .vsa, .pipeline, .benchmarks, .settings, + .files, .todo, .rainbowBridge, .sacredMath, .techTree, + .fpga, .vsa, .pipeline, .benchmarks, .settings, ] guard idx >= 0, idx < mapping.count else { return .chat } return mapping[idx] diff --git a/apps/queen/QueenUI/Navigation/ScreenRouter.swift b/apps/queen/QueenUI/Navigation/ScreenRouter.swift index dfa46b3d21..e3994a5981 100644 --- a/apps/queen/QueenUI/Navigation/ScreenRouter.swift +++ b/apps/queen/QueenUI/Navigation/ScreenRouter.swift @@ -2,8 +2,22 @@ import SwiftUI struct ScreenRouter: View { let screen: Screen + @State private var refreshID = UUID() var body: some View { + QueenOperationalWorkspace(screen: screen) { + routedContent + .id(refreshID) + } + .onReceive( + NotificationCenter.default.publisher(for: .queenWorkspaceRefresh) + ) { _ in + refreshID = UUID() + } + } + + @ViewBuilder + private var routedContent: some View { switch screen { case .chat: ChatScreen() @@ -49,6 +63,8 @@ struct ScreenRouter: View { StateScreen() case .files: FilesScreen() + case .todo: + TodoPanelView() case .rainbowBridge: RainbowBridgeScreen() case .fpga: @@ -66,25 +82,3 @@ struct ScreenRouter: View { } } } - -struct ComingSoonScreen: View { - let screen: Screen - - var body: some View { - VStack(spacing: ParietalSpacing.xl) { - Text(screen.icon) - .font(WernickeTypography.display48) - Text(screen.rawValue) - .font(.title.weight(.bold)) - .foregroundStyle(V4Color.textPrimary) - Text("Coming Soon") - .font(.title3) - .foregroundStyle(V4Color.textSecondary) - Text("Kingdom: \(screen.kingdom.rawValue)") - .font(.caption) - .foregroundStyle(V4Color.accent) - } - .frame(maxWidth: .infinity, maxHeight: .infinity) - .background(V4Color.background) - } -} diff --git a/apps/queen/QueenUI/Screens/Body/BuildScreen.swift b/apps/queen/QueenUI/Screens/Body/BuildScreen.swift index dd9c7a114d..1863c41ad0 100644 --- a/apps/queen/QueenUI/Screens/Body/BuildScreen.swift +++ b/apps/queen/QueenUI/Screens/Body/BuildScreen.swift @@ -130,7 +130,7 @@ struct BuildScreen: View { } private func binaryMtime(_ relativePath: String) -> String? { - let cwd = FileManager.default.currentDirectoryPath + let cwd = TrinityRuntimePaths.projectRoot let fullPath = "\(cwd)/\(relativePath)" guard let attrs = try? FileManager.default.attributesOfItem(atPath: fullPath), let date = attrs[.modificationDate] as? Date else { return nil } diff --git a/apps/queen/QueenUI/Screens/Body/DeployScreen.swift b/apps/queen/QueenUI/Screens/Body/DeployScreen.swift index a28f425b73..9e840a60d2 100644 --- a/apps/queen/QueenUI/Screens/Body/DeployScreen.swift +++ b/apps/queen/QueenUI/Screens/Body/DeployScreen.swift @@ -97,7 +97,7 @@ struct DeployScreen: View { } private func loadDeploy() { - let path = "\(FileManager.default.currentDirectoryPath)/.trinity/railway_farm.json" + let path = "\(TrinityRuntimePaths.projectRoot)/.trinity/railway_farm.json" guard let data = try? Data(contentsOf: URL(fileURLWithPath: path)), let json = try? JSONSerialization.jsonObject(with: data) as? [String: Any], let acctArray = json["accounts"] as? [[String: Any]] else { return } diff --git a/apps/queen/QueenUI/Screens/Body/GitScreen.swift b/apps/queen/QueenUI/Screens/Body/GitScreen.swift index 84b5d16971..9b26899f9d 100644 --- a/apps/queen/QueenUI/Screens/Body/GitScreen.swift +++ b/apps/queen/QueenUI/Screens/Body/GitScreen.swift @@ -91,7 +91,7 @@ struct GitScreen: View { } private var currentBranch: String { - let cwd = FileManager.default.currentDirectoryPath + let cwd = TrinityRuntimePaths.projectRoot let headPath = "\(cwd)/.git/HEAD" guard let content = try? String(contentsOfFile: headPath, encoding: .utf8).trimmingCharacters(in: .whitespacesAndNewlines) else { return "main" @@ -105,7 +105,7 @@ struct GitScreen: View { } private var localBranches: [String] { - let cwd = FileManager.default.currentDirectoryPath + let cwd = TrinityRuntimePaths.projectRoot let refsPath = "\(cwd)/.git/refs/heads" guard let entries = try? FileManager.default.contentsOfDirectory(atPath: refsPath) else { return [] diff --git a/apps/queen/QueenUI/Screens/Body/IssuesScreen.swift b/apps/queen/QueenUI/Screens/Body/IssuesScreen.swift index 65127ccb56..b0f9ad08d9 100644 --- a/apps/queen/QueenUI/Screens/Body/IssuesScreen.swift +++ b/apps/queen/QueenUI/Screens/Body/IssuesScreen.swift @@ -39,7 +39,7 @@ struct IssuesScreen: View { ActionButton(icon: "🔄", label: "Refresh", color: V4Color.accent, action: "issues_refresh") StatCard(label: "Open", value: "\(issues.count)") - .frame(width: ParietalSpacing.xxLargeFrame) + .frame(width: 84) } .padding() @@ -109,7 +109,7 @@ struct IssuesScreen: View { } private func loadIssues() { - let path = "\(FileManager.default.currentDirectoryPath)/.trinity/issues_snapshot.json" + let path = "\(TrinityRuntimePaths.projectRoot)/.trinity/issues_snapshot.json" guard let data = try? Data(contentsOf: URL(fileURLWithPath: path)) else { return } issues = (try? JSONDecoder().decode([Issue].self, from: data)) ?? [] } diff --git a/apps/queen/QueenUI/Screens/Body/StateScreen.swift b/apps/queen/QueenUI/Screens/Body/StateScreen.swift index 772446db8e..307dffbd9e 100644 --- a/apps/queen/QueenUI/Screens/Body/StateScreen.swift +++ b/apps/queen/QueenUI/Screens/Body/StateScreen.swift @@ -71,7 +71,7 @@ struct StateScreen: View { } private func scanState() { - let path = "\(FileManager.default.currentDirectoryPath)/.trinity" + let path = TrinityRuntimePaths.stateRoot let fm = FileManager.default guard let items = try? fm.contentsOfDirectory(atPath: path) else { return } diff --git a/apps/queen/QueenUI/Screens/Body/TodoPanelView.swift b/apps/queen/QueenUI/Screens/Body/TodoPanelView.swift new file mode 100644 index 0000000000..fba9c777d7 --- /dev/null +++ b/apps/queen/QueenUI/Screens/Body/TodoPanelView.swift @@ -0,0 +1,384 @@ +import SwiftUI + +/// Full-screen Todo Panel with right sidebar for details +struct TodoPanelView: View { + @EnvironmentObject var watcher: StateWatcher + @State private var selectedTodoId: String? + @State private var showRightSidebar = true + + private var selectedTodo: QueenTodo? { + guard let id = selectedTodoId else { return nil } + return watcher.todos.first(where: { $0.id == id }) + } + + private var pendingCount: Int { watcher.todos.filter { $0.status == "pending" }.count } + private var doneCount: Int { watcher.todos.filter { $0.status == "done" }.count } + private var totalCount: Int { watcher.todos.count } + + var body: some View { + HStack(spacing: 0) { + // Main todo list + VStack(spacing: 0) { + // Header + headerView + + Divider().background(V4Color.border) + + // Todo list + todoListView + + Divider().background(V4Color.border) + + // Footer with stats + footerView + } + .frame(maxWidth: .infinity) + + // Right sidebar for details + if showRightSidebar, let todo = selectedTodo { + Divider().background(V4Color.border) + todoDetailView(todo: todo) + .frame(width: 280) + .transition(.move(edge: .trailing)) + } + } + .background(V4Color.background) + } + + // MARK: - Header + + private var headerView: some View { + HStack { + VStack(alignment: .leading, spacing: 2) { + Text("\u{1F4CB} TO-DO LIST") + .font(.caption.weight(.bold)) + .foregroundStyle(V4Color.golden) + Text("\(pendingCount) pending, \(doneCount) done") + .font(.caption2) + .foregroundStyle(V4Color.textSecondary) + } + + Spacer() + + // Progress ring + progressRing + + // Toggle sidebar button + Button { + withAnimation(.easeInOut(duration: 0.2)) { + showRightSidebar.toggle() + } + } label: { + Image(systemName: showRightSidebar ? "sidebar.right" : "sidebar.right.closed") + .font(.caption) + .foregroundStyle(V4Color.textSecondary) + .frame(width: 28, height: 28) + .background(V4Color.surface) + .clipShape(RoundedRectangle(cornerRadius: 6)) + } + .buttonStyle(.plain) + .help("Toggle details sidebar") + } + .padding(ParietalSpacing.md) + .background(V4Color.surface) + } + + private var progressRing: some View { + let progress = totalCount > 0 ? Double(doneCount) / Double(totalCount) : 0.0 + + return ZStack { + Circle() + .stroke(V4Color.border.opacity(0.5), lineWidth: 3) + .frame(width: 32, height: 32) + + Circle() + .trim(from: 0, to: progress) + .stroke(V4Color.accent, style: StrokeStyle(lineWidth: 3, lineCap: .round)) + .frame(width: 32, height: 32) + .rotationEffect(.degrees(-90)) + .animation(.easeInOut(duration: 0.3), value: progress) + + Text("\(Int(progress * 100))%") + .font(.caption2.weight(.bold).monospacedDigit()) + .foregroundStyle(V4Color.accent) + } + } + + // MARK: - Todo List + + private var todoListView: some View { + ScrollView { + LazyVStack(alignment: .leading, spacing: 2) { + if watcher.todos.isEmpty { + emptyStateView + } else { + ForEach(watcher.todos) { todo in + todoRow(todo: todo) + } + } + } + .padding(ParietalSpacing.md) + } + } + + private var emptyStateView: some View { + VStack(spacing: ParietalSpacing.sm) { + Image(systemName: "checkmark.circle") + .font(.system(size: 32)) + .foregroundStyle(V4Color.textSecondary.opacity(0.5)) + Text("No todos yet") + .font(.caption) + .foregroundStyle(V4Color.textSecondary) + Text("Queen daemon writes .trinity/queen/todos.json") + .font(.caption2) + .foregroundStyle(V4Color.textSecondary.opacity(0.7)) + } + .frame(maxWidth: .infinity) + .padding(.vertical, ParietalSpacing.xl) + } + + private func todoRow(todo: QueenTodo) -> some View { + let isSelected = selectedTodoId == todo.id + + return Button { + withAnimation(.easeInOut(duration: 0.15)) { + selectedTodoId = todo.id + } + } label: { + HStack(spacing: ParietalSpacing.sm) { + // Checkbox + Image(systemName: todo.status == "done" ? "checkmark.circle.fill" : "circle") + .font(.body) + .foregroundStyle(todo.status == "done" ? V4Color.success : V4Color.textSecondary) + .frame(width: 18) + + // Text + VStack(alignment: .leading, spacing: 2) { + Text(todo.text) + .font(.caption) + .foregroundStyle(todo.status == "done" ? V4Color.textSecondary : V4Color.textPrimary) + .strikethrough(todo.status == "done", color: V4Color.textSecondary) + .lineLimit(2) + .multilineTextAlignment(.leading) + + HStack(spacing: ParietalSpacing.xxs) { + Text(todo.source) + .font(.caption2) + .foregroundStyle(V4Color.textSecondary) + + Text("•") + .font(.caption2) + .foregroundStyle(V4Color.textSecondary.opacity(0.5)) + + Text(todo.status) + .font(.caption2) + .foregroundStyle(todo.status == "done" ? V4Color.success : V4Color.accent) + } + } + + Spacer() + + // Selected indicator + if isSelected { + Image(systemName: "chevron.right") + .font(.caption2) + .foregroundStyle(V4Color.golden) + } + } + .padding(.horizontal, ParietalSpacing.sm) + .padding(.vertical, ParietalSpacing.xs) + .background( + RoundedRectangle(cornerRadius: 6) + .fill(isSelected ? V4Color.golden.opacity(0.1) : Color.clear) + ) + .overlay( + RoundedRectangle(cornerRadius: 6) + .stroke(isSelected ? V4Color.golden.opacity(0.3) : Color.clear, lineWidth: 1) + ) + } + .buttonStyle(.plain) + } + + // MARK: - Footer + + private var footerView: some View { + HStack { + // Quick stats + HStack(spacing: ParietalSpacing.sm) { + statBadge(label: "Total", value: "\(totalCount)", color: V4Color.textPrimary) + statBadge(label: "Pending", value: "\(pendingCount)", color: V4Color.accent) + statBadge(label: "Done", value: "\(doneCount)", color: V4Color.success) + } + + Spacer() + + // Refresh button + Button { + watcher.reload() + } label: { + Image(systemName: "arrow.clockwise") + .font(.caption) + .foregroundStyle(V4Color.textSecondary) + .frame(width: 28, height: 28) + .background(V4Color.surface) + .clipShape(RoundedRectangle(cornerRadius: 6)) + } + .buttonStyle(.plain) + .help("Refresh todos") + } + .padding(ParietalSpacing.md) + .background(V4Color.surface) + } + + private func statBadge(label: String, value: String, color: Color) -> some View { + VStack(alignment: .leading, spacing: 0) { + Text(label) + .font(.caption2) + .foregroundStyle(V4Color.textSecondary) + Text(value) + .font(.caption.weight(.bold).monospacedDigit()) + .foregroundStyle(color) + } + } + + // MARK: - Right Sidebar (Details) + + private func todoDetailView(todo: QueenTodo) -> some View { + VStack(alignment: .leading, spacing: ParietalSpacing.md) { + // Header + HStack { + Text("DETAILS") + .font(.caption.weight(.bold)) + .foregroundStyle(V4Color.golden) + Spacer() + Button { + withAnimation(.easeInOut(duration: 0.2)) { + selectedTodoId = nil + } + } label: { + Image(systemName: "xmark") + .font(.caption) + .foregroundStyle(V4Color.textSecondary) + } + .buttonStyle(.plain) + } + + Divider().background(V4Color.border) + + // Status + statusSection(todo: todo) + + Divider().background(V4Color.border) + + // Source info + sourceSection(todo: todo) + + Divider().background(V4Color.border) + + // Actions + actionsSection(todo: todo) + + Spacer() + } + .padding(ParietalSpacing.md) + .background(V4Color.surface) + } + + private func statusSection(todo: QueenTodo) -> some View { + VStack(alignment: .leading, spacing: ParietalSpacing.sm) { + Text("STATUS") + .font(.caption2.weight(.bold)) + .foregroundStyle(V4Color.textSecondary) + + HStack(spacing: ParietalSpacing.sm) { + Image(systemName: todo.status == "done" ? "checkmark.circle.fill" : "circle") + .font(.title2) + .foregroundStyle(todo.status == "done" ? V4Color.success : V4Color.accent) + + VStack(alignment: .leading, spacing: 2) { + Text(todo.status.capitalized) + .font(.caption.weight(.bold)) + .foregroundStyle(todo.status == "done" ? V4Color.success : V4Color.accent) + Text(todo.status == "done" ? "Completed" : "In progress") + .font(.caption2) + .foregroundStyle(V4Color.textSecondary) + } + + Spacer() + } + .padding(ParietalSpacing.sm) + .background(V4Color.background) + .clipShape(RoundedRectangle(cornerRadius: 6)) + } + } + + private func sourceSection(todo: QueenTodo) -> some View { + VStack(alignment: .leading, spacing: ParietalSpacing.sm) { + Text("SOURCE") + .font(.caption2.weight(.bold)) + .foregroundStyle(V4Color.textSecondary) + + HStack { + Image(systemName: "folder.fill") + .font(.caption) + .foregroundStyle(V4Color.golden) + Text(todo.source) + .font(.caption) + .foregroundStyle(V4Color.textPrimary) + Spacer() + } + .padding(ParietalSpacing.sm) + .background(V4Color.background) + .clipShape(RoundedRectangle(cornerRadius: 6)) + } + } + + private func actionsSection(todo: QueenTodo) -> some View { + VStack(alignment: .leading, spacing: ParietalSpacing.sm) { + Text("ACTIONS") + .font(.caption2.weight(.bold)) + .foregroundStyle(V4Color.textSecondary) + + VStack(spacing: ParietalSpacing.xs) { + Button { + withAnimation(.easeInOut(duration: 0.15)) { + watcher.toggleTodo(todo.id) + } + } label: { + HStack { + Image(systemName: todo.status == "done" ? "arrow.uturn.backward" : "checkmark") + .font(.caption) + Text(todo.status == "done" ? "Mark as Pending" : "Mark as Done") + .font(.caption) + Spacer() + } + .padding(.horizontal, ParietalSpacing.sm) + .padding(.vertical, ParietalSpacing.xs) + .background(todo.status == "done" ? V4Color.accent.opacity(0.1) : V4Color.success.opacity(0.1)) + .foregroundStyle(todo.status == "done" ? V4Color.accent : V4Color.success) + .clipShape(RoundedRectangle(cornerRadius: 6)) + } + .buttonStyle(.plain) + + Button { + // Future: delete todo + } label: { + HStack { + Image(systemName: "trash") + .font(.caption) + Text("Delete") + .font(.caption) + Spacer() + } + .padding(.horizontal, ParietalSpacing.sm) + .padding(.vertical, ParietalSpacing.xs) + .background(V4Color.error.opacity(0.1)) + .foregroundStyle(V4Color.error) + .clipShape(RoundedRectangle(cornerRadius: 6)) + } + .buttonStyle(.plain) + .disabled(true) // TODO: implement delete + } + } + } +} diff --git a/apps/queen/QueenUI/Screens/Brain/ArenaCodeScreen.swift b/apps/queen/QueenUI/Screens/Brain/ArenaCodeScreen.swift index 2b8b539499..d375d099b6 100644 --- a/apps/queen/QueenUI/Screens/Brain/ArenaCodeScreen.swift +++ b/apps/queen/QueenUI/Screens/Brain/ArenaCodeScreen.swift @@ -133,7 +133,7 @@ struct ArenaCodeScreen: View { } private func loadResult() { - let path = "\(FileManager.default.currentDirectoryPath)/.trinity/arena_results.json" + let path = "\(TrinityRuntimePaths.stateRoot)/arena_results.json" guard let data = try? Data(contentsOf: URL(fileURLWithPath: path)) else { return } arenaResult = try? JSONDecoder().decode(ArenaCodeResult.self, from: data) } diff --git a/apps/queen/QueenUI/Screens/Brain/ArenaLLMScreen.swift b/apps/queen/QueenUI/Screens/Brain/ArenaLLMScreen.swift index 08b41bcaa7..9c20a0096a 100644 --- a/apps/queen/QueenUI/Screens/Brain/ArenaLLMScreen.swift +++ b/apps/queen/QueenUI/Screens/Brain/ArenaLLMScreen.swift @@ -169,7 +169,7 @@ struct ArenaLLMScreen: View { } private func loadBattles() { - let path = "\(FileManager.default.currentDirectoryPath)/data/arena/arena_results.jsonl" + let path = "\(TrinityRuntimePaths.projectRoot)/data/arena/arena_results.jsonl" guard let content = try? String(contentsOfFile: path, encoding: .utf8) else { return } let decoder = JSONDecoder() diff --git a/apps/queen/QueenUI/Screens/Brain/ChatScreen.swift b/apps/queen/QueenUI/Screens/Brain/ChatScreen.swift index c96671a68e..8e1d0a46e9 100644 --- a/apps/queen/QueenUI/Screens/Brain/ChatScreen.swift +++ b/apps/queen/QueenUI/Screens/Brain/ChatScreen.swift @@ -1781,7 +1781,7 @@ struct ChatScreen: View { // Task tracker if !taskItems.isEmpty { - TaskTrackerView(tasks: $taskItems) + TaskTrackerPanelView(tasks: $taskItems) .padding(.horizontal, LayoutConstants.messageHorizontalPadding) .padding(.bottom, 4) } @@ -1967,20 +1967,13 @@ struct ChatScreen: View { private var inputBarView: some View { HStack(spacing: ParietalSpacing.md) { - MultilineInput( + SimpleMultilineInput( text: $input, placeholder: placeholder, isFocused: $focused, - onSubmit: { send() }, - onImagePaste: { name, path in - attachedFiles.append((name: name, content: "[Image: \(name)]")) - }, - onMentionTrigger: { query in - mentionQuery = query ?? "" - showMentionPopup = query != nil - } + onSubmit: { send() } ) - .frame(maxWidth: 600) // FIXED: prevent oversized input width + .frame(maxWidth: 600) .layoutPriority(1) Button { @@ -3186,6 +3179,9 @@ struct ConnectionStatusBar: View { .padding(.vertical, 2) } .onAppear { checkConnection() } + .onChange(of: modelManager.selectedModel.id) { + checkConnection() + } .onChange(of: client.failoverEvent) { withAnimation(.easeInOut(duration: 0.3)) { showFailover = true } // Auto-dismiss after 4s (8s for cloud-to-local fallback) @@ -7134,7 +7130,7 @@ struct MCPStatusView: View { /// Probe .mcp.json to determine which MCP servers are configured static func loadServers() -> [(name: String, connected: Bool)] { - let cwd = FileManager.default.currentDirectoryPath + let cwd = TrinityRuntimePaths.projectRoot let mcpPath = "\(cwd)/.mcp.json" let names = ["trinity", "needle", "zig-docs", "railway"] @@ -7715,3 +7711,38 @@ struct ThreadLoadingSkeleton: View { .onAppear { shimmer = true } } } + +struct SimpleMultilineInput: View { + @Binding var text: String + var placeholder: String + @FocusState.Binding var isFocused: Bool + var onSubmit: () -> Void + + var body: some View { + ZStack(alignment: .topLeading) { + if text.isEmpty { + Text(placeholder) + .foregroundColor(.white.opacity(0.3)) + .padding(.horizontal, 8) + .padding(.vertical, 10) + .allowsHitTesting(false) + } + + TextEditor(text: $text) + .scrollContentBackground(.hidden) + .foregroundColor(.white) + .font(.system(size: 15)) + .padding(.horizontal, 4) + .padding(.vertical, 4) + .focused($isFocused) + .onKeyPress(.return) { + if NSEvent.modifierFlags.contains(.shift) { + return .ignored + } + onSubmit() + return .handled + } + } + .frame(minHeight: 40, maxHeight: 150) + } +} diff --git a/apps/queen/QueenUI/Screens/Brain/MUMemoryScreen.swift b/apps/queen/QueenUI/Screens/Brain/MUMemoryScreen.swift index a26cd6bd92..27c96a933e 100644 --- a/apps/queen/QueenUI/Screens/Brain/MUMemoryScreen.swift +++ b/apps/queen/QueenUI/Screens/Brain/MUMemoryScreen.swift @@ -197,7 +197,7 @@ struct MUMemoryScreen: View { } private func loadLearningDB() { - let cwd = FileManager.default.currentDirectoryPath + let cwd = TrinityRuntimePaths.projectRoot if let data = try? Data(contentsOf: URL(fileURLWithPath: "\(cwd)/.trinity/mu/learning_db.json")) { learningDB = try? JSONDecoder().decode(LearningDB.self, from: data) } diff --git a/apps/queen/QueenUI/Screens/Brain/SwarmScreen.swift b/apps/queen/QueenUI/Screens/Brain/SwarmScreen.swift index f90e018f6a..fa11987f81 100644 --- a/apps/queen/QueenUI/Screens/Brain/SwarmScreen.swift +++ b/apps/queen/QueenUI/Screens/Brain/SwarmScreen.swift @@ -322,7 +322,7 @@ struct SwarmScreen: View { /// Scan src/*/cell.tri files to discover honeycomb cells private func scanCellTriFiles() -> [CellInfo] { - let cwd = FileManager.default.currentDirectoryPath + let cwd = TrinityRuntimePaths.projectRoot let srcDir = "\(cwd)/src" let fm = FileManager.default diff --git a/apps/queen/QueenUI/Screens/Spirit/ExperienceScreen.swift b/apps/queen/QueenUI/Screens/Spirit/ExperienceScreen.swift index 3f309988d3..c7402a5b6d 100644 --- a/apps/queen/QueenUI/Screens/Spirit/ExperienceScreen.swift +++ b/apps/queen/QueenUI/Screens/Spirit/ExperienceScreen.swift @@ -122,7 +122,7 @@ struct ExperienceScreen: View { } private func loadEpisodes() { - let path = "\(FileManager.default.currentDirectoryPath)/.trinity/experience/episodes" + let path = "\(TrinityRuntimePaths.stateRoot)/experience/episodes" let fm = FileManager.default guard let items = try? fm.contentsOfDirectory(atPath: path) else { return } diff --git a/apps/queen/QueenUI/Screens/Spirit/FPGAScreen.swift b/apps/queen/QueenUI/Screens/Spirit/FPGAScreen.swift index b1d8b6e679..5127ebeb77 100644 --- a/apps/queen/QueenUI/Screens/Spirit/FPGAScreen.swift +++ b/apps/queen/QueenUI/Screens/Spirit/FPGAScreen.swift @@ -235,7 +235,7 @@ struct FPGAScreen: View { // MARK: - Data Loaders private func loadHardwareState() -> [String: Any]? { - let cwd = FileManager.default.currentDirectoryPath + let cwd = TrinityRuntimePaths.projectRoot let path = "\(cwd)/.trinity/fpga/hardware_state.json" guard let data = try? Data(contentsOf: URL(fileURLWithPath: path)), let json = try? JSONSerialization.jsonObject(with: data) as? [String: Any] else { return nil } @@ -249,7 +249,7 @@ struct FPGAScreen: View { } private func loadExperience() -> [ExperienceEntry] { - let cwd = FileManager.default.currentDirectoryPath + let cwd = TrinityRuntimePaths.projectRoot let path = "\(cwd)/.trinity/fpga/experience.json" guard let data = try? Data(contentsOf: URL(fileURLWithPath: path)), let json = try? JSONSerialization.jsonObject(with: data) as? [[String: Any]] else { return [] } @@ -261,7 +261,7 @@ struct FPGAScreen: View { } private func synthReportFiles() -> [String] { - let cwd = FileManager.default.currentDirectoryPath + let cwd = TrinityRuntimePaths.projectRoot let dir = "\(cwd)/fpga/openxc7-synth/synth_reports" guard let entries = try? FileManager.default.contentsOfDirectory(atPath: dir) else { return [] } return entries.sorted() diff --git a/apps/queen/QueenUI/Screens/Spirit/PipelineScreen.swift b/apps/queen/QueenUI/Screens/Spirit/PipelineScreen.swift index 2812a101e3..bd3a632ea6 100644 --- a/apps/queen/QueenUI/Screens/Spirit/PipelineScreen.swift +++ b/apps/queen/QueenUI/Screens/Spirit/PipelineScreen.swift @@ -244,13 +244,13 @@ struct PipelineScreen: View { } private func loadPipeline() { - let path = "\(FileManager.default.currentDirectoryPath)/.trinity/pipeline_state.json" + let path = "\(TrinityRuntimePaths.stateRoot)/pipeline_state.json" guard let data = try? Data(contentsOf: URL(fileURLWithPath: path)) else { return } pipelineState = try? JSONDecoder().decode(PipelineState.self, from: data) } private func loadMetrics() { - let path = "\(FileManager.default.currentDirectoryPath)/.trinity/event_log.jsonl" + let path = "\(TrinityRuntimePaths.stateRoot)/event_log.jsonl" guard let content = try? String(contentsOfFile: path, encoding: .utf8) else { return } var pipelineEvents = 0 diff --git a/apps/queen/QueenUI/Screens/Spirit/SettingsScreen.swift b/apps/queen/QueenUI/Screens/Spirit/SettingsScreen.swift index eed2bc1966..2380e2513a 100644 --- a/apps/queen/QueenUI/Screens/Spirit/SettingsScreen.swift +++ b/apps/queen/QueenUI/Screens/Spirit/SettingsScreen.swift @@ -1,6 +1,6 @@ import SwiftUI -struct SettingsScreen: View { +public struct SettingsScreen: View { @AppStorage("appearanceMode") private var appearanceModeRaw: String = AppearanceMode.dark.rawValue @AppStorage("selectedTheme") private var selectedThemeRaw: String = ThemeVariant.deepSpace.rawValue @AppStorage("arenaHost") private var arenaHost = "localhost" @@ -34,7 +34,9 @@ struct SettingsScreen: View { @State private var intervalSec = 600 @State private var showClearConfirmation = false - var body: some View { + public init() {} + + public var body: some View { ScrollView { VStack(spacing: ParietalSpacing.standard) { HStack { @@ -507,7 +509,7 @@ struct SettingsScreen: View { .font(.caption) .foregroundStyle(V4Color.textSecondary) .frame(width: ParietalSpacing.xxLargeFrame, alignment: .leading) - Text(trinityPath.isEmpty ? FileManager.default.currentDirectoryPath : trinityPath) + Text(trinityPath.isEmpty ? TrinityRuntimePaths.projectRoot : trinityPath) .font(.caption.monospaced()) .foregroundStyle(V4Color.textPrimary) } @@ -653,6 +655,7 @@ struct SettingsScreen: View { Text("This will reset all settings to defaults and remove saved threads. This action cannot be undone.") } } + .containerRelativeFrame(.horizontal) .padding(.bottom) } .background(V4Color.bgWindow) @@ -685,18 +688,20 @@ struct SettingsScreen: View { saveQueenConfig() } - HStack { + VStack(alignment: .leading, spacing: ParietalSpacing.xs) { Text("Max Auto Level") .font(.caption) .foregroundStyle(V4Color.textSecondary) - .frame(width: ParietalSpacing.xxxLargeFrame, alignment: .leading) Picker("", selection: $maxAutoLevel) { - Text("L0 (read-only)").tag(0) - Text("L1 (soft-write)").tag(1) - Text("L2 (dangerous)").tag(2) + Text("L0").tag(0) + Text("L1").tag(1) + Text("L2").tag(2) } .pickerStyle(.segmented) .onChange(of: maxAutoLevel) { saveQueenConfig() } + Text("L0 read-only | L1 soft-write | L2 dangerous") + .font(.caption2) + .foregroundStyle(V4Color.textSecondary) } Toggle(isOn: $requireApproval) { @@ -706,11 +711,10 @@ struct SettingsScreen: View { } .onChange(of: requireApproval) { saveQueenConfig() } - HStack { + VStack(alignment: .leading, spacing: ParietalSpacing.xs) { Text("Interval") .font(.caption) .foregroundStyle(V4Color.textSecondary) - .frame(width: ParietalSpacing.xxxLargeFrame, alignment: .leading) Stepper(value: $intervalSec, in: 60...3600, step: 60) { Text("\(intervalSec)s (\(intervalSec / 60)m)") .font(.caption.monospacedDigit()) @@ -732,7 +736,7 @@ struct SettingsScreen: View { // MARK: - Config Persistence private func loadQueenConfig() { - let path = "\(FileManager.default.currentDirectoryPath)/.trinity/queen/config.json" + let path = "\(TrinityRuntimePaths.stateRoot)/queen/config.json" guard let data = try? Data(contentsOf: URL(fileURLWithPath: path)), let json = try? JSONSerialization.jsonObject(with: data) as? [String: Any] else { return } @@ -823,7 +827,7 @@ struct SettingsScreen: View { "interval_sec": intervalSec, ] - let cwd = FileManager.default.currentDirectoryPath + let cwd = TrinityRuntimePaths.projectRoot let dir = "\(cwd)/.trinity/queen" try? FileManager.default.createDirectory(atPath: dir, withIntermediateDirectories: true) diff --git a/apps/queen/QueenUI/Screens/Spirit/TechTreeScreen.swift b/apps/queen/QueenUI/Screens/Spirit/TechTreeScreen.swift index d1614e19b8..9724183316 100644 --- a/apps/queen/QueenUI/Screens/Spirit/TechTreeScreen.swift +++ b/apps/queen/QueenUI/Screens/Spirit/TechTreeScreen.swift @@ -172,7 +172,7 @@ struct TechTreeScreen: View { } private func loadTree() { - let path = "\(FileManager.default.currentDirectoryPath)/.trinity/tech_tree.json" + let path = "\(TrinityRuntimePaths.stateRoot)/tech_tree.json" guard let data = try? Data(contentsOf: URL(fileURLWithPath: path)) else { return } techTree = try? JSONDecoder().decode(TechTree.self, from: data) } diff --git a/apps/queen/QueenUI/Screens/Tri/TriToolsPanel.swift b/apps/queen/QueenUI/Screens/Tri/TriToolsPanel.swift index 69a3b09377..9f417fce4b 100644 --- a/apps/queen/QueenUI/Screens/Tri/TriToolsPanel.swift +++ b/apps/queen/QueenUI/Screens/Tri/TriToolsPanel.swift @@ -13,12 +13,14 @@ public struct TriToolsPanel: View { VStack(alignment: .leading, spacing: ParietalSpacing.sm) { Text("Tri Tools") .font(.caption.weight(.bold)) - Text("Coming soon") - .font(.caption2) - .foregroundStyle(.secondary) + ForEach(TriToolCommandCatalog.commands.prefix(3)) { command in + Label(command.title, systemImage: command.systemImage) + .font(.caption2) + .foregroundStyle(V4Color.textSecondary) + } } .padding(ParietalSpacing.xs) - .background(Color(nsColor: .controlBackgroundColor)) + .background(V4Color.surface) } } } diff --git a/apps/queen/QueenUI/Screens/Tri/TriToolsScreen.swift b/apps/queen/QueenUI/Screens/Tri/TriToolsScreen.swift index 1d4908abca..c393cbdbf3 100644 --- a/apps/queen/QueenUI/Screens/Tri/TriToolsScreen.swift +++ b/apps/queen/QueenUI/Screens/Tri/TriToolsScreen.swift @@ -1,15 +1,335 @@ +import Foundation import SwiftUI -/// Trinity Tools screen — shows CLI commands, farm status, etc. +struct TriToolCommandDefinition: Identifiable, Equatable { + let id: String + let title: String + let detail: String + let systemImage: String + let arguments: [String] + let requiresConfirmation: Bool +} + +enum TriToolCommandCatalog { + static let commands: [TriToolCommandDefinition] = [ + command( + "status", + "Repository status", + "Show the current branch and working tree.", + "arrow.triangle.branch", + ["status"] + ), + command( + "diff", + "Working diff", + "Inspect uncommitted source changes.", + "plusminus", + ["diff"] + ), + command( + "log", + "Recent commits", + "Read the latest repository history.", + "clock.arrow.circlepath", + ["log"] + ), + command( + "info", + "Runtime info", + "Inspect the installed TRI runtime.", + "info.circle", + ["info"] + ), + command( + "pipeline-status", + "Pipeline status", + "Read the Golden Chain execution state.", + "point.3.connected.trianglepath.dotted", + ["pipeline", "status"] + ), + command( + "verify", + "Verify project", + "Run tests and benchmarks through TRI.", + "checkmark.seal", + ["verify"], + requiresConfirmation: true + ), + ] + + private static func command( + _ id: String, + _ title: String, + _ detail: String, + _ systemImage: String, + _ arguments: [String], + requiresConfirmation: Bool = false + ) -> TriToolCommandDefinition { + TriToolCommandDefinition( + id: id, + title: title, + detail: detail, + systemImage: systemImage, + arguments: arguments, + requiresConfirmation: requiresConfirmation + ) + } +} + +enum TriToolOutputSanitizer { + static func clean(_ output: String) -> String { + let pattern = "\u{001B}\\[[0-?]*[ -/]*[@-~]" + guard let regex = try? NSRegularExpression(pattern: pattern) else { + return output.replacingOccurrences(of: "\r", with: "") + } + let range = NSRange(output.startIndex..., in: output) + return regex + .stringByReplacingMatches( + in: output, + range: range, + withTemplate: "" + ) + .replacingOccurrences(of: "\r", with: "") + } +} + +private struct TriToolRunResult: Sendable { + let status: Int32 + let output: String +} + +/// Operational TRI workspace with a fixed command catalog and visible output. public struct TriToolsScreen: View { + @State private var runningCommandID: String? + @State private var output = "Choose a command to inspect the Trinity runtime." + @State private var pendingConfirmation: TriToolCommandDefinition? + @State private var showsConfirmation = false + public init() {} public var body: some View { - VStack { - Text("Tri Tools") - .font(.title) - Text("Coming soon") - .foregroundStyle(.secondary) + ScrollView { + VStack(alignment: .leading, spacing: ParietalSpacing.standard) { + header + commandGrid + outputCard + } + .padding(ParietalSpacing.standard) } + .background(V4Color.bgWindow) + .confirmationDialog( + pendingConfirmation?.title ?? "Run command", + isPresented: $showsConfirmation, + titleVisibility: .visible + ) { + Button("Run verification") { + guard let command = pendingConfirmation else { return } + run(command) + pendingConfirmation = nil + } + Button("Cancel", role: .cancel) { + pendingConfirmation = nil + } + } message: { + Text("Verification can take time and may create build artifacts.") + } + } + + private var header: some View { + HStack(alignment: .top, spacing: ParietalSpacing.sm) { + Image(systemName: "wrench.and.screwdriver.fill") + .font(WernickeTypography.display48) + .foregroundStyle(V4Color.accent) + + VStack(alignment: .leading, spacing: ParietalSpacing.xxs) { + Text("TRI TOOLS") + .font(.title.weight(.bold)) + .foregroundStyle(V4Color.accent) + Text("Safe command console") + .font(.subheadline) + .foregroundStyle(V4Color.textSecondary) + Label( + executableStatus, + systemImage: executableAvailable + ? "checkmark.circle.fill" + : "exclamationmark.triangle.fill" + ) + .font(WernickeTypography.tiny.monospaced()) + .foregroundStyle( + executableAvailable ? V4Color.success : V4Color.error + ) + .lineLimit(1) + } + + Spacer(minLength: 0) + } + } + + private var commandGrid: some View { + LazyVGrid( + columns: [ + GridItem(.flexible(), spacing: ParietalSpacing.sm), + GridItem(.flexible(), spacing: ParietalSpacing.sm), + ], + spacing: ParietalSpacing.sm + ) { + ForEach(TriToolCommandCatalog.commands) { command in + commandButton(command) + } + } + } + + private func commandButton( + _ command: TriToolCommandDefinition + ) -> some View { + Button { + if command.requiresConfirmation { + pendingConfirmation = command + showsConfirmation = true + } else { + run(command) + } + } label: { + VStack(alignment: .leading, spacing: ParietalSpacing.xs) { + HStack { + Image(systemName: command.systemImage) + .foregroundStyle(V4Color.accent) + Spacer() + if runningCommandID == command.id { + ProgressView() + .controlSize(.small) + } else if command.requiresConfirmation { + Image(systemName: "exclamationmark.shield") + .foregroundStyle(V4Color.warning) + } + } + + Text(command.title) + .font(WernickeTypography.captionBold) + .foregroundStyle(V4Color.textPrimary) + Text(command.detail) + .font(WernickeTypography.tiny) + .foregroundStyle(V4Color.textSecondary) + .multilineTextAlignment(.leading) + .lineLimit(3) + } + .padding(ParietalSpacing.sm) + .frame(maxWidth: .infinity, minHeight: 104, alignment: .topLeading) + .background(V4Color.surface) + .clipShape(RoundedRectangle(cornerRadius: 12, style: .continuous)) + .overlay { + RoundedRectangle(cornerRadius: 12, style: .continuous) + .stroke(V4Color.border, lineWidth: 1) + } + } + .buttonStyle(.plain) + .disabled(runningCommandID != nil || !executableAvailable) + } + + private var outputCard: some View { + VStack(alignment: .leading, spacing: ParietalSpacing.xs) { + HStack { + Label("OUTPUT", systemImage: "terminal") + .font(WernickeTypography.captionBold.monospaced()) + .foregroundStyle(V4Color.textSecondary) + Spacer() + if runningCommandID != nil { + Text("RUNNING") + .font(WernickeTypography.tiny.monospaced()) + .foregroundStyle(V4Color.warning) + } + } + + Divider() + .overlay(V4Color.border) + + ScrollView(.horizontal, showsIndicators: true) { + Text(output) + .font(WernickeTypography.tiny.monospaced()) + .foregroundStyle(V4Color.textPrimary) + .textSelection(.enabled) + .frame(maxWidth: .infinity, alignment: .leading) + } + .frame(minHeight: 180, alignment: .topLeading) + } + .padding(ParietalSpacing.sm) + .background(V4Color.surfaceElevated) + .clipShape(RoundedRectangle(cornerRadius: 12, style: .continuous)) + .overlay { + RoundedRectangle(cornerRadius: 12, style: .continuous) + .stroke(V4Color.border, lineWidth: 1) + } + } + + private var executableAvailable: Bool { + FileManager.default.isExecutableFile( + atPath: TrinityRuntimePaths.triExecutable + ) + } + + private var executableStatus: String { + if executableAvailable { + return TrinityRuntimePaths.triExecutable + } + return "TRI executable not found" + } + + private func run(_ command: TriToolCommandDefinition) { + let executable = TrinityRuntimePaths.triExecutable + guard FileManager.default.isExecutableFile(atPath: executable) else { + output = "TRI executable not found at \(executable)." + return + } + + runningCommandID = command.id + output = "$ tri \(command.arguments.joined(separator: " "))\n" + let root = TrinityRuntimePaths.projectRoot + let arguments = command.arguments + + Task { @MainActor in + let result = await Task.detached(priority: .userInitiated) { + execute( + executable: executable, + arguments: arguments, + root: root + ) + }.value + + let commandLine = "$ tri \(arguments.joined(separator: " "))" + let body = result.output.isEmpty + ? "Command finished without output." + : result.output + output = "\(commandLine)\n\n\(body)\n\nexit \(result.status)" + runningCommandID = nil + } + } +} + +private func execute( + executable: String, + arguments: [String], + root: String +) -> TriToolRunResult { + let process = Process() + process.executableURL = URL(fileURLWithPath: executable) + process.currentDirectoryURL = URL(fileURLWithPath: root) + process.arguments = arguments + + let pipe = Pipe() + process.standardOutput = pipe + process.standardError = pipe + + do { + try process.run() + let data = pipe.fileHandleForReading.readDataToEndOfFile() + process.waitUntilExit() + return TriToolRunResult( + status: process.terminationStatus, + output: TriToolOutputSanitizer.clean( + String(data: data, encoding: .utf8) ?? "" + ) + ) + } catch { + return TriToolRunResult(status: -1, output: error.localizedDescription) } } diff --git a/apps/queen/QueenUI/Widgets/AgentStreamView.swift b/apps/queen/QueenUI/Widgets/AgentStreamView.swift index ef29832515..ec5eff5d94 100644 --- a/apps/queen/QueenUI/Widgets/AgentStreamView.swift +++ b/apps/queen/QueenUI/Widgets/AgentStreamView.swift @@ -101,6 +101,7 @@ struct AgentStreamView: View { // Todos section (editable) MemoryTodoView() + .id(watcher.todos.count) Divider().background(V4Color.border) diff --git a/apps/queen/QueenUI/Widgets/TaskTrackerPanelView.swift b/apps/queen/QueenUI/Widgets/TaskTrackerPanelView.swift new file mode 100644 index 0000000000..15ecdd94c2 --- /dev/null +++ b/apps/queen/QueenUI/Widgets/TaskTrackerPanelView.swift @@ -0,0 +1,374 @@ +import SwiftUI + +/// Task tracker panel with right sidebar for task details +/// Used in ChatScreen to show extracted tasks from conversation +struct TaskTrackerPanelView: View { + @Binding var tasks: [TaskItem] + @State private var selectedTaskIndex: Int? + @State private var showRightSidebar = true + + private var selectedTask: TaskItem? { + guard let idx = selectedTaskIndex else { return nil } + guard idx >= 0, idx < tasks.count else { return nil } + return tasks[idx] + } + + private var doneCount: Int { tasks.filter(\.isDone).count } + private var pendingCount: Int { tasks.count - doneCount } + private var progress: Double { tasks.isEmpty ? 0.0 : Double(doneCount) / Double(tasks.count) } + + var body: some View { + VStack(spacing: 0) { + // Header + headerView + + Divider().background(V4Color.border) + + HStack(spacing: 0) { + // Main task list + taskListView + .frame(maxWidth: .infinity) + + // Right sidebar for details + if showRightSidebar, let task = selectedTask { + Divider().background(V4Color.border) + taskDetailView(task: task) + .frame(width: 240) + .transition(.move(edge: .trailing)) + } + } + + Divider().background(V4Color.border) + + // Footer with progress + footerView + } + .padding(ParietalSpacing.sm) + .background(V4Color.surface) + .clipShape(RoundedRectangle(cornerRadius: V1Theme.cornerLarge)) + } + + // MARK: - Header + + private var headerView: some View { + HStack { + HStack(spacing: ParietalSpacing.xs) { + Image(systemName: "checklist") + .font(WernickeTypography.size11) + .foregroundStyle(V4Color.accent) + Text("TASKS") + .font(WernickeTypography.caption2Bold) + .foregroundStyle(V4Color.accent) + } + + Spacer() + + // Progress indicator + if !tasks.isEmpty { + HStack(spacing: ParietalSpacing.xxs) { + Text("\(doneCount)/\(tasks.count)") + .font(WernickeTypography.size10Mono) + .foregroundStyle(V4Color.textSecondary) + + // Mini progress ring + ZStack { + Circle() + .stroke(V4Color.border.opacity(0.5), lineWidth: 2) + .frame(width: 20, height: 20) + + Circle() + .trim(from: 0, to: progress) + .stroke(V4Color.accent, style: StrokeStyle(lineWidth: 2, lineCap: .round)) + .frame(width: 20, height: 20) + .rotationEffect(.degrees(-90)) + .animation(.easeInOut(duration: 0.3), value: progress) + } + } + } + + // Toggle sidebar + Button { + withAnimation(.easeInOut(duration: 0.2)) { + showRightSidebar.toggle() + } + } label: { + Image(systemName: showRightSidebar ? "sidebar.right" : "sidebar.right.closed") + .font(WernickeTypography.size9) + .foregroundStyle(V4Color.textSecondary) + .frame(width: 24, height: 24) + .background(V4Color.surfaceElevated) + .clipShape(RoundedRectangle(cornerRadius: 4)) + } + .buttonStyle(.plain) + .help("Toggle details sidebar") + + // Clear all + Button { + withAnimation { + tasks.removeAll() + selectedTaskIndex = nil + } + } label: { + Image(systemName: "trash") + .font(WernickeTypography.size9) + .foregroundStyle(V4Color.textSecondary) + .frame(width: 24, height: 24) + .background(V4Color.surfaceElevated) + .clipShape(RoundedRectangle(cornerRadius: 4)) + } + .buttonStyle(.plain) + .help("Clear all tasks") + } + .padding(.horizontal, ParietalSpacing.sm) + .padding(.vertical, ParietalSpacing.xs) + } + + // MARK: - Task List + + private var taskListView: some View { + ScrollView { + LazyVStack(alignment: .leading, spacing: 2) { + ForEach(tasks.indices, id: \.self) { idx in + taskRow(idx: idx) + } + } + .padding(.vertical, ParietalSpacing.xs) + } + } + + private func taskRow(idx: Int) -> some View { + let task = tasks[idx] + let isSelected = selectedTaskIndex == idx + + return Button { + withAnimation(.easeInOut(duration: 0.15)) { + if selectedTaskIndex == idx { + selectedTaskIndex = nil + } else { + selectedTaskIndex = idx + } + } + } label: { + HStack(spacing: ParietalSpacing.sm) { + // Checkbox + Image(systemName: task.isDone ? "checkmark.circle.fill" : "circle") + .font(WernickeTypography.size11) + .foregroundStyle(task.isDone ? V4Color.success : V4Color.textSecondary) + .frame(width: 16) + + // Title + Text(task.title) + .font(WernickeTypography.size11) + .foregroundStyle(task.isDone ? V4Color.textSecondary : V4Color.textPrimary) + .strikethrough(task.isDone, color: V4Color.textSecondary) + .lineLimit(2) + .multilineTextAlignment(.leading) + + Spacer() + + // Selected indicator + if isSelected { + Image(systemName: "chevron.right") + .font(WernickeTypography.size8) + .foregroundStyle(V4Color.golden) + } + } + .padding(.horizontal, ParietalSpacing.sm) + .padding(.vertical, ParietalSpacing.xxs) + .background( + RoundedRectangle(cornerRadius: 4) + .fill(isSelected ? V4Color.golden.opacity(0.1) : Color.clear) + ) + .overlay( + RoundedRectangle(cornerRadius: 4) + .stroke(isSelected ? V4Color.golden.opacity(0.3) : Color.clear, lineWidth: 1) + ) + } + .buttonStyle(.plain) + .contextMenu { + Button { + withAnimation { + tasks[idx].isDone.toggle() + } + } label: { + Label(task.isDone ? "Mark as Pending" : "Mark as Done", systemImage: task.isDone ? "arrow.uturn.backward" : "checkmark") + } + + Divider() + + Button(role: .destructive) { + withAnimation { + tasks.remove(at: idx) + if selectedTaskIndex == idx { + selectedTaskIndex = nil + } + } + } label: { + Label("Delete", systemImage: "trash") + } + } + } + + // MARK: - Footer + + private var footerView: some View { + HStack { + // Stats + HStack(spacing: ParietalSpacing.sm) { + statBadge(label: "Total", value: "\(tasks.count)", color: V4Color.textPrimary) + statBadge(label: "Pending", value: "\(pendingCount)", color: V4Color.accent) + statBadge(label: "Done", value: "\(doneCount)", color: V4Color.success) + } + + Spacer() + + // Progress bar + if !tasks.isEmpty { + GeometryReader { geo in + ZStack(alignment: .leading) { + RoundedRectangle(cornerRadius: 2) + .fill(V4Color.border) + RoundedRectangle(cornerRadius: 2) + .fill(progress >= 1.0 ? V4Color.success : V4Color.accent) + .frame(width: geo.size.width * progress) + } + } + .frame(width: 100, height: 4) + } + } + .padding(.horizontal, ParietalSpacing.sm) + .padding(.vertical, ParietalSpacing.xs) + } + + private func statBadge(label: String, value: String, color: Color) -> some View { + VStack(alignment: .leading, spacing: 0) { + Text(label) + .font(WernickeTypography.tiny8) + .foregroundStyle(V4Color.textSecondary) + Text(value) + .font(WernickeTypography.mini.weight(.bold).monospacedDigit()) + .foregroundStyle(color) + } + } + + // MARK: - Right Sidebar (Details) + + private func taskDetailView(task: TaskItem) -> some View { + VStack(alignment: .leading, spacing: ParietalSpacing.sm) { + // Header + HStack { + Text("DETAILS") + .font(WernickeTypography.caption2Bold) + .foregroundStyle(V4Color.golden) + Spacer() + Button { + withAnimation(.easeInOut(duration: 0.2)) { + selectedTaskIndex = nil + } + } label: { + Image(systemName: "xmark") + .font(WernickeTypography.size9) + .foregroundStyle(V4Color.textSecondary) + } + .buttonStyle(.plain) + } + + Divider().background(V4Color.border) + + // Status + statusSection(task: task) + + Divider().background(V4Color.border) + + // Actions + actionsSection(task: task) + + Spacer() + } + .padding(ParietalSpacing.sm) + .background(V4Color.surfaceElevated) + } + + private func statusSection(task: TaskItem) -> some View { + VStack(alignment: .leading, spacing: ParietalSpacing.xs) { + Text("STATUS") + .font(WernickeTypography.tiny8.weight(.bold)) + .foregroundStyle(V4Color.textSecondary) + + HStack(spacing: ParietalSpacing.sm) { + Image(systemName: task.isDone ? "checkmark.circle.fill" : "circle") + .font(WernickeTypography.size14) + .foregroundStyle(task.isDone ? V4Color.success : V4Color.accent) + + VStack(alignment: .leading, spacing: 2) { + Text(task.isDone ? "Completed" : "In Progress") + .font(WernickeTypography.captionBold) + .foregroundStyle(task.isDone ? V4Color.success : V4Color.accent) + Text(task.isDone ? "Task finished" : "Task pending") + .font(WernickeTypography.size8) + .foregroundStyle(V4Color.textSecondary) + } + + Spacer() + } + .padding(ParietalSpacing.xs) + .background(V4Color.background) + .clipShape(RoundedRectangle(cornerRadius: 4)) + } + } + + private func actionsSection(task: TaskItem) -> some View { + VStack(alignment: .leading, spacing: ParietalSpacing.xs) { + Text("ACTIONS") + .font(WernickeTypography.tiny8.weight(.bold)) + .foregroundStyle(V4Color.textSecondary) + + VStack(spacing: ParietalSpacing.xxs) { + Button { + withAnimation(.easeInOut(duration: 0.15)) { + if let idx = selectedTaskIndex { + tasks[idx].isDone.toggle() + } + } + } label: { + HStack { + Image(systemName: task.isDone ? "arrow.uturn.backward" : "checkmark") + .font(WernickeTypography.size9) + Text(task.isDone ? "Mark Pending" : "Mark Done") + .font(WernickeTypography.size9) + Spacer() + } + .padding(.horizontal, ParietalSpacing.xs) + .padding(.vertical, ParietalSpacing.xxs) + .background(task.isDone ? V4Color.accent.opacity(0.1) : V4Color.success.opacity(0.1)) + .foregroundStyle(task.isDone ? V4Color.accent : V4Color.success) + .clipShape(RoundedRectangle(cornerRadius: 4)) + } + .buttonStyle(.plain) + + Button { + if let idx = selectedTaskIndex { + withAnimation { + tasks.remove(at: idx) + selectedTaskIndex = nil + } + } + } label: { + HStack { + Image(systemName: "trash") + .font(WernickeTypography.size9) + Text("Delete") + .font(WernickeTypography.size9) + Spacer() + } + .padding(.horizontal, ParietalSpacing.xs) + .padding(.vertical, ParietalSpacing.xxs) + .background(V4Color.error.opacity(0.1)) + .foregroundStyle(V4Color.error) + .clipShape(RoundedRectangle(cornerRadius: 4)) + } + .buttonStyle(.plain) + } + } + } +} diff --git a/apps/queen/QueenUI/Widgets/TriToolsChatPanel.swift b/apps/queen/QueenUI/Widgets/TriToolsChatPanel.swift index b42f220beb..ee74756de1 100644 --- a/apps/queen/QueenUI/Widgets/TriToolsChatPanel.swift +++ b/apps/queen/QueenUI/Widgets/TriToolsChatPanel.swift @@ -196,7 +196,7 @@ struct TriToolsChatPanel: View { Task { do { - let triPath = "/Users/playra/trinity-w1/zig-out/bin/tri" + let triPath = TrinityRuntimePaths.triExecutable guard FileManager.default.fileExists(atPath: triPath) else { await MainActor.run { isRunning = false diff --git a/apps/queen/Tests/QueenUITests/HostedRouteTests.swift b/apps/queen/Tests/QueenUITests/HostedRouteTests.swift new file mode 100644 index 0000000000..b29adedb93 --- /dev/null +++ b/apps/queen/Tests/QueenUITests/HostedRouteTests.swift @@ -0,0 +1,35 @@ +import SwiftUI +import Testing +@testable import QueenUILib + +@Suite("Hosted Queen routes") +struct HostedRouteTests { + @Test func routeRetains999Metadata() { + let route = QueenHostedRoute( + petalIndex: 14, + title: "Git", + systemImage: "arrow.triangle.branch", + worldName: "GIT", + formula: "e^pi = 23.14", + keyboardShortcut: 6 + ) { + Text("Git") + } + + #expect(route.petalIndex == 14) + #expect(route.title == "Git") + #expect(route.worldName == "GIT") + #expect(route.keyboardShortcut == 6) + } + + @Test func navigationNotificationsAreStable() { + #expect( + QueenHostNavigation.request.rawValue + == "com.trinity.queen.host-navigation.request" + ) + #expect( + QueenHostNavigation.didOpen.rawValue + == "com.trinity.queen.host-navigation.did-open" + ) + } +} diff --git a/apps/queen/Tests/QueenUITests/MenuShortcutPolicyTests.swift b/apps/queen/Tests/QueenUITests/MenuShortcutPolicyTests.swift new file mode 100644 index 0000000000..7ddb8eec36 --- /dev/null +++ b/apps/queen/Tests/QueenUITests/MenuShortcutPolicyTests.swift @@ -0,0 +1,107 @@ +import AppKit +import Testing +@testable import QueenUILib + +@Suite("Queen 999 menu shortcut policy") +struct MenuShortcutPolicyTests { + @Test @MainActor func navigationVisibilityTracksOpenedScreens() { + let state = QueenNavigationState() + + #expect(state.isMainMenuVisible) + + state.selectedHostedPetal = 0 + #expect(!state.isMainMenuVisible) + + state.selectedHostedPetal = nil + state.selectedScreen = .files + #expect(!state.isMainMenuVisible) + + state.selectedScreen = nil + #expect(state.isMainMenuVisible) + } + + @Test func threeModifierRowsCoverAllPetals() { + for digit in 1...9 { + #expect( + QueenMenuShortcutPolicy.petalIndex( + digit: digit, + modifiers: [.command], + isMainMenuVisible: true + ) == digit - 1 + ) + #expect( + QueenMenuShortcutPolicy.petalIndex( + digit: digit, + modifiers: [.option], + isMainMenuVisible: true + ) == digit + 8 + ) + #expect( + QueenMenuShortcutPolicy.petalIndex( + digit: digit, + modifiers: [.control], + isMainMenuVisible: true + ) == digit + 17 + ) + } + } + + @Test func openedScreensNeverInterceptDigitRows() { + for digit in 1...9 { + for modifiers: NSEvent.ModifierFlags in [ + [.command], + [.option], + [.control], + ] { + #expect( + QueenMenuShortcutPolicy.petalIndex( + digit: digit, + modifiers: modifiers, + isMainMenuVisible: false + ) == nil + ) + } + } + } + + @Test func mixedModifiersAndInvalidDigitsPassThrough() { + #expect( + QueenMenuShortcutPolicy.petalIndex( + digit: 1, + modifiers: [.command, .option], + isMainMenuVisible: true + ) == nil + ) + #expect( + QueenMenuShortcutPolicy.petalIndex( + digit: 1, + modifiers: [.command, .shift], + isMainMenuVisible: true + ) == nil + ) + #expect( + QueenMenuShortcutPolicy.petalIndex( + digit: 0, + modifiers: [.command], + isMainMenuVisible: true + ) == nil + ) + #expect( + QueenMenuShortcutPolicy.petalIndex( + digit: 10, + modifiers: [.control], + isMainMenuVisible: true + ) == nil + ) + } + + @Test func tooltipLabelsMatchRows() { + #expect(QueenMenuShortcutPolicy.label(forPetalIndex: 0) == "Cmd+1") + #expect(QueenMenuShortcutPolicy.label(forPetalIndex: 8) == "Cmd+9") + #expect(QueenMenuShortcutPolicy.label(forPetalIndex: 9) == "Option+1") + #expect(QueenMenuShortcutPolicy.label(forPetalIndex: 17) == "Option+9") + #expect(QueenMenuShortcutPolicy.label(forPetalIndex: 18) == "Control+1") + #expect(QueenMenuShortcutPolicy.label(forPetalIndex: 26) == "Control+9") + #expect(QueenMenuShortcutPolicy.label(forPetalIndex: 27) == nil) + } +} diff --git a/apps/queen/Tests/QueenUITests/ModelProviderTests.swift b/apps/queen/Tests/QueenUITests/ModelProviderTests.swift index d47989ec55..c48c00abe5 100644 --- a/apps/queen/Tests/QueenUITests/ModelProviderTests.swift +++ b/apps/queen/Tests/QueenUITests/ModelProviderTests.swift @@ -58,4 +58,37 @@ struct ModelProviderTests { #expect(ChatMode.search.systemSuffix.contains("search")) #expect(ChatMode.reason.systemSuffix.contains("step")) } + + @Test func localSelection_preservesAvailableQueenModel() { + let selected = OllamaSelectionPolicy.preferredModelID( + currentModelID: "claude-sonnet-4-20250514", + availableModelIDs: ["claude-sonnet-4-20250514", "ollama:qwen3.5:cloud"], + discoveredModelNames: ["qwen3.5:cloud"], + queenSavedModelID: nil, + triosSelectedModel: "qwen3.5:cloud" + ) + #expect(selected == nil) + } + + @Test func localSelection_prefersTriosModel() { + let selected = OllamaSelectionPolicy.preferredModelID( + currentModelID: "claude-sonnet-4-20250514", + availableModelIDs: ["ollama:kimi-k2.5:cloud", "ollama:qwen3.5:cloud"], + discoveredModelNames: ["kimi-k2.5:cloud", "qwen3.5:cloud"], + queenSavedModelID: nil, + triosSelectedModel: "qwen3.5:cloud" + ) + #expect(selected == "ollama:qwen3.5:cloud") + } + + @Test func localSelection_fallsBackToFirstDiscoveredModel() { + let selected = OllamaSelectionPolicy.preferredModelID( + currentModelID: "claude-sonnet-4-20250514", + availableModelIDs: ["ollama:kimi-k2.5:cloud"], + discoveredModelNames: ["kimi-k2.5:cloud"], + queenSavedModelID: "ollama:missing", + triosSelectedModel: "missing" + ) + #expect(selected == "ollama:kimi-k2.5:cloud") + } } diff --git a/apps/queen/Tests/QueenUITests/OperationalWorkspaceTests.swift b/apps/queen/Tests/QueenUITests/OperationalWorkspaceTests.swift new file mode 100644 index 0000000000..837fd7912f --- /dev/null +++ b/apps/queen/Tests/QueenUITests/OperationalWorkspaceTests.swift @@ -0,0 +1,108 @@ +import Foundation +import Testing +@testable import QueenUILib + +@Suite("Queen operational workspaces") +struct OperationalWorkspaceTests { + @Test func allMenuRoutesAreUniqueAndCatalogued() { + let routes = (0..<27).map(Screen.screenForBlock) + + #expect(Set(routes).count == 27) + #expect(routes.allSatisfy { QueenWorkspaceCatalog.descriptor(for: $0) != nil }) + #expect(QueenWorkspaceCatalog.operationalScreens.count == 27) + } + + @Test func glassProfileMatchesTriosChatAndModels() { + let profile = QueenGlassTheme.shared + + #expect(profile.rootBlackOpacity == 0.60) + #expect(profile.surfaceBlackOpacity == 0.46) + #expect(profile.elevatedBlackOpacity == 0.58) + #expect(profile.contentBlackOpacity == 0.14) + #expect(profile.borderWhiteOpacity == 0.14) + #expect(profile.mutedTextWhiteOpacity == 0.62) + #expect(profile.dimTextWhiteOpacity == 0.43) + #expect(!profile.usesOpaqueContentFill) + } + + @Test func actionCatalogCoversEveryScreenAction() { + let expected = Set([ + "build", + "cell_create", + "farm_evolve", + "farm_kill_idle", + "git_commit", + "git_push", + "issues_refresh", + "keys_test", + "pipeline_run", + "queen_approve", + "queen_deny", + "queue_clear", + "redeploy", + "scholar_research", + "swarm_decompose", + "telegram_check", + "telegram_test", + ]) + + #expect(Set(QueenActionCatalog.all.map(\.id)) == expected) + #expect( + QueenActionCatalog.definition(for: "farm_kill_idle")?.risk + == .requiresConfirmation + ) + #expect( + QueenActionCatalog.definition(for: "git_push")?.risk + == .requiresConfirmation + ) + #expect( + QueenActionCatalog.definition(for: "issues_refresh")?.risk + == .safe + ) + } + + @Test func actionPayloadUsesCompactRoundTripJSON() throws { + let envelope = QueenActionEnvelope( + timestamp: 123, + action: "swarm_decompose", + params: ["task": "Audit every workspace"] + ) + + let data = try QueenActionCodec.encode([envelope]) + let text = try #require(String(data: data, encoding: .utf8)) + let decoded = try QueenActionCodec.decode(data) + + #expect(text.contains("\"action\":\"swarm_decompose\"")) + #expect(!text.contains("\"action\" :")) + #expect(decoded == [envelope]) + } + + @Test func triToolsExposeExecutableCommandsWithExplicitRisk() { + let commands = TriToolCommandCatalog.commands + let expected = Set([ + "status", + "diff", + "log", + "info", + "pipeline-status", + "verify", + ]) + + #expect(Set(commands.map(\.id)) == expected) + #expect(commands.allSatisfy { !$0.arguments.isEmpty }) + #expect( + commands.first { $0.id == "status" }?.requiresConfirmation + == false + ) + #expect( + commands.first { $0.id == "verify" }?.requiresConfirmation + == true + ) + } + + @Test func triToolOutputRemovesTerminalControlSequences() { + let raw = "\u{001B}[38;2;0;229;153mclean\u{001B}[0m\r\n" + + #expect(TriToolOutputSanitizer.clean(raw) == "clean\n") + } +} diff --git a/apps/queen/Tests/QueenUITests/TriangleMenuPresentationTests.swift b/apps/queen/Tests/QueenUITests/TriangleMenuPresentationTests.swift new file mode 100644 index 0000000000..7a3054fe55 --- /dev/null +++ b/apps/queen/Tests/QueenUITests/TriangleMenuPresentationTests.swift @@ -0,0 +1,18 @@ +import Testing +@testable import QueenUILib + +@Suite("Queen 999 menu presentation") +struct TriangleMenuPresentationTests { + @Test func menuUsesUniformIdlePetalsWithoutRealmLabels() { + #expect(TriangleLogo.rawBlocks.count == 27) + #expect(TriangleMenuPresentation.showsRealmLabels == false) + #expect(TriangleMenuPresentation.specialAnimatedPetal == nil) + #expect(TriangleMenuPresentation.normalPetalOpacity > 0) + #expect(TriangleMenuPresentation.normalPetalOpacity < 1) + } + + @Test func embeddedSurfaceRevealsHostGlass() { + #expect(QueenSurfaceStyle.hostGlass.usesTransparentBackground) + #expect(!QueenSurfaceStyle.canonical.usesTransparentBackground) + } +} From 35405d9488cbdf221b021ecf6fa02f3dc6a0f905 Mon Sep 17 00:00:00 2001 From: Dmitrii Vasilev Date: Sun, 9 Aug 2026 18:10:27 +0700 Subject: [PATCH 07/12] Add a blog and a canonical resources page, and untrack-block the site no more The site is the source of truth for every public resource, so it needs a page that says so and an article surface that other channels link back to. .gitignore carried a bare `website/`, which matched apps/website/ at any depth. 122 of 126 src files were already tracked, so edits kept working and nobody noticed -- but every NEW file was silently excluded, including these. Build output is already handled by the tracked apps/website/.gitignore, so the rule had no remaining purpose. #/resources lists every paper, Zenodo DOI, upstream patch, channel and identity, each row carrying the date it was last checked and a live/broken/unverified status. The discrepancy list renders first rather than being quietly corrected. Building it found that the corpus has ten Zenodo DOIs rather than the three the profile lists, and that two of those three are labelled wrongly. #/blog holds the open-gigabit-Ethernet write-up, unpublished pending measurements the author has to supply. It carries the derived timing theory: the frame-length margin law, the dual-Dirac reconciliation that dissolves an apparent feasibility violation, and a bounded-DJ hypothesis that is explicitly labelled as unfitted rather than dressed up as a result. tsc reports no errors in these files; vite build passes; both routes render. Co-Authored-By: Claude Opus 5 --- .gitignore | 5 +- apps/website/src/data/blog/posts.ts | 330 +++++++++++++++++++++++ apps/website/src/data/resources.ts | 389 +++++++++++++++++++++++++++ apps/website/src/main.tsx | 5 + apps/website/src/pages/Blog.tsx | 260 ++++++++++++++++++ apps/website/src/pages/Resources.tsx | 172 ++++++++++++ 6 files changed, 1160 insertions(+), 1 deletion(-) create mode 100644 apps/website/src/data/blog/posts.ts create mode 100644 apps/website/src/data/resources.ts create mode 100644 apps/website/src/pages/Blog.tsx create mode 100644 apps/website/src/pages/Resources.tsx diff --git a/.gitignore b/.gitignore index 5ceb2ac11e..27a3179ff6 100644 --- a/.gitignore +++ b/.gitignore @@ -358,7 +358,10 @@ runtime/ translator-app/ tree-sitter-vibee/ trinity-nexus/ -website/ +# website/ <- REMOVED 2026-08-09: this bare pattern matched apps/website/, +# the live t27.ai source. 122 of its src files were already tracked, +# so edits worked but every NEW file was silently excluded. +# Build output is handled by apps/website/.gitignore (node_modules, dist). # SOUL bindings (tracked for orchestration) !.trinity/issue_bindings.json diff --git a/apps/website/src/data/blog/posts.ts b/apps/website/src/data/blog/posts.ts new file mode 100644 index 0000000000..e14fbd1f7c --- /dev/null +++ b/apps/website/src/data/blog/posts.ts @@ -0,0 +1,330 @@ +// Blog posts for t27.ai/#/blog +// +// Articles are published HERE FIRST. Every other channel (Habr, LinkedIn, X, +// r/t27ai) links back to this page — the owned surface is the canonical one. +// +// Honesty rules that apply to every post in this file: +// - an unmerged pull request is "submitted upstream", never "merged" +// - a design is not a fabricated chip +// - unsolved defects stay in the text +// - no scale claims in titles + +export type Block = + | { kind: 'p'; text: string } + | { kind: 'h'; text: string } + | { kind: 'ul'; items: string[] } + | { kind: 'ol'; items: string[] } + | { kind: 'quote'; text: string } + | { kind: 'code'; text: string } + | { kind: 'table'; head: string[]; rows: string[][] } + +export interface Post { + slug: string + title: string + /** One sentence. Shown on the index and used as the meta description. */ + summary: string + date: string + readingMinutes: number + tags: string[] + /** Verifiable artefacts a reader can open. Every post must have at least one. */ + receipts: { label: string; href: string }[] + /** What is NOT proven. Rendered prominently. A post without this is marketing. */ + openQuestions: string[] + body: Block[] + /** Set false while the text still has gaps; the index will not list it. */ + published: boolean +} + +const openGigabitEthernet: Post = { + slug: 'open-gigabit-ethernet-artix7', + title: 'Gigabit Ethernet on Artix-7 without a vendor toolchain', + summary: + 'RGMII at gigabit through Yosys, nextpnr-xilinx and Project X-Ray with no vendor tools — the six blockers that had to be patched, the one still open, and what the workaround costs.', + date: '2026-08-09', + readingMinutes: 12, + tags: ['FPGA', 'Open source', 'Ethernet', 'Artix-7', 'openXC7'], + receipts: [ + { label: 'openXC7/nextpnr-xilinx #109 — set_multicycle_path', href: 'https://github.com/openXC7/nextpnr-xilinx/pull/109' }, + { label: '#110 — clock-buffer preplace BFS cap', href: 'https://github.com/openXC7/nextpnr-xilinx/pull/110' }, + { label: '#111 — fabric-driven global buffers', href: 'https://github.com/openXC7/nextpnr-xilinx/pull/111' }, + { label: '#112 — SDP BRAM unused-port width bit', href: 'https://github.com/openXC7/nextpnr-xilinx/pull/112' }, + { label: '#113 — single-site configuration primitives', href: 'https://github.com/openXC7/nextpnr-xilinx/pull/113' }, + { label: '#115 — IDDR IFF flop initialisation', href: 'https://github.com/openXC7/nextpnr-xilinx/pull/115' }, + { + label: + 'Shah, Hung, Wolf, Bazanski, Gisselquist, Milanović — Yosys+nextpnr: an Open Source Framework from Verilog to Bitstream for Commercial FPGAs (FCCM 2019), arXiv:1903.10407', + href: 'https://arxiv.org/abs/1903.10407', + }, + ], + openQuestions: [ + 'The link comes up intermittently at power-on. The cause is not yet known.', + 'All six patches are OPEN on openXC7/nextpnr-xilinx — submitted upstream, none merged as of 2026-08-09.', + 'Hardware IDDR capture on Artix-7 is still broken in the toolchain; the receive path uses fabric DDR capture as a workaround.', + 'Is the 470 ps figure an RMS or a peak-to-peak total, and at what BER? Theorem 2 shows the answer decides whether the link is comfortably feasible (88% eye open) or marginal. Not yet re-measured.', + 'Frame-error rate was never measured directly, only inferred from whether the link came up. The three skew data points are right-censored at tap 31 and cannot discriminate between the candidate models.', + ], + published: false, // TODO: flip to true once the [FILL IN] blocks below are closed + body: [ + { kind: 'h', text: 'The frame, before anything else' }, + { + kind: 'p', + text: + 'What works: an RGMII link at gigabit, built by Yosys -> nextpnr-xilinx -> Project X-Ray, with no vendor utility anywhere in the flow, running on a laptop. Millions of frames pass reliably.', + }, + { + kind: 'p', + text: + 'What does not: the link comes up intermittently at power-on, and I do not yet know why. [FILL IN: fraction of successful power-on link-ups.]', + }, + { + kind: 'p', + text: + 'What is not mine: the flow itself. Yosys is YosysHQ. nextpnr is YosysHQ and David Shah — the framework paper is Shah, Hung, Wolf, Bazanski, Gisselquist and Milanović at FCCM 2019 (arXiv:1903.10407), and it covers Lattice iCE40 and ECP5; Xilinx 7-series came later through nextpnr-xilinx. Project X-Ray and the xc7 bitstream database are SymbiFlow/F4PGA. The Xilinx port and Artix-7 support are openXC7, funded by NLnet. I did not build this stack. I found six places where it broke on my design and sent six patches.', + }, + + { kind: 'h', text: 'Why RGMII and not SerDes' }, + { + kind: 'p', + text: + 'openXC7 has funded work on gigabit transceivers, but that targets GTP/GTX — high-speed serial lanes, aimed at 10G. Different problem. RGMII is source-synchronous DDR over ordinary user I/O on general-purpose registers. Cheaper, closer to a typical dev board with a gigabit PHY, and therefore it stresses primitives rather than transceivers: ODDR/IDDR, clock buffers, clock management.', + }, + { kind: 'p', text: 'Board: [FILL IN: board model, xc7aNNNt part, PHY].' }, + + { kind: 'h', text: 'Blocker 1 — the router gave up before trying half the options' }, + { + kind: 'p', + text: + 'Path search from an SRCC pin to a clock buffer stopped at 50,000 iterations. The chip database holds more than 75,000 valid paths. The cap was set below the size of the search space, so "unroutable" actually meant "unfinished". The fix is one constant.', + }, + { + kind: 'quote', + text: + 'Worth remembering as a class of bug: an iteration limit set smaller than the dimension of the problem looks exactly like "no route exists".', + }, + + { kind: 'h', text: 'Blockers 2-5 — four ways a build dies quietly' }, + { + kind: 'ul', + items: [ + 'A global clock buffer driven from the fabric aborted placement instead of being pre-placed (#111).', + 'set_multicycle_path was parsed and silently dropped — no error, no effect. The worst kind of failure: the constraint looks applied (#109).', + 'A simple-dual-port BRAM emitted conflicting width bits for the port I was not using, and the bitstream was never produced at all (#112).', + 'STARTUPE2, ICAPE2 and relatives exist once per die but had no pre-placement (#113).', + ], + }, + + { kind: 'h', text: 'Blocker 6 — the one that is still open' }, + { + kind: 'p', + text: + 'The hardware IDDR block did not capture data. This remains open in the toolchain. #115 initialises all four IFF flops rather than only Q1/Q2, which closes part of the initialisation problem, but the receive path still had to move: RGMII receive is done with fabric DDR capture instead of the hardware IDDR.', + }, + + { kind: 'h', text: 'What the workaround costs: jitter, and a dependence on frame size' }, + { + kind: 'p', + text: + 'Moving capture into the fabric raised jitter to sigma ~= 470 ps. That exposed an effect invisible with hardware IDDR: link stability depends on frame size.', + }, + { + kind: 'table', + head: ['Frame', 'Size', 'Minimum working skew step'], + rows: [ + ['ARP', 'short', '26'], + ['ICMP', '98 bytes', '30'], + ['Full MTU', '1514 bytes', '31 (the maximum)'], + ], + }, + { + kind: 'p', + text: + 'Jitter accumulates along the frame, so the required timing margin grows monotonically with frame length in bits. A full MTU frame only comes up at the last available step — the margin is exhausted, which is one more reason power-on is unreliable.', + }, + { + kind: 'quote', + text: + 'Calibrate skew to the longest frame you will ever send. A link tuned on ARP will drop its first full frame, and it will look like a flaky network rather than a calibration error.', + }, + + { kind: 'h', text: 'The margin law — and why "jitter accumulates" is the wrong mechanism' }, + { + kind: 'p', + text: + 'The rule above is right. The explanation I first gave for it was not, and the numbers say so clearly enough that it is worth writing down properly.', + }, + { + kind: 'p', + text: + 'Setup. RGMII at 1000BASE-T runs a 125 MHz clock, double data rate, four bits per edge — one unit interval UI = 4 ns, and a frame of B bytes is captured in N = 2B sampling edges. Let each edge carry a phase error X_i, i.i.d., symmetric, with standard deviation sigma. The frame is received correctly exactly when every edge lands inside the margin: |X_i| < m for all i.', + }, + { + kind: 'quote', + text: + 'Theorem 1 (frame-length margin law). P(frame OK) = (1 - 2(1 - F(m)))^N. For a target frame-error rate eps, the required margin is m(N) = F^-1(1 - eps/(2N)); for Gaussian error, m(N) = sigma * Phi^-1(1 - eps/(2N)), which is asymptotically sigma * sqrt(2 ln(2N/eps)).', + }, + { + kind: 'p', + text: + 'So the margin does grow monotonically with frame length — but as sqrt(log N), not as sqrt(N). This is an extreme-value effect over N independent draws, not accumulation. Nothing integrates: RGMII forwards the clock alongside the data, so each edge is sampled afresh and phase error has no memory from one edge to the next.', + }, + { + kind: 'quote', + text: + 'Corollary 1 (the random-walk model is refuted). If the receive clock were independent, phase error would integrate as sigma_N = sigma * sqrt(N). At sigma = 470 ps and MTU (N = 3028), that is 25.9 ns against a 2.0 ns half-eye — over by a factor of 13. The link demonstrably works, so jitter here does not accumulate.', + }, + { + kind: 'quote', + text: + 'Corollary 2 (feasibility bound). A link is feasible for N-edge frames only if sigma < (UI/2) / Phi^-1(1 - eps/(2N)). At UI = 4 ns and MTU that ceiling is 430 ps for a 1% frame-error rate and 318 ps for 1e-6.', + }, + { + kind: 'h', + text: 'Reading 470 ps as a per-edge sigma appears to violate that bound — and that reading was wrong', + }, + { + kind: 'p', + text: + 'Taken as an i.i.d. per-edge RMS, sigma = 470 ps exceeds the MTU ceiling by 9% at a 1% frame-error rate and by 48% at 1e-6, and centring perfectly (m = UI/2 = 2 ns) gives m/sigma = 4.26, so P(edge error) = 2.1e-5. Propagated over a frame that predicts:', + }, + { + kind: 'table', + head: ['Frame', 'Edges N', 'Predicted frame-error rate at ideal centring'], + rows: [ + ['ARP 64 B', '128', '0.27%'], + ['ICMP 98 B', '196', '0.41%'], + ['512 B', '1024', '2.11%'], + ['1024 B', '2048', '4.19%'], + ['MTU 1514 B', '3028', '6.13%'], + ], + }, + { + kind: 'p', + text: + 'A 6% loss rate on full frames would be survivable — TCP retransmits and the link still looks up. But it is not what a working gigabit link looks like, and the resolution turns out to be simpler than any of that.', + }, + { kind: 'h', text: 'Theorem 2 — the dual-Dirac split, and the contradiction dissolves' }, + { + kind: 'p', + text: + 'The standard decomposition splits jitter into a bounded deterministic part and an unbounded Gaussian random part, and combines them at a target bit-error rate: TJ = DJ_pp + 2n * RJ_rms, with n = 6.4 at 1e-10, 7.0 at 1e-12, 7.6 at 1e-14. A scope quotes total jitter. I had read 470 ps as a per-edge RMS sigma. Those are not the same number.', + }, + { + kind: 'table', + head: ['Target BER', 'n', 'RJ_rms if DJ_pp = 0', 'RJ_rms if DJ_pp = 300 ps'], + rows: [ + ['1e-10', '6.4', '36.7 ps', '13.3 ps'], + ['1e-12', '7.0', '33.6 ps', '12.1 ps'], + ['1e-14', '7.6', '30.9 ps', '11.2 ps'], + ], + }, + { + kind: 'p', + text: + 'Eye opening = 4000 - 470 = 3530 ps, which is 88% of the unit interval. Comfortably feasible. Read as an i.i.d. per-edge RMS, 470 ps implies a random component about 14x larger than the dual-Dirac decomposition allows at 1e-12. The feasibility violation was an artefact of my reading, not a property of the link. Corollary 2 remains true as stated; its premise simply does not hold here.', + }, + { + kind: 'quote', + text: + 'So the first question to ask about any jitter figure is: RMS or peak-to-peak, and at what BER? Everything downstream turns on that one answer.', + }, + { kind: 'h', text: 'Theorem 3 — bounded deterministic jitter, offered as a hypothesis and not a law' }, + { + kind: 'p', + text: + 'If the random component is only ~30 ps RMS it cannot explain frame-length dependence at all. Something bounded and pattern-dependent must: inter-symbol interference and duty-cycle distortion are functions of the bit pattern, not of elapsed time. A short ARP frame may never exercise the worst-case pattern; an MTU frame probably does. With p the per-edge probability of hitting a near-worst pattern, m(N) = s_inf - (s_inf - s0)(1-p)^N, which saturates rather than diverging — and the observed 26, 30, 31 does decelerate.', + }, + { + kind: 'p', + text: + 'That fit is worth nothing as evidence and I want to be explicit about why. Three parameters against three points is exact by construction. Two diagnostics say so: the fitted ceiling lands on exactly 31.00 taps, but the MTU point is censored at 31, so any saturating model is forced there; and the fitted s0 comes out at -73 taps, a negative delay, which is what an over-parameterised fit looks like when nothing constrains it. Theorem 3 is a mechanism hypothesis with a prediction — 128 B should need about tap 30.8, and 256 B and above should already be pinned at 31. It is falsified if 256 B works comfortably at tap 28.', + }, + { kind: 'h', text: 'The experiment to run first: vary content, not length' }, + { + kind: 'p', + text: + 'A length sweep is confounded by the censored tap range. Payload content is not. Hold the frame at 1514 bytes and vary only the payload — all-zeros, all-ones, PRBS-7, PRBS-31, and a deliberate worst-case ISI pattern (a long run followed by an isolated transition) — 1e5 frames each at a fixed tap.', + }, + { + kind: 'ul', + items: [ + 'Frame-error rate depends strongly on content: ISI dominates, and the fix is equalisation or better capture rather than more skew range.', + 'Frame-error rate is independent of content: the mechanism is random jitter after all, and the 470 ps figure needs re-measuring as an RMS.', + 'It depends on both: decompose properly with a dual-Dirac scope measurement.', + ], + }, + { + kind: 'p', + text: + 'This needs no wider tap range and no new hardware, which is what makes it the first test rather than the third.', + }, + { + kind: 'p', + text: + 'The three measured points cannot settle it. Fitting step against ln N gives consecutive slopes of 9.39 and 0.37 — a factor of 26 apart; against sqrt(N) it is 1.49 and 0.02, a factor of 61. Neither functional form fits, and the reason is visible in the data: the MTU point sits at tap 31, the maximum of the range, so it is right-censored. Its true required skew may be larger than the hardware can express.', + }, + { + kind: 'h', text: 'The experiment that would settle it', + }, + { + kind: 'p', + text: + 'Sweep the payload at 64, 128, 256, 512, 1024 and 1514 bytes at the best tap, 1e5 frames each, and measure frame-error rate directly instead of inferring it from whether the link comes up.', + }, + { + kind: 'ul', + items: [ + 'FER rising roughly linearly in N, from ~0.3% to ~6% — the i.i.d. model holds and sigma is real.', + 'FER roughly flat in N — the errors are correlated or systematic, and 470 ps is not per-edge random jitter.', + 'FER exploding faster than linearly — something does integrate, and the forwarded clock is not doing its job.', + ], + }, + { + kind: 'p', + text: + 'A widened tap range would also uncensor the MTU point. Until then the practical rule stands on its own evidence — calibrate to the longest frame — while the mechanism behind it stays open.', + }, + + { kind: 'h', text: 'Reproduction' }, + { + kind: 'code', + text: [ + '# synthesis', + "yosys -p 'synth_xilinx -flatten -nowidelut -family xc7 -json .json' .v", + '', + '# place and route', + 'nextpnr-xilinx --chipdb .bin --xdc .xdc \\', + ' --json .json --write _routed.json --fasm .fasm', + '', + '# bitstream', + 'python3 fasm2frames.py --part --db-root .fasm > .frames', + 'xc7frames2bit --part_file .yaml --frm_file .frames --output_file .bit', + '', + '# flash', + 'openFPGALoader -b .bit', + ].join('\n'), + }, + { + kind: 'p', + text: + '[FILL IN: exact , , , and how the skew step is set. Without them this section is useless; with invented values it is harmful.]', + }, + + { kind: 'h', text: 'What this means' }, + { + kind: 'p', + text: + 'A fully open cycle — synthesis, place and route, bitstream, flashing, all local and unlicensed — takes gigabit Ethernet to a working state on Artix-7. Six places where it could not are now described and patched; one blocker remains open and is worked around at the cost of jitter.', + }, + { + kind: 'p', + text: + 'This is not a replacement for Vivado. It is a report that on one class of design the open flow reaches the end, plus the exact list of what has to be fixed to get there.', + }, + ], +} + +export const posts: Post[] = [openGigabitEthernet] + +export const publishedPosts = () => posts.filter((p) => p.published) + +export const postBySlug = (slug: string) => posts.find((p) => p.slug === slug) diff --git a/apps/website/src/data/resources.ts b/apps/website/src/data/resources.ts new file mode 100644 index 0000000000..b5fa5affb4 --- /dev/null +++ b/apps/website/src/data/resources.ts @@ -0,0 +1,389 @@ +// SOURCE OF TRUTH for every public resource in the Trinity / t27 corpus. +// +// Standing instruction, 2026-08-09: "мой сайт это источник правды для всех ресурсов". +// Every other surface — GitHub profile README, LinkedIn, Habr, Reddit, slide decks — +// must be reconciled AGAINST this file, not the other way round. +// +// Rules for editing: +// 1. `verified` is the date the entry was checked against the live resource. Never bump +// it without actually re-checking. An unchecked entry keeps its old date. +// 2. `status: 'live'` means the URL was opened and returned the claimed thing. +// 'broken' means it was opened and did not. 'unverified' means nobody looked. +// 3. `note` carries the discrepancy when a resource is described wrongly elsewhere. +// 4. Never describe an unmerged pull request as merged, and never claim an arXiv ID +// that does not exist. + +export type ResourceKind = + | 'paper' + | 'dataset' + | 'repo' + | 'channel' + | 'identity' + | 'service' + +export type ResourceStatus = 'live' | 'broken' | 'unverified' + +export interface Resource { + kind: ResourceKind + title: string + href: string + /** Stable identifier: arXiv ID, DOI, handle, ORCID. */ + id?: string + /** ISO date this row was last checked against the live resource. */ + verified: string + status: ResourceStatus + /** A discrepancy, a caveat, or what makes this row load-bearing. */ + note?: string +} + +export const CORPUS_VERIFIED = '2026-08-09' + +export const papers: Resource[] = [ + { + kind: 'paper', + title: + 'GoldenFloat: A Phi-Derived Static-Split Floating-Point Family from GF4 to GF1024 with a Lucas-Exact Integer Identity', + href: 'https://arxiv.org/abs/2606.05017', + id: 'arXiv:2606.05017v3', + verified: '2026-08-09', + status: 'live', + note: 'v3, 22 Jun 2026, 20 pp, cs.AR primary + cs.MS. v1 = 19 pp, v2 = 20 pp.', + }, + { + kind: 'paper', + title: + 'An 83-Format Numeric Catalog with Bit-Exact Conformance Vectors: A Vendor-Neutral Reference for FP8, BF16, MXFP4, and Microscaling Formats', + href: 'https://arxiv.org/abs/2606.09686', + id: 'arXiv:2606.09686v2', + verified: '2026-08-09', + status: 'live', + note: '83 formats, not 84. The 84-format title is v1 only and is historical.', + }, + { + kind: 'paper', + title: 'Cognitive framework', + href: 'https://arxiv.org/abs/2605.28405', + id: 'arXiv:2605.28405v1', + verified: '2026-07-28', + status: 'unverified', + note: 'v1, 27 May 2026, 32 pp, cs.AI. Not re-opened in the 2026-08-09 pass.', + }, +] + +export const datasets: Resource[] = [ + { + kind: 'dataset', + title: 'GoldenFloat: φ-Optimal Floating-Point Formats for Ternary Computing (T27)', + href: 'https://doi.org/10.5281/zenodo.19456875', + id: '10.5281/zenodo.19456875', + verified: '2026-08-09', + status: 'live', + note: + 'v0.1.0, 2026-04-07, 22 views / 9 downloads. The GitHub profile README calls this "t27 language spec" — WRONG, it is a GoldenFloat record. Also overlaps arXiv:2606.05017 with a different version number and no visible cross-link.', + }, + { + kind: 'dataset', + title: 'Trinity S³AI Framework — Complete Research Collection v5.0', + href: 'https://doi.org/10.5281/zenodo.19227879', + id: '10.5281/zenodo.19227879', + verified: '2026-08-09', + status: 'live', + note: + '2026-03-26, 54 views / 12 downloads. The GitHub profile README calls this "Trinity v9.0" — WRONG, the record says v5.0.', + }, + { + kind: 'dataset', + title: 'gHashTag/trinity: Trinity v2.0.2 — FPGA Autoregressive Ternary LLM', + href: 'https://doi.org/10.5281/zenodo.18947017', + id: '10.5281/zenodo.18947017', + verified: '2026-08-09', + status: 'live', + note: + '2026-03-11, 141 views / 12 downloads. Description matches the README. ✓ Concept DOI 10.5281/zenodo.18939351.', + }, + + // The B-series: seven records the GitHub profile never mentioned. Found via the + // related_identifiers of the v5.0 collection, not from any list we maintained. + { + kind: 'dataset', + title: 'Trinity B001: Ternary Neural Networks — Complete Scientific Framework', + href: 'https://doi.org/10.5281/zenodo.19227865', + id: '10.5281/zenodo.19227865', + verified: '2026-08-09', + status: 'live', + note: 'v5.0, 2026-03-26, 69 views.', + }, + { + kind: 'dataset', + title: 'Trinity B002: Zero-DSP FPGA Architecture for Ternary Inference', + href: 'https://doi.org/10.5281/zenodo.19227867', + id: '10.5281/zenodo.19227867', + verified: '2026-08-09', + status: 'live', + note: + 'v5.0, 2026-03-26, 54 views. Overlaps the unpublished FPL paper "Zero-DSP Ternary Transformer Inference on a $30 FPGA" — check for self-overlap before submitting.', + }, + { + kind: 'dataset', + title: 'Trinity B003: TRI-27 ISA — Ternary Instruction Set with Coptic Alphabet', + href: 'https://doi.org/10.5281/zenodo.19227869', + id: '10.5281/zenodo.19227869', + verified: '2026-08-09', + status: 'live', + note: + 'v5.0, 2026-03-26, 64 views. This — not 19456875 — is the record closest to "t27 language spec".', + }, + { + kind: 'dataset', + title: 'Trinity B004: Queen Lotus Cycle — Autonomous Orchestration', + href: 'https://doi.org/10.5281/zenodo.19227871', + id: '10.5281/zenodo.19227871', + verified: '2026-08-09', + status: 'live', + note: 'v5.0, 2026-03-26, 54 views.', + }, + { + kind: 'dataset', + title: 'Trinity B005: Tri Language — Linear Types, Effects, Dual Targets', + href: 'https://doi.org/10.5281/zenodo.19227873', + id: '10.5281/zenodo.19227873', + verified: '2026-08-09', + status: 'live', + note: 'v5.0, 2026-03-26, 49 views.', + }, + { + kind: 'dataset', + title: 'Trinity B006: Sacred GF16/TF3 — Phi-Based Arithmetic for Ternary Computing', + href: 'https://doi.org/10.5281/zenodo.19227875', + id: '10.5281/zenodo.19227875', + verified: '2026-08-09', + status: 'live', + note: + 'v5.0, 2026-03-26, 54 views. Overlaps the unpublished arXiv draft "Sacred GF16/TF3-9 Arithmetic on Artix-7".', + }, + { + kind: 'dataset', + title: 'Trinity B007: VSA Operations for Ternary Computing v5.0', + href: 'https://doi.org/10.5281/zenodo.19227877', + id: '10.5281/zenodo.19227877', + verified: '2026-08-09', + status: 'live', + note: + 'v5.0, 2026-03-26, **228 views — the most-viewed record in the corpus**, and it appears on no profile, README or CV.', + }, +] + +export const upstream: Resource[] = [ + { + kind: 'repo', + title: 'openXC7/nextpnr-xilinx #109 — set_multicycle_path -setup (XDC parser + timing)', + href: 'https://github.com/openXC7/nextpnr-xilinx/pull/109', + verified: '2026-08-09', + status: 'live', + note: 'OPEN, not merged.', + }, + { + kind: 'repo', + title: '#110 — raise clock-buffer preplace BFS cap so SRCC clock pins can route', + href: 'https://github.com/openXC7/nextpnr-xilinx/pull/110', + verified: '2026-08-09', + status: 'live', + note: 'OPEN, not merged.', + }, + { + kind: 'repo', + title: '#111 — preplace fabric-driven global buffers instead of aborting placement', + href: 'https://github.com/openXC7/nextpnr-xilinx/pull/111', + verified: '2026-08-09', + status: 'live', + note: 'OPEN, not merged.', + }, + { + kind: 'repo', + title: "#112 — don't emit a conflicting width bit for the unused port of an SDP BRAM", + href: 'https://github.com/openXC7/nextpnr-xilinx/pull/112', + verified: '2026-08-09', + status: 'live', + note: 'OPEN, not merged.', + }, + { + kind: 'repo', + title: '#113 — preplace the single-site configuration primitives (STARTUPE2, ICAPE2, ...)', + href: 'https://github.com/openXC7/nextpnr-xilinx/pull/113', + verified: '2026-08-09', + status: 'live', + note: 'OPEN, not merged.', + }, + { + kind: 'repo', + title: '#115 — initialise all four IFF flops for an IDDR, not just Q1/Q2', + href: 'https://github.com/openXC7/nextpnr-xilinx/pull/115', + verified: '2026-08-09', + status: 'live', + note: 'OPEN, not merged. The underlying IDDR capture issue stays open in the toolchain.', + }, +] + +export const channels: Resource[] = [ + { + kind: 'channel', + title: 'Habr — @raoffonom', + href: 'https://habr.com/ru/users/raoffonom/', + verified: '2026-08-09', + status: 'live', + note: + 'Strongest social channel: 12 articles, best one at 7.8K reach / 19 bookmarks / 20 comments. Two further posts were pulled — one flagged as machine-written, one at -8 votes.', + }, + { + kind: 'channel', + title: 'LinkedIn — /in/neurocoder', + href: 'https://www.linkedin.com/in/neurocoder/', + verified: '2026-08-09', + status: 'live', + note: '612 followers. Last post: 461 impressions, 1 reaction.', + }, + { + kind: 'channel', + title: 'X — @t27_dev', + href: 'https://x.com/t27_dev', + verified: '2026-08-09', + status: 'live', + note: + '118 followers, 145 posts, joined Apr 2019. Formerly @koshasuperstar — renamed, not a separate account.', + }, + { + kind: 'channel', + title: 'X — @t27_lang', + href: 'https://x.com/t27_lang', + verified: '2026-08-09', + status: 'unverified', + note: + 'This is the handle the site footer links. The GitHub README links @t27_dev instead. Pick one.', + }, + { + kind: 'channel', + title: 'Telegram — t.me/t27_lang (project channel)', + href: 'https://t.me/t27_lang', + verified: '2026-08-09', + status: 'unverified', + note: 'Subscriber count not measured.', + }, + { + kind: 'channel', + title: 'Telegram — t.me/t27_dev (personal account, NOT a channel)', + href: 'https://t.me/t27_dev', + verified: '2026-08-09', + status: 'live', + note: + 't.me/s/t27_dev returns only a bio. The GitHub README Telegram badge points here, so it leads to a DM box rather than a broadcast channel.', + }, + { + kind: 'channel', + title: 'Reddit — r/t27ai', + href: 'https://www.reddit.com/r/t27ai/', + verified: '2026-08-09', + status: 'broken', + note: + 'RESTRICTED ACCESS. Created 27 Mar 2026, two posts (both by the owner), silent four months. A restricted subreddit cannot be discovered or joined, so the footer link leads nowhere. Make it public or drop the link.', + }, + { + kind: 'channel', + title: 'Telegram — t.me/t27_lang (project channel)', + href: 'https://t.me/t27_lang', + verified: '2026-08-09', + status: 'live', + note: + '18 subscribers. Best post 166 views — the Russian Knuth/Setun piece; PhD monograph post 91. Same pattern as Habr: culturally-anchored Russian framing outperforms English announcements.', + }, + { + kind: 'channel', + title: 'X — @trinity_cli', + href: 'https://twitter.com/trinity_cli', + verified: '2026-08-09', + status: 'unverified', + note: + 'A third X handle, found only in the r/t27ai sidebar. X is now split three ways: @t27_dev (118 followers, the real history), @t27_lang (site footer), @trinity_cli (subreddit).', + }, + { + kind: 'channel', + title: 'Zenodo community — trinity', + href: 'https://zenodo.org/communities/trinity', + verified: '2026-08-09', + status: 'unverified', + note: 'Linked only from the r/t27ai sidebar; absent from the profile, the site and the CV.', + }, + { + kind: 'channel', + title: 'Reddit — u/Open-Elderberry699', + href: 'https://www.reddit.com/user/Open-Elderberry699/', + verified: '2026-08-09', + status: 'live', + note: + 'Auto-generated username carrying real FPGA posts in r/FPGA and r/Zig. Reputation cannot accrue to a name nobody recognises.', + }, + { + kind: 'channel', + title: 'dev.to — @serverlesskiy', + href: 'https://dev.to/serverlesskiy', + verified: '2026-08-09', + status: 'broken', + note: + '/ghashtag redirects here. The profile still links twitter.com/koshasuperstar — a dead handle.', + }, + { + kind: 'channel', + title: 'Medium — @raoffonom', + href: 'https://medium.com/@raoffonom', + verified: '2026-08-09', + status: 'live', + note: '56 followers, 7 posts, dormant since Nov 2021.', + }, + { + kind: 'channel', + title: 'GitHub — gHashTag', + href: 'https://github.com/gHashTag', + verified: '2026-08-09', + status: 'live', + note: + '89 followers, 217 repositories total / 187 public. The profile README still says 210 total / 186 public / 86 followers.', + }, +] + +export const identities: Resource[] = [ + { + kind: 'identity', + title: 'ORCID 0009-0008-4294-6159', + href: 'https://orcid.org/0009-0008-4294-6159', + id: '0009-0008-4294-6159', + verified: '2026-07-28', + status: 'unverified', + }, + { + kind: 'identity', + title: 'arXiv author identifier', + href: 'https://arxiv.org/a/vasilev_d_1', + verified: '2026-08-09', + status: 'broken', + note: + 'Returns "Not Found". The three arXiv papers do not resolve to one author page, so nothing can link to a single publication list.', + }, + { + kind: 'identity', + title: 'Contact — admin@t27.ai', + href: 'mailto:admin@t27.ai', + verified: '2026-08-09', + status: 'live', + }, +] + +export const allResources = (): Resource[] => [ + ...papers, + ...datasets, + ...upstream, + ...channels, + ...identities, +] + +/** Rows a reader should treat with suspicion. Rendered first, on purpose. */ +export const discrepancies = () => + allResources().filter((r) => r.status === 'broken' || /WRONG|dead|does not|Pick one/i.test(r.note ?? '')) diff --git a/apps/website/src/main.tsx b/apps/website/src/main.tsx index 202d1e6037..e905a126f1 100644 --- a/apps/website/src/main.tsx +++ b/apps/website/src/main.tsx @@ -10,6 +10,8 @@ import TrinityCanvas from './pages/TrinityCanvas.tsx' import TrinityCanvasWasm from './components/TrinityCanvasWasm.tsx' import ProductionDashboard from './components/ProductionDashboard.tsx' import TechTreePage from './pages/TechTreePage.tsx' +import { BlogIndex, BlogPost } from './pages/Blog.tsx' +import Resources from './pages/Resources.tsx' import { I18nProvider } from './i18n/context.tsx' createRoot(document.getElementById('root')!).render( @@ -20,6 +22,9 @@ createRoot(document.getElementById('root')!).render( } /> } /> } /> + } /> + } /> + } /> } /> } /> } /> diff --git a/apps/website/src/pages/Blog.tsx b/apps/website/src/pages/Blog.tsx new file mode 100644 index 0000000000..e17660f959 --- /dev/null +++ b/apps/website/src/pages/Blog.tsx @@ -0,0 +1,260 @@ +import { Link, useParams } from 'react-router-dom' +import Navigation from '../components/Navigation' +import Footer from '../components/Footer' +import { publishedPosts, postBySlug, type Block, type Post } from '../data/blog/posts' + +const wrap: React.CSSProperties = { + maxWidth: '760px', + margin: '0 auto', + padding: '120px 24px 80px', +} + +const meta: React.CSSProperties = { + color: 'var(--text-dim, #8a8a8a)', + fontSize: '0.85rem', + letterSpacing: '0.04em', + textTransform: 'uppercase', +} + +const card: React.CSSProperties = { + display: 'block', + padding: '24px', + border: '1px solid var(--border, #2a2a2a)', + borderRadius: '10px', + marginBottom: '20px', + textDecoration: 'none', + color: 'inherit', +} + +function renderBlock(b: Block, i: number) { + switch (b.kind) { + case 'h': + return ( +

+ {b.text} +

+ ) + case 'p': + return ( +

+ {b.text} +

+ ) + case 'ul': + return ( +
    + {b.items.map((it, j) => ( +
  • + {it} +
    • + ))} +
+ ) + case 'ol': + return ( +
    + {b.items.map((it, j) => ( +
  1. + {it} +
    2. + ))} +
+ ) + case 'quote': + return ( +
+ {b.text} +
+ ) + case 'code': + return ( + 
+          {b.text}
+
+ ) + case 'table': + return ( +
+ + + + {b.head.map((h, j) => ( + + ))} + + + + {b.rows.map((r, j) => ( + + {r.map((c, k) => ( + + ))} + + ))} + +
+ {h} +
+ {c} +
+
+ ) + } +} + +/** Renders before the body on purpose: what is not proven comes first, not last. */ +function OpenQuestions({ post }: { post: Post }) { + if (!post.openQuestions.length) return null + return ( +
+
Not proven / still open
+
    + {post.openQuestions.map((q, i) => ( +
  • + {q} +
    • + ))} +
+
+ ) +} + +function Receipts({ post }: { post: Post }) { + if (!post.receipts.length) return null + return ( +
+
Receipts
+ +
+ ) +} + +export function BlogIndex() { + const items = publishedPosts() + return ( +
+ +
+

Blog

+

+ Measured results and the methods behind them. Published here first; every other channel + links back to this page. +

+ + {items.length === 0 ? ( +

+ No posts published yet. Drafts exist but still have gaps — a post goes live when every + number in it can be traced to an artefact. +

+ ) : ( + items.map((p) => ( + +
+ {p.date} · {p.readingMinutes} min · {p.tags.join(' · ')} +
+

{p.title}

+

+ {p.summary} +

+ + )) + )} +
+
+
+ ) +} + +export function BlogPost() { + const { slug } = useParams<{ slug: string }>() + const post = slug ? postBySlug(slug) : undefined + + if (!post || !post.published) { + return ( +
+ +
+

Not published

+

+ This post either does not exist or is still a draft.{' '} + Back to the blog. +

+
+
+
+ ) + } + + return ( +
+ +
+
+ {post.date} · {post.readingMinutes} min · {post.tags.join(' · ')} +
+

{post.title}

+

+ {post.summary} +

+ + + {post.body.map(renderBlock)} + + +

+ ← All posts +

+
+
+
+ ) +} + +export default BlogIndex diff --git a/apps/website/src/pages/Resources.tsx b/apps/website/src/pages/Resources.tsx new file mode 100644 index 0000000000..80d077d715 --- /dev/null +++ b/apps/website/src/pages/Resources.tsx @@ -0,0 +1,172 @@ +import Navigation from '../components/Navigation' +import Footer from '../components/Footer' +import { + papers, + datasets, + upstream, + channels, + identities, + discrepancies, + CORPUS_VERIFIED, + type Resource, +} from '../data/resources' + +const wrap: React.CSSProperties = { + maxWidth: '900px', + margin: '0 auto', + padding: '120px 24px 80px', +} + +const dim = 'var(--text-dim, #8a8a8a)' +const border = 'var(--border, #2a2a2a)' +const accent = 'var(--accent, #d4af37)' + +const badge = (status: Resource['status']): React.CSSProperties => ({ + display: 'inline-block', + fontSize: '0.68rem', + letterSpacing: '0.06em', + textTransform: 'uppercase', + padding: '2px 7px', + borderRadius: '4px', + border: `1px solid ${status === 'broken' ? '#c0392b' : status === 'live' ? accent : border}`, + color: status === 'broken' ? '#e06055' : status === 'live' ? accent : dim, + whiteSpace: 'nowrap', +}) + +function Table({ title, rows, id }: { title: string; rows: Resource[]; id: string }) { + return ( +
+

{title}

+
+ + + + {['Resource', 'Identifier', 'Checked', 'State'].map((h) => ( + + ))} + + + + {rows.map((r) => ( + + + + + + + ))} + +
+ {h} +
+ + {r.title} + + {r.note && ( +
+ {r.note} +
+ )} + 		+ {r.id ?? '—'} + + {r.verified} + + {r.status} +
+
+
+ ) +} + +export default function Resources() { + const bad = discrepancies() + return ( +
+ +
+

Resources

+

+ The canonical list of every public resource in this corpus — papers, DOIs, upstream + patches, channels, identities. Anything stated elsewhere (GitHub profile, LinkedIn, + slide decks) is reconciled against this page, not the other way round. +

+

+ Each row carries the date it was last checked against the live resource. A row is not + re-dated unless someone actually re-opened it. Corpus last swept:{' '} + {CORPUS_VERIFIED}. +

+ + {bad.length > 0 && ( +
+
+ Known discrepancies — {bad.length} +
+

+ Published here rather than quietly fixed, so that anyone who found the wrong + version elsewhere can see which one is right. +

+
    + {bad.map((r) => ( +
  • + + {r.title} + + {r.note && — {r.note}} +
    • + ))} +
+
+ )} + + +
+
+
+
+ +
+ + ) +} From 7f4adcbcb39dfe2db928cf4f685351495239b2a6 Mon Sep 17 00:00:00 2001 From: Dmitrii Vasilev Date: Sun, 9 Aug 2026 18:44:43 +0700 Subject: [PATCH 08/12] r/t27ai is public: record the change and what it cost to make Reddit approved the restricted -> public request the same day it was filed. Verified against about.json: subreddit_type "public", 1 subscriber. Worth recording why it took a request rather than a click. Reddit does not expose this as a toggle -- Mod Tools > Privacy > Community type opens a review form demanding a written reason under 500 characters, handled by admins. Four scripted attempts to flip the radio did nothing, in both the new and the old interface, because the control is inert by design. "The control does not respond" was not the same as "the automation is broken", and reading it that way would have sent the next hour in the wrong direction. The permission blocker is gone. The content gap is not: two posts, both by the owner, silent for four months. Co-Authored-By: Claude Opus 5 --- apps/website/src/data/resources.ts | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/apps/website/src/data/resources.ts b/apps/website/src/data/resources.ts index b5fa5affb4..88ff4bee1b 100644 --- a/apps/website/src/data/resources.ts +++ b/apps/website/src/data/resources.ts @@ -282,9 +282,9 @@ export const channels: Resource[] = [ title: 'Reddit — r/t27ai', href: 'https://www.reddit.com/r/t27ai/', verified: '2026-08-09', - status: 'broken', + status: 'live', note: - 'RESTRICTED ACCESS. Created 27 Mar 2026, two posts (both by the owner), silent four months. A restricted subreddit cannot be discovered or joined, so the footer link leads nowhere. Make it public or drop the link.', + 'PUBLIC as of 2026-08-09 (verified: subreddit_type "public", 1 subscriber). Was restricted from creation on 27 Mar 2026 until a review request was approved. Two posts, both by the owner, silent four months — it now needs content, not permissions.', }, { kind: 'channel', From fd65f63b03b9545c56451fae1e84edccdac1c726 Mon Sep 17 00:00:00 2001 From: Dmitrii Vasilev Date: Sun, 9 Aug 2026 22:13:12 +0700 Subject: [PATCH 09/12] Fill the Ethernet post from issue #114 instead of guessing Three gaps in the draft were marked [FILL IN] because I did not have the facts. They were in a public source the whole time -- openXC7/nextpnr-xilinx issue #114, authored on the bench with an A/B/A/B bitstream flip: - board and part: ALINX AX7203, xc7a200tfbg484-2, 125 MHz RXC on SRCC pin B17 into a BUFG, nextpnr-xilinx stable-backports f8e7643 + the open patches, Yosys 0.63, prjxray via the regymm/openxc7 image - the blocker-6 text was understated: the IDDR does not capture at all, in any edge mode. "Q1 dead, Q2 alive" was withdrawn upstream and the post now says so - the methodology section that was a placeholder is now the actual story: liveness was detected with a sticky OR, which cannot separate a toggling output from one stuck at 1. The complementary sticky zero showed both outputs inert Added issue #114 and issue #65 (SAME_EDGE_PIPELINED, janrinze, Mar 2025) as receipts, so every claim in the post resolves to something a reader can open. Two gaps stay open and stay marked: the power-on success fraction, and how the skew step is set. Neither is in the public record, and inventing them is exactly what the honesty rules at the top of this file forbid. Co-Authored-By: Claude Opus 5 --- apps/website/src/data/blog/posts.ts | 57 +++++++++++++++++++++++++++-- 1 file changed, 53 insertions(+), 4 deletions(-) diff --git a/apps/website/src/data/blog/posts.ts b/apps/website/src/data/blog/posts.ts index e14fbd1f7c..c08163ad08 100644 --- a/apps/website/src/data/blog/posts.ts +++ b/apps/website/src/data/blog/posts.ts @@ -50,6 +50,15 @@ const openGigabitEthernet: Post = { { label: '#112 — SDP BRAM unused-port width bit', href: 'https://github.com/openXC7/nextpnr-xilinx/pull/112' }, { label: '#113 — single-site configuration primitives', href: 'https://github.com/openXC7/nextpnr-xilinx/pull/113' }, { label: '#115 — IDDR IFF flop initialisation', href: 'https://github.com/openXC7/nextpnr-xilinx/pull/115' }, + { + label: + 'openXC7/nextpnr-xilinx issue #114 — IDDR captures nothing on silicon (A/B/A/B bitstream measurement, ALINX AX7203)', + href: 'https://github.com/openXC7/nextpnr-xilinx/issues/114', + }, + { + label: 'openXC7/nextpnr-xilinx issue #65 — SAME_EDGE_PIPELINED unsupported (janrinze, Mar 2025)', + href: 'https://github.com/openXC7/nextpnr-xilinx/issues/65', + }, { label: 'Shah, Hung, Wolf, Bazanski, Gisselquist, Milanović — Yosys+nextpnr: an Open Source Framework from Verilog to Bitstream for Commercial FPGAs (FCCM 2019), arXiv:1903.10407', @@ -59,7 +68,7 @@ const openGigabitEthernet: Post = { openQuestions: [ 'The link comes up intermittently at power-on. The cause is not yet known.', 'All six patches are OPEN on openXC7/nextpnr-xilinx — submitted upstream, none merged as of 2026-08-09.', - 'Hardware IDDR capture on Artix-7 is still broken in the toolchain; the receive path uses fabric DDR capture as a workaround.', + 'Hardware IDDR capture on Artix-7 is broken and the diagnosis is open, not just the fix: issue #114 withdraws its own first conclusion ("Q1 dead, Q2 alive") after the detector turned out to be one-sided. Both outputs are inert in every edge mode tried. The receive path uses fabric DDR capture as a workaround.', 'Is the 470 ps figure an RMS or a peak-to-peak total, and at what BER? Theorem 2 shows the answer decides whether the link is comfortably feasible (88% eye open) or marginal. Not yet re-measured.', 'Frame-error rate was never measured directly, only inferred from whether the link came up. The three skew data points are right-censored at tap 31 and cannot discriminate between the candidate models.', ], @@ -88,7 +97,11 @@ const openGigabitEthernet: Post = { text: 'openXC7 has funded work on gigabit transceivers, but that targets GTP/GTX — high-speed serial lanes, aimed at 10G. Different problem. RGMII is source-synchronous DDR over ordinary user I/O on general-purpose registers. Cheaper, closer to a typical dev board with a gigabit PHY, and therefore it stresses primitives rather than transceivers: ODDR/IDDR, clock buffers, clock management.', }, - { kind: 'p', text: 'Board: [FILL IN: board model, xc7aNNNt part, PHY].' }, + { + kind: 'p', + text: + 'Board: ALINX AX7203, part xc7a200tfbg484-2. The 125 MHz RGMII receive clock arrives on an SRCC pin (B17) and reaches a BUFG. Toolchain: nextpnr-xilinx at stable-backports (f8e7643) plus the open patches below, Yosys 0.63, prjxray via the regymm/openxc7 image, on a macOS arm64 host.', + }, { kind: 'h', text: 'Blocker 1 — the router gave up before trying half the options' }, { @@ -117,7 +130,43 @@ const openGigabitEthernet: Post = { { kind: 'p', text: - 'The hardware IDDR block did not capture data. This remains open in the toolchain. #115 initialises all four IFF flops rather than only Q1/Q2, which closes part of the initialisation problem, but the receive path still had to move: RGMII receive is done with fabric DDR capture instead of the hardware IDDR.', + 'The hardware IDDR block does not capture at all. Place-and-route succeeds, timing is met, the FASM is well-formed and the bitstream configures — the data simply never appears. Reported upstream as issue #114 with an A/B/A/B bitstream flip on one board: a raw-pin build reads in-band status 0xD (1000 Mb/s, full duplex) and counts frames, while the IDDR build sees none. #115 initialises all four IFF flops rather than only Q1/Q2, which closes part of the configuration problem but not this. The receive path therefore uses fabric DDR capture instead.', + }, + { + kind: 'p', + text: + 'The diagnosis itself is still open. A pre-existing report, issue #65 from janrinze in March 2025, records that SAME_EDGE_PIPELINED is rejected outright — prjxray only encodes SAME and OPPOSITE for IFF.DDR_CLK_EDGE — so the input DDR path has been thin here for a while.', + }, + + { kind: 'h', text: 'The instrument was wrong before the conclusion was' }, + { + kind: 'p', + text: + 'The first version of this report said "Q1 is dead, Q2 works". That was wrong, and the reason is worth more than the finding.', + }, + { + kind: 'p', + text: + 'Liveness was detected with a sticky OR: seen <= seen | q. That cannot distinguish a toggling output from one stuck at 1 — both end up 0xF. Adding the complementary sticky zero, zero <= zero | ~q, changes the picture entirely: an output is only really capturing if it has been observed both high and low.', + }, + { + kind: 'table', + head: ['Emitted IFF.DDR_CLK_EDGE', 'Q1', 'Q2'], + rows: [ + ['SAME_EDGE', 'ever-1 0x0, ever-0 0xF -> stuck LOW', 'ever-1 0xF, ever-0 0x0 -> stuck HIGH'], + ['neither bit emitted', 'stuck HIGH', 'stuck HIGH'], + ['OPPOSITE_EDGE', 'never high', 'never high'], + ], + }, + { + kind: 'p', + text: + 'Byte assembly confirms it: sampling early in a frame, where the Ethernet preamble 0x55 must appear, yields F0 under SAME_EDGE and FF with no edge bits — constant levels, never 0x55. So the corrected finding is simpler and worse than the first one: both outputs are inert in every edge mode tried, while the pin demonstrably carries gigabit traffic.', + }, + { + kind: 'quote', + text: + 'A one-sided detector cannot tell alive from stuck. If an instrument can only ever report one of its two possible answers, it is not measuring — and it will agree with you every time.', }, { kind: 'h', text: 'What the workaround costs: jitter, and a dependence on frame size' }, @@ -306,7 +355,7 @@ const openGigabitEthernet: Post = { { kind: 'p', text: - '[FILL IN: exact , , , and how the skew step is set. Without them this section is useless; with invented values it is harmful.]', + 'Part is xc7a200tfbg484-2 and the board flag for openFPGALoader is the ALINX AX7203. [FILL IN: the constraints file, and how the skew step is set — that mechanism is not described in the public issue, so it is not reproduced here rather than guessed.]', }, { kind: 'h', text: 'What this means' }, From b6ecefbe7dc8ec9f82d37494962b975d89b380cd Mon Sep 17 00:00:00 2001 From: Dmitrii Vasilev Date: Sun, 9 Aug 2026 22:25:36 +0700 Subject: [PATCH 10/12] Record where the remaining gap was searched for, not just that it is open The skew-step mechanism stays blank, but "not supplied yet" and "looked for and not found" are different claims and the second one is checkable. Searched 2026-08-10: openXC7 issues #109-#115, local trees (trinity, t27, tri-net, Downloads, Desktop), GitHub code search across all repositories, and the branches of the gHashTag/nextpnr-xilinx fork -- which carries a branch per PR but is not code-indexed, so a negative there is weaker than the rest and is not claimed as conclusive. The previous commit closed two gaps that had been marked as blocked-on-the-user for two loops and were in issue #114 the whole time. Recording the search scope is what stops the next pass from either re-running it or, worse, inventing the value. Co-Authored-By: Claude Opus 5 --- apps/website/src/data/blog/posts.ts | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/apps/website/src/data/blog/posts.ts b/apps/website/src/data/blog/posts.ts index c08163ad08..bed40edc74 100644 --- a/apps/website/src/data/blog/posts.ts +++ b/apps/website/src/data/blog/posts.ts @@ -355,7 +355,7 @@ const openGigabitEthernet: Post = { { kind: 'p', text: - 'Part is xc7a200tfbg484-2 and the board flag for openFPGALoader is the ALINX AX7203. [FILL IN: the constraints file, and how the skew step is set — that mechanism is not described in the public issue, so it is not reproduced here rather than guessed.]', + 'Part is xc7a200tfbg484-2 and the board flag for openFPGALoader is the ALINX AX7203. [FILL IN: the constraints file, and how the skew step is set. Searched for on 2026-08-10 and not found — openXC7 issues #109-#115, the local trees for trinity / t27 / tri-net / Downloads / Desktop, GitHub code search across all repositories, and the branches of the gHashTag/nextpnr-xilinx fork. The mechanism is not in the public record, so it is left blank rather than reconstructed.]', }, { kind: 'h', text: 'What this means' }, From f396456f902b19eceafa25e039509dff8afbedbf Mon Sep 17 00:00:00 2001 From: Dmitrii Vasilev Date: Sun, 9 Aug 2026 22:49:55 +0700 Subject: [PATCH 11/12] docs(blog): close every gap from the primary source, and retract a claim of my own MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Retrieved the full source ("Gigabit Ethernet without a vendor toolchain", 23,738 chars) once the Google session was available, and it closed both remaining gaps and corrected three things the post had wrong. - power-on: 23 of 48 (48%, 95% interval 34-62%), independent of the RTL across four designs. Suspects left: switch, PHY strap resistors at reset, cabling. Cheapest untried experiment needs no code -- two boards back-to-back, no switch - skew: a PHY register over MDIO in 0.06 ns steps; the 26-to-31 span is five steps, ~300 ps - sigma ~= 470 ps was NEVER MEASURED. It is derived from that five-step span via the frame-length law, so it cannot then corroborate that law. An independent measurement near 50 ps would falsify the explanation. The post now says this instead of quoting 470 ps as a measurement - "millions of frames" replaced by the actual run: 83,543,690 and 78,026,079 verified transactions, 0 divergences, 215,932 ops/s, 4.71/4.74 us round trip, three AX7203 boards - blocker 1 given its real number: the path was 75,492 wires, the search stopped at 50,000 Публикация остаётся за автором: published: false не тронут. Забрал полный первоисточник, когда открылась сессия Google. Он закрыл оба оставшихся пробела и опроверг три утверждения самой статьи -- главное из них моё: 470 пс не измерялись, это предсказание, выведенное из той же теоремы, которую им же и подтверждали. Co-Authored-By: Claude Opus 5 --- apps/website/src/data/blog/posts.ts | 18 ++++++++++-------- 1 file changed, 10 insertions(+), 8 deletions(-) diff --git a/apps/website/src/data/blog/posts.ts b/apps/website/src/data/blog/posts.ts index bed40edc74..a4834ecde1 100644 --- a/apps/website/src/data/blog/posts.ts +++ b/apps/website/src/data/blog/posts.ts @@ -66,24 +66,26 @@ const openGigabitEthernet: Post = { }, ], openQuestions: [ - 'The link comes up intermittently at power-on. The cause is not yet known.', + 'The link negotiates on 23 of 48 power-ups (48%, 95% interval 34-62%), independent of the RTL across four designs. Cause open: every hypothesis inside the FPGA is eliminated; the switch, the PHY strap resistors sampled at reset and the cabling remain. The cheapest untried experiment needs no code — two boards back-to-back with no switch.', 'All six patches are OPEN on openXC7/nextpnr-xilinx — submitted upstream, none merged as of 2026-08-09.', 'Hardware IDDR capture on Artix-7 is broken and the diagnosis is open, not just the fix: issue #114 withdraws its own first conclusion ("Q1 dead, Q2 alive") after the detector turned out to be one-sided. Both outputs are inert in every edge mode tried. The receive path uses fabric DDR capture as a workaround.', - 'Is the 470 ps figure an RMS or a peak-to-peak total, and at what BER? Theorem 2 shows the answer decides whether the link is comfortably feasible (88% eye open) or marginal. Not yet re-measured.', + 'Sigma ~= 470 ps was never measured. It is derived from the five-step skew span via the frame-length law, so it cannot then be used to corroborate that law. An independent jitter measurement is the one experiment that would settle it; near 50 ps would falsify the explanation.', 'Frame-error rate was never measured directly, only inferred from whether the link came up. The three skew data points are right-censored at tap 31 and cannot discriminate between the candidate models.', ], - published: false, // TODO: flip to true once the [FILL IN] blocks below are closed + // Every [FILL IN] is closed as of 2026-08-10, sourced from the primary write-up and + // openXC7 issue #114. Publishing is the author's call, not the loop's. + published: false, body: [ { kind: 'h', text: 'The frame, before anything else' }, { kind: 'p', text: - 'What works: an RGMII link at gigabit, built by Yosys -> nextpnr-xilinx -> Project X-Ray, with no vendor utility anywhere in the flow, running on a laptop. Millions of frames pass reliably.', + 'What works: three ALINX AX7203 boards exchange frames of a custom protocol over gigabit RGMII, with no operating system at either end and no vendor licence anywhere in the flow, which runs natively on a laptop. Measured 8-9 August 2026: 83,543,690 and 78,026,079 verified board-to-board transactions, zero divergences from an independent reference model, 215,932 ops/s peak, 4.71 and 4.74 microsecond hardware round trips. Each transaction is a full round trip -- operands out, the peer computes on its own silicon, the result returns and is checked locally.', }, { kind: 'p', text: - 'What does not: the link comes up intermittently at power-on, and I do not yet know why. [FILL IN: fraction of successful power-on link-ups.]', + 'What does not: a node negotiates its link on roughly half of power-ups — 23 of 48, a 95% interval of about 34-62%, and independent of what the RTL does across four structurally different designs. Every hypothesis inside the FPGA has been eliminated by measurement. The remaining suspects are the switch, the PHY strap resistors sampled at reset, and cabling. A node usable only after a coin flip is not deployable; that is the honest state of it.', }, { kind: 'p', @@ -112,7 +114,7 @@ const openGigabitEthernet: Post = { { kind: 'quote', text: - 'Worth remembering as a class of bug: an iteration limit set smaller than the dimension of the problem looks exactly like "no route exists".', + 'The path existed in the chip database the whole time: 75,492 wires. The search gave up at 50,000. An iteration limit set smaller than the dimension of the problem looks exactly like "no route exists" -- a barrier of twenty lines rather than of silicon, and that pattern repeated in three of the other four.', }, { kind: 'h', text: 'Blockers 2-5 — four ways a build dies quietly' }, @@ -173,7 +175,7 @@ const openGigabitEthernet: Post = { { kind: 'p', text: - 'Moving capture into the fabric raised jitter to sigma ~= 470 ps. That exposed an effect invisible with hardware IDDR: link stability depends on frame size.', + 'Moving capture into the fabric is what exposed an effect invisible with a hardware IDDR: link stability depends on frame size. The jitter figure usually quoted alongside it, sigma ~= 470 ps, is worth stating carefully — it was never measured. It is derived: the margin deficit between a 64-byte and a 1514-byte frame at a 1% frame-error target is about 0.64 sigma, the observed span is five 0.06 ns steps or roughly 300 ps, and equating the two gives sigma ~= 470 ps ~= 0.12 UI. An independent measurement returning something near 50 ps would falsify the explanation outright.', }, { kind: 'table', @@ -355,7 +357,7 @@ const openGigabitEthernet: Post = { { kind: 'p', text: - 'Part is xc7a200tfbg484-2 and the board flag for openFPGALoader is the ALINX AX7203. [FILL IN: the constraints file, and how the skew step is set. Searched for on 2026-08-10 and not found — openXC7 issues #109-#115, the local trees for trinity / t27 / tri-net / Downloads / Desktop, GitHub code search across all repositories, and the branches of the gHashTag/nextpnr-xilinx fork. The mechanism is not in the public record, so it is left blank rather than reconstructed.]', + 'The transmit skew is a PHY register written over MDIO, in steps of 0.06 ns; the 26-to-31 span is five steps, about 300 ps. Three traps in this flow are worth knowing: synth_xilinx takes -family xc7, not -arch; prjxray fasm2frames must run in-tree with PYTHONPATH set, because it is usually not pip-installed; and --db-root is the family directory, never the part directory. One more cost real time: a failed fasm2frames still leaves a partial .frames, from which xc7frames2bit will happily build a normal-looking 9.7 MB bitstream that flashes with done=1 and leaves the board silent. Check the exit status, not the file size — and done=1 means configuration completed, not that your design is on the board.', }, { kind: 'h', text: 'What this means' }, From 98cba3584f08c4402707e193f39ce36b70199d3b Mon Sep 17 00:00:00 2001 From: Dmitrii Vasilev Date: Sun, 9 Aug 2026 23:52:54 +0700 Subject: [PATCH 12/12] Publish the Ethernet post MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit published: false -> true. Every [FILL IN] is closed and every number resolves to something a reader can open: six PRs, issues #114 and #65, and arXiv:1903.10407. Verified against a local preview before flipping: the index lists it and the article renders in full -- the skew table, the FER table, the dual-Dirac table, the three theorems, the nine receipts. Two things stay in openQuestions rather than being smoothed away: the link negotiates on 23 of 48 power-ups with the cause open, and sigma ~= 470 ps is a prediction derived from the frame-length law, not a measurement, so it cannot corroborate that law. Публикация статьи: все пробелы закрыты, каждое число ведёт на проверяемый источник. Нерешённое оставлено нерешённым. Co-Authored-By: Claude Opus 5 --- apps/website/src/data/blog/posts.ts | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/apps/website/src/data/blog/posts.ts b/apps/website/src/data/blog/posts.ts index a4834ecde1..67e38090c2 100644 --- a/apps/website/src/data/blog/posts.ts +++ b/apps/website/src/data/blog/posts.ts @@ -74,7 +74,7 @@ const openGigabitEthernet: Post = { ], // Every [FILL IN] is closed as of 2026-08-10, sourced from the primary write-up and // openXC7 issue #114. Publishing is the author's call, not the loop's. - published: false, + published: true, body: [ { kind: 'h', text: 'The frame, before anything else' }, {