B-money: Difference between revisions
No edit summary |
corrected grammar |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Line 1: | Line 1: | ||
'''B-money''' was an early proposal created by [[Wei Dai]] for an "anonymous, distributed electronic cash system". [[Satoshi Nakamoto]] referenced b-money when creating [[Bitcoin]]. In his essay, published on the cypherpunks mailing-list in November 1998, Dai proposed two protocols. The first protocol is impractical as it requires a broadcast channel that is unjammable as well as being synchronous. | |||
In the first protocol in the essay, the [[proof of work]] | In the first protocol in the essay, the use of a [[proof of work]] function is recommended as a means of creating money. Dai's B-Money was proposed in the context of cypherpunks mailing-list discussions relating to possible applications of [[Hashcash]], the first symmetric proof-of-work function, which was itself also published on the same mailing-list, the previous year - May 1997. (Like the B-money proposal, bitcoin itself also uses the hashcash cost-function as the proof-of-work during coin minting). In B-Money, money is transferred by broadcasting the transaction to all participants, all of whom keep accounts of all others. Contracts can be made with possible reparation in case of default, with a third party agreeing to be the arbitrator. If there is no agreement, each party broadcasts arguments or evidence in its favor and each of the participants determines the reparations/fines in his accounts for himself. | ||
The second protocol has only a subset of the participants (the "servers") keeping accounts, which they have to publish, and the participants who do transactions verifying their balances by asking many of them. The participants also verify that the money supply is not being inflated. An amount of money as bail is required to become a server, which is lost if the server is found to be dishonest. | The second protocol has only a subset of the participants (the "servers") keeping accounts, which they have to publish, and the participants who do transactions verifying their balances by asking many of them. The participants also verify that the money supply is not being inflated. An amount of money as bail is required to become a server, which is lost if the server is found to be dishonest. | ||
| Line 8: | Line 8: | ||
==External Links== | ==External Links== | ||
*[http://weidai.com/bmoney.txt | *[http://weidai.com/bmoney.txt b-money, an anonymous, distributed electronic cash system] | ||
*[http://www.hashcash.org/ hashcash cost-function] | |||
[[Category:Economics]] | [[Category:Economics]] | ||
Latest revision as of 20:02, 29 June 2022
B-money was an early proposal created by Wei Dai for an "anonymous, distributed electronic cash system". Satoshi Nakamoto referenced b-money when creating Bitcoin. In his essay, published on the cypherpunks mailing-list in November 1998, Dai proposed two protocols. The first protocol is impractical as it requires a broadcast channel that is unjammable as well as being synchronous.
In the first protocol in the essay, the use of a proof of work function is recommended as a means of creating money. Dai's B-Money was proposed in the context of cypherpunks mailing-list discussions relating to possible applications of Hashcash, the first symmetric proof-of-work function, which was itself also published on the same mailing-list, the previous year - May 1997. (Like the B-money proposal, bitcoin itself also uses the hashcash cost-function as the proof-of-work during coin minting). In B-Money, money is transferred by broadcasting the transaction to all participants, all of whom keep accounts of all others. Contracts can be made with possible reparation in case of default, with a third party agreeing to be the arbitrator. If there is no agreement, each party broadcasts arguments or evidence in its favor and each of the participants determines the reparations/fines in his accounts for himself.
The second protocol has only a subset of the participants (the "servers") keeping accounts, which they have to publish, and the participants who do transactions verifying their balances by asking many of them. The participants also verify that the money supply is not being inflated. An amount of money as bail is required to become a server, which is lost if the server is found to be dishonest.
An alternate method of creating money is proposed, via an auction where participants bid on the solution of computational problems of known complexity.