Instant Resonance: Dual Strategy Enhances the Data Consensus Success Rate of Blockchain Threshold Signature Oracles

Youquan Xian, Xueying Zeng, Chunpei Li, Dongcheng Li, Peng Wang, Peng Liu, Xianxian Li

Abstract

Decentralized oracles are critical for bridging off-chain data to on-chain environments, yet achieving consensus via threshold signatures remains a significant challenge in heterogeneous networks. Discrepancies in node hardware and network latency often lead to divergent data observations, particularly for high-frequency real-time data. This paper introduces a dual-strategy framework—Representative Enhanced Aggregation (REP-AG) and Timing Optimization (TIM-OPT)—to address these synchronization issues. By modeling node behavior through Bayesian game theory, the proposed system enables nodes to coordinate their data selection and request timing. Experimental evaluations show that REP-AG improves success rates by 56.6%, with TIM-OPT providing an additional 32.9% boost, ensuring robust performance even under high data volatility.

Introduction

For decentralized finance (DeFi) and real-world assets (RWA) to operate securely, they rely on oracles to fetch off-chain data. To maintain decentralization and security, these oracles typically employ threshold signature schemes, where a result is valid only if a specific threshold ($t$ out of $N$) of nodes agree on the identical data point.

In real-world heterogeneous environments, nodes possess varying hardware capabilities and network latencies. When dealing with fast-changing data (e.g., asset prices changing multiple times per second), these minor discrepancies cause nodes to capture different values at slightly different timestamps. Because threshold signatures require bit-for-bit identity, even a cent's difference in a price feed can cause consensus to fail.

Threshold signature failure due to timing discrepancies among nodes.

As illustrated in the figure above, small timing offsets lead to disparate data acquisitions, preventing the oracle network from reaching the required threshold for a valid signature.

Methodology: A Dual-Strategy Approach

The authors propose a framework modeled as a Bayesian game, where oracle nodes act as strategic players attempting to coordinate their choices under incomplete information about their peers' states.

Representative Enhanced Aggregation Strategy (REP-AG)

Traditional aggregation methods like "mode" or "median" often fail in high-volatility environments where every node might observe a unique value. REP-AG addresses this by having nodes maintain a "belief matrix" regarding the likely choices of other nodes. Through an iterative process, nodes update these beliefs based on historical performance and select the data representative most likely to align with the majority, effectively finding a "most representative" value even in the absence of a perfect mode.

Timing Optimization Strategy (TIM-OPT)

While REP-AG improves data selection, TIM-OPT addresses the root cause: the timing of the data requests themselves. This strategy calculates an optimal "wait time" for each node before it accesses a data source. By dynamically adjusting these pauses based on individual node latency, the system maximizes the "overlap interval" where nodes are most likely to retrieve the same data state.

Synchronization of data acquisition windows through TIM-OPT.

By aligning these request windows, the network achieves a state of "instant resonance," significantly increasing the probability of bit-identical data retrieval across the distributed set of nodes.

Experimental Evaluation

The proposed strategies were evaluated using a Python-based simulation environment with the following parameters:

  • Network Configuration: 21 oracle nodes, 5 data sources, and a consensus threshold of 11.
  • Latency Models: Gaussian distribution (to simulate standard jitter) and Uniform distribution (to simulate high-variance environments).
  • Data Volatility: Data source change frequencies ($f$) were tested from 2 Hz to 10 Hz.

Key Results and Discussion

The dual-strategy approach demonstrated substantial improvements over traditional baselines such as median, mode, and majority voting:

  • Aggregation Success: REP-AG alone improved the success rate by approximately 56.6% compared to the best baseline.
  • Synergistic Effects: The addition of TIM-OPT provided an average further increase of 32.9% in consensus success.
  • Resilience: Unlike traditional methods, which saw performance plummet as data volatility increased, the dual-strategy approach maintained high reliability even at a 10 Hz change frequency.

The core insight is that oracle nodes should be treated as strategic actors. By allowing "faster" nodes to wait or select data that aligns with the "slower" majority, the network can adapt to its own internal heterogeneity.

Conclusion and Future Directions

The integration of REP-AG and TIM-OPT provides a robust solution for the "timing discrepancy" problem in decentralized oracles. While the system significantly boosts consensus rates, challenges remain regarding extreme latency outliers that fall outside the resonance window. Future research will explore data-sharing mechanisms to further align node insights and the application of these Bayesian strategies to Layer 2 scaling solutions and fast-path consensus protocols.

Summary updated

BibTeX
@article{xian2025instant,
  author = {Youquan Xian and Xueying Zeng and Chunpei Li and Dongcheng Li and Peng Wang and Peng Liu and Xianxian Li},
  title = {{Instant Resonance: Dual Strategy Enhances the Data Consensus Success Rate of Blockchain Threshold Signature Oracles}},
  journal = {Future Generation Computer Systems},
  year = {2025},
  doi = {10.1016/j.future.2025.107846},
}
Figure