Without this PR, one gets state types as verbose as what I posted in #962, and when writing specifications and proofs, it becomes very tedious to figure out what each component of a huge state tuple represents.
Now, with this PR, if I run About hmac_top., I get
and from this, it's easy to infer that I can destruct a circuit_state of type denote_type hmac_top_state into a '((d2h, regs), tlul_st, hmac_st) tuple.
And if I want to destruct the state further, I can simply Print one of the sub-states, and get descriptive names saying what they contain.
Without this PR, one gets state types as verbose as what I posted in #962, and when writing specifications and proofs, it becomes very tedious to figure out what each component of a huge state tuple represents.
Now, with this PR, if I run
About hmac_top.
, I getand
Print hmac_top_state.
printsand from this, it's easy to infer that I can destruct a
circuit_state
of typedenote_type hmac_top_state
into a'((d2h, regs), tlul_st, hmac_st)
tuple.And if I want to destruct the state further, I can simply
Print
one of the sub-states, and get descriptive names saying what they contain.