From 353a1b4d600401f091541da83df0113e3907378e Mon Sep 17 00:00:00 2001 From: Bryan Boreham Date: Mon, 4 Nov 2019 14:26:12 +0000 Subject: [PATCH] Update comment to match code --- routes.go | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/routes.go b/routes.go index 05cbf29..0e72d0f 100644 --- a/routes.go +++ b/routes.go @@ -136,7 +136,7 @@ func (r *routes) lookupOrCalculate(name PeerName, broadcast *broadcastRoutes, es // proportion of peers via that neighbour than other neighbours - then it is // chosen with a higher probability. // -// Note that we choose log2(n_peers) *neighbours*, not peers. Consequently, on +// Note that we choose 2log2(n_peers) *neighbours*, not peers. Consequently, on // sparsely connected peers this function returns a higher proportion of // neighbours than elsewhere. In extremis, on peers with fewer than // log2(n_peers) neighbours, all neighbours are returned.