Consider there are two sets A={a1,a2,...,an}, B={b1,b2,...,bm}$A=\{a_1,a_2,\cdots,a_n\}, B=\{b_1,b_2,\cdots,b_m\}$; m,n$m,n$ can be different. we can calculate the xor summation of the each elements'element's hash value: XOR(A)=(hash(a1) xor hash(a2) xor ... xor hash(an))$XOR(A)=(hash(a_1)\oplus hash(a_2) \oplus \cdots \oplus hash(a_n))$ and XOR(B)=(hash(b1) xor hash(b2) xor ... xor hash(bm))$XOR(B)=(hash(b_1) \oplus hash(b_2) \oplus \cdots \oplus hash(b_m))$. Is it possible that if set A$A$ does not equal set B but XOR(A)=XOR(B)$B$, yet $XOR(A)=XOR(B)$?
Geoffroy Couteau
- 21.3k
- 2
- 50
- 72