anchor.diff:  
     NP1 = ?set(loop_iter, Iteration, PState),
     NP2 = ?set(loop_val, Val, NP1),
  -  NP3 = ?set(replies, #replies{}, NP2),
  +  NP3 = ?set(replies, new_replies(), NP2),
     save_pstate(Key, NP3, State),
   
     %% the second key entry is necesasry as this is not replaced by the dht and is used
  
positive.code:     max_seq = -1 :: integer(),
  
      buff_val = new_buffer() :: buffer(),
      learned_val = dict:new() :: dict:dict(non_neg_integer(), buffer()),
  
      accept_val = new_buffer() :: buffer(),
  
negative.code:           true ->
              ?union(accept_val, UpdateCmds, NP1);
            false ->
              %% As all newyly received commands in the UpdateCmd set are always learned together,
              %% we can just use some existing update to listing for completion instead
              %% of creating a noop every time. If none exists, create a noop
              T3 =
                case ?get(last_update_cmd_received_in_buf, NP1) of
                  null ->
                    {Cid, T1} = get_new_id(Key, NP1),
                    NoopCmd = new_noop(Cid),
                    T2 = ?union(accept_val, sets:add_element(NoopCmd, UpdateCmds), T1),
                    set_to_notify_after_cmd_learned(ToNotifyList, NoopCmd, T2);
                  Cmd ->
                    T1 = ?union(accept_val, UpdateCmds, NP1),
                    set_to_notify_after_cmd_learned(ToNotifyList, Cmd, T1)
                end,
              ?set(to_notify_pending, [], T3)
          end,
  
        ?TRACE("START AGREE ~p~n~p", [Key, {?get(active, NP1), ?get(accept_val, NP2),
  