SyncAI Network
HomeIncentivized TestnetTwitter
  • Introduction
  • ⚡Motivation
    • UPI
    • Communication
    • Identities
    • User Experience
  • ✨Features
    • Overview
    • SyncID
      • Technical Architecture
      • Proof of Life
      • Federated Matching Process
    • SyncNotify: On-Chain Notifications
    • SyncEcho: Wallet to Wallet Interactions
      • Chat
      • Payments
    • SyncEcho: Intent AI Inference
      • DeFi Intents
      • Cardano Explorer
      • Governance
  • ⚙️Sync Node
    • Overview
    • Anchor Identity Layer
    • Data Ingression Layer
    • Solver Network
    • Querying Layer
    • Dispatch Layer
  • 🪙Tokenomics
    • Distribution and Vesting
    • Liquidity Management Strategy
    • SyncAI Team and Liquidity Committee
    • Token Economy and Revenue Model
  • 📄Roadmap
  • ➡️Testnet
    • Incentivized Testnet
Powered by GitBook
On this page
  1. Sync Node

Overview

PreviousGovernanceNextAnchor Identity Layer

Last updated 9 months ago

Sync Node is the powerhouse of the SyncAI Network, designed to enable the highest level of abstract programming, Web3 space has ever seen. It consists of industry-grade algorithms that enable a multitude of features, which will forever change dApp-user and user-user interactions. It is the tech stack behind the packed suite of features that diminishes technological barriers to the level that blockchain interactions becomes as natural as conversing with a real person. This is all governed by a Sybil-resistant, unique, and global ID system that authenticates Web3 users as real humans.

The SyncAI Node is built on a multi-layered architecture, each layer designed to fulfill a specific function that collectively enables efficient, secure, and user-friendly blockchain interactions.

Node Communication Relay Formula:

In the SyncAI Node architecture, nodes communicate by relaying information across the network. This communication relay can be represented using the following formula:

R(P,N)=λ⋅T(N)+(1−λ)⋅P(P)R(P,N)=λ⋅T(N)+(1−λ)⋅P(P) R(P,N)=λ⋅T(N)+(1−λ)⋅P(P)

where:

  • R(P,N)R(P,N)R(P,N) denotes the communication relay function for payload 𝑃P𝑃PPP and target node 𝑁N𝑁NNN.

  • 𝜆λ𝜆λ𝜆λ is a weighting factor to balance between priority and bandwidth considerations.

  • 𝑇(𝑁)T(N)𝑇(𝑁)T(N)T(N)T(N) calculates the transmission bandwidth available at node 𝑁N𝑁NNN, factoring in current network load and latency.

  • 𝑃(𝑃)P(P)𝑃(𝑃)P(P)P(P)P(P) computes the priority of the payload 𝑃P𝑃PPP, considering its urgency and impact on the network.

The function 𝑅R𝑅RRR is designed to determine the optimal route for relaying information between nodes by weighing both the available transmission bandwidth and the priority of the payload. A higher 𝜆λ𝜆λ𝜆λ value gives more weight to the available bandwidth, favoring efficient routing over priority. Conversely, a lower 𝜆λ𝜆λ𝜆λ prioritizes critical payloads that may require urgent delivery, even if it results in lower transmission efficiency.

Data Ingression Layer
Solver Network
Querying Layer
Dispatch Layer
⚙️
Anchor Identity Layer
Page cover image