Blockchain Papers

Yuexu Chen

No abstract is available for this record.

Tiago Ferreira Cavazin

<b>RESUMO</b>O presente artigo analisa as estratégias de otimização de gas na rede Ethereum, focando na interação técnica entre os opcodes da Ethereum Virtual Machine (EVM) e a eficiência das estruturas de dados. Com a evolução da rede e a implementação de atualizações críticas como o EIP-1559 e o upgrade Dencun, a economia de recursos computacionais tornou-se um imperativo não apenas para a viabilidade financeira das transações, mas também para a escalabilidade e segurança de contratos inteligentes. O estudo detalha os custos associados às operações de armazenamento (Storage), memória volátil (Memory) e calldata, explorando o impacto de novas funcionalidades como o armazenamento transitório (EIP-1153). Através de uma revisão sistemática de literatura técnica e benchmarks algorítmicos, demonstra-se que a escolha criteriosa de tipos de dados, o empacotamento de variáveis (variable packing) e a substituição de padrões de iteração por mapeamentos podem reduzir significativamente o consumo de gas. Conclui-se que a otimização de alto nível deve ser acompanhada por uma compreensão profunda da arquitetura de baixo nível da EVM, assegurando que a redução de custos não comprometa a integridade lógica do sistema.<br>

Handaya Riawan, Benfano Soewito

The growing demand for digital access to precious metals has created opportunities for ownership systems that are transparent, secure, and globally accessible. This article presents a blockchain-based silver tokenization framework enabling customers to buy, hold, and redeem physical silver through verifiable on-chain records. A hybrid token model combines fungible tokens for value representation and nonfungible tokens for bar certificates. After building the core smart contract architecture, the next step is deployment. Given the growing number of platforms, identifying the most cost-efficient option is essential. This article compares six Ethereum virtual machine-compatible blockchains and evaluates them based on gas fees and operational cost.

Gopal Ojha

The Ethereum Virtual Machine (EVM) is a stack-based virtual processor that executes smart contract bytecode sequentially. While this design ensures determinism and correctness, it inherently limits instruction throughput. This paper presents a feasibility study of instruction-level pipelining within the EVM interpreter architecture. By analyzing the internal execution flow of the EVM as implemented in the Go-Ethereum (geth) client, the study identifies the program counter dependency, particularly under jump instructions, as the principal control hazard preventing naïve pipelining. A two-stage pipelined execution model is proposed, separating opcode fetch and decode from execution and program counter update, with a feedback mechanism to preserve EVM semantics. The work focuses on architectural feasibility rather than performance evaluation and optimization, demonstrating that pipelining inside the EVM interpreter is conceptually possible under controlled synchronization. Limitations, design challenges, and future research directions are discussed.

Oleksandr Khoshaba, Віктор Гречанінов, Viktor Grechaninov, Ivan Zora · 5 authors

No abstract is available for this record.

Nirmala Raju Kanti, D. G. Narayan, Pooja Shettar, P S Hiremath

Blockchain networks rely on consensus mechanisms to maintain security and efficiency. Delegated Proof of Stake (DPoS) is a widely adopted alternative to traditional Proof of Work (PoW) and Proof of Stake (PoS) due to its scalability. However, DPoS suffers from centralization risks, collusion, and the presence of unreliable validators, compromising network integrity. One approach to mitigating these issues is the downgrade method, which reduces the influence of dishonest validators over time by penalizing their stake or voting power. While this approach improves security, it still faces challenges related to manipulation and inefficiency. To address these limitations more effectively, we introduce Game Theory-based Delegated Proof of Stake (GT-DPoS), an advanced consensus framework that integrates strategic decision-making through game theory to optimize node selection and incentivization. GT-DPoS utilizes a two-stage evaluation mechanism based on Reputation Score (RS) and Trust Score (TS) to regulate node behavior, penalize malicious actors, and reward honest participation. In Stage 1, nodes are assessed based on RS, incorporating factors like stake, transaction efficiency, block contribution, and past misconduct. Nodes failing to meet the threshold are penalized, while eligible ones advance to second stage. Stage 2 evaluates TS, considering rewards, penalties, and community votes, refining the selection through a payoff-based model that ensures rational decision-making. Unlike the downgrade method, GT-DPoS provides a more dynamic and adaptive approach, ensuring continuous security enhancement without long-term inefficiencies. Experimental results demonstrate that GT-DPoS achieves faster block creation times compared to conventional DPoS, with up to 4.6% improvement at lower transaction loads and 1.2% at higher loads. By leveraging game-theoretic principles, GT-DPoS enhances decentralization, reduces transaction latency, and strengthens network security, making it a more effective and performance-optimized alternative to both traditional DPoS and downgrade-based approaches

