Scalability through Prefix Filtering

This page is a proposal or recommendation. Its content is most likely not representing an actual situation.

Introduction

This page describes a proposal for a way to make Bitmessage scalable.

Summary of the proposal

• Each Bitmessage address has a unique 'prefix value' and a 'prefix length' value. These values determine the balance between anonymity and efficiency that the owner of the address will have when receiving XXX.
• Each node in the Bitmessage network chooses to deal with a certain proportion of the total network traffic, based on its capacity.
• Each then randomly selects a segment of the network with a size that matches the XXX
• XXX
• XXX

Reasoning behind the proposal

XXX

Proposed changes

XXX

Examples

Example 1

XXX

Example 2

XXX

Example 3

XXX

Notes

XXX

XXX

XXX

XXX

XXX

XXX

Idea: POW variable by prefix specificity

Since