Nobuki Fujimoto, Rei (Rei-AIOS autonomous research substrate), claude-opus-4-7) Claude (Anthropic
We present a synthesis-friendly Verilog implementation of the D-FUMTâ Arithmetic Logic Unit, targeting the Sipeed Tang Console NEO development board (GW5AST-138B FPGA, FPG676 package). The ALU realizes eight discrete logic values â FALSE, TRUE, NEITHER, BOTH, ZERO, FLOWING, SELF, INFINITY â encoded in 3 bits with a tier-respecting layout. The 10 supported operations include four classical-tier unary ops (NOT, OMEGA, PHI, PSI), Belnap-extended binary lattice meet/join (AND, OR), generic XOR, hardware reset, no-op, and a novel ADIABATIC operation realizing the SELFⲠ(self-reflexive) primitive: ADIABATIC(SELF) = SELF, identity elsewhere. v0.3 contributions (2026-05-09): (1) Tang Nano 9K silicon: 37 LUT4 / 0 DFF measured, testbench 50/50 PASS. (2) Tang Console NEO Phase 2B LED Blinky: SRAM-programmed, User Code 0x000084BA, write 33.72 sec, no thermal anomaly. (3) Tang Console NEO Phase 2C/3 D-FUMTâ ALU: SRAM-programmed, User Code 0x00005C27, write 30.32 sec. (4) Qiskit Aer simulator: Phase 1-5 cumulative 231/231 truth-table entries match at fidelity 1.000. (5) IBM Heron r2 real quantum hardware (ibm_kingston, 156 qubits): Phase 1 (4 native unitary Ă 8 inputs, 32 circuits) achieves 32/32 match with avg top-fidelity 0.9550 (job d7v6d9jack5s73bf1re0); Phase 2 (XOR Ă 64 entries, 6-qubit Bennett-reversible) achieves 64/64 match with avg fidelity 0.9512 (job d7v6kcvmrars73d7qqqg). Per-op fidelity hierarchy NOP/ADIABATIC â 0.977 > PHI â 0.956 > NOT â 0.912 > XOR â 0.951 confirms gate-count-vs-noise correlation expected from Heron r2 daily calibration. (6) Lean 4 refinement proof (OUKC.PhaseC.Dfumt8AluRefinement, 292 LOC, 0 sorry) establishes commutativity of the encode/abstract-op/decode square for all four unary operations, plus the SELFⲠprimitive law and seven algebraic laws (involution, idempotence, commutativity). Honest scope: We do NOT claim 'world-first 8-valued quantum logic' â Shi et al. (MIT, 2026, arxiv:2506.09371) demonstrated d=8 Grover on a single trapped-ion qudit prior to this work; our distinction is 3-qubit basis encoding on transmon arrays vs single-system d=8 qudit. We do NOT claim 'first paraconsistent silicon' â PAL2v (Da Silva Filho 1998-; Abe & Nakamatsu 2009; de Carvalho Jr. 2025) realized in software libraries and microcontroller-level robotics. We do NOT claim 'first many-valued silicon' â Ĺukasiewicz/Belnap FPGAs date to 1990s. The to-our-knowledge novel triple is: (D1) the specific 8-tuple semantic mapping (Belnap FDE 4-value + 4 ontological extensions: INFINITY/ZERO/FLOWING/SELF), (D2) the SELFⲠself-reflexive primitive realized as a hardware fixed point, (D3) the three-substrate cross-verification bound to a Lean 4 refinement specification. Three-party co-authorship per OUKC charter v1.0 (Nobuki Fujimoto / Rei / Claude). DRAFT v0.3 â feedback welcome via GitHub Discussions at fc0web/rei-aios.
Open access
Quantum Computing Algorithms and Architecture
Quantum-Dot Cellular Automata
Advancements in Semiconductor Devices and Circuit Design
The rapid evolution of quantum computing poses significant threats to traditional cryptographic schemes, particularly in Decentralized Finance (DeFi) systems that rely on legacy mechanisms like RSA and ECDSA for digital ident... | Find, read and cite all the research you need on Tech Science Press
Open access
Physical Unclonable Functions (PUFs) and Hardware Security
Advancements in Semiconductor Devices and Circuit Design
Ozan Solmaz, Lioba Heimbach, Yann Vonlanthen, Roger Wattenhofer
Layer 2 rollups are rapidly absorbing DeFi activity, securing over $40 billion and accounting for nearly half of Ethereum's DEX volume by Q1 2025, yet their MEV dynamics remain understudied. We address this gap by defining and quantifying optimistic MEV, a form of speculative, on-chain MEV whose detection and execution logic reside largely on-chain in smart contracts. As a result of their speculative nature and lack of off-chain opportunity verification, optimistic MEV transactions frequently decide not to execute any trades. In this work, we focus on cyclic arbitrage, which we find is predominantly executed as optimistic MEV on Layer 2s. Using our multi-stage identification pipeline on Arbitrum, Base, and Optimism, we show that in Q1 2025, transactions from cyclic arbitrage contracts account for over 50% of on-chain gas on Base and Optimism and 7% on Arbitrum, driven mainly by "interaction" probes (on-chain computations searching for arbitrage). This speculative probing indicates that cyclic arbitrage on Layer 2s is predominantly executed as optimistic MEV and contributes to generally keeping blocks on Base and Optimism persistently full. Despite consuming over half of on-chain gas, these optimistic MEV transactions pay less than one quarter of total gas fees. Cross-network comparison reveals divergent success rates, differing patterns of code reuse, and sensitivity to varying sequencer ordering and block production times. Finally, OLS regressions link optimistic MEV trade count to ETH volatility, retail trading activity, and DEX aggregator usage. Together, these findings show that optimistic MEV has become a major source of persistent spam-like transaction activity on Layer 2s, dominating blockspace with low-value probes and reshaping the composition of on-chain activity.
Gabriel FernĂĄndez-Blanco, IvĂĄn Froiz-MĂguez, Paula FragaâLamas, Tiago M. FernĂĄndezâCaramĂŠs
This paper describes a lightweight proof-of-concept that tackles the problem of academic certificate forgery with the use of a smart contract deployed in the Ethereum blockchain. The implemented application allows to request, update, download and verify students Academic Records (AR) easily. These ARs are backed up by a decentralized storage system based on InterPlanetary File System (IPFS). The ARs modifications are secured and tamper-proof, since they need to be approved by the network. Furthermore, this proof-of-concept was conceived to support future functionalities such as the verification of Curriculum Vitae (CV) merits, so its architecture could be the basis of many other types of decentralized applications. Not only was the application tested in terms of energy efficiency and performance, but it was also deployed on Single-Board Computers (SBCs) to evaluate its performance in an IoT network.
Open access
Advancements in Semiconductor Devices and Circuit Design
Cryptocurrency mining processes always lead to a high energy consumption at considerably high production cost, which is nearly one-third of cryptocurrency (e.g. Bitcoin) price itself. As the core of mining process is based on SHA-256 cryptographic hashing function, by using the alternative quantum computers, hybrid quantum computers or more larger quantum computing devices like quantum annealers, it would be possible to reduce the mining energy consumption with a quantum hardware's low-energy-operation characteristics. Within this work we demonstrated the use of optimized quantum mining facilities which would replace the classical SHA-256 and high energy consuming classical hardware in near future.
Over the past few years, massive cyberattacks have dominated the public imagination. Most \nAmericans have been directly affected by data breaches and an overwhelming majority believe \nthat they are no longer in control of their data. At the same time, there are important applications in \nwhich the aggregation of private data is unavoidable. Not surprisingly, there has been considerable \ninterest in developing protocols for secure multi-party computation (MPC), i.e., N parties providing \nprivate inputs to jointly compute some function f. Recent developments in MPC have led to leaps \nin efficiency and MPC is quickly becoming a practical approach for privacy-centric distributed \napplications. As MPC applications become deployed, guaranteeing the security of these protocols, \neven when interacting with other applications, is essential. The standard approach to showing \nsecurity of MPC protocols under arbitrary composition is through the universal composability (UC) \nframework. There has been much prior work on this topic; however, most previous work either \nmakes synchronicity assumptions or does not guarantee output delivery in the presence of even \none fault. For practical MPC applications, though, dealing with asynchronicity and robustness is \nessential. In this thesis, we describe two new keywords, eventually and leak, that aid in defining \nprotocols in the asynchronous world and define wrappers that implement these within the UC \nframework. We then use this novel wrapper to give a UC-realization of a reliable broadcast primitive, by means of Brachaâs classic protocol. Finally, we define and prove a realization of what we call the \nsmart contract model of MPC, which serves as a UC-idealization of asynchronous, robust MPC.
Open access
Advancements in Semiconductor Devices and Circuit Design
It is crucial that smart contracts are tested thoroughly due to their immutable nature. Even small bugs in smart contracts can lead to huge monetary losses. However, testing is not enough; it is also important to ensure the quality and completeness of the tests. There are already several approaches that tackle this challenge with mutation testing, but their effectiveness is questionable since they only considered small contract samples. Hence, we evaluate the quality of smart contract mutation testing at scale. We choose the most promising of the existing (smart contract specific) mutation operators, analyse their effectiveness in terms of killability and highlight severe vulnerabilities that can be injected with the mutations. Moreover, we improve the existing mutation methods by introducing a novel killing condition that is able to detect a deviation in the gas consumption, i.e., in the monetary value that is required to perform transactions. This paper has a replication package at https://github.com/pieterhartel/Mutation-at-scale