GenerateCollision(HashFunction H)
    n = outputLength(H)
    r = getRate()
    c = capacitySponge()
    X = generateRandomString(r) //generate random string of length r
    M1 = null
    M2 = null
    outcome[] = {} // array to store results in
    {d0 , d1 , … , dn}  =  GenerateRandomDocuments(n)
    for (int i = 0; i < docArraySize -1 ; i++):
        hash = H(Di).getInnerPart() //Gets the lower c bits
if (AlreadyKnown(hash))
            M1 = Di
M2 = DgetIndexCollision(i)
break
        else
            Outcome[i] = hash
    d = difference(R1, R2)
    return (M1 || X , (M2 || X xor d))