{"id":"b1d02b1b-9bc4-4803-a7ce-85dfcc1af966","arxiv_id":"1908.11811","paper_version":2,"verdict":"CONDITIONAL","confidence":"HIGH","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":9,"one_line_summary":"This paper introduces LUNES-Blockchain, an agent-based PADS simulator for blockchains, and demonstrates it on a simplified Bitcoin model under a filtering DoS, but provides no parallel speedup measurements.","lead":"The authors built LUNES-Blockchain, a simulator that models blockchain networks as many interacting agents and is designed to run on parallel or distributed computers. They use it to study a filtering denial-of-service attack on a simplified Bitcoin network, showing that message reachability falls as the number of attackers grows.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Central PADS scalability claim is unmeasured: all reported runs use a single LP in sequential mode, so the paper's core claim rests on inherited infrastructure rather than on any demonstrated speedup or scalability.","rationale":"The reader's weakest assumption names exactly the gap I see: the paper claims PADS-based scalability but only reports sequential single-LP runs. I read the paper in good faith and find no reason to doubt the internal consistency of the attack experiments: the parameters are explicit, the reported curves behave as expected for Sybil-style filtering, and the authors repeatedly label the work preliminary and explicitly defer a full validation and scalability assessment. Those limitation statements are important evidence for a conditional rather than a reject verdict. The concern is not that PADS cannot deliver speedups in principle, nor that the authors have misrepresented their runs—they openly state the sequential setup—but that the central claim about being the first blockchain simulator to exploit PADS is not supported by the evidence in the paper. This is a load-bearing concern because if a multi-LP run fails to improve or even match the sequential baseline, the headline contribution loses its main differentiating advantage. The reader's CONDITIONAL verdict is appropriate, and no adjustment is needed.","tokens_in":8148,"tokens_out":2918,"duration_ms":30066,"concrete_test":"Add a scaling experiment to Section 4 using the Table 1 model: run the same attack configuration with 1, 2, 4, 8, and 16 Logical Processes on a multicore machine (and, if available, across 2–4 hosts), record wall-clock time per run, compute speedup relative to the single-LP baseline, and verify that the average reached-nodes curves in Figures 2–3 are unchanged across LP counts. If wall-clock time decreases monotonically and outputs match the sequential baseline, the PADS viability claim is supported; if speedup is negligible or negative, or outputs diverge, the central claim should be weakened to \"PADS-capable architecture\" pending further work.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Every result in Section 4 was obtained with \"a single LP (i.e. sequential simulation)\", yet the paper's strongest claims are that LUNES-Blockchain \"is the first simulator of blockchains that is able to take advantage of the performance speedup and extended scalability provided by PADS\" (Section 2.3 and Conclusions) and that the results \"confirm the viability\" of PADS-based agent-based blockchain modelling (Abstract). Inheriting ARTIS/GAIA from LUNES gives architectural plausibility, but it does not demonstrate that PADS works for the blockchain workload: synchronization, partitioning, and communication overhead can erase or reverse expected speedups at this model scale. The only performance data point is a 60-second sequential run of 10,000 nodes; no multi-LP, multi-core, or multi-host experiment is reported. The paper's own limitation statements—\"preliminary work\", \"does not represent a validation\", and a future \"full-fledged validation and scalability assessment\"—confirm the intended scope, but they do not supply the missing support. The central claim is therefore an unmeasured extrapolation, not a demonstrated result.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"This paper presents LUNES-Blockchain, an agent-based blockchain simulator built on the ARTIS/GAIA parallel and distributed simulation middleware and the LUNES network simulator. The authors describe a simplified Bitcoin model, set parameters to mimic the Bitcoin network in Q4 2018, and study a filtering denial-of-service attack in which a set of malicious nodes drops all messages originating from a target node. The main claims are that LUNES-Blockchain is the first blockchain simulator to exploit the performance speedup and extended scalability provided by PADS, and that the reported results confirm the viability of agent-based blockchain modelling via PADS. All reported experiments use a single Logical Process in sequential mode, and the paper explicitly states that the work is preliminary and does not represent a validation.","tokens_in":8425,"tokens_out":5604,"duration_ms":51869,"significance":"If the PADS scalability claim were backed by experiments, this would be a useful contribution: it would provide an agent-based blockchain simulator with a potential path to large-scale parallel and distributed simulation, and the security case study would illustrate how such a simulator can be used to explore attacks. The paper is transparent about its preliminary status, provides a parameter table (Table 1) to support reproducibility, and makes the simulator available for peer review. However, the central PADS claim is currently unmeasured, and the attack evaluation lacks a quantitative comparison to theory, so the current contribution is an architectural proposal with a small-scale sequential case study rather than a demonstration of the claimed capabilities.","major_comments":[{"comment":"The central claim of the paper—that LUNES-Blockchain is able to exploit the performance speedup and extended scalability provided by PADS—is not supported by the reported experiments. The paper states that all runs used \"a single LP (i.e. sequential simulation)\" and provides no multi-LP, multi-core, or multi-host results. No wall-clock time, memory usage, or speedup is reported for any parallel configuration, and the only performance datum is a 60-second sequential run for 10,000 nodes. Consequently, the conclusions in Section 5 and the Abstract overstate what the data show; at most, the paper demonstrates that the existing ARTIS/GAIA middleware is architecturally compatible with the blockchain model. Please add at least one experiment that varies the number of LPs/PEUs and reports speedup and scalability relative to the sequential baseline.","section":"Section 4, first paragraph; Conclusions"},{"comment":"The evaluation of the DoS attack claims that the outcomes are \"comparable with theoretical results expected for this kind of attack against peer-to-peer botnets\" and cites Ref. [21], but no theoretical curve, error bars, confidence intervals, or statistical test is provided. The paper also explicitly states that this \"does not represent a validation\". Without a quantitative comparison, the results in Figures 2 and 3 do not substantiate the abstract's assertion that the results \"confirm the viability\" of the simulator. Please specify the theoretical benchmark, show it in the figures or in a table, and report the deviation between simulation and theory.","section":"Section 4, paragraph around Figures 2 and 3"},{"comment":"The attack is described as \"a Sybil Attack\", but the implemented mechanism—a set of malicious nodes silently dropping all messages from a targeted node, leading to complete isolation when the target is fully surrounded—corresponds to an eclipse attack or a filtering denial-of-service, not to a Sybil attack in the standard sense (where an adversary forges multiple identities). The paper does not model identity creation or the adversarial control of multiple distinct nodes. Using the term \"Sybil\" is misleading and affects how the results should be interpreted; please rename the attack or justify the terminology with a suitable reference.","section":"Section 4, first paragraph of the attack description"}],"minor_comments":[{"comment":"The model uses a random graph topology and a degree-dependent gossip protocol in place of Bitcoin's actual peer-to-peer topology and Dandelion/Dandelion++ dissemination, which the paper acknowledges. However, the paper also claims to mimic Bitcoin's mining difficulty and hashrate; it should provide evidence that the simulated block interval is centered near the target 10 minutes (10 time-steps) and note how the simplified topology affects dissemination delays.","section":"Section 3.3, Table 1"},{"comment":"There is a typo: \"the simulated time is dived in a sequence of time-steps\" should be \"divided\". In addition, in the same section, \"assess if it possible\" should be \"assess if it is possible\". A duplicate \"the the\" appears in Section 3 before Section 3.1.","section":"Section 3.3, paragraph on time modeling"},{"comment":"The caption of Figure 3 says \"Different setups with an increasing number of attacking nodes\", but the figure shows curves for different attack configurations without a legend or explicit mapping from line style to attacker count. Please add a legend or annotate the curves.","section":"Section 4, Figure 3"},{"comment":"The paper reports that a single run takes \"an average of 60 seconds\", but does not report the number of runs used to compute the average or the variance. Please provide these details to support the performance statement.","section":"Section 4, first paragraph after Table 1"}],"recommendation":"major_revision","confidential_remarks":"The manuscript reads as a short conference paper; the missing PADS experiments are the main blocker. If the journal expects a full-length archival paper, the authors should substantially extend the evaluation, at minimum by adding a multi-LP or distributed run and a quantitative comparison for the attack study. The terminology issue around \"Sybil attack\" should also be corrected."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take: LUNES-Blockchain is a short tool paper that describes a blockchain simulator grafted onto the authors' LUNES/ARTIS/GAIA agent-based platform. The genuinely new thing is the combination, plus a clean case study of a Sybil filtering attack at 10,000 nodes. The attack results are internally consistent, parameters are explicit, and the paper is admirably honest about its own limits: it calls the work preliminary, says the outcomes are not a validation, and lists missing features (Dandelion, accurate topology, public code). That honesty earns it a fair read.\n\nWhat it does well: it identifies a real gap—no prior PADS-based blockchain simulator—and makes a plausible case that the architecture can scale. The Table 1 parameter list is a model of reproducibility. The Sybil attack experiment has a clear design: vary attackers from 1 to 9999, measure average reach. The sharp cutoff near 7000–7500 attackers is consistent with percolation on a random graph, so the model is behaving sensibly even if no Bitcoin ground truth is used.\n\nNow the soft spots, in proportion. The central claim—that this is the first blockchain simulator exploiting PADS speedup and scalability—is not supported by any measured parallel or distributed execution. All reported runs use a single LP sequentially. The 60-second run at 10,000 nodes is fine as a data point, but it does not demonstrate that ARTIS/GAIA's multi-LP machinery works for the blockchain workload. Synchronization and partitioning overhead could easily eat the benefit. So the strength of the claim exceeds the evidence. The comparison to theoretical botnet results [21] is suggestive but explicitly non-validating, and the model uses a random graph and a LUNES gossip protocol rather than Bitcoin's actual topology and Dandelion. Those are stated limitations, not hidden flaws. The citation pattern is legitimate: the platform is their own prior work, so self-citation is expected, and they cite enough outside simulators (SimBlock, VIBES, BlockSim, Shadow-Bitcoin) to position the contribution.\n\nNet: this paper is for readers in the blockchain simulation subfield who want a concise description of a new tool. It is not a validation paper and should not be cited as evidence that PADS makes blockchain simulation scale. It deserves a serious referee only in a venue that accepts short tool/preliminary system papers; the referee should ask for either a multi-LP experiment or a softened claim. I'd recommend conditional acceptance with revision, or a poster/demo. Not a desk reject, but not a strong paper.","headline":"A small, honest tool paper whose main selling point—PADS scalability—is inherited, not demonstrated; the attack results are a credible percolation exercise.","tokens_in":8914,"tokens_out":2022,"would_cite":false,"duration_ms":18515,"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":"The paper presents LUNES-Blockchain, an agent-based Bitcoin simulator built on parallel and distributed simulation, and demonstrates it on a 10,000-node Sybil attack scenario.","keywords":["blockchain simulation","agent-based simulation","parallel and distributed simulation","Bitcoin","Sybil attack","denial of service","peer-to-peer networks","LUNES-Blockchain"],"falsifier":"Running the published 10,000-node Sybil scenario on 2, 4, 8, and 16 Logical Processes across separate cores and comparing wall-clock time and maximum network size against the reported 60-second single-LP baseline would settle whether PADS delivers the speedup and scalability that define the contribution.","tokens_in":7971,"feed_emoji":"🔗","tokens_out":11629,"duration_ms":98226,"temperature":0.7,"pith_summary":"LUNES-Blockchain is an agent-based blockchain simulator built on the parallel-and-distributed simulation (PADS) substrate offered by ARTIS/GAIA, and the paper's central claim is that it is the first blockchain simulator able to exploit the speedup and scalability that PADS provides. To support that claim, the authors implement a simplified Bitcoin model with 10,000 nodes, 70% miners, gossip-based dissemination, and a difficulty-aware but computationally cheap Proof-of-Work mining process. They then study a Sybil-style filtering denial-of-service attack in which malicious agents silently drop every message originating from a victim node. The measured effect is a steady decline in the victim's reach as the number of attackers grows, a sharp drop beyond 7,000 malicious nodes, and complete isolation above 7,500, which the authors take as consistent with known theoretical expectations. The paper's point is that a full blockchain stack—overlay, dissemination, consensus, and attack behaviour—can be expressed agent-by-agent on a PADS platform, making blockchain simulation a candidate for parallel and distributed execution.","feed_headline":"Blockchain simulator puts 10,000-node Sybil attack on PADS","feed_subtitle":"Built on parallel and distributed simulation, it maps how a Sybil attack isolates a victim.","key_machinery":"The central mechanism is the one-agent-per-node mapping: every blockchain node becomes a Simulated Entity in the GAIA multi-agent layer, and these agents interact only through timestamped messages, so protocol behaviour is emergent rather than scripted globally. ARTIS/GAIA then clusters frequently communicating agents into the same Logical Process, which is the device that is supposed to contain inter-process communication and make parallel or distributed execution efficient. LUNES contributes the degree-dependent dissemination protocol used to model transaction and block propagation, while LUNES-Blockchain adds the blockchain-specific agent states and actions: transaction generation, a difficulty- and hashrate-based mining model that avoids the cost of real hash computations, and the time-stepped clock calibrated to Bitcoin. The Sybil attack is itself implemented as an agent behaviour—malicious agents drop all messages originating from the victim—which means the attack's reach curve is an emergent property of many local decisions.","core_discovery":"The core claim, stated as directly as the authors state it, is that LUNES-Blockchain is the first blockchain simulator able to take advantage of the performance speedup and extended scalability offered by Parallel and Distributed Simulation. The simulator represents each blockchain node as an autonomous agent that keeps a local ledger, generates and validates transactions, mines new blocks at a rate determined by its hashrate and the global difficulty, and broadcasts information through a degree-dependent gossip protocol supplied by the LUNES layer. A time-stepped clock maps one simulated minute per step, so on average a block appears every ten steps, matching Bitcoin's cadence. The demonstration scenario is a filtering DoS attack on a 10,000-node network: malicious nodes drop all messages from a chosen victim, and the simulator measures how many nodes still receive the victim's messages as the number of attackers ranges from 1 to 9,999. The reported curves show reach declining with attacker count, a sharp fall when attackers exceed 7,000, and total disconnection of the victim beyond 7,500, which the authors describe as comparable to theoretical expectations for Sybil attacks against peer-to-peer botnets and as confirmation that agent-based blockchain modelling on PADS is viable.","pith_inferences":["An implication the paper leaves implicit is that if the PADS speedup materializes, the limiting factor for blockchain simulation shifts from event throughput to synchronization and inter-Logical-Process communication, making topology-aware agent partitioning at least as important as raw node count.","The sharp drop near 7,000 attackers looks like a percolation transition in a 10,000-node random graph with 8 edges per node; computing the graph's connectivity threshold would separate purely structural effects from the Bitcoin-specific protocol effects.","A direct testable extension would vary average node degree and graph topology while holding the attack fixed: if the 7,000 and 7,500 thresholds move, then Sybil isolation is governed mainly by graph connectivity, not by the consensus layer.","If the planned Dandelion/Dandelion++ module is added, the simulator could compare how the anonymity phase and the flooding phase each degrade under filtering attacks, a comparison no current simulator seems to offer."],"forward_implications":["Under this design, blockchain anomaly and attack scenarios can be studied at network scales that sequential simulators struggle with, because the platform is built to spread Logical Processes across processing units.","The measured threshold—full isolation of a victim only when roughly three-quarters of the ten-thousand-node network attacks—gives a concrete, topology-dependent baseline for how many malicious nodes a filtering defence must tolerate.","Because mining is modelled through hashrate and difficulty rather than real cryptography, experiments on block interval, difficulty, and pool behaviour become cheap enough to sweep across many configurations.","The same agent-based stack is extensible to other consensus protocols and to smart-contract blockchains; the authors identify Ethereum-style modelling as the planned next step."],"supporting_citations":[{"why":"It supplies the LUNES network simulator, the degree-dependent gossip dissemination protocol, and the prior PADS-based implementation that LUNES-Blockchain extends.","marker":"[6]"},{"why":"It supplies the ARTIS/GAIA parallel-and-distributed simulation middleware that gives LUNES-Blockchain its PADS capability.","marker":"[7]"},{"why":"It supplies the discrete-event simulation and PADS background, including the time-stepped synchronization algorithm used in the model.","marker":"[13]"},{"why":"It describes BlockSim, an existing blockchain simulation framework that LUNES-Blockchain is positioned against in the related-work comparison.","marker":"[1]"},{"why":"It describes SimBlock, an existing blockchain network simulator cited as a prior approach that does not exploit PADS.","marker":"[2]"},{"why":"It describes Shadow-Bitcoin, a direct-execution Bitcoin simulator cited as an alternative simulation strategy.","marker":"[17]"},{"why":"It describes VIBES, a large-scale blockchain simulator cited as related work and part of the comparison the paper positions itself against.","marker":"[20]"},{"why":"It provides the Bitnodes estimate of about 10,400 Bitcoin nodes, used to set the 10,000-node network size in the simulation parameters.","marker":"[3]"},{"why":"It provides theoretical results on Sybil attacks against peer-to-peer botnets, used as the qualitative comparison for the measured message-reach curves.","marker":"[21]"}],"fun_headline_variants":["First PADS-based blockchain sim scales to 10k-node Sybil attack","Parallel blockchain simulator isolates Sybil victim among 10k nodes","Agent-based blockchain sim uses PADS to tackle 10k-node Sybil attack","LUNES-Blockchain: PADS-based sim models Sybil attack at scale"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that the underlying parallel-and-distributed simulation substrate delivers the speedup and scalability LUNES-Blockchain is designed for, since every experiment reported here runs sequentially on a single Logical Process and no parallel or distributed run is shown.","fun_headline_variants_meta":{"raw":{"variants":["First PADS-based blockchain sim scales to 10k-node Sybil attack","Parallel blockchain simulator isolates Sybil victim among 10k nodes","Agent-based blockchain sim uses PADS to tackle 10k-node Sybil attack","LUNES-Blockchain: PADS-based sim models Sybil attack at scale"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000513,"raw_usage":{"total_tokens":2456,"prompt_tokens":868,"completion_tokens":1588,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":484,"completion_tokens_details":{"reasoning_tokens":1505}},"tokens_in":484,"tokens_out":1588,"duration_ms":12760,"temperature":1.0,"reasoning_tokens":1505,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T10:20:16.953115+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Running the published 10,000-node Sybil scenario on 2, 4, 8, and 16 Logical Processes across separate cores and comparing wall-clock time and maximum network size against the reported 60-second single-LP baseline would settle whether PADS delivers the speedup and scalability that define the contribution.","supporting_citations":[{"cited_title":"D’Angelo and S","cited_arxiv_id":null,"evidence_quote":"It supplies the LUNES network simulator, the degree-dependent gossip dissemination protocol, and the prior PADS-based implementation that LUNES-Blockchain extends."},{"cited_title":"D’Angelo and S","cited_arxiv_id":null,"evidence_quote":"It supplies the ARTIS/GAIA parallel-and-distributed simulation middleware that gives LUNES-Blockchain its PADS capability."},{"cited_title":"Alharby and A","cited_arxiv_id":null,"evidence_quote":"It describes BlockSim, an existing blockchain simulation framework that LUNES-Blockchain is positioned against in the related-work comparison."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"It describes SimBlock, an existing blockchain network simulator cited as a prior approach that does not exploit PADS."},{"cited_title":"Miller and R","cited_arxiv_id":null,"evidence_quote":"It describes Shadow-Bitcoin, a direct-execution Bitcoin simulator cited as an alternative simulation strategy."},{"cited_title":"Stoykov, K","cited_arxiv_id":null,"evidence_quote":"It describes VIBES, a large-scale blockchain simulator cited as related work and part of the comparison the paper positions itself against."},{"cited_title":"Global Bitcoin Nodes Distribution","cited_arxiv_id":null,"evidence_quote":"It provides the Bitnodes estimate of about 10,400 Bitcoin nodes, used to set the 10,000-node network size in the simulation parameters."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"It provides theoretical results on Sybil attacks against peer-to-peer botnets, used as the qualitative comparison for the measured message-reach curves."}],"review_version":1}