mirrors/arti.git/crates/hashx/benches, branch arti-v1.1.7mirror of https://gitlab.torproject.org/tpo/core/arti
http://git.dilluti0n.com/mirrors/arti.git/atom?h=arti-v1.1.72023-07-27T14:20:14Zhashx: Simplify hash_to_bytes, only support fixed output width2023-07-27T14:20:14ZMicah Elizabeth Scottbeth@torproject.org2023-07-18T23:55:10Zurn:sha1:10b7352c98e1fe85b82fb49b9ab7cfdeb2248593
In response to review feedback. The byte output is only needed
for unit tests right now, since Equi-X uses u64 output exclusively.
The optimization for shorter output widths can shave tiny amounts of
time off hash benchmarks, but in this case it's more helpful to avoid
introducing APIs that offer parameters with incomplete compile-time
range checking.
Signed-off-by: Micah Elizabeth Scott <beth@torproject.org>
Reimplement HashX in Rust2023-07-27T14:20:06ZMicah Elizabeth Scottbeth@torproject.org2023-06-28T21:59:46Zurn:sha1:a8756f2bce9f0dba8e445baae82aab90aa9ad096
This is a new pure Rust implementation of the HashX algorithm
designed by tevador for Tor's onion service proof of work puzzle v1.
HashX is a lightweight family of randomly generated hash functions.
A seed, via blake2 and siphash, drives a program generation model
which randomly selects opcodes and registers while following some
constraints that avoid timing stalls or insufficient hash mixing.
The execution of these hash funcions can be done using a pure Rust
interpreter, or about 20x faster using a very simple just in time
compiler based on the dynasm assembler crate. This has been
implemented for x86_64 and aarch64.
Signed-off-by: Micah Elizabeth Scott <beth@torproject.org>