Flex Docs (Work-In-Progress | Last Updated: 12/07)
  • Current Landscape
  • Welcome to Flex
  • Overview
    • Infrastructure for the New Web
    • The Values of the Flex Ecosystem
  • Protocol
    • Flex Validator Nodes
      • Data and Validation Layer
      • Rewards Layer
      • Audit Layer
      • Sentinel Layer
      • Prediction Layer
      • Getting Started
        • Propagation into the Validation Layer
        • Transaction Pool Generation
        • Transaction Weight Assignment
        • Epoch Score Calculation
        • Reward Distribution
        • Reward Claiming
        • Epoch Reward Pool Mechanics
    • Proof-of-Collaboration (PoCol)
      • PoCol Governance using FLEXE
      • Actors in the Flex Ecosystem
    • Flex Commons
      • Code Tokenization
      • Code Registry and Indexing
      • Code Versioning and Forking
      • Code Licensing and Royalties
      • Code Marketplaces and Auctions
      • Code Search and Discovery
      • Flex Commons Governance using FLEXE
    • Ecosystem Tokens' Multi-Staking
    • Technical Roadmap for the Flex Ecosystem
      • Flex Virtual Machine (FVM)
      • Flex SDCK
      • re:Flex Smart Contract Language
    • Flex Improvement Proposal (FIP)
    • Flex Portal: Your Gateway to Web3
  • Contribute to the Ecosystem
    • Strategists: Roles and Contributions
    • Developers and Projects
  • Governance and Utility
    • Introducing the FLEXE Token (coming soon)
    • Flexonomics (coming soon)
    • How to get FLEXE tokens (coming soon)
      • Use the faucet (coming soon)
      • Run a node (coming soon)
  • Quicklinks
    • Supported Social Media
    • Official Website
  • Legal
    • Terms of Service
    • Privacy Policy
    • Digital Asset Disclosure (coming soon)
Powered by GitBook
On this page
  1. Protocol
  2. Flex Validator Nodes

Audit Layer

Flex is a community-owned platform that rapidly boosts dApp user growth, ensuring the value generated directly benefits the Flex community.

The audit layer employs statistical methods to ensure the integrity of task validations.

Zero-knowledge proof validation:

For certain types of tasks, the Audit Layer implements zero-knowledge proofs to verify task completion without revealing sensitive information:

JavaScriptCopy codedef generate_zkp(task_result, private_data):
    # Implementation of zero-knowledge proof generation
    pass

def verify_zkp(task_result, proof):
    # Implementation of zero-knowledge proof verification
    pass

Byzantine fault tolerance (BFT):

The audit layer implements a BFT consensus algorithm to handle potentially malicious validators:

Consensus threshold:

[(2n+1)/3]+1[(2n+1)/3]+1[(2n+1)/3]+1

where: 𝑛 n is the total number of validators participating in the audit.

Quality assessment formula:

The quality score Q(t) for task t is now calculated using a weighted average of auditor reliability and task complexity:

Q(t)=∑v∈At​​C(t)1/2∑v∈At​​R(v)×C(t)1/2​Q(t)= ∑ v∈A t ​ ​ C(t) 1/2 ∑ v∈A t ​ ​ R(v)×C(t) 1/2 ​ Q(t)=∑v∈At​​C(t)1/2∑v∈At​​R(v)×C(t)1/2​

where: 𝐴𝑡 is the set of auditors for task 𝑡, and 𝐶 (𝑡) is the task complexity.

PreviousRewards LayerNextSentinel Layer

Last updated 10 months ago

We invite developers, researchers, and enthusiasts to work with our contributors for this section.

Start contributing here.