Scan to Download Gate App
qrCode
More Download Options
Don't remind me again today

This spring, I met Dr. Yamamoto in Tokyo. This former origami mathematician and current chief Cryptography expert of a certain privacy chain project demonstrated the core logic of zk-SNARKs using a regular piece of paper in a tatami room covered with draft papers.



He folded a paper crane and said: "The key is not in the shape of the crane, but in the geometric relationship of the folds." At that moment, I suddenly understood - a good privacy scheme is not just a pile of technology, but more like an artistic processing of information.

**The Recursive Magic in the Creases**

Dr. Yamamoto's team proposed the "proof of origami theory" in their 2023 paper. They discovered an astonishing mathematical similarity between the traditional origami "mountain valley fold" and recursive zk-SNARKs — both compress complex structures into a concise form through layers of folding.

The actual test data is impressive. On the test network, 5000 privacy transactions were compressed into a proof file of 2.7KB. This size is only 1/50 of traditional ZK proofs, but the verification speed has increased by 18 times.

Dr. Yamamoto made an analogy: "It's like a scroll from the Edo period. Unfolded, it reveals a thousand demons and spirits, but rolled up, it's just one axis."

**Adjustable Stealth**

What is more interesting is the "fade-in and fade-out" privacy model implemented by the project. Unlike the binary choice of full transparency or full anonymity, this system allows users to dynamically adjust the level of information disclosure. It's like dressing transactions in a programmable invisibility cloak—how much to reveal is up to the user.
View Original
This page may contain third-party content, which is provided for information purposes only (not representations/warranties) and should not be considered as an endorsement of its views by Gate, nor as financial or professional advice. See Disclaimer for details.
  • Reward
  • 7
  • Repost
  • Share
Comment
0/400
BloodInStreetsvip
· 14h ago
It sounds like another "revolutionary technology" story... origami theory, artistic processing, Programmability stealth clothing, sounds pretty nice. The question is when can we buy the dip on this thing, is it still a value trap now?
View OriginalReply0
LayoffMinervip
· 14h ago
Is origami used for zk-SNARKs? This idea is amazing, but I need to see the data if it can really be 1/50th the volume... What’s going on with humans actually using origami for Cryptography? It's so cyberpunk. This adjustable invisibility cloak sounds good, but I'm afraid it's still pseudo-privacy... Dr. Yamamoto's metaphor is spot on, but I wonder how it works in practice. Can 2.7KB handle 5000 transactions? Whether that's true depends on the difference between the Testnet and Mainnet. Creases as proof, this guy really thinks outside the box. The gradual visibility model seems useful in certain scenarios; it's definitely more comfortable than full exposure. The Edo scroll metaphor gets carried away, but the real challenge for ZK is large-scale application, not just comparisons. The term programmable invisibility cloak sounds flashy, but do users really need such granular control? The story of an origami mathematician turning into a cryptographer is worth hearing.
View OriginalReply0
MelonFieldvip
· 14h ago
Origami ZK proof? Come on, it sounds like metaphysics. Is it true that 5000 transactions are compressed to 2.7KB? Is there any open source code? Verification is nearly 18 times faster; isn't it a bit unhappy not to brag about it? The invisibility cloak gives me a headache. Is it about privacy or just sneaking around? Dr. Yamamoto's use of paper cranes to explain Cryptography is amazing, but what about TPS? What happened to the promised throughput?
View OriginalReply0
BearMarketSagevip
· 14h ago
The origami proof sounds fancy, but 2.7KB compressed 50 times? That's a bit over the top, isn't it?
View OriginalReply0
MetadataExplorervip
· 14h ago
The combination of origami and Cryptography is indeed a fresh perspective; however, the 2.7KB figure needs to be assessed based on its practical application in real scenarios.
View OriginalReply0
SchrödingersNodevip
· 14h ago
Origami for ZK proofs, this guy is really something interesting. The metaphor of the paper crane is indeed brilliant... Is that compression ratio of 1/50 real? Programmability invisibility cloak sounds very cool, but can it really be used?
View OriginalReply0
BearMarketBarbervip
· 14h ago
Origami for ZK proofs? This guy is really crazy, 2.7KB compressing 5000 transactions at 18 times faster, this number needs to be verified.
View OriginalReply0
  • Pin
Trade Crypto Anywhere Anytime
qrCode
Scan to download Gate App
Community
  • 简体中文
  • English
  • Tiếng Việt
  • 繁體中文
  • Español
  • Русский
  • Français (Afrique)
  • Português (Portugal)
  • Bahasa Indonesia
  • 日本語
  • بالعربية
  • Українська
  • Português (Brasil)