types

Interface Proof.AccumulatorConsistencyProofOrBuilder

All Superinterfaces:

com.google.protobuf.MessageLiteOrBuilder, com.google.protobuf.MessageOrBuilder

All Known Implementing Classes:

Proof.AccumulatorConsistencyProof, Proof.AccumulatorConsistencyProof.Builder

Enclosing class:

Proof

public static interface Proof.AccumulatorConsistencyProofOrBuilder
extends com.google.protobuf.MessageOrBuilder

Method Summary

Modifier and Type	Method and Description
com.google.protobuf.ByteString	getFrozenSubtreeRoots(int index) The root hashes of the frozen subtrees that form the small accumulator.
int	getFrozenSubtreeRootsCount() The root hashes of the frozen subtrees that form the small accumulator.
List<com.google.protobuf.ByteString>	getFrozenSubtreeRootsList() The root hashes of the frozen subtrees that form the small accumulator.
com.google.protobuf.ByteString	getNonDefaultSiblings(int index) The non-default siblings.
int	getNonDefaultSiblingsCount() The non-default siblings.
List<com.google.protobuf.ByteString>	getNonDefaultSiblingsList() The non-default siblings.
int	getNumSiblings() The total number of siblings.

Methods inherited from interface com.google.protobuf.MessageOrBuilder

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

Methods inherited from interface com.google.protobuf.MessageLiteOrBuilder

isInitialized

Method Detail

getFrozenSubtreeRootsList

List<com.google.protobuf.ByteString> getFrozenSubtreeRootsList()

 The root hashes of the frozen subtrees that form the small accumulator.
 Note that none of these hashes should be default hash.
 

repeated bytes frozen_subtree_roots = 1;

getFrozenSubtreeRootsCount

int getFrozenSubtreeRootsCount()

 The root hashes of the frozen subtrees that form the small accumulator.
 Note that none of these hashes should be default hash.
 

repeated bytes frozen_subtree_roots = 1;

getFrozenSubtreeRoots

com.google.protobuf.ByteString getFrozenSubtreeRoots(int index)

 The root hashes of the frozen subtrees that form the small accumulator.
 Note that none of these hashes should be default hash.
 

repeated bytes frozen_subtree_roots = 1;

getNumSiblings

int getNumSiblings()

 The total number of siblings.
 

uint32 num_siblings = 2;

getNonDefaultSiblingsList

List<com.google.protobuf.ByteString> getNonDefaultSiblingsList()

 The non-default siblings. Note that the entire list of siblings always
 start of zero or more non-default siblings, followed by zero of more
 default siblings. So given the total number of siblings and the non-default
 siblings we should be able to construct the entire sibling list.
 

repeated bytes non_default_siblings = 3;

getNonDefaultSiblingsCount

int getNonDefaultSiblingsCount()

 The non-default siblings. Note that the entire list of siblings always
 start of zero or more non-default siblings, followed by zero of more
 default siblings. So given the total number of siblings and the non-default
 siblings we should be able to construct the entire sibling list.
 

repeated bytes non_default_siblings = 3;

getNonDefaultSiblings

com.google.protobuf.ByteString getNonDefaultSiblings(int index)

 The non-default siblings. Note that the entire list of siblings always
 start of zero or more non-default siblings, followed by zero of more
 default siblings. So given the total number of siblings and the non-default
 siblings we should be able to construct the entire sibling list.
 

repeated bytes non_default_siblings = 3;