Editing Paste

Private

Title

Content

### ID: GRFC-1
### Title: Britcoin Hashing Algorithm
### Date: 2018-03-15
### Version: 1

### Table of Contents

1. Blocks (tbd)
1.1 Guarantee of delivery
2. The britshash
2.1. Prove of work
2.1.1 Difficulty settings
3. Mesh Networking (tbd)

----------------------
1. Blocks (To be done)

A block can vary in size and is processed at last after 15 minute or when it reached it's max size of 1024KB.

1.1 Guarantee of deliver (to be done)

When a block is not processed after 15 minutes, it is paddedd with null bytes, which is a forbidden char in block dat. <-- xxx crap ntbd)
### TODO: –((Talk with boss about this bullocks idea))

-----------------------
2. The brithash

Brithash uses the skein hash algorithm as it's only hash algorithm.

2.1. Prove of work

All Blocks content is hashed to generate the initial nounce-zero.
The prove of work is a hash of this hash with a 32 byte long nounce which results in a hash value below the difficulty.

2.1.1 Difficulty settings

The difficulty setting is a value between 0 and hash max value.
The prove of work has to be smaller than max-value - difficulty
The initial difficulty is 2^16, which requires 0x0000......................... (4 leading zeroes)

3. Mesh Networking (tbd)

Show | Back