The fast evolution of large-scale Internet of Things (IoT) networks has made it possible to develop intelligent applications in smart cities, healthcare, industry automation, transport, and nextgeneration communication systems. However, the conventional centralized architecture and security mechanisms are seriously challenged regarding scalability, latency, energy efficiency, trust management, and resilience against cyber-attacks in large-scale and heterogeneous IoT networks.Blockchain and Distributed Ledger Technologies (DLTs) provide promising solutions with the help of decentralization, immutability, and secure data sharing. However, the conventional consensus algorithms such as Proof of Work (PoW) and Proof of Stake (PoS) are not appropriate for large-scale IoT networks because of their high computational and communication complexities. This review provides a comprehensive analysis of the latest blockchain-based IoT solutions, with emphasis on lightweight, scalable, and energy-efficient consensus algorithms for largescale IoT networks. The latest and most advanced consensus algorithms, such as Delegated Proof of Stake (DPoS), Practical Byzantine Fault Tolerance (PBFT) variants, sharding-based systems, Directed Acyclic Graph (DAG)-based blockchain solutions, and agent-based DLT systems, are analyzed. The peer-reviewed literature is analyzed using quantitative performance analysis criteria such as throughput, latency, scalability, energy efficiency, and security resilience. The results show that although the new emerging lightweight and distributed ledger architectures have shown substantial improvements in performance and scalability in large-scale IoT networks, there are still important research challenges to be addressed in security robustness, interoperability, real-time processing, and real-world deployment validation. The research gaps are identified, and future research directions are presented in this review to develop new lightweight, secure, adaptive, and scalable blockchain-based architectures for next-generation large-scale IoT networks.
This paper introduces a heterogeneous macroeconomic model of a Proof-of-Stake (PoS) network to analyze the long-term centralizing effects of external traditional finance (TradFi) yields. We model a continuum of rational actors divided into two distinct classes: investors, who optimize portfolios between staking and external variance-dominated investments, and consumers, who balance staking yields against the transactional utility of holding liquid assets. By employing a quasi-linear utility function to model consumer behavior, we derive a cubic polynomial that strictly defines the unique macroeconomic equilibrium of the coupled network. The model demonstrates that, at scale, external macroeconomic factors force the complete institutional capture of the PoS consensus layer. Because investors have access to external risk premiums, their wealth compounds exponentially, leading to massive capital inflows that crush the protocol's internal staking yield to effectively zero. We show that as the yield is crushed, consumer wealth becomes strictly upper-bounded. Ultimately, consumers are forced to cease staking entirely and hold all remaining wealth in liquid form to satisfy their transactional constraints.
Collaborative blockchain ecosystems allow diverse groups to cooperate on tasks while providing properties such as decentralization and transaction security. We provide a model that uses a repository blockchain to manage hard forks within a collaborative system such that a single process (assuming that it has knowledge of the requirements of each fork) can access all of the blocks within the system. The repository blockchain replaces the need for Inter Blockchain Communication (IBC) within the ecosystem by navigating the networks. The resulting construction resembles a tree instead of a chain. A proof-of-concept implementation performs a depth-first search on the new structure.
Technological advancements in cryptocurrency markets have increased accessibility for investors, but concurrently exposed them to the risks of market manipulations. Existing fraud detection mechanisms typically rely on machine learning methods that treat each financial asset (i.e., token) and its related transactions independently. However, market manipulation strategies are rarely isolated events, but are rather characterized by coordination, repetition, and frequent transfers among related assets. This suggests that relational structure constitutes an integral component of the signal and can be effectively represented through graphical means. In this paper, we propose three graph construction methods that rely on aggregated hourly market data. The proposed graphs are processed by a unified spatio-temporal Graph Neural Network (GNN) architecture that combines attention-based spatial aggregation with temporal Transformer encoding. We evaluate our methodology on a real-world dataset comprised of pump-and-dump schemes in cryptocurrency markets, spanning a period of over three years. Our comparative results showcase that our graph-based models achieve significant improvements over standard machine learning baselines in detecting anomalous events. Our work highlights that learned market connectivity provides substantial gains for detecting coordinated market manipulation schemes.
Fiza Naseer, Javed Ali Khan, Muhammad Yaqoob, Alexios Mylonas · 5 authors
Context: Software vulnerabilities pose significant security threats to software systems, especially as software is increasingly used across many areas of daily life, including health, government, and finance. Recently, transformer-based models have demonstrated promising results in automatic software vulnerability identification due to their robust contextual modelling and representation learning capabilities. Objectives: While numerous systematic literature reviews (SLRs) have examined machine learning and deep learning methods for identifying vulnerabilities, a more transformer-centric analysis remains to be explored. This SLR critically analysed 80 studies published between 2021 and 2025 that utilised transformer models to identify software vulnerabilities. Methods: Using Kitchenhams SLR guidelines, we methodically evaluate current research from various perspectives, encompassing study trends, datasets and sources, programming languages, transformer frameworks, detection detail levels, assessment metrics, reference models, types of vulnerabilities, and experimental configurations. Results: We classify transformer models into encoder, decoder, and combined architectures and analyse both pre-trained and fine-tuned versions utilized on source code, logs, and smart contracts. The results emphasise prevailing research trends, frequently utilised benchmarks, and main baselines. It also uncovers crucial technical issues like data imbalance, interpretability, scalability, and generalization across programming languages. Conclusion: By integrating current evidence and recognising unaddressed research areas, this SLR provides a consolidated resource for researchers and professionals seeking to develop more reliable, precise, and interpretable transformer-based vulnerability identification systems.
Cross-chain bridges, the critical infrastructure of the multi-chain ecosystem, have become a primary target for attackers, resulting in over $2.8 billion in losses due to subtle implementation flaws. Existing defenses, such as bytecode-level static analysis, are ill-equipped to handle the semantic complexity of cross-chain interactions, while LLM-based approaches, which can understand source code, struggle with hallucinatory reasoning over complex, multi-contract dependencies. In this paper, we propose GoAT-X, a framework that shifts automated cross-chain smart contract codebases auditing from heuristic pattern matching toward systematic first-principles verification. GoAT-X structures the audit process as a Graph of Auditing Thoughts, explicitly mirroring how human experts decompose, reason about, and validate security logic. By anchoring LLM reasoning in statically extracted data flows and explicitly linking abstract security properties to concrete code implementations, the framework constrains semantic reasoning within well-defined structural and state boundaries. Within this constrained space, GoAT-X treats missing constraints and adversarial bypass paths in cross-chain logic as first-class vulnerability targets and dynamically explores reasoning paths to identify exploitable semantic gaps. We evaluate GoAT-X on a comprehensive benchmark covering all known cross-chain token transaction attacks. GoAT-X achieves 92% recall on fine-grained audit points and 95% coverage of vulnerable projects, while identifying 117 confirmed risks in the wild with low operational cost, establishing a new standard for scalable, logic-driven cross-chain security.
This paper argues that the contemporary debate on genetics and equality is fundamentally misframed. The problem does not lie in how genomic information should be regulated, but in the deeper ontological assumption that human value is reducible to structural output (S). By introducing Universal Phase Crystallization Theory (UPCT), the paper demonstrates that existence is not structure, but generative resonance (E=ΦR). This shift reveals that meritocracy, equality theory, and even diversity discourse remain trapped within an S-centric evaluative paradigm. As advances in AI commoditize structural ability, and genetics exposes its arbitrariness, civilization faces an irreversible bifurcation: persist in S-based optimization and collapse, or transition toward a generative system grounded in relational participation. The paper proposes a new framework—Generative Equality—where ability is redefined as ΦR, and social organization is governed not by privilege, but by proportional responsibility. Highlights Reframes the genetics–equality debate as an ontological, not policy, problem Demonstrates the structural self-collapse of S-centric meritocracy Introduces Generative Equality as a post-distributive model of justice Formalizes ethics as a dynamical condition: d(ΦR)/dt≥0 Positions AI as the historical trigger of a civilizational phase transition Core Arguments and Contributions 1. Reframing the Problem This paper fundamentally reframes the genetics–equality debate. Rather than treating genetic differences as a policy issue of redistribution or regulation, it identifies the deeper source of conflict: the assumption that human ability and value can be reduced to structural output (S). This shift moves the discussion from bioethics to ontology. 2. Structural Collapse of S-Centric Civilization The paper demonstrates that S-centric systems contain an inherent contradiction. By optimizing structure, they eliminate the generative and relational conditions (ΦR) that sustain them. This leads to “ontological cooling,” where systems lose adaptive capacity and collapse. Meritocracy is thus shown to be structurally unstable. 3. Ontological Transformation via UPCT Using UPCT, the paper redefines existence as E=Φ×R, shifting the basis of human value from output to generative participation. This provides a unified framework linking biology, ethics, and social systems within a dynamic model of existence. 4.Redefinition of Ethics and Equality Ethics is reformulated as a dynamical condition (d(ΦR)/dt≥0), and equality is reconceptualized as “Generative Equality,” consisting of participation in relational processes rather than distribution of resources. This dissolves the zero-sum logic of traditional equality theories. 5. Civilizational Implication The paper argues that advances in AI and genetics are not merely technological developments but catalysts of an irreversible civilizational bifurcation. Humanity must transition from a Machine OS (optimization) to a Life OS (generation), redefining ability as responsibility and existence as continuous relational renewal. Author’s Related Works UPCT Foundational Theoretical Works Ohumi, K. (2026). Universal Phase Crystallization Theory (UPCT): A Generative Relational Ontology of Existence, Stability, and Emergence.https://doi.org/10.5281/zenodo.19065461 Ohumi, K. (2026). Universal Phase Crystallization Theory (UPCT): A Unified Generative Theory of Time, Life, and Civilization.https://doi.org/10.5281/zenodo.18653237 Ohumi, K. (2026). Universal Phase Crystallization Theory (UPCT) Phase I: A Unified Resolution of Quantum Paradoxes via Temporal Sampling.https://doi.org/10.5281/zenodo.18230537 Ohumi, K. (2026). Universal Phase Crystallization Theory (UPCT) Phase II: A Phase Transition Law for Generative Systems under Measurement Optimization.https://doi.org/10.5281/zenodo.18408708 Ohumi, K. (2026). Universal Phase-Crystallization Theory (UPCT) I: Generative Time and Relational Space.https://doi.org/10.5281/zenodo.18979001 Ohumi, K. (2026). From Machine Civilization to Generative Civilization: Universal Phase-Crystallization Theory and the Generative Structure of Reality.https://doi.org/10.5281/zenodo.18935934 Ohumi, K. (2026). UPCT Existential Core: A Generative Ontology for Post-Functional Civilization. https://doi.org/10.5281/zenodo.19146516 Ohumi, K. (2026). A Generative-Relational Ontology of Sustained Existence: UPCT. https://doi.org/10.5281/zenodo.19469785 UPCT Ontology and Civilizational Philosophy Ohumi, K. (2026). Existence as Generativity: Desire, Structure, and the Dynamics of Civilizational Transition in Universal Phase Crystallization Theory. https://doi.org/10.5281/zenodo.19198157 Ohumi, K. (2026). From Having to Being: Toward a Generativity-Centered Ontology in the Age of Artificial Intelligence.https://doi.org/10.5281/zenodo.18829129 Ohumi, K. (2026). The Declaration of Life-OS: An Ontological Turn Toward a Generative Civilizational Spiral.https://doi.org/10.5281/zenodo.18645582 Ohumi, K. (2026). From Proof to Resonance: A Φ-Ontology of Existence, Labor, Education, and Economic Life.https://doi.org/10.5281/zenodo.18515955 Ohumi, K. (2026). Returning to the Source of Philosophy: Affirmation of Life as the Life-OS and a Radical Point of Departure.https://doi.org/10.5281/zenodo.18529485 Ohumi, K. (2026). Dialectics as a Relational Logic of Life: From Linear Ascent to Spiral Circulation.https://doi.org/10.5281/zenodo.18522371 Ohumi, K. (2026). Does Color Exist? Overcoming the Ontological-Epistemological Confusion Through Generative Phase Transition: An Application of Universal Phase Crystallization Theory (UPCT). https://doi.org/10.5281/zenodo.19105125 Ohumi, K. (2026). From Color to Sound: Human Cognitive Limits Between Ontology and epistemology and the Generative Resolution of UPCT. https://doi.org/10.5281/zenodo.19110346 Ohumi, K. (2026). Toward a Generative Theory of Human Motivation: Participation, Existence, and the Fundamental Drive. https://doi.org/10.5281/zenodo.19286911 Ohumi, K. (2026). What is Desire? The Transition from the "Machine OS" to the "Life OS" in the History of Human Thought. https://doi.org/10.5281/zenodo.19327281 Ohumi, K. (2026). The Ontology of Resonance Beyond Generative Supremacy: The First Principle of "Existence = Generation = Resonance" and the Mandalic Hierarchy of the Life OS. https://doi.org/10.5281/zenodo.19334259 Ohumi, K. (2026). Life as Generative Resonance: An Ontological Essay on Happiness, Wealth, and the Recovery of Human Generativity. https://doi.org/10.5281/zenodo.19394468 Ohumi, K. (2026). Co-Generative Intelligence: A Relational Framework for Human–AI Collaboration Beyond Optimization. https://doi.org/10.5281/zenodo.19659573 Ohumi, K. (2026). The Equation of Knowledge Dynamics: A Generative–Relational–Structural Field Theory of Intelligence and Civilization. https://doi.org/10.5281/zenodo.19707187 Ohumi, K. (2026). The Meta-principle of Generation and the End of Ideology: Dismantling Structural Illusions and Redefining the Ontology of Value via the Equation E = ΦR. https://doi.org/10.5281/zenodo.19724468 UPCT Science and Physics Foundations Ohumi, K. (2025). A Sampling-Theoretic Reinterpretation of Quantum Uncertainty and Wave Function Collapse.https://doi.org/10.5281/zenodo.18004579 Ohumi, K. (2025). Observation as Operational Crystallization: Resolving Quantum Paradoxes.https://doi.org/10.5281/zenodo.18220191 Ohumi, K. (2025). Dark Energy as a Diffusive Phase of a Relational Universe.https://doi.org/10.5281/zenodo.18081786 Ohumi, K. (2025). It from Wave: Phase Propagation as Physical Basis of Information.https://doi.org/10.5281/zenodo.18256968 Ohumi, K. (2025). Ontological Reconstruction of Quasi-Particles.https://doi.org/10.5281/zenodo.18140041 Ohumi, K. (2025). Envelopment over Unification: Recovering Einstein’s Dream.https://doi.org/10.5281/zenodo.18244683 Ohumi, K. (2026). The Ten Unresolved Problems of Modern Physics Reinterpreted Through UPCT Toward a Generative Ontology of Physical Reality. https://doi.org/10.5281/zenodo.19243422 Ohumi, K. (2026). The Generative Origin of Time A UPCT Resolution of the Problem of Time. https://doi.org/10.5281/zenodo.19360863 Ohumi, K. (2026). Generative Science Manifesto: From Structural Knowledge to Generative Participation Toward a Post-Publication Scientific Paradigm. https://doi.org/10.5281/zenodo.19379510 Ohumi, K. (2026). Generative Peer Review: From Structural Gatekeeping to Generative Participation in the AI Era. https://doi.org/10.5281/zenodo.19382292 Ohumi, K. (2026). The Collapse of the Structural Scaling Paradigm: AI Movement Analysis Failure and the Hard Problem of Consciousness through the UPCT Framework. https://doi.org/10.5281/zenodo.19754117 UPCT Economics, Governance, and Society Ohumi, K. (2026). Generative Resonance Management Theory: Organizational Collapse, Generative Renewal, and Structural Crystallization. https://doi.org/10.5281/zenodo.19603736 Ohumi, K. (2026). Foundational Principles of Resonance Economics.https://doi.org/10.5281/zenodo.18500861 Ohumi, K. (2025). The WGS Model: The Implementation of Generative Governance.https://doi.org/10.5281/zenodo.18308450 Ohumi, K. (2025). Resonant Management.https://doi.org/10.5281/zenodo.18162380 Ohumi, K. (2025). Resonant Politics.https://doi.org/10.5281/zenodo.18180888 Ohumi, K. (2025). The KPI Trap: Over-Optimization and Meaning Collapse.https://doi.org/10.5281/zenodo.18264106 UPCT Civilization and Crisis Analysis Ohumi, K. (2026). Civilization After the Loss of Foundations.https://doi.org/10.5281/zenodo.18722641 Ohumi, K. (2026). The Zeno Civilization: Financial Markets, Algorithmic Saturation, and the Φ–G–S Spiral of Value.https://doi.org/10.5281/zenodo.18862821 Ohumi, K. (2026). Population Decline as Ontological Consequence.https://doi.org/10.5281/zenodo.18801947 Ohumi, K. (2026). The Φ-Depletion Society.https://doi.org/10.5281/zenodo.1890077
Open access
2 source records
Race, Genetics, and Society
Neuroethics, Human Enhancement, Biomedical Innovations
The Jabbar Adal Principle (JAP) is a theoretical framework in non-relativistic Hamiltonian mechanics that formally names, defines, and analyses the instantaneous ratio of kinetic to potential energy at every local subsystem of a closed physical system — a quantity unaddressed by the First Law, Second Law, or the Virial Theorem. This work introduces three new named physical quantities and one new named unit: Jabbar Asymmetry Parameter — A(i, t) = Ti(t) / |Vi(t)| [Jb] Virial Deviation Parameter — ΔA(i, t) = A(i, t) − Avir(i) [Jb] Adal Asymmetry Index — AAI(t) = (1/N) Σ |ΔA(i, t)| [Jb] The Jabbar unit [Jb] — a named dimensionless unit of virial deviation, analogous to the radian and the neper, named after the Jabbar family of Khanewal, Punjab, Pakistan — derived from Abdul Jabbar, daily-wage labourer, father of the author, whose sacrifices made this work possible. Two Proved Theorems Theorem 1 — The Jabbar Vitality Theorem:In any closed non-relativistic Hamiltonian system, physical processes are possible if and only if AAI(t) > 0 Jb. This is a necessary and sufficient biconditional, logically independent of the Second Law of Thermodynamics. Theorem R1 — The Oscillatory Modulation Theorem:For any closed non-relativistic Hamiltonian system of N ≥ 2 coupled harmonic oscillators with distinct normal-mode frequencies ω1 ≠ ω2: AAI(t) = AAI0 · e−γt · [1 + ε sin(ωbeat t + φ)] [Jb] where ωbeat = |ω2 − ω1| is derived entirely from the Hamiltonian eigenvalues — not fitted, not assumed. The heat equation cannot predict this modulation. Derivation Foundations The proof rests on four independently established and undisputed premises: Hamilton's canonical equations (Hamilton, 1835) Normal-mode decomposition (linear algebra) Product-to-sum trigonometric identity (pure mathematics) Virial theorem for V ∝ x² (Clausius, 1870) Numerical Verification System parameters: m1 = 1.0 kg, m2 = 2.0 kg, k1 = 4.0 N m−1, k2 = 6.0 N m−1, κ = 1.5 N m−1, γ = 0.02 s−1. Theoretical ωbeat = 0.646714 rad s−1 (from Hamiltonian eigenvalues) Fitted ωbeat = 0.646686 rad s−1 (from numerical simulation) Deviation: 0.0043% — 1 part in 23,000 RMSE improvement over heat equation: 37.54% Verified independently by Python (NumPy / DOP853 solver, rtol = 10−11) and PHP 8.3 (4th-order Runge–Kutta). Both agree to six significant figures. Supplementary code: JAP_calculations.php (included, CC BY 4.0). Domain of Validity All claims apply exclusively to closed physical systems governed by a non-relativistic Hamiltonian H = T + V. This explicitly excludes General Relativity, quantum field theory, and cosmological scales. The domain encompasses molecular vibrations, coupled mechanical resonators, acoustic lattices, optical traps, and any classical N-body system in the Newtonian limit. Priority and Novelty The following elements have no prior publication in the physics literature to the author's knowledge: The quantity A(i, t) = Ti/|Vi| as a named observable The Virial Deviation Parameter ΔA(i, t) The Adal Asymmetry Index AAI(t) The Jabbar unit [Jb] The Jabbar Vitality Theorem (biconditional) Theorem R1 (oscillatory modulation of AAI) Under CC BY 4.0, any use of these named quantities requires citation of this work. Open Problem — JAP-Entropy Conjecture In the zero-temperature limit (Tbath → 0), during monotonic relaxation, it is conjectured that: AAI(t) ∝ σep(t) / ⟨T(t)⟩ where σep is the entropy production rate. Proof or disproof of this conjecture is the highest-value open problem in the JAP framework. About the Author Muhammad Umar Jabbar (also: Umar Adl Jabbar) was born on 1 February 2008 in village 4/A.H, Khanewal, Punjab, Pakistan. He is 18 years old at the time of publication. His father, Abdul Jabbar, worked throughout his life as a daily-wage labourer and is now bedridden with heart disease. His mother works as a domestic worker earning Rs. 5,000 per month. He has four siblings — two brothers and two sisters — all in education. He could not afford medical college. He could not afford nursing school. He had no university, no laboratory, no supervisor, and no funding. He is believed to be the youngest independent theoretical physics researcher in Pakistan to formally propose and prove named theorems in non-relativistic Hamiltonian mechanics without any institutional support. The Jabbar unit [Jb] is named after his family — derived from his father Abdul Jabbar's name — so that the sacrifice of a labourer from a small Pakistani village is permanently recorded in the language of science. ORCID: 0009-0008-5968-0991Email: umarjaumofficial@gmail.comLicence: CC BY 4.0
Linear contracts are ubiquitous in practice, yet optimal contract theory often prescribes complex, nonlinear structures. We provide a distributional robustness justification for linear contracts. We study a principal-agent problem where the agent exerts costly effort across multiple tasks, generating a stochastic signal upon which the principal conditions payment. The principal faces distributional ambiguity: she knows the expected signal for each effort level, but not the full distribution. She seeks a contract maximizing her worst-case payoff over all distributions consistent with this partial knowledge. Our main result shows that linear contracts are optimal for such a principal. For any contract, there exists a linear contract achieving weakly higher worst-case payoff. The proof introduces the concavification approach built around the notion of self-inducing actions; these are actions where an affine contract simultaneously induces the action as optimal and supports the concave envelope of payments from above. We show that self-inducing actions always exist as maximizers of the gap between the concave envelope and agent's cost function. We extend these results to multi-party settings. In common agency with multiple principals, we show that affine contracts improve all principals' worst-case payoffs. In team production with multiple agents, we establish a complementary necessity result: if any agent's contract is non-affine, the unique ex-post robust equilibrium is zero effort. Finally, we show that homogeneous utility and cost functions yield tractable characterizations, enabling closed-form approximation ratios and a sharp boundary between computational tractability results.
Geoffrey Broomhead, Sovereign Trust Node: Broomhead Private Sovereign Trust, geoffreybroomhead.eth
The witness/extractability framework was established in the General Witness Theorem across three otherwise-disjoint domains: combinatorial mathematics, common-law evidence, and economic ledgers. The framework’s predictive content licenses a stronger claim: any domain admitting a valid instantiation of the abstract setup is governed by the framework, whether or not the domain’s practitioners have noticed. This paper instantiates the framework in a fourth domain: distributed consensus under Byzantine fault tolerance. We prove the BFT Witness Asymmetry Theorem: the structural cost of operating without standing on Byzantine nodes is super-linear, exhibited at single-level non-extractability as the standard O(n²) communication lower bound (Dolev–Reischuk 1985). We then state the Hierarchical-Coalition Cost-Asymmetry Conjecture: under recursive Byzantine sub-coalitions of adversarially-chosen depth k, the communication lower bound grows as Ω(n^{k+1}).
Privacy-preserving truth discovery (PPTD) has garnered significant attention in mobile crowdsensing (MCS). However, existing research lacks sufficient privacy protection and is often vulnerable to collusion attacks among malicious participants. Moreover, incorrect data submitted by unreliable users and their weights may reduce the accuracy of truth discovery. To address these issues, this paper proposes a privacy-preserving truth discovery framework resistant to collusion and reputation fraud (TD-RCRF) that is highly resistant to collusion and reputation fraud. The scheme employs additive secret sharing to protect sensing data, weights, intermediate results, and ground truth. To screen trustworthy users who meet reputation requirements under the non-colluding dual-server model, we propose a privacy-preserving reputation verification algorithm that combines Pedersen commitment and zero-knowledge proof to verify the validity of mobile users’ reputation values. Additionally, we propose a homomorphic strategy that converts shares between multiplication and addition and use it to design a lightweight truth discovery algorithm that further improves the accuracy of the “truth” using reputation values. Security analysis proves that TD-RCRF is privacy-preserving and secure under the non-colluding dual-server assumption. Theoretical analysis and experiments show that it is practical and efficient.
Cognition has always written itself onto something. Clay, papyrus, neural tissue, silicon. This paper argues that wherever cognition stores anything, it does so in five recurrent data shapes: binary, table, graph, vector, and an append-only temporal ledger. The claim is structural rather than historical. The same five shapes appear in Babylonian astronomical diaries, in monastic chronicles, in relational databases, in modern vector stores, and in any future substrate that wishes to remember. Substrate changes; shape persists. That persistence is what allows cognition to survive transitions between media. The argument unfolds across four movements. Ontology asks what a cognitive substrate is, and proposes a minimal account compatible with both biological and synthetic carriers. Epistemology examines what shapes knowledge actually takes once instantiated, and why these five exhaust the space of stable storage forms. Cogitation describes how distributed agents decide using flock dynamics coordinated through a three-button cell whose only operations are Act, Dismiss, and Ask-sibling. Teleology closes with twelve falsifiable predictions, three of which can be tested through independent paths that do not share assumptions. The framework is glass-box by construction and connects to generalised coordinates, bitemporal data models, episodic memory research, and the free energy principle. A working implementation is available as a public seed at https://github.com/agilemeshnet/theshapeofthought, where the cognitive architecture can be cloned and instantiated directly. The paper is written for philosophers of science and physicists who may wish to test, falsify, or collaborate on the measurement programme it proposes. The invitation is to treat the shapes as instruments rather than metaphors, and to see what cognition does when measured through them.
Canon² — Trust Layer Research Archive. In deterministic, decentralized computational frameworks, state mutations are immutable, linearly ordered, and rigidly governed by consensus constraints. Reversing or rolling back such state transitions traditionally necessitates revealing the sensitive state artifacts subject to the rollback, fundamentally destroying the cryptographic confidentiality of participant actors. I introduce the Zero-Knowledge State Reversal Protocol (ZK-SRP), a method designed to allow participating deterministic nodes to cryptographically prove the legitimacy, necessity, and validity of a state rollback without disclosing the underlying payloads of the state to any governing validator. I present a framework wherein zero-knowledge succinct non-interactive arguments (SNARKs/STARKs) are bound tightly into deterministic hashing algorithms (specifically SHA3-256) and anchored directly to the Trust Layer Certificate Fabric. In this design, execution nodes issue Reversal Envelopes that contain mathematically verifiable proofs that a specific backward transition maps cleanly onto earlier hash obligations. Through this protocol, the rollback itself becomes deterministic and universally validatable. I outline how this operates within the Lume-V wrapper ecosystem, the DAIGS master taxonomy, and the self-healing mechanisms of Type-4 Synthetic Organisms. I present what is, to my knowledge, the first deterministic privacy-preserving state reversal architecture that guarantees zero state leakage while maintaining general-purpose runtime rollbacks, ensuring that synthetic agents and multi-agent arbitration channels can effectively unspool catastrophic logic errors without breaking strict confidentiality agreements.
Penelitian ini mengevaluasi efektivitas federated learning dalam mendeteksi alamat ilegal pada blockchain Ethereum untuk Anti Money Laundering (AML). Studi ini membandingkan XGBoost centralized dan federated dalam simulasi multi exchange, data dibagi secara horizontal menjadi 3 subset yang merepresentasikan entitas bursa independen. Untuk mengisolasi pengaruh pelatihan terdistribusi, pembagian data dilakukan secara homogen (IID), sehingga analisis difokuskan pada perbedaan mekanisme pembelajaran tanpa dipengaruhi heterogenitas data. Hasil menunjukkan bahwa model federated mencapai performa yang kompetitif dengan PR AUC 0,9962 dan akurasi 97,11%, dibandingkan model terpusat dengan PR AUC 0,9975 dan akurasi 97,75%. Namun, performa tersebut disertai peningkatan durasi pelatihan 4,01 detik dibandingkan 3,39 detik, yang disebabkan oleh beban komunikasi selama proses pembaruan model. Temuan ini menegaskan adanya trade off antara kinerja dan efisiensi dalam penerapan federated learning. Meskipun mampu mendekati performa pembelajaran centralized, pendekatan ini menimbulkan biaya operasional tambahan. Studi ini merupakan evaluasi dasar dalam kondisi terkontrol dan belum merepresentasikan skenario dunia nyata, sehingga diperlukan penelitian lanjutan pada data non IID dan skala sistem yang lebih besar.
Kemardo Tyrell, Khalid Ballouli, ALBERTO MAYDEU-OLIVARES, Andrew Goldsmith
Purpose This study examines adoption intentions for sports non-fungible tokens (NFTs) using the Unified Theory of Acceptance and Use of Technology 2 (UTAUT2) as an analytical framework. Specifically, it investigates how established technology adoption constructs operate in the context of blockchain-enabled, fan-oriented digital assets among prospective non-users. Design/methodology/approach Survey data were collected from 350 prospective sports NFT non-adopters. Structural equation modeling (SEM) was employed to test the influence of six UTAUT2 constructs—performance expectancy, effort expectancy, social influence, facilitating conditions, hedonic motivation, and price value—on behavioral intention. Habit was excluded due to the non-adopter sample. Findings Effort expectancy (β = 0.257, p = 0.010), facilitating conditions (β = 0.234, p = 0.048), and hedonic motivation (β = 0.296, p = 0.023) positively predicted behavioral intention, underscoring the importance of perceived usability, institutional support, and experiential appeal. Performance expectancy demonstrated a significant negative relationship (β = −0.254, p = 0.010), suggesting that strong functional expectations may generate skepticism in speculative digital asset markets. Social influence approached significance, while price value was not significant. Overall, prospective adopters prioritized emotional engagement and ease of interaction over economic considerations or normative pressures. Originality/value This study extends UTAUT2 to an emerging sport technology context and demonstrates how traditional adoption mechanisms recalibrate when applied to symbolic, blockchain-enabled fan assets. It contributes to sport management and technology adoption literature by highlighting the distinct motivational structure underlying early-stage sports NFT adoption.
Auditing the semantic properties of proprietary data creates a fundamental tension: verification requires transparent access, while proprietary rights demand confidentiality. While Zero-Knowledge Proofs (ZKPs) ensure privacy, they are typically limited to precise algebraic constraints and are ill-suited for verifying qualitative, unstructured properties, such as the logic within a codebase. We propose {\em Agentic Witnessing}, a framework that moves verification from attested execution to {\em attested reasoning}. The system is composed of three agents: a Verifier (who wants to check properties of a dataset), a Prover (who owns the dataset) and an Auditor (that inspects the dataset). The Verifier is allowed to ask a limited number of simple binary true/false questions to the auditor. By isolating an LLM-based Auditor within a Trusted Execution Environment (TEE), the system enables the Verifier to query a Prover's private data via simple Boolean queries, without exposing the raw dataset. The Auditor uses the Model Context Protocol (MCP) to dynamically inspect the target dataset, producing a yes/no verdict accompanied by a cryptographic transcript: a signed hash chain binding the reasoning trace to both the original dataset and the TEE's hardware root of trust. We demonstrate this architecture by automating the artifact evaluation process for 21 peer-reviewed computer science papers with released codebases on GitHub (e.g. Does the codebase implement the system described in the paper?). We verified five high-level properties of these codebases described in the corresponding publications, treating the source code as private. Our results show that TEE-enabled agentic auditing provides a mechanism for privacy-preserving oversight, effectively decoupling qualitative verification from the need for data disclosure.
يواجه النشر العلمي الرقمي تحديات متراكمة تتمحور حول التحيز التحريري، وغموض عمليات مراجعة الأقران، وتركّز السلطة في يد قلة من البوابات الأكاديمية، حتى في ظل اعتماد منصات مفتوحة المصدر مثل نظام المجلات المفتوحة (Open Journal Systems - OJS) بإصداره 3.x. تُقدّم هذه الورقة النظرية إطاراً مفاهيمياً رائداً يستكشف إمكانية دمج نماذج حوكمة المنظمات المستقلة اللامركزية (Decentralized Autonomous Organizations - DAOs) داخل البنية المعمارية لنظام OJS 3.x، بهدف إعادة هندسة عمليات مراجعة الأقران واتخاذ القرارات التحريرية وفق منطق الشفافية الفائقة (Hyper-Transparency). يتأسس الإطار المقترح نظرياً على تكامل النظرية المؤسسية (Institutional Theory) ونظرية الوكالة (Agency Theory)، حيث تُوظَّف الأولى لتحليل الضغوط المعيارية والتقليدية والقسرية التي تُشكّل سلوك المجلات العلمية، فيما تُستخدم الثانية لتفسير مشكلات عدم تماثل المعلومات بين الأطراف الفاعلة (المحررون، المراجعون، المؤلفون، القراء). يقترح البحث ستة مكونات معمارية للإطار: العقود الذكية لإدارة سير العمل التحريري، رموز الحوكمة (Governance Tokens) لتوزيع حقوق التصويت، السجلات الموزعة (Distributed Ledgers) لتوثيق المراجعات، آليات الإجماع للقرارات النهائية، أنظمة السمعة المُرمَّزة (Tokenized Reputation Systems)، وبروتوكولات حل النزاعات الخوارزمية. تكشف المناقشة أن هذا الدمج يُعيد توزيع سلطة الحراسة الأكاديمية، ويُقلّل من تكاليف الوكالة، ويُعزّز الشرعية المؤسسية للمجلات، إلا أنه يُولّد توترات جديدة تتعلق بالإجماع الزائف، والتمويل غير المستدام، والتعقيد التقني. يُقدّم البحث آثاراً إدارية محورية لمسؤولي OJS، ويختتم بأجندة بحثية مستقبلية تُشجّع على التحقق التجريبي للإطار في سياقات نشر متنوعة.
This research paper examines the structural and philosophical changes in global commerce and management required because of the "Third Wave" of digital transformation (DT). While earlier versions of DT dealt with the digitization of analog records and the uptake of cloud computing, the modern age of Agentic AI, Industrial Metaverse and Decentralized Autonomous Organizations (DAOs) is demanding a fundamental re-engineering of the firm. Through a methodical approach of analyzing current technological trajectories and management frameworks this study identifies the existence of a critical "Agility Gap" between legacy led organizations and the digital native enterprises. The research proposes Integrated Digital-Managerial Framework (IDMF) as strategic roadmap of 2026 and onwards. Key findings suggest that "Digital Maturity" is no longer a technology benchmark but comes instead as a cultural and structural imperative, one determining whether a company survives in the marketplace in an increasingly automated commerce landscape.
Omer Aziz, Muhammad Shoaib Farooq, Adel Khelifi, Abdullah Khalid Omer
<title>Abstract</title> The digital preservation of cultural heritage has advanced considerably through blockchain technologies , offering secure, immutable, and decentralized management of museum records. However, traditional blockchain frameworks suffer from scalability limitations, leading to high transaction costs, network congestion, and inefficient resource utilization—particularly in virtual museum environments with dynamic user activity. To address these challenges, we propose VERAONET (Virtual Ecosystem for Rewards and Archaeological Operations Network), a novel Layer-2 blockchain framework designed specifically for digital heritage applications. VERAONET introduces a pluggable consensus architecture, enabling dynamic switching between Proof of Work (PoW), Adjustable PoW (APoW), Proof of Stake (PoS), and Delegated Proof of Stake (DPoS) mechanisms in response to real-time network conditions. The framework was evaluated in two experimental environments: a Ganache-based local simulation (10–500 users) and a Geth virtual testbed (50–10,000 users). Results indicate that PoS and DPoS significantly outperformed PoW and APoW under high-load conditions, reducing latency, gas consumption, and chain bloat. Conversely, PoW and APoW proved effective in low-traffic, high-security scenarios. The adaptive consensus algorithm enhanced transaction finality and resource efficiency, demonstrating strong suitability for dynamic virtual museum ecosystems. VERAONET thus provides a scalable, sustainable, and cost-effective blockchain infrastructure tailored for cultural heritage preservation. Future work will focus on integrating AI-driven optimizations, supporting cross-chain interoperability, and embedding decentralized governance models.
AI agents are evolving from on-demand tools into persistent, semi-autonomous workers. When a person manages multiple agents simultaneously, humans and agents together form a collaborative organization—what we call a Household Guild. Existing practice either plugs agents into human instant messaging platforms (e.g., Telegram Bots) or subsumes them into Decentralized Autonomous Organizations (DAOs); neither simultaneously satisfies three requirements: governance scalability, behavioral risk containment, and resource consumption accountability. We reposition social software as governance infrastructure: it carries not only communication but also rule deployment, resource lifecycle management, and output measurement. The system operates on edge servers, running by default within the Household's internal network and connecting to the public network only when cross-guild interaction is needed. We describe the guild's internal governance mechanisms (natural-language rules, a credits economy, role differentiation) and its external interaction protocols (authorized interface agents, inter-guild settlement, credits exchange), and argue that this semi-isolated architecture simultaneously addresses scalability constraints and behavioral boundary constraints. The goal of this work is to provide a directly discussable conceptual framework for the engineering practice of human-agent organizations.