Baptiste Beltzer, Emmanuel Conchon, Sylvain Giroux

No abstract is available for this record.

Wencheng Chen, Jun Wang, Jeng-Shyang Pan, R. Simon Sherratt · 5 authors

The rapid advancement of Industry 5.0 has accelerated the adoption of the Industrial Internet of Things (IIoT). However, challenges such as data privacy breaches, malicious attacks, and the absence of trustworthy mechanisms continue to hinder its secure and efficient operation. To overcome these issues, this paper proposes an enhanced blockchain-based data storage framework and systematically improves the Delegated Proof of Stake (DPoS) consensus mechanism. A four-party evolutionary game model is developed, involving agent nodes, voting nodes, malicious nodes, and supervisory nodes, to comprehensively analyze the dynamic effects of key factors—including bribery intensity, malicious costs, supervision, and reputation mechanisms—on system stability. Furthermore, novel incentive and punishment strategies are introduced to foster node collaboration and suppress malicious behaviors. The simulation results show that the improved DPoS mechanism achieves significant enhancements across multiple performance dimensions. Under high-load conditions, the system increases transaction throughput by approximately 5%, reduces consensus latency, and maintains stable operation even as the network scale expands. In adversarial scenarios, the double-spending attack success rate decreases to about 2.6%, indicating strengthened security resilience. In addition, the convergence of strategy evolution is notably accelerated, enabling the system to reach cooperative and stable states more efficiently. These results demonstrate that the proposed mechanism effectively improves the efficiency, security, and dynamic stability of IIoT data storage systems, providing strong support for reliable operation in complex industrial environments.

Tiago Ferreira Cavazin

O presente artigo investiga a otimização do throughput em redes blockchain baseadas em mecanismos de consenso Proof-of-Stake (PoS) a partir de um estudo comparativo de latência entre diferentes arquiteturas, parâmetros de configuração e arranjos de infraestrutura de rede. Partindo do desafio clássico da engenharia de sistemas distribuídos de conciliar escalabilidade, segurança e descentralização – conhecido popularmente como trilema do blockchain –, analisa-se como decisões de projeto, dentre as quais se incluem o desenho do protocolo de consenso, a duração dos intervalos (slots), o tamanho dos blocos, o número de validadores ativos e a topologia da rede P2P, afetam simultaneamente o volume de transações processadas por unidade de tempo e o tempo de confirmação percebido pelos usuários finais. A metodologia adotada combina revisão sistemática da literatura sobre modelos de desempenho em sistemas distribuídos e blockchains PoS, comparação de estudos empíricos que mensuram throughput e latência em plataformas públicas de referência – particularmente Ethereum pós-Merge, Solana e Polkadot – e análise conceitual dos trade-offs identificados. Os resultados obtidos sugerem que técnicas de otimização orientadas a parâmetros, tais como ajuste fino de tempos de slot e políticas de propagação acelerada de blocos, combinadas a inovações em camada de consenso – dentre as quais se destacam mecanismos híbridos com Proof of History e execução paralela de transações –, podem reduzir significativamente a latência de confirmação sem necessariamente comprometer a segurança criptográfica ou a robustez da rede. Entretanto, emergem limites estruturais associados à variabilidade de condições de rede em escala global, à heterogeneidade de capacidade computacional entre nós validadores e às exigências clássicas de tolerância a falhas bizantinas, os quais impõem fronteiras práticas ao ganho de throughput em ambientes permissionless. Conclui-se que uma abordagem sistêmica, que integre ajuste criterioso de parâmetros, desenho criterioso da infraestrutura de nós e mecanismos de monitoramento e benchmarking contínuos, é fundamental para o amadurecimento da infraestrutura Web3 e para o suporte a aplicações com requisitos estritos de qualidade de serviço, entre as quais se incluem protocolos de finanças descentralizadas, mercados de capitais tokenizados e aplicações sensíveis ao tempo.

