{"exhaustive":{"nbHits":false,"typo":false},"exhaustiveNbHits":false,"exhaustiveTypo":false,"hits":[{"_highlightResult":{"author":{"matchLevel":"none","matchedWords":[],"value":"indescions_2018"},"title":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["decodo"],"value":"<em>Decodo</em>ku: Games for Quantum Computers"},"url":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["decodo"],"value":"http://<em>decodo</em>ku.com/"}},"_tags":["story","author_indescions_2018","story_16115377"],"author":"indescions_2018","created_at":"2018-01-10T15:07:14Z","created_at_i":1515596834,"num_comments":0,"objectID":"16115377","points":1,"story_id":16115377,"title":"Decodoku: Games for Quantum Computers","updated_at":"2024-09-20T01:49:56Z","url":"http://decodoku.com/"},{"_highlightResult":{"author":{"matchLevel":"none","matchedWords":[],"value":"verandaguy"},"title":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["decodo"],"value":"<em>Decodo</em>ku: gaming for science"},"url":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["decodo"],"value":"https://<em>decodo</em>ku.blogspot.com/"}},"_tags":["story","author_verandaguy","story_12367649"],"author":"verandaguy","created_at":"2016-08-26T17:08:18Z","created_at_i":1472231298,"num_comments":0,"objectID":"12367649","points":1,"story_id":12367649,"title":"Decodoku: gaming for science","updated_at":"2024-09-19T23:38:51Z","url":"https://decodoku.blogspot.com/"},{"_highlightResult":{"author":{"matchLevel":"none","matchedWords":[],"value":"jimmydoe"},"comment_text":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["decodo"],"value":"One thing I see on the new gen of ai search bots are they fake chrome and rarely disclose themselves in UA, and not respect robots.txt, and no rate control for smaller sites.<p>I\u2019m not accusing any one engine discussed in this thread, but hearing a proxy vender like <em>decodo</em> providing search give me a feeling there\u2019s non zero over lap to bad search and residential proxy crawler."},"story_title":{"matchLevel":"none","matchedWords":[],"value":"DeepSeek search and fetch \u2013 $0.75 per 1000 successful requests"},"story_url":{"matchLevel":"none","matchedWords":[],"value":"https://api-docs.deepseek.com/guides/search/"}},"_tags":["comment","author_jimmydoe","story_50138531"],"author":"jimmydoe","children":[50144143],"comment_text":"One thing I see on the new gen of ai search bots are they fake chrome and rarely disclose themselves in UA, and not respect robots.txt, and no rate control for smaller sites.<p>I\u2019m not accusing any one engine discussed in this thread, but hearing a proxy vender like decodo providing search give me a feeling there\u2019s non zero over lap to bad search and residential proxy crawler.","created_at":"2026-10-18T18:18:16Z","created_at_i":1792347496,"objectID":"50143783","parent_id":50139953,"story_id":50138531,"story_title":"DeepSeek search and fetch \u2013 $0.75 per 1000 successful requests","story_url":"https://api-docs.deepseek.com/guides/search/","updated_at":"2026-10-18T21:05:11Z"},{"_highlightResult":{"author":{"matchLevel":"none","matchedWords":[],"value":"Havoc"},"comment_text":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["decodo"],"value":"I ended up building an MCP that pulls results from multiple places and dedups it.<p>The free tiers on most are generous enough for normal agent MCP usage<p>Also...pretty sure <em>decodo</em> just launched a search thingie"},"story_title":{"matchLevel":"none","matchedWords":[],"value":"DeepSeek search and fetch \u2013 $0.75 per 1000 successful requests"},"story_url":{"matchLevel":"none","matchedWords":[],"value":"https://api-docs.deepseek.com/guides/search/"}},"_tags":["comment","author_Havoc","story_50138531"],"author":"Havoc","children":[50143783],"comment_text":"I ended up building an MCP that pulls results from multiple places and dedups it.<p>The free tiers on most are generous enough for normal agent MCP usage<p>Also...pretty sure decodo just launched a search thingie","created_at":"2026-10-18T11:06:32Z","created_at_i":1792321592,"objectID":"50139953","parent_id":50139424,"story_id":50138531,"story_title":"DeepSeek search and fetch \u2013 $0.75 per 1000 successful requests","story_url":"https://api-docs.deepseek.com/guides/search/","updated_at":"2026-10-18T18:18:56Z"},{"_highlightResult":{"author":{"matchLevel":"none","matchedWords":[],"value":"nerdsniper"},"comment_text":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["decodo"],"value":"Note that all of these companies are also under the umbrella of Tesonet, a Lithuanian VC firm also headed by Tomas Okmanas (Tom Okman in TFA). Their flagship investments are Nord Security, Hostinger, Oxylabs, Surfshark, <em>Decodo</em>, Mediatech, and nexos.ai - all closely related business models around proxying.<p>They don't seem to have Russian ties: &quot;In 2022, CyberCare opened an office in Lviv, Ukraine. Although planning for the move started before the war, according to Dainius Vanagas, CEO of CyberCare, one of the reasons why it was followed through was a desire to help Ukraine rebuild.&quot;[0]<p>They also donated money to help arm Ukraine.<p>0: <a href=\"https://en.wikipedia.org/wiki/Tesonet\" rel=\"nofollow\">https://en.wikipedia.org/wiki/Tesonet</a>"},"story_title":{"matchLevel":"none","matchedWords":[],"value":"Who owns Express VPN, Nord, Surfshark? VPN relationships explained (2024)"},"story_url":{"matchLevel":"none","matchedWords":[],"value":"https://windscribe.com/blog/the-vpn-relationship-map/"}},"_tags":["comment","author_nerdsniper","story_45469376"],"author":"nerdsniper","children":[45497454,45498065,45499029,45500456,45502167,45505057],"comment_text":"Note that all of these companies are also under the umbrella of Tesonet, a Lithuanian VC firm also headed by Tomas Okmanas (Tom Okman in TFA). Their flagship investments are Nord Security, Hostinger, Oxylabs, Surfshark, Decodo, Mediatech, and nexos.ai - all closely related business models around proxying.<p>They don&#x27;t seem to have Russian ties: &quot;In 2022, CyberCare opened an office in Lviv, Ukraine. Although planning for the move started before the war, according to Dainius Vanagas, CEO of CyberCare, one of the reasons why it was followed through was a desire to help Ukraine rebuild.&quot;[0]<p>They also donated money to help arm Ukraine.<p>0: <a href=\"https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Tesonet\" rel=\"nofollow\">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Tesonet</a>","created_at":"2025-10-06T22:49:15Z","created_at_i":1759790955,"objectID":"45497187","parent_id":45469376,"story_id":45469376,"story_title":"Who owns Express VPN, Nord, Surfshark? VPN relationships explained (2024)","story_url":"https://windscribe.com/blog/the-vpn-relationship-map/","updated_at":"2026-03-05T22:51:40Z"},{"_highlightResult":{"author":{"fullyHighlighted":true,"matchLevel":"full","matchedWords":["decodo"],"value":"<em>decodo</em>"},"comment_text":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["decodo"],"value":"We just open-sourced a server that implements the Model Context Protocol (MCP), designed to connect LLMs and AI apps (like Claude Desktop, Cursor, and Windsurf) directly to <em>Decodo</em>\u2019s platform \u2014 no glue code required.\nThis makes it easy for agents and copilots to access the web, retrieve structured data, and run real scraping tasks through a common protocol. The server includes built-in tools for things like:\nScraping websites as Markdown\nRunning Google or Amazon searches and returning parsed results\nControlling geo-location, language, and token limits via prompt\nIt\u2019s privacy-conscious, region-flexible, and works out of the box with most MCP clients. You can run it locally, or install it in one click via Smithery.\nWe\u2019d love feedback from developers working on:\nLLM agents or autonomous tooling\nAI-based research or retrieval systems\nScraping pipelines or data orchestration tools\nHere\u2019s the repo: <a href=\"https://github.com/Decodo/decodo-mcp-server\">https://github.com/<em>Decodo</em>/<em>decodo</em>-mcp-server</a><p>Let us know what features you\u2019d like to see added, or if you run into any integration issues. We're actively improving this based on early use cases and real-world friction.\n\u2014 The <em>Decodo</em> team"},"story_title":{"matchLevel":"none","matchedWords":[],"value":"Ask HN: What are you working on? (July 2025)"}},"_tags":["comment","author_decodo","story_44702833"],"author":"decodo","comment_text":"We just open-sourced a server that implements the Model Context Protocol (MCP), designed to connect LLMs and AI apps (like Claude Desktop, Cursor, and Windsurf) directly to Decodo\u2019s platform \u2014 no glue code required.\nThis makes it easy for agents and copilots to access the web, retrieve structured data, and run real scraping tasks through a common protocol. The server includes built-in tools for things like:\nScraping websites as Markdown\nRunning Google or Amazon searches and returning parsed results\nControlling geo-location, language, and token limits via prompt\nIt\u2019s privacy-conscious, region-flexible, and works out of the box with most MCP clients. You can run it locally, or install it in one click via Smithery.\nWe\u2019d love feedback from developers working on:\nLLM agents or autonomous tooling\nAI-based research or retrieval systems\nScraping pipelines or data orchestration tools\nHere\u2019s the repo: <a href=\"https:&#x2F;&#x2F;github.com&#x2F;Decodo&#x2F;decodo-mcp-server\">https:&#x2F;&#x2F;github.com&#x2F;Decodo&#x2F;decodo-mcp-server</a><p>Let us know what features you\u2019d like to see added, or if you run into any integration issues. We&#x27;re actively improving this based on early use cases and real-world friction.\n\u2014 The Decodo team","created_at":"2025-07-30T08:14:21Z","created_at_i":1753863261,"objectID":"44731927","parent_id":44702833,"story_id":44702833,"story_title":"Ask HN: What are you working on? (July 2025)","updated_at":"2025-07-30T08:15:08Z"},{"_highlightResult":{"author":{"matchLevel":"none","matchedWords":[],"value":"mathgenius"},"comment_text":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["decodo"],"value":"It's over here: [1]. James Wootton makes some comments about it here [2]. Looks like 1% error rate which I think is too high to do much with, but it is still exciting progress for those of us working in the field!<p>[1] <a href=\"https://quantum-computing.ibm.com/services?services=systems&amp;order=qubits%20DESC&amp;view=table&amp;system=ibm_washington\" rel=\"nofollow\">https://quantum-computing.ibm.com/services?services=systems&amp;...</a><p>[2] <a href=\"https://twitter.com/decodoku/status/1460616092959883265\" rel=\"nofollow\">https://twitter.com/<em>decodo</em>ku/status/1460616092959883265</a>"},"story_title":{"matchLevel":"none","matchedWords":[],"value":"IBM unveils 127-qubit quantum processor"},"story_url":{"matchLevel":"none","matchedWords":[],"value":"https://newsroom.ibm.com/2021-11-16-IBM-Unveils-Breakthrough-127-Qubit-Quantum-Processor"}},"_tags":["comment","author_mathgenius","story_29244732"],"author":"mathgenius","comment_text":"It&#x27;s over here: [1]. James Wootton makes some comments about it here [2]. Looks like 1% error rate which I think is too high to do much with, but it is still exciting progress for those of us working in the field!<p>[1] <a href=\"https:&#x2F;&#x2F;quantum-computing.ibm.com&#x2F;services?services=systems&amp;order=qubits%20DESC&amp;view=table&amp;system=ibm_washington\" rel=\"nofollow\">https:&#x2F;&#x2F;quantum-computing.ibm.com&#x2F;services?services=systems&amp;...</a><p>[2] <a href=\"https:&#x2F;&#x2F;twitter.com&#x2F;decodoku&#x2F;status&#x2F;1460616092959883265\" rel=\"nofollow\">https:&#x2F;&#x2F;twitter.com&#x2F;decodoku&#x2F;status&#x2F;1460616092959883265</a>","created_at":"2021-11-16T23:35:11Z","created_at_i":1637105711,"objectID":"29247628","parent_id":29245650,"story_id":29244732,"story_title":"IBM unveils 127-qubit quantum processor","story_url":"https://newsroom.ibm.com/2021-11-16-IBM-Unveils-Breakthrough-127-Qubit-Quantum-Processor","updated_at":"2024-09-20T09:51:36Z"},{"_highlightResult":{"author":{"matchLevel":"none","matchedWords":[],"value":"acomjean"},"comment_text":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["decodo"],"value":"<em>Decodo</em>va Museum loans art to its corporate members.<p><a href=\"https://decordova.org/join-give/corporate-membership\" rel=\"nofollow\">https://decordova.org/join-give/corporate-membership</a><p>They rotate the art through the year.  Its DeCordova so the quality is highly variable, but its kind or decent.  The artists don't get a lot out of it,  membership and publicity...<p><a href=\"https://decordova.org/join-give/corporate-art-loan\" rel=\"nofollow\">https://decordova.org/join-give/corporate-art-loan</a>"},"story_title":{"matchLevel":"none","matchedWords":[],"value":"Launch HN: Art in Res (YC W20) \u2013 Buy art directly from artists"}},"_tags":["comment","author_acomjean","story_22824618"],"author":"acomjean","comment_text":"Decodova Museum loans art to its corporate members.<p><a href=\"https:&#x2F;&#x2F;decordova.org&#x2F;join-give&#x2F;corporate-membership\" rel=\"nofollow\">https:&#x2F;&#x2F;decordova.org&#x2F;join-give&#x2F;corporate-membership</a><p>They rotate the art through the year.  Its DeCordova so the quality is highly variable, but its kind or decent.  The artists don&#x27;t get a lot out of it,  membership and publicity...<p><a href=\"https:&#x2F;&#x2F;decordova.org&#x2F;join-give&#x2F;corporate-art-loan\" rel=\"nofollow\">https:&#x2F;&#x2F;decordova.org&#x2F;join-give&#x2F;corporate-art-loan</a>","created_at":"2020-04-09T23:42:07Z","created_at_i":1586475727,"objectID":"22828421","parent_id":22825406,"story_id":22824618,"story_title":"Launch HN: Art in Res (YC W20) \u2013 Buy art directly from artists","updated_at":"2024-09-20T06:00:07Z"},{"_highlightResult":{"author":{"matchLevel":"none","matchedWords":[],"value":"unholiness"},"comment_text":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["decodo"],"value":"In a related vein, now that there's qbits to play with on the cloud, there also rudimentary games available that use <i>actual</i> quantum computing!\n<a href=\"https://medium.com/@decodoku/introducing-the-worlds-first-game-for-a-quantum-computer-50640e3c22e4\" rel=\"nofollow\">https://medium.com/@<em>decodo</em>ku/introducing-the-worlds-first-ga...</a><p>It's purely a novelty, of course. But a cool one."},"story_title":{"matchLevel":"none","matchedWords":[],"value":"Designing a Quantum Computing Board Game"},"story_url":{"matchLevel":"none","matchedWords":[],"value":"https://medium.com/@MaryamAshoori/designing-a-quantum-computing-board-game-de4a450cad8c?source=linkShare-82a8964e3ad2-1531274721"}},"_tags":["comment","author_unholiness","story_17503944"],"author":"unholiness","comment_text":"In a related vein, now that there&#x27;s qbits to play with on the cloud, there also rudimentary games available that use <i>actual</i> quantum computing!\n<a href=\"https:&#x2F;&#x2F;medium.com&#x2F;@decodoku&#x2F;introducing-the-worlds-first-game-for-a-quantum-computer-50640e3c22e4\" rel=\"nofollow\">https:&#x2F;&#x2F;medium.com&#x2F;@decodoku&#x2F;introducing-the-worlds-first-ga...</a><p>It&#x27;s purely a novelty, of course. But a cool one.","created_at":"2018-07-11T02:56:40Z","created_at_i":1531277800,"objectID":"17504131","parent_id":17503944,"story_id":17503944,"story_title":"Designing a Quantum Computing Board Game","story_url":"https://medium.com/@MaryamAshoori/designing-a-quantum-computing-board-game-de4a450cad8c?source=linkShare-82a8964e3ad2-1531274721","updated_at":"2024-09-20T02:42:21Z"},{"_highlightResult":{"author":{"matchLevel":"none","matchedWords":[],"value":"Robotbeat"},"comment_text":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["decodo"],"value":"It turns out, though, that those few problems are pretty common.<p>FFT is O(d log d) classically, and O((log d)^2) Quantum mechanically.<p>Gaussian elimination (used to find eigenvectors and eigenvalues) is O(d^3) or O(s * d^2) for classical (non-sparse and sparse, respectively) versus O((log d)^2) for Quantum.<p>(And similar speed up for Matrix inversion.)<p>FFT? Matrix inversion? Gaussian elimination? Super common. And in the case of Gaussian elimination, it gets pretty hard pretty fast.<p>You're right that we still have to scale with proper error correction, but the fact that quantum error correction is <i>possible</i> is very good news for the future of quantum computing. And the best, ~50-bit quantum computers are approaching what is needed for a fully error corrected qubit, although proper connectivity needs some work.<p>So you're right to be wary of the current status of quantum computing, but I think you're wrong about Moore's Law, here. Qubits can be and are made with photolithographically scalable techniques today with error rates that approach what's needed for error correction, even taking into account some of the problems that integration causes for integration. And, in fact, error correction is what <i>enables</i> us to scale quantum computing (although there are still some calculations we can do without error correction).<p>I do think we're pretty close to a threshold, here, with quantum computing. We are probably under one or two years away from &quot;quantum supremacy,&quot; if you accept having a quantum computer too sophisticated to reliably simulate classically.<p>Some resources:\nGoogle talk about Quantum computing engineering work being done at MIT Lincoln:\n<a href=\"https://www.youtube.com/watch?v=Jgc20Xc8IpA\" rel=\"nofollow\">https://www.youtube.com/watch?v=Jgc20Xc8IpA</a><p>This man's blog is fantastic:\n<a href=\"https://medium.com/@decodoku/latest\" rel=\"nofollow\">https://medium.com/@<em>decodo</em>ku/latest</a>\n...with a usefully skeptical take here:\n<a href=\"https://medium.com/@decodoku/quantum-computing-is-not-as-close-as-you-might-have-heard-e26ad533409\" rel=\"nofollow\">https://medium.com/@<em>decodo</em>ku/quantum-computing-is-not-as-clo...</a><p>We aren't 3 years away from breaking encryption using Shor's Algorithm. We're probably at least a decade away. But there ARE a bunch of uses for quantum computing that don't require as many qubits. A few hundred physical qubits is still enough to do things that wouldn't be feasible with classical computing."},"story_title":{"matchLevel":"none","matchedWords":[],"value":"Classical Cryptography Will Survive Quantum Computers"},"story_url":{"matchLevel":"none","matchedWords":[],"value":"http://nautil.us/blog/-how-classical-cryptography-will-survive-quantum-computers"}},"_tags":["comment","author_Robotbeat","story_16029108"],"author":"Robotbeat","children":[16031394,16032533],"comment_text":"It turns out, though, that those few problems are pretty common.<p>FFT is O(d log d) classically, and O((log d)^2) Quantum mechanically.<p>Gaussian elimination (used to find eigenvectors and eigenvalues) is O(d^3) or O(s * d^2) for classical (non-sparse and sparse, respectively) versus O((log d)^2) for Quantum.<p>(And similar speed up for Matrix inversion.)<p>FFT? Matrix inversion? Gaussian elimination? Super common. And in the case of Gaussian elimination, it gets pretty hard pretty fast.<p>You&#x27;re right that we still have to scale with proper error correction, but the fact that quantum error correction is <i>possible</i> is very good news for the future of quantum computing. And the best, ~50-bit quantum computers are approaching what is needed for a fully error corrected qubit, although proper connectivity needs some work.<p>So you&#x27;re right to be wary of the current status of quantum computing, but I think you&#x27;re wrong about Moore&#x27;s Law, here. Qubits can be and are made with photolithographically scalable techniques today with error rates that approach what&#x27;s needed for error correction, even taking into account some of the problems that integration causes for integration. And, in fact, error correction is what <i>enables</i> us to scale quantum computing (although there are still some calculations we can do without error correction).<p>I do think we&#x27;re pretty close to a threshold, here, with quantum computing. We are probably under one or two years away from &quot;quantum supremacy,&quot; if you accept having a quantum computer too sophisticated to reliably simulate classically.<p>Some resources:\nGoogle talk about Quantum computing engineering work being done at MIT Lincoln:\n<a href=\"https:&#x2F;&#x2F;www.youtube.com&#x2F;watch?v=Jgc20Xc8IpA\" rel=\"nofollow\">https:&#x2F;&#x2F;www.youtube.com&#x2F;watch?v=Jgc20Xc8IpA</a><p>This man&#x27;s blog is fantastic:\n<a href=\"https:&#x2F;&#x2F;medium.com&#x2F;@decodoku&#x2F;latest\" rel=\"nofollow\">https:&#x2F;&#x2F;medium.com&#x2F;@decodoku&#x2F;latest</a>\n...with a usefully skeptical take here:\n<a href=\"https:&#x2F;&#x2F;medium.com&#x2F;@decodoku&#x2F;quantum-computing-is-not-as-close-as-you-might-have-heard-e26ad533409\" rel=\"nofollow\">https:&#x2F;&#x2F;medium.com&#x2F;@decodoku&#x2F;quantum-computing-is-not-as-clo...</a><p>We aren&#x27;t 3 years away from breaking encryption using Shor&#x27;s Algorithm. We&#x27;re probably at least a decade away. But there ARE a bunch of uses for quantum computing that don&#x27;t require as many qubits. A few hundred physical qubits is still enough to do things that wouldn&#x27;t be feasible with classical computing.","created_at":"2017-12-29T18:26:52Z","created_at_i":1514572012,"objectID":"16030949","parent_id":16030164,"story_id":16029108,"story_title":"Classical Cryptography Will Survive Quantum Computers","story_url":"http://nautil.us/blog/-how-classical-cryptography-will-survive-quantum-computers","updated_at":"2024-09-20T01:50:05Z"},{"_highlightResult":{"author":{"matchLevel":"none","matchedWords":[],"value":"brador"},"title":{"matchLevel":"none","matchedWords":[],"value":"How to Program a Quantum Computer"},"url":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["decodo"],"value":"https://medium.com/@<em>decodo</em>ku/how-to-program-a-quantum-computer-982a9329ed02"}},"_tags":["story","author_brador","story_14475714"],"author":"brador","created_at":"2017-06-03T10:18:04Z","created_at_i":1496485084,"num_comments":0,"objectID":"14475714","points":3,"story_id":14475714,"title":"How to Program a Quantum Computer","updated_at":"2024-09-20T00:55:34Z","url":"https://medium.com/@decodoku/how-to-program-a-quantum-computer-982a9329ed02"},{"_highlightResult":{"author":{"matchLevel":"none","matchedWords":[],"value":"eriknstr"},"title":{"matchLevel":"none","matchedWords":[],"value":"How to make a game for a quantum computer"},"url":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["decodo"],"value":"https://medium.com/@<em>decodo</em>ku/how-to-program-a-quantum-computer-982a9329ed02"}},"_tags":["story","author_eriknstr","story_14473382"],"author":"eriknstr","created_at":"2017-06-02T21:17:39Z","created_at_i":1496438259,"num_comments":0,"objectID":"14473382","points":3,"story_id":14473382,"title":"How to make a game for a quantum computer","updated_at":"2024-09-20T00:55:22Z","url":"https://medium.com/@decodoku/how-to-program-a-quantum-computer-982a9329ed02"},{"_highlightResult":{"author":{"matchLevel":"none","matchedWords":[],"value":"konker"},"title":{"matchLevel":"none","matchedWords":[],"value":"Quantum Error Correction: The Game"},"url":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["decodo"],"value":"http://<em>decodo</em>ku.blogspot.com/2016/03/quantum-error-correction-game.html?m=1"}},"_tags":["story","author_konker","story_11378549"],"author":"konker","created_at":"2016-03-29T00:07:51Z","created_at_i":1459210071,"num_comments":0,"objectID":"11378549","points":2,"story_id":11378549,"title":"Quantum Error Correction: The Game","updated_at":"2024-09-19T23:02:50Z","url":"http://decodoku.blogspot.com/2016/03/quantum-error-correction-game.html?m=1"},{"_highlightResult":{"author":{"matchLevel":"none","matchedWords":[],"value":"zeep"},"title":{"matchLevel":"none","matchedWords":[],"value":"Making a quantum computer smile"},"url":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["decodo"],"value":"https://medium.com/@<em>decodo</em>ku/making-a-quantum-computer-smile-cee86a6fc1de"}},"_tags":["story","author_zeep","story_15614570"],"author":"zeep","created_at":"2017-11-02T21:45:53Z","created_at_i":1509659153,"num_comments":0,"objectID":"15614570","points":1,"story_id":15614570,"title":"Making a quantum computer smile","updated_at":"2024-09-20T01:33:35Z","url":"https://medium.com/@decodoku/making-a-quantum-computer-smile-cee86a6fc1de"},{"_highlightResult":{"author":{"matchLevel":"none","matchedWords":[],"value":"mbroncano"},"title":{"matchLevel":"none","matchedWords":[],"value":"How to program a quantum computer"},"url":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["decodo"],"value":"https://medium.com/@<em>decodo</em>ku/how-to-program-a-quantum-computer-982a9329ed02"}},"_tags":["story","author_mbroncano","story_14925147"],"author":"mbroncano","created_at":"2017-08-03T23:52:58Z","created_at_i":1501804378,"num_comments":0,"objectID":"14925147","points":1,"story_id":14925147,"title":"How to program a quantum computer","updated_at":"2024-09-20T01:07:47Z","url":"https://medium.com/@decodoku/how-to-program-a-quantum-computer-982a9329ed02"},{"_highlightResult":{"author":{"matchLevel":"none","matchedWords":[],"value":"speerer"},"title":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["decodo"],"value":"<em>Decodi</em>ng the obfuscated bash script on a Uniqlo t-shirt"},"url":{"matchLevel":"none","matchedWords":[],"value":"https://tris.sherliker.net/blog/obfuscated-self-evaluating-bash-script-by-cdn-akamai-being-supplied-to-consumers-via-retail-stores/"}},"_tags":["story","author_speerer","story_48829312"],"author":"speerer","children":[48829568,48829600,48829647,48829763,48829847,48829911,48829917,48829971,48829994,48830006,48830022,48830025,48830047,48830187,48830198,48830259,48830307,48830357,48830365,48830489,48830530,48830535,48830579,48830647,48830656,48830669,48830748,48830771,48830776,48830781,48830791,48831029,48831060,48831091,48831150,48831192,48831214,48831244,48831247,48831320,48831412,48831535,48831605,48831703,48831786,48831977,48831999,48832061,48832098,48832263,48832380,48832496,48832544,48832889,48832938,48832948,48833151,48833193,48833403,48833544,48834162,48834171,48834256,48834630,48836089,48837673,48837843,48838187,48838402,48838578,48839162,48839178,48839741,48840397,48841516,48841792,48842624,48842747,48843633,48844632,48847161,48847570,48858176,48858933,48861573],"created_at":"2026-07-08T08:46:06Z","created_at_i":1783500366,"num_comments":232,"objectID":"48829312","points":1489,"story_id":48829312,"title":"Decoding the obfuscated bash script on a Uniqlo t-shirt","updated_at":"2026-10-31T00:29:34Z","url":"https://tris.sherliker.net/blog/obfuscated-self-evaluating-bash-script-by-cdn-akamai-being-supplied-to-consumers-via-retail-stores/"},{"_highlightResult":{"author":{"matchLevel":"none","matchedWords":[],"value":"aurenvale"},"title":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["decodo"],"value":"DSpark: Speculative <em>decodi</em>ng accelerates LLM inference [pdf]"},"url":{"matchLevel":"none","matchedWords":[],"value":"https://github.com/deepseek-ai/DeepSpec/blob/main/DSpark_paper.pdf"}},"_tags":["story","author_aurenvale","story_48696585"],"author":"aurenvale","children":[48696790,48696806,48696810,48696867,48696874,48696909,48696913,48696940,48697050,48697056,48697144,48697240,48697258,48697264,48697761,48698167,48698393,48698426,48698632,48698672,48698927,48699291,48699678,48699767,48700006,48700233,48702194,48703318],"created_at":"2026-06-27T09:18:52Z","created_at_i":1782551932,"num_comments":361,"objectID":"48696585","points":797,"story_id":48696585,"title":"DSpark: Speculative decoding accelerates LLM inference [pdf]","updated_at":"2026-08-16T16:16:15Z","url":"https://github.com/deepseek-ai/DeepSpec/blob/main/DSpark_paper.pdf"},{"_highlightResult":{"author":{"matchLevel":"none","matchedWords":[],"value":"jackcook"},"title":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["decodo"],"value":"MeshGPT: Generating triangle meshes with <em>decode</em>r-only transformers"},"url":{"matchLevel":"none","matchedWords":[],"value":"https://nihalsid.github.io/mesh-gpt/"}},"_tags":["story","author_jackcook","story_38448653"],"author":"jackcook","children":[38449072,38449092,38449170,38449196,38449218,38449242,38449266,38449347,38449473,38449499,38449513,38449711,38449736,38449762,38449850,38449972,38450064,38450435,38450488,38451906,38452996,38453792,38453879,38454444,38454669,38456210,38456486,38457122,38457126,38459972],"created_at":"2023-11-28T17:56:36Z","created_at_i":1701194196,"num_comments":157,"objectID":"38448653","points":738,"story_id":38448653,"title":"MeshGPT: Generating triangle meshes with decoder-only transformers","updated_at":"2025-08-14T22:51:35Z","url":"https://nihalsid.github.io/mesh-gpt/"},{"_highlightResult":{"author":{"matchLevel":"none","matchedWords":[],"value":"est31"},"title":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["decodo"],"value":"Wuffs\u2019 PNG image <em>decode</em>r"},"url":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["decodo"],"value":"https://nigeltao.github.io/blog/2021/fastest-safest-png-<em>decode</em>r.html"}},"_tags":["story","author_est31","story_26714831"],"author":"est31","children":[26715115,26715150,26715254,26715349,26715576,26715680,26715689,26715828,26715882,26716246,26716385,26716896,26717057,26717281,26717319,26717959,26717963,26717965,26718741,26719092,26720542,26720788,26721023,26721278,26721722,26721961,26722250,26723077,26723923],"created_at":"2021-04-06T17:32:24Z","created_at_i":1617730344,"num_comments":138,"objectID":"26714831","points":462,"story_id":26714831,"title":"Wuffs\u2019 PNG image decoder","updated_at":"2026-10-19T23:17:43Z","url":"https://nigeltao.github.io/blog/2021/fastest-safest-png-decoder.html"},{"_highlightResult":{"author":{"matchLevel":"none","matchedWords":[],"value":"zhisbug"},"title":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["decodo"],"value":"Consistency LLM: converting LLMs to parallel <em>decode</em>rs accelerates inference 3.5x"},"url":{"matchLevel":"none","matchedWords":[],"value":"https://hao-ai-lab.github.io/blogs/cllm/"}},"_tags":["story","author_zhisbug","story_40302201"],"author":"zhisbug","children":[40302564,40302569,40302584,40302689,40302970,40303071,40303122,40303128,40303311,40303379,40303428,40303450,40303643,40303724,40303845,40303926,40305470,40305627,40307391],"created_at":"2024-05-08T19:55:07Z","created_at_i":1715198107,"num_comments":98,"objectID":"40302201","points":461,"story_id":40302201,"title":"Consistency LLM: converting LLMs to parallel decoders accelerates inference 3.5x","updated_at":"2026-05-30T20:15:27Z","url":"https://hao-ai-lab.github.io/blogs/cllm/"}],"hitsPerPage":20,"nbHits":45729,"nbPages":50,"page":0,"params":"query=decodo&advancedSyntax=true&analyticsTags=backend","processingTimeMS":10,"processingTimingsMS":{"_request":{"queue":6,"roundTrip":22},"afterFetch":{"merge":{"mergeLoop":{"prepareNextHit":2,"total":2},"total":2},"total":2},"fetch":{"query":3,"scanning":3,"total":7},"total":10},"query":"decodo","serverTimeMS":17}
