Differences between revisions 2 and 11 (spanning 9 versions)
⇤ ← Revision 2 as of 2026-06-19 02:32:10 →
Size: 3200
Editor: KeithLofstrom
Comment:
← Revision 11 as of 2026-06-19 02:40:05 → ⇥
Size: 3197
Editor: KeithLofstrom
Comment:
Deletions are marked like this. Additions are marked like this.
Line 4: Line 4:
 . [[ Mehran Gul | https://mehrangul.com/ ]] . 2026 . Bvtn Lib 338.084  . [[ https://mehrangul.com/ | Mehran Gul ]] . 2026 . Bvtn Lib 338.084
Line 108: Line 108:
 .p115n [[ https://www.radixdlt.com/blog/blockchains-are-broken-here-is-why | Radix Blog 2018 Feb. 8 "Why blockchains don't scale"  .p115n [[ https://www.radixdlt.com/blog/blockchains-are-broken-here-is-why | Radix Blog 2018 Feb. 8 "Why blockchains don't scale" ]]
Line 110: Line 110:
  . '''wrong!''' Neither Mehran Gul nor blogger Dan Hughes mentions [[ https://en.wikipedia.org/wiki/Merkle_tree | Merkel Trees ]], which is how many individual transaction hashes are combined into trees of hierarchical hashes and and one top hash. For a binary tree of N transactios, the hash process to VERIFY '''ONE''' individual transaction uses order log2(N) time. Tracing a single transaction out of a million transactions takes only twice as long as one out of a thousand transactions, and one out of a trillion takes only twice as long as a million. Meanwhile, computation continues to get faster, hence as the tree grows from a million to a trillion, the hardware speed will more than double, and the verification time will become smaller.
  . organizing and distributing all that data is a challenge; the global cost of that may be much larger than the block reward in bitcoins, but that cost is distributed among thousands (millions?) of miners and aggregators		   . '''Wrong!''' Neither Mehran Gul nor blogger Dan Hughes mentions [[ https://en.wikipedia.org/wiki/Merkle_tree | Merkel Trees ]], which is how many individual transaction hashes are combined into trees of hierarchical hashes and and one root hash. For a binary tree of N transactions, the hash process to VERIFY '''ONE''' individual transaction uses order log2(N) time. Tracing a single transaction out of a million transactions takes only twice as long as one out of a thousand transactions, and one out of a trillion takes only twice as long as a million. Meanwhile, computation continues to get faster, hence as the tree grows from a million to a trillion, the hardware speed will more than double, and the verification time will become smaller.
  . Organizing and distributing all that data is a challenge; the global cost of that may be much larger than the block reward in bitcoins, but that cost is distributed among thousands (millions?) of miners and aggregators
Line 145: Line 145:



The New Geography of Innovation

The Global Contest for Breakthrough Technologies

.p001 Introduction , Cpitalism with an Emoji Face

  • p009 Fig 1: Top ten #private >$B tech companies - US 1720, China 438, UK 183, Israel 119, India 117 ... 10

  • p010 Fig 2: Top ten venture dollars invested - US 190.2, China 38.5 , UK 16.2, India 13.5, ... 3.4
  • p012 Fig 4: WIPO Global Innovation Index - Switzerland 66, Sweden 62.6, US 61.7, ... 56.6 China

.p015 Ch1 . The Precocious Student

  • p015
  • p016
  • p017
  • p017
  • p018
  • p019
  • p020
  • p021
  • p021
  • p022
  • p022
  • p023
  • p024
  • p024
  • p025
  • p025
  • p026
  • p027
  • p028
  • p028
  • p029
  • p030
  • p030
  • p031
  • p033
  • p033
  • p034
  • p035
  • p037
  • p037
  • p045
  • p046
  • p046
  • p047
  • p047
  • p048
  • p049
  • p050
  • p050
  • p051
  • p052
  • p052
  • p053

.p055 Ch2 . Steeples of Excellence

  • p056
  • p057
  • p058
  • p059
  • p059
  • p060
  • p060
  • p062
  • p064
  • p065
  • p066
  • p067
  • p067
  • p070
  • p071
  • p072
  • p074
  • p075
  • p076
  • p077
  • p078
  • p079
  • p080
  • p081
  • p082
  • p083
  • p084
  • p086
  • p087
  • p089
  • p091
  • p092
  • p095
  • p095
  • p096

.p097 Ch3 . Busting Monasteries

  • p097
  • p099
  • p101
  • p107
  • p112
  • p114
  • p115
  • p115

  • p115n Radix Blog 2018 Feb. 8 "Why blockchains don't scale"

    • "Every node processes each and every transaction, keeping a record of the entire blockchain."

    • Wrong! Neither Mehran Gul nor blogger Dan Hughes mentions Merkel Trees, which is how many individual transaction hashes are combined into trees of hierarchical hashes and and one root hash. For a binary tree of N transactions, the hash process to VERIFY ONE individual transaction uses order log2(N) time. Tracing a single transaction out of a million transactions takes only twice as long as one out of a thousand transactions, and one out of a trillion takes only twice as long as a million. Meanwhile, computation continues to get faster, hence as the tree grows from a million to a trillion, the hardware speed will more than double, and the verification time will become smaller.

    • Organizing and distributing all that data is a challenge; the global cost of that may be much larger than the block reward in bitcoins, but that cost is distributed among thousands (millions?) of miners and aggregators
  • p116n 2014 New Yorker, 2024 Dec. 15 John Colapinto "Material Question"
  • p117
  • p117
  • p117
  • p118

  • here is where I stopped reading; another library patron wants the book. The book isn't great, so I may not request it again

.p137 Ch4 . Hyper Gap

  • p1

.p168 Ch5 . Smart Nation

  • p1

.p201 Ch6 . Small Wonder

  • p2

.p236 Ch7 . The New Mittelstand

  • p2

.p267 Ch8 . Importing Genius

  • p2

.p300 Conclusion . Social Animals

  • p3

GeographyInnovation (last edited 2026-06-19 02:40:05 by KeithLofstrom)