A worked mechanism
Priority and one-hot selection are different functions.
The chapter’s loop lets the highest eligible index win. Compare that contract with a parallel one-hot selection hypothesis.
Only e[1] is set
e = 0010
Both implementations may select payload[1]. A one-hot sample cannot distinguish them.
e[1] and e[3] are set
e = 1010
The priority loop selects payload[3]. A one-hot assumption has now been violated.
No request is eligible
e = 0000
The original loop preserves hold. An unconditional OR-of-masked-data network instead returns zero.
Legal optimization
Equivalence scope
Prove the input contract and preserve the zero-eligible fallback before replacing the cone.
Work it through
A faster cone can implement the wrong arbiter
With payload[1]=0x02 and payload[3]=0x08, the loop returns 0x08 for e=1010. A bitwise masked OR returns 0x0A.
Restructuring needs a functional proof, not just a smaller logic-depth report.
Watch for this
An assumed one-hot environment must itself be guaranteed in every legal mode, including reset and test.
Check your reasoning
Exercise zero, one, and multiple eligible bits; compare original outputs, transformed outputs, and formal assumptions before STA.
Put it into practice
Explain the decision behind the design.
- Explain what STA provesSeparate timing-graph evidence from functional behavior.→
- Classify path boundariesIdentify legal startpoints, endpoints, and clock relationships.→
Continue the learning path

