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	Implement chain-locked transactions	2015-08-06 12:56:37 -04:00
benchmarks	Fix Linux Clang build with missing includes; resolve #174	2015-07-20 14:57:08 -04:00
common	Resolve #161: Fix account creation fee scaling	2015-08-10 16:39:09 -04:00
intense	api_stress.py: Implement simple stress testing of API	2015-08-12 16:52:30 -04:00
performance	Rename bad references to delegate -> witness; #147	2015-07-13 16:08:17 -04:00
tests	Further improve Merkle root algorithm, implement unit test #266	2015-08-26 15:36:05 -04:00
CMakeLists.txt	Add egenesis_none to targets in tests/ directory, fix #227	2015-08-10 12:38:01 -04:00