{"id":"xor-universal-bit-primitive","text":"XOR serves as the universal primitive for bit-level computation across the repo, instantiated in three distinct roles: cancellation (isolating unique or extra elements via the self-inverse property), diffing (counting positional bit differences for Hamming distance), and flipping (toggling binary values via `^ 1`) — each exploiting a different algebraic property of the same operation.","truth_value":"IN","source":"","source_url":"","source_hash":"","justifications":[{"type":"SL","antecedents":["xor-cancellation-finds-extra-char","xor-for-bit-diff","xor-binary-flip-pattern"],"outlist":[],"label":"Three algebraic properties of XOR (self-inverse, positional independence, binary complement) map to three distinct algorithmic roles"}],"dependents":["xor-instantiates-streaming-for-bit-domain"],"metadata":{"last_reviewed":"2026-06-07T22:02:22","review_result":"pass"},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"xor-universal-bit-primitive","truth_value":"IN","reason":"SL justification valid","antecedents":["xor-cancellation-finds-extra-char","xor-for-bit-diff","xor-binary-flip-pattern"],"label":"Three algebraic properties of XOR (self-inverse, positional independence, binary complement) map to three distinct algorithmic roles"},{"node":"xor-cancellation-finds-extra-char","truth_value":"IN","reason":"premise"},{"node":"xor-for-bit-diff","truth_value":"IN","reason":"premise"},{"node":"xor-binary-flip-pattern","truth_value":"IN","reason":"premise"}]}}