Anyone Docs
  • πŸ”·The Documentation For Anyone
    • About
    • FAQ
  • πŸ”·Relay Setup
    • Get Started
    • Installation and Usage
      • Setting Your Environment
        • Virtualization on Windows
        • Virtualization on macOS
        • Install Ubuntu Server 22.04
        • Server management with SSH in Windows and macOS
      • Install Anon on Linux
      • Install Anon using the apt repository
      • Update Anon and accept terms and conditions
      • Install Anon in Docker
      • Configure SOCKS5 Proxy for Anyone
      • Install Anyone Exit Relay
    • Troubleshooting Common Issues
      • Diagnosing CGNAT and Public IPv4
      • Confirm ORPort Reachability
    • Firewall and Network Configurations
      • Router Port Forwarding
      • Install and Configure Firewall
    • Advanced Configuration and Troubleshooting
      • Configure IPv4 and IPv6
      • DoS mitigation parameters
    • Relay Operator Standards
    • Exit Relay Guidelines
  • πŸ”·Hardware Setup
    • Setup Guide
    • Description and Specifications
    • Relay Control Panel
      • Home
      • Network Settings
      • Relay Settings
      • Relay Family
      • Proxy Settings BETA
      • Change Password
      • Logs
      • Update
    • Update (Using USB)
    • Update to WEB 3.2.0 (Using UI)
    • Troubleshooting and additional configuration
      • Router Port Forwarding
      • Diagnosing CGNAT and Public IPv4
    • Router Setup
  • πŸ”·Security and Privacy
    • VPS Hardening
  • πŸ”·Rewards Dashboard
    • Registering to the Rewards Program
    • Accessing the Rewards Dashboard
    • Using the Rewards Dashboard
    • Rewards Status
  • πŸ”·Anyone SDK
    • NPM SDK
      • Install NPM Package
      • Run as Library
        • Anon
        • AnonSocksClient
        • AnonControlClient
      • Run from CLI
      • Tutorials
        • Hello Anon World I
        • Hello Anon World II
        • Circuit Control I
        • Circuit Control II
    • Native SDK
      • Anyone Client Releases
      • MAN - Anon Manual
      • Tutorials
        • Anyone Services I
        • Anyone Services II
    • iOS SDK [Beta]
      • Manual Install - CocoaPods
  • πŸ”·Connect to Anyone
    • Connecting to Linux
      • [Beta] One-Click Linux Setup
    • Connecting to macOS
      • macOS with NPM
      • [Beta] One-Click macOS Setup
    • Connecting to Windows
      • [Beta] One-Click Windows Setup
    • Individual Applications with Anyone
    • Connect Through Hardware
  • πŸ”·Tokenomics
    • Introduction
    • Token Distribution
      • Token Outflow
      • Other Tokens
    • Relay Rewards
      • Lock Requirement
      • Lock Adjustments
      • Reward Multipliers
    • Additional Roles
      • Authorities and Staking
      • Governance Voting
    • Premium Circuits
      • Premium Circuits
      • Premium Circuits: Metrics
    • Summary
      • Value Accrual Summary
      • Rewards Case Study
    • Appendix
      • M Derivation
      • Risk Equation Derivation
  • πŸ”·Resources
    • Community and Customer Support
    • Links
    • Token
    • Whitepaper
    • Roadmap
    • API
      • REST
      • [Future] GraphQL
Powered by GitBook
On this page
  • Mathematical Derivation of Risk Equations
  • Conclusion

Was this helpful?

  1. Tokenomics
  2. Appendix

Risk Equation Derivation

Mathematical Derivation of Risk Equations

The mathematical framework for assessing the risk associated with relay families within the Anyone Network is critical for understanding the probability of network compromise due to relay concentration within a single family. This appendix provides a detailed explanation of the equations used to calculate these risks and the simplifications applied for practical implementation.

Basic Definitions and Formula

  • Relay Family (FFF): Represents the number of relays controlled by a single entity or group within the total network.

  • Total Relays (RRR): The total number of operational relays within the Anyone Network.

  • Proportion (sss): Defined as the ratio of the number of relays in a family to the total number of relays, represented by s=FRs = \frac{F}{R}s=RF​.

