Algo to give k ranked miners for store #45
Draft
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
Shr1ftyy
requested changes
Jan 23, 2025
Shr1ftyy
reviewed
Jan 23, 2025
rayokamoto
requested changes
Jan 23, 2025
rayokamoto
approved these changes
Jan 24, 2025
|
There seems to be bug where the files aren't reconstructed properly |
Shr1ftyy
reviewed
Jan 26, 2025
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.
Given that erasure coding provides us with a guarantee that we can recover the file even after a 30% loss of the data pieces. We can use this assign 70% of the pieces (mix of data and parity pieces) to higher ranking miners and 30% of the pieces (only data pieces) to lower ranking miners to allow them to build trust and rank in the network.
Introduces
top_miner_ratio settingCloses #3