ShareRing uses the Merkle Tree algorithm to verify document proofs:
- Only a single hash string (32 bytes) is stored on the blockchain instead of the whole data
- This hash verifies an identity document but cannot be resolved back to the original document
- We hash every field in the document, and they are all hashed together to form the Merkle root hash (final hash)
- We obfuscate data to show only the required user information and not every attribute.