Evaluating BlockCypher's Confidence Level
- Dean Makovsky
- Vignesh Kuppusamy
- Kevin Zhao
- Joseph Tobin
Assignments for Friday Viggy - programatically connect to nodes Kevin - progarmatically send/create transaction Joe - figure out protocol for sending transaction (how many RTT does it take?) and how they propagate through the network. Also how much time to validate a transaction? This might depend on the type of node it is... Dean - protocol for asking Node neighbors & constructing graph ->BitNodes 21 has open source GitHub code
look into python Graph visualization
We intend to test the efficacy of the confidence level provided by Blockcypher. We will test various methods of “tricking” the confidence level provided by Blockcypher in an attempt to create a fraudulent transaction that Blockcypher recognizes as having a high confidence level.
Our process for this is to first map out the entirety of the bitcoin network’s nodes and then attempt to leverage the topology in our double spending attempts. In each attempt we will monitor the confidence level and see how accurately it can predict the chance of double spends. We will attempt to then figure out what the confidence level threshold should be to accept a transaction as valid.
Our expected outcome by the end of the semester will be a report with an analysis of our attempts at tricking BlockCypher’s confidence. The world will benefit from this by having a more accurate estimation of how much BlockCypher’s confidence level can be trusted. If we manage to find valid methods of tricking BlockCypher’s confidence level, then Blockcypher can learn from our methods and make their service more reliable as a result. We can also supply information on what the minimum threshold of confidence should be before a transaction is accepted by a merchant. If we do not manage to find any methods, then we increase, albeit marginally, the level of trust one can place in BlockCypher’s confidence level.
To model latency between nodes, we need to understand how nodes on the Bitcoin network discover each other and how transactions propagate across the network. To create a latency graph, we will send transactions to selected miners and wait to hear responses back from other miners.
Two Bitcoins at the Price of One? http://eprint.iacr.org/2012/248.pdf
An in-depth article that analyzes double spend attacks: https://medium.com/@octskyward/double-spending-in-bitcoin-be0f1d1e8008
Article on Confidence Factor: https://medium.com/blockcypher-blog/from-zero-to-hero-bitcoin-transactions-in-8-seconds-7c9edcb3b734
Have a Snack, Pay with Bitcoin http://www.tik.ee.ethz.ch/file/848064fa2e80f88a57aef43d7d5956c6/P2P2013_093.pdf
- Send transactions to specific nodes programatically
- Investigating connections between miners to create a graph of network latency between nodes.
- Determine which nodes BlockCypher can see
- Create node to target/bombard Blockcypher servers
- Consider conglomerating version info on the network sweep and seeing if any version string indicate BlockCypher code
- http://dev.blockcypher.com/#txconfidence use their raw count against them: send 2 transactions to two halves of the network to work towards a partition
- Getting blocked by miners for relaying bad transactions