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.

Sign up for GitHub

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

Jump to bottom

Design dataset hashing #1

Closed

sergiimk opened this issue Aug 3, 2020 · 0 comments · Fixed by #14 or #16

Labels

Contributor

sergiimk commented Aug 3, 2020 •

edited

Dataset hashing method is currently a stop-gap implementation.

This goal is to design a hashing method that:

has a streaming nature
tolerant to row reordering (as many processing engine are concurrent and don't enforce ordering between outputs of independent calculations)
fast
collision-resistant

Ideas:

Consider what algos are used by Dat: https://datprotocol.github.io/how-dat-works/

sergiimk added the backlog item label

sergiimk mentioned this issue

RFC: Logical Data Hashes #14

Merged

sergiimk closed this as completed in #14

sergiimk reopened this

sergiimk mentioned this issue

RFC: Logical Data Hashes #16

Merged

sergiimk closed this as completed in #16

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment