~/talk

Bitcoin's Incentive Structure

Talkat Algorithmic Game Theory and Practice 2015 · 2015-11-16..11-20· [bitcoin]
links:none on file
slides:none on file

Explains why Bitcoin’s security depends on concrete assumptions and shows precise attacks and fixes: miners centralize into warehouses, block rate is deliberately ~one per 10 minutes, network handles about 150,000 transactions per day (~3.3 tx/s), and attackers under the supposed <50% bound can still profit. Presents an exact MDP-derived optimal selfish-mining policy, proves network delays make selfish mining profitable under network delays for much smaller miners, and outlines a DAG “chainless” protocol using ranked-pair voting to avoid those failures.

AI-written summary · about

  1. 0:00Intro
  2. 3:29The Blockchain
  3. 8:48Double Standard Tag
  4. 10:21Basic Theorem
  5. 13:52Incentives
  6. 21:22Incentives in Bitcoin
  7. 22:44Not Incentive Compatible
  8. 29:47Incentive Compatible
  9. 33:09Results
  10. 35:34Incentive Issues
  11. 44:39Conclusion
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.