anchor.diff:          % Create new seedtree
           % NOTE vmx: HeightDiff+1 makes sense as we like to load the level
           % of the children, not sure why we need +2 here)
  -        Seedtree = seedtree_init(Fd, ParentPos, HeightDiff+2),
  +        %Seedtree = seedtree_init(Fd, ParentPos, HeightDiff+2),
  +        Seedtree = seedtree_init(Fd, ParentPos, HeightDiff+1),
           ?debugVal(Seedtree),
           Seedtree2 = seedtree_insert_list(Seedtree, New),
           ?debugVal(Seedtree2),
           ?debugVal(length(Seedtree2#seedtree_root.outliers)),
  -        {ok, Pos} = seedtree_write(Fd, Seedtree2, InsertHeight+1),
  -        {ok, {Mbr, _, Pos2}} = couch_file:pread_term(Fd, Pos),
  -        [{Mbr, Pos2}];
  +        %{ok, Pos} = seedtree_write(Fd, Seedtree2, InsertHeight+1),
  +        %{ok, {Mbr, _, Pos2}} = couch_file:pread_term(Fd, Pos),
  +        %[{Mbr, Pos2}];
  +        % XXX vmx: TODO make seedtree_write to return the MBR as well
  +        {ok, MbrAndPosList} = seedtree_write(Fd, Seedtree2, InsertHeight+1),
  +        %MbrAndPos = lists:map(fun(Pos) ->
  +        %    {ok, {Mbr, _, Pos2}} = couch_file:pread_term(Fd, Pos),
  +        %    {Mbr, Pos2}
  +        %end, PosList),
  +        %MbrAndPos;
  +        MbrAndPosList;
       % insert tree is too high => use its children
       HeightDiff < 0 ->
           {OmtTree, _OmtHeight} = omt_load(New, ?MAX_FILLED),
  
positive.code: % leaf node
  omt_write_tree(Fd, [H|_T]=Leafs, Depth, _Acc) when is_tuple(H) ->
      %{leaf_nodes, Leafs};
      ?debugVal(length(Leafs)),
      ?debugVal(Leafs),
      % Don't write leafs nodes to disk now, they will be written later on.
      % Instead return a list of of tuples with the node's MBR and the node
      % itself
  
negative.code:         %    false -> #node{type=inner}
          %end,
          Meta = #node{type=inner},
          {ok, Pos} = couch_file:append_term(Fd, {Mbr, Meta, Children}),
          {ok, [{Mbr, Pos}|Acc]}
      end,
      {_, Acc3} = omt_write_tree(Fd, T, Depth, Acc2),
  