Package dev.sigstore.rekor.client

Interface RekorEntry.InclusionProof

  • Enclosing interface:
    RekorEntry
    @Immutable
public static interface RekorEntry.InclusionProof
    Inclusion proof to allow verification that the entry is truly part of the Rekor merkle tree.

    • Method Summary

      All Methods Instance Methods Abstract Methods Default Methods 
      Modifier and Type Method Description
      java.lang.String getCheckpoint()
      The checkpoint (signed tree head) that the inclusion proof is based on.
      java.util.List<java.lang.String> getHashes()
      A list of hashes required to compute the inclusion proof, sorted in order from leaf to root.
      java.lang.Long getLogIndex()
      The index of the entry in the transparency log.
      java.lang.String getRootHash()
      The hash value stored at the root of the merkle tree at the time the proof was generated.
      java.lang.Long getTreeSize()
      The size of the merkle tree at the time the inclusion proof was generated.
      default RekorEntry.Checkpoint parsedCheckpoint()
      The checkpoint that getCheckpoint() provides, but parsed into component parts.

    • Method Detail

      • getHashes

        java.util.List<java.lang.String> getHashes()
        A list of hashes required to compute the inclusion proof, sorted in order from leaf to root.
        Returns:
        list of SHA256 hash values expressed in hexadecimal format

      • getLogIndex

        java.lang.Long getLogIndex()
        The index of the entry in the transparency log.

      • getRootHash

        java.lang.String getRootHash()
        The hash value stored at the root of the merkle tree at the time the proof was generated.
        Returns:
        SHA256 hash value expressed in hexadecimal format

      • getTreeSize

        java.lang.Long getTreeSize()
        The size of the merkle tree at the time the inclusion proof was generated.

      • getCheckpoint

        java.lang.String getCheckpoint()
        The checkpoint (signed tree head) that the inclusion proof is based on.