# Blockchain

Blockchain is a distributed digital ledger that records transactions in cryptographically linked blocks and uses network validation and consensus rules.

This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles.

## Authenticating IoT Data on Ethereum after Pectra and Fusaka: A Cost Study of Signature Schemes, Batching and Anchoring for Agricultural Supply Chain Finance

DevFeed: [Authenticating IoT Data on Ethereum after Pectra and Fusaka: A Cost Study of Signature Schemes, Batching and Anchoring for Agricultural Supply Chain Finance](<https://devfeed.tech/articles/authenticating-iot-data-on-ethereum-after-pectra-and-fusaka-a-cost-study-of-signature-schemes-batching-and-anchoring-for-agricultural-supply-chain-finance-142969.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.23764>)

Author: Ming-Fong Sie, Jian-Hong Chen, Gwan-yen Lin, Yen-Shuo Chen, Shih-wei Liao

Published: 2026-11-19T05:00:00Z

Content type: comparison

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>), [arXiv: Distributed Computing](<https://devfeed.tech/sources/arxiv-distributed-computing.md>)

Topics: [Blockchain](<https://devfeed.tech/topics/blockchain.md>), [ECDSA](<https://devfeed.tech/topics/ecdsa.md>), [Internet of things](<https://devfeed.tech/topics/iot.md>), [Cryptography](<https://devfeed.tech/topics/cryptography.md>), [Finance](<https://devfeed.tech/topics/finance.md>)

Tags: [1-6](<https://devfeed.tech/tags/1-6.md>), [2](<https://devfeed.tech/tags/2.md>), [2025](<https://devfeed.tech/tags/2025.md>), [abstract](<https://devfeed.tech/tags/abstract.md>), [added](<https://devfeed.tech/tags/added.md>), [after](<https://devfeed.tech/tags/after.md>), [aggregate](<https://devfeed.tech/tags/aggregate.md>), [aggregation](<https://devfeed.tech/tags/aggregation.md>), [application](<https://devfeed.tech/tags/application.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [authentication](<https://devfeed.tech/tags/authentication.md>), [batching](<https://devfeed.tech/tags/batching.md>), [cost](<https://devfeed.tech/tags/cost.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [cs-dc](<https://devfeed.tech/tags/cs-dc.md>), [data](<https://devfeed.tech/tags/data.md>), [ethereum](<https://devfeed.tech/tags/ethereum.md>), [finance](<https://devfeed.tech/tags/finance.md>), [fusaka](<https://devfeed.tech/tags/fusaka.md>), [iot](<https://devfeed.tech/tags/iot.md>), [study](<https://devfeed.tech/tags/study.md>), [supply-chain](<https://devfeed.tech/tags/supply-chain.md>)

### AI overview

The study finds that batching and Merkle anchoring reduce ECDSA authentication costs sixfold, to 8,963 gas per record, while secp256k1 ECDSA remains the least costly authenticated option after Ethereum's Pectra and Fusaka upgrades. P-256 costs 1.6 times as much per record, the pseudonymous identity-based design 2.7 times, and BLS aggregation 3.9 times, largely because of on-chain hash-to-curve; a transaction fits up to 1,754 ECDSA-authenticated records versus 411 BLS-aggregated records. On a Raspberry Pi Zero 2 W, pairing-based signing takes 5.7 ms compared with 0.29 ms for ECDSA. The upgrades primarily affect feasibility rather than cost. Pairing-based schemes may suit applications needing their added properties, while the identity-based scheme introduces key escrow at the key generation centre. Results are from the abstract; it says the benchmark harness is released for reproducibility.

### Source excerpt

arXiv:2611.23764v1 Announce Type: cross Abstract: Blockchain-based supply chain finance can turn the sensor-recorded production history of smallholder farms into verifiable credit evidence, but only if every record is authenticated and anchored at a cost that scales to large device fleets. Ethereum's 2025 Pectra and Fusaka upgrades changed this cost landscape: they added precompiles for BLS12-381 and P-256, repriced calldata and MODEXP, and capped transaction gas at $2^{24}$. We organize the authentication and anchoring of IoT records into three trust levels, from posting a Merkle root through a trusted aggregator to verifying every device signature on-chain, and implement four replay-protected signature designs: ECDSA over secp256k1 and P-256, BLS aggregate signatures with on-chain hash-to-curve, and a pseudonymous identity-based signature with batch verification. Measured as signed transactions under the rules before and after both upgrades, the upgrades mainly changed which designs are feasible, not their cost. Batching and Merkle anchoring cut the cost of ECDSA authentication sixfold, to 8,963 gas per record, and secp256k1 ECDSA remains the cheapest authenticated design: P-256 costs 1.6 times as much, the identity-based design 2.7 times and BLS aggregation 3.9 times, dominated by on-chain hashing to the curve. One transaction carries at most 1,754 ECDSA-authenticated records but only 411 BLS-aggregated ones. On a Raspberry Pi Zero 2 W, pairing-based signing takes 5.7 ms against 0.29 ms for ECDSA. Pairing-based designs pay off only when the application needs their additional properties, and the identity-based design adds key escrow at the key generation centre. The benchmark harness is released for reproducibility.

## UAT-12643: Suspected North Korea-aligned actor blends blockchain resilience with targeted infostealing

DevFeed: [UAT-12643: Suspected North Korea-aligned actor blends blockchain resilience with targeted infostealing](<https://devfeed.tech/articles/uat-12643-suspected-north-korea-aligned-actor-blends-blockchain-resilience-with-targeted-infostealing-140953.md>)

Original publisher: [Read original article](<https://blog.talosintelligence.com/uat-12643-suspected-north-korea-aligned-actor-blends-blockchain-resilience-with-targeted-infostealing/>)

Author: Chetan Raghuprasad

Published: 2026-11-18T11:00:00Z

Content type: news

Language: en

Sources: [Cisco Talos Blog](<https://devfeed.tech/sources/cisco-talos-blog.md>)

Topics: [Blockchain](<https://devfeed.tech/topics/blockchain.md>), [Solana](<https://devfeed.tech/topics/solana.md>), [Cisco Talos](<https://devfeed.tech/topics/cisco-talos.md>), [Cryptocurrency](<https://devfeed.tech/topics/cryptocurrency.md>), [Discord](<https://devfeed.tech/topics/discord.md>), [Aeternum](<https://devfeed.tech/topics/aeternum.md>)

Tags: [actor](<https://devfeed.tech/tags/actor.md>), [advanced-persistent-threat](<https://devfeed.tech/tags/advanced-persistent-threat.md>), [blockchain](<https://devfeed.tech/tags/blockchain.md>), [blockchain-c2](<https://devfeed.tech/tags/blockchain-c2.md>), [blockchain-transaction](<https://devfeed.tech/tags/blockchain-transaction.md>), [cisco](<https://devfeed.tech/tags/cisco.md>), [cisco-talos](<https://devfeed.tech/tags/cisco-talos.md>), [cisco-talos-antivirus](<https://devfeed.tech/tags/cisco-talos-antivirus.md>), [cisco-talos-dns-security](<https://devfeed.tech/tags/cisco-talos-dns-security.md>), [cisco-talos-malware-protection](<https://devfeed.tech/tags/cisco-talos-malware-protection.md>), [cisco-talos-network-intrusion-prevention](<https://devfeed.tech/tags/cisco-talos-network-intrusion-prevention.md>), [infrastructure](<https://devfeed.tech/tags/infrastructure.md>), [korea](<https://devfeed.tech/tags/korea.md>), [north](<https://devfeed.tech/tags/north.md>), [north-korea](<https://devfeed.tech/tags/north-korea.md>), [rat](<https://devfeed.tech/tags/rat.md>), [resilience](<https://devfeed.tech/tags/resilience.md>), [stealer](<https://devfeed.tech/tags/stealer.md>), [threat](<https://devfeed.tech/tags/threat.md>), [threat-spotlight](<https://devfeed.tech/tags/threat-spotlight.md>), [uat](<https://devfeed.tech/tags/uat.md>)

### AI overview

Cisco Talos describes UAT-12643 as a financially motivated actor whose campaign appears to target cryptocurrency holders, gamers, VoIP users, and possibly finance staff. Talos assesses a North Korea link with low confidence. The arsenal includes the Go-based Overlord RAT, the Python Good Game infostealer, and a clipboard hijacker. Initial access uses weaponized Windows shortcuts, HTA files, and MSBuild XML; delivery to victims was not observed. Overlord can discover updated command-and-control URLs through encrypted Solana transaction memos, establish registry and Windows Recovery Environment persistence, and trigger a system crash if forcibly terminated. Good Game steals browser, Discord, Roblox, wallet, gaming, and selected personal-file data, then uploads an archive to GoFile and alerts operators through a Discord webhook. The clipboard hijacker replaces recognized cryptocurrency addresses with attacker-controlled ones. The excerpt also lists ClamAV signatures and Snort rules for detection.

### Source excerpt

Cisco Talos discovered malicious infrastructure associated with a financially motivated threat group we are tracking as UAT-12643.

## Court clears brothers of $25 million Ethereum crypto heist charges

DevFeed: [Court clears brothers of $25 million Ethereum crypto heist charges](<https://devfeed.tech/articles/court-clears-brothers-of-25-million-ethereum-crypto-heist-charges-136881.md>)

Original publisher: [Read original article](<https://www.bleepingcomputer.com/news/security/court-clears-brothers-of-25-million-ethereum-crypto-heist-charges/>)

Author: Sergiu Gatlan

Published: 2026-11-17T09:44:22Z

Content type: news

Language: en

Sources: [BleepingComputer](<https://devfeed.tech/sources/bleepingcomputer.md>)

Topics: [Ethereum](<https://devfeed.tech/topics/ethereum.md>), [Cryptocurrency](<https://devfeed.tech/topics/cryptocurrency.md>), [Blockchain](<https://devfeed.tech/topics/blockchain.md>), [Cybercrime](<https://devfeed.tech/topics/cybercrime.md>)

Tags: [2022](<https://devfeed.tech/tags/2022.md>), [adaptive](<https://devfeed.tech/tags/adaptive.md>), [agents](<https://devfeed.tech/tags/agents.md>), [ai](<https://devfeed.tech/tags/ai.md>), [ai-agents](<https://devfeed.tech/tags/ai-agents.md>), [analyze](<https://devfeed.tech/tags/analyze.md>), [arrested](<https://devfeed.tech/tags/arrested.md>), [assets](<https://devfeed.tech/tags/assets.md>), [blockchain](<https://devfeed.tech/tags/blockchain.md>), [bug](<https://devfeed.tech/tags/bug.md>), [charges](<https://devfeed.tech/tags/charges.md>), [computer-help](<https://devfeed.tech/tags/computer-help.md>), [computer-security](<https://devfeed.tech/tags/computer-security.md>), [computers](<https://devfeed.tech/tags/computers.md>), [court](<https://devfeed.tech/tags/court.md>), [crypto](<https://devfeed.tech/tags/crypto.md>), [crypto-heist](<https://devfeed.tech/tags/crypto-heist.md>), [cryptochameleon](<https://devfeed.tech/tags/cryptochameleon.md>), [cryptocurrency](<https://devfeed.tech/tags/cryptocurrency.md>), [ethereum](<https://devfeed.tech/tags/ethereum.md>), [exploited](<https://devfeed.tech/tags/exploited.md>), [heist](<https://devfeed.tech/tags/heist.md>), [infosec](<https://devfeed.tech/tags/infosec.md>), [infosec-computer-security](<https://devfeed.tech/tags/infosec-computer-security.md>), [linux](<https://devfeed.tech/tags/linux.md>), [mac](<https://devfeed.tech/tags/mac.md>), [malware](<https://devfeed.tech/tags/malware.md>), [malware-removal](<https://devfeed.tech/tags/malware-removal.md>), [mit](<https://devfeed.tech/tags/mit.md>), [scheme](<https://devfeed.tech/tags/scheme.md>), [security](<https://devfeed.tech/tags/security.md>), [spyware](<https://devfeed.tech/tags/spyware.md>), [support](<https://devfeed.tech/tags/support.md>), [tech-support](<https://devfeed.tech/tags/tech-support.md>), [technical-support](<https://devfeed.tech/tags/technical-support.md>), [us](<https://devfeed.tech/tags/us.md>), [usa](<https://devfeed.tech/tags/usa.md>), [virus](<https://devfeed.tech/tags/virus.md>), [virus-removal](<https://devfeed.tech/tags/virus-removal.md>), [windows](<https://devfeed.tech/tags/windows.md>)

### AI overview

A federal judge acquitted Anton and James Peraire-Bueno of wire fraud and related charges over an alleged $25 million Ethereum exploit, ruling that prosecutors had not proved material misrepresentations needed to support the convictions. The ruling followed a mistrial in which jurors could not agree. Prosecutors alleged the brothers exploited a vulnerability in MEV-Boost relay code to expose pending transactions, reorder a proposed block, and take cryptocurrency from traders, then moved funds through multiple transactions to obscure their source and ownership. The excerpt reports the acquittal and allegations; it does not establish that the alleged conduct occurred.

### Source excerpt

US District Judge Jessica Clarke has acquitted two brothers accused of stealing $25 million in cryptocurrency in about 12 seconds through a scheme that exploited a bug in the Ethereum blockchain. [...]

## Baryonic Keys and the Inheritance of Crypto-Assets: Revisiting the Tales From the Crypt Protocol

DevFeed: [Baryonic Keys and the Inheritance of Crypto-Assets: Revisiting the Tales From the Crypt Protocol](<https://devfeed.tech/articles/baryonic-keys-and-the-inheritance-of-crypto-assets-revisiting-the-tales-from-the-crypt-protocol-139311.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.20782>)

Author: Fr\\'ed\\'eric Prost

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>)

Topics: [Cryptography](<https://devfeed.tech/topics/cryptography.md>), [Blockchain](<https://devfeed.tech/topics/blockchain.md>), [blockchain consensus protocol](<https://devfeed.tech/topics/blockchain-consensus-protocol.md>)

Tags: [abstract](<https://devfeed.tech/tags/abstract.md>), [account](<https://devfeed.tech/tags/account.md>), [alarm](<https://devfeed.tech/tags/alarm.md>), [anonymity](<https://devfeed.tech/tags/anonymity.md>), [assets](<https://devfeed.tech/tags/assets.md>), [attack](<https://devfeed.tech/tags/attack.md>), [attacks](<https://devfeed.tech/tags/attacks.md>), [bits](<https://devfeed.tech/tags/bits.md>), [blockchain](<https://devfeed.tech/tags/blockchain.md>), [blocks](<https://devfeed.tech/tags/blocks.md>), [candidate](<https://devfeed.tech/tags/candidate.md>), [censorship](<https://devfeed.tech/tags/censorship.md>), [coins](<https://devfeed.tech/tags/coins.md>), [copy](<https://devfeed.tech/tags/copy.md>), [crypto](<https://devfeed.tech/tags/crypto.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [death](<https://devfeed.tech/tags/death.md>), [define](<https://devfeed.tech/tags/define.md>), [inheritance](<https://devfeed.tech/tags/inheritance.md>), [keys](<https://devfeed.tech/tags/keys.md>), [protocol](<https://devfeed.tech/tags/protocol.md>)

### AI overview

The paper proposes TFCP-B for crypto-asset inheritance, combining a secret shared among registrars with a physical "baryonic key" response to decrypt a will; heirs claim shares using hash commitments without needing a prior key or wallet. The key is defined as a physical object that yields bits through measurement, keeps them out of digital storage, and exists in a finite, specified number of copies. A candidate uses replicated micro-fractured reliefs, but digitising a copy is described as slow and tamper-evident rather than impossible. TFCP-B addresses anonymity loss from colluding registrars and several false-alarm attacks, but leaves shallow-account attacks and transaction censorship during deliberation unresolved. It also relies on assumptions about custodians and reading devices. The authors characterize their security arguments as informal and physical estimates as design estimates.

### Source excerpt

arXiv:2611.20782v1 Announce Type: new Abstract: The inheritance of crypto-assets faces a structural obstacle: ownership is the knowledge of a key, so the key either disappears with its owner or has to be shared beforehand. The Tales From the Crypt Protocol (TFCP) addressed one part of the problem, the distributed and privacy-preserving acknowledgment of a death by a blockchain. We revisit it with a new primitive. A \emph{baryonic key} is a physical object from which bits are obtained only through a measurement, are never stored digitally, and which exists in exactly $n$ copies, where $n$ is neither zero nor unbounded. We define the primitive, outline a candidate instantiation based on a replicated micro-fractured relief, and state its limits: digitising a copy is slow and tamper-evident, not impossible. We also outline other uses of the primitive, from post-quantum pre-shared keys to common coins for Byzantine agreement. We then give a threat model for TFCP, review the attack models of the literature that apply to it, and show where it resists and where it does not. We propose TFCP-B, in which decrypting the will requires both a secret shared among registrars and the response of a baryonic key, and in which heirs claim their share through hash commitments, without any prior key or wallet. We detail each change from TFCP to TFCP-B, with its rationale and its price. TFCP-B removes the anonymity loss caused by colluding registrars and blocks several false-alarm attacks. It does not remove the shallow-account attack, remains exposed to transaction censorship during the deliberation period, and introduces new assumptions on custodians and reading devices. The security arguments are informal and the physical figures are design estimates.

## iGRAIL: Blockchain-Based Generative Federated Learning for Trustworthy Healthcare Intelligence

DevFeed: [iGRAIL: Blockchain-Based Generative Federated Learning for Trustworthy Healthcare Intelligence](<https://devfeed.tech/articles/igrail-blockchain-based-generative-federated-learning-for-trustworthy-healthcare-intelligence-136034.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.17703>)

Author: Debashis Das, Sourav Banerjee, Saraju P. Mohanty

Published: 2026-11-16T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>)

Topics: [Federated Learning](<https://devfeed.tech/topics/federated-learning.md>), [Blockchain](<https://devfeed.tech/topics/blockchain.md>), [data augmentation](<https://devfeed.tech/topics/data-augmentation.md>), [Cryptography](<https://devfeed.tech/topics/cryptography.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [ai security](<https://devfeed.tech/topics/ai-security.md>), [smart contract](<https://devfeed.tech/topics/smart-contract.md>)

Tags: [access-control](<https://devfeed.tech/tags/access-control.md>), [analytics](<https://devfeed.tech/tags/analytics.md>), [blockchain](<https://devfeed.tech/tags/blockchain.md>), [cryptographic](<https://devfeed.tech/tags/cryptographic.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [data-augmentation](<https://devfeed.tech/tags/data-augmentation.md>), [differential-privacy](<https://devfeed.tech/tags/differential-privacy.md>), [distributed](<https://devfeed.tech/tags/distributed.md>), [federated-learning](<https://devfeed.tech/tags/federated-learning.md>), [framework](<https://devfeed.tech/tags/framework.md>), [healthcare](<https://devfeed.tech/tags/healthcare.md>), [integrity](<https://devfeed.tech/tags/integrity.md>), [malicious](<https://devfeed.tech/tags/malicious.md>), [malicious-update](<https://devfeed.tech/tags/malicious-update.md>), [model](<https://devfeed.tech/tags/model.md>), [patient-data](<https://devfeed.tech/tags/patient-data.md>), [patient-records](<https://devfeed.tech/tags/patient-records.md>), [performance](<https://devfeed.tech/tags/performance.md>), [prediction](<https://devfeed.tech/tags/prediction.md>), [privacy](<https://devfeed.tech/tags/privacy.md>), [privacy-security](<https://devfeed.tech/tags/privacy-security.md>)

### AI overview

iGRAIL combines local generative data augmentation and differential privacy with cryptographic communication, blockchain verification, and smart-contract access control to protect federated healthcare model updates. Across four healthcare datasets, it was compared with conventional federated learning and blockchain-based FL. On two large diabetes datasets, it reportedly improved accuracy by about 5.4-5.6%, F1 by 14.6-16.9%, and MCC by 16.0-18.1% over the best baseline. Stronger differential privacy reduced the privacy-loss parameter ε by about 72.5% on cancer and 87.5% on diabetes, with limited predictive-performance loss. The abstract reports added computational overhead; it does not provide implementation details or enough results to assess the full scalability claims.

### Source excerpt

arXiv:2611.17703v1 Announce Type: new Abstract: Healthcare organizations collect huge amounts of patient data from clinical records, medical tests, monitoring systems, and healthcare services. Such data can underpin intelligent healthcare analytics but remains distributed across institutions and cannot be shared directly due to privacy, security, and trust concerns. Federated learning (FL) enables collaborative learning without sharing raw patient records, but the exchanged model information remains vulnerable to privacy leakage, tampering, replay, and unauthorized access. In this paper, we propose iGRAIL, a blockchain-enabled generative FL framework for trustworthy healthcare intelligence. iGRAIL combines local generative learning for data augmentation with differential privacy to protect sensitive information during local training. Model communication is secured using cryptographic mechanisms, and blockchain-based verification and smart-contract access control ensure that only authorized, authentic, fresh, and integrity-preserving updates are accepted for federated aggregation. The framework is evaluated on four healthcare datasets and compared with the conventional FL and blockchain-based FL (BC-FL) under predictive, privacy, non-IID, scalability, malicious-update, security-verification, and runtime settings. For the two large diabetes datasets, iGRAIL improves accuracy by about 5.4-5.6%, the F1-score by 14.6-16.9%, and MCC by 16.0-18.1% over the best FL or BC-FL baseline. Increasing the strength of differential privacy reduces the privacy-loss parameter $\epsilon$ by about 72.5% for the cancer dataset and 87.5% for the diabetes dataset, with only a limited loss in prediction performance. These results indicate that iGRAIL supports secure and scalable federated computing while preserving privacy, model integrity, and controlled participation, at the cost of additional computational overhead.

## Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus

DevFeed: [Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus](<https://devfeed.tech/articles/duet-co-optimizing-p2p-message-propagation-and-rotating-leader-consensus-131514.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2607.22209>)

Author: Yifeng Ye, Rongji Huang, Gerui Wang, Mingchao Wan, Yuxing Duan, Jingjing Zhang, Shengyun Liu

Published: 2026-11-13T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Distributed Computing](<https://devfeed.tech/sources/arxiv-distributed-computing.md>)

Topics: [P2P](<https://devfeed.tech/topics/p2p.md>), [consensus algorithm](<https://devfeed.tech/topics/consensus-algorithm.md>), [Blockchain](<https://devfeed.tech/topics/blockchain.md>), [performance-engineering](<https://devfeed.tech/topics/performance-engineering.md>)

Tags: [amazon-ec2](<https://devfeed.tech/tags/amazon-ec2.md>), [blockchain](<https://devfeed.tech/tags/blockchain.md>), [broadcast](<https://devfeed.tech/tags/broadcast.md>), [consensus](<https://devfeed.tech/tags/consensus.md>), [cs-dc](<https://devfeed.tech/tags/cs-dc.md>), [evaluation](<https://devfeed.tech/tags/evaluation.md>), [latency](<https://devfeed.tech/tags/latency.md>), [leader](<https://devfeed.tech/tags/leader.md>), [libp2p](<https://devfeed.tech/tags/libp2p.md>), [message](<https://devfeed.tech/tags/message.md>), [network](<https://devfeed.tech/tags/network.md>), [nodes](<https://devfeed.tech/tags/nodes.md>), [optimizing](<https://devfeed.tech/tags/optimizing.md>), [p2p](<https://devfeed.tech/tags/p2p.md>), [regions](<https://devfeed.tech/tags/regions.md>), [state-machine](<https://devfeed.tech/tags/state-machine.md>), [throughput](<https://devfeed.tech/tags/throughput.md>), [topology](<https://devfeed.tech/tags/topology.md>), [trees](<https://devfeed.tech/tags/trees.md>)

### AI overview

Duet co-optimizes rotating-leader consensus and P2P message delivery by using blockchain's state-machine abstraction to record network topology and latency in a trusted, coordinated way. It combines faster leader rotation, reliable broadcast that normally uses tree dissemination and falls back to gossip when needed, and latency-aware dissemination trees. The prototype integrates with Tendermint and libp2p and was evaluated on Amazon EC2 with up to 300 nodes across 10 regions. Against gossip-based dissemination over the same topology, it reports up to 7.26x higher peak throughput.

### Source excerpt

arXiv:2607.22209v2 Announce Type: replace Abstract: In blockchain systems, peer-to-peer (P2P) overlay networks play a crucial role in providing reliable, scalable and efficient message-delivery services to upper layers. However, the consensus layer and the underlying P2P network remain mutually opaque in existing blockchains, waiving the opportunity for further improvement. In contrast to other P2P applications, blockchain can naturally be abstracted as a state machine. We therefore leverage this abstraction to record network topologies and latencies in a trusted and coordinated manner. With this support, we propose three improvements to rotating-leader consensus protocols and their underlying P2P networks: (1) accelerating leader rotation; (2) introducing a reliable-broadcast paradigm that employs tree-based dissemination in the normal case and falls back to gossip only when necessary; and (3) constructing latency-aware dissemination trees. We integrate the above ideas into Tendermint and libp2p, and conduct empirical evaluation on Amazon EC2 platform using up to 300 nodes distributed across 10 regions. The results demonstrate that, compared with gossip-based dissemination over the same topology, our prototype improves peak throughput by up to $7.26\times$.

## Omakase: Execution Congestion Control through Conflict-Graph Integration in Multi-Proposer Blockchain

DevFeed: [Omakase: Execution Congestion Control through Conflict-Graph Integration in Multi-Proposer Blockchain](<https://devfeed.tech/articles/omakase-execution-congestion-control-through-conflict-graph-integration-in-multi-proposer-blockchain-131554.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.17184>)

Author: Dakai Kang, Ray Neiheiser, Alberto Sonnino, Eleftherios Kokoris Kogias, Mohammad Sadoghi

Published: 2026-11-13T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Databases](<https://devfeed.tech/sources/arxiv-databases.md>), [arXiv: Distributed Computing](<https://devfeed.tech/sources/arxiv-distributed-computing.md>)

Topics: [Blockchain](<https://devfeed.tech/topics/blockchain.md>), [Distributed Systems & Parallel Computing](<https://devfeed.tech/topics/distributed-systems-parallel-computing.md>), [Parallelism](<https://devfeed.tech/topics/parallelism.md>), [graph theory](<https://devfeed.tech/topics/graph-theory.md>), [scheduling](<https://devfeed.tech/topics/scheduling.md>), [Transactions](<https://devfeed.tech/topics/transactions.md>)

Tags: [blockchain](<https://devfeed.tech/tags/blockchain.md>), [concurrency-control](<https://devfeed.tech/tags/concurrency-control.md>), [congestion-control](<https://devfeed.tech/tags/congestion-control.md>), [consensus](<https://devfeed.tech/tags/consensus.md>), [cs-db](<https://devfeed.tech/tags/cs-db.md>), [cs-dc](<https://devfeed.tech/tags/cs-dc.md>), [dependencies](<https://devfeed.tech/tags/dependencies.md>), [ethereum](<https://devfeed.tech/tags/ethereum.md>), [execution](<https://devfeed.tech/tags/execution.md>), [graph](<https://devfeed.tech/tags/graph.md>), [integration](<https://devfeed.tech/tags/integration.md>), [optimistic-concurrency](<https://devfeed.tech/tags/optimistic-concurrency.md>), [order](<https://devfeed.tech/tags/order.md>), [parallel](<https://devfeed.tech/tags/parallel.md>), [parallelism](<https://devfeed.tech/tags/parallelism.md>), [pipeline](<https://devfeed.tech/tags/pipeline.md>), [prediction](<https://devfeed.tech/tags/prediction.md>), [protocols](<https://devfeed.tech/tags/protocols.md>), [scheduler](<https://devfeed.tech/tags/scheduler.md>), [stable](<https://devfeed.tech/tags/stable.md>), [state](<https://devfeed.tech/tags/state.md>), [synthetic](<https://devfeed.tech/tags/synthetic.md>)

### AI overview

Omakase targets execution bottlenecks in multi-proposer blockchains by integrating conflict graphs across blocks committed in a round. Replicas pre-execute only the blocks they propose; a greedy scheduler combines per-block graphs when a lightweight heuristic predicts more parallelism, and a graph-aware OCC executor admits transactions in dependency order. The authors report a 2.47x speedup over sequential execution on 15,000 Ethereum mainnet blocks (~2.4 million transactions) and synthetic workloads. Compared with running a whole round as one optimistic window, it matches mean throughput and is more stable under high contention; integration bounds optimistic work in flight. Integration has a cost, though overlapping it with execution across rounds hides 94% of its measured cost in the validator pipeline. These findings are reported in the supplied abstract.

### Source excerpt

arXiv:2611.17184v1 Announce Type: cross Abstract: As multi-proposer protocols push consensus throughput, transaction execution has become the dominant bottleneck in blockchains. Layer-1 blockchains parallelize execution either pessimistically (Solana, Sui), requiring upfront state-access declarations and serializing contended transactions, or optimistically (Aptos, Sei, Monad), resolving dependencies at run time but suffering cascading aborts under contention. Both treat blocks in isolation, leaving inter-block parallelism unexploited and most cores idle. We introduce Omakase, a parallel execution framework that combines pre-execution, inter-block conflict-graph integration, and graph-aware Optimistic Concurrency Control (OCC). Replicas use idle cores to pre-execute only the blocks they propose, spreading prediction work across concurrent proposers. After building per-block conflict graphs and identifying their hot resources, a greedy scheduler integrates graphs across the blocks committed in a round, keeping an integration only when a lightweight balance heuristic predicts a parallelism gain. A graph-aware OCC executor then runs the integrated graph, admitting transactions in dependency order, which eliminates aborts when the predicted graph is exact and reduces re-executions when it is not. On 15,000 Ethereum mainnet blocks (~2.4M transactions) and synthetic workloads with configurable contention, Omakase reaches a 2.47x speedup over sequential execution, well above single-block OCC and graph-aware baselines. Against the strongest alternative, which runs the whole round as one optimistic window, Omakase matches mean throughput but is markedly more stable under high contention, because integration bounds how much optimistic work is in flight: this is the congestion control of our title. Integration is not free, but overlapping it with execution across rounds hides 94% of its measured cost in the validator pipeline.

## Verifiable Settlement and Pricing for Local Energy Markets: Architecture and Deployment on Hyperledger Besu

DevFeed: [Verifiable Settlement and Pricing for Local Energy Markets: Architecture and Deployment on Hyperledger Besu](<https://devfeed.tech/articles/verifiable-settlement-and-pricing-for-local-energy-markets-architecture-and-deployment-on-hyperledger-besu-133326.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.16495>)

Author: Michele Fabi (CREST), Baptiste Leloup (ENSAE)

Published: 2026-11-13T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>)

Topics: [Blockchain](<https://devfeed.tech/topics/blockchain.md>), [Cryptography](<https://devfeed.tech/topics/cryptography.md>)

Tags: [architecture](<https://devfeed.tech/tags/architecture.md>), [blockchain](<https://devfeed.tech/tags/blockchain.md>), [circuits](<https://devfeed.tech/tags/circuits.md>), [consensus](<https://devfeed.tech/tags/consensus.md>), [costs](<https://devfeed.tech/tags/costs.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [cs-gt](<https://devfeed.tech/tags/cs-gt.md>), [deployment](<https://devfeed.tech/tags/deployment.md>), [energy](<https://devfeed.tech/tags/energy.md>), [markets](<https://devfeed.tech/tags/markets.md>), [payments](<https://devfeed.tech/tags/payments.md>), [pricing](<https://devfeed.tech/tags/pricing.md>), [privacy](<https://devfeed.tech/tags/privacy.md>), [proofs](<https://devfeed.tech/tags/proofs.md>), [q-fin-tr](<https://devfeed.tech/tags/q-fin-tr.md>), [settlement](<https://devfeed.tech/tags/settlement.md>), [smart-contracts](<https://devfeed.tech/tags/smart-contracts.md>), [trading](<https://devfeed.tech/tags/trading.md>)

### AI overview

The system keeps household electricity positions off-chain while publishing aggregate supply and demand to Hyperledger Besu, where smart contracts set prices every 15 minutes. Poseidon2 commitments and UltraHonk zero-knowledge proofs generated from Noir circuits verify aggregation, payments, and daily balance updates; signed receipts and member-triggered recourse address unverified or partial settlement. In a simulated ten-household experiment, daily settlement used about 19 million gas, and proofs for eight members took 2.4 seconds. Across four simulated days, local trading covered 34.4% of demand and reduced grid-only costs by 30.5% under the assumed tariffs. The reported equilibrium profiles captured 83-88% of social planner surplus.

### Source excerpt

arXiv:2611.16495v1 Announce Type: new Abstract: We implement privacy-preserving local electricity exchanges using an automated market maker on the Hyperledger Besu network under QBFT consensus. The proposed protocol operator collects individual electricity positions off-chain and publishes aggregate supply and demand on the blockchain, where smart contracts compute market prices every fifteen minutes. Individual positions remain off-chain; Poseidon2 commitments and UltraHonk zeroknowledge proofs, generated from Noir circuits, verify aggregation, payments, and daily balance updates. The architecture retains community coordination while making financial execution independently auditable. Signed receipts and member-triggered recourse prevent unverified or partial settlement. In a ten-household experiment using simulated US residential profiles, daily settlement uses approximately 19 million gas and produces eight-member proofs in 2.4 seconds. Over four simulated days, local trading covers 34.4% of demand and reduces grid-only costs by 30.5% under assumed tariffs. Numerically computed __-Nash Equilibrium electricity profiles capture 83-88% of the social planner surplus.

## Plurality Consensus for $h$-Majority via First-Repetition Rules

DevFeed: [Plurality Consensus for $h$-Majority via First-Repetition Rules](<https://devfeed.tech/articles/plurality-consensus-for-h-majority-via-first-repetition-rules-131540.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.16037>)

Author: Niccol\\\`o D'Archivio, George Giakkoupis, Fr\\'ed\\'eric Giroire, Emanuele Natale

Published: 2026-11-13T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Distributed Computing](<https://devfeed.tech/sources/arxiv-distributed-computing.md>)

Topics: [Algorithms](<https://devfeed.tech/topics/algorithms.md>), [Blockchain](<https://devfeed.tech/topics/blockchain.md>)

Tags: [2](<https://devfeed.tech/tags/2.md>), [3](<https://devfeed.tech/tags/3.md>), [abstract](<https://devfeed.tech/tags/abstract.md>), [after](<https://devfeed.tech/tags/after.md>), [agent](<https://devfeed.tech/tags/agent.md>), [agents](<https://devfeed.tech/tags/agents.md>), [all](<https://devfeed.tech/tags/all.md>), [analysis](<https://devfeed.tech/tags/analysis.md>), [apply](<https://devfeed.tech/tags/apply.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [bias](<https://devfeed.tech/tags/bias.md>), [black](<https://devfeed.tech/tags/black.md>), [black-box](<https://devfeed.tech/tags/black-box.md>), [box](<https://devfeed.tech/tags/box.md>), [comparison](<https://devfeed.tech/tags/comparison.md>), [concurrently](<https://devfeed.tech/tags/concurrently.md>), [condition](<https://devfeed.tech/tags/condition.md>), [consensus](<https://devfeed.tech/tags/consensus.md>), [cs-dc](<https://devfeed.tech/tags/cs-dc.md>), [cs-ds](<https://devfeed.tech/tags/cs-ds.md>), [first](<https://devfeed.tech/tags/first.md>), [rules](<https://devfeed.tech/tags/rules.md>)

### AI overview

For every h >= 3, the paper proves that h-Majority reaches consensus on the initially most frequent opinion within O((1 + n/(h²M₀)) log n) rounds with high probability, provided its initial lead Δ₀ is at least L√(M₀ log n) max{1, n/(h²M₀)}. This matches DejaVu's stated time bound, but requires a larger bias when h < √(n/M₀). The one-round analysis uses a comparison principle: plurality maximizes the lead over any fixed competitor among symmetric rules using the same observations. A first-repetition rule has the same output distribution as a random agent after one DejaVu round with h−1 samples, letting the authors use DejaVu's analysis as a black box. The abstract also reports concurrent work obtaining the time bound under DejaVu's weaker bias condition, with different one-round and martingale analyses.

### Source excerpt

arXiv:2611.16037v1 Announce Type: new Abstract: In the h-Majority dynamics, each of n agents holds one of k opinions and, in every synchronous round, observes the opinions of h agents chosen independently and uniformly at random and adopts a most frequent one among them, breaking ties uniformly at random. Let M_0 be the initial number of agents holding the most frequent opinion, and Delta_0 its bias, its lead over the second most frequent opinion. We show that, for every sample size h >= 3, if Delta_0 >= L sqrt(M_0 log n) max{1, n/(h^2 M_0)} for a sufficiently large constant L, then h-Majority reaches consensus on the initially most frequent opinion within O((1 + n/(h^2 M_0)) log n) rounds with high probability. This is the time bound proved for the DejaVu dynamics with h samples (arXiv:2604.03648); our bias condition is that of DejaVu when h >= sqrt(n/M_0), and larger by a factor sqrt(n/(h^2 M_0)) otherwise. Our main contribution, the analysis of one round, rests on a comparison principle: among all rules that read the same observations and treat opinions symmetrically, plurality maximizes the difference between the probability of outputting the most frequent opinion and that of outputting any fixed competitor. We apply it to the rule that adopts the first opinion repeated among h-1 observations, and otherwise the h-th observation: its output law is the law of the new opinion of a random agent after one round of DejaVu with h-1 samples. Hence, in expectation, one round of h-Majority widens the gap between the most frequent opinion and each competitor at least as much as that round of DejaVu, whose analysis we use as a black box. Independently and concurrently, d'Amore, Rybicki, Shimizu, Shiraga and Vacus (arXiv:2610.40562) obtained, among other results, the same time bound under the weaker bias condition of DejaVu, with a different analysis of one round and a martingale analysis over many rounds.

## SoK: Design Choices in Tendermint BFT Consensus

DevFeed: [SoK: Design Choices in Tendermint BFT Consensus](<https://devfeed.tech/articles/sok-design-choices-in-tendermint-bft-consensus-131536.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.15847>)

Author: Sanaz Taheri-Boshrooyeh, Yahya Hassanzadeh-Nazarabadi

Published: 2026-11-13T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>), [arXiv: Distributed Computing](<https://devfeed.tech/sources/arxiv-distributed-computing.md>)

Topics: [consensus algorithm](<https://devfeed.tech/topics/consensus-algorithm.md>), [Blockchain](<https://devfeed.tech/topics/blockchain.md>)

Tags: [bft-consensus](<https://devfeed.tech/tags/bft-consensus.md>), [consensus](<https://devfeed.tech/tags/consensus.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [cs-dc](<https://devfeed.tech/tags/cs-dc.md>), [design](<https://devfeed.tech/tags/design.md>), [performance](<https://devfeed.tech/tags/performance.md>), [protocol](<https://devfeed.tech/tags/protocol.md>), [research](<https://devfeed.tech/tags/research.md>), [survey](<https://devfeed.tech/tags/survey.md>)

### AI overview

The survey organizes research on Tendermint BFT consensus around the protocol's design choices, such as vote dissemination and proposer rotation. It classifies proposed changes by which choice they modify, which properties they strengthen or weaken, and whether they require a stronger fault or timing model. It then groups approaches around performance, validator accountability, and protection of exploitable information, identifies recurring strategies, and frames remaining gaps as open questions under explicit models. The supplied text is an abstract, so it does not provide the detailed comparisons or findings of the full survey.

### Source excerpt

arXiv:2611.15847v1 Announce Type: new Abstract: Tendermint is a consensus protocol that tolerates Byzantine faults, implemented first by the Tendermint Core engine and now by CometBFT. Realizing the protocol's separation of agreement from execution, the Application Blockchain Interface (ABCI) of these engines keeps consensus apart from the replicated application, so one engine can serve many independent proof-of-stake chains. A sustained body of research proposes changes that span the protocol's mechanisms, from vote dissemination to block proposal and reward distribution, yet to our knowledge no survey studies the protocol and these works as one family, and broader surveys do not take Tendermint as their subject. We describe the baseline, the protocol as consolidated from its original descriptions, by its design choices. Each is a decision, such as how votes spread or how proposers rotate, through which the baseline provides safety and liveness or another property under its fault and timing model. We classify each work by the design choice it renegotiates, that is, modifies or replaces, by the properties it strengthens or weakens, and by whether its result needs a stronger model. Taking a broader perspective on that classification, we group the surveyed works' solutions into a few threads of concern in the baseline, namely its performance, the accountability of its validators, and the protection of exploitable information. For each thread, we identify the recurring strategies that their approaches follow. Together, these threads and strategies describe the current state of research on the Tendermint family. Where the strategies leave gaps, we pose future directions, each as an open question under an explicit fault and timing model.

## Paris Signal Week looks to bridge crypto and institutional finance

DevFeed: [Paris Signal Week looks to bridge crypto and institutional finance](<https://devfeed.tech/articles/paris-signal-week-looks-to-bridge-crypto-and-institutional-finance-130910.md>)

Original publisher: [Read original article](<https://siliconangle.com/2026/11/12/signal-week-raise-summit-cubeconversations/>)

Author: Devony Hof

Published: 2026-11-12T20:49:54Z

Content type: news

Language: en

Sources: [SiliconANGLE](<https://devfeed.tech/sources/siliconangle.md>)

Topics: [Cryptocurrency](<https://devfeed.tech/topics/cryptocurrency.md>), [Finance](<https://devfeed.tech/topics/finance.md>), [Blockchain](<https://devfeed.tech/topics/blockchain.md>)

Tags: [ai](<https://devfeed.tech/tags/ai.md>), [ai-and-networking](<https://devfeed.tech/tags/ai-and-networking.md>), [aws-marketplace-story-5](<https://devfeed.tech/tags/aws-marketplace-story-5.md>), [bitcoin](<https://devfeed.tech/tags/bitcoin.md>), [blockchain](<https://devfeed.tech/tags/blockchain.md>), [blockchain-technology](<https://devfeed.tech/tags/blockchain-technology.md>), [bridge](<https://devfeed.tech/tags/bridge.md>), [charlie-meraud](<https://devfeed.tech/tags/charlie-meraud.md>), [conference](<https://devfeed.tech/tags/conference.md>), [crypto](<https://devfeed.tech/tags/crypto.md>), [cryptocurrency](<https://devfeed.tech/tags/cryptocurrency.md>), [cube-event-coverage](<https://devfeed.tech/tags/cube-event-coverage.md>), [cubeconversations](<https://devfeed.tech/tags/cubeconversations.md>), [custody](<https://devfeed.tech/tags/custody.md>), [digital-assets](<https://devfeed.tech/tags/digital-assets.md>), [europe](<https://devfeed.tech/tags/europe.md>), [event](<https://devfeed.tech/tags/event.md>), [finance](<https://devfeed.tech/tags/finance.md>), [fireblocks](<https://devfeed.tech/tags/fireblocks.md>), [global](<https://devfeed.tech/tags/global.md>), [global-expansion](<https://devfeed.tech/tags/global-expansion.md>), [highlighting](<https://devfeed.tech/tags/highlighting.md>), [industry](<https://devfeed.tech/tags/industry.md>), [kaiko](<https://devfeed.tech/tags/kaiko.md>), [leading](<https://devfeed.tech/tags/leading.md>), [machina](<https://devfeed.tech/tags/machina.md>), [machinasummit](<https://devfeed.tech/tags/machinasummit.md>), [michael-amar](<https://devfeed.tech/tags/michael-amar.md>), [morpho](<https://devfeed.tech/tags/morpho.md>), [networking](<https://devfeed.tech/tags/networking.md>), [news](<https://devfeed.tech/tags/news.md>), [paris](<https://devfeed.tech/tags/paris.md>), [raise](<https://devfeed.tech/tags/raise.md>), [raisesummit](<https://devfeed.tech/tags/raisesummit.md>), [self-custody](<https://devfeed.tech/tags/self-custody.md>), [signal](<https://devfeed.tech/tags/signal.md>), [signalweek](<https://devfeed.tech/tags/signalweek.md>)

### AI overview

Paris Blockchain Week has been rebranded as Signal Week and will share a venue with RAISE Summit and Machina Summit, while keeping separate programming, marketing, and ticketing. Organizers expect about 2,500 attendees and say the event aims to connect traditional finance executives with digital-asset companies through small, detailed discussions of bank use cases. Planned features include a private CXO Summit roundtable under Chatham House rules, attendance by EU regulators and leaders from Kaiko, Morpho, and Fireblocks, and sessions on custody solutions. The excerpt describes the organizers' goals and plans; it does not establish the event's eventual attendance or outcomes.

### Source excerpt

Paris Blockchain Week is now Signal Week, a reflection of cryptocurrency's global expansion. The newly rebranded event is joining forces with RAISE Summit, the annual AI and networking conference, and Machina Summit, Europe's leading physical AI event. Event organizers expect approximately 2,500 attendees, highlighting the growing profile of blockchain technology. "The industry has changed a [...] The post Paris Signal Week looks to bridge crypto and institutional finance appeared first on SiliconANGLE.

## XAUH: A Swiss Boutique Bets Gold's Next Buyers Will Carry It in a Chat App

DevFeed: [XAUH: A Swiss Boutique Bets Gold's Next Buyers Will Carry It in a Chat App](<https://devfeed.tech/articles/xauh-a-swiss-boutique-bets-gold-s-next-buyers-will-carry-it-in-a-chat-app-130604.md>)

Original publisher: [Read original article](<https://hackernoon.com/xauh-a-swiss-boutique-bets-golds-next-buyers-will-carry-it-in-a-chat-app?source=rss>)

Author: Sanya Kapoor

Published: 2026-11-12T13:31:30Z

Content type: article

Language: en

Sources: [HackerNoon](<https://devfeed.tech/sources/hackernoon.md>)

Topics: [Finance](<https://devfeed.tech/topics/finance.md>), [Blockchain](<https://devfeed.tech/topics/blockchain.md>), [The Open Network](<https://devfeed.tech/topics/ton.md>)

Tags: [blockchain](<https://devfeed.tech/tags/blockchain.md>), [chainlink-proof-of-reserves](<https://devfeed.tech/tags/chainlink-proof-of-reserves.md>), [digital-asset](<https://devfeed.tech/tags/digital-asset.md>), [distribution](<https://devfeed.tech/tags/distribution.md>), [gold-backed-cryptocurrency](<https://devfeed.tech/tags/gold-backed-cryptocurrency.md>), [good-company](<https://devfeed.tech/tags/good-company.md>), [ownership](<https://devfeed.tech/tags/ownership.md>), [swiss-gold-custody](<https://devfeed.tech/tags/swiss-gold-custody.md>), [telegram](<https://devfeed.tech/tags/telegram.md>), [telegram-gold-investment](<https://devfeed.tech/tags/telegram-gold-investment.md>), [tokenized-gold](<https://devfeed.tech/tags/tokenized-gold.md>), [verification](<https://devfeed.tech/tags/verification.md>), [xauh-digital-gold](<https://devfeed.tech/tags/xauh-digital-gold.md>), [xauh-gold-backed-token](<https://devfeed.tech/tags/xauh-gold-backed-token.md>)

### AI overview

XAUH represents one gram of Swiss 999.9-fine gold per token, with fractional units down to 0.01 gram and physical redemption starting at 500 grams. The issuer says bullion is refined by PX Precinox, held across Herculis House, Brink's and Loomis, insured at fair market value, and tracked through Chainlink reserve information. A KPMG agreed-upon-procedures report dated August 28, 2026, reported 15.5 kilograms of gold; the text says this matched a September 2026 supply figure of 15,500 tokens, while noting supply can change. Published redemption fees are 3% at 500 grams and 1% at one kilogram or more, plus transport; no recurring storage fee applies after minting. XAUH is distributed across Ethereum, TRON and TON, with Telegram part of its intended reach. Its legal classification is the issuer's stated position, not an independent regulatory determination.

### Source excerpt

Discover how Herculis' XAUH token connects physical Swiss gold with blockchain networks, fractional ownership, reserve verification, and Telegram distribution.

## ZIG Finance Opens $100M Vault to Bring Saudi Arabia's SME Lending Boom Onchain

DevFeed: [ZIG Finance Opens $100M Vault to Bring Saudi Arabia's SME Lending Boom Onchain](<https://devfeed.tech/articles/zig-finance-opens-100m-vault-to-bring-saudi-arabia-s-sme-lending-boom-onchain-130201.md>)

Original publisher: [Read original article](<https://hackernoon.com/zig-finance-opens-$100m-vault-to-bring-saudi-arabias-sme-lending-boom-onchain?source=rss>)

Author: Ishan Pandey

Published: 2026-11-12T07:41:06Z

Content type: article

Language: en

Sources: [HackerNoon](<https://devfeed.tech/sources/hackernoon.md>)

Topics: [Finance](<https://devfeed.tech/topics/finance.md>), [Blockchain](<https://devfeed.tech/topics/blockchain.md>), [DeFi](<https://devfeed.tech/topics/defi.md>)

Tags: [blockchain](<https://devfeed.tech/tags/blockchain.md>), [bnb-chain](<https://devfeed.tech/tags/bnb-chain.md>), [finance](<https://devfeed.tech/tags/finance.md>), [gcc](<https://devfeed.tech/tags/gcc.md>), [good-company](<https://devfeed.tech/tags/good-company.md>), [laser](<https://devfeed.tech/tags/laser.md>), [lending](<https://devfeed.tech/tags/lending.md>), [saudi-arabia](<https://devfeed.tech/tags/saudi-arabia.md>), [sme](<https://devfeed.tech/tags/sme.md>), [stablecoin](<https://devfeed.tech/tags/stablecoin.md>), [stablecoins](<https://devfeed.tech/tags/stablecoins.md>), [technology](<https://devfeed.tech/tags/technology.md>), [vault](<https://devfeed.tech/tags/vault.md>), [web3](<https://devfeed.tech/tags/web3.md>), [zig-finance](<https://devfeed.tech/tags/zig-finance.md>)

### AI overview

ZIG Finance launched the zEMS Vault to give eligible institutional investors exposure to a diversified pool of Saudi SME private credit through stablecoin subscriptions and redemptions on BNB Chain. Its onchain strategy targets $100 million. Beehive originates loans; Zamanat structures the product and provides Sharia advice; Laser Digital advises on risk governance and tokenization; ZIG Markets handles issuance, curation and distribution; and KAIO manages tokenization, compliance and lifecycle processes, including KYC. Investors hold vault tokens rather than owning loans directly. The vault is issued through a segregated portfolio, with Khalij expected to provide Sharia certification and an independent calculation agent still to be appointed. Availability is limited to eligible institutional investors in selected jurisdictions. Returns are not guaranteed, principal is not protected, and investors bear the credit risk of the underlying SME borrowers; Laser Digital and Nomura do not guarantee, underwrite or rate the loans.

### Source excerpt

ZIG Finance and Nomura's Laser Digital launch the zEMS Vault, a $100M target onchain strategy for Saudi SME private credit on BNB Chain, settled in stablecoins.

## Your AI Agent Is Only as Reliable as the Blockchain State It Observes

DevFeed: [Your AI Agent Is Only as Reliable as the Blockchain State It Observes](<https://devfeed.tech/articles/your-ai-agent-is-only-as-reliable-as-the-blockchain-state-it-observes-129457.md>)

Original publisher: [Read original article](<https://hackernoon.com/your-ai-agent-is-only-as-reliable-as-the-blockchain-state-it-observes?source=rss>)

Author: Atul Kumar

Published: 2026-11-11T15:22:52Z

Content type: article

Language: en

Sources: [HackerNoon](<https://devfeed.tech/sources/hackernoon.md>)

Topics: [Blockchain](<https://devfeed.tech/topics/blockchain.md>), [state-management](<https://devfeed.tech/topics/state-management.md>), [event-sourcing](<https://devfeed.tech/topics/event-sourcing.md>), [consistency](<https://devfeed.tech/topics/consistency.md>), [observability](<https://devfeed.tech/topics/observability.md>), [smart contract](<https://devfeed.tech/topics/smart-contract.md>)

Tags: [ai](<https://devfeed.tech/tags/ai.md>), [ai-agent](<https://devfeed.tech/tags/ai-agent.md>), [ai-agent-reliability](<https://devfeed.tech/tags/ai-agent-reliability.md>), [autonomous-blockchain-agents](<https://devfeed.tech/tags/autonomous-blockchain-agents.md>), [blockchain](<https://devfeed.tech/tags/blockchain.md>), [blockchain-indexers](<https://devfeed.tech/tags/blockchain-indexers.md>), [blockchain-state](<https://devfeed.tech/tags/blockchain-state.md>), [blockchain-state-management](<https://devfeed.tech/tags/blockchain-state-management.md>), [data](<https://devfeed.tech/tags/data.md>), [distributed-systems](<https://devfeed.tech/tags/distributed-systems.md>), [event-driven-architecture](<https://devfeed.tech/tags/event-driven-architecture.md>), [event-idempotency](<https://devfeed.tech/tags/event-idempotency.md>), [events](<https://devfeed.tech/tags/events.md>), [indexing](<https://devfeed.tech/tags/indexing.md>), [pipelines](<https://devfeed.tech/tags/pipelines.md>), [state](<https://devfeed.tech/tags/state.md>), [state-reconciliation](<https://devfeed.tech/tags/state-reconciliation.md>)

### AI overview

AI agents acting on blockchain data can make sound decisions from an incorrect or outdated application state. The article identifies duplicate or out-of-order events, delayed indexers, chain reorganisations and concurrent database updates as causes of divergence between observed events and the state an application presents. It recommends durable event storage, idempotent processing with atomic concurrency controls, versioned state metadata, reconciliation against equivalent chain references, and revalidation of critical assumptions before execution. Transaction timeouts should remain explicitly uncertain until the original transaction is checked; agent memory should not be the authoritative status record. The article also recommends testing failure recovery and monitoring indexing lag, reconciliation and transaction lifecycles. Validation strength should match action risk: efficient projections can support routine analysis, while consequential transactions need fresh checks. Idempotency suppresses duplicate effects but does not handle reorganisations by itself.

### Source excerpt

Learn how stale blockchain data, duplicate events, and indexing delays can compromise AI agents, and how to design reliable state pipelines.

## Verifiable, Privacy-Preserving and Collaborative Multi-Objective Optimization with NSGA-II on Blockchain

DevFeed: [Verifiable, Privacy-Preserving and Collaborative Multi-Objective Optimization with NSGA-II on Blockchain](<https://devfeed.tech/articles/verifiable-privacy-preserving-and-collaborative-multi-objective-optimization-with-nsga-ii-on-blockchain-126729.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.11567>)

Author: Goshgar Can Ismayilov

Published: 2026-11-10T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Distributed Computing](<https://devfeed.tech/sources/arxiv-distributed-computing.md>)

Topics: [Blockchain](<https://devfeed.tech/topics/blockchain.md>), [Zero-knowledge proof](<https://devfeed.tech/topics/zkp.md>), [Operations research and optimization](<https://devfeed.tech/topics/operations-research-and-optimization.md>), [Cryptography](<https://devfeed.tech/topics/cryptography.md>)

Tags: [algorithm](<https://devfeed.tech/tags/algorithm.md>), [blockchain](<https://devfeed.tech/tags/blockchain.md>), [case-study](<https://devfeed.tech/tags/case-study.md>), [cs-dc](<https://devfeed.tech/tags/cs-dc.md>), [dataset](<https://devfeed.tech/tags/dataset.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [privacy](<https://devfeed.tech/tags/privacy.md>), [proofs](<https://devfeed.tech/tags/proofs.md>), [protocol](<https://devfeed.tech/tags/protocol.md>), [virtual-machine](<https://devfeed.tech/tags/virtual-machine.md>), [zero-knowledge](<https://devfeed.tech/tags/zero-knowledge.md>), [zero-knowledge-proof](<https://devfeed.tech/tags/zero-knowledge-proof.md>)

### AI overview

The proposed zk-NSGA-II protocol lets independent solvers contribute privately to a shared, on-chain Pareto front. It runs NSGA-II in the RISC Zero zkVM and certifies evolutionary generations with succinct proofs verified on-chain. Solvers keep their populations and local Pareto fronts off-chain; contributions enter the global front only when non-dominated against existing contributions. Hash chains link population states across generations to guard against fabricated contributions. The abstract reports correctness evaluations on 12 ZDT and DTLZ benchmark problems and a feasibility case study in portfolio optimization using the Hang Seng dataset. It says performance was assessed with nine metrics spanning optimization, zero-knowledge proof, and blockchain perspectives, and concludes that trustless collaboration appears feasible with existing technologies.

### Source excerpt

arXiv:2611.11567v1 Announce Type: new Abstract: Collaborative multi-objective optimization allows independent problem solvers to contribute their solutions to a shared problem. However, their validity cannot be reliably verified in open settings if the parties are reluctant to disclose their solutions. Therefore, this paper proposes a novel zk-NSGA-II protocol for verifiable, privacy-preserving and collaborative multi-objective optimization on blockchain. To the best of our knowledge, this is the first work that executes Non-Dominated Sorting Genetic Algorithm II (NSGA-II) on the RISC Zero Zero-Knowledge Virtual Machine (zkVM) where evolutionary generations are certified by succinct proofs that are verified on-chain. Problem solvers maintain their own independent populations as the set of solutions in the decision space and their corresponding objective vectors in the objective space. They contribute to a global on-chain Pareto front by aggregating their local off-chain Pareto fronts according to the rule of non-domination which admits a contribution if it is non-dominated with respect to the existing contributions in the global front. To prevent fabricated contributions, population states across generations are linked through hash chains. The correctness of the zk-NSGA-II protocol is first evaluated on twelve problems from the ZDT and DTLZ benchmarks. Second, its feasibility is shown in a real-world portfolio optimization case study with the Hang Seng dataset. Performance on these problems is measured with nine different metrics across three complementary perspectives for optimization, zero-knowledge proof and blockchain. The empirical findings indicate that trustless collaborative multi-objective optimization is feasible with the existing zero-knowledge and blockchain technologies.

## A Decentralized Quantum-Resistant Notary Scheme for Blockchain Interoperability with a Novel Dynamic Trust Model

DevFeed: [A Decentralized Quantum-Resistant Notary Scheme for Blockchain Interoperability with a Novel Dynamic Trust Model](<https://devfeed.tech/articles/a-decentralized-quantum-resistant-notary-scheme-for-blockchain-interoperability-with-a-novel-dynamic-trust-model-126730.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.11682>)

Author: Koosha Esmaeilzadeh Khorasani, Saeed Moradi, Sara Rouhani

Published: 2026-11-10T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Distributed Computing](<https://devfeed.tech/sources/arxiv-distributed-computing.md>)

Topics: [Blockchain](<https://devfeed.tech/topics/blockchain.md>), [Post-quantum cryptography](<https://devfeed.tech/topics/post-quantum-cryptography.md>), [Cryptography](<https://devfeed.tech/topics/cryptography.md>), [trust](<https://devfeed.tech/topics/trust.md>)

Tags: [adaptive](<https://devfeed.tech/tags/adaptive.md>), [adversarial](<https://devfeed.tech/tags/adversarial.md>), [aes](<https://devfeed.tech/tags/aes.md>), [blockchain](<https://devfeed.tech/tags/blockchain.md>), [blockchain-interoperability](<https://devfeed.tech/tags/blockchain-interoperability.md>), [cryptography](<https://devfeed.tech/tags/cryptography.md>), [cs-dc](<https://devfeed.tech/tags/cs-dc.md>), [decentralized](<https://devfeed.tech/tags/decentralized.md>), [hybrid](<https://devfeed.tech/tags/hybrid.md>), [inequality](<https://devfeed.tech/tags/inequality.md>), [interoperability](<https://devfeed.tech/tags/interoperability.md>), [mechanism](<https://devfeed.tech/tags/mechanism.md>), [ml](<https://devfeed.tech/tags/ml.md>), [ml-dsa](<https://devfeed.tech/tags/ml-dsa.md>), [ml-kem](<https://devfeed.tech/tags/ml-kem.md>), [model](<https://devfeed.tech/tags/model.md>), [performance](<https://devfeed.tech/tags/performance.md>), [post-quantum](<https://devfeed.tech/tags/post-quantum.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [quantum-resistant-blockchain](<https://devfeed.tech/tags/quantum-resistant-blockchain.md>), [trust](<https://devfeed.tech/tags/trust.md>)

### AI overview

The paper proposes a decentralized blockchain notary scheme combining ML-KEM and ML-DSA with AES-256: asymmetric cryptography handles authentication and non-repudiation, while symmetric encryption handles bulk data. In tests up to 270 transactions per second, its end-to-end performance gap versus elliptic-curve approaches averaged under 6% and narrowed to 0.2% at peak load. For trust management, Popoviciu's inequality sets an adaptive discount factor α from variance in verifier behavior, avoiding fixed thresholds and multi-stage configuration; a tunable factor k controls sensitivity. Across 200 adversarial epochs, the authors report that this model detected and responded to misbehavior that the baseline did not penalize adequately.

### Source excerpt

arXiv:2611.11682v1 Announce Type: new Abstract: Blockchain interoperability is essential for enabling secure and reliable interactions across heterogeneous networks. However, existing notary schemes face two key issues: quantum vulnerability and rigid trust management. To address the first issue, this paper proposes a decentralized, quantum-resistant framework integrating post-quantum primitives ML-KEM and ML-DSA alongside AES-256, optimizing performance by using asymmetric cryptography for authentication and non-repudiation, and delegating bulk encryption to symmetric schemes. Under parallel loads of up to 270 transactions per second, this hybrid design reduces the end-to-end performance gap between the post-quantum and elliptic-curve approaches to under 6% on average, converging to within 0.2% at peak load. The second issue is handled by a dynamic trust model that uses Popoviciu's inequality to derive an adaptive discount factor $\alpha$ based on variance in a Verifier's behavior, removing the need for fixed thresholds or multi-stage configuration, while a tunable dynamicity factor $k$ enables control over system sensitivity. We evaluated the trust model over 200 epochs under adversarial conditions, where the proposed model detects and responds to misbehavior that the baseline model fails to penalize adequately. These results demonstrate that quantum-resistant blockchain interoperability is practically achievable, with the proposed trust mechanism offering greater adaptability and resilience than existing approaches.

## How to Trace AI Agent Decisions Across Blockchain Transactions

DevFeed: [How to Trace AI Agent Decisions Across Blockchain Transactions](<https://devfeed.tech/articles/how-to-trace-ai-agent-decisions-across-blockchain-transactions-124210.md>)

Original publisher: [Read original article](<https://hackernoon.com/how-to-trace-ai-agent-decisions-across-blockchain-transactions?source=rss>)

Author: Atul Kumar

Published: 2026-11-09T17:15:02Z

Content type: article

Language: en

Sources: [HackerNoon](<https://devfeed.tech/sources/hackernoon.md>)

Topics: [agent observability](<https://devfeed.tech/topics/agent-observability.md>), [observability](<https://devfeed.tech/topics/observability.md>), [Blockchain](<https://devfeed.tech/topics/blockchain.md>), [AI Agent](<https://devfeed.tech/topics/ai-agent.md>), [Multi-step AI processes](<https://devfeed.tech/topics/multi-step-ai-processes.md>), [software-architecture](<https://devfeed.tech/topics/software-architecture.md>), [OpenTelemetry](<https://devfeed.tech/topics/opentelemetry.md>), [Production Engineering](<https://devfeed.tech/topics/production-engineering.md>)

Tags: [agent](<https://devfeed.tech/tags/agent.md>), [ai](<https://devfeed.tech/tags/ai.md>), [ai-agents](<https://devfeed.tech/tags/ai-agents.md>), [ai-infrastructure](<https://devfeed.tech/tags/ai-infrastructure.md>), [ai-native-observability](<https://devfeed.tech/tags/ai-native-observability.md>), [architecture](<https://devfeed.tech/tags/architecture.md>), [audit](<https://devfeed.tech/tags/audit.md>), [auditability](<https://devfeed.tech/tags/auditability.md>), [blockchain](<https://devfeed.tech/tags/blockchain.md>), [blockchain-development](<https://devfeed.tech/tags/blockchain-development.md>), [blockchain-state](<https://devfeed.tech/tags/blockchain-state.md>), [distributed-systems](<https://devfeed.tech/tags/distributed-systems.md>), [distributed-tracing](<https://devfeed.tech/tags/distributed-tracing.md>), [observability](<https://devfeed.tech/tags/observability.md>), [policies](<https://devfeed.tech/tags/policies.md>), [security](<https://devfeed.tech/tags/security.md>), [smart-contracts](<https://devfeed.tech/tags/smart-contracts.md>), [software-architecture](<https://devfeed.tech/tags/software-architecture.md>), [trace](<https://devfeed.tech/tags/trace.md>), [transaction-monitoring](<https://devfeed.tech/tags/transaction-monitoring.md>), [transactions](<https://devfeed.tech/tags/transactions.md>)

### AI overview

AI and blockchain observability should connect an agent's request and operational decisions to policy checks, transaction execution, and verified on-chain outcomes. Blockchain dashboards show execution details, while application logs often lack a shared way to link those events across services. The article proposes using OpenTelemetry traces for workflow relationships, alongside durable decision and audit records for observations, policy versions, authorisation, and outcomes; traces alone do not prove correctness and may be sampled or dropped. It recommends tracking data provenance and freshness, distinguishing transaction lifecycle states, and verifying application-specific results. Monitoring should separate expected policy rejections, operational failures, unresolved submissions, and outcome mismatches. Instrumentation should minimise sensitive data, and high-impact actions may need to stop or use a controlled fallback if required authorisation evidence is missing. Observability aids investigation and recovery but cannot guarantee good decisions or reverse confirmed transactions.

### Source excerpt

Learn how AI-native observability connects agent decisions, blockchain transactions, security policies, and on-chain outcomes for reliable AI systems.

## A Practical Post-Quantum Distributed Ledger Protocol for Financial Institutions

DevFeed: [A Practical Post-Quantum Distributed Ledger Protocol for Financial Institutions](<https://devfeed.tech/articles/a-practical-post-quantum-distributed-ledger-protocol-for-financial-institutions-122763.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2603.05005>)

Author: Yeoh Wei Zhu, Naresh Goud Boddu, Yao Ma, Shaltiel Eloul, Giulio Golinelli, Yash Satsangi, Rob Otter, Kaushik Chakraborty

Published: 2026-11-09T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>)

Topics: [Cryptography](<https://devfeed.tech/topics/cryptography.md>), [Post-quantum cryptography](<https://devfeed.tech/topics/post-quantum-cryptography.md>), [Zero-knowledge proof](<https://devfeed.tech/topics/zkp.md>), [Blockchain](<https://devfeed.tech/topics/blockchain.md>), [cryptographic audit](<https://devfeed.tech/topics/cryptographic-audit.md>)

Tags: [assets](<https://devfeed.tech/tags/assets.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [distributed](<https://devfeed.tech/tags/distributed.md>), [encrypted](<https://devfeed.tech/tags/encrypted.md>), [financial-institutions](<https://devfeed.tech/tags/financial-institutions.md>), [lattice](<https://devfeed.tech/tags/lattice.md>), [post-quantum](<https://devfeed.tech/tags/post-quantum.md>), [privacy](<https://devfeed.tech/tags/privacy.md>), [private](<https://devfeed.tech/tags/private.md>), [protocol](<https://devfeed.tech/tags/protocol.md>), [security](<https://devfeed.tech/tags/security.md>), [transaction](<https://devfeed.tech/tags/transaction.md>), [zero-knowledge](<https://devfeed.tech/tags/zero-knowledge.md>)

### AI overview

The paper proposes a post-quantum, lattice-based transaction scheme for encrypted ledgers, aiming to meet financial institutions' confidentiality and auditability needs. It combines zero-knowledge proofs with a method for equating commitment messages during re-commitment without opening one of them, then builds a publicly verifiable scheme for single- or multi-asset transactions using a compact range proof. The abstract says the authors provide a security analysis; it does not give implementation details or quantitative performance results.

### Source excerpt

arXiv:2603.05005v2 Announce Type: replace Abstract: Traditional financial institutions face inefficiencies that can be addressed by distributed ledger technology. However, a primary barrier to adoption is the privacy concerns surrounding publicly available transaction data. Existing private protocols for distributed ledger that focus on the Ring-CT model are not suitable for adoption for financial institutions. We propose a post-quantum, lattice-based transaction scheme for encrypted ledgers which better aligns with institutions' requirements for confidentiality and audit-ability. The construction leverages various zero-knowledge proof techniques, and introduces a new method for equating two commitment messages, without the capability to open one of the commitment during the re-commitment. Subsequently, we build a publicly verifiable transaction scheme that is efficient for single or multi-assets, by introducing a new compact range-proof. We then provide a security analysis of it. The techniques used and the proofs constructed could be of independent interest.

## Replication Certification at Publication: Checkable by Anyone, Anywhere, in Seconds, Forever

DevFeed: [Replication Certification at Publication: Checkable by Anyone, Anywhere, in Seconds, Forever](<https://devfeed.tech/articles/replication-certification-at-publication-checkable-by-anyone-anywhere-in-seconds-forever-122797.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.09214>)

Author: Gary King, Yiqing Xu, Leo Yang Yang

Published: 2026-11-09T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>)

Topics: [Blockchain](<https://devfeed.tech/topics/blockchain.md>), [recording](<https://devfeed.tech/topics/recording.md>)

Tags: [analysis](<https://devfeed.tech/tags/analysis.md>), [archive](<https://devfeed.tech/tags/archive.md>), [blockchain](<https://devfeed.tech/tags/blockchain.md>), [certificate](<https://devfeed.tech/tags/certificate.md>), [certification](<https://devfeed.tech/tags/certification.md>), [code](<https://devfeed.tech/tags/code.md>), [computer-science](<https://devfeed.tech/tags/computer-science.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [cs-dl](<https://devfeed.tech/tags/cs-dl.md>), [data](<https://devfeed.tech/tags/data.md>), [datasets](<https://devfeed.tech/tags/datasets.md>), [files](<https://devfeed.tech/tags/files.md>), [hash](<https://devfeed.tech/tags/hash.md>), [journals](<https://devfeed.tech/tags/journals.md>), [publication](<https://devfeed.tech/tags/publication.md>), [replication](<https://devfeed.tech/tags/replication.md>), [stat-me](<https://devfeed.tech/tags/stat-me.md>), [timestamps](<https://devfeed.tech/tags/timestamps.md>), [website](<https://devfeed.tech/tags/website.md>)

### AI overview

The proposed replication certificate creates a cryptographically signed record of deposited files and analysis output, intended to replace journal reanalysis with evidence others can check. After depositing, the author reruns the analysis once using a random seed derived by the archive from the deposit's hash and a blockchain block. The archive signs, blockchain-timestamps, and stores the record, including records involving confidential data, without rerunning the analysis; the journal checks a website for the certificate. The authors say anyone can later check or replay the steps. The excerpt does not provide implementation details or evidence evaluating the proposal's effectiveness.

### Source excerpt

arXiv:2611.09214v1 Announce Type: cross Abstract: Authors increasingly deposit replication datasets---the data and code behind publications---in archives, and journals increasingly require them to, under progressively onerous rules. But a deposit alone proves little, so authors keep paying: months for the journal's reanalyses, years answering readers' questions, and rancor as failed replications become accusations because no record establishes what actually ran. We introduce a replication certificate: a cryptographically signed record of the deposited files and logged output. It replaces the journal's reanalyses with evidence anyone can check in seconds, which no one, including the archive, can backdate, and no one can fake without risking detection. Certification asks little of anyone and benefits everyone: The author deposits, then reruns the analysis once under a random seed the archive computes from the deposit's hash and a blockchain block; the archive signs, timestamps (in that blockchain), and stores the record---confidential data included---without rerunning anything; the journal merely checks a website for the certificate; and anyone can check or replay any step decades later.

## A Blockchain-Based Audit Mechanism for Trust and Integrity in IoT-Fog Environments

DevFeed: [A Blockchain-Based Audit Mechanism for Trust and Integrity in IoT-Fog Environments](<https://devfeed.tech/articles/a-blockchain-based-audit-mechanism-for-trust-and-integrity-in-iot-fog-environments-122761.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2405.00844>)

Author: Ismael Martinez, Abdelhakim Senhaji Hafid, Michel Gendreau

Published: 2026-11-09T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>)

Topics: [Internet of things](<https://devfeed.tech/topics/iot.md>), [Blockchain](<https://devfeed.tech/topics/blockchain.md>), [trust](<https://devfeed.tech/topics/trust.md>), [audit](<https://devfeed.tech/topics/audit.md>), [Access Control](<https://devfeed.tech/topics/access-control.md>), [Cryptocurrency](<https://devfeed.tech/topics/cryptocurrency.md>)

Tags: [audit](<https://devfeed.tech/tags/audit.md>), [authentication](<https://devfeed.tech/tags/authentication.md>), [blockchain](<https://devfeed.tech/tags/blockchain.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [data-security](<https://devfeed.tech/tags/data-security.md>), [decentralized](<https://devfeed.tech/tags/decentralized.md>), [ecosystem](<https://devfeed.tech/tags/ecosystem.md>), [edge-computing](<https://devfeed.tech/tags/edge-computing.md>), [incentives](<https://devfeed.tech/tags/incentives.md>), [integrity](<https://devfeed.tech/tags/integrity.md>), [iot](<https://devfeed.tech/tags/iot.md>), [malicious](<https://devfeed.tech/tags/malicious.md>), [monetization](<https://devfeed.tech/tags/monetization.md>), [smart-city](<https://devfeed.tech/tags/smart-city.md>), [system](<https://devfeed.tech/tags/system.md>), [trust](<https://devfeed.tech/tags/trust.md>)

### AI overview

The paper proposes a blockchain-based mechanism for public, decentralized IoT-fog environments where fog nodes may fail to respond correctly to IoT requests. It combines mutual authentication and payment for fog services with service audits to check fog-node integrity, using incentives and penalties to discourage malicious activity and encourage honest behavior. The supplied text describes the proposal but provides no implementation or evaluation results.

### Source excerpt

arXiv:2405.00844v2 Announce Type: replace Abstract: The full realization of smart city technology is dependent on the secure and honest collaboration between IoT applications and edge-computing. In particular, resource constrained IoT devices may rely on fog-computing to alleviate the computing load of IoT tasks. Mutual authentication is needed between IoT and fog to preserve IoT data security, and monetization of fog services is needed to promote the fog service ecosystem. However, there is no guarantee that fog nodes will always respond to IoT requests correctly, either intentionally or accidentally. In the public decentralized IoT-fog environment, it is crucial to enforce integrity among fog nodes. In this paper, we propose a blockchain-based system that 1) streamlines the mutual authentication service monetization between IoT and fog, 2) verifies the integrity of fog nodes via service audits, and 3) discourages malicious activity and promotes honesty among fog nodes through incentives and penalties.

## Tokenized Deposits Could Become Blockchain's Killer Enterprise Use Case

DevFeed: [Tokenized Deposits Could Become Blockchain's Killer Enterprise Use Case](<https://devfeed.tech/articles/tokenized-deposits-could-become-blockchain-s-killer-enterprise-use-case-122684.md>)

Original publisher: [Read original article](<https://hackernoon.com/tokenized-deposits-could-become-blockchains-killer-enterprise-use-case?source=rss>)

Author: Michael Chukwube

Published: 2026-11-08T17:16:38Z

Content type: article

Language: en

Sources: [HackerNoon](<https://devfeed.tech/sources/hackernoon.md>)

Topics: [Blockchain](<https://devfeed.tech/topics/blockchain.md>), [Finance](<https://devfeed.tech/topics/finance.md>), [smart contract](<https://devfeed.tech/topics/smart-contract.md>)

Tags: [17](<https://devfeed.tech/tags/17.md>), [2](<https://devfeed.tech/tags/2.md>), [2026](<https://devfeed.tech/tags/2026.md>), [3](<https://devfeed.tech/tags/3.md>), [about](<https://devfeed.tech/tags/about.md>), [account](<https://devfeed.tech/tags/account.md>), [act](<https://devfeed.tech/tags/act.md>), [actions](<https://devfeed.tech/tags/actions.md>), [all](<https://devfeed.tech/tags/all.md>), [also](<https://devfeed.tech/tags/also.md>), [api](<https://devfeed.tech/tags/api.md>), [application](<https://devfeed.tech/tags/application.md>), [apply](<https://devfeed.tech/tags/apply.md>), [approach](<https://devfeed.tech/tags/approach.md>), [asset](<https://devfeed.tech/tags/asset.md>), [atomic-settlement](<https://devfeed.tech/tags/atomic-settlement.md>), [blockchain](<https://devfeed.tech/tags/blockchain.md>), [blockchain-banking](<https://devfeed.tech/tags/blockchain-banking.md>), [blockchain-interoprability](<https://devfeed.tech/tags/blockchain-interoprability.md>), [cross-border-payments](<https://devfeed.tech/tags/cross-border-payments.md>), [digital-assets](<https://devfeed.tech/tags/digital-assets.md>), [enterprise](<https://devfeed.tech/tags/enterprise.md>), [enterprise-blockchain-adoption](<https://devfeed.tech/tags/enterprise-blockchain-adoption.md>), [faster](<https://devfeed.tech/tags/faster.md>), [financial-infrastructure](<https://devfeed.tech/tags/financial-infrastructure.md>), [payments](<https://devfeed.tech/tags/payments.md>), [tokenized-deposits](<https://devfeed.tech/tags/tokenized-deposits.md>)

### AI overview

Tokenized deposits are commercial bank liabilities represented as programmable tokens, with issuance and redemption kept aligned to the bank's ledger. Their enterprise value comes from atomic settlement: a smart contract can transfer payment and an asset together, or execute payment only when a documented condition is met. Within one bank, tokens could support continuous treasury transfers and liquidity rules; cross-bank use requires coordinated reserve settlement and cross-ledger finality. The excerpt distinguishes J.P. Morgan's permissioned JPMD on Base, Citi's bank-controlled transaction network, and HSBC's approved-wallet treasury service, each with different reach and governance boundaries. It identifies unresolved needs including shared identity and messaging, privacy, legal treatment of irrevocability, and controls for contract or data failures. The cited Project Agorá testing covered 17 scenarios and averaged about 80 seconds per transaction, without integration into existing core banking and settlement systems.

### Source excerpt

Explore why tokenized deposits could become blockchain's leading enterprise use case for faster, programmable and regulated payments.

## When Blockchain Data Becomes AI Context, Stale State Becomes a Security Risk

DevFeed: [When Blockchain Data Becomes AI Context, Stale State Becomes a Security Risk](<https://devfeed.tech/articles/when-blockchain-data-becomes-ai-context-stale-state-becomes-a-security-risk-121029.md>)

Original publisher: [Read original article](<https://hackernoon.com/when-blockchain-data-becomes-ai-context-stale-state-becomes-a-security-risk?source=rss>)

Author: Atul Kumar

Published: 2026-11-06T08:29:55Z

Content type: article

Language: en

Sources: [HackerNoon](<https://devfeed.tech/sources/hackernoon.md>)

Topics: [Blockchain](<https://devfeed.tech/topics/blockchain.md>), [context](<https://devfeed.tech/topics/context.md>), [ai security](<https://devfeed.tech/topics/ai-security.md>), [Data Quality](<https://devfeed.tech/topics/data-quality.md>), [consistency](<https://devfeed.tech/topics/consistency.md>), [AI Architecture](<https://devfeed.tech/topics/ai-architecture.md>), [Agent Harness](<https://devfeed.tech/topics/agent-harness.md>), [state-management](<https://devfeed.tech/topics/state-management.md>), [agentic workflows](<https://devfeed.tech/topics/agentic-workflows.md>), [observability](<https://devfeed.tech/topics/observability.md>), [AI-Ready Data](<https://devfeed.tech/topics/ai-ready-data.md>), [AI Integration Strategies](<https://devfeed.tech/topics/ai-integration-strategies.md>)

Tags: [account](<https://devfeed.tech/tags/account.md>), [account-balance](<https://devfeed.tech/tags/account-balance.md>), [accounting](<https://devfeed.tech/tags/accounting.md>), [actions](<https://devfeed.tech/tags/actions.md>), [agent](<https://devfeed.tech/tags/agent.md>), [agent-runtimes](<https://devfeed.tech/tags/agent-runtimes.md>), [agents](<https://devfeed.tech/tags/agents.md>), [ai](<https://devfeed.tech/tags/ai.md>), [ai-agent](<https://devfeed.tech/tags/ai-agent.md>), [ai-agents](<https://devfeed.tech/tags/ai-agents.md>), [ai-engineering](<https://devfeed.tech/tags/ai-engineering.md>), [ai-systems](<https://devfeed.tech/tags/ai-systems.md>), [artificial-intelligence](<https://devfeed.tech/tags/artificial-intelligence.md>), [blockchain](<https://devfeed.tech/tags/blockchain.md>), [context](<https://devfeed.tech/tags/context.md>), [context-engineering](<https://devfeed.tech/tags/context-engineering.md>), [cybersecurity](<https://devfeed.tech/tags/cybersecurity.md>), [data](<https://devfeed.tech/tags/data.md>), [distributed-systems](<https://devfeed.tech/tags/distributed-systems.md>), [execution](<https://devfeed.tech/tags/execution.md>), [risk](<https://devfeed.tech/tags/risk.md>), [security](<https://devfeed.tech/tags/security.md>), [smart-contracts](<https://devfeed.tech/tags/smart-contracts.md>), [state](<https://devfeed.tech/tags/state.md>), [validation](<https://devfeed.tech/tags/validation.md>), [web3](<https://devfeed.tech/tags/web3.md>)

### AI overview

Blockchain data can be accurate when retrieved yet unsafe by the time an AI agent acts: balances, liquidity, or lending positions may change, and RPC reads, indexers, events, and price feeds may describe different states. The article argues that retrieval success or a timestamp alone cannot establish decision validity. It recommends tracking each observation's source and block reference, checking freshness and consistency against the action's risk, and refreshing or rejecting context when required. Proposed transactions should carry their critical assumptions and be revalidated before signing; after submission, the system should verify transaction status and resulting state rather than assume success or retry blindly. Historical memory should preserve what was observed without standing in for current state. Stronger checks improve safety but add latency and infrastructure cost, so requirements should vary by task, with consequential actions requiring stronger evidence. The article also recommends tracing observations, policy checks, authorization, and confirmed outcomes to explain decisions.

### Source excerpt

Stale blockchain data can lead AI agents to make unsafe decisions. Learn how context validation, state tracking, and execution checks improve reliability.

## Lantern: Finding Committable Transactions via Back-Propagation on DAGs

DevFeed: [Lantern: Finding Committable Transactions via Back-Propagation on DAGs](<https://devfeed.tech/articles/lantern-finding-committable-transactions-via-back-propagation-on-dags-121001.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2609.03315>)

Author: Denglong Li, Gerui Wang, Tian Guan, Mingchao Wan

Published: 2026-11-06T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Databases](<https://devfeed.tech/sources/arxiv-databases.md>), [arXiv: Distributed Computing](<https://devfeed.tech/sources/arxiv-distributed-computing.md>)

Topics: [Transactions](<https://devfeed.tech/topics/transactions.md>), [Blockchain](<https://devfeed.tech/topics/blockchain.md>)

Tags: [aria](<https://devfeed.tech/tags/aria.md>), [batch](<https://devfeed.tech/tags/batch.md>), [benchmarks](<https://devfeed.tech/tags/benchmarks.md>), [blockchain](<https://devfeed.tech/tags/blockchain.md>), [concurrency-control](<https://devfeed.tech/tags/concurrency-control.md>), [cs-db](<https://devfeed.tech/tags/cs-db.md>), [cs-dc](<https://devfeed.tech/tags/cs-dc.md>), [cs-pf](<https://devfeed.tech/tags/cs-pf.md>), [dependency](<https://devfeed.tech/tags/dependency.md>), [dependency-graph](<https://devfeed.tech/tags/dependency-graph.md>), [evaluations](<https://devfeed.tech/tags/evaluations.md>), [execution](<https://devfeed.tech/tags/execution.md>), [high-performance](<https://devfeed.tech/tags/high-performance.md>), [integrate](<https://devfeed.tech/tags/integrate.md>), [protocol](<https://devfeed.tech/tags/protocol.md>), [protocols](<https://devfeed.tech/tags/protocols.md>), [transactions](<https://devfeed.tech/tags/transactions.md>)

### AI overview

Lantern is a deterministic concurrency control protocol designed to work without prior knowledge of transaction read-write sets. It commits zero-out-degree transactions in ascending order using an overwrite-permissive strategy, then applies back-propagation from sink to source vertices to identify more committable transactions. For read-modify-write intensive workloads, it also uses Conflict-Free Batch Selection. Integrated into ChainMaker, Lantern reportedly achieved up to 4.2x Aria's throughput on YCSB and SmallBank benchmarks and raised ChainMaker's execution-layer throughput by at least 2.2x.

### Source excerpt

arXiv:2609.03315v2 Announce Type: replace-cross Abstract: Existing concurrency control protocols either introduce nondeterminism, resulting in a serial execution-replay dependency between primary and replica nodes, or rely on impractical prior knowledge of transaction read-write sets. In this paper, we present Lantern, a deterministic concurrency control protocol tailored for high-performance transaction processing systems operating without prior knowledge. The key insight of Lantern is that all zero-out-degree transaction vertices in the local dependency graph can be safely committed in ascending order using an overwrite-permissive strategy. We further introduce a novel Back-Propagation mechanism that iteratively propagates dependency states from sink to source vertices to identify additional committable transactions. We also propose Conflict-Free Batch Selection (CFBS) for read-modify-write intensive scenarios. We integrate Lantern into the open-source blockchain platform ChainMaker. Extensive evaluations on YCSB and SmallBank benchmarks demonstrate that Lantern achieves up to a 4.2x throughput speedup over Aria and improves the throughput of ChainMaker's execution layer by at least 2.2x.

## I Vibe-Coded a Layer-1 Blockchain to Give Everyone Free AI

DevFeed: [I Vibe-Coded a Layer-1 Blockchain to Give Everyone Free AI](<https://devfeed.tech/articles/i-vibe-coded-a-layer-1-blockchain-to-give-everyone-free-ai-118803.md>)

Original publisher: [Read original article](<https://hackernoon.com/i-vibe-coded-a-layer-1-blockchain-to-give-everyone-free-ai?source=rss>)

Author: Yevhen

Published: 2026-11-05T07:04:26Z

Content type: article

Language: en

Sources: [HackerNoon](<https://devfeed.tech/sources/hackernoon.md>)

Topics: [Blockchain](<https://devfeed.tech/topics/blockchain.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [smart contract](<https://devfeed.tech/topics/smart-contract.md>), [free software](<https://devfeed.tech/topics/free-software.md>)

Tags: [adversarial](<https://devfeed.tech/tags/adversarial.md>), [agents](<https://devfeed.tech/tags/agents.md>), [ai](<https://devfeed.tech/tags/ai.md>), [ai-assistance](<https://devfeed.tech/tags/ai-assistance.md>), [ai-compute](<https://devfeed.tech/tags/ai-compute.md>), [ai-infrastructure](<https://devfeed.tech/tags/ai-infrastructure.md>), [ai-models](<https://devfeed.tech/tags/ai-models.md>), [analysis](<https://devfeed.tech/tags/analysis.md>), [app](<https://devfeed.tech/tags/app.md>), [application](<https://devfeed.tech/tags/application.md>), [applications](<https://devfeed.tech/tags/applications.md>), [apps](<https://devfeed.tech/tags/apps.md>), [blockchain](<https://devfeed.tech/tags/blockchain.md>), [dapps](<https://devfeed.tech/tags/dapps.md>), [decentralize-ai](<https://devfeed.tech/tags/decentralize-ai.md>), [decentralize-ai-hackathon](<https://devfeed.tech/tags/decentralize-ai-hackathon.md>), [decentralized-ai](<https://devfeed.tech/tags/decentralized-ai.md>), [depin](<https://devfeed.tech/tags/depin.md>), [developer](<https://devfeed.tech/tags/developer.md>), [engine](<https://devfeed.tech/tags/engine.md>), [fees](<https://devfeed.tech/tags/fees.md>), [free](<https://devfeed.tech/tags/free.md>), [layer](<https://devfeed.tech/tags/layer.md>), [mit](<https://devfeed.tech/tags/mit.md>), [open-source](<https://devfeed.tech/tags/open-source.md>), [review](<https://devfeed.tech/tags/review.md>), [zero](<https://devfeed.tech/tags/zero.md>)

### AI overview

AIcuNet is a live, early-stage Layer-1 blockchain designed to run on ordinary PCs and eventually use contributed resources to provide shared AI access. Its Phase 1 consensus has operated since July 12, 2026, using memory-hard mining based on CPU and RAM; the article reports over 2.5 million blocks but gives no measured throughput benchmark. The network has no transaction fees and includes a JavaScript smart-contract engine and dApp tools. Its first application, Miner's Hour, is in trial. Storage and light-compute contributions, GPU and AI services, and related compute credits remain roadmap concepts. The solo developer says the project builds on MIT-licensed Tera software, was developed with substantial AI assistance, and received multi-method review using several AI models; the review was not an outside security certification.

### Source excerpt

One developer, heavy AI assistance and multi-model review: an MIT-licensed Layer-1 that mines on ordinary PCs, with zero fees and a dApp engine.

[Next page](<https://devfeed.tech/topics/blockchain.md?cursor=WyIyMDI2LTExLTA1VDA3OjA0OjI2KzAwOjAwIiwgIjVhYTljZjgzLTczNzUtNGFjYS1iOTE3LTAyMmRhZjYwMWFiNyJd>)