@glenweyl @ethereum @a16z @OpenAI @DeepMind Examples in four quadrants:
(i, financial): what you're thinking about
(i, non-financial): censorship-resistant tools for activists
(ii, financial): prediction markets
(ii, non-financial): the ethereum solarpunk community
@glenweyl@ethereum@a16z@OpenAI@DeepMind四个象限中的示例：
（i，财务）：你在想什么
（一、非金融）：活动人士的抗审查工具
（二）金融：预测市场
（二、非财务）：以太坊solarpunk社区
@glenweyl @ethereum @a16z @OpenAI @DeepMind My usual way of splitting this is (i) "protect people from bad governance" vs (ii) "build better governance"
Doing either one requires making moral judgements about bad/better that could be mistaken.
And both (i) and (ii) could be financial or non-financial or in-between.
@glenweyl@ethereum@a16z@OpenAI@DeepMind我通常的拆分方式是（i）“保护人们免受不良治理”与（ii）“构建更好的治理”
做任何一件事都需要对可能出错的坏/好做出道德判断。
（i）和（ii）可以是财务或非财务或介于两者之间。
Possibly the biggest attempt at non-token-holder-centric DAO governance so far. Excited to see where this goes.
👀 https://twitter.com/optimismPB...
The Optimism Collective will be governed co-equally by two houses:
🏛 The Citizens’ House
💰 The Token House
Together, they will drive rapid, SUSTAINABLE growth in Optimism, Ethereum, and the new internet. https://t.co/6kaTkTklXa
这可能是迄今为止非令牌持有者为中心的DAO治理的最大尝试。很高兴看到这一切。
👀 https://twitter.com/optimismPB...
乐观主义集体将由两院共同平等管理：
🏛 公民之家
💰 代币屋
它们将共同推动乐观主义、以太坊和新互联网的快速、可持续增长。https://t.co/6kaTkTklXa
RT: 1/ The goal of @EFDevconnect was to make room for important depth-first discussions, and for magic to happen for Ethereum in 2022.
I hope everyone feels the goal was met! The quality of conversations that happened for protocol R&D, staking, L2, MEV, ZK and more was incredible.
转发：1/@EFDevconnect的目标是为重要的深度优先讨论腾出空间，并在2022年为以太坊创造奇迹。
我希望每个人都觉得目标实现了！协议R&；D、 立桩、L2、MEV、ZK和更多都令人难以置信。
@amasad @tszzl In a high dimensional optimization space, on average you should expect to see few points that are hard to escape in all directioms and lots of saddle points. But the dimension on which you can escape your current saddle point is often hard to find!
@amasad@tszzl在高维优化空间中，平均而言，你应该看到很少几个在所有方向上都难以逃脱的点和很多鞍点。但你能逃离当前鞍点的维度通常很难找到！
@mattyglesias This leads to an interesting deeper question: are there specific areas in which "the morally worse people" are more likely to be factually correct, so we should hear them out?
Admitting hard and cruel-sounding truths about human nature? Accepting taboo tradeoffs? Something else?
@mattyglesias这引出了一个有趣的更深层次的问题：是否有特定领域的“道德较差的人”更可能是事实上正确的，所以我们应该听取他们的意见？
承认关于人性的冷酷无情的真理？接受禁忌权衡？还有别的吗？
@TBSocialist I remember reading the 1849 Proudhon-Bastiat debate when I was in high school (personal interest, not assigned). A very fascinating discussion all around.
@我记得我在高中时读过1849年的普劳东·巴斯夏辩论（个人兴趣，未分配）。这是一场非常有趣的讨论。
RT: We are excited to announce that, with the support of the @ethereum foundation, we have teamed up with @ethStaker to run a 350,000 DAI #QuadraticFunding round on @arbitrum for #OpenSource #PublicGoods in the #Ethereum #staking ecosystem! 🎉
https://blog.clr.fund/350k-eth...
RT：我们很高兴地宣布，在@ Ethunm基金会的支持下，我们已经与@伊斯塔克合作，在AyeEnthon Stand生态系统中的“公有公共产品”的“仲裁”上运行了一个350000 DAI的第二方资助轮。🎉
https://blog.clr.fund/350k-eth...
@LindellYehuda The goal is to invertibly compress elements in [0...2^256-1] into elements in [0...2^256-2].
@LindellYehuda的目标是将[0…2^256-1]中的元素反向压缩为[0…2^256-2]中的元素。
RT: @VitalikButerin Are you familiar with https://github.com/pornin/para... ?
转发：@VitalikButerin你熟悉吗https://github.com/pornin/para... ?
@LindellYehuda But that doesn't guarantee any *specific* hole. f(2^256-1) still outputs 2^256-1. I want the output 2^256-1 to be unreachable.
@LindellYehuda，但这并不保证有任何特定的洞。f（2^256-1）仍然输出2^256-1。我希望输出2^256-1无法访问。
@ArthurB I was not! Wow this is amazing.
Not quite viable for my "compress 32 bytes" use case, but still really cool.
@阿瑟伯我不是！哇，太棒了。
对于我的“压缩32字节”用例来说不太可行，但仍然很酷。
Motivating use cases:
https://twitter.com/VitalikBut...
@domothy A really efficient solution could actually significantly simplify Verkle trees, erasure codes and many other constructions in ethereum, by making 32-byte chunks one-to-one mappable to F_p elements.
发表时间：4年前 作者：vitalik.eth @VitalikButerin激励性用例：
https://twitter.com/VitalikBut...
@domothy是一个非常有效的解决方案，通过将32字节块一对一映射到F_p元素，它实际上可以显著简化Verkle树、擦除代码和以太坊中的许多其他构造。
@tlbtlbtlb f(k) = k, out-of-range.
@tlbtlbtlb f（k）=k，超出范围。
@polymutex Ideally no, but if a trusted setup is truly unavoidable that's fine.
@polymutex理想情况下不会，但如果可信的设置确实不可避免，那也没关系。
@rohitalmelkar Yes. It should be computationally infeasible to discover x where f(x) can't be computed, or (x, y) where x != y but f(x) = f(y).
(Or if the construction has *other* defects, eg. z where f_inv(z) can't be computed, those should also be hard to find)
@是的。在f（x）无法计算的地方，或者（x，y）在x！=但f（x）=f（y）。
（或者，如果建筑有*其他*缺陷，例如无法计算f_inv（z）的z，这些缺陷也应该很难找到）
@jasonhuan_ By definition, a function from [0...2^256-1] to [0...2^256 - 2] can't be truly invertible everywhere; there has to be some x where f(x) can't be computed, or some f(x) = f(y) collision. I want these unavoidable exceptions to be computationally infeasible to discover.
@根据定义，从[0…2^256-1]到[0…2^256-2]的函数不可能处处都是可逆的；必须存在一些不能计算f（x）的x，或者一些f（x）=f（y）碰撞。我希望这些不可避免的例外在计算上不可能被发现。
@domothy A really efficient solution could actually significantly simplify Verkle trees, erasure codes and many other constructions in ethereum, by making 32-byte chunks one-to-one mappable to F_p elements.
@domothy是一个非常有效的解决方案，通过将32字节块一对一映射到F_p元素，它实际上可以显著简化Verkle树、擦除代码和以太坊中的许多其他构造。