{"paper_id":"2305.13227","title":"Trustless Price Feeds of Cryptocurrencies: Pathfinder","authors":["Orhan Koc"],"paper_date":"2023-05-22","paper_type":"empirical","paper_url":"https://arxiv.org/pdf/2305.13227v1","page_url":"https://thequant.space/flowcharts/trustless-price-feeds-of-cryptocurrencies-pathfinder/","scores":{"empirical_rigor":3,"math_complexity":7,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"The paper proposes a novel algorithm that computes cryptocurrency prices without trusting third parties by quantifying manipulation of pools and using a modified Dijkstra's algorithm to find the shortest path between source and target pools.","quote":"This paper provides the design and implementation details of a novel method to algorithmically compute security prices in a way that artificially inflating targeted pools has no effect on the reported price of the queried asset. A modiﬁed version of Dijkstra’s algorithm [1] will be used to ﬁnd the shortest path from the source pool to the target pool.","summary":"Price feeds of securities is a critical component for many financial services, allowing for collateral liquidation, margin trading, derivative pricing and more. With the advent of blockchain technology, value in reporting accurate prices without a third party has become apparent. There have been…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"For every asset pair there exists a pool with reserves for the corresponding assets.","type":"market","stated":"explicit","quote":"For every asset pair there exists a pool with reserves for corresponding assets.","support":"full"},{"assumption":"The attacker is a rational actor who will choose pools to manipulate based on cumulative liquidity.","type":"other","stated":"explicit","quote":"We assume the attacker is a rational actor, so the attacker will choose the set of source pools or target based on the cumulative liquidity of pool options.","support":"full"}]},"datasets":{"status":"none_found","items":[],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"unclear"},"transaction_costs":{"status":"not_applicable","modeled":"n/a","headline_net_of_costs":null,"detail":null,"quote":null,"source":"front_matter","rule":"R3","candidates":{"front_matter":"n/a","evidence_card":"n/a","evidence_card_quoted":false},"meaning":"the paper reports no trading or execution result"},"results":{"status":"available","evaluation_type":"unclear","findings":[{"finding":"The algorithm can produce price information as accurate as centralized exchange prices.","kind":"performance","quote":"DISCUSSION A. Signiﬁcance In this paper, we hypothesized the algorithm with the outlined design and implementation details can produce price information as accurate as Centralized Exchange prices.","support":"full"},{"finding":"The proposed algorithm provides accurate price feeds even when taking potentially dishonest price information as input.","kind":"performance","quote":"The proposed algorithm can provide accurate price feeds of a security by taking potentially dishon-est price information of the market as an input.","support":"full"}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":6,"citations":{"cited_by_in_corpus":0,"by_independent_authors":0,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":0,"unclassified":0},"independent_papers":[],"scope":"Citations between papers in this corpus only; citations from outside it are not counted."}},"implementation":{"status":"available","public":false,"code_url":null,"note":"No repository presented by the authors as their own was found in the paper. Absence here is not proof that no code exists."},"replication":{"status":"none_found","card":null,"note":"No replication of this paper has been run by thequant.space yet."},"extraction":{"text_source":"fulltext","model":"openai/gpt-oss-120b","version":2,"extracted_at":"2026-11-14T20:02:35Z"},"provenance":{"claims":"Everything here is what the authors state in the paper. Nothing was re-run or reproduced by the platform.","quotes":"Assumptions, datasets, cost detail and findings were extracted by a language model. Every quote is verbatim paper text. Where an item has `support`, \"full\" means every figure in it appears in the quoted sentences and \"partial\" means a figure is stated elsewhere in the paper; items with a figure found nowhere in the paper were discarded.","datasets_known":"datasets.known lists well-known vendors and public datasets by a stable id, found by a dictionary over the full text where the sentence says the data is used; it is independent of the model and covers only names in the dictionary.","flags":"transaction_costs.modeled, results.evaluation_type and results.out_of_sample.method are platform classifications (structured-decision models); see https://thequant.space/score-guide/#penalty-flags","comparisons":"supports / contradicts / qualifies are a language model's reading of two papers' quoted findings, restricted to closely related papers that share no author. They are pointers to read, not verified replications, and coverage is partial.","implementation":"code_url is a repository the paper itself presents as its own (rule-scored, ambiguous cases judged by a model), checked for liveness when it was recorded."},"docs":"https://thequant.space/agents/"}