Ádám Bereczk, Zoltán Musinszki, Erika Szilágyiné Fülöp, Bettina Hódiné Hernádi
This study investigates the allocation of pre-sale capital by blockchain technology-based startup ventures, with a specific focus on the Play-to-Earn (P2E) segment within the Web3 ecosystem, and its impact on token price performance. Our aim is to determine the proportion of initial capital that P2E startups, according to their business plan (whitepaper), allocated to key areas such as team and advisor expenses, marketing activities, and product development. Subsequently, this research centers on the question of how the focal areas of pre-sale capital utilization (team, marketing, development) correlate with the subsequent price performance of the tokens issued by these startups. The timeliness and relevance of this topic are underscored by the dynamic evolution of blockchain technology and the P2E model, as well as the critical role of startups' capital allocation decisions. Understanding how the utilization of initial funding influences long-term value is also of paramount importance for investors. Based on the results, while excessive marketing expenditures may offer a project short-term benefits, this strategy can potentially have negative long-term consequences. A project's financial viability is contingent upon competent human resources and the insights of external experts; nevertheless, these elements alone are not definitively sufficient. The significance of product development was only evident when the effect was measured in Bitcoin terms; no correlation was found when measured in Dollars.
This work titled "RFID Based Campuswide Payment System" introduces an innovative cashless payment solution for educational institutions. It uses RFID cards and a Raspberry Pi to enable hassle free payments for various campus services, such as cafeteria purchases, tuition fees, and library fines. A centralized database ensures real-time updates on transactions and account balances, accessible through a simple and user-friendly web interface. This work is involved in designing a secure system with object-oriented principles, setting up databases, and integrating hardware like RFID readers with a Raspberry Pi. The systems are proved to be a cost-effective and efficient alternative to traditional payment methods, enhancing convenience and security for students and administrators. The study also explored similar RFID applications, like smart parking and attendance systems, to identify challenges and improvements. Looking ahead, it envisions features like wearable RFID devices, voice-activated payments, and blockchain integration to boost security and usability. Results show that this system simplifies campus payments and has the potential for broader adoption in similar environments.
Aditya Saraf, Ioannis Kaklamanis, Sarisht Wadhwa, Fatima Elsheimy
Censorship resistance is the defining advantage of blockchains over their centralized counterparts. Yet block proposers censor transactions for many reasons, from legal consequences to economic incentives. We study economically-incentivized censorship, modeled by an adversary who bribes proposers to exclude a target transaction, and define the economic censorship resistance (eCR) of a transaction as the adversary's expected cost of successful censorship divided by the user's expected payment for inclusion. Single-proposer systems are structurally weak by this measure: under a first-price auction the adversary need only match the user's bid, and fee burning pushes eCR to a few percent of what the user pays. We therefore turn to multiple concurrent proposers (MCP), where block capacity is divided among $n$ proposers and the block is the union of their sub-blocks. While MCP can substantially increase the cost of censorship by requiring the adversary to bribe many proposers, it also introduces transaction duplication, reducing throughput. The resulting trade-off depends critically on the transaction fee mechanism (TFM), which determines how fees are shared among competing proposers. We create a game theoretic model where validators construct blocks from a shared mempool, subject to an adversary's bribery attempt. We provide an algorithm that solves for the mixed equilibrium of a given mempool, which is characterized by the probability of including each transaction. This algorithm works for a wide class of TFMs, and allows us to calculate the expected throughput and censorship resistance for any bid distribution. We then use simulations to show how the eCR and throughput vary as the number of proposers increases. We compare three TFMs, finding that the duplication-penalizing TFM dominates the others across many settings. We also validate our findings with empirical Ethereum data.
Tahrim Hossain, Faisal Haque Bappy, Tarannum Shaila Zaman, Tariqul Islam
Blockchain platforms have grown into an ecosystem of independent networks, and a growing class of applications now requires smart contracts on separate chains to act as one. Such operations must be atomic, yet immutability makes this fundamentally harder: a confirmed transaction cannot be reversed, so the rollback on which classical atomic commitment protocols depend is unavailable. Two challenges follow. Contract state must be held across an operation whose outcome is not yet known, and each chain's execution outcome must be established even though no chain can observe another. In response, we introduce a framework that achieves atomicity through forward-only correction, resolving incomplete operations with new on-chain transactions rather than reversal. The framework bounds how long contract state is held and confines contention to the state an operation touches, and it establishes outcomes from an on-chain record of what each chain executed, without relying on any single coordinating party. This work lays the foundation for atomic coordination of general smart contract operations across heterogeneous blockchains.
Personalized gene editing demands robust mechanisms for privacy, ethical governance, and verifiable data integrity. This paper proposes ViBioChain, a modular blockchain-anchored architecture integrating five components: (1) differential chain-of-custody audit combining quantum fingerprinting with post-quantum signatures for immutable genomic audit trails; (2) proof-of-bioethical-compliance employing zero-knowledge proofs and AI-based ontology evaluation for automated bioethical gating; (3) federated genomic trust mesh (FGTM) enabling privacy-preserving collaborative model training with Renyi differential privacy accounting and trust-weighted federated aggregation; (4) ethical smart orchestration network for modular smart-contract-based workflow governance; and (5) genomic impact estimator via ethical explainability graphs (GIE-EEG) for ancestry-aware, ethically constrained phenotypic forecasting. Afterexpert-driven reconciliation, the implementation was rerun using 800 simulated individuals per dataset, 120 binary loci, five institutional clients, five independent seeds (42-46), and a true trust-weighted federated logistic aggregation path for FGTM rather than the earlier centralized accuracy proxy. Across three genomic cohorts and three domain-comparable baselines, ViBioChain achieved 92.16% ethical violation interception, 100.00% audit trail accuracy, 99.47% workflow traceability, 0.9183 ethical score alignment, and the highest global model accuracy among the tested methods (74.36%). The formal Renyi differential privacy accountant remained within budget ([Formula: see text], [Formula: see text]); however, the conservative clean-versus-noisy update leakage proxy did not support the earlier lowest-empirical-leakage assertion. That claim has therefore been removed. Additional IID and non-IID experiments show that severe Dirichlet client heterogeneity ([Formula: see text]) reduced final accuracy by 1.70-4.10 percentage points relative to IID partitions. The revised results provide a more conservative and reproducible blueprint for secure, ethically governed, and explainable genomic medicine in multi-institutional settings.
Digital governance, operationalized by technologies such as blockchain and decentralized autonomous organizations (DAOs), constitutes a phenomenon that redefines fundamental philosophical concepts for collective life. This article undertakes a systematic philosophical analysis of this phenomenon, structured around foundational conceptual problems. We begin from four axes of inquiry: (1) the ontological problem of the nature of code-based entities; (2) the epistemic problem of trust and knowledge in algorithmic systems; (3) the normative problem of authority, legitimacy, and justice in automated governance; and (4) the logical problem of the limits of normative formalization. The analysis demonstrates that these problems materialize at the necessary intersection of philosophy with computer science, law, and economics. It concludes that digital governance is, in essence, a philosophical enterprise, whose responsible development demands prior conceptual clarity regarding the nature of collective agency, the foundations of trust, the embedding of values into code, and the structural limits of automating social normativity.
Open access
5 source records
Ethics and Social Impacts of AI
Neuroethics, Human Enhancement, Biomedical Innovations
Faisal Haque Bappy, Tahrim Hossain, Tarannum Shaila Zaman, Tariqul Islam
Cross-chain DAOs face unique security challenges that go beyond traditional single-chain vulnerabilities. This paper identifies and categorizes four critical attack vectors in cross-chain DAO governance: bribery attacks, token control exploits, human-computer interaction deceptions, and protocol vulnerabilities. We propose a comprehensive security framework with a multi-layered architecture that integrates cryptographic trust anchors, fraud-resistant consensus mechanisms, and decentralized validation techniques to address these threats. Our framework introduces novel components, including a Governance Kernel with on-chain rule verification, a Cross-Chain Trust Layer using threshold cryptography, and a Resilience Layer offering time-locked decision reversals and progressive dispute resolution. By establishing a structured set of countermeasures, this work lays the foundation for secure, transparent, and attack-resistant governance across diverse blockchain environments.
We present a case study on proof-driven software understanding of mature, security-critical infrastructure. While formal methods are traditionally applied during the design phase, we present our experience applying formal reasoning onto a mature industrial C++ codebase. We focus on a formal analysis of the core algorithm that implements the Stellar blockchain's SDEX order book. By combining large language models (LLMs), Prototype Verification System (PVS), and SeaHorn, we are able to prove core properties of the production codebase. Our approach also identified an inconsistency in documentation related to the reachability of an exception location. Most importantly, however, we produce artifacts that make it easy for code changes to be checked against established invariants. This work demonstrates how the strategic combination of theorem proving and model checking provides a path for delivering robust assurance to legacy systems.
Gonçalo Frutuoso, Diogo Rodrigues, Alexandre P. Francisco, Cátia Vaz
Verifying academic credentials remains difficult: records are held by individual institutions in proprietary systems, verification is slow and manual, and counterfeit qualifications are widespread. Blockchain-based registries have been proposed as a remedy, but existing systems tend to anchor certificate hashes without binding them to a verifiable identity, without an explicit mechanism to accredit issuing institutions, and without support for correcting or revoking credentials once issued. This paper investigates whether an infrastructure designed for regulated financial instruments can be repurposed to close these gaps. We present the design of a registry for identity-bound academic credentials that composes OnchainID self-sovereign identities (ERC-734/ERC-735) with the T-REX suite (ERC-3643): its trusted-issuer registry becomes an on-chain issuer-accreditation whitelist, and each certificate is represented as a signed, updatable claim bound to a student's identity and verifiable by any third party without a wallet, while sensitive fields are kept off-chain. We make explicit the tension between a transferable-security-token standard and non-transferable credentials, clarifying which of its guarantees carry over. We validate the design with a reference implementation covering the full certificate life cycle and evaluate it in terms of gas cost, scalability, latency, and security, quantifying the overhead relative to a hash-anchoring baseline.