{"id":"62eec600-dcf8-427d-83df-ba6736e47e97","arxiv_id":"2508.12138","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":3.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"Proposes replacing PoW with centrally verified ML training and a weighted lottery, but the manuscript body is an unrelated math paper.","lead":"This preprint claims to replace Bitcoin's proof-of-work with a cloud-based system where miners train machine learning models, and a weighted lottery awards block-writing rights. The abstract promises an architecture, but the body of the paper is an unrelated mathematics manuscript, so the claims have no supporting analysis.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The submitted full text is a different paper on fractional Laplacians; the blockchain claims exist only in the abstract, leaving every security assumption unverified.","rationale":"The reader identified the weakest assumption as the absence of any mechanism or security argument for the claimed training-verified PoW substitute. My reading confirms this: the abstract claims a hybrid architecture with central-server verification, privacy, weighted lottery, and digital certificates, but the provided full text is an unrelated mathematics paper on fractional Laplacians. There is no design, no threat model, no protocol specification, and no security proof. The strongest technical claim—that the certificate is a 'verifiable substitute for PoW' preserving blockchain integrity—is therefore completely unsupported by the submitted document. This is not a disagreement with current consensus; it is a direct observation that the claimed content does not appear in the manuscript. The correct verdict is UNVERDICTED because there is insufficient material to evaluate soundness, novelty, or security. I agree with the reader's assessment and see no basis to move the verdict.","tokens_in":6102,"tokens_out":1818,"duration_ms":20564,"concrete_test":"Obtain the actual full manuscript submitted to arXiv:2508.12138 (not the pasted text from a different paper) and search the body for 'lottery', 'certificate', 'parameter', 'loss', 'miner', 'signature', 'verify', and 'adversary'. If the body never defines a verification protocol, threat model, or consensus argument, the abstract's 'verifiable substitute for PoW' claim is unsupported. Also cross-check the PDF title page and arXiv metadata against the abstract; if the full text remains the fractional Laplacian paper, the record is a metadata/full-text mismatch and the verdict stays UNVERDICTED.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The paper's central claim—that training-verified collaborative computation can substitute PoW and preserve blockchain integrity—requires at least: (1) a mechanism for a central server to verify claimed training (parameters trained, loss reduction) without revealing private data; (2) a threat model; (3) a proof that the weighted lottery, certificate, and signature scheme resist adversarial miners; and (4) a consensus protocol showing that the certificate alone grants the right to append a valid block. None of these appears in the full text, which is a mathematics paper, 'Hölder extension for fractional Laplacian', with no connection to the abstract. The abstract contains assertions only, not arguments. Because the actual manuscript provides no design, security analysis, or formal verification, the load-bearing premise—that such a system can be built and secured—is entirely unsupported. This is not an internal inconsistency; it is an absence of the claimed content. Consequently, no technical objection to the architecture can even be formulated, but the paper cannot be accepted as a research preprint on the claimed topic.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The submitted manuscript consists of an abstract claiming a new blockchain consensus mechanism—replacing Proof of Work with a centralized cloud-based collaborative machine-learning training framework—and a full text titled \"Hölder Extension for Fractional Laplacian,\" a mathematics paper on boundary regularity for fractional harmonic functions. The abstract describes miners training horizontal slices of models on private data, a central server measuring parameters trained and loss reduction, a weighted lottery selecting a winner, and a digitally signed certificate that \"grants the right to append a block to the blockchain.\" The full text contains no blockchain content whatsoever: no description of the training protocol, no certificate scheme, no consensus rules, no threat model, no security proof, and no analysis of adversarial miners. The paper's central claim is therefore entirely unsupported by the body of the manuscript.","tokens_in":6329,"tokens_out":1716,"duration_ms":21945,"significance":"If the proposed architecture were developed rigorously, it could address a real concern about PoW energy consumption. However, the manuscript provides no mechanism, no implementation, no formal statement, and no security analysis. The abstract's assertions are not backed by any derivation or experiment. There are no machine-checked proofs, no reproducible code, and no falsifiable predictions in the submitted text. As a research contribution on the claimed topic, the paper has no evident technical content; the mathematical results in the full text, even if correct, are unrelated to the abstract's claims.","major_comments":[{"comment":"The full text is a mathematical paper on the Hölder extension for the fractional Laplacian, with Sections 1–6 and references entirely about potential theory and PDE. It contains no mention of blockchain, proof of work, training, certificates, lottery, or consensus. The central claim of the abstract—that a training-verified certificate can substitute for PoW while preserving blockchain integrity—is thus asserted without any supporting design or analysis.","section":"Abstract and full-text mismatch"},{"comment":"The proposed architecture depends on a central server evaluating 'number of parameters trained' and 'reduction in model loss,' yet no mechanism is given for verifying these metrics without access to private data, nor is any error or incentive analysis provided. An adversary could report arbitrary training progress, and the abstract does not explain how the server's evaluation is sound or how the weighted lottery and certificate prevent double-spending or block-withholding attacks. These are load-bearing gaps.","section":"Abstract, lines 4–9"},{"comment":"The claim that the certificate 'grants the right to append a block' is unsupported. There is no consensus protocol describing how other miners validate the certificate, no rule for resolving forks, and no security argument showing that the certificate cannot be forged or reused. The statement that SHA-256 hashing and digital signatures 'preserve blockchain integrity' is a non sequitur without a formal protocol.","section":"Abstract, lines 9–11"},{"comment":"The system places trust in a central server that both evaluates training and issues the certificate, which contradicts the decentralization premise of blockchain consensus. No argument is provided to show that this trust assumption is acceptable or that it does not simply reduce the system to a permissioned ledger. This circularity—where the same authority certifies work and authorizes block appends—is not addressed anywhere in the manuscript.","section":"Abstract, centralized server role"}],"minor_comments":[{"comment":"The title 'Substituting Proof of Work in Blockchain with Training-Verified Collaborative Model Computation' does not match the full text, which is titled 'Hölder Extension for Fractional Laplacian.'","section":"Title"},{"comment":"The abstract cites blockchain and machine-learning references (e.g., [devries2018bitcoin], [truby2018decarbonizing], [li2017securing], [nakamoto2008bitcoin], [nist2015sha]) that do not appear in the bibliographic list of the full text; the bibliography contains only mathematics references.","section":"References"},{"comment":"Key terms such as 'training-verified certificate,' 'collaborative model computation,' 'weighted lottery,' and 'preprocessed datasets' are not defined anywhere in the manuscript.","section":"Terminology"},{"comment":"The manuscript does not compare the proposed approach with existing alternatives to PoW such as proof-of-stake, proof-of-burn, or verifiable delay functions, even at the level of the abstract.","section":"Related work"}],"recommendation":"reject","confidential_remarks":"This is not a case of a promising idea with incomplete proof; the submitted full text is a completely different paper. The blockchain content exists only in the abstract, and the mathematical body has no connection to the stated topic. The absence of any technical content on the claimed subject is a fundamental mismatch that cannot be fixed by minor revision. I recommend rejection, with a suggestion that the authors resubmit if they have a complete manuscript on the blockchain proposal."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Here's the short version: the manuscript is not a paper about blockchain. The abstract describes a centralized 'training-verified' scheme meant to replace Bitcoin's PoW, but the full text is a mathematics paper, 'Hölder Extension for Fractional Laplacian' by Feng Li, with no connection to the abstract. So there is no technical content in the submission supporting the blockchain claims.\n\nThe abstract does touch a real problem—Bitcoin's energy use—and the idea of redirecting mining compute to ML training is a legitimate research direction. But the claimed solution is listed only as assertions: a central server that verifies training by 'number of parameters trained' and 'loss reduction,' then issues a certificate that grants block rights. None of that is defined or defended. There is no mechanism for verifying training without releasing private data, no threat model, no analysis of how an adversarial miner might game the loss metric or the weighted lottery, and no consensus protocol showing how the certificate works with the rest of the chain.\n\nThe deeper issue is the manuscript itself. The body has no relation to the abstract. So every security property is not merely under-argued; it's absent. The reader's verdict of UNVERDICTED is right; the stress-test note is also right that no technical objection can be formulated because the content is missing.\n\nWhere credit is due: the math paper is presumably a real contribution in its own field. But as a submission to cs.CR, it's a different document. The abstract also doesn't cite prior proof-of-useful-work literature, so even as a position statement it undersells its own context.\n\nThe centralization concern the reader flags is real: the trusted server evaluates the work, issues the certificate, and the certificate is the ticket to append a block. That's not proof-of-work; it's proof-of-trust-in-the-server. The paper would need to show how the server doesn't become a single point of failure or control, and it doesn't.\n\nBottom line: desk reject. Sending this to referees would waste their time. If the authors actually intend the blockchain idea, they need to write the actual paper—specification, threat model, and security argument. If the math paper is what they meant to submit, it's misfiled.","headline":"The submission is an abstract about a centralized PoW replacement stapled to an unrelated math paper on fractional Laplacians, so the blockchain claims are unsupported and the preprint is incoherent.","tokens_in":6768,"tokens_out":2608,"would_cite":false,"duration_ms":30476,"reading_group":"no","serious_thinker":"no","would_accept_peer_review":false},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper claims that blockchain consensus can be secured by measured machine-learning training work, certified by a central server, instead of proof-of-work hash puzzles.","keywords":["proof of work","blockchain","collaborative machine learning","weighted lottery","certificate","SHA-256","energy efficiency","privacy-preserving training"],"falsifier":"Build a small test chain with the proposed server; have one miner honestly train on the provided dataset and another submit random or copied updates. If the server cannot reliably distinguish the honest contribution by loss reduction and parameter count—or if the dishonest miner can obtain a valid certificate—the substitution fails. Alternatively, check whether a certificate can be verified without trusting the central server; if not, the system has reintroduced a trusted party, which is exactly what proof-of-work avoided.","tokens_in":6020,"feed_emoji":"⛏️","tokens_out":7021,"duration_ms":76149,"temperature":0.7,"pith_summary":"The paper proposes replacing Bitcoin-style proof-of-work with a hybrid system in which miners compete by training segments of machine-learning models. A central server measures each miner's contribution—number of parameters trained and reduction in model loss—and at the end of each training cycle runs a weighted lottery. The winner receives a digitally signed certificate that serves as the proof-of-work substitute and grants the right to append the next block. If the scheme works, blockchain mining energy would be redirected toward useful computation rather than hash puzzles.","feed_headline":"ML training replaces hash puzzles in blockchain mining","feed_subtitle":"A signed certificate for measured training effort could let miners do useful work instead of burning electricity.","key_machinery":"The training-verified certificate: a digitally signed record, issued by the central server, attesting that a miner trained a stated number of model parameters and achieved a stated loss reduction during a collaborative training cycle. The certificate functions like a PoW nonce—it is the token that enters the weighted lottery and authorizes appending a block.","core_discovery":"The paper's central claim is that a verifiable certificate of measured machine-learning training effort can substitute for the cryptographic proof-of-work puzzle. The protocol is cyclic: horizontally scaled model segments are trained on preprocessed data; the server scores miners by parameters trained and loss drop; a weighted lottery selects a block appender; digital signatures and SHA-256 keep the chain intact. The authors assert this preserves blockchain integrity while removing proof-of-work's energy waste.","pith_inferences":["A concrete protocol for the server to verify parameter counts and loss reductions without trusting miners is not specified, which leaves the substitution claim open to testing.","Reintroducing a central server means the security guarantee is no longer the trustless property of proof-of-work; a realistic assessment would need to consider what the central server can be bribed or coerced into doing.","A Sybil attack—one miner faking multiple training identities to inflate lottery weight—would be a natural failure mode, and the abstract provides no defense against it.","If the verification gap can be closed, the same signed-certificate structure could be applied to other useful computations, such as scientific simulation or rendering, as proof-of-work replacements."],"forward_implications":["Miners' computational work becomes reusable: energy spent on training advances an ML model.","The weighted lottery replaces the hash puzzle as the block-selection mechanism.","Blockchain integrity would rest on digital signatures and SHA-256 hashing rather than on solving hash puzzles.","A central server becomes a trusted authority for measuring work, changing the trust model from fully decentralized to hybrid.","The design enables privacy-preserving collaborative training as part of the consensus process."],"supporting_citations":[{"why":"Documents Bitcoin's energy consumption, the problem the proposed replacement addresses.","marker":"de Vries 2018"},{"why":"Discusses decarbonizing cryptoassets, supporting the motivation to redirect mining energy.","marker":"Truby 2018"},{"why":"Supplies the privacy-preserving collaborative training framework that miners would use.","marker":"Li et al. 2017"},{"why":"Defines the proof-of-work blockchain that the proposed certificate is intended to substitute for.","marker":"Nakamoto 2008"},{"why":"Provides the SHA-256 standard used to preserve blockchain integrity in the proposed design.","marker":"NIST 2015"}],"fun_headline_variants":["Mining blocks by training models, not hashes","Blockchain mining gets greener with ML training","Train a model, append a block: new consensus","Proof-of-work replaced by proof-of-training","ML training becomes the new mining puzzle"],"cache_read_input_tokens":2816,"weakest_assumption_plain":"The central server can correctly and irreversibly verify that a miner trained the claimed number of parameters and achieved the reported loss reduction, all while preserving privacy, and that the resulting certificate, lottery, and signature scheme are secure against adversarial miners.","fun_headline_variants_meta":{"raw":{"variants":["Mining blocks by training models, not hashes","Blockchain mining gets greener with ML training","Train a model, append a block: new consensus","Proof-of-work replaced by proof-of-training","ML training becomes the new mining puzzle"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000559,"raw_usage":{"total_tokens":2464,"prompt_tokens":684,"completion_tokens":1780,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":428,"completion_tokens_details":{"reasoning_tokens":1725}},"tokens_in":428,"tokens_out":1780,"duration_ms":12723,"temperature":1.0,"reasoning_tokens":1725,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-05T19:33:41.673480+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Build a small test chain with the proposed server; have one miner honestly train on the provided dataset and another submit random or copied updates. If the server cannot reliably distinguish the honest contribution by loss reduction and parameter count—or if the dishonest miner can obtain a valid certificate—the substitution fails. Alternatively, check whether a certificate can be verified without trusting the central server; if not, the system has reintroduced a trusted party, which is exactly what proof-of-work avoided.","supporting_citations":[],"review_version":1}