Is this expected `hash`ing behaviour? ```julia> a = [rand(0:1, 200) for i in 1:

Is this expected hashing behaviour?

julia> a = [rand(0:1, 200) for i in 1:10000]
julia> b = deepcopy(a)
julia> a[1][1] = 2
julia> hash(a) == hash(b)
true

It seems to be different with smaller vectors:

julia> a = [rand(0:1, 200) for i in 1:10]
julia> b = deepcopy(a)
julia> a[1][1] = 2
julia> hash(a) == hash(b)
false

Note that the original poster on Slack cannot see your response here on Discourse. Consider transcribing the appropriate answer back to Slack, or pinging the poster here on Discourse so they can follow this thread.
(Original message :slack:) (More Info)

From Slack:

From the hash(A::AbstractArray, h::UInt) function:

    # Goal: Hash approximately log(N) entries with a higher density of hashed elements
    # weighted towards the end and special consideration for repeated values. Colliding
    # hashes will often subsequently be compared by equality -- and equality between arrays

This is done as otherwise hashing of arrays would always be 0(n).