Bao - Oxidizing the Fastest Hash Functions in the World
Details
A few months ago Jack O'Connor gave a lightening talk on Bao, the fastest hash function. This month he expands on the motivation behind the work and its use cases.
Doors open at 6:30pm and talks start around 7pm. Food and drinks provided thanks to our amazing host Nace partners!
Our host needs a list of attendees to enter the building. Note that RSVPs close ~~24hrs~~ 3pm the day before.
========== Main Talk ==========
Bao a tree hash for large files, and possibly the fastest cryptographic hash in the world
by Jack O'Connor
Bao is a cryptographic tree hash, based on BLAKE2 and implemented in Rust. Tree hashes are more flexible than conventional hash functions, and Bao can verify small pieces of a file independently rather than just the whole thing at once. Tree hashes also make it possible to hash different parts of a file in parallel, which makes them dramatically faster than conventional hashes on modern hardware.
What exactly is a cryptographic hash, and how do we design a tree hash so that it maintain those cryptographic guarantees? How do we use Rust to take advantage of multithreading and SIMD for performance? How fast is Bao, exactly? What happens if we run it on a giant AWS machine with fifty cores? What on earth does it mean to have 8864% CPU utilization? Come see cool demos!
github: https://github.com/oconnor663/bao
Jack O'Connor is a programmer and a Rust enthusiast. Currently he's working on the Bao project full time, and before that he was building cryptography software at Keybase.
===========================
Thanks to our host MongoDb and sponsor Nace Partners!
https://www.mongodb.com/
http://nacepartners.com/