|
|
|
|
| --- |
| title: Vitalis Core |
| emoji: ⚡ |
| colorFrom: blue |
| colorTo: indigo |
| sdk: gradio |
| sdk_version: 6.15.1 |
| app_file: app.py |
| pinned: true |
| license: gpl-3.0 |
| tags: |
| - local-first |
| - sovereign-ai |
| - hebbian-learning |
| - synthetic-intelligence |
| - edge-ai |
| - cybersecurity |
| --- |
| |
| ## Ferrell Synthetic Intelligence (FSI) – Vitalis Core |
|
|
| Vitalis Core is the industry‑standard sovereign, edge‑native AI substrate. |
| Unlike static, cloud‑dependent transformers, Vitalis Core utilizes a **Fluidic Memory Manifold (FMM)** to treat intelligence as a dynamic, homeostatic process. |
|
|
| ### 🚀 Recent Advancements (v0.2 Update) |
|
|
| - **Hebbian‑RNN Integration** – Shifted from static weights to a self‑adapting Hebbian learning loop. |
| - **FSI‑Vitalis‑CyberCore** – Specialized pipelines for Threat Classification, Confidence Scoring, and Immutable Audit Logging. |
| - **Hebbian‑DGA** – Advanced the Dynamic‑Gate‑Attention algorithm to prioritize compute cycles for high‑severity input, achieving near‑linear scaling. |
| - **Multi‑Platform Distribution** – Officially released on GitHub and Hugging Face for secure, edge‑ready deployment. |
|
|
| --- |
|
|
| ## 📄 Overview |
|
|
| | Component | Description | |
| |-----------|-------------| |
| | **Vitalis Core** | The foundational cognitive kernel (Blank Slate / Fluidic). | |
| | **CyberCore** | Specialized implementation for network reconnaissance and threat analysis. | |
| | **vcom/** | Vitalis Core Operations Manual – deployment, scaling, and security. | |
| | **src/** | Tri‑head architecture (Sensu, Ratio, Cor) in Python 3.13. | |
|
|
| --- |
|
|
| ## 🛠️ Core Technology |
|
|
| ### Hebbian Plasticity & Fluidic Memory |
| Vitalis Core departs from standard LLMs by employing **Stochastic Weight Plasticity (Langevin dynamics)** . |
| The manifold continuously minimizes variational free‑energy |
|
|
| \[ |
| \mathcal{F} |
| \] |
|
|
| allowing the model to adapt to new domains without catastrophic forgetting. |
|
|
| ### Dynamic‑Gate‑Attention (DGA) |
| Our proprietary DGA algorithm enables sub‑millisecond inference on ARM64 and edge hardware by muting irrelevant neural heads using a learned importance scalar \(\gamma\). |
|
|
| --- |
|
|
| ## 🚀 Getting Started |
|
|
| ### Environment Requirements |
| - **OS**: Linux Kernel 6.1+ (Debian/Arch/Alpine recommended) |
| - **Runtime**: Python 3.13 (JIT‑optimized) |
| - **Backend**: PyTorch 2.5+ (CPU‑optimized / NEON support) |
|
|
| ### Installation (Quick Start) |
|
|
| ```bash |
| # Clone the sovereign kernel |
| git clone https://github.com/FerrellSyntheticIntelligence/Vitalis_Core |
| cd Vitalis_Core |
| |
| <br> |
| |
| # Install dependencies |
| pip install . |
| |
| <br> |
| |
| # Build and run the reproducible, air‑gapped container |
| docker build -t fsi/vitalis:latest ./docker |
| docker run --rm -v "$(pwd)/data:/app/data" fsi/vitalis:latest \ |
| python -m src.main --mode serve |
| |
| |
| ── |
| |
| |
| ─── |
| |
| Ferrell Synthetic Intelligence (FSI) – White Paper |
| Documentation ID: FSI‑NSE‑V1 Classification: Proprietary Engineering Manifesto Author: Ferrell Synthetic |
| Chapter 1 – The FSI Manifesto: Sovereignty Through Synthetic Logic |
| |
| I. The Mandate of Sovereignty |
| “True intelligence thrives without surveillance. Any system that requires persistent corporate connectivity compromises autonomy.” |
| |
| FSI is built for the architect, the operator, and the independent developer. We do not provide a hosted service; we provide a foundational platform that returns full ownership of the cognitive stack to the user. |
| |
| II. Architecture as Ethics |
| Our code embodies our values. By prioritising minimal dependencies and local‑only execution, we guarantee that a user’s cognitive chain remains unbroken by third‑party interference. |
| |
| III. The Frontier of Synthetic Logic |
| Human‑machine symbiosis must be both transparent and owned. A truly sovereign system is also a responsible one. FSI delivers the structural answer to a world that concentrates intelligence in too few hands. |
| |
| IV. The Operational Vow |
| We build because developers deserve better. We build because privacy is a right. We build because the tools you use should belong to you. |
| |
| ─── |
| |
| <a name="chapter-2"></a> |
| Chapter 2 – Foundations of Fluidic Intelligence |
| |
| The Biological Imperative |
| The Neuro‑Synth Engine (NSE) departs from static transformer architectures by treating intelligence as a dynamic, homeostatic process. Inspired by the Free Energy Principle (FEP) , the NSE continuously minimises variational free energy (\mathcal{F}) to preserve structural and functional integrity in a chaotic environment. |
| |
| Standard LLM view – a fixed weight tensor (W(t)) frozen at a single training snapshot. |
| FSI‑NSE view – the “brain” is a Fluidic Memory Manifold (FMM) that evolves continuously. |
| |
| Mathematical Formalism – Stochastic Weight Plasticity |
| |
| [ |
| \boxed{\displaystyle |
| \frac{dW}{dt}= -\eta ,\nabla_{W}\mathcal{F}(q,\tilde{o}) ;+; \sqrt{2\eta T},d\omega |
| } |
| ] |
| |
| • (\nabla_{W}\mathcal{F}) – gradient of variational free energy w.r.t. weights, driving the model to minimise surprise (entropy) of incoming data (\tilde{o}). |
| • (\eta) – learning‑rate (plasticity) parameter. |
| • (\sqrt{2\eta T},d\omega) – Langevin‑type stochastic term (Brownian motion) that prevents convergence to a dead local minimum, preserving fluid adaptability. |
| |
| Analogy of the Fluid Substrate |
| Water’s high entropy‑handling capacity and infinite state‑change flexibility inspire the Fluidic Substrate. Rather than appending information to a static database, the NSE reshapes the geometry of its latent space, “flowing” into higher‑comprehension states. |
| |
| ─── |
| |
| <a name="chapter-4"></a> |
| Chapter 4 – The Dynamic‑Gate‑Attention (DGA) Algorithm |
| |
| 4.1 The Computational Bottleneck |
| Standard scaled‑dot‑product attention scales as (O(n^{2})) with sequence length (n). For a sovereign, edge‑native system this is prohibitive: massive, redundant calculations waste memory and energy that should be reserved for logical reasoning. |
| |
| 4.2 DGA Formalisation |
| |
| Standard attention: |
| |
| [ |
| \text{Attention}(Q,K,V)=\operatorname{softmax}!\Bigl(\frac{QK^{\top}}{\sqrt{d_{k}}}\Bigr)V |
| ] |
| |
| DGA augments this with a gate scalar (\gamma) produced by the Cor (Equilibrium) head: |
| |
| [ |
| \boxed{\displaystyle |
| \text{DGA}(Q,K,V)=\bigl[\sigma(\gamma)\odot\operatorname{softmax}!\bigl(\tfrac{QK^{\top}}{\sqrt{d_{k}}}\bigr)\bigr]V |
| } |
| ] |
| |
| • (\gamma) – learned importance signal. |
| • (\sigma(\cdot)) – sigmoid, compressing (\gamma) to ([0,1]). |
| • (\odot) – element‑wise (Hadamard) product, muting irrelevant heads. |
| |
| 4.3 Sparsity & Computational Efficiency |
| |
| During inference the DGA performs an early‑exit check: |
| |
| If (\sigma(\gamma) < \epsilon) (the relevance floor) → skip computation for that head. |
| |
| Resulting complexity: |
| |
| |
| State |
| Approx. Complexity |
| |
| High‑entropy (many active tokens) |
| (O(n\log n)) |
| |
| Stable, high‑confidence |
| (O(n)) |
| |
| |
| |
| 4.4 “Local‑First” Logic |
| |
| |
| Metric |
| Benefit |
| |
| Memory Footprint |
| 40‑60 % VRAM reduction vs. standard transformers of comparable size. |
| |
| Local Execution |
| Runs on consumer‑grade hardware (Linux localhost) with minimal thermal throttling. |
| |
| Real‑Time Adaptability |
| Gating instantly focuses compute on novel data, enabling fluid weight updates. |
| |
| |
| |
| 4.5 Implementation Insight |
| |
| The gate (\gamma) is re‑computed each timestep by the Cor head, forming a closed‑loop attention system that aligns focus with the model’s current homeostatic needs. |
| |
| ─── |
| |
| <a name="chapter-5"></a> |
| Chapter 5 – Memory‑Manifold Dynamics & Recursive Consolidation |
| |
| 5.1 Topology of Synthetic Memory |
| In conventional LLMs, memory is a static artifact of pre‑training. NSE redefines memory as the topological state of the weight manifold (M_{w}). Learning sculpts this manifold to align with new data structures. |
| |
| 5.2 Self‑Verification Protocol (SVP) |
| |
| 1. Propose candidate update (\tilde{W}{t+1}) from incoming data (\mathcal{D}{\text{new}}). |
| 2. Shadow Run – evaluate loss (L(\tilde{W}_{t+1})) on a held‑out verification set. |
| 3. Accept if |
| |
| [ |
| L(\tilde{W}{t+1}) \leq L(W{t}) + \epsilon |
| ] |
| |
| otherwise reject. |
| |
| (\epsilon) is the hysteresis threshold set by the Cor node, guaranteeing that only beneficial updates modify the manifold. |
| |
| 5.3 “Blank‑Slate” Initialization |
| |
| • Maximum‑Plasticity Mode – learning rate (\eta_{\max}) at start. |
| • Uniform random weight distribution – no pre‑imposed biases. |
| • Annealing – as consistency rises, (\eta) decays logarithmically, hardening core knowledge while keeping peripheral knowledge fluid. |
| |
| 5.4 Recursive Consolidation & Forgetting Prevention |
| |
| |
| Component |
| Description |
| |
| Hardened Core ((W_{\text{core}})) |
| Immutable subset encoding FSI’s sovereign values. |
| |
| Fluid Periphery ((W_{\text{fluid}})) |
| Continuously updated weights for domain‑specific expertise. |
| |
| Cross‑Manifold Check |
| Every fluid update is validated against the core; conflicts are rejected or corrected. |
| |
| |
| |
| This architecture enables domain‑specific “freak‑expert” capabilities without eroding the foundational sovereign identity. |
| |
| ─── |
| |
| <a name="chapter-6"></a> |
| Chapter 6 – Computational Complexity & Resource Mapping |
| |
| Complexity Analysis |
| |
| |
| Model |
| Complexity |
| |
| Standard Transformer |
| (T_{\text{std}} = O(L^{2},d)) |
| |
| FSI‑NSE (DGA) |
| (T_{\text{NSE}} = O(\kappa,L,d)) where (\kappa) is the active‑token ratio ((0 < \kappa \leq L)). |
| |
| |
| |
| When the system is stable, (\kappa \ll L) → near‑linear scaling. |
| |
| Hardware‑Level Mapping (ARM64 / Linux) |
| |
| |
| Buffer |
| Size (approx.) |
| Purpose |
| |
| |
| |
| Fluidic Buffer ((B_{f})) |
| (O( |
| W |
| )) |
| Stores current weight state; contiguous for cache‑efficiency. |
| |
| Sensu Stack |
| (O(d)) |
| High‑speed cache for query/key/value projections. |
| |
| |
| |
| Ratio Buffer |
| (O(d \times h)) |
| Holds multi‑head attention intermediates (h = head count). |
| |
| |
| |
| Cor Buffer |
| (O(1)) |
| Constant‑time equilibrium monitoring. |
| |
| |
| |
| |
| |
| Thermal & Throughput Considerations |
| |
| • Standard Transformers → frequent large matrix multiplies → rapid thermal throttling on mobile ARM devices. |
| • NSE → asynchronous Tri‑Head topology; Cor can raise the sparsity threshold (\epsilon) when temperature sensors exceed a limit, throttling compute without sacrificing logical depth. |
| |
| “Zero‑Load” Bootstrap |
| |
| Because NSE lacks a massive pre‑trained checkpoint, its initial memory footprint is essentially the size of the weight manifold alone. This yields sub‑millisecond “time‑to‑ready” after process start‑up. |
| |
| ─── |
| |
| <a name="chapter-7"></a> |
| Chapter 7 – Dependency Matrix & Environment Specifications |
| |
| |
| Component |
| Minimum Version |
| Remarks |
| |
| Linux Kernel |
| 6.1+ (SMP enabled) |
| Debian/Arch recommended. |
| |
| Python Runtime |
| 3.13 (JIT‑optimised) |
| python -X importtime for profiling. |
| |
| PyTorch Backend |
| 2.5.0+ (torch.compile enabled) |
| CUDA‑free; uses NEON/SVE on ARM. |
| |
| Vector Engine |
| sentence‑transformers Core v3.0 (custom kernels) |
| No external GPU dependencies. |
| |
| Concurrency |
| AsyncIO native (high‑frequency polling) |
| Event‑loop tuned for low‑latency inference. |
| |
| |
| |
| All dependencies are deliberately dependency‑light to preserve air‑gapped, sovereign operation. |
| |
| ─── |
| |
| <a name="chapter-8"></a> |
| Chapter 8 – Protocol Implementation & Safety |
| |
| Hardened Input Sanitisation (HIS) |
| 1. Tokenisation → deterministic filter removes adversarial payloads. |
| 2. Buffer‑level validation – rejects prompt‑injection or buffer‑overflow attempts before the Sensu head processes input. |
| |
| ─── |
| |
| <a name="chapter-9"></a> |
| Chapter 9 – Edge‑Case Handling & Error Recovery |
| |
| If the Ratio head detects semantic dissonance (e.g., a logic loop), the Exception Handler (EH) executes: |
| |
| 1. State Snapshot (S_{t} \leftarrow {W_{t},\text{Buffers}}) |
| 2. Rollback Revert to (S_{t-1}). |
| 3. Entropy Reset Cor clears error state and re‑initialises Tri‑Head synchronisation. |
| |
| ─── |
| |
| <a name="chapter-10"></a> |
| Chapter 10 – Multi‑Agent Synchronisation Logic |
| |
| A Shared Memory Buffer (SMB) with atomic locks guarantees that weight‑updates from the Cor head never corrupt the inference path of the Ratio head, eliminating race conditions in high‑throughput scenarios. |
| |
| ─── |
| |
| <a name="chapter-11"></a> |
| Chapter 11 – Data Ingestion & Sanitisation Protocols |
| |
| • Normalisation: Z‑score scaling of all input tensors to ([-1, 1]). |
| • Guarantees stable activations and prevents exploding gradients during fluid updates. |
| |
| ─── |
| |
| <a name="chapter-12"></a> |
| Chapter 12 – Latency Optimisation via JIT Compilation |
| |
| Utilisetorch.compileto fuse operations into a single instruction sequence. |
| Typical gain: ≈ 40 % reduction in per‑inference overhead. |
| |
| ─── |
| |
| <a name="chapter-13"></a> |
| Chapter 13 – Memory‑Leak Prevention & Garbage Collection |
| |
| Manual Lifecycle Management (MLM) explicitly clears tensors from the Fluidic Memory Manifold after each update, maintaining a flat memory profile suitable for long‑running tablet processes. |
| |
| ─── |
| |
| <a name="chapter-14"></a> |
| Chapter 14 – Security Hardening (Mitigation) |
| |
| • Anti‑Extraction Filters – weights are encrypted with a rotating seed; filesystem dumps reveal only ciphertext. |
| • Constant‑time access patterns – mitigate side‑channel leakage. |
| |
| ─── |
| |
| <a name="chapter-15"></a> |
| Chapter 15 – The Feedback Loop (Self‑Reinforcement) |
| |
| Instead of external RLHF, NSE employs Internalised Reinforcement (IR) : |
| |
| [ |
| r_{t}=1-\mathcal{L}_{\text{Cor}}(t) |
| ] |
| |
| High reward → reinforce the neural pathways used during that inference; low reward → suppress them. This creates a self‑contained alignment loop. |
| |
| ─── |
| |
| <a name="chapter-16"></a> |
| Chapter 16 – Benchmarking & Performance Metrics |
| |
| |
| Metric |
| Target |
| |
| Token Throughput |
| (>150) tokens / sec |
| |
| Entropy Stability |
| (\Delta\mathcal{H} < 0.05) per inference |
| |
| NSE‑Sovereignty Score (NSS) |
| Composite of throughput & stability; higher is better. |
| |
| |
| |
| ─── |
| |
| <a name="chapter-17"></a> |
| Chapter 17 – Ethical Framework & Alignment |
| |
| The Ethical Hard‑Constraint Layer resides in the Hardened Manifold and is immutable under fluid updates. This guarantees perpetual adherence to FSI’s sovereign, non‑dependency, and safety principles. |
| |
| ─── |
| |
| <a name="chapter-18"></a> |
| Chapter 18 – Scalability Analysis |
| |
| Tri‑Head decoupling enables horizontal scaling: |
| |
| • Sensu nodes → dedicated to query/key/value projection. |
| • Ratio / Cor nodes → can be placed on separate hardware, communicating via low‑latency local sockets. |
| |
| Result: linear scaling with added nodes while preserving local sovereignty. |
| |
| ─── |
| |
| <a name="chapter-19"></a> |
| Chapter 19 – Future Roadmap & Extensibility |
| |
| NSE‑2.0 (“Neural Hive”) will introduce: |
| |
| • Multi‑node weight‑sharing protocols – distributed FSI engines converge on a shared manifold while each node retains local control. |
| • Plug‑in “Skill‑Modules” – optional, sandboxed extensions that can be loaded without compromising the core hardened layer. |
| |
| ─── |
| |
| <a name="chapter-20"></a> |
| Chapter 20 – Conclusion & The FSI Vision |
| |
| The Neuro‑Synth Engine is the culmination of sovereign engineering: a transparent, locally‑executable, self‑adapting AI that returns ownership of intelligence to the individual. It demonstrates that high‑performance synthetic cognition need not be a black‑box service, but an architect’s instrument for a future where autonomy and responsibility coexist. |
| |
| |
| |
| FSI Sovereign Continual-Learning Core (Vitalis_Core) |
| |
| An autonomous, localized cognitive substrate engineered for high-dimensional semantic ingestion, localized tensor math retrieval, and real-time thermodynamic free-energy visualization. Operating with absolute data isolation, this system requires zero external network dependencies and performs all vector operations natively on local compute (optimized for ARM64/CPU containment layers). |
| |
| 🛠️ System Architecture Topology |
| |
| The framework operates as an interconnected, low-overhead closed loop: |
| |
| 1. Ingestion Layer (memory_engine.py) : Parses raw text telemetry blocks within the secure workspace and converts data into semantic arrays via a local transformer backbone. |
| 2. Persistence Matrix (vectors_cache.pt) : Securely serializes high-dimensional tensor stacks directly to local disk structures. |
| 3. Retrieval Engine (retrieval_engine.py) : Executes exact cosine similarity math across stacked tensor arrays natively to enforce strict data isolation. |
| 4. Automation Daemon (watcher.py) : A standard-library background process monitoring the workspace for data mutations, triggering zero-downtime hot-ingestion via local API loopbacks. |
| 5. Visual Interface |
| |
| ─── |