Zero-knowledge machine learning models for blockchain peer-to-peer energy trading
Bibliographic record
Abstract
Blockchain-based peer-to-peer energy trading enables individuals to directly share renewable energy using Internet of Things technologies. However, it faces significant challenges related to privacy, scalability, and the integration of advanced artificial intelligence. To address these issues, this article proposes zkPET, a secure and intelligent peer-to-peer energy trading framework. zkPET integrates machine learning and blockchain with advanced cryptographic techniques of zero-knowledge machine learning to protect user data while enabling intelligent decision making. In the zkPET framework, the computationally intensive operations of various machine learning models are executed off-chain, and only succinct cryptographic proofs of these computations are uploaded to the blockchain for verification and recording. In addition, a time-series clustering approach is incorporated into federated learning to enhance both inference accuracy and the efficiency of proof generation. Experimental validation using the zero-knowledge proof tool EZKL and a real-world electricity dataset demonstrates the feasibility and effectiveness of zkPET. The results underscore its potential to significantly improve privacy, scalability, and computational efficiency in decentralized energy trading, contributing to the advancement of secure and intelligent energy markets.
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.004 | 0.020 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.003 |
| Scholarly communication | 0.002 | 0.004 |
| Open science | 0.002 | 0.003 |
| Research integrity | 0.002 | 0.003 |
| Insufficient payload (model declined to judge) | 0.007 | 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".