Network effects in Web 3

or what blockchains have to do with the golden ratio.

– Hey, you should sign up for this new app called whatsapp, we’ll text each other over 3G – Nuh… I am okay with text messages – Sure, your choice. But all of my friends are on whatsapp… – Argh… ok, you are the fourth person to tell me this. Sign me up, I will try

You probably have had a similar conversation in your life. This is network effects in action: the more people use a certain network (whatsapp in this case), the more potential utility this network has for an unregistered person, and thus that person is more likely to join the network.

Important for us is that the new user is converted by the potential utility they can harness from the network, and not by the network’s value. Put another way, for any user of whatsapp it really doesn’t matter how big is whatsapp’s marketcap, it only matters how many of the user’s friends are in the network.

Most networks in Web 2 work in this way. This post explores what happens with network effects in Web 3, and presents two mathematical models: a well-known model for network effects in Web 2, and a new model for network effects in Web 3.

Web 2 vs Web 3: the key difference

We use Ethereum blockchain as an example of a Web 3 network. Let’s explore user’s motivation for joining the Ethereum network, that is buying some ETH. First, because the user may find useful to be able to send and receive ETH and interact with smart contracts on the Ethereum blockchain, the user is drawn to the network by its utility. But in addition, the user also sees that — as the network grows — ETH’s price grows as well, capturing the value of the network. This additional financial incentive to join the network is the key difference between the dynamics of Web 3 compared to Web 2.

Web 2 network effects

Suppose  is the total population, and  is a time-dependent function of the number of participants in some Web 2 network. Let’s investigate the incremental growth of the network, that is the number of users that join the network in one unit of time. The overall pool of people that may join the network at this stage is , while the probability of them joining is governed by the perceived utility of the network. Here we will make a reasonable assumption that the probability is roughly the proportion of friends of a person that are in the network already, which is . As such, we obtain that , and because the incremental growth of the network is really an estimate for the derivative, we arrive at the following differential equation describing the growth of the network in Web 2:

Standard methods to solve a quadratic ODE

(click to see the derivation)

yield the following general form for a function of the number of participants in a Web 2 network:


This is the so called logistic function, which also appears in mathematical models of population growth, spreading of a virus, and many others. Its graph looks as follows:


This function grows exponentially for small  (as long as  is much larger than ). At some point this function stops its exponential behaviour, with the inflection point occuring exactly when . After that point the function asymptotically approaches the level . The fact that this function is well-suited for decsribing technological developments is not new.

Web 3 network effects

We start as before:   is the total population,  is the number of participants in some Web 3 network at time , and we focus on the incremental difference . The overall pool of people that may join the network is still . The first difference between Web 2 and Web 3 models occurs in the next step: the probability of people joining the network is governed not only by the perceived utility, but also by the perceived value of the network. To model this, we imagine that each person outside of a network gets hit by two thoughts: the first thougth is about the potential utility of the network (just as in the Web 2 case), and the second thought is about the potential value (this one is new to the Web 3 case). As in the Web 2 case, after the first thought around people join the network. After the second (new) thought, some of the people that were not convinced by the utility of the network are getting convinced by the value of the network. The number of the people not convinced after the first thought is , while the probability of convincing them is a quadratic expression , which, according to Metcalfe’s law, represents the degree to which the network’s value fulfilled its potential (where 1 is full potential). As such, we obtain that after the second thought people join the network. Combining the numbers of people joining the network after the first and the second thoughts, we obtain that the incremental growth at each step is:

Just as before, the incremental growth of the network is really an estimate for the derivative, so we arrive at the following differential equation describing the growth of the network in Web 3:

After some simplification, this appears to be a fourth degree ODE:

The miraculous fact is that the fourth degree polynomial turns out to have the following 4 roots: 0, 1, , . Note that is the famous golden ratio. Knowing these roots, it is easy to see that

which allows us to solve the differential equation,

(click to see the derivation)

yielding the following  general form for an equation of the number of participants in a Web 3 network:


Note that, unlike function (1) above in the Web 2 case, expression (2) is an equation. While it is possible to solve it for (the equation is quadratic), the answer is not nice. Equation (2) though, despite not being a function, does allow to effectively compare the functions in Web 2 and Web 3.

Web 2 vs Web 3: model comparison

First, let’s denote by the Web 2 model function, and by the Web 3 model function; these are the ftwo unctions we obtained above. Let’s gather their respective equations together below:

Since the above are families of equations (due to the constants), in order to compare and we need to pick “comparable” representatives from these families. It would be logical to take representatives with the same initial value, say , but this turns out to be incinvinient. Instead, let us suppose that the constants are equal: (they determine and are determined by the inital values of course). Now let’s consider both equations as functions , and see when the two graphs intersect:

Recalling the values and , we obtain and so

  • is the level where the graphs of and intersect.

Moreover, it is easy to see that

  • if , and also if .

This determines how is positioned relative to below and above the . Summarizing everything in a concise picture, the two resulting graphs are depicted below.

We see that the network effects in Web 3 are more powerful.

(It is easy to numerically check that the graphs do look as above using this online graphing tool)

Closing thoughts

Web 3 is an extremely complex category of networks involving blockchains, smart contracts and tokens. I have simplified the story considerably, in order to better showcase the differences between Web 2 and Web 3, and also in order for the mathematical model to have a chance to work. As a result, this post has almost no real world applications. Nevertheless, I find it interesting that the difference between Web 2 and Web 3 network effects can be described mathematically in a succinct way. The presented simple framework also gives a glimpse to an uninitiated person for why Web 3 takes network effects to the next level.