[WIP] 3072-bit MuHash based hash_serialized #10434
Conversation
| @@ -0,0 +1,329 @@ | |||
| #include "muhash.h" | |||
There was a problem hiding this comment.
Copyright header missing
src/test/crypto_tests.cpp
Outdated
| for (int i = 0; i < 10; ++i) { | ||
| unsigned char res[384]; | ||
| int table[4]; | ||
| for (int i = 0; i < 4; ++i) { |
| } | ||
| for (int order = 0; order < 4; ++order) { | ||
| MuHash3072 acc; | ||
| for (int i = 0; i < 4; ++i) { |
| y /= x; // x=X, y=Y/X, z=X/Y | ||
| z *= y; // x=X, y=Y/X, z=1 | ||
| z.Finalize(out); | ||
| for (int i = 0; i < 384; ++i) { |
7940961 to
791b3ac
Compare
|
@sipa - did this POC of chainstate only sync: Worked well - syncs as fast at you can download chainstate db (30mins for 2.8gig chainstate). Network was the bottleneck. Or guess could compute hash by downloading every block! Then no security loss. But 150Gig download - so still 8hrs for 40Mbit connection. (think the hashing would take about 1 hour but in parallel with download). |
|
Closing as stale. |
This implements a 3072-bit MuHash discussed on https://lists.linuxfoundation.org/pipermail/bitcoin-dev/2017-May/014337.html as a replacement for the hash_serialized field in
gettxoutsetinfo.This is an order-independent hash, allowing it to be computed either by iterating over the UTXO set in non-sorted order. It also supports incremental addition and deletion of entries from the hash, allowing it to be updated on the fly for each block. Neither of these approaches is currently implemented.