t
play

t Wait a few blocks until you Txn=#871 George Anna 1 . can say - PowerPoint PPT Presentation

RECAP View of someone who wants to make a transaction Block = # Prev = # B 1 B 2 ... B 8 B 9 B 10 B ... B Txn #871 t Wait a few blocks until you Txn=#871 George Anna 1 . can say that the transaction is


  1. RECAP View of someone who wants to make a transaction Block = #… Prev = #… B 1 B 2 ... B 8 B 9 B 10 B’ ... B’’ … Txn #871 … t Wait a few blocks until you Txn=#871 George Anna 1 …. can say that the transaction is confirmed WHY WHY? Want some assurance that this block will be on the longest chain in the long run!

  2. PROOF OF WORK: RECAP View of a miner B 1 B 2 ... B 8 Block = #8ae1… Prev = B 8 …. SHA256 ( ) = 0x0b39d9ca51f07fef3429ae15… Txn #123 = … …. nonce

  3. PROOF OF WORK: RECAP View of a miner B 1 B 2 ... B 8 Block = #8ae1… Prev = B 8 …. SHA256 ( ) = 0x000000ef34244s1jd99a533g… Txn #123 = … …. 0 nonce'

  4. PROOF OF WORK: RECAP View of a miner B 1 B 2 ... B 8 Block = #8ae1… Prev = B 8 …. SHA256 ( ) = 0x1104000gf4jd8011889mdk3c… Txn #123 = … …. 0 nonce’’

  5. PROOF OF WORK: RECAP View of a miner B 1 B 2 ... B 8 Block = #8ae1… Prev = B 8 …. SHA256 ( ) = 0x1104000gf4jd8011889mdk3c… Txn #123 = … I n c l u …. d e t h i s t r a n nonce’’ s a 0 c t i o n Txn=#871 George Anna 1 ….

  6. PROOF OF WORK: RECAP View of a miner B 1 B 2 ... B 8 Block = #8ae1… Prev = B 8 …. SHA256 ( ) = 0x0000000aa38md69nb11efg48… Txn #123 = … I n c l u d …. e t h i s t r a n s a Txn #871 =… c t i o n Txn=#871 Georgios Arvind 1 …. nonce’’’

  7. PROOF OF WORK: RECAP View of a miner You lost the race B 1 B 2 ... B 8 B 9 9 Block = #8ae1… Prev = B 8 …. SHA256 ( ) = 0x0000000aa38md69nb11efg48… Txn #123 = … …. Txn #871 =… nonce’’

  8. PROOF OF WORK: RECAP View of a miner You lost the race B 1 B 2 ... B 8 B 9 Block = #8ae1… Update pointer to previous block Prev = _ å …. SHA256 ( ) = 0x0000000aa38md69nb11efg48… Txn #123 = … …. Remove transactions in B 9 Txn #871 =… nonce’’ I

  9. PROOF OF WORK: RECAP View of a miner You lost the race B 1 B 2 ... B 8 B 9 Block = #8ae1… Update pointer to previous block Prev = _ å …. SHA256 ( ) = 0x0000000aa38md69nb11efg48… Txn #123 = … …. Remove transactions in B 9 Txn #871 =… nonce Keep trying!

  10. RECAP OF BITCOIN Transactions: At any time, any buyer b can • Tr generate a transaction to pay d BTC to seller s. • Blo Block: ck: A block consists of ◦ A set of transactions ◦ A cryptographic hash of the previous block (pointer to previous block ◦ An ID of the miner for this block ◦ A nonce. valid if • A set of properly signed transactions is va no account ever overspent its limit. • A block is valid if ◦ It points to a valid block. ◦ All transactions on the chain to B are valid. ◦ SHA256(nonce|| info in block) has k leading zeros.

  11. RECAP OF BITCOIN II • Mi Mini ning ng: : the process of extending the blockchain from some block B. • Longest Chain Protocol (for miners): ◦ Choose B to be the block furthest from the root, tie- breaking in favor of the first block you heard about. ◦ Include all valid transactions you’ve heard about. ◦ As soon as valid block created, announce it to the network. • Miners are paid for creating valid blocks with freshly minted Bitcoins and with transaction fees. • Difficulty of the puzzle is adjusted every 2016 blocks with the objective of making it so that a block takes 10 minutes to make in expectation.

  12. KEY IDEA • Trust the ledger that has the most “computational work” put into it. • Ensure that fraudulent transactions/conflicting ledgers would require an infeasible amount of computation to create.

  13. BITCOIN • Is a mechanism. • Question for us: are there beneficial deviations that can help a miner earn more than his fair share of rewards?

  14. difficulty adjustment gets extended by block chain longest mins every tho on avg miner do What a can block they know choose any on to mine about attacks spending Double keys D F D ITE D T chance this happens is 23 2 is my mining power 5140 L

  15. Selfish Mining Ming game Set of miners has power that minerm facing ming Xm L Exm m aware of tree is each miner At all times graphthee Gm towards root directed minerm away nodes represent of blocks miner is selected to at each tinet a random selected af pref Xm mis Miner a block can pick mine each miner the step ateech Gm in node v broadcast path from v to root any Fixm.mx fsasIEEaiEY in t chain public attnef T T m th tr

  16. a tie with in if is m miner Assumptions block far longest chain other any on rn's chain everyone else manes on longest chain well mine minerm own blocks favor of his breaking ties In he has found a block will only broadcast but distance from Same block F another roof everyblock gzgq D e Dz I X t longest chain blocks on frack of his reward true steps T TX in blocks longest chain blows Ta on Kills

  17. height Gm hm G his view chain lengthy largest public view height G G h alltieslostbym Assume that This improves rewards for mfan chain has 23.3 Mainweray.ws t9Idagest any Markov setofstates S YdainonosnginneGonmin Braak ties in favor of own blocks V state his u strategy prob next state is V Block annonquesnfing gu msn.im announce h MacIver h if hm ifmhndsnext.to imnedatelyannounce t hti means hm o 1,2 statei i State bh _hm o O I there is fork a ht x x x x x x En En Ex Lata If I atom ya 0 D D D T.tn E 22 p 0K stationary prob of being in state Let pi belong run 2 Post pact d poll Po 1 2 stationary dish pot p long run prob of being Meachstate long run prob Po 4 prgbernginstaleuth p 9W pre Epa quo i pi id pitilla 32 arts qp.ES pi 00 a

  18. EEP i't reward Po't selfish on trans.hn y S Amity 9 Selfish payoff i y gp honest rewag on housing s9xyH y Honest axtoy payoff p he'll first announced when it's a block count beon longest chain to guaranteed seyishp.at Selfishpaght Honest past my pants w miner exp payed of selfish is loses all ties assuming z 4241 25 23 s 0 3 212 D 2 L It fue when l sa

  19. The Miners Dilemma the variance used to reduce pools mining as single mines Bitcoin that joins pool manager use partial proof of work to split rewards among how to figure out miners men're P2 O ima m m

  20. Pooly Pool 1 attacks X's M Ri block rewards tag utstotalpag w m ram P gets the pool 5 also 80 as both long pools NE as PMI pods aoes Gb t2e do.IE y E b e pool lathi's 24 a does

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend