Prototype implementation of SwiftPaxos (NSDI 2024)

PostgreSQL Extension for RAFT- Based Leader Election and Cluster Coordination. Background workers, shared memory state, clean C core with Go bridge. PG16+.

PolyCouncil is an open-source multi-model deliberation engine for LM Studio. It runs multiple LLMs in parallel, gathers their answers, scores each response using a shared rubric, and produces a final, consensus-driven result. Designed for testing, comparing, and orchestrating local models with ease.

Decentralized distributed system built using blockchain technology to provide a marketplace for users to trade their processing power in reward for ethereum

A rust implementation of raft election process

An implementation of Raft in Python for learning purposes

A drop-in library for Federated Byzantine Agreement (Stellar Concensus Protocol).

A public, community-driven space for exploring Zenon’s architecture, documenting research, and enabling developers to collaborate on future directions of the Network of Momentum.

Consensus deduplication proxy supporting x402 payments.

This is a modified version of PBFT consensus algorithm [1]. PBFT was designed as a method to solve the Byzantine General's Problem [2] in a distributed system. This method is designed to optimize the resource usage and reduce network latency.

Total order broadcast algorithm implemented in Go

Golang implementation of the Raft consensus protocol

Open source distributed system clustering go library that manages partitions, replications, consistant hasing, cluster metadata etc

Peer-to-Peer - Distributed Consensus System

Proof of knowledge by implementation

Barebone Zookeeper service in Rust

Niagara Region Medical Services

blockchain implementation with golanf

Created a Blockchain using Python to allow baby product management while ensuring secure data transmission. Implemented replication with consensus and designed the back-end of Merkle tree to attain an efficient manner. Coded the data storing technique in a way like without database one can record the chain by keeping at least one node always on.

Created a peer for a blockchain for my final assignment of distributed assignment. The whole class had to add to the same blockchain and a concensus algorithm had to be run to find the most agreeable and recent chain(longest and valid). The concensus algorithm was the main portion of this code.