Struct InMemoryJournal 

pub struct InMemoryJournal { /* private fields */ }

Dev-only in-memory chain-signed journal.

entries is the ordered chain (walked by verify_chain / tip_hash); seen is a parallel token_hash set so is_duplicate (and therefore append’s replay guard) runs in O(1) instead of an O(n) scan per append.

Implementations

impl InMemoryJournal

pub fn new() -> Self

Empty journal.

pub fn entries(&self) -> &[JournalEntry]

Borrow the full entry list — read-only view for transparency-log publishers.

pub fn verify_chain_anchored( &self, trusted_pubkey: &[u8; 32], expected_tip: &[u8; 32], expected_len: usize, ) -> Result<(), JournalError>

Trust-anchored verification — the consumer-side check under an untrusted-producer threat model. Mirrors the kernel’s verify_chain_anchored: in addition to the self-consistency check run by verify_chain, it

• asserts every entry was signed under trusted_pubkey (rejects a forged log re-signed under an attacker key — JournalError::SignerKeyMismatch),
• asserts the chain tip equals expected_tip (JournalError::TipMismatch),
• asserts the entry count equals expected_len (JournalError::LengthMismatch — catches truncation / rollback).

verify_chain() alone is insufficient when the producer is untrusted: each entry validates against its OWN embedded signer_pubkey, so any keypair forges a self-consistent log.

Trait Implementations

impl Debug for InMemoryJournal

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for InMemoryJournal

fn default() -> InMemoryJournal

Returns the “default value” for a type.

impl PersistentJournal for InMemoryJournal

fn append( &mut self, token: ConsumedToken, signer: &dyn JournalSigner, ) -> Result<JournalEntry, JournalError>

Append a consumed token. Duplicate token_hash is rejected with JournalError::DuplicateToken. Success returns the newly-created entry so the caller can verify / publish it.

fn verify_chain(&self) -> Result<(), JournalError>

Self-consistency check only. Returns Ok(()) if every entry’s entry_hash matches its re-computation and every signature validates under the entry’s OWN embedded signer_pubkey; otherwise surfaces the first failing index.

fn tip_hash(&self) -> [u8; 32]

Last entry’s entry_hash, or GENESIS_PREV_HASH for an empty journal. Useful for external publishing (transparency log).

fn len(&self) -> usize

Count entries.

fn is_duplicate(&self, token_hash: &[u8; 32]) -> bool

Duplicate check — O(n) linear scan on in-memory, backend-specific on WAL-backed.

fn is_empty(&self) -> bool

Empty journal check.