vincenzopalazzo
/
arti
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
arti/crates/hashx/Cargo.toml

38 lines
1.2 KiB
TOML
Raw Normal View History

Reimplement HashX in Rust 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>
2023-06-28 22:59:46 +01:00
[package]
name = "hashx"
version = "0.1.0"
authors = ["The Tor Project, Inc.", "Micah Elizabeth Scott <beth@torproject.org>"]
edition = "2021"
rust-version = "1.65"
homepage = "https://gitlab.torproject.org/tpo/core/arti/-/wikis/home"
description = "Hash function family designed for ASIC-resistant client puzzles"
keywords = ["cryptography"]
categories = ["cryptography"]
repository = "https://gitlab.torproject.org/tpo/core/arti.git/"
equix, hashx: Prepare for an initial LGPL release This replaces the 'TODO' marker from earlier commits, using tevador's copyright and license (LGPL 3.0 only) for the hashx and equix crates. Signed-off-by: Micah Elizabeth Scott <beth@torproject.org>
2023-07-26 17:16:02 +01:00
# This crate is a new implementation of algorithms developed and implemented
# by tevador here: https://github.com/tevador/equix/. The original is
# Copyright (c) 2020 tevador <tevador@gmail.com>
# and licensed under the terms of the LGPL version 3.0.
equix, hashx: Additional comment tweaks More review feedback. Thanks nickm! Signed-off-by: Micah Elizabeth Scott <beth@torproject.org>
2023-07-27 21:17:23 +01:00
#
# If tevador is okay with it, we intend to re-license this crate as
# MIT OR Apache-2.0. Thus, do not contribute to this crate unless you
# are okay with these licensing terms.
equix, hashx: Prepare for an initial LGPL release This replaces the 'TODO' marker from earlier commits, using tevador's copyright and license (LGPL 3.0 only) for the hashx and equix crates. Signed-off-by: Micah Elizabeth Scott <beth@torproject.org>
2023-07-26 17:16:02 +01:00
license = "LGPL-3.0-only"
Reimplement HashX in Rust 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>
2023-06-28 22:59:46 +01:00
[features]
default = ["compiler"]
full = ["compiler"]
compiler = ["dep:dynasmrt", "dep:hex"]
[dependencies]
arrayvec = "0.7.3"
blake2 = "0.10.6"
dynasmrt = { version = "2.0.0", optional = true }
hex = { version = "0.4.3", optional = true }
hashx: use RngCore for HashX's internal PRNG This refactors the random number generator used within HashX's program generator so that it uses the rand::RngCore trait. The basic SipHash powered u64 generator now implements RngCore, while a buffer layer wraps this and provides u8 and u32 values as needed by the generator. Some of this new RngCore layer is now exposed to the hashx crate's public API. The intent is to allow external code to test, benchmark, or fuzz the program generator by supplying its own random number stream. Benchmarks show a small but confusing performance improvement associated with this patch. About a 2% improvement in generation. This could be due to the Rng changes. No change in compiled hash execution performance. Even though this patch only touches program generation, benchmarks show a 4% speedup in interpreted execution. This seems most likely explained by instruction cache effects, but I'm not sure. Signed-off-by: Micah Elizabeth Scott <beth@torproject.org>
2023-07-18 21:44:28 +01:00
rand_core = "0.6.4"
Reimplement HashX in Rust 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>
2023-06-28 22:59:46 +01:00
thiserror = "1.0.40"
[dev-dependencies]
hex-literal = "0.4.1"