# Overview

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.

{% content-ref url="anchor-identity-layer" %}
[anchor-identity-layer](https://syncs-organization.gitbook.io/testt/sync-node/anchor-identity-layer)
{% endcontent-ref %}

{% content-ref url="data-ingression-layer" %}
[data-ingression-layer](https://syncs-organization.gitbook.io/testt/sync-node/data-ingression-layer)
{% endcontent-ref %}

{% content-ref url="solver-network" %}
[solver-network](https://syncs-organization.gitbook.io/testt/sync-node/solver-network)
{% endcontent-ref %}

{% content-ref url="querying-layer" %}
[querying-layer](https://syncs-organization.gitbook.io/testt/sync-node/querying-layer)
{% endcontent-ref %}

{% content-ref url="dispatch-layer" %}
[dispatch-layer](https://syncs-organization.gitbook.io/testt/sync-node/dispatch-layer)
{% endcontent-ref %}

**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)
$$

where:

* $$R(P,N)$$ denotes the communication relay function for payload $$𝑃P$$ and target node $$𝑁N$$.
* $$𝜆λ$$ is a weighting factor to balance between priority and bandwidth considerations.
* $$𝑇(𝑁)T(N)$$ calculates the transmission bandwidth available at node $$𝑁N$$, factoring in current network load and latency.
* $$𝑃(𝑃)P(P)$$ computes the priority of the payload $$𝑃P$$, considering its urgency and impact on the network.

The function $$𝑅R$$ 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.