2 unstable releases

0.1.0 Jul 9, 2020
0.0.0 Jun 26, 2020

#772 in Magic Beans

Download history 532/week @ 2021-08-09 494/week @ 2021-08-16 702/week @ 2021-08-23 1092/week @ 2021-08-30 572/week @ 2021-09-06 874/week @ 2021-09-13 1181/week @ 2021-09-20 999/week @ 2021-09-27 1254/week @ 2021-10-04 712/week @ 2021-10-11 1104/week @ 2021-10-18 800/week @ 2021-10-25 990/week @ 2021-11-01 753/week @ 2021-11-08 648/week @ 2021-11-15 57/week @ 2021-11-22

2,462 downloads per month
Used in 6 crates (via zcash_primitives)

MIT/Apache

25KB
448 lines

Zcash Rust crates

This repository contains a (work-in-progress) set of Rust crates for working with Zcash.

Security Warnings

These libraries are currently under development and have not been fully-reviewed.

License

All code in this workspace is licensed under either of

at your option.

Contribution

Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.


lib.rs:

Equihash is a Proof-of-Work algorithm, based on a generalization of the Birthday problem which finds colliding hash values. It was designed to be memory-hard; more specifically, the bottle-neck for parallel implementations of Equihash solvers would be memory bandwidth.

This crate implements Equihash as specified for the Zcash consensus rules. It can verify solutions for any valid (n, k) parameters, as long as the row indices are no larger than 32 bits (that is, ceiling(((n / (k + 1)) + 1) / 8) <= 4).

References

Dependencies

~350KB