public static final class Protos.DeterministicKey.Builder extends com.google.protobuf.GeneratedMessageV3.Builder<Protos.DeterministicKey.Builder> implements Protos.DeterministicKeyOrBuilder
Data attached to a Key message that defines the data needed by the BIP32 deterministic key hierarchy algorithm.Protobuf type
wallet.DeterministicKey| Modifier and Type | Method and Description |
|---|---|
Protos.DeterministicKey.Builder |
addAllPath(java.lang.Iterable<? extends java.lang.Integer> values)
The path through the key tree.
|
Protos.DeterministicKey.Builder |
addPath(int value)
The path through the key tree.
|
Protos.DeterministicKey.Builder |
addRepeatedField(com.google.protobuf.Descriptors.FieldDescriptor field,
java.lang.Object value) |
Protos.DeterministicKey |
build() |
Protos.DeterministicKey |
buildPartial() |
Protos.DeterministicKey.Builder |
clear() |
Protos.DeterministicKey.Builder |
clearChainCode()
Random data that allows us to extend a key.
|
Protos.DeterministicKey.Builder |
clearField(com.google.protobuf.Descriptors.FieldDescriptor field) |
Protos.DeterministicKey.Builder |
clearIsFollowing()
Flag indicating that this key is a root of a following chain.
|
Protos.DeterministicKey.Builder |
clearIssuedSubkeys()
How many children of this key have been issued, that is, given to the user when they requested a fresh key?
For the parents of keys being handed out, this is always less than the true number of children: the difference is
called the lookahead zone.
|
Protos.DeterministicKey.Builder |
clearLookaheadSize()
optional uint32 lookahead_size = 4; |
Protos.DeterministicKey.Builder |
clearOneof(com.google.protobuf.Descriptors.OneofDescriptor oneof) |
Protos.DeterministicKey.Builder |
clearPath()
The path through the key tree.
|
Protos.DeterministicKey.Builder |
clearSigsRequiredToSpend()
Number of signatures required to spend.
|
Protos.DeterministicKey.Builder |
clone() |
com.google.protobuf.ByteString |
getChainCode()
Random data that allows us to extend a key.
|
Protos.DeterministicKey |
getDefaultInstanceForType() |
static com.google.protobuf.Descriptors.Descriptor |
getDescriptor() |
com.google.protobuf.Descriptors.Descriptor |
getDescriptorForType() |
boolean |
getIsFollowing()
Flag indicating that this key is a root of a following chain.
|
int |
getIssuedSubkeys()
How many children of this key have been issued, that is, given to the user when they requested a fresh key?
For the parents of keys being handed out, this is always less than the true number of children: the difference is
called the lookahead zone.
|
int |
getLookaheadSize()
optional uint32 lookahead_size = 4; |
int |
getPath(int index)
The path through the key tree.
|
int |
getPathCount()
The path through the key tree.
|
java.util.List<java.lang.Integer> |
getPathList()
The path through the key tree.
|
int |
getSigsRequiredToSpend()
Number of signatures required to spend.
|
boolean |
hasChainCode()
Random data that allows us to extend a key.
|
boolean |
hasIsFollowing()
Flag indicating that this key is a root of a following chain.
|
boolean |
hasIssuedSubkeys()
How many children of this key have been issued, that is, given to the user when they requested a fresh key?
For the parents of keys being handed out, this is always less than the true number of children: the difference is
called the lookahead zone.
|
boolean |
hasLookaheadSize()
optional uint32 lookahead_size = 4; |
boolean |
hasSigsRequiredToSpend()
Number of signatures required to spend.
|
protected com.google.protobuf.GeneratedMessageV3.FieldAccessorTable |
internalGetFieldAccessorTable() |
boolean |
isInitialized() |
Protos.DeterministicKey.Builder |
mergeFrom(com.google.protobuf.CodedInputStream input,
com.google.protobuf.ExtensionRegistryLite extensionRegistry) |
Protos.DeterministicKey.Builder |
mergeFrom(com.google.protobuf.Message other) |
Protos.DeterministicKey.Builder |
mergeFrom(Protos.DeterministicKey other) |
Protos.DeterministicKey.Builder |
mergeUnknownFields(com.google.protobuf.UnknownFieldSet unknownFields) |
Protos.DeterministicKey.Builder |
setChainCode(com.google.protobuf.ByteString value)
Random data that allows us to extend a key.
|
Protos.DeterministicKey.Builder |
setField(com.google.protobuf.Descriptors.FieldDescriptor field,
java.lang.Object value) |
Protos.DeterministicKey.Builder |
setIsFollowing(boolean value)
Flag indicating that this key is a root of a following chain.
|
Protos.DeterministicKey.Builder |
setIssuedSubkeys(int value)
How many children of this key have been issued, that is, given to the user when they requested a fresh key?
For the parents of keys being handed out, this is always less than the true number of children: the difference is
called the lookahead zone.
|
Protos.DeterministicKey.Builder |
setLookaheadSize(int value)
optional uint32 lookahead_size = 4; |
Protos.DeterministicKey.Builder |
setPath(int index,
int value)
The path through the key tree.
|
Protos.DeterministicKey.Builder |
setRepeatedField(com.google.protobuf.Descriptors.FieldDescriptor field,
int index,
java.lang.Object value) |
Protos.DeterministicKey.Builder |
setSigsRequiredToSpend(int value)
Number of signatures required to spend.
|
Protos.DeterministicKey.Builder |
setUnknownFields(com.google.protobuf.UnknownFieldSet unknownFields) |
getAllFields, getField, getFieldBuilder, getOneofFieldDescriptor, getParentForChildren, getRepeatedField, getRepeatedFieldBuilder, getRepeatedFieldCount, getUnknownFields, hasField, hasOneof, internalGetMapField, internalGetMutableMapField, isClean, markClean, newBuilderForField, onBuilt, onChanged, setUnknownFieldsProto3findInitializationErrors, getInitializationErrorString, internalMergeFrom, mergeDelimitedFrom, mergeDelimitedFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, newUninitializedMessageException, toStringaddAll, addAll, mergeFrom, newUninitializedMessageExceptionequals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitpublic static final com.google.protobuf.Descriptors.Descriptor getDescriptor()
protected com.google.protobuf.GeneratedMessageV3.FieldAccessorTable internalGetFieldAccessorTable()
internalGetFieldAccessorTable in class com.google.protobuf.GeneratedMessageV3.Builder<Protos.DeterministicKey.Builder>public Protos.DeterministicKey.Builder clear()
clear in interface com.google.protobuf.Message.Builderclear in interface com.google.protobuf.MessageLite.Builderclear in class com.google.protobuf.GeneratedMessageV3.Builder<Protos.DeterministicKey.Builder>public com.google.protobuf.Descriptors.Descriptor getDescriptorForType()
getDescriptorForType in interface com.google.protobuf.Message.BuildergetDescriptorForType in interface com.google.protobuf.MessageOrBuildergetDescriptorForType in class com.google.protobuf.GeneratedMessageV3.Builder<Protos.DeterministicKey.Builder>public Protos.DeterministicKey getDefaultInstanceForType()
getDefaultInstanceForType in interface com.google.protobuf.MessageLiteOrBuildergetDefaultInstanceForType in interface com.google.protobuf.MessageOrBuilderpublic Protos.DeterministicKey build()
build in interface com.google.protobuf.Message.Builderbuild in interface com.google.protobuf.MessageLite.Builderpublic Protos.DeterministicKey buildPartial()
buildPartial in interface com.google.protobuf.Message.BuilderbuildPartial in interface com.google.protobuf.MessageLite.Builderpublic Protos.DeterministicKey.Builder clone()
clone in interface com.google.protobuf.Message.Builderclone in interface com.google.protobuf.MessageLite.Builderclone in class com.google.protobuf.GeneratedMessageV3.Builder<Protos.DeterministicKey.Builder>public Protos.DeterministicKey.Builder setField(com.google.protobuf.Descriptors.FieldDescriptor field, java.lang.Object value)
setField in interface com.google.protobuf.Message.BuildersetField in class com.google.protobuf.GeneratedMessageV3.Builder<Protos.DeterministicKey.Builder>public Protos.DeterministicKey.Builder clearField(com.google.protobuf.Descriptors.FieldDescriptor field)
clearField in interface com.google.protobuf.Message.BuilderclearField in class com.google.protobuf.GeneratedMessageV3.Builder<Protos.DeterministicKey.Builder>public Protos.DeterministicKey.Builder clearOneof(com.google.protobuf.Descriptors.OneofDescriptor oneof)
clearOneof in interface com.google.protobuf.Message.BuilderclearOneof in class com.google.protobuf.GeneratedMessageV3.Builder<Protos.DeterministicKey.Builder>public Protos.DeterministicKey.Builder setRepeatedField(com.google.protobuf.Descriptors.FieldDescriptor field, int index, java.lang.Object value)
setRepeatedField in interface com.google.protobuf.Message.BuildersetRepeatedField in class com.google.protobuf.GeneratedMessageV3.Builder<Protos.DeterministicKey.Builder>public Protos.DeterministicKey.Builder addRepeatedField(com.google.protobuf.Descriptors.FieldDescriptor field, java.lang.Object value)
addRepeatedField in interface com.google.protobuf.Message.BuilderaddRepeatedField in class com.google.protobuf.GeneratedMessageV3.Builder<Protos.DeterministicKey.Builder>public Protos.DeterministicKey.Builder mergeFrom(com.google.protobuf.Message other)
mergeFrom in interface com.google.protobuf.Message.BuildermergeFrom in class com.google.protobuf.AbstractMessage.Builder<Protos.DeterministicKey.Builder>public Protos.DeterministicKey.Builder mergeFrom(Protos.DeterministicKey other)
public final boolean isInitialized()
isInitialized in interface com.google.protobuf.MessageLiteOrBuilderisInitialized in class com.google.protobuf.GeneratedMessageV3.Builder<Protos.DeterministicKey.Builder>public Protos.DeterministicKey.Builder mergeFrom(com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws java.io.IOException
mergeFrom in interface com.google.protobuf.Message.BuildermergeFrom in interface com.google.protobuf.MessageLite.BuildermergeFrom in class com.google.protobuf.AbstractMessage.Builder<Protos.DeterministicKey.Builder>java.io.IOExceptionpublic boolean hasChainCode()
Random data that allows us to extend a key. Without this, we can't figure out the next key in the chain and should just treat it as a regular ORIGINAL type key.
required bytes chain_code = 1;hasChainCode in interface Protos.DeterministicKeyOrBuilderpublic com.google.protobuf.ByteString getChainCode()
Random data that allows us to extend a key. Without this, we can't figure out the next key in the chain and should just treat it as a regular ORIGINAL type key.
required bytes chain_code = 1;getChainCode in interface Protos.DeterministicKeyOrBuilderpublic Protos.DeterministicKey.Builder setChainCode(com.google.protobuf.ByteString value)
Random data that allows us to extend a key. Without this, we can't figure out the next key in the chain and should just treat it as a regular ORIGINAL type key.
required bytes chain_code = 1;public Protos.DeterministicKey.Builder clearChainCode()
Random data that allows us to extend a key. Without this, we can't figure out the next key in the chain and should just treat it as a regular ORIGINAL type key.
required bytes chain_code = 1;public java.util.List<java.lang.Integer> getPathList()
The path through the key tree. Each number is encoded in the standard form: high bit set for private derivation and high bit unset for public derivation.
repeated uint32 path = 2;getPathList in interface Protos.DeterministicKeyOrBuilderpublic int getPathCount()
The path through the key tree. Each number is encoded in the standard form: high bit set for private derivation and high bit unset for public derivation.
repeated uint32 path = 2;getPathCount in interface Protos.DeterministicKeyOrBuilderpublic int getPath(int index)
The path through the key tree. Each number is encoded in the standard form: high bit set for private derivation and high bit unset for public derivation.
repeated uint32 path = 2;getPath in interface Protos.DeterministicKeyOrBuilderpublic Protos.DeterministicKey.Builder setPath(int index, int value)
The path through the key tree. Each number is encoded in the standard form: high bit set for private derivation and high bit unset for public derivation.
repeated uint32 path = 2;public Protos.DeterministicKey.Builder addPath(int value)
The path through the key tree. Each number is encoded in the standard form: high bit set for private derivation and high bit unset for public derivation.
repeated uint32 path = 2;public Protos.DeterministicKey.Builder addAllPath(java.lang.Iterable<? extends java.lang.Integer> values)
The path through the key tree. Each number is encoded in the standard form: high bit set for private derivation and high bit unset for public derivation.
repeated uint32 path = 2;public Protos.DeterministicKey.Builder clearPath()
The path through the key tree. Each number is encoded in the standard form: high bit set for private derivation and high bit unset for public derivation.
repeated uint32 path = 2;public boolean hasIssuedSubkeys()
How many children of this key have been issued, that is, given to the user when they requested a fresh key? For the parents of keys being handed out, this is always less than the true number of children: the difference is called the lookahead zone. These keys are put into Bloom filters so we can spot transactions made by clones of this wallet - for instance when restoring from backup or if the seed was shared between devices. If this field is missing it means we're not issuing subkeys of this key to users.
optional uint32 issued_subkeys = 3;hasIssuedSubkeys in interface Protos.DeterministicKeyOrBuilderpublic int getIssuedSubkeys()
How many children of this key have been issued, that is, given to the user when they requested a fresh key? For the parents of keys being handed out, this is always less than the true number of children: the difference is called the lookahead zone. These keys are put into Bloom filters so we can spot transactions made by clones of this wallet - for instance when restoring from backup or if the seed was shared between devices. If this field is missing it means we're not issuing subkeys of this key to users.
optional uint32 issued_subkeys = 3;getIssuedSubkeys in interface Protos.DeterministicKeyOrBuilderpublic Protos.DeterministicKey.Builder setIssuedSubkeys(int value)
How many children of this key have been issued, that is, given to the user when they requested a fresh key? For the parents of keys being handed out, this is always less than the true number of children: the difference is called the lookahead zone. These keys are put into Bloom filters so we can spot transactions made by clones of this wallet - for instance when restoring from backup or if the seed was shared between devices. If this field is missing it means we're not issuing subkeys of this key to users.
optional uint32 issued_subkeys = 3;public Protos.DeterministicKey.Builder clearIssuedSubkeys()
How many children of this key have been issued, that is, given to the user when they requested a fresh key? For the parents of keys being handed out, this is always less than the true number of children: the difference is called the lookahead zone. These keys are put into Bloom filters so we can spot transactions made by clones of this wallet - for instance when restoring from backup or if the seed was shared between devices. If this field is missing it means we're not issuing subkeys of this key to users.
optional uint32 issued_subkeys = 3;public boolean hasLookaheadSize()
optional uint32 lookahead_size = 4;hasLookaheadSize in interface Protos.DeterministicKeyOrBuilderpublic int getLookaheadSize()
optional uint32 lookahead_size = 4;getLookaheadSize in interface Protos.DeterministicKeyOrBuilderpublic Protos.DeterministicKey.Builder setLookaheadSize(int value)
optional uint32 lookahead_size = 4;public Protos.DeterministicKey.Builder clearLookaheadSize()
optional uint32 lookahead_size = 4;public boolean hasIsFollowing()
Flag indicating that this key is a root of a following chain. This chain is following the next non-following chain. Following/followed chains concept is used for married keychains, where the set of keys combined together to produce a single P2SH multisignature address
optional bool isFollowing = 5;hasIsFollowing in interface Protos.DeterministicKeyOrBuilderpublic boolean getIsFollowing()
Flag indicating that this key is a root of a following chain. This chain is following the next non-following chain. Following/followed chains concept is used for married keychains, where the set of keys combined together to produce a single P2SH multisignature address
optional bool isFollowing = 5;getIsFollowing in interface Protos.DeterministicKeyOrBuilderpublic Protos.DeterministicKey.Builder setIsFollowing(boolean value)
Flag indicating that this key is a root of a following chain. This chain is following the next non-following chain. Following/followed chains concept is used for married keychains, where the set of keys combined together to produce a single P2SH multisignature address
optional bool isFollowing = 5;public Protos.DeterministicKey.Builder clearIsFollowing()
Flag indicating that this key is a root of a following chain. This chain is following the next non-following chain. Following/followed chains concept is used for married keychains, where the set of keys combined together to produce a single P2SH multisignature address
optional bool isFollowing = 5;public boolean hasSigsRequiredToSpend()
Number of signatures required to spend. This field is needed only for married keychains to reconstruct KeyChain and represents the N value from N-of-M CHECKMULTISIG script. For regular single keychains it will always be 1.
optional uint32 sigsRequiredToSpend = 6 [default = 1];hasSigsRequiredToSpend in interface Protos.DeterministicKeyOrBuilderpublic int getSigsRequiredToSpend()
Number of signatures required to spend. This field is needed only for married keychains to reconstruct KeyChain and represents the N value from N-of-M CHECKMULTISIG script. For regular single keychains it will always be 1.
optional uint32 sigsRequiredToSpend = 6 [default = 1];getSigsRequiredToSpend in interface Protos.DeterministicKeyOrBuilderpublic Protos.DeterministicKey.Builder setSigsRequiredToSpend(int value)
Number of signatures required to spend. This field is needed only for married keychains to reconstruct KeyChain and represents the N value from N-of-M CHECKMULTISIG script. For regular single keychains it will always be 1.
optional uint32 sigsRequiredToSpend = 6 [default = 1];public Protos.DeterministicKey.Builder clearSigsRequiredToSpend()
Number of signatures required to spend. This field is needed only for married keychains to reconstruct KeyChain and represents the N value from N-of-M CHECKMULTISIG script. For regular single keychains it will always be 1.
optional uint32 sigsRequiredToSpend = 6 [default = 1];public final Protos.DeterministicKey.Builder setUnknownFields(com.google.protobuf.UnknownFieldSet unknownFields)
setUnknownFields in interface com.google.protobuf.Message.BuildersetUnknownFields in class com.google.protobuf.GeneratedMessageV3.Builder<Protos.DeterministicKey.Builder>public final Protos.DeterministicKey.Builder mergeUnknownFields(com.google.protobuf.UnknownFieldSet unknownFields)
mergeUnknownFields in interface com.google.protobuf.Message.BuildermergeUnknownFields in class com.google.protobuf.GeneratedMessageV3.Builder<Protos.DeterministicKey.Builder>