anchor.diff:  		{M1, Max1}
   	end,
   
  -    {_,{MaxDiff,MaxMap}} = lists:foldl(F,
  -				       {#{}, {0, undefined}},
  -				       lists:seq(1,10000)),
  +    {_,{MaxDiff,MaxMap, FatCnt}} = lists:foldl(F,
  +					       {#{}, {0, undefined, 0}},
  +					       lists:seq(1,10000)),
       case MaxMap of
   	undefined ->
  -	    io:format("Wow, no maps below \"average\"\n", []);
  +	    io:format("Wow, no map with more than \"average\" number of nodes\n");
   	_ ->
  +	    io:format("Found ~p maps with more than \"average\" number of nodes\n",
  +		      [FatCnt]),
   	    io:format("Max std dev diff ~p for map of size ~p (nodes=~p, flatsize=~p)\n",
   		      [MaxDiff, maps:size(MaxMap), hashmap_nodes(MaxMap),
   		       erts_debug:flat_size(MaxMap)])
  
positive.code:     ok.
  
  hashmap_balance(KeyFun) ->
      F = fun(I, {M0,Max0}) ->
  		Key = KeyFun(I),
  		M1 = M0#{Key => Key},
  
negative.code:     true = (MaxDiff < 6),  % The probability of this line failing is about 0.000000001
                             % for a uniform hash. I've set the probability this "high" for now
                             % to detect flaws in our make_internal_hash.
      ok.
  
  hashmap_nodes(M) ->
  