Difference between revisions of "Scalability through Prefix Filtering"

From Bitmessage Wiki
Jump to navigation Jump to search
(Created outline of proposal page - still need to fill in content)
 
(Started to fill out page content)
Line 3: Line 3:
 
== Introduction ==
 
== Introduction ==
 
This page describes a proposal for a way to make Bitmessage scalable.  
 
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 ==
 
== 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 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 chooses to deal with a certain proportion of the total network traffic, based on its capacity.
+
* 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.
* Each then randomly selects a segment of the network with a size that matches the XXX
+
*  
 
* XXX
 
* XXX
 
* XXX
 
* XXX
Line 48: Line 50:
 
===Idea: POW variable by prefix specificity===  
 
===Idea: POW variable by prefix specificity===  
 
Since
 
Since
 +
 +
 +
== Unresolved Questions ==
 +
 +
===Rules for nodes moving between streams===
 +
XXX
 +
 +
===Rules for addresses moving between streams===
 +
XXX

Revision as of 16:51, 29 January 2015

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