
Antalpha ZKML HackerHouse @EthCC Wrap-Up 🥐🇫🇷
Final Curtain! What an extraordinary journey it's been, hosting this exceptional Hacker House in Paris, in conjunction with EthCC 2023, made possible through our collaboration with Hashkey Capital! From July 15th to 24th, 2023, we had the distinct pleasure of providing a creative space for 11 exceptional hackers. This assembly facilitated a fertile ground for collaboration, creation, learning, and an overall joyous experience, while also granting everyone the opportunity to participate i...

Wen Building上线啦 |ep1 当我们谈论如何build Dex时
cover of ep1目录Wen Building 介绍首期播客简介与时间戳首期播客文字稿整理Wen Building 与大家初次见面今天很高兴宣布我们的新 podcast Wen Building 正式上线,并携第一集“当我们谈论如何 build Dex 时——DODO 的实现” 与大家见面啦~logo of Wen BuildingWen Building 这档 podcast 希望通过与海内外 web3 builder 的深入对话,探讨 web3 的前沿技术发展、剖析区块链产品机理、洞察行业趋势与问题、听取各色从业者的经历与体验等,用web3的价值与叙事串联更广泛的交流,撬动更深层的价值创造。 特别感谢 Antalpha Labs 的支持,关于 Wen Building 的最新消息和相关文字稿也将在 Antalpha Labs 的各社交媒体发布。我们的每集内容也将同时在 Apple Podcasts、Spotify、Pocket Casts、Google Podcasts、小宇宙等泛用型播客应用发布,敬请大家关注和收听,我们欢迎任何的建议和反馈! 关于我们 Wen Bui...

Antalpha zkp HackerHouse @ChiangMai Wrap-Up
Hack around the world! On April 29th, Antalpha Labs and Mantle jointly held a zero-knowledge proof (zkp) themed HackerHouse in Chiang Mai, Thailand, which officially came to an end after three wonderful weeks in the beautiful and vibrant city. Prior to this Antalpha HackerHouse (AHH), aside from a brief zkp co-living development at ETHDenver, this marked Antalpha's first time hosting such a large-scale and long-duration HackerHouse abroad. Chiang Mai, as a global and international crypto...

Antalpha ZKML HackerHouse @EthCC Wrap-Up 🥐🇫🇷
Final Curtain! What an extraordinary journey it's been, hosting this exceptional Hacker House in Paris, in conjunction with EthCC 2023, made possible through our collaboration with Hashkey Capital! From July 15th to 24th, 2023, we had the distinct pleasure of providing a creative space for 11 exceptional hackers. This assembly facilitated a fertile ground for collaboration, creation, learning, and an overall joyous experience, while also granting everyone the opportunity to participate i...

Wen Building上线啦 |ep1 当我们谈论如何build Dex时
cover of ep1目录Wen Building 介绍首期播客简介与时间戳首期播客文字稿整理Wen Building 与大家初次见面今天很高兴宣布我们的新 podcast Wen Building 正式上线,并携第一集“当我们谈论如何 build Dex 时——DODO 的实现” 与大家见面啦~logo of Wen BuildingWen Building 这档 podcast 希望通过与海内外 web3 builder 的深入对话,探讨 web3 的前沿技术发展、剖析区块链产品机理、洞察行业趋势与问题、听取各色从业者的经历与体验等,用web3的价值与叙事串联更广泛的交流,撬动更深层的价值创造。 特别感谢 Antalpha Labs 的支持,关于 Wen Building 的最新消息和相关文字稿也将在 Antalpha Labs 的各社交媒体发布。我们的每集内容也将同时在 Apple Podcasts、Spotify、Pocket Casts、Google Podcasts、小宇宙等泛用型播客应用发布,敬请大家关注和收听,我们欢迎任何的建议和反馈! 关于我们 Wen Bui...

Antalpha zkp HackerHouse @ChiangMai Wrap-Up
Hack around the world! On April 29th, Antalpha Labs and Mantle jointly held a zero-knowledge proof (zkp) themed HackerHouse in Chiang Mai, Thailand, which officially came to an end after three wonderful weeks in the beautiful and vibrant city. Prior to this Antalpha HackerHouse (AHH), aside from a brief zkp co-living development at ETHDenver, this marked Antalpha's first time hosting such a large-scale and long-duration HackerHouse abroad. Chiang Mai, as a global and international crypto...
Share Dialog
Share Dialog

Subscribe to Antalpha HackerHouse Media

