Prediction: Users and developers will care even more about decentralized systems, but not for the reasons you think. Here’s the gist:
Blockchains are inherently open systems. Anyone can deploy an app, become a user, or build on other people’s work.
In contrast, traditional web apps are all about collecting data. Facebook, Google, and Amazon are examples of data companies that created massive proprietary databases and fed off users’ data to profit.
You cannot do this on decentralized stacks. Data is available to anyone. You can build a better analytics engine, APIs, or a front-end. But anyone can enter the market, read all the data from the ledgers, and offer a better product.
The result: a highly competitive environment and fast innovation cycles.
As a developer, you’ll have an option: build on a trad stack or a decentralized stack. In the trad stack, you can play the “data” game but won’t be able to a) leverage existing communities, b) build on other apps, c) build on other apps’ data as easily.
In contrast, building on a decentralized stack will allow you to compose with existing userbases, communities, apps, and tooling. Only through decentralization can you ensure growth without borders.
Combining competitive env, rapid innovation, composability, and growth factors will result in better products, and that’s what users want.
• • •
Missing some Tweet in this thread? You can try to
force a refresh
On a high level, an encryption scheme is homomorphic if one can perform field operations over the encrypted messages, E(a) and E(b), that result in simple base operations over the underlying encrypted values.
Have you ever wondered why Threshold ECDSA is painful, Threshold Schnorr is straightforward, and Threshold BLS is trivial? Here's an informal explanation:
Everything comes down to the complexity of the signing equation for each scheme.
All secrets in all schemes are typically distributed across users using Shamir's secret sharing techniques. en.wikipedia.org/wiki/Shamir%27…
Threshold ECDSA sign equation involves multiplication of two secrets (k^{-1} and x, where x is the secret).
s = k^{-1} * (Hash(v) + r * x)