Skip to content

Conversation

@oleganza
Copy link
Collaborator

This slightly cleans up the dependencies to avoid having bench in the normal build. I have tried to also tweak this for no_std, but it was a bit more work, so i'd leave this for later.

Copy link
Member

@cathieyun cathieyun left a comment

Choose a reason for hiding this comment

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

LGTM!

@oleganza oleganza force-pushed the refactor/range_proof branch from 5a23c64 to c3078b2 Compare February 13, 2018 21:20
@oleganza oleganza merged commit 62cb75f into master Feb 13, 2018
@oleganza oleganza deleted the refactor/range_proof branch April 12, 2018 22:25
hansieodendaal pushed a commit to hansieodendaal/bulletproofs that referenced this pull request Jan 8, 2021
This is closely modelled on Grin's solution, but using two private keys:
- Interfaces:
  - create a rewindable ZK proof with up to 23 bytes additional embedded proof
    data
  - extract the value and 23 bytes proof data only
  - extract the value, blinding factor and 23 bytes proof data
- Required:
  - two rewind nonces, based on two public rewind keys and the value
    commitment
  - two blinding nonces, based on the two private rewind keys and the value
    commitment
- Use:
  - the two rewind nonces are used to extract the value and 23 bytes embedded
    proof data
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

3 participants