Understanding Plonky2 Goldibear

What makes Plonky2 Goldibear such a game-changer for the Telos blockchain? The community has been abuzz, breaking down its technical innovations and sharing insights across various platforms.

In this article, we’ve compiled key community tweets alongside our own in-depth explanation to help you better understand Plonky2 Goldibear’s significance.

View the original post on X

What is Plonky2?

To understand Plonky2 Goldibear, let's first cover the basics of Plonky2—a Zero Knowledge proof (ZKP) technology.

Plonky2 is a cryptographic proving system developed by Polygon. (It’s based on Plonk arithmetization and FRI polynomial commitment scheme.)

So, Plonky2 generates Zero Knowledge proofs (ZKPs).

What are ZKPs?

ZKPs allow secure and efficient verification of computations without revealing the underlying data.

Imagine renting a car. Typically, you'd have to provide sensitive details like your driver’s license, personal info, and credit card details to the rental company.

Now, picture doing this through a blockchain: while it would be secure, sharing your license or private information on a public ledger isn’t ideal.

This is where ZKPs come in. With ZKPs, you can prove that you have a valid driver’s license without revealing any of your personal data.

It allows the rental company to verify you’re eligible, but your sensitive information stays private—making services like car rentals on blockchain not just possible, but safe and efficient.

View the original post on X

What makes Plonky2 special?

View the original post on X

One of Plonky2's standout features is the ability to create customizable circuits. This allows developers to tailor highly efficient solutions to specific use cases.

This flexibility allows Plonky2 to implement fast recursive proof composition, which enables bundling multiple proofs into a single proof.

This capability makes ZK proof on-chain verification more scalable (can handle more users and more L2s) and faster without sacrificing security.

View the original post on X

What is Plonky2 Goldibear? A Playful Name with Complex Functions

Now that we understand Plonky2, let's look at Goldibear and why it's significant.

Plonky2 Goldibear is the latest iteration of the Plonky2 prover, developed by our team at the Telos Foundation.

It is used for generating Zero Knowledge proofs.

What makes Plonky2 Goldibear different?

It supports generating proofs over both the Goldilocks and BabyBear fields, while the original Plonky2 only supported Goldilocks.

Field?

A field is a mathematical system that enables secure computations and proofs in cryptography by providing a set of elements and operations that follow specific rules.

In recent times, various zkVMs, such as SP1 and Risc0, have adopted the BabyBear field due to its smaller size and the Poseidon 2 hash function for its boost in performances, introducing the need for fast and efficient proof aggregation over this field, alongside the existing Goldilocks field.

Plonky2 Goldibear addresses this need by supporting both fields and hash functions, meaning it can adapt efficiently depending on the task at hand.

View the original post on X

This multi-field capability allows Plonky2 Goldibear to perform cryptographic tasks significantly faster than previous systems.

View the original post on X

For example: the compression of a Risc0 proof is much faster using Plonky2 Goldibear with Babybear, while the compression of a Hermez ZK-EVM proof is much faster using Plonky2 Goldibear over Goldilocks.

Plonky2 is designed for fast recursive proof composition

View the original post on X

Plonky2 is designed for fast recursive proof composition which enables bundling multiple proofs into a single proof.

Recursive proofs allow multiple proofs to be bundled together and verified at once. This makes on-chain proof verification more scalable, meaning they can grow without slowing down.

With Plonky2 Goldibear, these recursive proofs are generated at high speed.

For example, it can aggregate 1024 Risc0 proofs in just 6.10 seconds instead of the minutes needed to perform the same task on the same Hardware using Risc0.

Plonky2 Goldibear integrates Plonky3’s Optimizations.

Plonky2 Goldibear leverages the advances made in Plonky3, particularly in field arithmetic and hash primitive implementations. By integrating Plonky3’s optimizations, Plonky2 Goldibear can take full advantage of future improvements, making it highly adaptable and forward-compatible.

SNARKtor and Plonky2 Goldibear: A Perfect Match

View the original post on X

The integration of Plonky2 Goldibear into the SNARKtor protocol represents a significant step forward in improving the overall efficiency and capabilities of our decentralized proof aggregator. By combining the strengths of Plonky2 Goldibear, particularly its efficient handling of both Goldilocks and BabyBear fields, with the SNARKtor protocol, we anticipate substantial improvements in proof generation and verification speeds.

Conclusion: Faster, More Efficient Proof Generation and Aggregation

View the original post on X

Plonky2 Goldibear represents a significant advancement in cryptographic proof generation and aggregation. It's particularly efficient in recursive proof composition over the BabyBear field.

By combining advanced cryptography with cutting-edge efficiency, Plonky2 Goldibear brings us closer to a future where blockchains are faster, more efficient, and more scalable—paving the way for businesses and developers to build more advanced applications on this technology and unlocking several use cases in which privacy is crucial for users.

Originally published on X: Understanding Plonky2 Goldibear