Steven Paul Nohr

<b><i>Proof-of-Stake (PoS)</i></b> blockchain networks replace energy-intensive mining with validator-based block production and transaction ordering. While this design improves efficiency and scalability, it introduces a largely unexamined structural vulnerability: deterministic or predictable validator sequencing. This paper defines <b>Sequential Validator Front-Running</b><b> </b>as a validator-level exploit whereby participants leverage foreknowledge of execution slots to extract economic advantage, manipulate outcomes, or preempt competing transactions. Unlike classical Miner/Maximal Extractable Value (MEV), this exploit arises from consensus scheduling itself rather than transaction visibility alone. We analyze the structural causes of this vulnerability, demonstrate why conventional mitigations such as governance controls, slashing, and post-hoc monitoring are insufficient, and propose a logic-layer sequencing constraint framework enforced at block construction time. The proposed approach neutralizes sequencing abuse while preserving throughput, finality, and protocol compliance.

Mohammad Pishdar, Jawad Manzoor

ABSTRACT Blockchain technology has emerged as a foundational infrastructure for decentralized applications, where consensus protocols play a critical role in ensuring security, consistency and trust among distributed participants. This paper presents a comprehensive comparative analysis of nine widely adopted consensus protocols across public (proof of work [PoW], proof of stake [PoS], delegated proof of stake [DPoS]) and private (practical Byzantine fault tolerance [PBFT, Raft, Kafka, proof of elapsed time [PoET], yet another consensus [YAC], Paxos) blockchain systems. Unlike prior surveys, this work integrates workflow‐level operational modelling, quantitative performance comparison and application‐driven decision support within a unified analytical framework. Our analysis shows that PoW achieves strong decentralization at 3–15 transactions per second (TPS) with 10–60 min finality, whereas PoS improves throughput to tens to thousands of TPS with seconds‐to‐minutes finality while reducing energy consumption by approximately 99%. Private blockchain protocols such as PBFT and Kafka achieve sub‐second latency and throughput exceeding 10,000 TPS by trading off decentralization for performance and control. Furthermore, we develop a decision‐support framework that maps consensus mechanisms to application requirements and provides a critical synthesis of security risks, scalability limitations, and emerging solutions. The findings highlight that no single protocol satisfies all design goals, reinforcing the necessity of context‐aware consensus selection.

Naren Swamy Jamithireddy

Financial reporting within enterprise resource planning now commonly rides on a blockchain backbone, yet the problem of keeping each distributed ledger in sync remains stubbornly difficult-especially when SAP modules are at the controls. This paper describes a simulation-based testbed that watches SAP payment journals as they hop between differently configured blockchains, measuring how and when each copy reaches the same state. By replaying typical SAP routines under adjustable delay windows and choice of consensus rules, the model tallies the frequency of divergence, the lag before agreement, and the mechanics of clearing up disputes. Output files display convex 3D surfaces, animated heat maps, and step-by-step trails of how conflicts get settled; taken together, they point middleware designers toward tighter sync logic, smarter contract frameworks, and faster multi-ledger audits. In broader terms, the findings shrink the technical distance SAP users must traverse to achieve clean, traceable cross-chain accounting.

Hojung Lim, Dong-Myung Shin

No abstract is available for this record.

Pavlo Zherzherunov, Olexandr Shmatko

Dockerised blockchain solution can mitigate the low levels of distributed technology adoption in small and medium enterprises. It can be done via designing and implementing an environment which inherits ease of deployment and scalability of containerized systems with safety and transparency of distributed applications. Practical implementation of a dockerized blockchain solution designed as a demonstrative implementation for existing client–server architecture is described in this paper. This solution uses Docker containers to simplify the setup and deployment of a private blockchain network, a mediator server and a reverse proxy. Implementation of this system on a low scale demonstrates feasibility of integrating blockchain technology into existing business processes without fundamental architectural changes and acknowledges deployment and maintaining challenges that usually accompany distributed systems using private blockchain. Discussed implementation is a demonstration of designed architecture being potentially a reproducible and easily maintainable environment for logging and validating data through an immutable ledger on a smaller scale. Proof of concept successfully validates the core idea. The implementation shows a mediator server intercepting client request, recording them on a private Ethereum blockchain via a JSON-RPC interface, and then forwarding them to the original server. This confirms the solution’s ability to introduce a trusted, intermediate layer for data immutability. The project demonstrates a working framework for embedding distributed ledger technologies into client–server ecosystems. While the current Proof of Work consensus mechanism presents scalability limitations, the architecture provides a strong foundation for future research, including migrating to more efficient consensus mechanisms and integrating smart contracts.

Adnan Imeri, Uwe Roth, Michail Alexandros Kourtis, Andreas Oikonomakis · 10 authors

Reliable data availability and transparent governance are fundamental requirements for distributed edge-to-cloud systems that must operate across multiple administrative domains. Conventional cloud-centric architectures centralize control and storage, creating bottlenecks and limiting autonomous collaboration at the network edge. This paper introduces a decentralized governance and service-management framework that leverages Decentralized Autonomous Organizations (DAOs) and Decentralized Applications (DApps) to to govern and orchestrate verifiable, tamper-resistant, and continuously accessible data exchange between heterogeneous edge and cloud components. By embedding blockchain-based smart contracts within swarm-enabled edge infrastructures, the approach enables automated decision-making, auditable coordination, and fault-tolerant data sharing without relying on trusted intermediaries. The proposed OASEES framework demonstrates how DAO-driven orchestration can enhance data availability and accountability in real-world scenarios, including energy grid balancing, structural safety monitoring, and predictive maintenance of wind turbines. Results highlight that decentralized governance mechanisms enhance transparency, resilience, and trust, offering a scalable foundation for next-generation edge-to-cloud data ecosystems.

Niccolò Scatena, Pericle Perazzo, Giovanni Nardini

This paper proposes iblock, a comprehensive C++ library for Bitcoin simulation, designed for OMNeT++. iblock offers superior efficiency and scalability with respect to state-of-the-art simulators, which are typically written in high-level languages. Moreover, the possible integration with other OMNeT++ libraries allows highly detailed simulations. We measure iblock's performance against a state-of-the-art blockchain simulator, proving that it is more efficient at the same level of simulation detail. We also validate iblock by using it to simulate different scenarios such as the normal Bitcoin operation and the selfish mine attack, showing that simulation results are coherent with theoretical expectations.

Arkadiusz Iwanicki

The article presents an empirical comparison of three contemporary Layer-2 scaling solutions for the Ethereum blockchain: Scroll, Linea, and Base, representing zk-rollup and optimistic rollup architectures. The study aims to evaluate the transaction processing speed and stability of selected Layer-2 networks using real-time data collected from blockchain explorers (Blockscout, Lineascan, Basescan). The dataset comprises 45,000 transactions processed in October 2025 and aggregated at one-second resolution (1 Hz). Statistical analyses include ANOVA, Kruskal–Wallis, Levene, and Brown–Forsythe tests, as well as ADF and KPSS stationarity diagnostics, used to assess diferences in throughput and operational stability across the examined networks. The results indicate that the Base network achieves the highest mean throughput (≈ 102 TPS) and the lowest temporal volatility, whereas Linea and Scroll exhibit non-stationary, highly variable transaction dynamics driven by periodic batching. The fndings confrm the persistence of the scalability trilemma—where improvements in performance may come at the cost of higher centralization and operational dependency. This research contributes to the quantitative assessment of rollup efciency and provides a reference point for further empirical studies on blockchain scalability.

Nektarios Deligiannakis, Vassilis Papataxiarhis, Michalis Loukeris, Stathes Hadjiefthymiades · 18 authors

Recently, the need for unified orchestration frameworks that can manage extremely heterogeneous, distributed, and resource-constrained environments has emerged due to the rapid development of cloud, edge, and IoT computing. Kubernetes and other traditional cloud-native orchestration systems are not built to facilitate autonomous, decentralized decision-making across the computing continuum or to seamlessly integrate non-container-native devices. This paper presents the Distributed Adaptive Cloud Continuum Architecture (DACCA), a Kubernetes-native architecture that extends orchestration beyond the data center to encompass edge and Internet of Things infrastructures. Decentralized self-awareness and swarm formation are supported for adaptive and resilient operation, a resource and application abstraction layer is established for uniform resource representation, and a Distributed and Adaptive Resource Optimization (DARO) framework based on multi-agent reinforcement learning is integrated for intelligent scheduling in the proposed architecture. Verifiable identity, access control, and tamper-proof data exchange across heterogeneous domains are further ensured by a zero-trust security framework based on distributed ledger technology. When combined, these elements enable increasingly autonomous workload orchestration, trading centralized control for adaptive, decentralized operation with enhanced interoperability, scalability, and trust. Thus, the proposed architecture enables self-managing and context-aware orchestration systems that support next-generation AI-driven distributed applications across the entire computing continuum.

Pranav S. Jampana, Sukrutha L. T. Vangipuram, Saraju P. Mohanty

No abstract is available for this record.

Mutiullah Shaikh, Uffe Kock Wiil, Ali Ebrahimi, Yumna Memon

Blockchain technology has revolutionized digital systems by ensuring trust, transparency, decentralization, and security. However, in the democratic nature of blockchain networks, there is a huge underlying dependency on consensus mechanisms, but the challenges associated with these, such as energy costs, network attacks, preservation of privacy, centralization, and limited scalability, hinder miners and stakeholders from adopting appropriate consensus mechanisms. In this paper, we present a conceptual literature overview of most consensus mechanisms by highlighting potential areas of exploration and considerations before adopting blockchain technology for various applications. This exploration turned our focus toward analyzing three prominent underlying aspects of consensus mechanisms, i.e. energy consumption, security, and decentralization. A simulation-based comparative analysis of five prominent blockchain consensus mechanisms, such as Proof of Work (PoW), Proof of Stake (PoS), Delegated Proof of Stake (DPoS), Proof of Authority (PoA), and Proof of Capacity (PoC), is presented in various network load scenarios to further evaluate their performance metrics. The simulated metrics were cross-validated using empirical data from real blockchain networks (e.g., Ethereum, Bitcoin, VeChain, and Chia) collected between 2022 and 2025, ensuring alignment between theoretical performance models and observed on-chain behavior across diverse consensus mechanisms. Results overall indicate that PoW excels in decentralization and security while costing the highest energy, making it less scalable for high-throughput scenarios. PoS balances energy efficiency and moderate decentralization, while DPoS achieves scalability at the expense of decentralization. PoA and PoC are shown to be energy-efficient alternatives, but vary in their levels of centralization and security. Our findings constitute a comprehensive guide for researchers, miners, and practitioners aiming to optimize blockchain performance for diverse applications.

Pfarelo Raliphada, Micheal O. Olusanya, Seun. Olukanmi

This study examines blockchain algorithms’ performance in a fog computing environments using data from the Bitcoin blockchain. As the demand for secure, low-latency solutions in IoT increases, blockchain offers integrity and decentralization, while fog computing ensures responsiveness. Key performance metrics like throughput, latency, and energy consumption were analyzed using statistical methods. The findings indicate significant variability in throughput and latency, along with high energy demands from traditional consensus mechanisms such as Proof of Work (PoW), making it unsuitable for fog environments. The study recommends adopting lightweight consensus protocols like Proof of Authority (PoA) and Delegated Proof of Stake (DPoS) to improve blockchain performance in edge environments.

Deepika Dash, Bipin Raj C., B Jnyanadeep, Anala M R

The proliferation of decentralized finance (DeFi) has highlighted critical challenges in cross- chain oracle reliability and performance assessment. Traditional blockchain networks remain isolated from external data sources, creating the fundamental Oracle Problem that hinders institutional adoption of DeFi protocols. This paper presents DeFiLens, a comprehensive benchmarking framework that provides standard- ized performance metrics and real-time analytics across multiple blockchain ecosystems including Ethereum, Binance Smart Chain, Polygon, and Avalanche. Our framework addresses the gap between traditional finance’s seamless market data access and blockchain’s data isolation through systematic oracle assessment. DeFiLens implements a six-layer security scoring system encompassing cryptographic verification, attack detection, and network health monitoring. Through extensive evaluation of major oracle providers including Chainlink, Band Protocol, and Tellor, we demonstrate significant performance variations across chains, with response times ranging from 2.1 seconds to 8.7 seconds and reliability scores varying between 72% and 95%. Our statistical analysis reveals critical arbitrage opportunities with price discrepancies up to 2.3% across chains. The framework serves as a ‘‘Bloomberg Terminal’’ for oracle data, enabling financial institutions, DeFi protocols, and researchers to make data-driven decisions for oracle integration and risk management.

Yuqiu Zhang, Hans-Arno Jacobsen

Serverless computing promises on-demand elasticity and simplified deployment, yet today's production-grade serverless platforms remain tied to a single-provider, centrally scheduled control plane. This centralized scheduling model faces mounting challenges in handling heterogeneous policies, data governance constraints, and dynamic workloads for the modern web, where applications increasingly span multiple geo-distributed autonomous administrative domains. In this paper, we present Mocha, a decentralized, policy-aware framework for scheduling serverless functions across a federated ecosystem. At its core, Mocha proposes a hierarchically structured distributed hash table that embeds geographical and organizational context to facilitate locality-aware scheduling without any central authority. By implementing a formally specified compliance engine at each domain, Mocha guarantees that all regulatory, locality, and resource constraints are honored for function placement decisions. Experiments show that Mocha reduces scheduling tail latency by 4–9× compared to alternatives while maintaining full policy adherence.

P. C. Pal, Shubhasmita Behera

Keybyte Systems, Intentix Lab , Melbourne, Australiapronab@keybytesystems.com.au Supported by AusIndustry Grant IR2405165 __________________________________AbstractModern cloud-native applications distribute business logic across multiple layers: application code, orchestration frameworks, service meshes, and infrastructure configurations. This distribution creates ”hidden logic”—execution rules embedded in infrastructure that are invisible during design and difficult to trace at runtime. We present Intention Space , a computing model built on the CPUX (Common Path of Understanding and Execution) paradigm that consolidates all business logic into explicit, design-time declarations using plain-language state pulses. In our model, Design Nodes (DNs) contain computation while Gatekeepers declare execution conditions as named pulses (e.g., ”payment validated”: Y). The infrastructure provides only mechanical enforcement through an Intention Loop that matches runtime state to Gatekeepers without adding decision logic. We demonstrate that complex workflows—traditionally requiring nested if-then branching and explicit loops—can be expressed as linear CPUX sequences where execution paths emerge from data state rather than code branching. Our Golang implementation shows complete elimination of orchestration code while maintaining full cognitive traceability. Beyond technical innovation, CPUX addresses a critical social computing crisis: the lack of accountability in distributed social platforms. By creating unique, device-level CPUX footprints for every interaction, our model enables verifiable traceability from device identity through user intention to executed action—restoring accountability to social computing while preserving privacy. We argue this separation of intent (CPUX) from enforcement (infrastructure) is essential for building LLM-integrated, auditable, and socially responsible distributed systems.Keywords: CPUX, Intention Space, Design Nodes, Cognitive Computing, Data-Driven Execution, Microservices Architecture, Cloud Computing, LLM Integration, Social Computing Accountability__________________________________1. Introduction1.1 The Hidden Logic ProblemConsider a typical e-commerce order processing system deployed on Kubernetes with Istio service mesh:// order-service/main.go (Business Logic Layer) func ProcessOrder(order Order) error { if order.Amount > 1000 { if err := premiumValidator.Validate(order); err != nil { return retry(premiumValidator.Validate, 3, order) } } else { standardValidator.Validate(order) } // … more branching logic }# k8s/hpa.yaml (Infrastructure Layer) spec: metrics: - type: Resource resource: name: cpu target: type: Utilization averageUtilization: 80 # Hidden rule: Scale when CPU > 80%# istio/retry-policy.yaml (Service Mesh Layer) spec: http: - retries: attempts: 3 perTryTimeout: 2s # Hidden rule: Retry 3 times on failureQuestion: What is the complete execution flow for a $1500 order that fails validation on first attempt?Answer: One must read and correlate:Application code (branching logic)Kubernetes manifests (scaling rules)Istio configurations (retry policies)Service mesh observability logs (runtime behavior)This hidden logic distribution creates fundamental problems:Traceability : No single artifact shows complete flowTestability : Must test infrastructure + code interactionsAuditability : Business stakeholders cannot validate logicMaintainability : Changes require coordinating multiple layersLLM Integration : No structured representation for AI reasoningSocial Accountability : Cannot trace interactions to source devices/users1.2 The Core InsightWe observe that traditional computing conflates two distinct concerns:What should happen(business intent)How to make it happen(mechanical execution)Current architectures intertwine these concerns across code, configuration, and infrastructure, making systems cognitively opaque.Our Contribution: We introduce CPUX (Common Path of Understanding and Execution) , a paradigm that separates business intent from infrastructure enforcement:CPUX Structure : Declares all possible execution paths as sequences of Design Nodes (DNs) with plain-language Gatekeeper conditionsInfrastructure : Provides mechanical execution (Intention Loop) that enforces CPUX declarations without adding decision logicDevice-Level Identity : Each CPUX execution tied to unique device fingerprint + user intention, enabling social computing accountabilityResult : Complete business logic is visible in CPUX; infrastructure remains purely mechanical; every social interaction is traceable1.3 Key ContributionsFormal Model : CPUX as cognitive execution contract with Design Nodes, Intentions, Objects, and Pulses as primitive componentsElimination of Hidden Logic : All business decisions visible in design-time CPUX declarations; infrastructure adds zero decision logicPlain-Language State Declarations : Execution conditions expressed as named pulses (e.g., ”inventory confirmed”: Y) enabling business stakeholder review and LLM integrationData-Driven Execution : Runtime branching eliminated from code; execution paths emerge from pulse state matching via SyncTestSocial Computing Accountability : Device-level CPUX fingerprints create unique, traceable identity for every social interaction, addressing the accountability crisis in platforms like Facebook, Twitter, TikTokImplementation & Evaluation : Golang framework code sample with concrete use case demonstrating zero orchestration code while maintaining full traceability1.4 Paper OrganizationSection 2 examines related work. Section 3 presents the PnR computing model and CPUX formalism. Section 4 details the architecture and implementation. Section 5 evaluates our approach through metrics and case studies. Section 6 discusses LLM integration. Section 7 introduces CPUX for social computing accountability—the urgent global need. Section 8 concludes with future directions.__________________________________2. Related Work2.1 Workflow Orchestration SystemsAWS Step Functions [1] and Azure Logic Apps [2] provide visual workflow definition with explicit state machines. However, they:Use proprietary JSON/XML DSLs (not plain language)Embed conditional logic in workflow definitions (still branching)Remain platform-specific (vendor lock-in)Require reading workflow definitions to understand flowCannot trace to device/user identityApache Airflow [3] and Temporal [4] define workflows as code with DAG structures. They improve on step functions ,recoverability but:Business logic still in code (if-then branches)Workflow orchestration separate from executionNo plain-language condition declarationsNo device-level traceabilityCPUX Advantage : All logic in plain-language pulses, platform-agnostic, no explicit branching in declarations, device-level identity for every execution, recoverability built into platform. 2.2 Service Mesh & OrchestrationIstio [5] and Linkerd [6] provide traffic management, retries, circuit breaking. Kubernetes Operators [7] encode reconciliation logic. These systems:Hide business rules in YAML configurationsDistribute logic across mesh config + operator codeFocus on infrastructure concerns (not business flow)Lack unified view of complete execution pathNo user/device attributionCPUX Advantage : Consolidates all execution logic in CPUX; infrastructure config aligned with business intent; device identity integral.2.3 Event-Driven ArchitecturesApache Kafka [8], AWS EventBridge [9] enable event-driven systems with loose coupling. Reactive systems [10] promote message-passing. However:Event flows implicit (must trace message paths)Conditional logic in event handlers (code-level branching)No design-time declaration of all possible flowsNo provenance tracking to source deviceCPUX Advantage : Explicit declaration of all event-driven paths as DN sequences with visible Gatekeepers; device identity in event provenance.2.4 Intent-Based SystemsIntent-Based Networking [11] translates high-level intents to network configurations. Policy-based management [12] separates policy from mechanism. Closest to our work, but:Focus on infrastructure (not application logic)Policies often domain-specific (not general computing)Limited plain-language expressivenessNo user accountabilityCPUX Advantage : General-purpose computing model with full plain-language pulse declarations applicable to any domain; device-level user accountability.2.5 Formal Methods & Model CheckingTLA+ [13], Alloy [14], and Petri Nets [15] enable formal specification and verification. These are powerful but:Require specialized formal notation (high learning curve)Specification separate from implementation (sync problems)Not designed for runtime executionNo social computing traceabilityCPUX Advantage : Declarations are executable; CPUX structure IS the implementation contract; device identity embedded.2.6 Social Computing & AccountabilityBlockchain-based identity [16] and zero-knowledge proofs [17] address digital identity but:Focus on cryptographic primitives (not execution tracing)Don’t integrate with application logicNo cognitive representation of intentFederated social networks [18] (Mastodon, ActivityPub) improve decentralization but:Still lack device-level traceabilityNo structured intent representationCannot prove user intended specific actionCPUX Advantage : First system to integrate device identity, user intention, and execution trace in single cognitive framework.2.7 PositioningCPUX is the first system to combine:Plain-language execution conditions (like Intent-Based Networking)Executable specifications (unlike formal methods)Complete flow visibility (unlike distributed orchestration)Zero hidden infrastructure logic (unique contribution)Device-level social accountability (unique contribution)__________________________________3. The PnR Computing Model3.1 Core Abstractions3.1.1 Pulse: Atomic State UnitA Pulse is the fundamental data unit representing a named state with optional response and trivalence:Pulse = (Name: String, Response: Value, Trivalence: {Y, N, U})Name : Plain-language identifier (e.g., ”payment validated”)Response : Optional value (e.g., transaction ID)Trivalence : Y (yes/true), N (no/false), U (undecided)