anchor.diff:                      match innerMillerRabin num x s m d with
                       | ProbablePrime _ -> true
                       | _ -> false)
  -            let result =
  -                if passesAllBases
  -                then
  -                    Prime num
  -                else
  -                    Composite num
  -            result
  +            if passesAllBases
  +            then
  +                Prime num
  +            else
  +                Composite num
           | _ ->
               // try random bases
               let rec tryRandomBase (i : int) =
  
positive.code:         tryPow 1
  
  let checkBases num =
      let bases =
          match num with
          | prim when prim < 1373653I ->
  
negative.code:     let s = calcS m
      let d = m / bigint.Pow(2I, s)
  
      // both cases are really the same
      // if array is empty, fill with some random bigint's (lazily?)
      let result =
          match bases with
          | Some b ->
  