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
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.)