Thursday, November 19, 2026
Science
No Result
View All Result
  • Login
  • HOME
  • SCIENCE NEWS
  • CONTACT US
  • HOME
  • SCIENCE NEWS
  • CONTACT US
No Result
View All Result
Scienmag
No Result
View All Result
Home Science News

Scribe Protocol Bridges Private Web2 Records to Blockchains Using Transparent STARKs

November 19, 2026
in Science News
Katie Riggs
By Katie Riggs Scienmag Editorial Profile - Quantum Physics
Reading Time: 6 mins read
0
Scribe Protocol Bridges Private Web2 Records to Blockchains Using Transparent STARKs

Scribe Protocol Bridges Private Web2 Records to Blockchains Using Transparent STARKs

65
SHARES
587
VIEWS
Share on FacebookShare on Twitter
ADVERTISEMENT

Decentralized applications frequently require verification of off-chain qualifications such as account status, financial standing, or membership tiers without exposing personal data or depending on customized signing APIs from Web2 providers. A research team led by Zhede Gu, Hushuang Zeng, Libing Qin, Shengsi Luo, Yuyan Chen, and Yongguang Yan has introduced Scribe, a distributed verification architecture designed to bridge TLS-derived Web2 evidence to decentralized systems. Published in Peer-to-Peer Networking and Applications, the protocol enables clients to extract private data from standard HTTPS interactions and prove compliance with decentralized application rules without disclosing raw underlying records, all while avoiding any operational alterations to existing Web2 web servers.

Conventional models for verifying off-chain attributes typically demand direct cryptographic signatures from Web2 providers or rely on centralized intermediaries. Because traditional platforms like banks or social networks rarely offer user-facing cryptographic signing interfaces for arbitrary claims, reliance on centralized attestation services often introduces single points of failure and risks exposing sensitive user information. Scribe addresses these bottlenecks by operating over standard Transport Layer Security sessions through a distributed workflow involving five primary participants: a client, an attestation node, an aggregator node, an unmodified Web2 server, and an on-chain smart contract anchor that records state updates.

The protocol begins when a client conducts an HTTPS session with a conventional Web2 server to receive an attribute such as a financial balance or membership credential. During this interaction, the client and an off-chain attestation node execute a provenance procedure based on DECO or TLSNotary protocols. This process verifies that the communication transcript originates from an authentic session with the targeted server without requiring the server to adopt new cryptographic methods. To guarantee deterministic extraction of the required data field, the protocol enforces standard canonicalization rules, adopting the RFC 8785 JSON Canonicalization Scheme for JSON payloads to maintain uniform key ordering, whitespace removal, and number serialization.

Once the relevant value is isolated, the attestation node generates a circuit-friendly digital signature over a Rescue hash commitment that securely binds the target application identifier, server identifier, extraction rule, extracted data value, and a private client salt. In the authors’ implementation, this attestation signature is instantiated using a Rescue-based hash signature operating natively over the STARK prime field. This design choice prevents the substantial algebraic overhead associated with emulating non-native elliptic curve arithmetic, such as EdDSA or ECDSA, which the researchers calculated would require thousands of additional rows within the algebraic intermediate representation.

Using the signed commitment, the client constructs a transparent zero-knowledge proof utilizing a STARK system based on Fast Reed-Solomon Interactive Oracle Proofs of Proximity. Inside the STARK circuit, constraints recompute the Rescue commitment, verify the attestation node’s signature, confirm that the secret value satisfies the target application’s predicate—such as demonstrating that a numerical attribute meets or exceeds a defined threshold—and compute an application-scoped spend tag, or nullifier. This spend tag is derived from a separate domain-separated Rescue hash incorporating the unique application identifier and the commitment, preventing replay attacks while maintaining default unlinkability across distinct decentralized applications.

To maintain scalability and overcome the computational limitations of blockchain environments, Scribe separates proof verification from on-chain state storage. Instead of submitting heavy cryptographic proofs directly to a blockchain, the client sends the STARK proof and spend tag to an off-chain aggregator node. The aggregator validates the STARK proof using an off-chain verification routine, checks the spend tag against an existing record to prevent duplicate claims, and incorporates accepted tags into a 32-level Merkle tree index. The aggregator then batches updates and transmits the updated Merkle root to the on-chain anchor contract.

To safeguard the long-term integrity of the on-chain anchor against emerging quantum threats, each batched root publication is authorized using a post-quantum digital signature scheme. Specifically, the aggregator signs the state root alongside batch and chain identifiers using Falcon-512 before transmitting the transaction. The on-chain contract verifies this Falcon signature prior to updating its recorded state root. This mechanism ensures quantum-resistant authenticity for the global nullifier state without imposing the gas costs of verifying complete zero-knowledge proofs directly inside the blockchain virtual machine.

The research team conducted extensive empirical evaluations on macOS using an Apple M4 Pro system with 24 gigabytes of memory. In benchmarks evaluating STARK performance across policy complexity scaling from 1 to 256 repeated policy checks, proving times increased from 6 milliseconds to 346 milliseconds, while off-chain verification took between 0.4 milliseconds and 9.7 milliseconds. Generated proof sizes ranged from 32.1 kilobytes to 77.8 kilobytes, remaining below 100 kilobytes across all configurations. Prover times exhibited a staircase pattern corresponding to powers of two in the execution trace length, as underlying Fast Fourier Transforms and polynomial commitments depend on padded power-of-two trace boundaries rather than unpadded constraint counts.

