| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2026-01-08 | update to the 2024 edition | Jack O'Connor | |
| While we're taking this MSRV bump, we can also update `constant_time_eq`, which uses the 2024 edition in its most recent versions. | |||
| 2024-03-20 | format the state matrix better in reference_impl.rs | Jack O'Connor | |
| 2023-03-25 | upgrade all Cargo.toml files to edition=2021 | Jack O'Connor | |
| The MSRV is already 1.60, so this doesn't affect much. The only impact to other code is that we no longer need to explicitly import TryInto. | |||
| 2022-03-04 | link to ports of the reference implementation | Jack O'Connor | |
| 2021-11-30 | add an assert and remove an iter_mut in reference_impl | Jack O'Connor | |
| Suggested in https://github.com/rust-lang/rust-clippy/issues/8039. | |||
| 2021-10-29 | make field ordering more consistent in the reference impl | Jack O'Connor | |
| 2021-10-29 | distinguish between key and key_words in the reference impl | Jack O'Connor | |
| 2020-01-15 | more consistent use of Self in the reference impl | Jack O'Connor | |
| 2020-01-14 | add comments to the reference impl | Jack O'Connor | |
| 2020-01-10 | Fix misspelled words_from_little_endian_bytes | Leonard Buskin | |
| 2020-01-09 | switch the reference impl to use the single permutation | Jack O'Connor | |
| 2020-01-05 | switch to the new permutations | Jack O'Connor | |
| 2020-01-04 | comment punctuation nit | Jack O'Connor | |
| 2019-12-28 | make derive_key take a key of any length | Jack O'Connor | |
| The previous version of this API called for a key of exactly 256 bits. That's good for optimal performance, but it would mean losing the use-with-other-algorithms property for applications whose input keys are a different size. There's no way for an abstraction over the previous version to provide reliable domain separation for the "extract" step. | |||
| 2019-12-24 | switch back to counting trailing 0 bits | Jack O'Connor | |
| These things are totally equivalent, and I keep going back and forth, but now I think this is slightly clearer. | |||
| 2019-12-24 | use self.flags instead of self.chunk_state.flags in the reference impl | Jack O'Connor | |
| This is clearer, and because of padding requirements it doesn't change the size of the Hasher struct. (We have a test for this.) | |||
| 2019-12-24 | switch from counting trailing 0 bits to counting trailing 1 bits | Jack O'Connor | |
| 2019-12-23 | get rid of unnecessary variables in push_chunk_chaining_value | Jack O'Connor | |
| 2019-12-23 | add a parent_cv helper function to the reference impl | Jack O'Connor | |
| Also use fewer array references (the compiler doesn't care) be more explicit with a `new_cv` mutable variable. This clarifies push_chunk_chaining_value just a bit. Since that's the trickiest function in the entire thing, it's good to clarify it. (It also gets excerpted directly into the spec.) | |||
| 2019-12-22 | rework push_chunk_chaining_value in terms of trailing 0's | Jack O'Connor | |
| 2019-12-14 | a few more comments in reference_impl.rs | Jack O'Connor | |
| 2019-12-12 | update MAX_DEPTH | Jack O'Connor | |
| 2019-12-12 | rename "offset" to "counter" and always increment it by 1 | Jack O'Connor | |
| This is simpler than sometimes incrementing by CHUNK_LEN and other times incrementing by BLOCK_LEN. | |||
| 2019-12-12 | reduce the CHUNK_LEN from 2048 bytes to 1024 bytes | Jack O'Connor | |
| Smaller chunk sizes are a big benefit for parallelism at shorter input lengths, and recent benchmarks show that this reduction has a relative small cost in terms of peak throughput. It's also a nice round number. | |||
| 2019-12-08 | s/subtree_stack/cv_stack/ in reference_impl.rs | Jack O'Connor | |
| This fits better with the current wording of the spec. | |||
| 2019-12-06 | add struct Hasher | Jack O'Connor | |
| 2019-12-02 | add the reference implementation | Jack O'Connor | |
 |
index : github.com/BLAKE3-team/BLAKE3 | |
| BLAKE3 is a cryptographic hash function |
| aboutsummaryrefslogtreecommitdiff |
path: root/reference_impl