bft blockchain consensus consistency cryptocurrency cryptography db distributed-systems go

History

M. J. Fromberger 6dd8984fef Fix and clarify breaks from select cases. (#6781 ) Update those break statements inside case clauses that are intended to reach an enclosing for loop, so that they correctly exit the loop. The candidate files for this change were located using: % staticcheck -checks SA4011 ./... \| cut -d: -f-2 This change is intended to preserve the intended semantics of the code, but since the code as-written did not have its intended effect, some behaviour may change. Specifically: Some loops may have run longer than they were supposed to, prior to this change. In one case I was not able to clearly determine the intended outcome. That case has been commented but otherwise left as-written. Fixes #6780.		3 years ago
..
README.md	lint: add markdown linter (#5254)	4 years ago
doc.go	revert back to Jae's original payload size limit	6 years ago
hash.go	crypto/merkle: optimize merkle tree hashing (#6513)	4 years ago
proof.go	Fix and clarify breaks from select cases. (#6781)	3 years ago
proof_key_path.go	crypto/merkle: remove simple prefix (#4989)	4 years ago
proof_key_path_test.go	crypto/merkle: optimize merkle tree hashing (#6513)	4 years ago
proof_op.go	light/rpc: fix ABCIQuery (#5375)	4 years ago
proof_test.go	crypto/merkle: optimize merkle tree hashing (#6513)	4 years ago
proof_value.go	linter: fix nolintlint warnings (#6257)	4 years ago
rfc6962_test.go	merkle: return hashes for empty merkle trees (#5193)	4 years ago
tree.go	crypto/merkle: optimize merkle tree hashing (#6513)	4 years ago
tree_test.go	libs: internalize some packages (#6366)	4 years ago
types.go	proto: leftover amino (#4986)	4 years ago

README.md

Merkle Tree

For smaller static data structures that don't require immutable snapshots or mutability; for instance the transactions and validation signatures of a block can be hashed using this simple merkle tree logic.