- prop_t n_h = {0, me}; // number of the highest proposal seen in a prepare
- prop_t n_a = {0, me}; // number of highest proposal accepted
- value_t v_a; // value of highest proposal accepted
+ prop_t promise = {0, me}; // number of the highest proposal seen in a prepare
+ prop_t accepted = {0, me}; // number of highest proposal accepted
+ value_t accepted_value; // value of highest proposal accepted