# 2EZBFT for Decentralized Oracle Consensus with Distant Smart Terminals

**Authors:** Yuke Cao, Kun She

PMC · DOI: 10.3390/s25206268 · Sensors (Basel, Switzerland) · 2025-10-10

## TL;DR

2EZBFT is a new consensus method for blockchain oracles that improves efficiency in handling data from distant smart terminals.

## Contribution

2EZBFT introduces a two-layer BFT consensus architecture to reduce network overhead in geo-distributed oracle systems.

## Key findings

- 2EZBFT reduces network overhead and consensus latency compared to traditional BFT algorithms.
- The method achieves up to 45% higher throughput than PBFT and HotStuff under high load in simulations.
- The layered design enables efficient cross-group data aggregation and secure on-chain reporting.

## Abstract

In geo-distributed deployments, sensor data are collected under the coordination of smart terminals and relayed on-chain via decentralized oracles. A motivating scenario involves healthcare networks where regional hospitals submit aggregated medical data to blockchain systems while maintaining strict information security—often designating one gateway per region for external communication. Long geographical distances between smart terminals stress traditional consensus with excessive network overhead and limited efficiency. To address this, we propose a layered BFT consensus method, 2-layer EaZy BFT (2EZBFT). The system forms multiple independent groups of smart terminals and builds a two-layer consensus architecture—“intra-group synchronization, inter-group consensus”—to complete cross-group data aggregation and final on-chain consensus. This layered design reduces intra-group communication complexity by lowering the number of nodes per group and reduces cross-group interactions via leader-side aggregation, thereby lowering overall network overhead. Compared with other BFT algorithms, the proposed scheme improves the efficiency of data collection and on-chain reporting while ensuring consensus security and consistency. Experiments show improvements in metrics such as network overhead and consensus latency. In a discrete-event simulation with an asymmetric WAN latency matrix and geo-partitioned groups, 2EZBFT achieves up to 45% higher throughput than flat BFT algorithms such as PBFT and HotStuff under high load. It provides a practical path for efficient data interaction in decentralized oracles and offers guidance for improving the performance of blockchain–real-world data exchange.

## Full-text entities

- **Diseases:** BFT (MESH:D018149), INTRA_CHALLENGE (MESH:D057072), injury to (MESH:D014947)
- **Chemicals:** 2EZBFT (-)
- **Species:** Homo sapiens (human, species) [taxon 9606]

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/PMC12567151/full.md

## Figures

14 figures with captions in the complete paper: https://tomesphere.com/paper/PMC12567151/full.md

## References

29 references — full list in the complete paper: https://tomesphere.com/paper/PMC12567151/full.md

---
Source: https://tomesphere.com/paper/PMC12567151