xkrzysztofk Goto Github PK

blog

byz

This is a simulation for the Byzantine generals problems with 3 Generals where one of them is a traitor for both oral and signed messages.

byzantine

A demonstration of the OM-algorithm for solving the Byzantine Generals Problem

byzantine-generals

Byzantine generals problem solving via EIG trees

byzantine-generals-1

A implementation of the Byzantine General Problem

byzantine_generals

An implementation of Leslie Lamport's OM algorithm for the Byzantine Generals Problem

cryptocurrency-assignment-byzantine

In this project, you will implement the basic, unauthenticated Byzantine fault tolerant consensus algorithm described by Lamport, Shostak, and Pease in their seminal paper titled The Byzantine General’s Problem [1]. The project code provides you with a simple consensus protocol testing framework that you will use to test the correctness of your implementation. Read and thoroughly understand all the project code before beginning. The Java class named hw4.BasicTests gives several tests that demonstrate how to use the consensus testing framework. Your submission should make all the tests pass. For example, test0 test case is reproduced below and configures a small network running the FollowLeader consensus protocol described in class that fails to solve the BFT consensus problem for any number of malicious nodes.

kolokwium_2-pr_grupa_1

my_blog

oralmessageflow

This is a project for a computer science degree. The project simulates the Lamport algorithm for the Byzantine generals problem and provides a graphical interface to follow the execution of the algorithm.

pathofbuilding

Offline build planner for Path of Exile.

pokedex

pr_kol1_gr_1

pr_l10

pr_l10-server

pr_l11

pr_l13

pr_l2

pr_l5

pr_l6

pr_l7

pr_projekt

taw_l11

taw_l12

toik-zadanie_8

toik_5-6

university-press

University Press / Spring DATA + JPA + PostgreSQL

zpsm