Most log implementations use an index of leaf hashes to Merkle tree
index number, to help implement the get-proof-by-hash endpoint
(section 4.5 of RFC 6962).
See this, for example:
https://github.com/google/certificate-transparency/blob/master/cpp/log/log_lookup.cc#L212
On Thu, Mar 1, 2018 at 10:56 AM, Omolola Olamide
<omolola...@gmail.com> wrote:
> Suppose a client desires to validate a SCT from the Log, How does the log
> validate and search for the appropriate certificate once it is contacted?
> Searching a Merkle tree involves going over the leaves one by one. Is this
> also what the Log does?
>
> --
> You received this message because you are subscribed to the Google Groups
> "certificate-transparency" group.
> To unsubscribe from this group and stop receiving emails from it, send an