In complementary benchmarks, testing the TLSNotary provenance workflow yielded an average of 856 milliseconds for proving and 749 milliseconds for verification. For the aggregator pipeline operating with four threads, batching spend tags from sizes of 1 to 1024 reduced median amortized processing time per user from 1.10 milliseconds down to 0.31 milliseconds, with Merkle tree updates accounting for the primary share of computational runtime while Falcon signing overhead remained essentially constant. Peak resident set size memory consumption for the aggregator remained minimal, measuring between approximately 2 megabytes and 5.03 megabytes across tested batch sizes.

On-chain gas costs were benchmarked on the Ethereum Sepolia testnet using the ETHFALCON pure Solidity implementation, which executes Falcon verification via inline assembly with NTT polynomial multiplication over 256-bit words. When comparing a root-only update mode against an explicit per-tag registration mode across batch sizes up to 512, the root-only publication maintained a nearly flat gas consumption of approximately 1.50 million gas per transaction, bringing amortized cost per user down to 2,929 gas. In contrast, per-tag processing scaled linearly, demanding 13.1 million total gas and an average of 25,521 gas per user at a batch size of 512.

The researchers note several operational trust bounds and design boundaries inherent to the system model. Because cryptographic methods cannot detect whether an attestation node signs data without running an authentic TLS provenance session, the authors suggest mitigating single-node risks through threshold multi-party signing, hardware-isolated trusted execution environments, or economic staking mechanisms. Furthermore, while the protocol guarantees replay resistance for a specific commitment, enforcing one-time eligibility per real-world Web2 account requires binding unique account identifiers via specific extraction rules, presenting practical avenues for future standardization across varied Web2 data formats.

Beyond evaluating cryptographic runtimes, the authors examined specific architectural failure modes, particularly those involving aggregator liveness and transaction submission delays. Because an aggregator could potentially delay root publications or censor individual client requests, the framework outlines operational fallbacks that preserve system responsiveness without sacrificing integrity. A primary fallback mechanism introduces a time-locked direct submission channel within the on-chain anchor contract, permitting clients to submit their zero-knowledge proofs and spend tags directly to the blockchain if the aggregator fails to publish a root within a preconfigured window. Additionally, decentralized deployments can incorporate multi-aggregator networks where multiple independent operators propose candidate state root updates, or require aggregators to maintain publicly verifiable logs to prove that valid client requests are not excluded from subsequent batching cycles.

The benchmark analysis also contextualizes on-chain verification trade-offs associated with deploying quantum-resistant primitives within the Ethereum Virtual Machine. In the evaluation of ETHFALCON, which relies on compacted field polynomial representations of sixteen coefficients per 256-bit machine word and replaces standard SHAKE functions with EVM-native keccak256 hashes, the researchers observed that decompressing keys from standard NIST encodings would introduce roughly 900,000 gas of additional overhead. Consequently, while constant-cost root publication maintains practical feasibility on Sepolia, the authors highlight proposed network upgrades, such as the EIP-8052 precompile for number theoretic transforms, which could offload dominant polynomial arithmetic to native execution environments and further compress baseline verification gas.

Looking toward broader decentralized applications, the authors identify several development targets required for multi-attribute verification. While the current prototype evaluates compliance using single-attribute numerical thresholds through 16-bit decomposition chains, production platforms such as automated credit assessments, regulatory age verification, and privacy-preserving token distributions necessitate handling complex predicate structures. Future investigations aim to formalize standardized canonicalization procedures across varied data serialization formats beyond JSON, while analyzing post-quantum-secure attestation signatures that execute efficiently inside transparent arithmetic intermediate representations.

Subject of Research: Private Web2-to-Web3 eligibility proofs using transparent STARKs and post-quantum signatures

Article Title: Scribe: Private Web2-to-Web3 eligibility proofs for decentralized applications with transparent STARKs

Article References: Gu, Z., Zeng, H., Qin, L., Luo, S., Chen, Y., & Yan, Y. (2026). Scribe: Private Web2-to-Web3 eligibility proofs for decentralized applications with transparent STARKs. Peer-to-Peer Networking and Applications, 19(5), Article 133. https://doi.org/10.1007/s12083-026-02246-2

Image Credits: AI Generated

DOI: 10.1007/s12083-026-02246-2

Keywords: Scribe, zero-knowledge proofs, STARKs, TLS provenance, DECO, TLSNotary, Rescue hash, Falcon signature, post-quantum cryptography, decentralized applications, web3, nullifiers, spend tags, Merkle trees, ETHFALCON, smart contracts, selective disclosure, Winterfell

Cite Scienmag News

Katie Riggs. (November 19, 2026). Scribe Protocol Bridges Private Web2 Records to Blockchains Using Transparent STARKs. Scienmag. https://scienmag.com/scribe-protocol-bridges-private-web2-records-to-blockchains-using-transparent-starks/

