Bitcoin Forum
June 25, 2024, 04:32:14 PM *
News: Latest Bitcoin Core release: 27.0 [Torrent]
 
   Home   Help Search Login Register More  
Pages: [1]
  Print  
Author Topic: A backwardcompatible way to use bitcoin for yes/no or possibly median voting  (Read 391 times)
BenRayfield (OP)
Sr. Member
****
Offline Offline

Activity: 316
Merit: 250



View Profile
June 07, 2015, 12:22:04 AM
 #1

Each blockchain can start with any chosen data, which later blocks are built on top of. The deeper that blockchain gets, the harder it is to change that data. Whoever chooses to use such a blockchain (among many others) is acting in the context of that data, if people choose to display such data on screen that way. Such data could be any text or file, even if its a secureHash of a larger data like naming something on (if it werent so unsecure using weak hash functions) bittorrent.

For example, someone could start a blockchain whose chosen data is "the legal drinking age (in years) in USA should be". If its a yes/no vote, a specific age would have to be included in that text. If its a median vote, each publicKey would, through some agreed on function, represent a specific number which depends only on the bits of the publicKey and not anything signed by it which could become a source of conflict in which signed content is valid or not. In the simplest case, each publicKey represents yes if it has an odd number of 1 bits, or no if it has an even number of 1 bits. Interpreting a publicKey as an integer (or scalar number) could be done by using its bits as the binary digits of that number, or using some secureHash of the publicKey that way. Theres an unlimited number of possible functions which the network could agree are useful for certain purposes.

These interpretations of how much bitcoins (in various independent blockchains) are at which addresses, grouped by functions which answer yes/no or a scalar number about each possible address, would have no legal or economic force or influence of any kind except as people find them useful for organizing information those ways.

A yes/no vote in a new blockchain, weighted by how much bitcoins are at the yes kind of addresses minus bitcoins at the no kind of addresses, can change over time if each user has at least 1 yes address and 1 no address so they could send to themself to change their vote, and it would work the same in generating publicKeys that are found to represent various numbers which get voted on (to your own address which happens to represent a number close to what you want to median vote on).

It could also be done using any functions which answer yes/no on existing bitcoin addresses and, if the network is motivated to, form datastructs to sum the bitcoins at addresses which map to yes vs addresses that map to no, and many of these addresses would overlap between many views of the same blockchain. Each view is any function which takes a possible address bitstring and returns some other bitstring, normally representing a single bit for yes/no or more bits for a scalar number, or it could even expand to general computing in a statistical way if people defined variables that way, where a variable is defined as any chosen way of viewing a subset of all possible bitcoin addresses weighted by how much bitcoins are there.

Voting using blockchains does not need new datastructs if people just agree on any chosen Recognizer Functions which recognize true or false based on the bits of addresses. Many possible things could be built in this paradigm.

Pages: [1]
  Print  
 
Jump to:  

Powered by MySQL Powered by PHP Powered by SMF 1.1.19 | SMF © 2006-2009, Simple Machines Valid XHTML 1.0! Valid CSS!