{"id":"179eac61-a224-4933-b37d-6b9df4339f20","arxiv_id":"2501.05535","paper_version":1,"verdict":"REJECT","confidence":"HIGH","novelty_score":4.0,"correctness_risk":"high","formal_verification":"none","parameter_count":0,"one_line_summary":"This paper claims any additive-noise differential privacy mechanism can guarantee fair ordering in blockchain systems, a reduction that is stated but not rigorously proven.","lead":"The paper proposes using differential privacy to make blockchain transaction ordering fair by adding noise to transaction scores. It introduces a new fairness property, k-epsilon-Ordering Equality, but the main proof is flawed and the second theorem is unproven.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 1's proof is invalid: the key inequality replaces one DP term without justification and mislabels the summed products, so DP closeness alone does not establish ε-Ordering Equality; the abstract's 'any DP mechanism' claim is false.","rationale":"The paper's central claim is the DP-to-fair-ordering reduction: additive-noise DP mechanisms (Theorem 1) and group-privacy mechanisms (Theorem 2) guarantee (kε-)Ordering Equality. The most load-bearing point is whether the proof of Theorem 1 actually bridges the DP inequality to the pairwise-order inequality. It does not: the proof contains an undefined k, an unjustified factor replacement, and a misidentified sum. The same proof structure would apply to any ε-DP mechanism, but a simple Gaussian-mixture mechanism that is ε-DP with ε=ln1.5 yields an ordering ratio of 2.25=e^{2ε}, so the proof cannot be sound. This matches the reader's finding that the derivation is flawed, though the reader's identified weakest assumption was the additive-score/lambda assumption rather than the proof step itself, hence partial agreement. The paper might be salvageable with a corrected proof for a restricted noise class, but as written the central result is not supported; the reader's REJECT verdict remains appropriate.","tokens_in":7814,"tokens_out":33401,"duration_ms":337865,"concrete_test":"Re-derive the §5.1 proof with k explicitly set to the comparator 1[s<s′] and uniform random tie-breaking, using only the two pointwise DP bounds. Then run the check: instantiate the proof's hypotheses with the two Gaussian-mixture mechanisms P=0.6N(0,σ)+0.4N(1,σ), Q=0.4N(0,σ)+0.6N(1,σ) and compute Pr[r≺r′]/Pr[r′≺r] as σ→0. If the ratio approaches e^{2ε} while the DP hypotheses hold, the proof is invalid; if the ratio stays ≤e^ε, identify the extra additive-noise property the proof implicitly uses and add it to the theorem.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central reduction (Theorem 1, §5.1) is not established. The proof introduces an undefined constant k and, for each s,s′, replaces Pr[A(score(r′))=s′] with Pr[A(score(r))=s′] while bounding only Pr[A(score(r))=s] ≤ e^ε Pr[A(score(r′))=s]; the second factor has no matching bound, so the product inequality is unjustified. With the natural reading k=1[s<s′] and random tie-breaking, the proof still identifies two different sums, Σ_{s<s′} and Σ_{s′<s}, as equal—exactly the ordering probability being bounded. Moreover, the proof uses only the pointwise ε-DP closeness of the two marginal score distributions, not the additive-noise structure. That hypothesis alone is insufficient: for adjacent requests, take M with output densities P=0.6N(0,σ)+0.4N(1,σ) and Q=0.4N(0,σ)+0.6N(1,σ); these are ε-DP with ε=ln1.5, yet as σ→0, Pr[r≺r′]/Pr[r′≺r]→2.25=e^{2ε}. Thus any argument from DP closeness alone cannot be right. Theorem 2 is stated without proof, and the abstract's 'any DP mechanism' is unsupported by the formal additive-noise statement.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes a generalization of Zhang et al.'s epsilon-Ordering Equality, called k-epsilon-Ordering Equality, which is intended to apply to arbitrary relevant features and to degrade gracefully as relevant features diverge. The central technical claim is a connection to differential privacy: the authors state that any additive-noise differential privacy mechanism, applied to a score of the form score(r) = r.relev + r.eta with sensitivity lambda, guarantees the fairness property. Theorem 1 (Section 5.1) asserts this for adjacent requests, and Theorem 2 (Section 5.2) asserts an analogous k-epsilon bound for non-identical relevant features, invoking group privacy. The paper also sketches applications to miner fees and transaction issuance time. The main formal contribution, however, is not established: the proof of Theorem 1 is invalid, and Theorem 2 is stated without proof.","tokens_in":8079,"tokens_out":10424,"duration_ms":98048,"significance":"If the central theorem were correct, the paper would offer an interesting bridge between differential privacy and fair transaction ordering, and the proposed k-epsilon-Ordering Equality could be a useful refinement of prior fairness notions. The paper also has the merit of making its assumptions explicit (Assumption 1), and the application discussion identifies concrete scenarios with additive scores. However, because the main proof fails and the second theorem is unproved, the paper's principal claim is currently unsupported. The 'surprising link' is also weakened by the fact that the fairness definition is intentionally modeled on the DP inequality, so the resemblance is in part a matter of definitional choice rather than an independent discovery.","major_comments":[{"comment":"The proof of Theorem 1 is invalid. The summation over s,s' introduces an undefined constant k, and the inequality step replaces Pr[A(score(r))=s] with Pr[A(score(r'))=s] and Pr[A(score(r'))=s'] with e^epsilon Pr[A(score(r))=s'] in a manner that requires the pointwise assumption Pr[A(score(r))=s] <= Pr[A(score(r'))=s] to hold for every output s. But if that inequality holds for all s, then both distributions must be identical, since both sum to 1; conversely, if it holds only for a single s, it cannot be used in the summation over all s,s'. Thus the derivation of Pr[r ≺ r'] <= e^epsilon Pr[r' ≺ r] is not justified, and the 'by symmetry' remark does not repair the gap.","section":"§5.1, Theorem 1 proof"},{"comment":"The proof uses only the pointwise epsilon-DP closeness of the two marginal distributions Pr[A(score(r))] and Pr[A(score(r'))]; it never uses the additive-noise structure or the independence of the noise draws for the two requests. The theorem statement specifically assumes an additive-noise DP mechanism, but the argument would apply equally to any mechanism whose output distributions on adjacent inputs are epsilon-DP. This is a load-bearing omission: if the intended result relies on properties of additive noise (e.g., independent, identically distributed noise), those properties must appear explicitly in the proof. As written, the theorem is not established.","section":"§5.1, Theorem 1 assumptions"},{"comment":"Theorem 2 is stated without proof. The sentence 'Using similar proof techniques as in §5.1, we prove that group privacy ensures the preservation of order fairness' is not a proof, and given the defect in Theorem 1's proof, the claimed implication is unsupported. In addition, the parameter k = |score(r)-score(r')|/lambda in Definition 5 does not correspond to the group size in group privacy: lambda is the maximum noise difference between adjacent requests, not a scale for differences in relevant features between non-adjacent requests. Therefore the asserted correspondence with group privacy is not justified.","section":"§5.2, Theorem 2"},{"comment":"The abstract and introduction claim that 'any DP mechanism can be used to ensure fairness in SMR,' but the formal theorem is restricted to additive-noise DP mechanisms applied to an additive score with a known sensitivity lambda. This overstates the formal result. The authors should either prove the general claim or revise the abstract to match the theorem's actual assumptions.","section":"Abstract and Theorem 1 statement"}],"minor_comments":[{"comment":"The symbol r ∼ r' is used for both adjacent requests in fair ordering and neighboring datasets in differential privacy; this overloaded notation is confusing and should use distinct symbols.","section":"§2/§4"},{"comment":"Definition 1 quotes Zhang et al.'s property with an unspecified function f(epsilon); since f is never defined, the definition is incomplete as presented.","section":"Definition 1"},{"comment":"The phrase 'for some fixed s ∈ A(score(r))' is imprecise: A(score(r)) is a distribution, not a set of outputs, and the DP inequality applies to every output s in the range of A, not to a single fixed element.","section":"§5.1"},{"comment":"The claim that 'Companies like Google and Apple use epsilon ≈ 2 in DP' lacks a citation; please provide a reference.","section":"§5.3"},{"comment":"In the miner-fee application, the assumption that client fees are significantly higher than bribes is informal; it is unclear how this assumption instantiates the bounded-noise parameter lambda in Assumption 1.","section":"§6"},{"comment":"The wording 'D is applied to A' is ambiguous; the paper should state explicitly how the order is produced from the noisy scores and whether the two requests' noise draws are independent.","section":"Theorem 1 statement"}],"recommendation":"reject","confidential_remarks":"The paper's central theorem is unproved, and the defect is not a local fix: the proof's logic requires an impossible pointwise assumption, and the remaining argument does not use the additive-noise hypothesis. The second theorem is merely asserted. These issues place the paper below the bar for publication in its current form. The 'surprising link' is also partly by construction, since the fairness definition is explicitly modeled on the DP inequality; this further reduces the novelty. I would advise the editor that rejection is appropriate, though the authors might be encouraged to rewrite the proofs and resubmit if they can establish the claimed implication under the stated assumptions."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Colleague,\n\nThe paper's core claim—that differential privacy mechanisms guarantee fair ordering—is not established by the text. Theorem 1's proof (Section 5.1) has an invalid inequality: for each pair of scores, it replaces both probability factors using the DP bound but multiplies by only one e^ε. The stress-test counterexample shows why this matters: DP closeness alone only gives e^{2ε} between the two ordering probabilities, not e^ε, and the proof never uses the additive-noise structure it claims to rely on. The abstract's 'any DP mechanism' is also an overstatement—the theorem is limited to additive noise.\n\nWhat's genuinely new: the paper extends Zhang et al.'s ε-Ordering Equality to arbitrary relevant features and a multiplicative bound, introduces kε-Ordering Equality for non-identical features, and frames the whole thing as a privacy problem. Those definitions are clean and the motivation is clear. The writing is honest about the prior work, and the connection to group privacy for the kε case is a nice observation. The related work section is accurate.\n\nThe soft spots are concentrated in the proof. Theorem 2 is stated without a proof, which matters because it's half the claimed contribution. The applications section (MEV, fees) is speculative and adds little. Assumption 1, bounding the noise, may be hard to verify in practice, but that's not a fatal issue for a theory paper.\n\nIf the proof can be repaired, this could be a decent short paper: the definitional work is useful, and the DP connection is worth stating carefully. But as written, the central result doesn't hold up. I'd send it to review anyway—the idea is novel enough, and the error is the kind that might be fixable—but the reviewers should be instructed to scrutinize the proof. Credit to the authors for a well-written paper, but the main theorem needs real work before it's citable.","headline":"A promising DP-fairness link, but the main proof has an invalid step; not acceptable as is.","tokens_in":8618,"tokens_out":3813,"would_cite":false,"duration_ms":35247,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"Any differential-privacy noise mechanism can enforce fair ordering in blockchain systems.","keywords":["Blockchain","Differential Privacy","Fair Ordering","State Machine Replication","Ordering Equality","Group Privacy","Miner Extractable Value"],"falsifier":"A concrete way to test the claim is to build an ordering server with controlled noise, fix λ, emit pairs of requests with identical relevant features whose noise terms differ by more than λ, and measure whether the probability of one ordering exceeds e^ε times the reverse; a violation would show the assumed bound is broken, while no violation under the bound would support the reduction. Because the theorem is conditional on Assumption 1, the more direct falsifier is any real system where scores are non-additive or λ is unbounded, since the mapping from fairness to DP no longer applies.","tokens_in":7609,"feed_emoji":"⚖️","tokens_out":5801,"duration_ms":56812,"temperature":0.7,"pith_summary":"This paper establishes that fair transaction ordering in blockchain-style state machine replication is the same mathematical problem as differential privacy. The authors define fairness as kε-Ordering Equality: any two requests r and r′ must satisfy Pr[r ≺ r′] ≤ $e^{{kε}}$ Pr[r′ ≺ r], where k is the normalized distance between their scores. They prove that if the ordering server scores a request as the sum of a relevant feature and an irrelevant noise term, then every additive-noise DP mechanism with sensitivity equal to the noise bound λ yields this property for identical features (ε-Ordering Equality) and, through group privacy, for similar features (kε-Ordering Equality). This matters because it lets protocol designers reuse mature DP mechanisms to suppress front-running, sandwich attacks, and fee/bribery manipulation, and it extends earlier equal-opportunity ordering from timestamps alone to arbitrary relevant features.","feed_headline":"Differential privacy noise can guarantee fair blockchain ordering","feed_subtitle":"Adding calibrated noise to transaction scores makes identical requests equally likely to be ordered first.","key_machinery":"The machinery is the additive score model score(r) = r.relev + r.η with the sensitivity bound λ = max_{r∼r′} ||r.η − r′.η||. This converts fairness into a sensitivity-calibrated DP question: changing a request's relevant feature changes the score by at most λ, so adding DP noise hides the irrelevant component exactly to the degree needed to equalize ordering chances. The derived parameter k = |score(r)−score(r′)|/λ then extends the guarantee to non-identical relevant features by invoking group privacy, which is the DP statement for databases at distance k.","core_discovery":"The central claim, stated as Theorem 1 and Theorem 2, is that privacy and fair ordering coincide under the additive score model. For any two requests with identical relevant features, ε-Ordering Equality is exactly the ε-DP inequality applied to the outputs of the ordering algorithm; for requests whose relevant features differ, the group-privacy version of DP gives the kε-Ordering Equality bound with k = |score(r)−score(r′)|/λ. The proof is a direct mapping: adjacent requests correspond to neighboring datasets, the sensitivity bound λ supplies the Δ(f) needed by additive-noise mechanisms, and the probability that one request is ordered before the other is a product of the mechanism's output distributions, so the DP ratio inequality transfers to the ordering probability ratio.","pith_inferences":["The paper leaves implicit that the reduction also suggests a converse: if fair ordering under the additive-score model is equivalent to DP, then any impossibility or lower bound for DP noise calibration transfers to fair ordering, which could guide protocol design.","A practical consequence the authors do not develop is that λ must be set by the protocol designer; if λ is estimated from observed delays or bribes rather than guaranteed, the fairness bound becomes probabilistic rather than absolute.","A natural testable extension is to instantiate the Laplace mechanism in a small ordering service and empirically measure the ordering probability ratio for controlled synthetic requests to verify the e^{kε} bound holds in practice."],"forward_implications":["An ordering server that implements any ε-differentially private additive-noise mechanism (for example, Laplace or bounded Laplace) with sensitivity λ satisfies ε-Ordering Equality for arbitrary relevant features, not just timestamps.","For requests with similar but non-identical relevant features, the guarantee degrades smoothly as e^{kε}, so small measurement differences cannot be exploited to bypass fairness entirely.","Treating miner fees as the relevant feature and out-of-band bribes as bounded noise deters fee-driven reordering and reduces miner extractable value.","Treating the time of transaction issuance as the relevant feature and network delay as noise mitigates front-running and sandwich attacks."],"supporting_citations":[{"why":"Supplies the definition of differential privacy and the neighboring-datasets framework that the fairness reduction is built on.","marker":"[5]"},{"why":"Provides the original ε-Ordering Equality definition and the equal-opportunity feature framework that this paper generalizes.","marker":"[19]"},{"why":"Establishes the state machine replication model in which the ordering service operates.","marker":"[12]"},{"why":"Identifies miner extractable value, front-running, and sandwich attacks that motivate the fairness property and the fee-based application.","marker":"[4]"},{"why":"Offers the bounded Laplace mechanism referenced as a practical noise source for the DP-based ordering construction.","marker":"[8]"}],"fun_headline_variants":["Fair blockchain ordering via differential privacy","Differential privacy noise equalizes transaction order","Privacy noise: fair ordering for blockchains","DP ensures equal opportunity in ordering","Calibrated noise: fair ordering in distributed systems"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The proof depends on every request's score being exactly the sum of a relevant feature and an irrelevant noise term, and on the maximum possible noise gap between adjacent requests being a known, finite value λ.","fun_headline_variants_meta":{"raw":{"variants":["Fair blockchain ordering via differential privacy","Differential privacy noise equalizes transaction order","Privacy noise: fair ordering for blockchains","DP ensures equal opportunity in ordering","Calibrated noise: fair ordering in distributed systems"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000844,"raw_usage":{"total_tokens":3636,"prompt_tokens":866,"completion_tokens":2770,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":482,"completion_tokens_details":{"reasoning_tokens":2706}},"tokens_in":482,"tokens_out":2770,"duration_ms":19462,"temperature":1.0,"reasoning_tokens":2706,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-10T21:12:17.014757+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"A concrete way to test the claim is to build an ordering server with controlled noise, fix λ, emit pairs of requests with identical relevant features whose noise terms differ by more than λ, and measure whether the probability of one ordering exceeds e^ε times the reverse; a violation would show the assumed bound is broken, while no violation under the bound would support the reduction. Because the theorem is conditional on Assumption 1, the more direct falsifier is any real system where scores are non-additive or λ is unbounded, since the mapping from fairness to DP no longer applies.","supporting_citations":[{"cited_title":"Differential privacy","cited_arxiv_id":null,"evidence_quote":"Supplies the definition of differential privacy and the neighboring-datasets framework that the fairness reduction is built on."},{"cited_title":"Ordered Consensus With Equal Opportunity","cited_arxiv_id":null,"evidence_quote":"Provides the original ε-Ordering Equality definition and the equal-opportunity feature framework that this paper generalizes."},{"cited_title":"Time, clocks, and the ordering of events in a distributed system","cited_arxiv_id":null,"evidence_quote":"Establishes the state machine replication model in which the ordering service operates."},{"cited_title":"Flash boys 2.0: Frontrun ning in decentralized exchanges, miner extractable value, and consensus instabi lity","cited_arxiv_id":null,"evidence_quote":"Identifies miner extractable value, front-running, and sandwich attacks that motivate the fairness property and the fee-based application."}],"review_version":1}