Upgrade to Pro — share decks privately, control downloads, hide ads and more …

bitcoin as a cyripto currency

Avatar for umut umut
June 16, 2017

bitcoin as a cyripto currency

Basics of cyrpto currency explained over bitcoin

Avatar for umut

umut

June 16, 2017

Other Decks in Technology

Transcript

  1. About Bitcoin • Bitcoin is a successful implementation of distributed

    crypto-currency. • Transactions are peer-to-peer, so no central authority • Supply only regulated by software and agreement of users of system
  2. Transactions • Are irreversible by design • Are fast. Funds

    received are available for spending within minutes. • Cost very little, especially compared to other payment networks.
  3. Coin Creation (Miners) • Mining software produces blocks. • Creation

    of blocks require some solution for mathematically difficult problem. The solution itself is a proof-of-work (PoW) • After every block creation, network creates new coins. Start point is 50 coin for every blocks. It should be halved ever 210,000 blocks.
  4. Payments • Uses public key cryptography • Every wallet has

    an address for payments. • Payments is announced to be recorded in public ledger
  5. • Every transaction performed is broadcasted to the system and

    only valid transactions is accepted by chain. • Blocks are chained that, modifying a block will require modifying of all blocks in that chain. • Receiver can verify transaction by checking whether it takes place in a block.
  6. • In Bitcoin ecosystem, there are no email addresses, no

    names. • Every balance is associated with address and public- private keys. • Every user can have multiple addresses as suggested by bitcoin software itself.
  7. • The longest chain not only serves as proof of

    the sequence of events witnessed, but proof that it came from the largest pool of CPU power • As long as a majority of CPU power is controlled by nodes that are not cooperating to attack the network, they'll generate the longest chain and outpace attackers
  8. The steps to run the network are as follows: •

    New transactions are broadcast to all nodes • Each node collects new transactions into a block. • Each node works on finding a difficult proof-of-work for its block. • When a node finds a proof-of-work, it broadcasts the block to all nodes. • Nodes accept the block only if all transactions in it are valid and not already spent. • Nodes express their acceptance of the block by working on creating the next block in the chain, using the hash of the accepted block as the previous hash.
  9. • New transaction broadcasts do not necessarily need to reach

    all nodes. As long as they reach many nodes, they will get into a block before long. Block broadcasts are also tolerant of dropped messages. If a node does not receive a block, it will request it when it receives the next block and realizes it missed one. • The steady addition of a constant of amount of new coins is analogous to gold miners expending resources to add gold to circulation. In our case, it is CPU time and electricity that is expended.
  10. Proof-of-Work • "c" is our challange string, "p" is our

    proof(response) • hash these values (for example with SHA-512), output should contain 0 bits to begin with(for example 40) This shows that, "p" value is computed to have corelation with "c" to produce a hash begins with trailing zeros. • Every time the chain grows with proof-of-work applied, an atacker must successfully re-do all the chains back to get "c". • But the output hash is sort of easy to verify but hard to re- produce(re-do).