RESEARCH WING OF ORBIT · NON-PROFIT

Research in
Distributed
Systems.

The non-profit research arm of Orbit — advancing distributed consensus, autonomous intelligence, and verifiable computing runtimes.

18
Publications
24
Open Repositories

Core Research Programs · Georbit Institute

Foundational Computer Science

Pure computational and mathematical inquiry engineered to power the next generation of resilient systems.

[CS-AI]

Autonomous Intelligence & Sparse Neural Architectures

Sub-5ms inference at scale

Investigating memory-efficient transformer reasoning, mixture-of-experts routing, and verifiable neural inference engines operating on edge and distributed hardware.

Formalisms →
[CS-SYS]

Distributed Systems & Consensus Mechanics

240ms p99 finality bound

Engineering next-generation asynchronous Byzantine Fault-Tolerant (BFT) protocols, leaderless DAG consensus, and low-latency global state synchronisation engines.

Formalisms →
[CS-LANG]

Deterministic Runtimes & Compiler Architecture

Formal correctness proofs

Designing formally verified execution sandboxes, WebAssembly/eBPF JIT compilers, and memory-safe language semantics with zero runtime overhead.

Formalisms →
[CS-CRYPTO]

Zero-Knowledge Cryptography & Verifiable Compute

10x prover speedup

Constructing ultra-fast zk-SNARK proof systems, recursive polynomial commitments, and trust-minimized verifiable computation pipelines.

Formalisms →

Live System Simulation

Computational Execution Engine

Visualizing asynchronous DAG block finality, sparse neural mixture-of-experts routing, and JIT compilers.

3D ARCHITECTURE RUNTIME SIMULATION[GPU WEBGL · ACTIVE]
[ Drag to Rotate · Hover for Invariants ]
THROUGHPUT
142,000 tx/s
COMMIT LATENCY
240 ms (99.9%)
FAULT TOLERANCE
f < n/3 Byzantine
VERIFICATION
Formally Verified Coq

Selected Preprints & Papers

Recent Publications

Peer-reviewed contributions authored by Georbit researchers across distributed systems, autonomous agents, and compiler theory.

Symposium on Operating Systems Principles (Preprint / ArXiv CS.DC) ·

Deterministic State-Machine Replication and Sub-Millisecond Finality Over High-Throughput Asynchronous Networks

Regmi, M., Saifi, A., Chen, W. · Georbit (Orbit Research)

We present a leaderless Directed Acyclic Graph (DAG) consensus protocol that decouples transaction dissemination from execution ordering. Evaluated on a global 120-node commodity testbed, our system sustains 142,000 deterministic transactions per second with 99.9th percentile commit latency under 240 milliseconds.

Conference on Machine Learning and Systems (MLSys 2025 Preprint) ·

Dynamic Sparse Routing and Memory-Bounded Execution for Large Mixture-of-Experts Neural Runtimes

Saifi, A., Regmi, M. · Georbit (Orbit Research)

Dense transformer activation patterns incur severe memory bandwidth bottlenecks during multi-turn agent reasoning. We introduce a hardware-aware sparse kernel compiler that computes dynamic expert assignment in constant memory, achieving a 3.4x speedup in token generation throughput across heterogenous GPU-CPU clusters.

ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI 2024) ·

Mechanized Safety Proofs and Sandboxed Memory Invariants for WebAssembly JIT Execution Engines

Regmi, M., Vance, D. · Georbit (Orbit Research)

Memory-safety vulnerabilities in modern JIT execution environments often escape traditional fuzzing harnesses. Using the Coq proof assistant, we construct a fully mechanized operational semantics for an optimizing WebAssembly runtime with machine-checked non-interference guarantees.

Explore Full Publication Archive & BibTeX →

Active Systems · Core Infrastructure

Empirical Benchmarks & Verification Invariants

Measurable computational throughput, formally proven invariants, and unrestricted open-access source distributions.

CORE SYSTEMS REPOSITORIES & VERIFICATION SUITESAPACHE 2.0 / MIT OPEN SPECIFICATION
System ModuleArchitecture & ScopeImplementationThroughput / LatencyFormal InvariantDistribution
ORBIT-VMDeterministic RuntimeRust / WebAssembly JIT< 0.04 ms dispatchLinear Memory IsolationActive
AETHER-BFTLeaderless DAG ConsensusC++20 / Asynchronous I/O240 ms finality (p99)Asynchronous Safety BoundActive
EIGEN-KERNELSparse Neural ReasoningCUDA / PyTorch JIT3.2 ms / tokenNumerical Precision ParityActive
VERI-PROVERFormal Coq VerificationOCaml / Coq Proof EngineZero False PositivesConstructive Type SafetyActive

Rigor & Standards

The Georbit Systems Research Lifecycle

From mathematical complexity analysis to zero-overhead production codebases.

PHASE 01Algorithmic Inception
Formulating theoretical models, complexity bounds, and mathematical proofs for novel computational paradigms.
PHASE 02Prototype Synthesis
Implementing low-level reference systems in Rust, C++, and CUDA to measure real-world performance ceilings.
PHASE 03Rigorous Benchmarking
Subjecting implementations to adversarially simulated partitions, race condition fuzzing, and formal verification tools.
PHASE 04Open-Source Dissemination
Releasing full source code, peer-reviewed preprints, and reproducible benchmarks for the global developer and research community.

Academic · Fellowship

Collaborate with Georbit

We sponsor university fellowships, co-author peer-reviewed manuscripts with computer science faculties, and license all resulting runtime implementations under permissive open-source terms.