LogoLogo
  • Lumora
    • Welcome to the Lumora GitBook
    • Introduction
    • Decentralized Internet Bandwidth Sharing
    • Problem Landscape
    • Lumora Ecosystem Overview
      • Participants and Roles
      • Interaction Flow within the Network
      • Advantages of Decentralized Networks
    • Architecture and Technical Framework
      • Network Layer Design
      • Browser Extension and DApp Interaction
      • Blockchain-Powered Backend
      • Integration with Decentralized Storage Protocols
    • Smart Contracts and Tokenomics
    • Core Algorithms
      • Bandwidth Allocation Optimization
      • Proximity-Based Task Assignment
      • Adaptive Data Scraping Framework
      • Dynamic Reward Calculation Protocols
    • Privacy and Security Framework
    • Decentralized Data Scraping Protocol
    • AI-Driven Network Enhancements
    • Roadmap
    • Advanced Scraping for Interactive and Dynamic Content
    • Community Engagement
    • Appendices
Powered by GitBook
LogoLogo

Lumora

On this page
  1. Lumora
  2. Core Algorithms

Dynamic Reward Calculation Protocols

The Dynamic Reward Calculation Protocols in the Lumora network ensure fair and transparent distribution of rewards to participants based on their contributions. These protocols leverage blockchain technology to automate and validate the reward process, adapting dynamically to real-time network conditions, contributions, and tokenomics.


Objectives

  • Fair Distribution: Ensure that rewards are proportional to the contributions of bandwidth providers and task executors.

  • Automation: Use smart contracts to eliminate manual intervention and ensure accuracy.

  • Scalability: Adapt to fluctuations in network size and task volume.

  • Incentivization: Encourage sustained participation through dynamic reward adjustments.


Core Components

  1. Proof-of-Bandwidth (PoB):

    • Validates the actual bandwidth contributed by each node.

    • Ensures rewards are based on measurable contributions.

  2. Task Weighting:

    • Rewards are distributed based on task complexity, execution time, and completion status.

  3. Decay Mechanism:

    • Introduces gradual reward reduction over time to ensure long-term token value stability and incentivize early participation.

  4. Reputation System:

    • Rewards are influenced by the node’s reliability and performance history.


Reward Calculation Algorithm

Input Variables:

  • C_i: Contribution of node i (bandwidth or tasks completed).

  • R_total: Total rewards available for distribution in the cycle.

  • T_w: Weight assigned to each task based on complexity.

  • N: Total number of participating nodes.

  • Reputation_i: Reputation score of node i (0-1 scale).

Steps:

  1. Normalize Contributions:

    W_i = (C_i * Reputation_i) / Σ(C_k * Reputation_k) for k ∈ {1, 2, ..., N}
    • W_i: Normalized weight for node i.

  2. Calculate Base Reward:

    R_i = W_i * R_total
  3. Incorporate Task Weighting:

    • If tasks vary in complexity, adjust rewards:

      R_i = W_i * T_w * R_total
  4. Apply Reward Decay:

    • Reduce rewards over time to preserve token value:

      R_i_next = R_i_current * (1 - d)
      • d: Decay rate (e.g., 5% per cycle).

  5. Smart Contract Execution:

    • Final rewards are disbursed to nodes automatically via blockchain.


Dynamic Adjustments

Network Load-Based Scaling:

  • If task volume increases, rewards per task decrease proportionally to maintain token supply balance:

    R_task = R_total / T_total

Reputation Impact:

  • Nodes with higher reputation scores earn a larger share of rewards:

    W_i_adjusted = W_i * (1 + Reputation_i)

Threshold Triggers:

  • Adjust total reward pool dynamically based on tokenomics policies:

    • Example:

      • High network activity: Increase R_total to encourage participation.

      • Low network activity: Decrease R_total to preserve token supply.


Example Calculation

Scenario:

  • Total rewards (R_total): 1,000 tokens

  • Nodes: 3 (N = 3)

  • Contributions:

    • Node 1: C_1 = 100, Reputation_1 = 0.9

    • Node 2: C_2 = 80, Reputation_2 = 1.0

    • Node 3: C_3 = 50, Reputation_3 = 0.8

Steps:

  1. Normalize Contributions:

    W_1 = (100 * 0.9) / ((100 * 0.9) + (80 * 1.0) + (50 * 0.8)) = 90 / 220 = 0.4091
    W_2 = (80 * 1.0) / 220 = 80 / 220 = 0.3636
    W_3 = (50 * 0.8) / 220 = 40 / 220 = 0.1818
  2. Calculate Rewards:

    R_1 = 0.4091 * 1,000 = 409.1
    R_2 = 0.3636 * 1,000 = 363.6
    R_3 = 0.1818 * 1,000 = 181.8
  3. Apply Decay:

    • If decay rate d = 5%:

      R_1_next = 409.1 * (1 - 0.05) = 388.65
      R_2_next = 363.6 * (1 - 0.05) = 345.42
      R_3_next = 181.8 * (1 - 0.05) = 172.71

Key Benefits

  1. Fairness:

    • Rewards reflect each participant's actual contributions and performance.

  2. Automation:

    • Smart contracts eliminate manual processes, ensuring speed and accuracy.

  3. Scalability:

    • Adapts to growing network size and varying task volumes.

  4. Incentivization:

    • Decay and reputation mechanisms encourage sustained, high-quality participation.


Implementation in Lumora

Technology Stack:

  • Blockchain: Solana programs for reward calculation and disbursement.

  • APIs: Web3.js for smart contract interactions.

  • Database: Off-chain storage for task and reputation logs (e.g., MongoDB).

Smart Contract Functions:

  • calculateReward(nodeId, contribution, reputation)

  • distributeReward(nodeId, amount)

  • applyDecay(reward, decayRate)


Conclusion

Dynamic Reward Calculation Protocols form a transparent and efficient system for incentivizing contributions within the Lumora network. By incorporating real-time adjustments, reputation, and decay mechanisms, these protocols balance fairness, scalability, and sustainability.

Last updated 13 days ago