Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

feat: range proof proving efficiency #106

Merged
merged 3 commits into from
Sep 14, 2023

Conversation

AaronFeickert
Copy link
Contributor

@AaronFeickert AaronFeickert commented Aug 3, 2023

Description

Adds a brief note about range proof proving efficiency. Adds rough benchmarks against Bulletproofs.

Motivation and Context

It was suggested to add information about proving efficiency to range proof RFC-0181.

Quantifying proving efficiency is more subtle than verification efficiency, since proof generation doesn't reduce to a multiscalar multiplication operation and requires a variable number of rounds. Instead of bogging down the RFC with a long list of group element operation counts, this PR adds a more general note.

Informal benchmark comparing the Tari implementation to the corresponding Bulletproofs fork are included.

How Has This Been Tested?

The changes build and appear to render correctly.

Copy link
Contributor

@hansieodendaal hansieodendaal left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Thanks for the addition. I would add in the numbers as we have it.

src/RFC-0181_BulletproofsPlus.md Show resolved Hide resolved
@AaronFeickert AaronFeickert marked this pull request as draft August 3, 2023 16:54
@AaronFeickert AaronFeickert marked this pull request as ready for review August 3, 2023 17:06
@AaronFeickert AaronFeickert marked this pull request as draft August 3, 2023 21:16
@AaronFeickert AaronFeickert marked this pull request as ready for review August 4, 2023 14:52
Copy link
Contributor

@hansieodendaal hansieodendaal left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

One comment

src/RFC-0181_BulletproofsPlus.md Outdated Show resolved Hide resolved
Copy link
Contributor

@hansieodendaal hansieodendaal left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

ACK

@CjS77 CjS77 merged commit 067855f into tari-project:main Sep 14, 2023
2 checks passed
@AaronFeickert AaronFeickert deleted the range-proving-complexity branch September 14, 2023 14:35
CjS77 pushed a commit that referenced this pull request Dec 19, 2023
Description
---
Adds a brief note about range proof proving efficiency. Adds rough
benchmarks against Bulletproofs.

Motivation and Context
---
It was
[suggested](#103 (comment))
to add information about proving efficiency to range proof
[RFC-0181](https://rfc.tari.com/RFC-0181_BulletproofsPlus.html).

Quantifying proving efficiency is more subtle than verification
efficiency, since proof generation doesn't reduce to a multiscalar
multiplication operation and requires a variable number of rounds.
Instead of bogging down the RFC with a long list of group element
operation counts, this PR adds a more general note.

Informal benchmark comparing the [Tari
implementation](https://github.com/tari-project/bulletproofs-plus) to
the [corresponding Bulletproofs
fork](https://github.com/tari-project/bulletproofs) are included.

How Has This Been Tested?
---
The changes build and appear to render correctly.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

Successfully merging this pull request may close these issues.

None yet

4 participants