Problem - Range Xor Queries

Given an array and queries, find XOR of elements in range $[l, r]$. XOR is NOT idempotent: $a \oplus a = 0 \neq a$. For XOR, you can't use the overlap trick. Options:

$1.$ Prefix XOR: $\text{xor}(l, r) = \text{prefix}(r) \oplus \text{prefix}(l-1)$. Build in $O(n)$, query in $O(1)$.

$2.$ Disjoint Sparse Table: $O(n \log n)$ build, $O(1)$ query.

$3.$ Regular Sparse Table: $O(n \log n)$ build, $O(\log n)$ query (non-overlapping ranges). For XOR particularly, prefix XOR is simplest and fastest.