> For the complete documentation index, see [llms.txt](https://taraxa.gitbook.io/taraxa-network/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://taraxa.gitbook.io/taraxa-network/tech-whitepaper/further-reading.md).

# Further Reading

## References

#### \[1] C. Schneider, "The biggest data challenges that you might not even know you have," IBM, 25 May 2018. \[Online]. Available: <https://www.ibm.com/blogs/watson/2016/05/biggest-data-challenges-might-not-even-know/> \[Accessed 15 November 2018].

#### \[2] Y. Sompolinsky and A. Zohar, "Secure High-Rate Transaction Processing in Bitcoin," 31 December 2013. \[Online]. Available: <https://eprint.iacr.org/2013/881.pdf>. \[Accessed 30 April 2019].

#### \[3] Y. Sompolinsky and A. Zohar, "PHANTOM, GHOSTDAG: Two Scalable BlockDAG protocols," 2018. \[Online]. Available: <https://eprint.iacr.org/2018/104.pdf>. \[Accessed 17 December 2018].

#### \[4] A. Churyumov, "Byteball: A Decentralized System for Storage and Transfer of Value," 1 October 2016. \[Online]. Available: <https://obyte.org/Byteball.pdf>. \[Accessed 30 April 2019].

#### \[5] "Bitcoin Confirmation," Bitcoin Wiki, \[Online]. Available: <https://en.bitcoin.it/wiki/Confirmation>. \[Accessed 30 April 2019].

#### \[6] J. Chen and S. Micali, "ALGORAND," 26 May 2017. \[Online]. Available: <https://algorandcom.cdn.prismic.io/algorandcom%2Fece77f38-75b3-44de-bc7f-805f0e53a8d9_theoretical.pdf>. \[Accessed 30 April 2019].

#### \[7] S. Micali, M. Rabin and S. Vadhan, "Verifiable Random Functions," in 40th Foundations of Computer Science (FOCS), New York, Oct 1999.

#### \[8] B. Wesolowski. Efficient verifiable delay functions. Cryptology ePrint Archive, Report 2018/623, 2018. <https://eprint.iacr.org/2018/623>.