BLAKE3: One Function, Fast Everywhere

16

BLAKE3: One Function, Fast Everywhere ☶ pdf cryptography merkle-trees github.com
via snej 11 months ago | archive
Archive.org Archive.today Ghostarchive
| 2 comments

2

We present BLAKE3, an evolution of the BLAKE2 cryptographic hash that is both faster and also more consistently fast across different platforms and input sizes. BLAKE3 supports an unbounded degree of parallelism, using a tree structure that scales up to any number of SIMD lanes and CPU cores. On Intel Cascade Lake-SP, peak single-threaded throughput is 4× that of BLAKE2b, 8× that of SHA-512, and 12× that of SHA-256, and it can scale further using multiple threads. BLAKE3 is also efﬁcient on smaller architectures: throughput on a 32-bit ARM1176 core is 1.3× that of SHA-256 and 3× that of BLAKE2b and SHA-512. Unlike BLAKE2 and SHA-2, with different variants better suited for different platforms, BLAKE3 is a single algorithm with no variants. It provides a simpliﬁed API supporting all the use cases of BLAKE2, including keying and extendable output. The tree structure also supports new use cases, such as veriﬁed streaming and incremental updates.

1. 2
  
  robey 11 months ago | link
  
  Can recommend. Used this in bitbottle (posted here last year).
2. 1
  
  riking 11 months ago | link
  
  Section 7.5:
  
  We expect that the majority of space-constrained applications already have strict limits on the size of their inputs. Indeed it is hard to imagine how an application without 2 KB of memory to spare could even get its hands on a gigabyte of input.
  
  heh, yeah.