COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Cambridge Centre for Alternative Finance > LECTURE AND HACKATHON: SPEAKER BALAJI SRINIVASAN, 21.co | HOW BITCOIN ENABLES A MACHINE-PAYABLE WEB
LECTURE AND HACKATHON: SPEAKER BALAJI SRINIVASAN, 21.co | HOW BITCOIN ENABLES A MACHINE-PAYABLE WEBAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Nia Robinson. Places are limited, please register and RSVP to n.robinson@jbs.cam.ac.uk First we had the World Wide Web, a web of links between documents. Then we had the Social Web, a social network of relationships between people. 21.co believes that the third web may be the Machine-Payable Web, a network of payments between machines. In this public lecture and hackathon, Balaji Srinivasan, CEO of 21 and Board Partner at Andreessen Horowitz, will discuss the open source 21 software package, which makes it easy to build applications that perform machine-to-machine bitcoin micropayments over HTTP . The talk will show how to use this software to build things like bitcoin-aware intelligent agents and APIs that implement autonomous surge pricing. We ask that audience members bring their laptops to code along with the speaker for a chance to win prizes! This talk is part of the Cambridge Centre for Alternative Finance series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsModelling in Diabetes Cambridge Analysts' Knowledge Exchange Emerge Cambridge DAMTP Atmosphere-Ocean Dynamics North British Functional Analysis (NBFAS)Other talks"Epigenetic studies in Alzheimer's disease" Childhood adversity and chronic disease: risks, mechanisms and resilience. Public innovation: can innovation methods help solve social challenges? Statistical Methods in Pre- and Clinical Drug Development: Tumour Growth-Inhibition Model Example How language variation contributes to reading difficulties and “achievement gaps” Aspects of adaptive Galerkin FE for stochastic direct and inverse problems |