Big-O scaling
Computer science has this thing called “big-O notation” (that’s O as in “oh”, not zero). It is a way of describing how algorithms behave as they’re given bigger problems to solve.
During the Great Maximum Blocksize Debate, there have been repeated claims that “Bitcoin is not scalable, because it is O(n2).” N-squared scaling is not sustainable; double N, and you need four times the resources (memory or CPU).
https://gavinandresen.svbtle.com/are-bigger-blocks-dangerous
Topic: [2015-09-20] Gavin Andresen: Big-O scaling (Read 294 times)
Jump to: