Othentic
  • Introduction
    • Introducing Othentic Stack
    • Use Cases
  • AVS Framework
    • Abstract
    • Quick Start
    • Othentic CLI
      • Key Management
      • Contracts Deployment
      • Operator Registration
      • AVS Logic Implementation
      • Operator Deposit
      • Node Operators
      • Rewards Distribution
      • P2P Config
        • Custom P2P Messaging
        • P2P Auth Layer
        • Metrics and Monitoring
        • Logging
        • Persistent storage
        • Latency
      • CLI Command Reference
    • Smart Contracts
      • AVS Governance
      • Attestation Center
      • Hooks
        • Task Logic
        • Operator Management
        • Rewards Fee Calculator
      • OBLS
      • Othentic Registry
      • Message Handlers
    • Othentic Consensus
      • Abstract
      • Task & Task Definitions
      • Leader Election
      • Proof of Task
      • Execution Service
      • Validation Service
      • Voting Power
      • Rewards and Penalties
      • Internal Tasks
    • FAQ
    • Supported Networks
    • Explainers
      • Networking
      • Multichain
      • Production Guidelines
      • Operator Allowlisting
      • Governance Multisig
  • External
    • AVS Examples
  • GitHub
  • Othentic Hub
Powered by GitBook
On this page
  • Overview
  • Rewards Calculation
  • Stake-weighted Rewards
  • Configuring Base Rewards
  • Rewards Distribution
  1. AVS Framework
  2. Othentic Consensus

Rewards and Penalties

PreviousVoting PowerNextInternal Tasks

Last updated 2 months ago

Overview

Operators in a shared security environment are incentivized through rewards for making attestation and executing tasks. Rewards scale with the effective balance, which provides an economic incentive for Operators to behave honestly and act in the networks’ best interest.

To maximize reward, a single Operator opt-in to validate multiple networks, and puts its staked ETH at additional risk of penalties. Operators are penalized for missed, late or incorrect attestations. Violating a consensus rule of chain A, carries consequences on effective balance, which results in a lower reward and voting power on AVS B and C, alongside A.

Rewards Calculation

Operator rewards depend both on the amount of base reward per task and the frequency at which an operator is chosen to perform a task. AVS developers must configure the task rewards and utilize a to determine the frequency at which operators are selected for tasks. Othentic Stack allows the configuration of diverse types of tasks with different corresponding rewards.

Stake-weighted Rewards

Most Proof-of-Stake networks include a "stake-weighted" Leader Election mechanism where the more stake an operator has the more tasks they'll be chosen to perform. The Othentic Stack supports any Leader Election mechanism implemented by the AVS developer.

When using a stake-weighted algorithm, for operator nnn, we denote the total reward TnT_nTn​, with the expected value E(Tn)E(T_n)E(Tn​) described as:

E(Tn)=SnST⋅C⋅RE(T_n) = \frac{S_n}{S_{T}} \cdot C \cdot RE(Tn​)=ST​Sn​​⋅C⋅R

Where

  • RRR is the base reward per task

  • SnS_nSn​ is the effective balance of operator nnn

  • ST=∑n=1NSnS_T = \sum\limits_{n=1}^{N}S_nST​=n=1∑N​Sn​ is the total effective stake for the network

  • CCC is the number of tasks the network produced overall.

Constructing the Rewards Function

To generalize for any Leader Election algorithm, a probability function P(n)P(n)P(n) can be derived from the selected algorithm such that ∑n=1NP(n)=1\sum\limits_{n=1}^{N}P(n) = 1n=1∑N​P(n)=1 to rewrite the expected value formula as:

E(Tn)=E(P(n))⋅C⋅RE(T_n) = E \Bigl( P(n) \Bigl) \cdot C \cdot RE(Tn​)=E(P(n))⋅C⋅R

There are two configurable components for the rewards function:

  • P(n)P(n)P(n) — The probability of operator nnn to be elected for a task

  • RRR — The base reward for each task

P(n)P(n)P(n) is derived from your Leader Election algorithm. Different algorithms could have different PPP functions. RRR is the base reward and is configurable via the AttestationCenter contract.

Configuring Base Rewards


Rewards Distribution

For example, a leader election mechanism — which is not stake-weighted — would have P(n)=1NP(n)=\frac{1}{N}P(n)=N1​ .

Task Definitions are used to configure base rewards for the operators. Each task definition includes the base reward for all entities participating in the consensus: the performer, the attesters, and the aggregator. You can configure task definition based on section in the Task Page.

For details on how rewards are distributed, refer to the section.

leader election mechanism
uniformly random
Rewards Distribution
Creating Task Definition