Computer Science Bibliography · Open Access

Publications, Preprints & Technical Reports

Permanent scientific literature deposited under open-access covenants. All publications are paired with verifiable computational notebooks, reference implementations, and reproducible benchmarks.

DOI REPOSITORY:10.5281/zenodo.georbit·ARXIV / ZENODO ARCHIVES

distributed_systemsSymposium on Operating Systems Principles (Preprint / ArXiv CS.DC)[PREPRINT / OPEN REPORT]

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.

#DAG Consensus#BFT Protocol#Distributed Systems#State Replication

View BibTeX Citation Data

@article{regmi2025deterministic,
  title={Deterministic State-Machine Replication},
  author={Regmi, Matrika and Saifi, Ayaan and Chen, Wei},
  year={2025}
}

DOI: 10.5281/zenodo.georbit.91024

autonomous_intelligenceConference on Machine Learning and Systems (MLSys 2025 Preprint)[PREPRINT / OPEN REPORT]

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.

#Neural Runtimes#Mixture of Experts#GPU Kernels#Compiler Optimization

View BibTeX Citation Data

@article{saifi2024sparse,
  title={Dynamic Sparse Routing and Memory-Bounded Execution},
  author={Saifi, Ayaan and Regmi, Matrika},
  year={2024}
}

DOI: 10.5281/zenodo.georbit.82019

formal_methodsACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI 2024)[PREPRINT / OPEN REPORT]

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.

#Formal Verification#WebAssembly#Coq Proofs#Memory Safety

View BibTeX Citation Data

@article{regmi2024formal,
  title={Mechanized Safety Proofs for WebAssembly JIT Engines},
  author={Regmi, Matrika and Vance, D.},
  year={2024}
}

DOI: 10.5281/zenodo.georbit.71402

applied_cryptographyGeorbit Technical Reports · CS-TR-2024-04[PREPRINT / OPEN REPORT]

Sub-Second Recursive Polynomial Proofs for Verifiable Cloud Compute Workloads

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

We report on the engineering of a folding-scheme zero-knowledge prover capable of verifying 100,000 computation cycles per second on standard multi-core processors. The protocol eliminates trusted setup ceremonies and compresses distributed verification overhead down to 48 bytes per proof batch.

#Zero-Knowledge#zk-SNARKs#Verifiable Compute#Cryptography

View BibTeX Citation Data

@techreport{saifi2024recursive,
  title={Sub-Second Recursive Polynomial Proofs},
  author={Saifi, Ayaan and Regmi, Matrika},
  year={2024}
}

DOI: 10.5281/zenodo.georbit.61902