{"id":"a5c4c3bd-5e18-451f-be3c-b5dbb9978dd4","arxiv_id":"2508.17274","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":5.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"A photonic time-of-flight computer is claimed to solve subset sum problems at femtojoule-per-operation energy at N=33, 10^8 times less than a leading supercomputer.","lead":"A team built a light-based computer that solves subset sum problems using photon timing, claiming under 10^-15 joules per operation at N=33 and a 10^8-fold energy saving over top supercomputers. The result is striking, but it can be judged only after the full energy accounting is checked, which the abstract does not provide.","discovery_kind":"unclear","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Energy accounting behind the 10^-15 J/operation claim is unverifiable from the supplied text and likely excludes wall-plug overheads","rationale":"The reader's verdict was UNVERDICTED because the supplied full text was corrupted and only the abstract could be assessed. My independent read of the abstract identifies the same load-bearing weakness: the advertised energy-efficiency advantage depends on a precise, apples-to-apples energy accounting that the abstract does not provide. The abstract's mention of ~10^-19 J per photon is an optical energy, not a system-level energy per operation, and the phrase 'per operation' is ambiguous across the photonic solver and the electronic supercomputer baseline. Because the full text is unreadable, there is no way to confirm the measurement methodology, the inclusion of electronic overheads, or the baseline definition. This is not an internal inconsistency in the visible text, but it is a missing-support issue: the strongest claim rests on numbers that cannot currently be verified. I therefore agree with the reader's assessment. The verdict should remain UNVERDICTED until the full manuscript is available for scrutiny; no change to the reader's verdict is warranted.","tokens_in":1204,"tokens_out":1179,"duration_ms":17794,"concrete_test":"Obtain the full manuscript's experimental methods and energy-accounting section. Reconstruct the per-operation energy as total measured electrical energy consumed by the entire setup (laser power supply, modulator drivers, detector/TIA, ADC, FPGA/control, and idle power during time-of-flight) divided by the number of subset-sum instances solved per second. Compare this wall-plug figure with the claimed 10^-15 J/operation. Also require the baseline supercomputer's 'operation' to be defined identically (e.g., one subset-sum instance or one bit-operation) and recompute the 10^8-fold advantage. If the wall-plug energy exceeds 10^-15 J by more than a factor of 10, or if the baseline uses a different operation definition, the headline claim is not supported.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim is that the photonic computer consumes no more than 10^-15 J per operation at N=33 and is 10^8 times more energy-efficient than a supercomputer. This claim is load-bearing because the paper's entire advertised advantage is energy efficiency, not raw speed or scalability. For that claim to hold, 'per operation' must refer to the same computational primitive for both the photonic machine and the supercomputer baseline, and the energy must include all electrical power drawn by the system: laser, modulator drivers, detectors and transimpedance amplifiers, control electronics, analog-to-digital conversion, and the idle power consumed during the time-of-flight storage interval. The abstract states only that the energy of a photon is ~10^-19 J, which is not the same as the energy per operation of a working machine. The supplied full text is corrupted and unreadable, so no methods, circuit diagrams, power measurements, or baseline specifications are available to check this accounting. Without a wall-plug energy measurement, the 10^-15 J figure could be an idealized optical-energy estimate that omits the dominant electronic overhead. This is not an accusation of dishonesty; it is an unverified quantitative claim resting on an unspecified system boundary.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper reports an experimental photonic computer for the subset sum problem (SSP), claiming that by exploiting the low energy of individual photons (~10^-19 J) and a time-of-flight storage method, the system achieves no more than 10^-15 J per operation at problem size N=33, and consumes 10^8 times less energy than the most energy-efficient supercomputer for a medium-scale problem. The readable portion of the submission is limited to the abstract; the full text is corrupted and unreadable in the provided manuscript, so no methods, experimental setup, measurements, or baseline specifications are available for evaluation.","tokens_in":1511,"tokens_out":2456,"duration_ms":30545,"significance":"If the central claim is substantiated, this would be a significant experimental result: a working optical solver for a relevant NP-complete problem with an orders-of-magnitude energy advantage over electronic supercomputers. The headline energy figure is specific and falsifiable, which is a strength. However, the submission as provided gives no measurement details, no error analysis, no system-boundary definition, and no description of the comparison baseline. The significance of the result therefore remains conditional on evidence that is not currently present in the manuscript.","major_comments":[{"comment":"The claim 'energy consumption ... no larger than 10^-15 J per operation at N=33' is unverifiable from the submitted text. No wall-plug energy measurement is reported, and the system boundary is undefined. The preceding statement that photons carry ~10^-19 J is not an energy-per-operation estimate for a complete machine; the laser, modulators, detectors, transimpedance amplifiers, control electronics, ADC, and idle power during time-of-flight storage must all be included. Please provide a complete energy budget and measurement protocol.","section":"Abstract, 3rd sentence"},{"comment":"The comparison '10^8 times less energy than the most energy-efficient supercomputer' lacks a defined baseline. Which supercomputer, which algorithm for SSP, what problem instance size, and what counts as an operation for the electronic machine? Without a common definition of 'operation' and a specific baseline configuration, the claimed factor of 10^8 is not interpretable and could reflect a mismatch in problem encoding or algorithmic complexity rather than a hardware advantage.","section":"Abstract, 4th sentence"},{"comment":"The submitted PDF contains only a corrupted full-text section. There is no experimental section, no schematic, no data table, no error bars, no scaling measurement, and no description of how N=33 SSP instances are encoded and solved. Because the central claim is experimental, these omissions are load-bearing. The authors must supply a complete, readable manuscript with measurement details, a definition of 'operation', a system-boundary diagram, and ideally raw data or a reproducibility statement.","section":"Full text (unreadable); Methods/Results absent"},{"comment":"The metric 'energy per operation' is self-defined and may be circular if the operation count is chosen to favor the photonic system. For example, if one SSP query is counted as one photonic operation but as many bit operations in the electronic baseline, the comparison is not apples-to-apples. Please specify the computational primitive for both systems and justify that the same problem instance and algorithmic task are being compared.","section":"Abstract, metric definition"}],"minor_comments":[{"comment":"The term 'medium-scale problem' is vague; if this refers to N=33, state so explicitly. If it refers to a different instance, give its parameters.","section":"Abstract, 4th sentence"},{"comment":"The phrase 'photonic advantage in energy consumption' is repeated from the preceding claim and adds little; consider instead giving a concrete example of an iterative SSP-based application.","section":"Abstract, 5th sentence"},{"comment":"The manuscript has no references or related-work discussion in the readable portion; even a brief comparison with prior optical Ising machines or electronic SSP solvers would help position the contribution.","section":"General"}],"recommendation":"major_revision","confidential_remarks":"The supplied full text is unreadable in the review copy; I was able to review only the abstract. If this is a rendering artifact in the submission system, the authors should resubmit a complete PDF. Otherwise, the manuscript as submitted lacks the evidence for its central energy-efficiency claims, and major revision would be needed to add methods, measurements, and a clear system boundary."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The headline number — 10^-15 J per operation at N=33, and 10^8 less than a supercomputer — is the whole paper, and the abstract doesn't give us the accounting. The full text I received is corrupted to the point of unreadability, so my judgment is based on the abstract only.\n\nWhat the abstract does claim is concrete: a working time-of-flight photonic solver for subset sum, experimentally demonstrated at N=33, with an energy-per-operation figure. If the energy measurement includes wall-plug power and the comparison is like for like, that is a real step for photonic combinatorial computing. Earlier time-of-flight subset-sum work exists, so the novelty is likely in the specific demonstration and the energy benchmark rather than the concept, but that's worth checking with the full methods.\n\nThe soft spot is the system boundary. The abstract leans on the ~10^-19 J energy of a photon, which is not the energy per operation of a machine. Laser power, modulator drivers, detector bias, transimpedance amplifiers, ADCs, control logic, and idle power during the time-of-flight interval all need to sit in the denominator. Without that, the 10^8 advantage is likely inflated. 'Operation' also needs to mean the same thing for the photonic machine and the supercomputer baseline, and the baseline itself needs specification. These are standard referee asks, not fatal accusations — the authors may well have done the honest measurement and just compressed it out of the abstract.\n\nThe iterative-computation claim ('further enhanced') is plausible but needs detail on where the energy savings actually compound.\n\nThis paper deserves a serious referee, not a desk reject, because a verified femtojoule-per-operation combinatorial solver would matter. But the referee's first question should be: what exactly is in the energy number? If that question gets a credible answer, the paper is solid; if not, the central claim doesn't stand.\n\nFor a reading group, maybe — abstract only, not enough to build on. I wouldn't cite it yet. Serious thinker: unclear from what I can see, but nothing incoherent.","headline":"The 10^-15 J/operation headline rests on energy accounting the abstract doesn't define; the experimental claim deserves review, but the number is unverified.","tokens_in":1942,"tokens_out":2245,"would_cite":false,"duration_ms":26118,"reading_group":"maybe","serious_thinker":"unclear","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"A photonic computer solves subset sum with about 10^-15 joules per operation","keywords":["photonic computing","subset sum problem","energy-efficient computing","time-of-flight storage","optical computation","NP-complete","green computing"],"falsifier":"Measure the total electrical power drawn by the complete photonic setup while solving a medium-scale subset-sum instance, count the operations, and divide; if the resulting energy per operation exceeds 10^-15 J, the central claim fails. A second decisive check is to independently verify the solver's output on the same N=33 instances, since an incorrect solver would not be energy-advantageous.","tokens_in":1180,"feed_emoji":"⚡","tokens_out":3215,"duration_ms":36819,"temperature":0.7,"pith_summary":"This paper reports a working photonic computer that tackles the subset sum problem, an NP-complete task that scales poorly on electronic machines. The device encodes the numbers of a subset-sum instance as photon arrival times, storing the evolving set of possible sums in the time-of-flight of light rather than in electronic memory. The authors report energy per operation no larger than 10^-15 J for instance size N=33, about 10^8 times less than the most energy-efficient supercomputer at medium scale. The claim matters because data movement, not logic, dominates energy use in von Neumann machines, and time-of-flight storage sidesteps that cost.","feed_headline":"Photonic computer solves subset-sum at 1e-15 joules per operation","feed_subtitle":"Uses time-of-flight storage to cut energy 100 million-fold versus a top supercomputer.","key_machinery":"Time-of-flight storage is the central mechanism: the set of achievable subset sums is encoded in the arrival times of optical pulses, with each input number implemented as a delay path. This carries the argument by replacing energy-hungry electronic memory access with photon propagation, and the extremely low energy of a single photon places the physical energy floor near 10^-19 J per operation.","core_discovery":"The paper claims that the subset sum problem can be solved optically with femtojoule-scale energy per operation. The demonstration uses photons with energy around 10^-19 J and a time-of-flight storage technique: possible subset sums are represented by the times at which optical pulses arrive, avoiding the energy-intensive movement of data between memory and processor. The reported result is that energy consumption stays at or below 10^-15 J per operation for problem size N=33, and for a medium-scale instance it consumes 10^8 times less energy than the most energy-efficient supercomputer. The paper further argues that when the solver is embedded in iterative real-life computations that repeat","pith_inferences":["Editorial inference: whether the 10^-15 J per operation figure survives scrutiny depends on including all real electrical power consumed by the full system—laser, modulators, detectors, and control electronics—and on 'operation' meaning the same unit for both the photonic solver and the supercomputer baseline.","Editorial inference: the same time-of-flight architecture may extend to other combinatorial search problems that can be encoded as sums of delays, such as the partition problem or knapsack variants.","Editorial inference: the practical ceiling for the approach will likely be set by detector timing precision and the available time-bandwidth product of delay lines; improving these would raise the solvable problem size.","Editorial inference: this is a specialized accelerator, not a general-purpose replacement for electronic computers; it is best seen as a complementary, ultra-low-energy module for problems reducible to subset sum."],"forward_implications":["If the energy accounting holds, photonic subset-sum solvers could operate at orders of magnitude lower power than electronic alternatives, making them practical for embedded or mobile settings where hard combinatorial problems arise.","For real-life workflows that require many subset-sum computations, the paper's stated advantage strengthens because the input setup cost is amortized over many iterative calls.","The demonstration at N=33 indicates the approach is not limited to tiny toy instances, though larger sizes will require longer optical delay paths and more precise timing.","Because the computation is carried by photon propagation rather than electronic data movement, the solver directly targets the main energy bottleneck of conventional von Neumann machines."],"supporting_citations":[],"fun_headline_variants":["Femtojoule photonic computer solves subset sum","Photonic computer does subset sum at 1e-15 J per operation","Light-based subset sum solver cuts energy 100 million-fold","Time-of-flight optics: subset sum at femtojoule efficiency"],"cache_read_input_tokens":2688,"weakest_assumption_plain":"The load-bearing premise is that the reported 10^-15 J per operation covers all electricity consumed by the whole machine—laser, modulators, detectors, and control electronics—and that an 'operation' means the same thing for the photonic solver and for the supercomputer baseline.","fun_headline_variants_meta":{"raw":{"variants":["Femtojoule photonic computer solves subset sum","Photonic computer does subset sum at 1e-15 J per operation","Light-based subset sum solver cuts energy 100 million-fold","Time-of-flight optics: subset sum at femtojoule efficiency"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.00026,"raw_usage":{"total_tokens":1409,"prompt_tokens":710,"completion_tokens":699,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":454,"completion_tokens_details":{"reasoning_tokens":626}},"tokens_in":454,"tokens_out":699,"duration_ms":7295,"temperature":1.0,"reasoning_tokens":626,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-05T16:58:12.998329+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Measure the total electrical power drawn by the complete photonic setup while solving a medium-scale subset-sum instance, count the operations, and divide; if the resulting energy per operation exceeds 10^-15 J, the central claim fails. A second decisive check is to independently verify the solver's output on the same N=33 instances, since an incorrect solver would not be energy-advantageous.","supporting_citations":[],"review_version":1}