Katie Riggs. "Scribe Protocol Bridges Private Web2 Records to Blockchains Using Transparent STARKs." Scienmag, 19 November 2026, https://scienmag.com/scribe-protocol-bridges-private-web2-records-to-blockchains-using-transparent-starks/. Accessed 19 November 2026.

Katie Riggs. "Scribe Protocol Bridges Private Web2 Records to Blockchains Using Transparent STARKs." Scienmag. November 19, 2026. https://scienmag.com/scribe-protocol-bridges-private-web2-records-to-blockchains-using-transparent-starks/

Tags: decentralized applicationsDECOETHFALCONFalcon signatureMerkle treesnullifierspost-quantum cryptographyRescue hashScribeselective disclosuresmart contractsspend tagsSTARKsTLS provenanceTLSNotaryWeb3Winterfellzero-knowledge proofs
Share26Tweet16
Previous Post

Air Pollution Exposure Worsens Acute Lung Injury in Mice Lacking NLRX1

Next Post

Feasibility Trial Supports Registry-Based Tailored Follow-Up Service for Stroke

Related Posts

Random Forest Machine Learning Predicts Unwanted Pregnancy Risk in India
Science News

Random Forest Machine Learning Predicts Unwanted Pregnancy Risk in India

November 19, 2026
Fumarate Hydratase Kidney Cancer Risk Lower Than Historical Estimates, Study Finds
Cancer

Fumarate Hydratase Kidney Cancer Risk Lower Than Historical Estimates, Study Finds

November 19, 2026
Exact Lump and Breather Solutions Derived for Generalized Kadomtsev-Petviashvili Equation
Science News

Exact Lump and Breather Solutions Derived for Generalized Kadomtsev-Petviashvili Equation

November 19, 2026
Engineered CAR Natural Killer Cells Target Mesothelin in Ovarian Cancer Models
Medicine

Engineered CAR Natural Killer Cells Target Mesothelin in Ovarian Cancer Models

November 19, 2026
Industrial Winemaking Enzyme Cocktail Enables High Efficiency Genetic Transformation in Medicinal Mushrooms
Biotechnology

Industrial Winemaking Enzyme Cocktail Enables High Efficiency Genetic Transformation in Medicinal Mushrooms

November 19, 2026
Infantile Case Report Links Novel NAXE Gene Variant to Fatal Encephalopathy
Medicine

Infantile Case Report Links Novel NAXE Gene Variant to Fatal Encephalopathy

November 19, 2026
Next Post
Feasibility Trial Supports Registry-Based Tailored Follow-Up Service for Stroke

Feasibility Trial Supports Registry-Based Tailored Follow-Up Service for Stroke

  • Mothers who receive childcare support from maternal grandparents show more optimized

    Mothers who receive childcare support from maternal grandparents show more parental warmth, finds NTU Singapore study

    27656 shares
    Share 11059 Tweet 6912
  • University of Seville Breaks 120-Year-Old Mystery, Revises a Key Einstein Concept

    1061 shares
    Share 424 Tweet 265
  • Bee body mass, pathogens and local climate influence heat tolerance

    682 shares
    Share 273 Tweet 171
  • Researchers record first-ever images and data of a shark experiencing a boat strike

    546 shares
    Share 218 Tweet 137
  • Groundbreaking Clinical Trial Reveals Lubiprostone Enhances Kidney Function

    531 shares
    Share 212 Tweet 133
Science

Embark on a thrilling journey of discovery with Scienmag.com—your ultimate source for cutting-edge breakthroughs. Immerse yourself in a world where curiosity knows no limits and tomorrow’s possibilities become today’s reality!

RECENT NEWS

  • Random Forest Machine Learning Predicts Unwanted Pregnancy Risk in India
  • Fumarate Hydratase Kidney Cancer Risk Lower Than Historical Estimates, Study Finds
  • Exact Lump and Breather Solutions Derived for Generalized Kadomtsev-Petviashvili Equation
  • Engineered CAR Natural Killer Cells Target Mesothelin in Ovarian Cancer Models

Categories

  • Agriculture
  • Anthropology
  • Archaeology
  • Athmospheric
  • Biology
  • Biotechnology
  • Blog
  • Bussines
  • Cancer
  • Chemistry
  • Climate
  • Earth Science
  • Editorial Policy
  • Marine
  • Mathematics
  • Medicine
  • Pediatry
  • Policy
  • Psychology & Psychiatry
  • Science Education
  • Science News
  • Social Science
  • Space
  • Technology and Engineering

Subscribe to Blog via Email

Enter your email address to subscribe to this blog and receive notifications of new posts by email.

Join 5,151 other subscribers

© 2026 Scienmag - Science Magazine

Welcome Back!

Login to your account below

Forgotten Password?

Retrieve your password

Please enter your username or email address to reset your password.

Log In
No Result
View All Result
  • HOME
  • SCIENCE NEWS
  • CONTACT US

© 2026 Scienmag - Science Magazine

Discover more from Science

Subscribe now to keep reading and get access to the full archive.

Continue reading