anchor.diff:  
   final _random = new Random();
   
  -const leafSize = 64;
  +
  +//const branching = 16;
  +//const branchingBits = 4;
  +//const branchingMask = 0xf;
  +
  +const branching = 32;
  +const branchingBits = 5;
  +const branchingMask = 0x1f;
  +
  +const leafSize = branching * 3;
  +
   const binSearchThr = 16;
   const recsize = 3; //0 - key, 1 - val, 2 - hash
   
  
positive.code:       }
        List <_Node<K, V>> array = [];
        int bitmap=0;
        for (int i=0; i<32; i++){
            if (kvs[i] != null) {
            bitmap |= 1<<i;
            assert(kvs[i].length % recsize == 0);
  
negative.code:     var hash = kv[2];
      int from = 0;
      int to = into.length - recsize;
      while(from - to > recsize * binSearchThr){
        int mid = (from + to) ~/ 2;
        if (into[mid + 2] > hash){
          to = mid;
  