pub struct Blockchain {
pub sled_db: Db,
pub headers: HeaderStore,
pub blocks: BlockStore,
pub transactions: TxStore,
pub contracts: ContractStore,
}Expand description
Structure holding all sled trees that define the concept of Blockchain.
Fields§
§sled_db: DbMain pointer to the sled db connection
headers: HeaderStoreHeaders sled tree
blocks: BlockStoreBlocks sled tree
transactions: TxStoreTransactions related sled trees
contracts: ContractStoreContracts related sled trees
Implementations§
Source§impl Blockchain
impl Blockchain
Sourcepub fn add_block(&self, block: &BlockInfo) -> Result<HeaderHash>
pub fn add_block(&self, block: &BlockInfo) -> Result<HeaderHash>
Insert a given BlockInfo into the blockchain database.
This functions wraps all the logic of separating the block into specific
data that can be fed into the different trees of the database.
Upon success, the functions returns the block hash that
were given and appended to the ledger.
Sourcepub fn has_block(&self, block: &BlockInfo) -> Result<bool>
pub fn has_block(&self, block: &BlockInfo) -> Result<bool>
Check if the given BlockInfo is in the database and all trees.
Sourcepub fn get_blocks_by_hash(
&self,
hashes: &[HeaderHash],
) -> Result<Vec<BlockInfo>>
pub fn get_blocks_by_hash( &self, hashes: &[HeaderHash], ) -> Result<Vec<BlockInfo>>
Retrieve BlockInfos by given hashes. Fails if any of them is not found.
Sourcepub fn get_blocks_by_heights(&self, heights: &[u32]) -> Result<Vec<BlockInfo>>
pub fn get_blocks_by_heights(&self, heights: &[u32]) -> Result<Vec<BlockInfo>>
Retrieve BlockInfos by given heights. Does not fail if any of them are not found.
Sourcepub fn get_headers_by_hash(&self, hashes: &[HeaderHash]) -> Result<Vec<Header>>
pub fn get_headers_by_hash(&self, hashes: &[HeaderHash]) -> Result<Vec<Header>>
Retrieve Headers by given hashes. Fails if any of them is not found.
Sourcepub fn get_headers_by_heights(&self, heights: &[u32]) -> Result<Vec<Header>>
pub fn get_headers_by_heights(&self, heights: &[u32]) -> Result<Vec<Header>>
Retrieve Headers by given heights. Fails if any of them is not found.
Sourcepub fn get_headers_before(&self, height: u32, n: usize) -> Result<Vec<Header>>
pub fn get_headers_before(&self, height: u32, n: usize) -> Result<Vec<Header>>
Retrieve n headers before given block height.
Sourcepub fn genesis(&self) -> Result<(u32, HeaderHash)>
pub fn genesis(&self) -> Result<(u32, HeaderHash)>
Retrieve genesis (first) block height and hash.
Sourcepub fn genesis_block(&self) -> Result<BlockInfo>
pub fn genesis_block(&self) -> Result<BlockInfo>
Retrieve genesis (first) block info.
Sourcepub fn last(&self) -> Result<(u32, HeaderHash)>
pub fn last(&self) -> Result<(u32, HeaderHash)>
Retrieve the last block height and hash.
Sourcepub fn last_header(&self) -> Result<Header>
pub fn last_header(&self) -> Result<Header>
Retrieve the last block header.
Sourcepub fn last_block(&self) -> Result<BlockInfo>
pub fn last_block(&self) -> Result<BlockInfo>
Retrieve the last block info.
Sourcepub fn last_block_difficulty(&self) -> Result<BlockDifficulty>
pub fn last_block_difficulty(&self) -> Result<BlockDifficulty>
Retrieve the last block difficulty. If the tree is empty,
returns BlockDifficulty::genesis difficulty.
Sourcepub fn has_height(&self, height: u32) -> Result<bool>
pub fn has_height(&self, height: u32) -> Result<bool>
Check if block order for the given height is in the database.
Sourcepub fn add_pending_txs(
&self,
txs: &[Transaction],
) -> Result<Vec<TransactionHash>>
pub fn add_pending_txs( &self, txs: &[Transaction], ) -> Result<Vec<TransactionHash>>
Insert a given slice of pending transactions into the blockchain database. On success, the function returns the transaction hashes in the same order as the input transactions.
Sourcepub fn get_pending_txs(&self) -> Result<Vec<Transaction>>
pub fn get_pending_txs(&self) -> Result<Vec<Transaction>>
Retrieve all transactions from the pending tx store. Be careful as this will try to load everything in memory.
Sourcepub fn remove_pending_txs(&self, txs: &[Transaction]) -> Result<()>
pub fn remove_pending_txs(&self, txs: &[Transaction]) -> Result<()>
Remove a given slice of pending transactions from the blockchain database.
Sourcepub fn remove_pending_txs_hashes(&self, txs: &[TransactionHash]) -> Result<()>
pub fn remove_pending_txs_hashes(&self, txs: &[TransactionHash]) -> Result<()>
Remove a given slice of pending transactions hashes from the blockchain database.
Sourcefn atomic_write(&self, trees: &[Tree], batches: &[Batch]) -> Result<()>
fn atomic_write(&self, trees: &[Tree], batches: &[Batch]) -> Result<()>
Auxiliary function to write to multiple trees completely atomic.
Sourcepub fn get_all(&self) -> Result<Vec<BlockInfo>>
pub fn get_all(&self) -> Result<Vec<BlockInfo>>
Retrieve all blocks contained in the blockchain in order. Be careful as this will try to load everything in memory.
Sourcepub fn get_by_range(&self, start: u32, end: u32) -> Result<Vec<BlockInfo>>
pub fn get_by_range(&self, start: u32, end: u32) -> Result<Vec<BlockInfo>>
Retrieve BlockInfos by given heights range.
Sourcepub fn get_last_n(&self, n: usize) -> Result<Vec<BlockInfo>>
pub fn get_last_n(&self, n: usize) -> Result<Vec<BlockInfo>>
Retrieve last ‘N’ BlockInfos from the blockchain.
Sourcepub fn reset_to_height(&self, height: u32) -> Result<()>
pub fn reset_to_height(&self, height: u32) -> Result<()>
Auxiliary function to reset the blockchain and consensus state to the provided block height.
Sourcepub fn get_state_monotree(&self) -> Result<Monotree<MemoryDb>>
pub fn get_state_monotree(&self) -> Result<Monotree<MemoryDb>>
Generate a Monotree(SMT) containing all contracts states roots, along with the wasm bincodes monotree root.
Note: native contracts zkas tree and wasm bincodes are excluded.
Sourcepub fn get_randomx_vm_keys(
&self,
key_change_height: &u32,
key_change_delay: &u32,
height: Option<u32>,
) -> Result<(HeaderHash, HeaderHash)>
pub fn get_randomx_vm_keys( &self, key_change_height: &u32, key_change_delay: &u32, height: Option<u32>, ) -> Result<(HeaderHash, HeaderHash)>
Grab the RandomX VM current and next key, based on provided key changing height and delay. Optionally, a height can be provided to get the keys before it.
NOTE: the height calculation logic is verified using test:
Trait Implementations§
Source§impl Clone for Blockchain
impl Clone for Blockchain
Source§fn clone(&self) -> Blockchain
fn clone(&self) -> Blockchain
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreAuto Trait Implementations§
impl Freeze for Blockchain
impl !RefUnwindSafe for Blockchain
impl Send for Blockchain
impl Sync for Blockchain
impl Unpin for Blockchain
impl !UnwindSafe for Blockchain
Blanket Implementations§
§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
§type ArchivedMetadata = ()
type ArchivedMetadata = ()
§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
§impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
§impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<T> Conv for T
impl<T> Conv for T
§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>, which can then be
downcast into Box<dyn ConcreteType> where ConcreteType implements Trait.§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Rc<Trait> (where Trait: Downcast) to Rc<Any>, which can then be further
downcast into Rc<ConcreteType> where ConcreteType implements Trait.§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.§impl<T> DowncastSend for T
impl<T> DowncastSend for T
§impl<T> DowncastSync for T
impl<T> DowncastSync for T
§impl<T> FmtForward for T
impl<T> FmtForward for T
§fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
self to use its Binary implementation when Debug-formatted.§fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
self to use its Display implementation when
Debug-formatted.§fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
self to use its LowerExp implementation when
Debug-formatted.§fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
self to use its LowerHex implementation when
Debug-formatted.§fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
self to use its Octal implementation when Debug-formatted.§fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
self to use its Pointer implementation when
Debug-formatted.§fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
self to use its UpperExp implementation when
Debug-formatted.§fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
self to use its UpperHex implementation when
Debug-formatted.§fn fmt_list(self) -> FmtList<Self>where
&'a Self: for<'a> IntoIterator,
fn fmt_list(self) -> FmtList<Self>where
&'a Self: for<'a> IntoIterator,
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more§impl<T> LayoutRaw for T
impl<T> LayoutRaw for T
§fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
§impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2where
T: SharedNiching<N1, N2>,
N1: Niching<T>,
N2: Niching<T>,
impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2where
T: SharedNiching<N1, N2>,
N1: Niching<T>,
N2: Niching<T>,
§impl<T> Pipe for Twhere
T: ?Sized,
impl<T> Pipe for Twhere
T: ?Sized,
§fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
§fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
self and passes that borrow into the pipe function. Read more§fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
self and passes that borrow into the pipe function. Read more§fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
§fn pipe_borrow_mut<'a, B, R>(
&'a mut self,
func: impl FnOnce(&'a mut B) -> R,
) -> R
fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R, ) -> R
§fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
self, then passes self.as_ref() into the pipe function.§fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
self, then passes self.as_mut() into the pipe
function.§fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
self, then passes self.deref() into the pipe function.§impl<T> Pointable for T
impl<T> Pointable for T
§impl<T> Pointee for T
impl<T> Pointee for T
§impl<T> Tap for T
impl<T> Tap for T
§fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
Borrow<B> of a value. Read more§fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
BorrowMut<B> of a value. Read more§fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
AsRef<R> view of a value. Read more§fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
AsMut<R> view of a value. Read more§fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
Deref::Target of a value. Read more§fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
Deref::Target of a value. Read more§fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
.tap() only in debug builds, and is erased in release builds.§fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
.tap_mut() only in debug builds, and is erased in release
builds.§fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
.tap_borrow() only in debug builds, and is erased in release
builds.§fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
.tap_borrow_mut() only in debug builds, and is erased in release
builds.§fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
.tap_ref() only in debug builds, and is erased in release
builds.§fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
.tap_ref_mut() only in debug builds, and is erased in release
builds.§fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
.tap_deref() only in debug builds, and is erased in release
builds.