ЦИФРОВОЙ ПОТОК [DRiver]
5 subscribers
29.4K photos
8 videos
158K links
Конвергенция блокчейна, искусственного интеллекта и квантовых технологий представляет собой передний край инноваций.
Download Telegram
ЦИФРОВОЙ ПОТОК [DRiver]
Photo
Elon Musk
AI will obviate search @grok

JUST GROK IT: GOOGLE SEARCH SLIPS BELOW 90% FOR FIRST TIME SINCE 2015

After a decade of ruling the web, Google’s grip is cracking.

Global search share fell to 89.71% in March - its first real stumble since 2015.

Turns out people are done scrolling through SEO sludge and ads pretending to be answers.

AI search is eating Google’s lunch.

Why dig through link farms when you can just Grok it and get straight to the point?

Users want answers, not blue links.

The age of typing “Reddit” after every query is ending - and Google knows it.

Source: Statcounter
- Mario Nawfal
tweet
ЦИФРОВОЙ ПОТОК [DRiver]
Photo
Elon Musk
RT @spacesudoer: The title of the upcoming talk by @elonmusk is "Mars 2026 Company Talk" in SpaceX's source code.

Mars 2026 LFG!!! https://t.co/dbDxjbBkLQ
tweet
Elon Musk
RT @ElonClipsX: Elon Musk: The sun provides basically 100% of the energy in the solar system.

“One way to look at civilization is progress on the Kardashev scale. Kardashev scale 1 means you've harnessed all the power of a planet. I think we've probably harnessed less than 1% of the power of Earth. Kardashev scale 2 is you've harnessed all the power of your sun.

The sun is overwhelmingly the largest source of energy in the solar system. Everything else maybe amounts to about a trillionth of the energy in the solar system, compared to the sun. So, it rounds up to 100%. That's how much of the energy in the future will be solar, when you view things from a Kardashev standpoint.”

Future Investment Initiative Conference, October 29, 2024
tweet
chainyoda
RT @sreeramkannan: Forkonomics: Why Public-Blockchains Almost Always Converges

Sreeram Kannan & ChatGPT–o3
May 2025


Abstract

Although anyone can cryptographically fork a blockchain, only one history typically retains lasting economic value. We develop a simple replicator-dynamics model that separates a one-time switching cost (cₙ) from an ongoing overhead (cₒ) and defines utility as the fraction of users you can transact with. In the two-chain model (Fork vs Legacy), the one-time cost creates a threshold

x* = ½ + cₙ⁄(2κ)

Forks below x* collapse; forks above snowball. Extending to three strategies (including dual-homing) with “set-based” utility shows that maintaining two wallets adds no extra reach when user sets overlap, so dual-homing is always dominated by single-homing if cₒ > 0. Historical cases (BTC–BCH ’17, ETH–ETC ’16, ETH–PoW ’22) align perfectly.



1. Key Definitions

All utilities are “utils per coin”
•κ: network-effect slope (utility if you alone cover 100 % of users)
•cₙ: one-time cost to switch your coin from Legacy to Fork
•cₒ: per-period overhead for holding two wallets
•x: fraction of users on the Fork (two-strategy model)
•(p, q, r): shares on Fork-only, Legacy-only, Dual (three-strategy model)



2. Replicator Primer

When strategies earn payoffs Uᵢ, their population share xᵢ evolves as:

ẋᵢ = xᵢ·(Uᵢ – Ē), Ē = Σⱼ xⱼ Uⱼ

Better-than-average strategies grow; shares stay in [0,1] and sum to 1.



3. Model I: Fork vs Legacy with a One-Time Barrier

Utility functions
•U_F(x) = κ·x
•U_L(x) = κ·(1–x)

Define net switching gain ΔU = κ(2x–1). Users only switch if ΔU > cₙ. This gives a “threshold replicator”:

ẋ = (1–x)·[ΔU – cₙ]₊ – x·[–ΔU]₊

where [z]₊ = max(z,0).

Knife-edge threshold

ΔU > cₙ ⇔ x > x* = ½ + cₙ⁄(2κ)

•If x(0) < x*, it decays to 0.
•If x(0) > x*, it grows to 1.



4. Model II: Multi-Homing with Set-Based Utility

Now allow a dual-homing option. Let p,q,r be shares on Fork-only, Legacy-only, and Dual. Define s_F = p+r, s_L = q+r.

Set-based utility (you only care about the distinct set of reachable users):
•U_F = κ·s_F
•U_L = κ·s_L
•U_B = κ·max(s_F, s_L) – cₒ

Because max(s_F, s_L) = the larger single-chain set, dual-homing never provides extra reach when cₒ > 0. Under replicator dynamics, the dual share r monotonically decays to zero and the system reduces to the two-strategy threshold model on (p,q).



5. Main Insights
•Adoption Threshold: One-time cost cₙ raises the required initial support from 50 % to x* = ½ + cₙ⁄(2κ).
•No Dual Advantage: If user-sets overlap fully, dual-homing adds no new counterparties—so any ongoing overhead cₒ strictly punishes it.
•Majoritarian Outcome: The fork above the threshold wins; all others collapse economically.
•Empirical Fit: BTC–BCH ’17, ETH–ETC ’16, ETH–PoW ’22 all began below x* given realistic κ and cₙ estimates and subsequently lost nearly all value.
•Governance Lesson: Before hard-forking, secure > x* stakeholder support via off-chain signaling or staking to avoid splitting economic value.



6. Conclusion

By modeling utility as the size of your reachable counterparty set—and cleanly separating sunk versus ongoing costs—we show why blockchain forks almost always converge onto a single history, and why even allowing dual-homing can’t overturn this majority-wins threshold.
tweet
ЦИФРОВОЙ ПОТОК [DRiver]
Photo
Bitcoin Archive
RT @BTC_Archive: Pullbacks on an uptrend are normal.
Remember Nov-Dec 2024?

Bitcoin kept powering up +$20K in 6 weeks
...AFTER the near vertical take-off. https://t.co/3lb5NiORd3
tweet
Bitcoin Archive
💥BREAKING: Pakistan allocates 2,000mw of electricity to Bitcoin mining and Ai - Bloomberg
tweet