agorise
/
bsips
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Removed Dans BSIP, addded bsip12 into readme

oxarbitrage-patch-1
Fabian Schuh 2016-01-13 17:18:36 +01:00
parent 834470407c
commit 1524dc4329
2 changed files with 3 additions and 15 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
README.md
View File

@ -21,3 +21,6 @@ Number | Title | Owner | Type
[7](bsip-0007.md) | Fee Backed Assets (FBA) | Daniel Larimer | Protocol | Draft
[8](bsip-0008.md) | Privacy (STEALTH) Mode | Daniel Larimer | Protocol | Draft
[9](bsip-0009.md) | Benefit Society | Fabian Schuh | Protocol | Draft
10 | Percentage-based transfer fee solution based on CER | Jakub Zarembinski | Protocol | Draft
11 | On Demand Voting | Daniel Larmier | Protocol | Draft
12 | Hardfork Precdure Proposal | Fabian Schuh | Informational | Draft

15
bsip-0010-on-demand-voting.md
View File

@ -1,15 +0,0 @@
The purpose of this BSIP is to minimize the cost incurred by the network doing unnecessary operations every maitenance interval.
Every hour votes are tallied and 99% of the time there is no meaningful change. Under this proposal, votes would only
be tallied when requested by a user and at most once per maitenance interval. The fee for talleying votes would be around $5.
Users of the system can determine whether or not there is a $5 difference in votes that would justify a retally. A worker, witness,
or committee member who got voted in would pay $5 to have the vote counted.
The side effect of this behavior would be to greatly improve reindexing performance, the vast majority of which is spent tallying
votes that never change.
Witnesses producing blocks on the maitenance interval can pre-tally the votes and compare them to the last value. They can then
indicate whether or not anything changed significantly in the block they produce.
If there is no one who stands to benefit by more than $5 then chances are it is an unnecessary update to the voting totals.