theoreticalbts 0bcfc69da2 Further improve Merkle root algorithm, implement unit test #266 ... This commit redefines the hash h of a node in the Merkle tree as: h(unary_node) = unary_node h(binary_node) = H(left_child + right_child) Previous code in c0b9af9a99 defined hash as: h(unary_node) = H(unary_node + digest_type()) h(binary_node) = H(left_child + right_child) The improved definition in this commit saves some hash computations.		2015-08-26 15:36:05 -04:00
..
app	Avoid referencing uninitialized memory	2015-08-24 19:35:56 -04:00
chain	Further improve Merkle root algorithm, implement unit test #266	2015-08-26 15:36:05 -04:00
db	improve reindexing performance	2015-08-24 17:57:44 -04:00
deterministic_openssl_rand	Implement minimal "make install" command #219	2015-08-06 12:40:53 -04:00
egenesis	Win32 build fixes	2015-08-17 12:39:26 -04:00
fc@71be796af5	Greatly reduce the amount of time the p2p network code will wait for a peer to	2015-08-24 09:57:47 -04:00
net	improve reindexing performance	2015-08-24 17:57:44 -04:00
p2p	Ground work for new p2p protocol	2015-08-21 18:44:32 -04:00
plugins	Fix #244 - Improve log messages	2015-08-18 11:06:40 -04:00
time	Implement minimal "make install" command #219	2015-08-06 12:40:53 -04:00
utilities	Implement minimal "make install" command #219	2015-08-06 12:40:53 -04:00
wallet	cli_wallet: Implement approve_proposal to more easily approve proposals	2015-08-25 18:02:52 -04:00
CMakeLists.txt	improve reindexing performance	2015-08-24 17:57:44 -04:00