Updated Near proving scheme. #29
Open
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This scheme uses BFT finality to prove finality of random block. It implements two types of proving scheme: proofs for "epoch" blocks & proofs for randomly selected blocks. Proofs of randomly selected blocks rely on hashes of "epoch" blocks, which are stores in the contact. For the time being, hashes are stored in .json files to simulate contracts. The scheme takes a set of blocks, data of "epoch" blocks and hashes of "epoch" blocks to prove BFT finality of a specified block.
We added additional comments and few changes to the code to make it more clear.
Overview on the proving scheme: proof for BFT finally and proofs for computational integrity for block entities.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This scheme uses BFT finality to prove finality of random block. It implements two types of proving scheme: proofs for "epoch" blocks & proofs for randomly selected blocks. Proofs of randomly selected blocks rely on hashes of "epoch" blocks, which are stores in the contact. For the time being, hashes are stored in .json files to simulate contracts. The scheme takes a set of blocks, data of "epoch" blocks and hashes of "epoch" blocks to prove BFT finality of a specified block.