Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Erasure coding commitments #1304

Merged
merged 3 commits into from Mar 28, 2023
Merged

Erasure coding commitments #1304

merged 3 commits into from Mar 28, 2023

Conversation

nazar-pc
Copy link
Member

@nazar-pc nazar-pc commented Mar 27, 2023

This resolves 4th item from #1163 and improves archiving performance by erasure coding commitments rather than creating them for half of the records in segment.

Before (one segment start to finish, it is not as bad with incremental commitment):

segment-archiving       time:   [3.5598 s 3.5659 s 3.5737 s]

After:

segment-archiving       time:   [2.3499 s 2.3595 s 2.3736 s]

Resolves #1163

Code contributor checklist:

…r and piece reconstructor to improve performance
Base automatically changed from polynomial-ec-archiver to main March 28, 2023 06:12
@nazar-pc nazar-pc merged commit 8ec9eb9 into main Mar 28, 2023
9 checks passed
@nazar-pc nazar-pc deleted the erasure-coding-commitments branch March 28, 2023 06:13
i1i1 added a commit to subspace/subspace-pulsar-sdk that referenced this pull request Mar 28, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

Polynomial erasure coding (based on FFT, like v2.2 farmer plotting)
2 participants