public static interface Proof.AccumulatorConsistencyProofOrBuilder
extends com.google.protobuf.MessageOrBuilder
| 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.
|
findInitializationErrors, getAllFields, getDefaultInstanceForType, getDescriptorForType, getField, getInitializationErrorString, getOneofFieldDescriptor, getRepeatedField, getRepeatedFieldCount, getUnknownFields, hasField, hasOneofList<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;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;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;int getNumSiblings()
The total number of siblings.
uint32 num_siblings = 2;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;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;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;Copyright © 2019. All rights reserved.