Module com.hedera.hashgraph.sdk
Package com.hedera.hashgraph.sdk.proto

Interface BlockStreamInfoOrBuilder

All Superinterfaces:
com.google.protobuf.MessageLiteOrBuilder
All Known Implementing Classes:
BlockStreamInfo, BlockStreamInfo.Builder
@Generated public interface BlockStreamInfoOrBuilder extends com.google.protobuf.MessageLiteOrBuilder

  • Method Summary

    Modifier and Type
    Method
    Description
    Timestamp
    getBlockEndTime()
    * A block-end consensus time stamp.
    long
    getBlockNumber()
    * A block number.<br/> This is the current block number.
    Timestamp
    getBlockTime()
    * A consensus time for the current block.<br/> This is the consensus time of the first round in the current block, which equates to the first contained transaction's consensus time.
    com.google.protobuf.ByteString
    getConsensusHeaderRootHash()
    * A SHA2-384 hash value.<br/> This is the final hash of the "consensus headers" subtree for this block.
    SemanticVersion
    getCreationSoftwareVersion()
    * A version describing the version of application software.
    com.google.protobuf.ByteString
    getInputTreeRootHash()
    * A SHA2-384 hash value.<br/> This is the final hash of the "input" subtree for this block.
    long
    getIntermediateBlockRootsLeafCount()
    * The number of leaves in the intermediate block roots subtree.
    com.google.protobuf.ByteString
    getIntermediatePreviousBlockRootHashes(int index)
    * The intermediate hashes needed for subroot 2 in the block merkle tree structure.
    int
    getIntermediatePreviousBlockRootHashesCount()
    * The intermediate hashes needed for subroot 2 in the block merkle tree structure.
    List<com.google.protobuf.ByteString>
    getIntermediatePreviousBlockRootHashesList()
    * The intermediate hashes needed for subroot 2 in the block merkle tree structure.
    Timestamp
    getLastHandleTime()
    * The time stamp at which the last user transaction was handled.
    Timestamp
    getLastIntervalProcessTime()
    * The time stamp at which the last interval process was done.
    long
    getNumPrecedingStateChangesItems()
    * A count of "state change" block items in this block.
    com.google.protobuf.ByteString
    getOutputItemRootHash()
    * A SHA2-384 hash value.<br/> This is the final hash of the "output" subtree for this block.
    boolean
    getPostUpgradeWorkDone()
    * Whether the post-upgrade work has been done.
    com.google.protobuf.ByteString
    getRightmostPrecedingStateChangesTreeHashes(int index)
    * A concatenation of SHA2-384 hash values.<br/> This is the "rightmost" values of the "output" subtree.
    int
    getRightmostPrecedingStateChangesTreeHashesCount()
    * A concatenation of SHA2-384 hash values.<br/> This is the "rightmost" values of the "output" subtree.
    List<com.google.protobuf.ByteString>
    getRightmostPrecedingStateChangesTreeHashesList()
    * A concatenation of SHA2-384 hash values.<br/> This is the "rightmost" values of the "output" subtree.
    com.google.protobuf.ByteString
    getStartOfBlockStateHash()
    * A SHA2-384 hash value.<br/> This is the hash of consensus state at the _start_ of this block.
    com.google.protobuf.ByteString
    getTraceDataRootHash()
    * A SHA2-384 hash value.<br/> This is the final hash of the "trace data" subtree for this block.
    com.google.protobuf.ByteString
    getTrailingBlockHashes()
    * A concatenation of hash values.<br/> This field combines up to 256 trailing block hashes.
    com.google.protobuf.ByteString
    getTrailingOutputHashes()
    * A concatenation of hash values.<br/> This combines several trailing output block item hashes and is used as a seed value for a pseudo-random number generator.<br/> This is also required to implement the EVM `PREVRANDAO` opcode.<br/> This MUST contain at least 256 bits of entropy.
    boolean
    hasBlockEndTime()
    * A block-end consensus time stamp.
    boolean
    hasBlockTime()
    * A consensus time for the current block.<br/> This is the consensus time of the first round in the current block, which equates to the first contained transaction's consensus time.
    boolean
    hasCreationSoftwareVersion()
    * A version describing the version of application software.
    boolean
    hasLastHandleTime()
    * The time stamp at which the last user transaction was handled.
    boolean
    hasLastIntervalProcessTime()
    * The time stamp at which the last interval process was done.

    Methods inherited from interface com.google.protobuf.MessageLiteOrBuilder

    getDefaultInstanceForType, isInitialized

  • Method Details

    • getBlockNumber

      long getBlockNumber()
       *
 A block number.<br/>
 This is the current block number.
      uint64 block_number = 1;
      Returns:
      The blockNumber.

    • hasBlockTime

      boolean hasBlockTime()
       *
 A consensus time for the current block.<br/>
 This is the consensus time of the first round in the current block,
 which equates to the first contained transaction's consensus time.
 It is used to determine if this block was the first across an
 important boundary in consensus time, such as UTC midnight.
 This may also be used to purge entities expiring between the last
 block time and this time.
      .proto.Timestamp block_time = 2;
      Returns:
      Whether the blockTime field is set.

    • getBlockTime

      Timestamp getBlockTime()
       *
 A consensus time for the current block.<br/>
 This is the consensus time of the first round in the current block,
 which equates to the first contained transaction's consensus time.
 It is used to determine if this block was the first across an
 important boundary in consensus time, such as UTC midnight.
 This may also be used to purge entities expiring between the last
 block time and this time.
      .proto.Timestamp block_time = 2;
      Returns:
      The blockTime.

    • getTrailingOutputHashes

      com.google.protobuf.ByteString getTrailingOutputHashes()
       *
 A concatenation of hash values.<br/>
 This combines several trailing output block item hashes and
 is used as a seed value for a pseudo-random number generator.<br/>
 This is also required to implement the EVM `PREVRANDAO` opcode.<br/>
 This MUST contain at least 256 bits of entropy.
      bytes trailing_output_hashes = 3;
      Returns:
      The trailingOutputHashes.

    • getTrailingBlockHashes

      com.google.protobuf.ByteString getTrailingBlockHashes()
       *
 A concatenation of hash values.<br/>
 This field combines up to 256 trailing block hashes.
 <p>
 If this message is for block number N, then the earliest available
 hash SHALL be for block number N-256.<br/>
 The latest available hash SHALL be for block N-1.<br/>
 This is REQUIRED to implement the EVM `BLOCKHASH` opcode.
 <p>
 ### Field Length
 Each hash value SHALL be the trailing 265 bits of a SHA2-384 hash.<br/>
 The length of this field SHALL be an integer multiple of 32 bytes.<br/>
 This field SHALL be at least 32 bytes.<br/>
 The maximum length of this field SHALL be 8192 bytes.
      bytes trailing_block_hashes = 4;
      Returns:
      The trailingBlockHashes.

    • getInputTreeRootHash

      com.google.protobuf.ByteString getInputTreeRootHash()
       *
 A SHA2-384 hash value.<br/>
 This is the final hash of the "input" subtree for this block.
      bytes input_tree_root_hash = 5;
      Returns:
      The inputTreeRootHash.

    • getStartOfBlockStateHash

      com.google.protobuf.ByteString getStartOfBlockStateHash()
       *
 A SHA2-384 hash value.<br/>
 This is the hash of consensus state at the _start_ of this block.
      bytes start_of_block_state_hash = 6;
      Returns:
      The startOfBlockStateHash.

    • getNumPrecedingStateChangesItems

      long getNumPrecedingStateChangesItems()
       *
 A count of "state change" block items in this block.
 <p>
 This SHALL count the number of state change block items that _precede_
 the state change that updates this singleton.
      uint64 num_preceding_state_changes_items = 7;
      Returns:
      The numPrecedingStateChangesItems.

    • getRightmostPrecedingStateChangesTreeHashesList

      List<com.google.protobuf.ByteString> getRightmostPrecedingStateChangesTreeHashesList()
       *
 A concatenation of SHA2-384 hash values.<br/>
 This is the "rightmost" values of the "output" subtree.
 <p>
 The subtree containing these hashes SHALL be constructed from all "output"
 `BlockItem`s in this block that _precede_ the update to this singleton.
      repeated bytes rightmost_preceding_state_changes_tree_hashes = 8;
      Returns:
      A list containing the rightmostPrecedingStateChangesTreeHashes.

    • getRightmostPrecedingStateChangesTreeHashesCount

      int getRightmostPrecedingStateChangesTreeHashesCount()
       *
 A concatenation of SHA2-384 hash values.<br/>
 This is the "rightmost" values of the "output" subtree.
 <p>
 The subtree containing these hashes SHALL be constructed from all "output"
 `BlockItem`s in this block that _precede_ the update to this singleton.
      repeated bytes rightmost_preceding_state_changes_tree_hashes = 8;
      Returns:
      The count of rightmostPrecedingStateChangesTreeHashes.

    • getRightmostPrecedingStateChangesTreeHashes

      com.google.protobuf.ByteString getRightmostPrecedingStateChangesTreeHashes(int index)
       *
 A concatenation of SHA2-384 hash values.<br/>
 This is the "rightmost" values of the "output" subtree.
 <p>
 The subtree containing these hashes SHALL be constructed from all "output"
 `BlockItem`s in this block that _precede_ the update to this singleton.
      repeated bytes rightmost_preceding_state_changes_tree_hashes = 8;
      Parameters:
      index - The index of the element to return.
      Returns:
      The rightmostPrecedingStateChangesTreeHashes at the given index.

    • hasBlockEndTime

      boolean hasBlockEndTime()
       *
 A block-end consensus time stamp.
 <p>
 This field SHALL hold the last-used consensus time for
 the current block.
      .proto.Timestamp block_end_time = 9;
      Returns:
      Whether the blockEndTime field is set.

    • getBlockEndTime

      Timestamp getBlockEndTime()
       *
 A block-end consensus time stamp.
 <p>
 This field SHALL hold the last-used consensus time for
 the current block.
      .proto.Timestamp block_end_time = 9;
      Returns:
      The blockEndTime.

    • getPostUpgradeWorkDone

      boolean getPostUpgradeWorkDone()
       *
 Whether the post-upgrade work has been done.
 <p>
 This MUST be false if and only if the network just restarted
 after an upgrade and has not yet done the post-upgrade work.
      bool post_upgrade_work_done = 10;
      Returns:
      The postUpgradeWorkDone.

    • hasCreationSoftwareVersion

      boolean hasCreationSoftwareVersion()
       *
 A version describing the version of application software.
 <p>
 This SHALL be the software version that created this block.
      .proto.SemanticVersion creation_software_version = 11;
      Returns:
      Whether the creationSoftwareVersion field is set.

    • getCreationSoftwareVersion

      SemanticVersion getCreationSoftwareVersion()
       *
 A version describing the version of application software.
 <p>
 This SHALL be the software version that created this block.
      .proto.SemanticVersion creation_software_version = 11;
      Returns:
      The creationSoftwareVersion.

    • hasLastIntervalProcessTime

      boolean hasLastIntervalProcessTime()
       *
 The time stamp at which the last interval process was done.
 <p>
 This field SHALL hold the consensus time for the last time
 at which an interval of time-dependent events were processed.
      .proto.Timestamp last_interval_process_time = 12;
      Returns:
      Whether the lastIntervalProcessTime field is set.

    • getLastIntervalProcessTime

      Timestamp getLastIntervalProcessTime()
       *
 The time stamp at which the last interval process was done.
 <p>
 This field SHALL hold the consensus time for the last time
 at which an interval of time-dependent events were processed.
      .proto.Timestamp last_interval_process_time = 12;
      Returns:
      The lastIntervalProcessTime.

    • hasLastHandleTime

      boolean hasLastHandleTime()
       *
 The time stamp at which the last user transaction was handled.
 <p>
 This field SHALL hold the consensus time for the last time
 at which a user transaction was handled.
      .proto.Timestamp last_handle_time = 13;
      Returns:
      Whether the lastHandleTime field is set.

    • getLastHandleTime

      Timestamp getLastHandleTime()
       *
 The time stamp at which the last user transaction was handled.
 <p>
 This field SHALL hold the consensus time for the last time
 at which a user transaction was handled.
      .proto.Timestamp last_handle_time = 13;
      Returns:
      The lastHandleTime.

    • getConsensusHeaderRootHash

      com.google.protobuf.ByteString getConsensusHeaderRootHash()
       *
 A SHA2-384 hash value.<br/>
 This is the final hash of the "consensus headers" subtree for this block.
      bytes consensus_header_root_hash = 14;
      Returns:
      The consensusHeaderRootHash.

    • getOutputItemRootHash

      com.google.protobuf.ByteString getOutputItemRootHash()
       *
 A SHA2-384 hash value.<br/>
 This is the final hash of the "output" subtree for this block.
      bytes output_item_root_hash = 15;
      Returns:
      The outputItemRootHash.

    • getTraceDataRootHash

      com.google.protobuf.ByteString getTraceDataRootHash()
       *
 A SHA2-384 hash value.<br/>
 This is the final hash of the "trace data" subtree for this block.
      bytes trace_data_root_hash = 16;
      Returns:
      The traceDataRootHash.

    • getIntermediatePreviousBlockRootHashesList

      List<com.google.protobuf.ByteString> getIntermediatePreviousBlockRootHashesList()
       *
 The intermediate hashes needed for subroot 2 in the block merkle
 tree structure. These hashes SHALL include the minimum required
 block root hashes needed to construct subroot 2's final state at
 the end of the previous block.
      repeated bytes intermediate_previous_block_root_hashes = 17;
      Returns:
      A list containing the intermediatePreviousBlockRootHashes.

    • getIntermediatePreviousBlockRootHashesCount

      int getIntermediatePreviousBlockRootHashesCount()
       *
 The intermediate hashes needed for subroot 2 in the block merkle
 tree structure. These hashes SHALL include the minimum required
 block root hashes needed to construct subroot 2's final state at
 the end of the previous block.
      repeated bytes intermediate_previous_block_root_hashes = 17;
      Returns:
      The count of intermediatePreviousBlockRootHashes.

    • getIntermediatePreviousBlockRootHashes

      com.google.protobuf.ByteString getIntermediatePreviousBlockRootHashes(int index)
       *
 The intermediate hashes needed for subroot 2 in the block merkle
 tree structure. These hashes SHALL include the minimum required
 block root hashes needed to construct subroot 2's final state at
 the end of the previous block.
      repeated bytes intermediate_previous_block_root_hashes = 17;
      Parameters:
      index - The index of the element to return.
      Returns:
      The intermediatePreviousBlockRootHashes at the given index.

    • getIntermediateBlockRootsLeafCount

      long getIntermediateBlockRootsLeafCount()
       *
 The number of leaves in the intermediate block roots subtree.
      uint64 intermediate_block_roots_leaf_count = 18;
      Returns:
      The intermediateBlockRootsLeafCount.