chore: markups

trace_decoder/src/interface.rs

@@ -128,13 +128,12 @@ pub struct TxnTrace {
     #[serde(skip_serializing_if = "Option::is_none")]
     pub nonce: Option<U256>,
 
-    /// <code>[hash](keccak_hash)([Address])</code> of storages read by the
-    /// transaction.
+    /// <code>hash([Address])</code> of storages read by the transaction.
     #[serde(default, skip_serializing_if = "BTreeSet::is_empty")]
     pub storage_read: BTreeSet<H256>,
 
-    /// <code>[hash](keccak_hash)([Address])</code> of storages written by the
-    /// transaction, with their new value.
+    /// <code>hash([Address])</code> of storages written by the transaction,
+    /// with their new value.
     #[serde(default, skip_serializing_if = "BTreeMap::is_empty")]
     pub storage_written: BTreeMap<H256, U256>,
 

trace_decoder/src/lib.rs

@@ -1,4 +1,4 @@
-//! An _Ethereum Node_[^1] executes _transactions_ in _blocks_.
+//! An _Ethereum Node_ executes _transactions_ in _blocks_.
 //!
 //! Execution mutates two key data structures:
 //! - [The state trie](https://ethereum.org/en/developers/docs/data-structures-and-encoding/patricia-merkle-trie/#state-trie).
@@ -31,9 +31,6 @@
 //! (since prover performance is sensitive to the size of the trie).
 //! The prover can therefore prove each batch of transactions independently.
 //!
-//! [^1]: In our stack, this is [a fork of erigon](https://github.com/0xPolygonZero/erigon),
-//!       which exposes more information over RPC.
-//!
 //! # Non-goals
 //! - Performance - this will never be the bottleneck in any proving stack.
 //! - Robustness - this library depends on other libraries that are not robust,