Scalability through Prefix Filtering

From Bitmessage Wiki
Revision as of 16:51, 29 January 2015 by JonathanCoe (talk | contribs) (Started to fill out page content)
Jump to navigation Jump to search

Introduction

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

NOTE: This proposal is not yet complete, as some aspects of proposed system are not yet resolved. Suggestions and contributions are welcome.

Summary of the proposal

  • Each Bitmessage address has a 'prefix' and a 'prefix length'. These values determine the balance between anonymity and efficiency that the owner of the address will have when receiving messages.
  • Each node in the Bitmessage network has a 'prefix' and a 'prefix length'. These values determine what part of the total network traffic the node will handle.
  • 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


Unresolved Questions

Rules for nodes moving between streams

XXX

Rules for addresses moving between streams

XXX