Skip to main content

HistoryTape

Struct HistoryTape 

Source
pub struct HistoryTape { /* private fields */ }
Expand description

The append-forward / pop-backward garbage tape of a recording forward run. TWO stacks:

• entries — the erased-DATA deltas (register/global overwrites, output lines). These are the Landauer garbage; HistoryTape::erased_bytes/HistoryTape::len count them, and they are EMPTY for an all-abelian run. • steps — the executed program-counter trace (one entry per executed op), the control skeleton. Reverse execution walks it backward to replay the exact executed path — branches and loops fall out for free (a loop is just the trace with repeated pcs). This is control overhead (re-derivable by re-running forward, so zero erased DATA and Bennett-uncomputable), NOT part of the erased-bit count.

Implementations§

Source§

impl HistoryTape

Source

pub fn new() -> Self

A fresh, empty tape.

Source

pub fn push(&mut self, entry: JournalEntry)

Append an erased-data delta (forward execution).

Source

pub fn pop(&mut self) -> Option<JournalEntry>

Pop the most recent erased-data delta (reverse execution).

Source

pub fn push_step(&mut self, pc: usize, base: usize)

Record that the op at pc (running in window base) executed (forward) — the control trace.

Source

pub fn pop_step(&mut self) -> Option<(usize, usize)>

Pop the most recently executed (pc, base) (reverse execution walks the path backward).

Source

pub fn len(&self) -> usize

The number of recorded erased-data deltas.

Source

pub fn is_empty(&self) -> bool

Whether the DATA tape is empty. true after an all-abelian (bijection-only) run — the zero-erasure signature (a program may still have a non-empty control-flow steps trace).

Source

pub fn step_count(&self) -> usize

The number of executed ops on the control-flow trace.

Source

pub fn nondet_count(&self) -> usize

The number of recorded nondeterministic reads (clock / random) — the captured entropy count.

Source

pub fn erased_bytes(&self) -> usize

Total erased DATA on the tape, in bytes — the Landauer energy proxy. Exactly 0 for an all-abelian run (every op self-inverts, nothing is journaled), regardless of how many times a reversible loop body ran.

Source

pub fn landauer_bytes(&self) -> usize

The GENUINELY-irreversible information on the tape — the true Landauer (energy) number. Below HistoryTape::erased_bytes because a write that overwrote the DEFAULT (Nothing) destroyed no information: pebbling elides the recomputable scratch, and this excludes the zero-information first-writes, so a pure computation into an output measures 0.

Trait Implementations§

Source§

impl Debug for HistoryTape

Source§

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

Formats the value using the given formatter. Read more
Source§

impl Default for HistoryTape

Source§

fn default() -> HistoryTape

Returns the “default value” for a type. Read more

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
§

impl<T> Downcast for T
where T: Any,

§

fn into_any(self: Box<T>) -> Box<dyn Any>

Convert Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>. Box<dyn Any> can then be further downcast into Box<ConcreteType> where ConcreteType implements Trait.
§

fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>

Convert Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be further downcast into Rc<ConcreteType> where ConcreteType implements Trait.
§

fn as_any(&self) -> &(dyn Any + 'static)

Convert &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)

Convert &mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &mut Any’s vtable from &mut Trait’s.
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

fn vzip(self) -> V

§

impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

§

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

§

impl<T> Read<Exclusive, BecauseExclusive> for T
where T: ?Sized,