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

Interface BlockInfoOrBuilder

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

  • Method Details

    • getLastBlockNumber

      long getLastBlockNumber()
       *
 A block number.
 <p>
 The block number of the last completed immutable block.
      int64 last_block_number = 1;
      Returns:
      The lastBlockNumber.

    • hasFirstConsTimeOfLastBlock

      boolean hasFirstConsTimeOfLastBlock()
       *
 A consensus timestamp.
 <p>
 The consensus time of the first transaction for the last completed immutable block.
      .proto.Timestamp first_cons_time_of_last_block = 2;
      Returns:
      Whether the firstConsTimeOfLastBlock field is set.

    • getFirstConsTimeOfLastBlock

      Timestamp getFirstConsTimeOfLastBlock()
       *
 A consensus timestamp.
 <p>
 The consensus time of the first transaction for the last completed immutable block.
      .proto.Timestamp first_cons_time_of_last_block = 2;
      Returns:
      The firstConsTimeOfLastBlock.

    • getBlockHashes

      com.google.protobuf.ByteString getBlockHashes()
       *
 A list of the last 256 block hashes.<br/>
 This is the SHA384 48 byte hashes of the previous 256 blocks,
 collected in a single byte array.
 <p>
 The first 48 bytes SHALL be the oldest block in the list.<br/>
 The last 48 bytes SHALL be the newest block, which is the last fully
 completed immutable block.<br/>
 This SHALL contain less than 256 block hashes if there are less than 256
 preceding blocks; for instance, shortly after network genesis the network
 will not have processed 256 blocks yet.
 <p>
 This MAY change significantly for Block Stream (HIP TBD).
      bytes block_hashes = 3;
      Returns:
      The blockHashes.

    • hasConsTimeOfLastHandledTxn

      boolean hasConsTimeOfLastHandledTxn()
       *
 A consensus timestamp.
 <p>
 The consensus time of the last transaction that was handled by the node
 within the current block. Only top-level transactions can trigger stake
 period side effects, so we track them separately from the last-used
 time of <i>all</i> transactions, which include children.<br/>
      .proto.Timestamp cons_time_of_last_handled_txn = 4;
      Returns:
      Whether the consTimeOfLastHandledTxn field is set.

    • getConsTimeOfLastHandledTxn

      Timestamp getConsTimeOfLastHandledTxn()
       *
 A consensus timestamp.
 <p>
 The consensus time of the last transaction that was handled by the node
 within the current block. Only top-level transactions can trigger stake
 period side effects, so we track them separately from the last-used
 time of <i>all</i> transactions, which include children.<br/>
      .proto.Timestamp cons_time_of_last_handled_txn = 4;
      Returns:
      The consTimeOfLastHandledTxn.

    • getMigrationRecordsStreamed

      boolean getMigrationRecordsStreamed()
       *
 A flag indicating that migration records have been published.
 <p>
 This property SHALL be `false` immediately following a node upgrade<br/>
 This SHALL be set 'true' as migration records, if any, are published.
 Migration records are typically published "during" the first transaction
 handled by the node following startup.
      bool migration_records_streamed = 5;
      Returns:
      The migrationRecordsStreamed.

    • hasFirstConsTimeOfCurrentBlock

      boolean hasFirstConsTimeOfCurrentBlock()
       *
 A consensus timestamp.
 <p>
 The consensus time of the first transaction in the current block;
 necessary for reconnecting nodes to detect when the current block
 is finished.
      .proto.Timestamp first_cons_time_of_current_block = 6;
      Returns:
      Whether the firstConsTimeOfCurrentBlock field is set.

    • getFirstConsTimeOfCurrentBlock

      Timestamp getFirstConsTimeOfCurrentBlock()
       *
 A consensus timestamp.
 <p>
 The consensus time of the first transaction in the current block;
 necessary for reconnecting nodes to detect when the current block
 is finished.
      .proto.Timestamp first_cons_time_of_current_block = 6;
      Returns:
      The firstConsTimeOfCurrentBlock.

    • hasLastUsedConsTime

      boolean hasLastUsedConsTime()
       *
 The consensus time of the last transaction that was handled by the node.
 <p>
 This property is how we 'advance the consensus clock'. The node MUST
 continually set this property to the consensus timestamp for the most
 recent transaction completed by the node.
      .proto.Timestamp last_used_cons_time = 7;
      Returns:
      Whether the lastUsedConsTime field is set.

    • getLastUsedConsTime

      Timestamp getLastUsedConsTime()
       *
 The consensus time of the last transaction that was handled by the node.
 <p>
 This property is how we 'advance the consensus clock'. The node MUST
 continually set this property to the consensus timestamp for the most
 recent transaction completed by the node.
      .proto.Timestamp last_used_cons_time = 7;
      Returns:
      The lastUsedConsTime.

    • 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 = 8;
      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 = 8;
      Returns:
      The lastIntervalProcessTime.

    • getPreviousWrappedRecordBlockRootHash

      com.google.protobuf.ByteString getPreviousWrappedRecordBlockRootHash()
       *
 The root hash of the previous wrapped record block.
      bytes previous_wrapped_record_block_root_hash = 10;
      Returns:
      The previousWrappedRecordBlockRootHash.

    • getWrappedIntermediatePreviousBlockRootHashesList

      List<com.google.protobuf.ByteString> getWrappedIntermediatePreviousBlockRootHashesList()
       *
 The intermediate hashes, calculated for all historical wrapped
 record blocks, needed for subroot 2 in the block merkle
 tree structure. These hashes SHALL include the minimum required
 wrapped record block root hashes needed to construct subroot 2's
 final state at the end of the previous block.
      repeated bytes wrapped_intermediate_previous_block_root_hashes = 11;
      Returns:
      A list containing the wrappedIntermediatePreviousBlockRootHashes.

    • getWrappedIntermediatePreviousBlockRootHashesCount

      int getWrappedIntermediatePreviousBlockRootHashesCount()
       *
 The intermediate hashes, calculated for all historical wrapped
 record blocks, needed for subroot 2 in the block merkle
 tree structure. These hashes SHALL include the minimum required
 wrapped record block root hashes needed to construct subroot 2's
 final state at the end of the previous block.
      repeated bytes wrapped_intermediate_previous_block_root_hashes = 11;
      Returns:
      The count of wrappedIntermediatePreviousBlockRootHashes.

    • getWrappedIntermediatePreviousBlockRootHashes

      com.google.protobuf.ByteString getWrappedIntermediatePreviousBlockRootHashes(int index)
       *
 The intermediate hashes, calculated for all historical wrapped
 record blocks, needed for subroot 2 in the block merkle
 tree structure. These hashes SHALL include the minimum required
 wrapped record block root hashes needed to construct subroot 2's
 final state at the end of the previous block.
      repeated bytes wrapped_intermediate_previous_block_root_hashes = 11;
      Parameters:
      index - The index of the element to return.
      Returns:
      The wrappedIntermediatePreviousBlockRootHashes at the given index.

    • getWrappedIntermediateBlockRootsLeafCount

      long getWrappedIntermediateBlockRootsLeafCount()
       *
 The number of leaves in the intermediate wrapped record block
 roots subtree.
      uint64 wrapped_intermediate_block_roots_leaf_count = 12;
      Returns:
      The wrappedIntermediateBlockRootsLeafCount.