Probability Calculation for Multiple Hops within One Family

The primary concern is calculating the probability that two or more network hops occur within the same relay family, which could potentially compromise the network’s integrity. The probability P(>=2)P(>=2)P(>=2) of having at least two hops within the same family is derived from combinatorial probabilities as follows:

P(>=2)=1βˆ’[(Rβˆ’sR)(Rβˆ’sRβˆ’1)(Rβˆ’1)(Rβˆ’2)]P(>=2) = 1 - \left[\frac{(R - sR)(R - sR - 1)}{(R-1)(R-2)}\right]P(>=2)=1βˆ’[(Rβˆ’1)(Rβˆ’2)(Rβˆ’sR)(Rβˆ’sRβˆ’1)​]

This formula calculates the probability by first determining the likelihood that the first two hops are not within the family and then subtracting this value from 1.

Simplification and Approximation

The detailed formula can be cumbersome for computation, especially when needing quick calculations within large networks. Thus, a simplification is applied using approximations based on the assumption that the subtraction of 1 and 2 in the denominator & numerator has a minimal impact when compared to the total number of relays RRR, especially as RRR becomes large. These approximations lead to a simplified formula:

Assuming: Rβˆ’sRβˆ’1β‰ˆRβˆ’sRR - sR - 1 \approx R - sR Rβˆ’sRβˆ’1β‰ˆRβˆ’sR Rβˆ’1β‰ˆRR - 1 \approx RRβˆ’1β‰ˆR Rβˆ’2β‰ˆRR - 2 \approx RRβˆ’2β‰ˆRRβˆ’1β‰ˆRRβˆ’2β‰ˆRR - 1 \approx R R - 2 \approx RRβˆ’1β‰ˆRRβˆ’2β‰ˆR

The equation simplifies to: P(>=2)=1βˆ’[(Rβˆ’sR)2R2]P(>=2) = 1 - \left[\frac{(R - sR)^2}{R^2}\right]P(>=2)=1βˆ’[R2(Rβˆ’sR)2​] =1βˆ’(1βˆ’s)2= 1 - (1 - s)^2=1βˆ’(1βˆ’s)2=2sβˆ’s2= 2s - s^2=2sβˆ’s2 =s(2βˆ’s)= s(2 - s)=s(2βˆ’s)

This simplified equation, P(>=2)=s(2βˆ’s)P(>=2) = s(2 - s)P(>=2)=s(2βˆ’s), offers a clean and efficient way to estimate the risk, especially useful in scenarios where RRR is large, and quick estimations are needed.

Graphical Analysis and Validation

To validate this approximation, we can plot the function 1βˆ’(1βˆ’s)21-(1-s)^21βˆ’(1βˆ’s)2 against a direct calculation from the more complex combinatorial formula, particularly for different values of RRR. As shown through calculations:

  • For s=0.05s=0.05s=0.05 or 5%, the probability P(>=2)P(>=2)P(>=2) is approximately 9.75%, which aligns closely with empirical data as RRR increases.

  • Lower values of sss, such as 0.01, show the approximation becomes more accurate as RRR increases, reflecting its utility in large-scale networks.

Application and Boost Calculation

This mathematical framework supports the calculation of Family Boosts, which are designed to incentivize transparency and declaration of family status by relay operators. Boosts are calculated directly from the value sss, with different tiers of boosts applied depending on the size of sss to mitigate the risks associated:

  • Boost for s≀0.05s \leq 0.05s≀0.05: A linear increase in boosts for smaller sss values encourages disclosure without disproportionately rewarding larger families.

  • Boost for s>0.05s > 0.05s>0.05: The growth of the boost amount slows down to prevent excessive concentration of benefits.

Conclusion

The mathematical construction of risk equations provides a robust basis for implementing security measures in the Anyone Network. By utilizing these calculations, the network can effectively manage and mitigate risks associated with relay family concentrations, ensuring a secure and reliable decentralized network environment. This appendix serves as a reference point for understanding the theoretical underpinnings and practical applications of risk assessments within the Anyone Network’s operational framework.

PreviousM DerivationNextResources

Last updated 8 months ago

Was this helpful?

πŸ”·