diinhwys.eth pfp

diinhwys.eth

@diinhwys

621 Following
51 Followers
diinhwys.eth pfp
0 reply
0 recast
4 reactions
diinhwys.eth pfp
0 reply
0 recast
0 reaction
diinhwys.eth pfp
0 reply
0 recast
0 reaction
diinhwys.eth pfp
0 reply
0 recast
0 reaction
diinhwys.eth pfp
0 reply
0 recast
0 reaction
diinhwys.eth pfp
0 reply
0 recast
1 reaction
diinhwys.eth pfp
2 replies
0 recast
3 reactions
diinhwys.eth pfp
0 reply
0 recast
0 reaction
diinhwys.eth pfp
0 reply
0 recast
0 reaction
diinhwys.eth pfp
0 reply
0 recast
0 reaction
diinhwys.eth pfp
Where is Farcaster still centralized? June 2025 edition Important to call out: our top priority remains user growth. Prematurely solving any of these potential issues below doesn’t help user growth in the near-term. So not a top a priority. May change in the future. 1. Most users use the Farcaster app. A nerf on Farcaster app is de facto censorship from the protocol today. This will change as Coinbase Wallet, Zapper, Uno and other clients come to market. 2. Snapchain write nodes are run by the Farcaster team and Neynar. In theory we can collude to censor additional writes to the protocol. Low likelihood, but possible. Way to solve this is increase number of write nodes. But again, not an issue today. 3. Farcaster “channels” — metadata and creation are centralized. Content has always been decentralized via FIP-2. Creation is not available via API but metadata is. Making some progress on a plan to move channels into FIP-2 without having reliance on the Farcaster app.
1 reply
0 recast
0 reaction
diinhwys.eth pfp
0 reply
0 recast
0 reaction
diinhwys.eth pfp
🔥 TÓM TẮT DRAMA TRUMP – ELON MUSK 1. Khởi nguồn mâu thuẫn Tổng thống Trump đưa ra một dự luật cắt giảm chi tiêu kỷ lục 1.6 nghìn tỷ USD. Mục tiêu: Loại bỏ trợ cấp xe điện, năng lượng sạch (đa phần liên quan đến Tesla, SpaceX). Trump gọi đây là “một trong những dự luật vĩ đại nhất” và cảnh báo nếu không được thông qua, thuế sẽ tăng 68%. 3. Đấu khẩu công khai trên X Trump: “Tôi đã giúp Elon rất nhiều.” “Elon chỉ phản đối khi biết tôi sẽ cắt trợ cấp xe điện.” “Cách tiết kiệm tốt nhất là cắt hợp đồng và trợ cấp chính phủ cho Elon.” “Tôi ngạc nhiên vì Biden chưa làm vậy.” Elon: “Tôi chưa từng được xem dự luật đó.” “Nếu không có tôi, Trump đã thua trong kỳ bầu cử rồi.”
1 reply
0 recast
2 reactions
diinhwys.eth pfp
0 reply
0 recast
1 reaction
diinhwys.eth pfp
0 reply
0 recast
0 reaction
diinhwys.eth pfp
0 reply
0 recast
0 reaction
diinhwys.eth pfp
0 reply
0 recast
0 reaction
diinhwys.eth pfp
A fun math aside, on the idea of splitting a large zk proving workload between multiple provers. Suppose you have N provers, and you have a proving workload that you split into N parts (so, one part per prover). You require provers to pre-register, but registration is open-access. Suppose you have a constant fault rate (eg. 1/5 of registered provers fail). Provers expect to complete in one round (eg. 3s). If one prover fails, other provers have to come in and re-prove that load. How many rounds does it take for the entire workload to get proven? Answer: log*(N) (yes, that's the iterated-log function) Why: In the first round, you go from N unproven workloads to N/5 unproven workloads In the second round, each remaining workload gets assigned 5 provers, so per-workload failure rate becomes 1 in 5^5. So you go to N / 5 / 5^5 unproven workloads In the third round, each remaining workload gets assigned ~5^5 provers, so failure rate is 1 in 5^(5^5). So you go to N / 5 / 5^5 / 5^(5^5) unproven workloads
0 reply
0 recast
0 reaction
diinhwys.eth pfp
0 reply
0 recast
1 reaction
diinhwys.eth pfp
2 replies
0 recast
2 reactions