Jun 11, 2026·Universitatea Titu Maiorescu, the 19th international conference, education and creativity for a knowledge based society, informatics proceeding book
This paper presents a comparative study between two leading blockchain platforms—Hyperledger Fabric and Ethereum—with emphasis on their architectural design, performance characteristics, and security mechanisms in the context of enterprise applications. The study aims to identify key differences between permissioned and public blockchain models, focusing on scalability, consensus efficiency, and data confidentiality. A controlled experimental environment was developed using Docker-based deployments for both platforms, and performance was evaluated through Hyperledger Caliper using standardized workloads. Metrics such as transactions per second (TPS), latency, resource consumption, and failure rates were analyzed under varying network sizes. The results indicate that Hyperledger Fabric achieves significantly higher throughput (≈900 TPS) and lower latency (<200 ms) compared to Ethereum (≈25 TPS, ≈1 s latency), due to its deterministic Raft consensus and modular architecture. Ethereum, however, demonstrates superior decentralization and transparency suitable for public and decentralized applications. The findings highlight that both platforms are complementary: Hyperledger Fabric is optimized for controlled, high-performance enterprise use, while Ethereum excels in open, trustless environments.
Large-language-model (LLM) inference is increasingly concentrated in dedicated GPU data centres and closed API platforms, raising barriers for institutions that want to run, study, or contribute to AI infrastructure. We argue that democratizing inference requires an architecture in which smaller organizations can participate as operators, builders, and researchers rather than only as customers. We propose OpenPrism Network, an open, UMA-first distributed inference architecture in which transformer layers are statically owned by nodes so that weights remain resident and only activations transit the network; a blockchain layer is restricted to settlement, reputation, and payment and never to compute; output integrity is established by multi-node redundancy with tolerance-banded fingerprinting rather than zero-knowledge proofs; and routing is locality-aware, keeping inference within metro-area clusters. The network is explicitly scoped to batch- and throughput-oriented, latency-tolerant workloads. We describe two deployment models: a distributed mesh harvesting idle institutional capacity, and a purpose-built UMA micro data center deployable by resource-constrained organizations as a sovereign inference facility. We also describe an open participation model in which node operators, runtime implementers, benchmark maintainers, and application integrators can contribute through published interfaces and open-source reference components. This is a position and architecture paper: we claim no original experimental results, and all quantitative figures are drawn from publicly available benchmarks and published specifications, cited explicitly. We report performance per watt honestly, including the threefold cost of consensus, and find that UMA nodes lose on operational efficiency against batched data-centre GPUs in the scoped regime; the architecture's advantage is therefore established on capital in the harvested-capacity model, participation, and data sovereignty, while total cost of ownership for the purpose-built micro data center is mixed and strongly pricing-regime dependent, not universally favorable. We frame two problems as genuinely unsolved: a consensus protocol for ML output verification under floating-point non-determinism, and a dynamic layer-assignment protocol that rebalances ownership as nodes join and leave without full weight redistribution. We also state a concrete validation roadmap, including prototype scope, baselines, and evaluation metrics.
Zero-knowledge virtual machines (zkVMs) are a key technology for driving the large-scale adoption of zero-knowledge proofs (ZKP), but their performance bottlenecks severely limit their practicality. While current hardware acceleration research has exclusively focused on backend proving, we identify that the frontend execution and trace generation phase is rapidly emerging as the new system bottleneck. To address this challenge, we propose ZK-Tracer, the first hardware accelerator architecture specifically designed for the zkVM frontend. ZK-Tracer features a novel heterogeneous design comprising a Main Trace Unit and parallel Permutation Trace Units. It exposes a fine-grained interface to the host software through a lightweight instruction set extension, enabling efficient task offloading. Our ASIC implementation results demonstrate that ZK-Tracer achieves up to 1829x speedup in trace generation over a high-performance multi-core CPU. When integrated with existing backend proving accelerators, it delivers a remarkable 963x end-to-end performance improvement for the entire ZKP system.
Transforming legacy SAP systems into smart cloud-based systems is a major shift in today’s digital strategy. This transformation re-engineers old SAP environments, which are often rigid and not easily scalable, by utilizing current technologies, including artificial intelligence and cloud services like AWS. This paper discusses how AI-driven cloud transformation can help organizations transform their SAP ecosystems to be more agile, scalable, and data-driven in their decision-making processes. It addresses enterprise AI, intelligent automation, hybrid cloud environments, and other emerging technologies such as generative AI and distributed ledger systems. The discussion demonstrates how such innovations can be utilized to help create smart enterprises that can make predictions, adapt to changes, and operate more independently. The paper also takes into account the changing role of business analysis and knowledge ecosystems in facilitating this transformation. By integrating these developments and models, this paper provides a comprehensive view of the process of reinventing SAP landscapes to meet the demands of a constantly evolving digital economy.
With the increasing adoption of mobile applications, data in the mobile cloud faces numerous security threats and privacy breaches. To overcome cyberattacks, ensuring confidentiality and data security for users’ sensitive data is pivotal in mobile cloud computing. Traditional security mechanisms involve data leakage during the verification process, while blockchain-dependent solutions lead to high resource consumption and latency. Additionally, collaborative data processing during data transactions can result in potential privacy attacks on users. This paper proposes a novel approach for maintaining a security framework for Microservice-based Mobile Cloud Computing (MSCMCC) using hybrid cryptographic frameworks such as Zero-Knowledge Proof (ZKP) and Secure Multi-Party Computation (SMPC). The proposed model validates users’ offloaded data using zk-SNARK and Groth16 for task verification and enables data analysis from multiple users without exposing raw data. SMPC is employed for privacy preservation during collaborative multi-party computation. Experimental results demonstrate that the proposed framework reduces power consumption, improves energy efficiency during processing by 30–35%, lowers computational costs, enhances security and privacy, and effectively manages dynamic load balancing compared to traditional cryptographic techniques.
This paper examines the use of Event-Driven Architecture (EDA) patterns to improve the optimization of financial risk evaluation in a distributed cloud-based system of finance.Today's financial system is characterized by a number of difficulties in processing high-speed data feeds in a timely manner, ensuring sub-millisecond latency and high availability.This paper proposes a decoupled system utilizing distributed event brokers and stream processors to identify market anomalies and credit risks in a timely fashion.This research utilizes a risk data set of 404 unique risk scenarios, including high-frequency trading (HFT) simulation data and credit transaction data, to measure system efficiency.The system environment utilizes Apache Kafka for event streaming, Kubernetes for cloud orchestration, and Prometheus for monitoring.The results show that event-driven architecture can improve system efficiency by eliminating traditional requestresponse processing bottlenecks.Furthermore, by utilizing distributed ledgers and serverless architecture, financial organizations can improve their risk profile granularity.The results show that by utilizing reactive programming, financial organizations can improve their risk management approach by shifting their traditional reactive approach to a proactive approach.
Trans-border data circulation across multi-jurisdictional boundaries faces an operational conflict between ownership provenance prerequisites and data minimisation mandates, compounded by the tight coupling of large data payloads with synchronous state consensus ledgers, which forces replication of feature matrices across all consensus nodes and leads to network saturation. Existing frameworks remain unequipped to resolve this, as coupling in-band payload routing with synchronous state ledgers generates communication overheads scaling with data volume. The proposed Trusted Data Space with Registration (TDSR) implements a four-layer protocol stack. A dual-plane topology establishes a decoupled storage–ledger mechanism, partitioning asynchronous payload datastores and synchronous consensus ledgers to sustain throughput independent of data dimensionality. Navigating this infrastructure, the Unified Data Resource Identifier (UDRI) executes out-of-band cross-domain routing without exposing verifier intents. Driven by the Oblivious Data Asset Registration (ODAR) mechanism, a two-phase, four-algorithm lifecycle dictates end-to-end ownership provenance. This execution shifts hypothesis testing to isolated sandboxes via an algorithm-agnostic mathematical contract, capping external data transit at a constant leakage bound. A deployed testbed across the Guangdong-Hong Kong-Macao Greater Bay Area validates the proposed architecture, supporting data circulation across divergent legal jurisdictions.
Blockchain technology functions as an innovative solution that allows users to obtain secure decentralized tamper-resistant data management capabilities. The traditional blockchain systems demonstrate drawbacks because they create scalability challenges and need high amounts of energy for operations together with delayed transaction times, especially when used in high-throughput and resource-constrained situations. This research designs an improved cloud-based blockchain system which combines Proof-of-Stake (PoS) protocol with Byzantine Fault Tolerance (BFT) controls, along with batch transaction handling systems, to foster better performance results. The framework delivers dynamic scalability and distributed processing efficiency because it makes use of cloud infrastructure. The implementation simulation reveals substantial increases in transaction rate upto 10,000 TPS and quicker consensus times together with enhanced validator impartialty as well as more than 60% energy efficiency improvement, as compared to standard Proof-of-Work protocols. Security and trust evaluation methods exhibit thorough testing of the system that confirms its capabilities in adverse environments. This proposed framework provides an energy-efficient solution which can serve robust real-world applications in IoT together with healthcare and supply chain and finance domains.
Blockchain systems face significant scalability challenges due to growing data volumes and increasing transaction demands, necessitating more efficient data structures and verification mechanisms. Verkle trees, a novel data structure combining the efficiency of Merkle trees with the compactness of vector commitments, have gained attention for their potential to optimize blockchain storage and improve scalability. However, their practical implementation, especially at the smart contract level, has remained unexplored. To address these challenges, we present TS-verkle, the first known TypeScript-native implementation of Verkle trees designed for web3 backend compatibility, coupled with a corresponding on-chain verifier written in Solidity. Our work bridges this gap by providing a concrete implementation of Verkle trees and demonstrating their feasibility for on-chain verification. While previous literature suggests Verkle trees should outperform Merkle trees due to their succinct proof size, our empirical evaluation reveals that basic implementations of Verkle trees actually incur higher costs than Merkle trees without advanced optimization techniques. This finding represents a crucial insight for blockchain developers and researchers considering Verkle tree adoption. The paper discusses implementation strategies and performance characteristics while exploring implications for scaling and data availability in decentralized blockchain systems.
Este artigo apresenta uma análise comparativa de desempenho entre rollups otimistas e execução nativa em Ethereum Virtual Machine (EVM). O estudo investiga as diferenças em termos de custo de gás, avaliando o impacto das soluções de Layer 2 na escalabilidade da blockchain Ethereum. Os resultados experimentais fornecem insights sobre os trade-offs entre execução on-chain tradicional e rollups otimistas, contribuindo para a compreensão das estratégias de escalabilidade em ambientes blockchain.
The rapid expansion of Artificial Intelligence Data Centers (AIDC) faces severe physical constraints, notably the linear O(n) scaling of power consumption, cooling requirements, and latency. In this paper, we propose the Lattice Swarm Protocol, a paradigm shift in distributed edge computing utilizing an O(1) constant memory architecture combined with the Virtual-to-Materialization (V2M) engine. We mathematically demonstrate that when interconnected via high-speed 400G/800G optical networks, multiple 1MW ultra-low-power edge nodes do not compute independently. Instead, they share Spatiotemporal Environmental Hashes across a 9192-D Lattice network. This mechanism exponentially reduces the computational load of the entire network as node count increases, creating a single 300MW-equivalent "Hyper-Organism" from merely 30 distributed 1MW nodes. We empirically validate this architecture through the implementation of zero-latency Stateless Custody protocols and interstellar acoustic materialization (Voyager 1), both audited by Google DeepMind Antigravity. This infrastructure establishes a new global standard for Autonomous Driving and Urban Air Mobility (UAM).Version 2 Update: Integrated Zero-Knowledge Proof (ZKP) mechanisms and Stateless Key Vaporization (0.024s), aligned with KIPO Patent No. 10-2026-0079266.
The rapid growth of geographically distributed cloud data centers has intensified the demand for secure, privacy-preserving, and resource-efficient collaboration among mutually untrusted cloud environments. This paper presents BlockFed, a blockchain-empowered federated learning framework designed to enable cyber-threat-resilient collaboration across geographically distributed data centers. In BlockFed, each data center independently trains local models using private workload data and shares only the computed gradients rather than raw data, with a centralized aggregation server through a secure blockchain layer. A Proof-of-Work consensus mechanism is employed to validate gradient transactions and maintain an immutable, tamper-resistant ledger, ensuring trust and integrity among participating entities. The centralized server aggregates blockchain-verified updates to construct a global model, which is iteratively redistributed to support collaborative learning. This integrated learning process enhances task-level resource demand prediction while simultaneously improving system security and operational efficiency across all participating data centers. Extensive simulations on the Google Cluster Dataset show that BlockFed outperforms state-of-the-art baselines, including ISTM, ETP-WE, First-Fit, Best-Fit, and Random-Fit, in resource utilization, power consumption, and active server reduction. BlockFed achieves up to 7-81% higher resource utilization, 41-58% lower power consumption, and 31-65% fewer active servers, while attaining a cyber-threat estimation accuracy of 93.19%.
The transition from isolated distributed ledgers to a unified “Internet of Value” is hindered by the lack of efficient, verifiable, and privacy-preserving cross-chain data retrieval mechanisms. While asset bridging has matured, generalized data indexing remains a critical bottleneck, constrained by the semantic gap between heterogeneous storage layouts and the prohibitive verification tax of cryptographic proofs. In this paper, we present HyperCross, a novel semantic-aware zero-knowledge indexing framework designed to bridge this divide. We first formalize the heterogeneous cross-chain storage optimization problem (HCCSOP) and prove its NP-completeness. To tackle this, HyperCross employs a synergistic tri-layered architecture. At the semantic layer, we introduce a unified data abstraction (UDA) that leverages category-theoretic functors and schema morphisms to ensure mathematically rigorous state mapping for both simple assets and complex smart contract logic. At the indexing layer, a zero-knowledge learning index (ZKLI) shifts prediction intelligence to the client side, integrating zk-SNARKs with silent oblivious transfer to achieve constant-time verification (O(1)) while concealing access patterns. Finally, a multi-level cache (MLC) utilizes predictive prefetching with Δ-bounded staleness to mask network latency. Extensive evaluations demonstrate that HyperCross reduces query latency by 2.4× and storage overhead by 40% compared to state-of-the-art baselines, establishing a scalable foundation for data-intensive inter-chain applications.
Digital enterprises operating across multiple regions require an architecture that ensures high availability, low latency, and seamless multi-currency support. In this paper, we propose a cloud-native distributed system design that leverages microservices, geo-replication, and fault-tolerant patterns to meet these requirements. We detail the system architecture - including a multi-region deployment, microservices for currency conversion and transaction processing, and a replicated ledger - and present our methodology for performance evaluation. Our experiments compare the proposed design to a traditional monolithic baseline, showing significant improvements: for example, currency conversion latency falls from ~220 ms to ~50 ms and throughput increases sixfold under load (p<0.01). We also demonstrate 99.99% availability via automated failover and load balancing across regions. Key contributions include a detailed description of the architecture (with figures of component interactions and data flow), an analytical model of system performance, and statistical validation of results. We conclude by discussing limitations, strengths, and directions for future work. The results validate that our design substantially enhances availability and performance for global multi-currency platforms.
This paper addresses the systemic crisis of data silos and trust deficiencies in modern enterprises by designing and implementing a high-throughput, privacy-preserving blockchain-based distributed accounting information system. By deconstructing the pain points of traditional financial architectures, this paper proposes a multi-layered architecture integrating a dynamic weighted hybrid consensus mechanism and a directed acyclic graph parallel contract engine, completely overturning the centralized ledger paradigm. The system utilizes zero-knowledge proofs and homomorphic encryption mechanisms to construct encrypted state flow channels, achieving public ownership confirmation and logically transparent auditing of the entire network ledger while protecting the privacy of core business funds. Extreme concurrency tests conducted using enterprise-grade hardware matrices and containerized clusters demonstrate that, while maintaining strong consistency and fault tolerance, the system achieves a concurrent throughput of 8850 TPS, with end-to-end confirmation latency compressed to less than 120ms. Performance degradation is minimal even with a tenfold increase in node size, proving the outstanding engineering value and revolutionary potential of this distributed architecture in enabling high-frequency global business-finance collaboration and reducing cross-domain audit friction costs.
O estudo investiga barreiras de usabilidade em aplicações de Finanças Descentralizadas (DeFi) executadas em redes compatíveis com a Ethereum Virtual Machine (EVM), mostrando que problemas de fluxo, terminologia e feedback comprometem a adoção, especialmente entre iniciantes. Para enfrentar essas limitações, o trabalho propõe uma interface de usuário aprimorada e a compara a uma versão não otimizada usando métricas de desempenho, número de cliques e o questionário NASA-TLX. Os resultados indicam que a interface melhorada elevou a taxa de conclusão de tarefas de 76% para 89%, reduziu os cliques excedentes de 221 para 186 e diminuiu a carga cognitiva global aferida pelo NASA-TLX em todas as seis dimensões avaliadas, com destaque para demanda mental e frustração, inclusive entre usuários experientes, que relataram maior fluidez e previsibilidade. O artigo conclui que refinamentos de usabilidade voltados para aplicações financeiras descentralizadas são determinantes para elevar confiança e adoção, recomendando a padronização de processos, mensagens menos técnicas e a redução de etapas críticas para mitigar a fadiga de operações e ampliar o alcance da Web3.
Manaswini Piduguralla, Souvik Sarkar, Arunmoezhi Ramachandran, Sathya Peri
Blockchain technology enhances transparency by maintaining a distributed ledger among mutually untrusting parties. Despite its advantages, scalability and availability remain critical bottlenecks that hinder widespread adoption. The increasing complexity of blockchain nodes further necessitates robust fault tolerance and high throughput to ensure seamless operations. We present BlockRaFT, a crash-tolerant distributed framework designed to improve both the scalability and reliability of blockchain node operations. BlockRaFT framework utilizes RAFT consensus protocol to elect a leader within a cluster of systems. The elected leader coordinates and distributes workloads across follower nodes, thereby optimizing resource utilization and work load balancing. We analyzed the tasks performed by blockchain nodes and partition them according to their stateful and stateless characteristics. Stateless operations are centralized at the leader, while stateful operations are replicated and coordinated across the cluster to ensure consistency and fault tolerance. We evaluate whether this distributed intra-node architecture provides measurable benefits over traditional single-node execution models in terms of scalability, availability, and performance. Additionally, we introduce a concurrent Merkle tree optimization that decouples smart contract execution from tree updates, significantly reducing one of the significant performance overheads in blockchain systems. Our design philosophy is rooted in utilizing the well-established principles of distributed computing and customizing them for the blockchain domain rather than reinventing them.
Xavier Casas-Moreno, Komal Thareja, Pablo de Juan Vela, Rajiv Mayani · 9 authors
The Compute Continuum—spanning IoT, Edge, Cloud, and HPC resources—is reshaping how hyper-distributed applications are designed and orchestrated. Traditional service orchestrators and workload management systems rely on centralized runtimes; however, the emerging paradigm requires decentralized coordination, where autonomous agents cooperate to achieve common goals and dynamically distribute workloads. Consensus algorithms play a crucial role in multi-agent systems (MAS), as they enable agents to reach agreement on how to coordinate and execute functionalities in a cooperative manner. While consensus has previously been applied to distributed job selection, here we extend its use to swarm environments. In this setting, agents autonomously decide which service functionalities (i.e., roles) to execute based on their capabilities and the real-time quality of service (QoS). Functionalities can be elastically activated or terminated as application needs evolve. To support this model, we leverage the COLMENA framework, a programming environment for defining and managing such dynamic services. We apply a greedy consensus-based approach to modern power systems, which are increasingly decentralized due to the large-scale integration of renewable energy sources. Centralized power plants are giving way to distributed, intermittent resources that require decentralized control paradigms. To demonstrate this, we simulate the Northeastern Power Coordinating Council’s (NPCC) 140-bus grid using the ANDES simulator in conjunction with the COLMENA middleware. We deploy this use case across six different sites in the FABRIC testbed, using up to 60 different nodes. Our results show that, under contingency scenarios such as load and generator disconnections, agents self-organize, elect local leaders, and execute optimization algorithms to stabilize grid frequency. Detection and organization times remain below 10s across all experiments, even as the number of agents per area scales from 3 to 10. Stability is restored within approximately 27s and 40s for the respective cases. Resource overhead is minimal, with CPU and memory usage remaining below 7.5% and 2%, respectively. Experiment automation and reproducibility are ensured through Kiso. These findings indicate that role-based programming models complement traditional workflows and that consensus-driven coordination can effectively decentralize decision-making in swarm environments. This approach represents a step toward enabling resilient, decentralized power systems.
Jiahao Qi, Dian Ding, Jie Li, Jiannong Cao · 7 authors
Account migration in sharded blockchains presents a critical trade-off between optimization effectiveness and system availability. While dynamically reallocating accounts across shards can significantly reduce cross-shard transaction overhead, existing migration mechanisms cause service disruptions that intensify as state data volumes grow. To address this challenge, we propose BIND, a batch-wise account migration protocol that eliminates service interruptions by enabling continuous transaction processing throughout migration. BIND introduces a dual transaction pool architecture that isolates transactions involving migrating accounts while allowing non-migrating accounts to operate uninterrupted. To optimize migration efficiency, we design a reverse greedy heuristic algorithm that partitions accounts into batches based on community cohesion, maximizing intra-batch connectivity to front-load cross-shard communication reduction. We evaluate BIND using real Ethereum transactions, demonstrating superior performance over existing mechanisms. BIND achieves 12% higher overall throughput, reduces migration time to 23.6%-39.3% of the one-shot baseline (across 1-10Gbps bandwidth), and lowers cross-shard transaction rates by 24.1% compared to random batching. These results confirm BIND as a practical solution for large-scale, non-disruptive account migration in production sharded blockchains.
Cloud computing underpins modern IT infrastructure by delivering scalable, on-demand resource provisioning, yet controlling cloud expenditure remains a pressing challenge. Dynamic pricing structures, unpredictable workloads, and billing pipelines that lack real-time visibility create conditions in which unauthorized consumption and anomalous usage spikes routinely escape timely detection. This paper presents CloudPay, a blockchain-integrated cloud storage billing system that unifies unsupervised machine learning with smart contract execution to deliver verifiable, fine-grained, and fraud-resistant cost governance. The system converts user storage activity into time-series representations and applies the Isolation Forest algorithm to detect abnormal consumption spikes without any labelled training data. Flagged events are routed through an owner confirmation protocol that validates suspicious uploads before billing proceeds, preventing unauthorized charges from entering the settlement pipeline. Smart contracts autonomously compute GB-time-based charges, execute tokenized payments, and anchor every transaction to an immutable SHA-256 blockchain ledger. Experimental results confirm that the system achieves 94.4% anomaly detection accuracy, 99.7% billing precision, and an 18.4% reduction in overall cloud expenditure relative to static allocation baselines. These results demonstrate that integrating unsupervised anomaly detection with cryptographically enforced billing logic is a viable path toward tamper-evident, real-time cost governance in multi-tenant cloud environments.
Este artigo apresenta um esboço estruturado sobre “Análise de Custo de Deploy em Diferentes EVMs.”. O objetivo é analisar os fundamentos técnicos e econômicos do custo de implantação de contratos inteligentes em Ethereum L1, diversas Layer‑2 (rollups) e outras chains EVM‑compatíveis, discutindo implicações para o ecossistema Web3 e tendências de mercado. A metodologia baseia‑se em revisão bibliográfica e análise de casos práticos, com foco na decomposição do custo de deploy em componentes de gas (execução, armazenamento de código, dados de transação) e em como upgrades recentes – como Cancun/Deneb e a introdução de blobs de dados – alteram a estrutura de custos, especialmente para rollups que publicam dados em L1. Estudos mostram que, enquanto o gas é uma unidade abstrata consistente, o custo econômico por byte de código e por transação varia significativamente entre L1 (onde picos históricos chegaram a dezenas de dólares por transação) e L2s, onde taxas médias frequentemente ficam abaixo de centavos, especialmente após a redução em até 94% do custo por byte de dados com blobs. Ao mesmo tempo, análises de mercado indicam que L2 fees são estruturalmente compostas por uma parcela L1 (custo de dados e liquidação) mais uma parcela L2 (execução local), de modo que mudanças na economia de gas da L1 impactam indiretamente o custo de deploy e operação nas L2s. Conclui‑se que decisões de arquitetura e de escolha de EVM para deploy devem considerar não apenas o custo imediato de gas, mas também a herança de segurança, a volatilidade das taxas e a dependência em upgrades de protocolo que alteram a economia de dados e execução.<br>
Este artigo analisa o “Uso de Oráculos Computacionais para Execução Off‑Chain.”, com foco em como redes descentralizadas de oráculos (DONs) ampliam as capacidades de smart contracts ao executar lógica complexa fora da blockchain com garantias verificáveis. Oráculos computacionais utilizam redes de nós para realizar qualquer tipo de cálculo fora da cadeia, ancorando o resultado on‑chain por meio de provas criptográficas, assinaturas e acordos de serviço que minimizam a necessidade de confiança em um operador único. Plataformas como Chainlink introduziram capacidades de computação off‑chain generalizada (Functions, Automation 2.0), nas quais nós orquestram execuções off‑chain, geram calldata para apenas a parte necessária da lógica on‑chain e assinam respostas, permitindo automação e processamento intensivo com economia de até 90% de gas em alguns casos. A literatura também explora arquiteturas híbridas que dividem contratos em componentes on‑chain e off‑chain para melhorar escalabilidade e privacidade, bem como mecanismos criptográficos (MPC, provas de conhecimento zero, fraud proofs, reexecução on‑chain) que permitem verificar a correção da computação off‑chain. Estudos recentes sobre redes de oráculos destacam ainda a importância de mecanismos de reputação, testes encobertos de nós e incentivos econômicos para garantir acurácia dos resultados e resiliência da rede. Conclui‑se que oráculos computacionais são um pilar para contratos inteligentes híbridos, permitindo que a Web3 incorpore cálculos intensivos, dados externos e lógica condicional complexa sem perder as garantias de auditabilidade e minimização de confiança da blockchain subjacente.<br>