Authors:
(1) Hamid Bateni, Nobitex Labs (hamid@europe.com);
(2) Keyvan Kambakhsh, Nobitex Labs (keyvankambakhsh@gmail.com). Table of Links Abstract and 1 Introduction 2 Proof of Liability and 2.1 Commitment 2.2 Merkle Tree 2.3 Leaves Structure 2.4 Proof Statement 3 Proof of Reserve 3.1 Ethereum 3.2 Bitcoin 4 Proof of Solvency 5 Future Works and References 2 Proof of Liability The first step in the proof of solvency process involves the proof of liabilities. This step aims to demonstrate the total amount of liabilities, or obligations, that exist. Liabilities in this context refer to the balances that the custody provider owes to its customers[2] 2.1 Commitment A commitment in the field of cryptography refers to a binding agreement to a chosen piece of information. Once this agreement is made, it becomes irreversible and unalterable. Essentially, it’s akin to sealing a message in an envelope - the message cannot be changed once it is sealed. In cryptographic terms, a commitment scheme allows an entity to commit to a chosen value, while keeping it hidden from others. It’s designed to be both binding and hiding. Binding ensures that once the commitment is made, it cannot be changed. Hiding ensures that until the reveal, no information about the committed value is leaked. For the Proof of Solvency process, we use a cryptographic commitment to demonstrate the existence and integrity of the liabilities. This is where we introduce the Merkle Tree as our commitment scheme. The root of the Merkle Tree serves as the commitment to all liabilities, and each leaf node of the tree represents an individual liability. The Merkle Tree is an efficient and secure method for verifying liabilities. Using this structure, we can provide proof of the existence and integrity of liabilities without revealing the actual liabilities until necessary. This approach strikes a balance between transparency and privacy, which is crucial for crypto custody providers. In the following sections, we will discuss the structure and properties of the Merkle Tree in more detail. This paper is available on arxiv under CC BY-NC-ND 4.0 DEED license. Authors: (1) Hamid Bateni, Nobitex Labs (hamid@europe.com); (2) Keyvan Kambakhsh, Nobitex Labs (keyvankambakhsh@gmail.com). Authors: Authors: (1) Hamid Bateni, Nobitex Labs (hamid@europe.com); (2) Keyvan Kambakhsh, Nobitex Labs (keyvankambakhsh@gmail.com). Table of Links Abstract and 1 Introduction Abstract and 1 Introduction 2 Proof of Liability and 2.1 Commitment 2 Proof of Liability and 2.1 Commitment 2.2 Merkle Tree 2.2 Merkle Tree 2.3 Leaves Structure 2.3 Leaves Structure 2.4 Proof Statement 2.4 Proof Statement 3 Proof of Reserve 3 Proof of Reserve 3.1 Ethereum 3.1 Ethereum 3.2 Bitcoin 3.2 Bitcoin 4 Proof of Solvency 4 Proof of Solvency 5 Future Works and References 5 Future Works and References 2 Proof of Liability The first step in the proof of solvency process involves the proof of liabilities. This step aims to demonstrate the total amount of liabilities, or obligations, that exist. Liabilities in this context refer to the balances that the custody provider owes to its customers[2] 2.1 Commitment A commitment in the field of cryptography refers to a binding agreement to a chosen piece of information. Once this agreement is made, it becomes irreversible and unalterable. Essentially, it’s akin to sealing a message in an envelope - the message cannot be changed once it is sealed. In cryptographic terms, a commitment scheme allows an entity to commit to a chosen value, while keeping it hidden from others. It’s designed to be both binding and hiding. Binding ensures that once the commitment is made, it cannot be changed. Hiding ensures that until the reveal, no information about the committed value is leaked. For the Proof of Solvency process, we use a cryptographic commitment to demonstrate the existence and integrity of the liabilities. This is where we introduce the Merkle Tree as our commitment scheme. The root of the Merkle Tree serves as the commitment to all liabilities, and each leaf node of the tree represents an individual liability. The Merkle Tree is an efficient and secure method for verifying liabilities. Using this structure, we can provide proof of the existence and integrity of liabilities without revealing the actual liabilities until necessary. This approach strikes a balance between transparency and privacy, which is crucial for crypto custody providers. In the following sections, we will discuss the structure and properties of the Merkle Tree in more detail. This paper is available on arxiv under CC BY-NC-ND 4.0 DEED license. This paper is available on arxiv under CC BY-NC-ND 4.0 DEED license. available on arxiv

Part of HackerNoon's growing list of open-source research papers, promoting free access to academic material.

How Merkle Trees Enhance Data Integrity in Crypto Custody

Introducing Private Proof of Solvency

Solvency.tech

Too Long; Didn't Read

Make resilience your competitive advantage

The Role of Commitment in Proof of Solvency

About Author

Comments

TOPICS

THIS ARTICLE WAS FEATURED IN

Related Stories

Untitled Story

Assessing VASP Solvency For Cryptoassets: A Closer Examination

Blockchain’s Impact on the Global Economy and the Role of Custody

Introducing Private Proof of Solvency

How Merkle Trees Enhance Data Integrity in Crypto Custody

Understanding Leaf Structures: How Merkle Trees Maintain Privacy in Liabilities

Assessing VASP Solvency For Cryptoassets: A Closer Examination

Blockchain’s Impact on the Global Economy and the Role of Custody

Introducing Private Proof of Solvency

How Merkle Trees Enhance Data Integrity in Crypto Custody

Understanding Leaf Structures: How Merkle Trees Maintain Privacy in Liabilities

Light-Mode

Classic

Newspaper

Dark-Mode

Neon Noir

Minty

HN StartUps