Interface InclusionProofOrBuilder

  • All Superinterfaces:
    com.google.protobuf.MessageLiteOrBuilder, com.google.protobuf.MessageOrBuilder
    All Known Implementing Classes:
    InclusionProof, InclusionProof.Builder

    public interface InclusionProofOrBuilder
    extends com.google.protobuf.MessageOrBuilder
    • Method Summary

      All Methods Instance Methods Abstract Methods 
      Modifier and Type Method Description
      Checkpoint getCheckpoint()
      Signature of the tree head, as of the time of this proof was generated.
      CheckpointOrBuilder getCheckpointOrBuilder()
      Signature of the tree head, as of the time of this proof was generated.
      com.google.protobuf.ByteString getHashes​(int index)
      A list of hashes required to compute the inclusion proof, sorted in order from leaf to root.
      int getHashesCount()
      A list of hashes required to compute the inclusion proof, sorted in order from leaf to root.
      java.util.List<com.google.protobuf.ByteString> getHashesList()
      A list of hashes required to compute the inclusion proof, sorted in order from leaf to root.
      long getLogIndex()
      The index of the entry in the tree it was written to.
      com.google.protobuf.ByteString getRootHash()
      The hash digest stored at the root of the merkle tree at the time the proof was generated.
      long getTreeSize()
      The size of the merkle tree at the time the proof was generated.
      boolean hasCheckpoint()
      Signature of the tree head, as of the time of this proof was generated.
      • Methods inherited from interface com.google.protobuf.MessageLiteOrBuilder

        isInitialized
      • Methods inherited from interface com.google.protobuf.MessageOrBuilder

        findInitializationErrors, getAllFields, getDefaultInstanceForType, getDescriptorForType, getField, getInitializationErrorString, getOneofFieldDescriptor, getRepeatedField, getRepeatedFieldCount, getUnknownFields, hasField, hasOneof
    • Method Detail

      • getLogIndex

        long getLogIndex()
         The index of the entry in the tree it was written to.
         
        int64 log_index = 1 [(.google.api.field_behavior) = REQUIRED];
        Returns:
        The logIndex.
      • getRootHash

        com.google.protobuf.ByteString getRootHash()
         The hash digest stored at the root of the merkle tree at the time
         the proof was generated.
         
        bytes root_hash = 2 [(.google.api.field_behavior) = REQUIRED];
        Returns:
        The rootHash.
      • getTreeSize

        long getTreeSize()
         The size of the merkle tree at the time the proof was generated.
         
        int64 tree_size = 3 [(.google.api.field_behavior) = REQUIRED];
        Returns:
        The treeSize.
      • getHashesList

        java.util.List<com.google.protobuf.ByteString> getHashesList()
         A list of hashes required to compute the inclusion proof, sorted
         in order from leaf to root.
         Note that leaf and root hashes are not included.
         The root hash is available separately in this message, and the
         leaf hash should be calculated by the client.
         
        repeated bytes hashes = 4 [(.google.api.field_behavior) = REQUIRED];
        Returns:
        A list containing the hashes.
      • getHashesCount

        int getHashesCount()
         A list of hashes required to compute the inclusion proof, sorted
         in order from leaf to root.
         Note that leaf and root hashes are not included.
         The root hash is available separately in this message, and the
         leaf hash should be calculated by the client.
         
        repeated bytes hashes = 4 [(.google.api.field_behavior) = REQUIRED];
        Returns:
        The count of hashes.
      • getHashes

        com.google.protobuf.ByteString getHashes​(int index)
         A list of hashes required to compute the inclusion proof, sorted
         in order from leaf to root.
         Note that leaf and root hashes are not included.
         The root hash is available separately in this message, and the
         leaf hash should be calculated by the client.
         
        repeated bytes hashes = 4 [(.google.api.field_behavior) = REQUIRED];
        Parameters:
        index - The index of the element to return.
        Returns:
        The hashes at the given index.
      • hasCheckpoint

        boolean hasCheckpoint()
         Signature of the tree head, as of the time of this proof was
         generated. See above info on 'Checkpoint' for more details.
         
        .dev.sigstore.rekor.v1.Checkpoint checkpoint = 5 [(.google.api.field_behavior) = REQUIRED];
        Returns:
        Whether the checkpoint field is set.
      • getCheckpoint

        Checkpoint getCheckpoint()
         Signature of the tree head, as of the time of this proof was
         generated. See above info on 'Checkpoint' for more details.
         
        .dev.sigstore.rekor.v1.Checkpoint checkpoint = 5 [(.google.api.field_behavior) = REQUIRED];
        Returns:
        The checkpoint.
      • getCheckpointOrBuilder

        CheckpointOrBuilder getCheckpointOrBuilder()
         Signature of the tree head, as of the time of this proof was
         generated. See above info on 'Checkpoint' for more details.
         
        .dev.sigstore.rekor.v1.Checkpoint checkpoint = 5 [(.google.api.field_behavior) = REQUIRED];