Structuring Network with XOR

MaidSafe
MaidSafe
Dec 11, 2018 · 7 min read

Comparing Bits

Input A: 11001010011010100100010101011110
Input B: 01001000101110011010011111000101
0=0
1=1
10=2
11=3
100=4
101=5
110=6
111=7
And so on...

Properties of XOR

if A ⊕ B == C therefore B ⊕ A == C
if A ⊕ B == C therefore C ⊕ B == A and A ⊕ C == B
if A ⊕ B == C then never A ⊕ B == D and never A ⊕ D == C

XOR Relationships in Networks

Decentralization Requirements

MaidSafe

Written by

MaidSafe

Building the SAFE Network. The world’s first autonomous data network. Privacy, security, freedom. Join us at https://safenetforum.org/

Welcome to a place where words matter. On Medium, smart voices and original ideas take center stage - with no ads in sight. Watch
Follow all the topics you care about, and we’ll deliver the best stories for you to your homepage and inbox. Explore
Get unlimited access to the best stories on Medium — and support writers while you’re at it. Just $5/month. Upgrade