Closed gdbelvin closed 8 years ago
The current sparse tree proof verification algorithm uses an SQL database. This is heavy weight, and difficult to replicate in javascript.
Create a simple sparse tree verification algorithm that can be ported to other languages.
Example: https://github.com/google/certificate-transparency/blob/master/go/merkletree/merkle_verifier.go#L31
Use 9bedf6cb3532c22e2baaa77fdffc3857e841d5ed as a reference, which is similar to the above example.
The current sparse tree proof verification algorithm uses an SQL database. This is heavy weight, and difficult to replicate in javascript.
Create a simple sparse tree verification algorithm that can be ported to other languages.