let HammingDistance (b1:seq<byte>) (b2:seq<byte>) : int =
        let bytePairs = Seq.zip b1 b2
        let HammingWeight (b:byte) =
            let bitPositions = {0 .. 7}
            let isSet (byte1:byte) (offset:int) = if (byte1 &&& ((byte 1) <<< offset)) > (byte 0) then 1 else 0
            Seq.map (isSet b) bitPositions |> Seq.sum
        let HammingDistanceBytes (byte1, byte2) =
            HammingWeight (byte1 ^^^ byte2)
        let distances = Seq.map HammingDistanceBytes bytePairs
        printfn "Distances: %A" distances
        printfn "Distances length: %d" (Seq.length distances)
        Seq.sum distances

Distances length: 1435
Distances: seq [3; 3; 1; 5; ...]
Distances length: 1436
Distances: seq [3; 6; 2; 1; ...]
Distances length: 1437
Distances: seq [0; 3; 2; 3; ...]
Distances length: 1438
Distances: seq [3; 3; 4; 2; ...]