b, the daily budget of the adversary to pay for transaction fees.

m, the adjustment parameter that raises or lowers total node operators’ costs by a linear factor to adjust for uncertainty about the true number of nodes and to add costs that are more difficult to compute like CPU and RAM use.

fmin, the minimum fee of the search window. The lower bound of the x axis of the plot.

fmax, the maximum fee of the search window. The upper bound of the x axis of the plot.

nmin, the minimum ring size of the search window. The lower bound of the y axis of the plot.

nmax, the maximum ring size of the search window. The upper bound of the y axis of the plot.

The minimum acceptable effective ring size. The 'restricted' optimum will be above this level.

The maximum budget of Alice, in XMR per day. This is the maximum total cost of aggregate daily fees and storage cost to node operators. The purple solid line forms the budget line.

Trace different values of the minimum effective ring size. This prints red numbers on the plot in the position of the best fee and ring size for each minimum effective ring size. This simulates sweeping the minimum effective ring size line upward through the plot.

Trace different values of the best fee and ring size on Alice's budget line. The trace line will be dotted purple in the position of the best fee and ring size for each choice of (lower) Alice budget. This simulates sweeping Alice's budget line downward through the plot.