Reed's Law & Group-Forming Networks
David P. Reed · 2001
"Reed argued that tools that let users form groups — not just connect one-to-one or broadcast one-to-many — have value that scales as 2^n, vastly outpacing Metcalfe's n², because the number of possible subgroups explodes."
Metcalfe counted connections. Reed counted groups. His 2001 addition: the number of possible subgroups in a network of n people is 2ⁿ, which is why group-forming tools — mailing lists, subreddits, Discord servers — can become explosive once they cross a threshold.
Three laws stack: Sarnoff (value ~ n, broadcast), Metcalfe (value ~ n², pairwise connections), Reed (value ~ 2ⁿ, group formation). Reed's law explains why 'add DMs' rarely transforms a product but 'add user-creatable groups' can — groups generate distinct combinatorial value per subgroup, not per user. Catch: 2ⁿ overstates if groups have no distinct purpose; realized value tracks useful groups, not all possible subsets.
When does Reed's Law most clearly outpace Metcalfe's Law in practice?
Read more about the topic
The explanation above is written with AI assistance. These are the originals — go to them to check it.
- The Law of the Pack — Reed's law & group-forming networks (2001)David P. Reed / Wikipedia
Metcalfe's Law
"A network's value grows roughly with the square of its users, which is why the first users of a network are the hardest to get and the last are nearly free."