From 81930f7fdd06db8482e0d3e036c3a394e56038b0 Mon Sep 17 00:00:00 2001 From: William Banfield <4561443+williambanfield@users.noreply.github.com> Date: Wed, 15 Sep 2021 09:02:34 -0400 Subject: [PATCH] Update docs/rfc/rfc-003-performance-questions.md Co-authored-by: Callum Waters --- docs/rfc/rfc-003-performance-questions.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/rfc/rfc-003-performance-questions.md b/docs/rfc/rfc-003-performance-questions.md index 082de08b7..7b97cf3a5 100644 --- a/docs/rfc/rfc-003-performance-questions.md +++ b/docs/rfc/rfc-003-performance-questions.md @@ -182,7 +182,7 @@ This produces a quadratic increase in messages that are communicated as more val (Each of the N validators must communicate with all other N-1 validators). This large number of messages communicated per step has been identified to impact -performance of the protocol. Given this that number of messages communicated has been +performance of the protocol. Given that the number of messages communicated has been identified as a bottleneck, it would be extremely valuable to gather data on how long it takes for popular chains with many validators to gather all votes within a step.