Skip to content
This repository was archived by the owner on Nov 15, 2023. It is now read-only.

Utility subsystem for actually connecting to network #1205

Merged
rphmeier merged 8 commits into from
Jun 10, 2020
Merged

Utility subsystem for actually connecting to network #1205

Changes from 1 commit
Commits
Show all changes
8 commits
Select commit Hold shift + click to select a range
5895c6b
define subsystems skeleton
rphmeier Jun 4, 2020
7988a27
Create a blank section for each subsystem in the initial batch
rphmeier Jun 4, 2020
3da4420
write out basics for most subsystems
rphmeier Jun 4, 2020
2dddd79
define network bridge subsystem
rphmeier Jun 5, 2020
f63e739
integrate network bridge into network systems
rphmeier Jun 5, 2020
67e7dc1
Apply suggestions from code review
rphmeier Jun 9, 2020
c356643
clean up wording
rphmeier Jun 9, 2020
b510409
Merge branch 'master' into rh-networking-architecture
rphmeier Jun 10, 2020
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
clean up wording
  • Loading branch information
@rphmeier
rphmeier authored Jun 9, 2020
commit c356643b2de432b0ef910841e26708b1502ea73c
2 changes: 1 addition & 1 deletion roadmap/implementors-guide/guide.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -1134,7 +1134,7 @@ Register on startup an event producer with `NetworkBridge::RegisterEventProduce

For each relay-parent in our local view update, look at all backed candidates pending availability. Distribute via gossip all erasure chunks for all candidates that we have to peers.

We define an operation `live_candidates(relay_heads) -> Set<AbridgedCandidateReceipt>` which returns a set of candidates a given set of relay chain heads implies should be currently gossiped. This is defined as all candidates pending availability in any of those relay-chain heads or any of their last `K` ancestors. We assume that state is not pruned within `K` blocks of the chain-head.
We define an operation `live_candidates(relay_heads) -> Set<AbridgedCandidateReceipt>` which returns a set of candidates a given set of relay chain heads that implies a set of candidates whose availability chunks should be currently gossiped. This is defined as all candidates pending availability in any of those relay-chain heads or any of their last `K` ancestors. We assume that state is not pruned within `K` blocks of the chain-head.

We will send any erasure-chunks that correspond to candidates in `live_candidates(peer_most_recent_view_update)`. Likewise, we only accept and forward messages pertaining to a candidate in `live_candidates(current_heads)`. Each erasure chunk should be accompanied by a merkle proof that it is committed to by the erasure trie root in the candidate receipt, and this gossip system is responsible for checking such proof.

Expand Down