anchor.diff:    l := FHashTreeOperations.LockList;
     try
       P := l[index];
  -
  +    // Delete from Ordered by OpReference
  +    if Not FListOrderedByOpReference.FindOpReference(P^.Op.GetOpReference,i) then begin
  +      TLog.NewLog(ltError,ClassName,'DEV ERROR 20180629-1 Operation not found in ordered by reference list: '+P^.Op.ToString);
  +    end else FListOrderedByOpReference.Delete(i);
       // Delete from Ordered
       If Not FindOrderedBySha(l,P^.Op.Sha256,iDel) then begin
         TLog.NewLog(ltError,ClassName,'DEV ERROR 20180213-1 Operation not found in ordered list: '+P^.Op.ToString);
  
positive.code:   private
      FListOrderedByAccountsData : TList;
      FListOrderedBySha256 : TList; // Improvement TOperationsHashTree speed 2.1.6
      FHashTreeOperations : TPCThreadList; // Improvement TOperationsHashTree speed 2.1.6
      FHashTree: TRawBytes;
      FOnChanged: TNotifyEvent;
  
negative.code:       TCrypto.DoSha256(h,FHashTree);
      end;
      npos := list.Add(P);
      FListOrderedByOpReference.Add(op.GetOpReference);
      // Improvement: Will allow to add duplicate Operations, so add only first to orderedBySha
      If Not FindOrderedBySha(list,op.Sha256,i) then begin
        // Protection: Will add only once
  