dusk-blindbid

KO | EN

gitlite — search

#javascript #python #hacktoberfest #typescript #rust #deep-learning #linux #awesome #kubernetes #vue #security #ios #openai #open-source

(★ 20)

Implementation of the blindbid logic within Zero Knowledge Proofs

dusk-blindbid 최신버젼 다운로드

최종 버전 다운로드 (.zip)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# dusk-blindbid

![Build Status](https://github.com/dusk-network/dusk--blindbid/workflows/Continuous%20integration/badge.svg)
[![Repository](https://img.shields.io/badge/github-dusk--blindbid-blueviolet?logo=github)](https://github.com/dusk-network/dusk-blindbid)
[![Documentation](https://img.shields.io/badge/docs-dusk--blindbid-blue?logo=rust)](https://docs.rs/dusk-blindbid/)

## Contents

This library provides the structures and the logic that the blind bid
protocol requires in order to work. Contains the most important structures:
`Bid` and `Score`.

This means we can do things like:
```rust
use dusk_blindbid::{Bid, Score, V_RAW_MIN, V_RAW_MAX};
use dusk_bls12_381::BlsScalar;
use dusk_pki::{PublicSpendKey, SecretSpendKey};
use dusk_jubjub::{JubJubScalar, JubJubAffine, GENERATOR_EXTENDED};
use rand::{Rng, thread_rng};

// Generate a Bid from some fields we have.
let mut rng = thread_rng();
let secret = JubJubScalar::random(&mut rand::thread_rng());
let secret_k = BlsScalar::random(&mut rand::thread_rng());
let pk_r = PublicSpendKey::from(SecretSpendKey::new(
    JubJubScalar::one(),
    -JubJubScalar::one(),
));
let stealth_addr = pk_r.gen_stealth_address(&secret);
let secret = GENERATOR_EXTENDED * secret;
let value: u64 = (&mut thread_rng()).gen_range(V_RAW_MIN..V_RAW_MAX);
let value = JubJubScalar::from(value);
let elegibility_ts = u64::MAX;
let expiration_ts = u64::MAX;
let poseidon_tree_root = BlsScalar::random(&mut thread_rng());

let bid = Bid::new(
     &mut rng,
     &stealth_addr,
     &value,
     &secret.into(),
     secret_k,
     elegibility_ts,
     expiration_ts,
 )
 .expect("Bid creation error");

// Generate fields for the Bid & required by the compute_score
let consensus_round_seed = BlsScalar::random(&mut thread_rng());
let latest_consensus_round = 50u64;
let latest_consensus_step = 50u64;

// Generate a ProverID attached to the `Bid`.
let prover_id = bid.generate_prover_id(
    secret_k,
    BlsScalar::from(consensus_round_seed),
    BlsScalar::from(latest_consensus_round),
    BlsScalar::from(latest_consensus_step),
);

// The next step is only doable if `std` feature is enabled.

// Generate a `Score` for our Bid with the consensus parameters
 let score = Score::compute(
     &bid,
     &secret.into(),
     secret_k,
     poseidon_tree_root,
     consensus_round_seed,
     latest_consensus_round,
     latest_consensus_step,
 ).expect("Score generation error");
```

## Rationale & Theory

In order to participate in the SBA consensus, Block generators have to
submit a bid in DUSK. As long as their bid is active - and their full-node
is connected with the internet and running- they are participating in the
consensus rounds. Essentially, every time a consensus round is run, the
Block Generator software generates a comprehensive zero-knowledge proof, and
executes various steps in order to generate a valid candidate block, and
compete with the other Block Generators for a chance to become the winner of
the consensus round.

![](https://user-images.githubusercontent.com/1636833/107039506-468c9e80-67be-11eb-9fb1-7ba999b3d6dc.png)

Below we describe the three main processes that happen
every consensus round. Please note that 1 and 2 are run as part of the same
algorithm.

### 1: Score generation.
Block Generators obtain a score from a lottery by executing the Score
Generation Function. The score is positively influenced by the amount of
DUSK that the Block Generator bids. In other words, the higher the bid, the
better the chance to generate a high score. This is important to guarantee
_Sybil attack_ protection.

Without this link a bad actor could subvert the reputation system by
creating multiple identities. Also note: there are _minimum_ and _maximum_
thresholds that determine the minimum and maximum size of the bid.

### 2. Proof of Blind-Bid Generation.

In general computing science, a circuit is a computational model through
which input values proceed through a sequence of gates, each of which
computes a specific function. In our case, the circuits perform the logical
checks with public and private inputs to make sure that the generated Blind
Bid proofs are generated by the rules of the game. For explanatory reasons,
we define two circuits although in practice, these two are a collection of
gadgets added up together in order to compose the BlindBidCircuit.

For further information regarding the circuits, please check the
[blindbid-circuits crate](https://github.com/dusk-network/rusk/tree/master/circuits/blindbid)

### 3. Propagation.
During each consensus round, the Block Generator checks
the score that he produced, and verifies whether it is greater than the
_**minimum score threshold**_. If it is indeed greater, then the Block
Generator generates the aforementioned proofs and propagates the score
obtained, the zero-knowledge proof computed and various other elements
alongside the Block Candidate to his peers in the network.
The Block Generator that computed the highest score is considered to be the
leader of the current iteration of the consensus.

## Documentation
The best usage example of this library can actually be found in the Bid
contract. This is the place where this lib provides all it's
functionallities together with PoseidonTrees and Zero Knowledge Proofs.
See: <https://github.com/dusk-network/rusk/tree/master/contracts/bid for more info and detail.>

You can also check the documentation of this crate [here](https://docs.rs/dusk-blindbid/0.5.0/).

## Licensing
This code is licensed under Mozilla Public License Version 2.0 (MPL-2.0).
Please see [LICENSE](https://github.com/dusk-network/dusk-blindbid/blob/master/LICENSE) for further info.

## About
Protocol & Implementation designed by the [dusk](https://dusk.network) team.

## Contributing
- If you want to contribute to this repository/project please, check [CONTRIBUTING.md](https://github.com/dusk-network/dusk-blindbid/blob/master/CONTRIBUTING.md)
- If you want to report a bug or request a new feature addition, please open
  an issue on this repository.

License: MPL-2.0

dusk-blindbid

dusk-blindbid 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

dusk-blindbid

dusk-blindbid 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

Download README