89a9e46cc9
Only compare the first n/(k+1) bits when sorting We only need to sort based on the bits we are colliding. In earlier solver rounds, this speeds up the comparison considerably (calling `memcmp()` on 3 bytes instead of 12 in the first round for the current parameters).
Zcash Core integration/staging tree
Where do I begin?
We have a guide for joining the public testnet: https://github.com/zcash/zcash/wiki/Public-Alpha-Guide
What is Zcash?
Zcash is an implementation of the "Zerocash" protocol. Based on Bitcoin's code, it intends to offer a far higher standard of privacy and anonymity through a sophisticiated zero-knowledge proving scheme which preserves confidentiality of transaction metadata.
Zcash is unfinished and highly experimental. Use at your own risk.
Participation in the Zcash project is subject to a Code of Conduct.
License
Zcash Core is released under the terms of the MIT license. See COPYING for more information or see http://opensource.org/licenses/MIT.