tendermint

Author	SHA1	Message	Date
Jae Kwon	a0cc186c75	Unified deterministic merkle tree computation. Now we have 2 types of trees... IAVL (nondeterministic) and Simple (deterministic)	10 years ago
Jae Kwon	5c69736994	Add PartSet test.	10 years ago
Jae Kwon	08f86176fc	state save/load test.	10 years ago
Jae Kwon	335b7a5984	...	10 years ago
Jae Kwon	839301b03c	iavl tree LRU cache	10 years ago
Jae Kwon	8e452aa0d2	fixed algorithm	10 years ago
Jae Kwon	5dfa2ecebb	share block parts when we're the proposer	10 years ago
Jae Kwon	d0ec18dc16	converting Binary struct model to native w/ global methods model	10 years ago
Jae Kwon	3e2f377863	benchmark works, but could use some improvement. ~33k packets/sec for a single local pair.	11 years ago
Jae Kwon	c40fc65e6b	go fmt	11 years ago
Jae Kwon	1c4f5e2506	refactor out binary	11 years ago
Jae Kwon	60004db2ad	faster random strings	11 years ago
Jae Kwon	85654fd875	changed implementation to an immutable AVL+ tree.	11 years ago
Jae Kwon	ef480bb229	refactoring again, implementing b+tree	11 years ago
Jae Kwon	cb56808a9c	persistence	11 years ago
Jae Kwon	f2464a5445	.	11 years ago
Jae Kwon	268eaa79f0	add db to api for lazy loading	11 years ago
Jae Kwon	850144f3e7	updated benchmark	11 years ago
Jae Kwon	795e183273	Fixed merkle implementation to fit official algorithm.	11 years ago
Jae Kwon	35b352afb0	First iteration of the immutable AVL tree	11 years ago