Forkid checks based on timestamps

The five-minute read

One action, walked through

1. Open EIP 6122 and read the status line before the examples.
2. Write down the rule in one sentence. A fair version of that sentence is: EIP-2124 proposed a way of identifying nodes on the p2p network based on their chain configuration via the forkid parameter.
3. Name the object that changes: P2P, FORK_HASH, IEEE.
4. Ask what an old client, an old contract, or an offline counterparty does. If the document is silent, the silence is part of the design.

The argument, unpacked

What has to be true

• You are implementing EIP 6122 at the status the text itself states: Final.
• The object that has to change is P2P, FORK_HASH, IEEE. A neighbouring document with a similar name is not this one.
• Measurements of delay in one year do not travel with the specification.

What happened after the paper

The source marks this final. That is a statement about the text, not a promise that every wallet or node has shipped it. Later documents can narrow, replace, or ignore this one. Cite the number you mean.

What to check before you use the idea

• Which message does Forkid checks based on timestamps add, and which old peer must still be answered?
• What does a node do when the short form fails and the full object is required?
• Which names are normative: P2P, FORK_HASH, IEEE?

Terms

EIP 6122

The public text titled Forkid checks based on timestamps.

Final

The document's own label for how finished the text is. It is not a market fact.

The problem the paper names

A node that cannot fetch, filter, or relay the data it is supposed to validate is not a peer of the network the paper describes.

What the design proposes

• EIP-2124 proposed a way of identifying nodes on the p2p network based on their chain configuration via the forkid parameter.
• It allows nodes to cut incompatible nodes off quickly which makes the P2P network more reliable.
• After the merge, forks are scheduled by block time instead of block number.

How the mechanism is specified

• Taken from the specification, the next constraint is: It allows nodes to cut incompatible nodes off quickly which makes the P2P network more reliable.
• Locate P2P, FORK_HASH, IEEE in EIP 6122 and apply it to one transaction or call.
• Then check the failure the class of rule always has: a node that did not upgrade, a reverted call, a replayed signature, or a peer that does not speak the message.

What this page does not treat as proven

• A peer protocol is not a consensus rule. A peer can disconnect. A block is still valid or not on its own.
• Measurements of delay in one year do not travel with the specification.
• The source marks this final. That is a statement about the text, not a promise that every wallet or node has shipped it.

Why a venture studio still reads it

Use EIP 6122 when a pitch says 'Forkid checks based on timestamps' without saying whether the rule is consensus, policy, or an interface. The number is the citation. The pitch is not.