pezkuwi-subxt

mirror of https://github.com/pezkuwichain/pezkuwi-subxt.git synced 2026-05-06 17:18:03 +00:00

Files

T

Bastian Köcher 217c4be226 Make BlockImport and Verifier async (#8472 )

* Make grandpa work

* Introduce `SharedData`

* Add test and fix bugs

* Switch to `SharedData`

* Make grandpa tests working

* More Babe work

* Make it async

* Fix fix

* Use `async_trait` in sc-consensus-slots

This makes the code a little bit easier to read and also expresses that
there can always only be one call at a time to `on_slot`.

* Make grandpa tests compile

* More Babe tests work

* Fix network test

* Start fixing service test

* Finish service-test

* Fix sc-consensus-aura

* Fix fix fix

* More fixes

* Make everything compile *yeah*

* Fix build when we have Rust 1.51

* Update client/consensus/common/src/shared_data.rs

Co-authored-by: André Silva <123550+andresilva@users.noreply.github.com>

* Update client/consensus/common/src/shared_data.rs

Co-authored-by: André Silva <123550+andresilva@users.noreply.github.com>

* Update client/consensus/common/src/shared_data.rs

Co-authored-by: André Silva <123550+andresilva@users.noreply.github.com>

* Update client/consensus/common/src/shared_data.rs

Co-authored-by: André Silva <123550+andresilva@users.noreply.github.com>

* Update client/consensus/common/src/shared_data.rs

Co-authored-by: André Silva <123550+andresilva@users.noreply.github.com>

* Update client/consensus/babe/src/tests.rs

Co-authored-by: André Silva <123550+andresilva@users.noreply.github.com>

* Update client/consensus/babe/src/tests.rs

Co-authored-by: André Silva <123550+andresilva@users.noreply.github.com>

* Fix warning

Co-authored-by: André Silva <123550+andresilva@users.noreply.github.com>

2021-03-30 09:19:49 +00:00

src

Make BlockImport and Verifier async (#8472 )

2021-03-30 09:19:49 +00:00

Cargo.toml

Make BlockImport and Verifier async (#8472 )

2021-03-30 09:19:49 +00:00

README.md

prepping for releasing rc6 (#6922 )

2020-08-20 17:04:42 +02:00

README.md

Aura (Authority-round) consensus in substrate.

Aura works by having a list of authorities A who are expected to roughly agree on the current time. Time is divided up into discrete slots of t seconds each. For each slot s, the author of that slot is A[s % |A|].

The author is allowed to issue one block but not more during that slot, and it will be built upon the longest valid chain that has been seen.

Blocks from future steps will be either deferred or rejected depending on how far in the future they are.

NOTE: Aura itself is designed to be generic over the crypto used.

License: GPL-3.0-or-later WITH Classpath-exception-2.0