pub(crate) struct InitAffidavitKey<T: Config> {
pub at: BlockNumberFor<T>,
}Expand description
Operational context for affidavit key initialization.
This type represents the contextual information required to initialize or recover an affidavit key during the key lifecycle.
Affidavit keys are ephemeral, operational keys that are rotated independently of long-term authority, stash, or consensus keys. Initialization may execute sequentially multiple times as a looped routine (e.g. via offchain workers), and therefore requires an explicit, lightweight context object.
§Notes
- This is not a transaction payload.
- This type is never submitted on-chain.
- It is used internally during:
- affidavit key generation
- key recovery
- keystore initialization or repair
§Fork Awareness
- The
atfield captures the block number at which the initialization process begins. - When executed via offchain workers, this context must tolerate forks, re-orgs, and speculative execution.
- Implementors are responsible for ensuring idempotency and re-entrancy safety.
§Initialization Flow
The process repeatedly attempts to resolve a affidavit key-pair. It self-heals by creating and inserting keys when missing, and retries on missing or error states until a consistent state is reached.
§Pseudocode
loop {
// Fetch the tagged active affidavit from offchain storage
match offchain_storage.fetch_active_affidavit() {
Ok(None) => {
// No active-tagged affidavit-key exists -> create a new key-pair locally
keystore.create_affidavit_key();
// Publish the key reference to offchain storage
offchain_storage.insert_affidavit_key();
continue;
}
Ok(Some(affidavit)) => {
// A active-tagged affidavit exists -> ensure the local key-pair is present
match keystore.get_affidavit_key() {
Some(key) => break key,
None => {
// Storage provided public key, but its actual key-pair
// is missing locally -> repair
keystore.create_affidavit_key();
continue;
}
}
}
Ok(Some(_other_status)) => continue,
Err(_storage_error) => continue, // transient storage error -> retry
}
}§Guarantee
This process yields an active affidavit key only when its tagged/referenced via an offchain storage and its corresponding the key-pair exists in the local keystore. Otherwise, it creates/repairs the key and keeps retrying until the affidavit becomes tagged and the keystore is consistent.
loop {
if offchain_storage.has_affidavit_key()
&& keystore.has_affidavit_key()
{
break;
}
keystore.create_or_repair_affidavit_key();
offchain_storage.ensure_affidavit_key_reference();
// retry until next key reaches consistency
}All behavior is supplied by trait implementations operating on this type.
§FlowChart
Fields§
§at: BlockNumberFor<T>Block number at which affidavit key initialization begins.
Used for logging, diagnostics, and fork-aware coordination.
Trait Implementations§
Source§impl<T: Clone + Config> Clone for InitAffidavitKey<T>
impl<T: Clone + Config> Clone for InitAffidavitKey<T>
Source§fn clone(&self) -> InitAffidavitKey<T>
fn clone(&self) -> InitAffidavitKey<T>
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreSource§impl<T: Config> Decode for InitAffidavitKey<T>where
BlockNumberFor<T>: Decode,
impl<T: Config> Decode for InitAffidavitKey<T>where
BlockNumberFor<T>: Decode,
Source§fn decode<__CodecInputEdqy: Input>(
__codec_input_edqy: &mut __CodecInputEdqy,
) -> Result<Self, Error>
fn decode<__CodecInputEdqy: Input>( __codec_input_edqy: &mut __CodecInputEdqy, ) -> Result<Self, Error>
§fn decode_into<I>(
input: &mut I,
dst: &mut MaybeUninit<Self>,
) -> Result<DecodeFinished, Error>where
I: Input,
fn decode_into<I>(
input: &mut I,
dst: &mut MaybeUninit<Self>,
) -> Result<DecodeFinished, Error>where
I: Input,
§fn skip<I>(input: &mut I) -> Result<(), Error>where
I: Input,
fn skip<I>(input: &mut I) -> Result<(), Error>where
I: Input,
§fn encoded_fixed_size() -> Option<usize>
fn encoded_fixed_size() -> Option<usize>
Source§impl<T: Config> Encode for InitAffidavitKey<T>where
BlockNumberFor<T>: Encode,
impl<T: Config> Encode for InitAffidavitKey<T>where
BlockNumberFor<T>: Encode,
Source§fn size_hint(&self) -> usize
fn size_hint(&self) -> usize
Source§fn encode_to<__CodecOutputEdqy: Output + ?Sized>(
&self,
__codec_dest_edqy: &mut __CodecOutputEdqy,
)
fn encode_to<__CodecOutputEdqy: Output + ?Sized>( &self, __codec_dest_edqy: &mut __CodecOutputEdqy, )
Source§fn using_encoded<__CodecOutputReturn, __CodecUsingEncodedCallback: FnOnce(&[u8]) -> __CodecOutputReturn>(
&self,
f: __CodecUsingEncodedCallback,
) -> __CodecOutputReturn
fn using_encoded<__CodecOutputReturn, __CodecUsingEncodedCallback: FnOnce(&[u8]) -> __CodecOutputReturn>( &self, f: __CodecUsingEncodedCallback, ) -> __CodecOutputReturn
§fn encoded_size(&self) -> usize
fn encoded_size(&self) -> usize
Source§impl<T: Config> FinalizedOffchainStorageError<T, <T as Config>::AccountId> for InitAffidavitKey<T>
Invariant enforcement for finalized offchain storage.
impl<T: Config> FinalizedOffchainStorageError<T, <T as Config>::AccountId> for InitAffidavitKey<T>
Invariant enforcement for finalized offchain storage.
This implementation defines errors for high-level coordination failures between speculative and persistent storage layers.
Cleanups will be implicitly handled by the storage itself.
Source§fn hanging_hash() -> Self::Error
fn hanging_hash() -> Self::Error
A speculative hash must not exist without a corresponding persistent value.
Source§fn hanging_value() -> Self::Error
fn hanging_value() -> Self::Error
A persistent value must not exist without holding its corresponding speculative hash’s value.
Source§impl<T: Config> FinalizedPolicy<T> for InitAffidavitKey<T>
This policy defines when a finalized offchain storage value
is considered safe for irreversible side effects, such as:
impl<T: Config> FinalizedPolicy<T> for InitAffidavitKey<T>
This policy defines when a finalized offchain storage value is considered safe for irreversible side effects, such as:
- key promotion,
- state transitions,
- or cleanup of speculative storage.
The policy is consumed by the Finalized storage abstraction
in conjunction with Confidence to determine optimal-finality.
Source§fn finality_after() -> <T as Config>::Moment
fn finality_after() -> <T as Config>::Moment
Returns the wall-clock time after which a value is considered final.
Source§fn finality_ticks() -> BlockNumberFor<T>
fn finality_ticks() -> BlockNumberFor<T>
Returns the number of block confirmations required to reach finality after the wall-clock time reached.
Source§impl<T: Config> MaxEncodedLen for InitAffidavitKey<T>where
BlockNumberFor<T>: MaxEncodedLen,
impl<T: Config> MaxEncodedLen for InitAffidavitKey<T>where
BlockNumberFor<T>: MaxEncodedLen,
Source§fn max_encoded_len() -> usize
fn max_encoded_len() -> usize
Source§impl<T: Config> OffchainStorageError<ForkAware<T, ValueHash, InitAffidavitKey<T>, Pallet<T>>> for InitAffidavitKey<T>
Error mapping for fork-aware speculative storage access
during affidavit key initialization.
impl<T: Config> OffchainStorageError<ForkAware<T, ValueHash, InitAffidavitKey<T>, Pallet<T>>> for InitAffidavitKey<T>
Error mapping for fork-aware speculative storage access during affidavit key initialization.
This implementation provides pallet-specific error variants
expected to be convertible into DispatchError.
§Scope
- Applies to speculative, fork-aware storage keyed by a hash.
- Focuses on failures related to the speculative hash of the finalized affidavit key value.
Source§impl<T: Config> OffchainStorageError<Persistent<T, Ledger<T, <T as Config>::AccountId>, InitAffidavitKey<T>>> for InitAffidavitKey<T>
Error mapping for persistent finalized offchain storage
during affidavit key initialization.
impl<T: Config> OffchainStorageError<Persistent<T, Ledger<T, <T as Config>::AccountId>, InitAffidavitKey<T>>> for InitAffidavitKey<T>
Error mapping for persistent finalized offchain storage during affidavit key initialization.
This implementation handles failures when interacting with the
persistent ledger that stores finalized affidavit key values,
wrapped in Confidence to reflect finality guarantees.
§Scope
- Applies to persistent, non-speculative storage.
- Covers decoding and concurrent mutation failures.
Source§impl<T: Config> Routines<<<<T as Config>::Block as HeaderProvider>::HeaderT as Header>::Number> for InitAffidavitKey<T>
An Offchain Worker (OCW) routine responsible for initializing the
active affidavit key for the local node.
impl<T: Config> Routines<<<<T as Config>::Block as HeaderProvider>::HeaderT as Header>::Number> for InitAffidavitKey<T>
An Offchain Worker (OCW) routine responsible for initializing the active affidavit key for the local node.
This routine bootstraps an affidavit application key per node, regardless of whether the node is acting as an author i.e., validator node.
The affidavit key is a rotated operational key used exclusively for affidavit-related signing. Only a single affidavit key is expected to be active at any given time, and the runtime relies on this invariant being upheld.
Source§fn can_run(&self) -> Result<(), Self::Logger>
fn can_run(&self) -> Result<(), Self::Logger>
Determines whether the affidavit key initialization routine should run.
Initialization must not run if:
- an active affidavit key is already stored in the offchain storage, and
- the corresponding key pair exists in the node’s affidavit keystore (app crypto).
Any storage inconsistency (e.g. corrupted or undecodable data) is treated as a hard stop and causes the routine to refuse execution, since proceeding could violate runtime expectations.
Source§fn run_service(&self) -> Result<(), Self::Logger>
fn run_service(&self) -> Result<(), Self::Logger>
Initializes a new affidavit key pair and marks it as the active affidavit key for the node.
This routine:
- Generates a new affidavit application key pair in the local keystore.
- Extracts the public key and derives its corresponding
AffidavitId. - Stores the public identifier as the active affidavit key in the offchain storage.
Affidavit keys are rotated regularly (e.g. per session). The node’s long-term authority or author role i.e., stash key is never used directly for affidavit signing, reducing operational risk.
If storing the active affidavit key fails, the generated key pair becomes unreachable and is effectively discarded. The routine will retry on subsequent block OCW executions until initialization succeeds.
Source§fn on_ran_service(&self)
fn on_ran_service(&self)
Logs a info message on a successful InitAffidavitKey routine.
Source§impl<T> TypeInfo for InitAffidavitKey<T>where
BlockNumberFor<T>: TypeInfo + 'static,
T: Config + 'static,
impl<T> TypeInfo for InitAffidavitKey<T>where
BlockNumberFor<T>: TypeInfo + 'static,
T: Config + 'static,
impl<T: Config> EncodeLike for InitAffidavitKey<T>where
BlockNumberFor<T>: Encode,
impl<T: Eq + Config> Eq for InitAffidavitKey<T>
impl<T: Config> StructuralPartialEq for InitAffidavitKey<T>
Auto Trait Implementations§
impl<T> Freeze for InitAffidavitKey<T>where
<<<T as Config>::Block as Block>::Header as Header>::Number: Freeze,
impl<T> RefUnwindSafe for InitAffidavitKey<T>where
<<<T as Config>::Block as Block>::Header as Header>::Number: RefUnwindSafe,
impl<T> Send for InitAffidavitKey<T>
impl<T> Sync for InitAffidavitKey<T>
impl<T> Unpin for InitAffidavitKey<T>where
<<<T as Config>::Block as Block>::Header as Header>::Number: Unpin,
impl<T> UnwindSafe for InitAffidavitKey<T>where
<<<T as Config>::Block as Block>::Header as Header>::Number: UnwindSafe,
Blanket Implementations§
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
§impl<T> CheckedConversion for T
impl<T> CheckedConversion for T
§fn checked_from<T>(t: T) -> Option<Self>where
Self: TryFrom<T>,
fn checked_from<T>(t: T) -> Option<Self>where
Self: TryFrom<T>,
§fn checked_into<T>(self) -> Option<T>where
Self: TryInto<T>,
fn checked_into<T>(self) -> Option<T>where
Self: TryInto<T>,
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<T> DecodeAll for Twhere
T: Decode,
impl<T> DecodeAll for Twhere
T: Decode,
§fn decode_all(input: &mut &[u8]) -> Result<T, Error>
fn decode_all(input: &mut &[u8]) -> Result<T, Error>
Self and consume all of the given input data. Read more§impl<T> DecodeLimit for Twhere
T: Decode,
impl<T> DecodeLimit for Twhere
T: Decode,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
§impl<T> Hashable for Twhere
T: Codec,
impl<T> Hashable for Twhere
T: Codec,
§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 moreSource§impl<T, U, Tag> IntoTag<U, Tag> for Twhere
U: FromTag<T, Tag>,
Tag: DiscriminantTag,
impl<T, U, Tag> IntoTag<U, Tag> for Twhere
U: FromTag<T, Tag>,
Tag: DiscriminantTag,
§impl<Src, Dest> IntoTuple<Dest> for Srcwhere
Dest: FromTuple<Src>,
impl<Src, Dest> IntoTuple<Dest> for Srcwhere
Dest: FromTuple<Src>,
fn into_tuple(self) -> Dest
§impl<T> IsType<T> for T
impl<T> IsType<T> for T
§impl<T, Outer> IsWrappedBy<Outer> for T
impl<T, Outer> IsWrappedBy<Outer> for T
§impl<T> KeyedVec for Twhere
T: Codec,
impl<T> KeyedVec for Twhere
T: Codec,
Source§impl<T, Time> Logging<Time> for Twhere
Time: Time,
impl<T, Time> Logging<Time> for Twhere
Time: Time,
Source§const FALLBACK_TARGET: &'static str = "routine"
const FALLBACK_TARGET: &'static str = "routine"
Default logging target if none is provided.
Most routines, especially offchain workers or background tasks, use this target for simplicity.
It allows a consistent place to look for routine logs without requiring every call to specify a target.
Note: This target is only a conveninence and may be somewhat vague. To ensure errors can still be traced accurately, the logged messages should include additional metadata (e.g., module name, error index, or contextual info) so that the source of the error can be identified even if the target is generic.
Source§type Logger = DispatchError
type Logger = DispatchError
The type taken and returned for logging.
We simply return the same [DispatchError] that was logged,
so logging does not change control flow or error propagation.
DispatchError is used because in Substrate it encompasses all
runtime errors - including module errors, token errors, arithmetic
issues, and transactional boundaries - making it the universal
substrate-side error representation.
Source§type Level = LogLevel
type Level = LogLevel
The log level type.
We use the LogLevel enum to standardize severity levels
(Info, Warn, Error, Debug) across all routine logs.
Source§fn log(
level: <T as Logging<Time>>::Level,
err: &<T as Logging<Time>>::Logger,
timestamp: Time,
target: Option<&str>,
fmt: Option<fn(Time, &<T as Logging<Time>>::Level, &str, &str) -> String>,
) -> <T as Logging<Time>>::Logger
fn log( level: <T as Logging<Time>>::Level, err: &<T as Logging<Time>>::Logger, timestamp: Time, target: Option<&str>, fmt: Option<fn(Time, &<T as Logging<Time>>::Level, &str, &str) -> String>, ) -> <T as Logging<Time>>::Logger
Source§fn info(
err: &Self::Logger,
timestamp: Timestamp,
target: Option<&str>,
fmt: Option<fn(Timestamp, &Self::Level, &str, &str) -> String>,
) -> Self::Loggerwhere
Self: Sized,
fn info(
err: &Self::Logger,
timestamp: Timestamp,
target: Option<&str>,
fmt: Option<fn(Timestamp, &Self::Level, &str, &str) -> String>,
) -> Self::Loggerwhere
Self: Sized,
Source§fn warn(
err: &Self::Logger,
timestamp: Timestamp,
target: Option<&str>,
fmt: Option<fn(Timestamp, &Self::Level, &str, &str) -> String>,
) -> Self::Loggerwhere
Self: Sized,
fn warn(
err: &Self::Logger,
timestamp: Timestamp,
target: Option<&str>,
fmt: Option<fn(Timestamp, &Self::Level, &str, &str) -> String>,
) -> Self::Loggerwhere
Self: Sized,
§impl<T> SaturatedConversion for T
impl<T> SaturatedConversion for T
§fn saturated_from<T>(t: T) -> Selfwhere
Self: UniqueSaturatedFrom<T>,
fn saturated_from<T>(t: T) -> Selfwhere
Self: UniqueSaturatedFrom<T>,
§fn saturated_into<T>(self) -> Twhere
Self: UniqueSaturatedInto<T>,
fn saturated_into<T>(self) -> Twhere
Self: UniqueSaturatedInto<T>,
T. Read more§impl<T, U> TryIntoKey<U> for Twhere
U: TryFromKey<T>,
impl<T, U> TryIntoKey<U> for Twhere
U: TryFromKey<T>,
type Error = <U as TryFromKey<T>>::Error
fn try_into_key(self) -> Result<U, <U as TryFromKey<T>>::Error>
§impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
§fn unchecked_into(self) -> T
fn unchecked_into(self) -> T
unchecked_from.§impl<T, S> UniqueSaturatedInto<T> for S
impl<T, S> UniqueSaturatedInto<T> for S
§fn unique_saturated_into(self) -> T
fn unique_saturated_into(self) -> T
T.