Proof Without Exposure: High-Throughput Blockchain Transactions Via Privacy-Preserving Layer-2 Aggregation
Bibliographic record
Abstract
Blockchain has emerged as a promising technology for enabling decentralized, tamper-evident, and auditable data sharing among multiple untrusted parties. However, practical deployments in distributed computing environments face a persistent trade-off between scalability and privacy. Public blockchain networks often expose transactional metadata, compromising confidentiality, while privacy-preserving blockchains—such as those leveraging zero- knowledge proofs (ZKPs)—typically suffer from reduced throughput and increased latency due to the computational overhead of proof generation and verification. Similarly, scalability-enhancing techniques like Layer- 2 rollups, sharding, and state channels often provide minimal privacy guarantees, leaving sensitive metadata vulnerable to inference attacks. This paper proposes a privacy-preserving and scalable blockchain architecture designed specifically for secure data sharing in distributed systems, such as federated cloud platforms, healthcare data networks, IoT ecosystems, and inter-bank settlements. The architecture integrates Layer-2 zero- knowledge rollups with a modular Layer-1 settlement layer (Ethereum or Hyperledger Fabric), decentralized storage (IPFS/Filecoin), and fine-grained access control mechanisms. By batching transactions off-chain, generating succinct ZK proofs for validity, and committing only aggregate proofs and state roots to the base chain, the system achieves both confidentiality and high throughput. The architecture is deployed in a Kubernetes-orchestrated environment, enabling horizontal scaling, automated failover, and comprehensive observability through Prometheus, Grafana, and Jaeger. A prototype implementation demonstrates a throughput improvement of up to$5.8 \times$over baseline privacypreserving blockchains, with latency remaining within acceptable limits for distributed applications. Our evaluation framework compares the proposed design against three baselines— Layer-1 only, Layer-1 + privacy, and Layer- 1 + scalability—and includes metrics such as throughput, latency, cost, privacy efficacy, and fault tolerance. The results indicate that combining privacy-preserving Cryptography with scalable rollup architectures is both feasible and beneficial for real-world distributed systems, offering a compelling pathway toward secure, high-performance blockchain applications.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.007 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.004 |
| Open science | 0.001 | 0.005 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.005 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".