summaryrefslogtreecommitdiff
path: root/doc/handbook/chapters/keyconcepts.texi
diff options
context:
space:
mode:
Diffstat (limited to 'doc/handbook/chapters/keyconcepts.texi')
-rw-r--r--doc/handbook/chapters/keyconcepts.texi4
1 files changed, 2 insertions, 2 deletions
diff --git a/doc/handbook/chapters/keyconcepts.texi b/doc/handbook/chapters/keyconcepts.texi
index 42718b245..c5cc395c8 100644
--- a/doc/handbook/chapters/keyconcepts.texi
+++ b/doc/handbook/chapters/keyconcepts.texi
@@ -338,7 +338,7 @@ of random peers in the whole network like gathering statistics,
spreading and aggregating information in the network, load balancing and
overlay topology management.
-The approach chosen in the rps implementation in gnunet follows the
+The approach chosen in the rps implementation in GNUnet follows the
Brahms@uref{https://bib.gnunet.org/full/date.html\#2009_5f0} design.
The current state is "work in progress". There are a lot of things that
@@ -350,7 +350,7 @@ and request random peers that will be returned when they represent a
random selection from the whole network with high probability.
An additional feature to the original Brahms-design is the selection of
-sub-groups: The gnunet implementation of rps enables clients to ask for
+sub-groups: The GNUnet implementation of rps enables clients to ask for
random peers from a group that is defined by a common shared secret.
(The secret could of course also be public, depending on the use-case.)