Comparisons

Comparisons

	TOR	Whisper	Orchid	HOPR
Asymptotic message overhead	O(# of hops)	O((# of participants) ^ 2 * TTL)	O(# of hops)	O(# of hops)
Decentral	partially*	✅	✅	✅
Sender anonymity	✅**	❌	??	✅
Receiver anonymity	✅**	✅	??	✅
Incentivations	❌	❌	✅	✅
Privacy-preserving Incentivations	N/A	N/A	❌***	✅

Note: the message overhead is given in Big-O Notation to express the asymptotic amount of messages that are necessary to send a message through the network.

* Not fully decentral due to central directory service.
** If entry node and exit node don't collude.
*** Probably in a future version according to the whitepaper.

For further details, have a look at a more detailed comparison.