Subscribe to Antalpha HackerHouse Media
阿维-维格德森 (Avi Wigderson) 获得了 2023 年 ACM A.M. 图灵奖,以表彰他对计算理论做出的奠基性贡献,包括重塑了我们对随机性在计算中的作用的理解,以及他数十年来在理论计算机科学领域的知识领导地位。 Wigderson 是新泽西州普林斯顿高等研究院数学学院的 Herbert H. Maass 教授。他在计算复杂性理论、算法与优化、随机性与密码学、并行与分布式计算、组合学、图论以及理论计算机科学与数学和科学之间的联系等领域一直处于领先地位。
The IEEE Information Theory Society is pleased to announce that Peter Shor is the recipient of the 2025 Claude E. Shannon Award for consistent and profound contributions to the field of information theory.
马修·格林是约翰霍普金斯大学的教授和密码学家,他在下面的两篇博客里面详细的介绍了 Schnorr 签名系统模型、协议和数学原理,博客清晰且重点清晰。
https://blog.cryptographyengineering.com/2023/10/06/to-schnorr-and-beyond-part-1/
https://blog.cryptographyengineering.com/2023/11/30/to-schnorr-and-beyond-part-2/
Zkproof 工作小组关于 Fiat-Shamir Heuristic 的标准化草案,草案作者是 CNRS 的 M. Orrù。草案简洁的定义了Fiat-Shamir Heuristic的接口、步骤和示例。
Network 工作小组关于 Sigma Protocols 的标准化草案,草案作者是 CNRS 的 M. Orrù 和 AIT 的 S. Krenn。草案状态是 Informational,已经包括了丰富的细节和示例。
David,zkSecurity的联合创始人,也是《真实世界的密码学》一书的作者关于交互式算术和迭代约束系统的总结博客,同时包含了一系列相关介绍的链接。
phantom-zone 是一个实验性的多方计算库,它使用多方完全同态加密来计算来自多方的私人输入的任意函数。目前,phantom-zone 的功能相当有限。它提供使用加密的 8 位无符号整数(称为 FheUint8)写入电路的功能,并且仅支持最多 8 方。FheUint8 支持与常规 uint8 相同的算法,介绍文档里面提到了一些例外情况。计划在未来将 API 扩展到其他有符号/无符号类型。
ZK Proofs in Action: Production-Ready Solutions for Real World Apps by Jeremy Bruestle
Interoperability From Coordinated Sequencing & ZK Proofs by Ben Fisch, Espresso Labs
NEBRA UPA: Proof Aggregation for privacy, scaling and interoperability By Shumo Chu
The Endgame for Web3 by Zac Williamson
In this note we show how, given oracle access to $f:{0,1}^m \rightarrow \mathbb{F}$ and a point $z \in \mathbb{F}^m$, to compute $\hat{f}(z)$ using $O\left(2^m\right)$ field operations and only $O(m)$ space.
Introducing Ringtail, the most efficient 2-round lattice-based threshold signature from standard assumptions.
STARK 101 is a hands-on tutorial on how to write a STARK prover from scratch (in Python).
A beginner's course on basic quantum computing algorithms. Background required: basic knowledge of computer programming, probability, and geometry. Knowledge of linear algebra a plus.
阿维-维格德森 (Avi Wigderson) 获得了 2023 年 ACM A.M. 图灵奖,以表彰他对计算理论做出的奠基性贡献,包括重塑了我们对随机性在计算中的作用的理解,以及他数十年来在理论计算机科学领域的知识领导地位。 Wigderson 是新泽西州普林斯顿高等研究院数学学院的 Herbert H. Maass 教授。他在计算复杂性理论、算法与优化、随机性与密码学、并行与分布式计算、组合学、图论以及理论计算机科学与数学和科学之间的联系等领域一直处于领先地位。
The IEEE Information Theory Society is pleased to announce that Peter Shor is the recipient of the 2025 Claude E. Shannon Award for consistent and profound contributions to the field of information theory.
马修·格林是约翰霍普金斯大学的教授和密码学家,他在下面的两篇博客里面详细的介绍了 Schnorr 签名系统模型、协议和数学原理,博客清晰且重点清晰。
https://blog.cryptographyengineering.com/2023/10/06/to-schnorr-and-beyond-part-1/
https://blog.cryptographyengineering.com/2023/11/30/to-schnorr-and-beyond-part-2/
Zkproof 工作小组关于 Fiat-Shamir Heuristic 的标准化草案,草案作者是 CNRS 的 M. Orrù。草案简洁的定义了Fiat-Shamir Heuristic的接口、步骤和示例。
Network 工作小组关于 Sigma Protocols 的标准化草案,草案作者是 CNRS 的 M. Orrù 和 AIT 的 S. Krenn。草案状态是 Informational,已经包括了丰富的细节和示例。
David,zkSecurity的联合创始人,也是《真实世界的密码学》一书的作者关于交互式算术和迭代约束系统的总结博客,同时包含了一系列相关介绍的链接。
phantom-zone 是一个实验性的多方计算库,它使用多方完全同态加密来计算来自多方的私人输入的任意函数。目前,phantom-zone 的功能相当有限。它提供使用加密的 8 位无符号整数(称为 FheUint8)写入电路的功能,并且仅支持最多 8 方。FheUint8 支持与常规 uint8 相同的算法,介绍文档里面提到了一些例外情况。计划在未来将 API 扩展到其他有符号/无符号类型。
ZK Proofs in Action: Production-Ready Solutions for Real World Apps by Jeremy Bruestle
Interoperability From Coordinated Sequencing & ZK Proofs by Ben Fisch, Espresso Labs
NEBRA UPA: Proof Aggregation for privacy, scaling and interoperability By Shumo Chu
The Endgame for Web3 by Zac Williamson
In this note we show how, given oracle access to $f:{0,1}^m \rightarrow \mathbb{F}$ and a point $z \in \mathbb{F}^m$, to compute $\hat{f}(z)$ using $O\left(2^m\right)$ field operations and only $O(m)$ space.
Introducing Ringtail, the most efficient 2-round lattice-based threshold signature from standard assumptions.
STARK 101 is a hands-on tutorial on how to write a STARK prover from scratch (in Python).
A beginner's course on basic quantum computing algorithms. Background required: basic knowledge of computer programming, probability, and geometry. Knowledge of linear algebra a plus.
<100 subscribers
<100 subscribers
No activity yet