Inspiration

As distributed artificial intelligence and federated learning scale toward millions of nodes, the traditional reliance on centralized trust models, brittle orchestration servers, and unverified gradient aggregations becomes a critical vulnerability. Most distributed frameworks sacrifice cryptographic rigor and mathematical provability for developer convenience, leaving systems wide open to Byzantine manipulation, side-channel attacks, and quantum obsolescence.

Sovereign-Mohawk-Proto was inspired by a singular question: Can we build a federated learning runtime that achieves Flower-level developer friendliness while anchoring its security in machine-checked formal proofs, post-quantum cryptography, and rigorous Byzantine fault tolerance?


What It Does

Sovereign-Mohawk-Proto is a theorem-guided federated learning and cryptographic coordination runtime designed to eliminate trust bottlenecks in distributed systems. Key capabilities include:

  • 2026 Post-Quantum Cryptographic Overhaul: Enforces the $x25519-mlkem768-hybrid$ key exchange protocol, XMSS TPM-backed identity attestation, and epoch-based quantum-resistant ledger migration with dual-signature transport payloads (legacy_* + pqc_*).
  • Machine-Checked Formal Verification: Features formal verification modules in Lean 4 (proofs/LeanFormalization/), establishing rigorous mathematical guarantees for consensus, BFT resilience (such as the 5/9 honesty composition model in Theorem1BFT.lean), and cryptographic properties backed by a formal traceability matrix.
  • High-Performance Decentralized Aggregation: Combines multi-path spraying ($MRC$) transport adapters, non-blocking chunk reassembly for streaming gradients, and Multi-Krum Byzantine filtering.
  • Low-Level Attack Surface Minimization: Built heavily in Go and Rust (utilizing crates published on crates.io like ghost-link, smp-pqc-testkit, and smp-zk-proofs), featuring fail-closed verifier boot paths and side-channel resilience.

How We Built It

The architecture spans multiple low-level and high-level layers to balance absolute cryptographic safety with practical developer ergonomics:

  • The Core Go Runtime (internal/): Built using Go, handling libp2p gradient transport, streaming gradient ingestion chunks, multi-tier regional-to-global gRPC aggregation hierarchies (internal/federation), and persistent utility-coin ledger audit chaining.
  • Formal Proof Infrastructure (proofs/): Developed a comprehensive theorem suite in Lean 4, establishing formal linkages between theoretical claims and execution traces. This includes experimental low-level model abstractions like the Ed25519-style verifier model (RFC 8032) targeting UF-CMA security properties (proofs/LeanFormalization/Ed25519.lean).
  • Python SDK v2 (sdk/python/): Designed a clean developer interface wrapping the core runtime, supporting Flower-integrated workflows (examples/flower_integrated/quickstart_pytorch.py), hybrid SNARK/STARK proof verification policies, gradient compression, and decentralized utility ledger operations.
  • Containerized Genesis Testnet (docker-compose.yml, scripts/): Orchestrated a multi-node production simulation stack featuring orchestrators, shard nodes, node agents, Prometheus, Grafana, and TPM metrics exporters.

Challenges We Faced

  • Bridging Formal Proofs with High-Throughput Distributed Systems: Ensuring that machine-checked Lean 4 theorems could meaningfully map to concurrent, asynchronous Go and Rust microservices without introducing crippling latency overhead. We resolved this by establishing strict verification build gates (.github/workflows/full-validation-pr-gate.yml) and fail-closed boot paths.
  • Balancing PQC Cutover with Operational Continuity: Implementing quantum-ready hybrid key exchange ($x25519-mlkem768-hybrid$) required careful management of dual-signature migration payloads to prevent breaking legacy transport pipes before the hard epoch transition.

What We Learned

We proved that mathematical rigor and high-scale operational readiness are not mutually exclusive. By combining formal verification, hardware-bound TPM attestation, and decentralized federated aggregation into a single cohesive runtime, we created an architecture that doesn't just execute code—it mathematically proves its integrity at every step from the edge node to global finality.

Built With

Share this project:

Updates

posted an update —

Experimental Ed25519-Style Verifier & UF-CMA Formalization Upgrade (#227)

Just pushed a major verification milestone to the Sovereign-Mohawk-Proto repository, transitioning our formal models from a temporary placeholder to a genuine, experimental Ed25519-style verifier implemented natively in Lean 4.

Key Highlights:

  • New Formalization Modules (Ed25519.lean & SHA512.lean): Introduced a complete experimental verifier model featuring prime field arithmetic ($p = 2^{255}-19$), twisted-Edwards point addition/doubling, an RFC 6234 SHA-512 implementation dependency, and full signature verification logic.
  • Theorem Wiring & Cleanup: Updated TheoremUF_CMA_Ed25519.lean to purge the insecure sig = msg placeholder and placeholder_is_forgeable theorem. Ed25519ToPQC now properly delegates to ed25519Verify.
  • Test Vector Validation: Successfully validated against the RFC 8032 empty-message test vector (valid signatures return true, while tampered messages return false). UF-CMA security remains cleanly conditional on an explicit discrete-log hardness hypothesis (h_secure).
  • Build & Quality Gates: All Lean formalization, specification, and refinement builds pass successfully, along with automated proof linting scripts.

⚠️ **Honest Experimental Scoping:* Message encoding is currently restricted (empty message or 32-bit LE encoded), scalar multiplication assumes a 256-bit scalar bound, and the group law/decoding components are unaudited for production deployments.*

Log in or sign up for Devpost to join the conversation.

Submission history