A proof tree node. Each node is an inference rule application. Leaves are axioms or assumptions. Internal nodes are rule applications.
The proposition being proved at this step
Hash of the proof subtree (for tamper detection)
Unique id for this proof step
Premises (sub-proofs) that this step depends on
The inference rule applied
Whether this step is verified
A proof tree node. Each node is an inference rule application. Leaves are axioms or assumptions. Internal nodes are rule applications.