couple the well-formedness proof with the state in something like a sigma type so our operations produce wf_states, not just states
bring back some of the dependent types around stuff like perfect binary trees, vectors, etc.? I don't want to complicate things for the security proofs but perhaps some of these could help.
renaming stuff (related to #14), regulating style/naming conventions, etc.?
Ideas and discussions for cleanup/refactor
wf_state
s, not juststate
s