<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Hacker News: lpage</title><link>https://news.ycombinator.com/user?id=lpage</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Mon, 27 Apr 2026 18:07:58 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=lpage" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[NTP at NIST Boulder Has Lost Power]]></title><description><![CDATA[
<p>Article URL: <a href="https://lists.nanog.org/archives/list/nanog@lists.nanog.org/message/ACADD3NKOG2QRWZ56OSNNG7UIEKKTZXL/">https://lists.nanog.org/archives/list/nanog@lists.nanog.org/message/ACADD3NKOG2QRWZ56OSNNG7UIEKKTZXL/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=46334299">https://news.ycombinator.com/item?id=46334299</a></p>
<p>Points: 488</p>
<p># Comments: 210</p>
]]></description><pubDate>Sat, 20 Dec 2025 07:39:26 +0000</pubDate><link>https://lists.nanog.org/archives/list/nanog@lists.nanog.org/message/ACADD3NKOG2QRWZ56OSNNG7UIEKKTZXL/</link><dc:creator>lpage</dc:creator><comments>https://news.ycombinator.com/item?id=46334299</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46334299</guid></item><item><title><![CDATA[New comment by lpage in "The AI Boom Needs a Market for Compute"]]></title><description><![CDATA[
<p><a href="https://archive.is/mGsFm" rel="nofollow">https://archive.is/mGsFm</a></p>
]]></description><pubDate>Fri, 26 Sep 2025 20:05:14 +0000</pubDate><link>https://news.ycombinator.com/item?id=45390503</link><dc:creator>lpage</dc:creator><comments>https://news.ycombinator.com/item?id=45390503</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45390503</guid></item><item><title><![CDATA[The AI Boom Needs a Market for Compute]]></title><description><![CDATA[
<p>Article URL: <a href="https://www.bloomberg.com/news/articles/2025-09-26/the-ai-boom-needs-a-market-for-compute-just-like-oil-and-spectrum">https://www.bloomberg.com/news/articles/2025-09-26/the-ai-boom-needs-a-market-for-compute-just-like-oil-and-spectrum</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=45390497">https://news.ycombinator.com/item?id=45390497</a></p>
<p>Points: 5</p>
<p># Comments: 1</p>
]]></description><pubDate>Fri, 26 Sep 2025 20:04:47 +0000</pubDate><link>https://www.bloomberg.com/news/articles/2025-09-26/the-ai-boom-needs-a-market-for-compute-just-like-oil-and-spectrum</link><dc:creator>lpage</dc:creator><comments>https://news.ycombinator.com/item?id=45390497</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45390497</guid></item><item><title><![CDATA[Polyhedral Compilation]]></title><description><![CDATA[
<p>Article URL: <a href="http://polyhedral.info/">http://polyhedral.info/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=42806518">https://news.ycombinator.com/item?id=42806518</a></p>
<p>Points: 32</p>
<p># Comments: 7</p>
]]></description><pubDate>Thu, 23 Jan 2025 18:27:49 +0000</pubDate><link>http://polyhedral.info/</link><dc:creator>lpage</dc:creator><comments>https://news.ycombinator.com/item?id=42806518</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42806518</guid></item><item><title><![CDATA[New comment by lpage in "Always Run an Auction"]]></title><description><![CDATA[
<p>As an auction theorist who's biased towards putting things in auctions and as an operator who's been through the venture investment process several times, I'm biased in wanting a more efficient capital formation process with less adverse selection (better outcomes) for both sides. So, I'm doubly biased, but I appreciate why this hasn't been done and that it <i>could</i> be done.<p>Classical auctions aren't a good fit because they can't handle non-price factors. However, a combinatorial clock auction could handle non-price factors while also improving price discovery. But as Milgrom says (paraphrased), the best auction is the one people use, so the more realistic outcome is what OP describes: running your own (implicit) auction.</p>
]]></description><pubDate>Tue, 17 Dec 2024 17:51:54 +0000</pubDate><link>https://news.ycombinator.com/item?id=42443472</link><dc:creator>lpage</dc:creator><comments>https://news.ycombinator.com/item?id=42443472</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42443472</guid></item><item><title><![CDATA[New comment by lpage in "Pkl, a Programming Language for Configuration"]]></title><description><![CDATA[
<p>Your mention of Futamura Projections was a nice reminder of how very mathy/theoretical foundations underpin Nice Things in high-level languages, like Hindley–Milner inspired type systems and modern optimizing compilers targeting SSA form. Value Lattices in Cue [1], another config programmable configuration language, also fall into this bucket.<p>[1]: <a href="https://cuelang.org/docs/concepts/logic/" rel="nofollow">https://cuelang.org/docs/concepts/logic/</a></p>
]]></description><pubDate>Sat, 03 Feb 2024 15:52:27 +0000</pubDate><link>https://news.ycombinator.com/item?id=39241468</link><dc:creator>lpage</dc:creator><comments>https://news.ycombinator.com/item?id=39241468</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=39241468</guid></item><item><title><![CDATA[New comment by lpage in "The Raft Consensus Algorithm (2015)"]]></title><description><![CDATA[
<p>Maelstrom [1], a workbench for learning distributed systems from the creator of Jepsen, includes a simple (model-checked) implementation of Raft and an excellent tutorial on implementing it.<p>Raft is a simple algorithm, but as others have noted, the original paper includes many correctness details often brushed over in toy implementations. Furthermore, the fallibility of real-world hardware (handling memory/disk corruption and grey failures), the requirements of real-world systems with tight latency SLAs, and a need for things like flexible quorum/dynamic cluster membership make implementing it for production a long and daunting task. The commit history of etcd and hashicorp/raft, likely the two most battle-tested open source implementations of raft that still surface correctness bugs on the regular tell you all you need to know.<p>The tigerbeetle team talks in detail about the real-world aspects of distributed systems on imperfect hardware/non-abstracted system models, and why they chose viewstamp replication, which predates Paxos but looks more like Raft.<p>[1]: <a href="https://github.com/jepsen-io/maelstrom/">https://github.com/jepsen-io/maelstrom/</a><p>[2]: <a href="https://github.com/tigerbeetle/tigerbeetle/blob/main/docs/DESIGN.md">https://github.com/tigerbeetle/tigerbeetle/blob/main/docs/DE...</a></p>
]]></description><pubDate>Sun, 03 Sep 2023 14:29:32 +0000</pubDate><link>https://news.ycombinator.com/item?id=37370718</link><dc:creator>lpage</dc:creator><comments>https://news.ycombinator.com/item?id=37370718</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=37370718</guid></item><item><title><![CDATA[New comment by lpage in "Vickrey Auction"]]></title><description><![CDATA[
<p>This thread [1] covering the 2020 Prize in Economic Sciences, awarded to Paul Milgrom and Bob Wilson for their improvement of auction theory, is a good read.<p>Vickery Auctions are one of many in the auction format bestiary, and like all classical formats, they predate both computers and modern auction theory. What's really cool these days (and I'm admittedly biased since it's my space) sits at the intersection of computer science and economics. Economic mechanisms and auction formats that use everything from SAT solving and combinatorial optimization to machine learning and function approximation to drive better real-world economic outcomes.<p>[1]: <a href="https://news.ycombinator.com/item?id=24753291">https://news.ycombinator.com/item?id=24753291</a></p>
]]></description><pubDate>Thu, 29 Jun 2023 18:27:28 +0000</pubDate><link>https://news.ycombinator.com/item?id=36524656</link><dc:creator>lpage</dc:creator><comments>https://news.ycombinator.com/item?id=36524656</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=36524656</guid></item><item><title><![CDATA[New comment by lpage in "Fast midpoint between two integers without overflow"]]></title><description><![CDATA[
<p>Joshua Bloch did a great post [1] on how nearly all standard library binary searches and mergesorts were broken (as of 2006) due to this exact issue. The punchline is that the bugs started cropping up when the need and capability to sort O(2^32) element arrays arose.<p>[1]: <a href="https://ai.googleblog.com/2006/06/extra-extra-read-all-about-it-nearly.html" rel="nofollow">https://ai.googleblog.com/2006/06/extra-extra-read-all-about...</a></p>
]]></description><pubDate>Wed, 07 Dec 2022 14:38:31 +0000</pubDate><link>https://news.ycombinator.com/item?id=33894775</link><dc:creator>lpage</dc:creator><comments>https://news.ycombinator.com/item?id=33894775</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=33894775</guid></item><item><title><![CDATA[IGS is adopting a new reference frame on 27 November 2022]]></title><description><![CDATA[
<p>Article URL: <a href="https://igs.org/news/igs20/">https://igs.org/news/igs20/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=33759237">https://news.ycombinator.com/item?id=33759237</a></p>
<p>Points: 1</p>
<p># Comments: 0</p>
]]></description><pubDate>Sun, 27 Nov 2022 01:51:41 +0000</pubDate><link>https://igs.org/news/igs20/</link><dc:creator>lpage</dc:creator><comments>https://news.ycombinator.com/item?id=33759237</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=33759237</guid></item><item><title><![CDATA[Fed increases target rate to 3.75-4.00%]]></title><description><![CDATA[
<p>Article URL: <a href="https://www.federalreserve.gov/newsevents/pressreleases/monetary20221102a.htm">https://www.federalreserve.gov/newsevents/pressreleases/monetary20221102a.htm</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=33440252">https://news.ycombinator.com/item?id=33440252</a></p>
<p>Points: 40</p>
<p># Comments: 173</p>
]]></description><pubDate>Wed, 02 Nov 2022 18:00:37 +0000</pubDate><link>https://www.federalreserve.gov/newsevents/pressreleases/monetary20221102a.htm</link><dc:creator>lpage</dc:creator><comments>https://news.ycombinator.com/item?id=33440252</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=33440252</guid></item><item><title><![CDATA[New comment by lpage in "What does it take to test a sorting routine? (2010)"]]></title><description><![CDATA[
<p>Imandra [1] has an excellent literate programming walkthrough that hits on the same issues and plugs the holes one by one using formal methods, ultimately proving merge sort correct.<p>[1] <a href="https://docs.imandra.ai/imandra-docs/notebooks/verifying-merge-sort/" rel="nofollow">https://docs.imandra.ai/imandra-docs/notebooks/verifying-mer...</a></p>
]]></description><pubDate>Tue, 16 Aug 2022 12:26:23 +0000</pubDate><link>https://news.ycombinator.com/item?id=32481900</link><dc:creator>lpage</dc:creator><comments>https://news.ycombinator.com/item?id=32481900</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=32481900</guid></item><item><title><![CDATA[New comment by lpage in "Decentralized cluster membership in Rust"]]></title><description><![CDATA[
<p>The source itself is commercial AGPL v3.0. I'm guessing that this was an accident so I opened <a href="https://github.com/quickwit-oss/chitchat/issues/42" rel="nofollow">https://github.com/quickwit-oss/chitchat/issues/42</a> to clarify.</p>
]]></description><pubDate>Thu, 28 Apr 2022 12:04:00 +0000</pubDate><link>https://news.ycombinator.com/item?id=31191498</link><dc:creator>lpage</dc:creator><comments>https://news.ycombinator.com/item?id=31191498</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=31191498</guid></item><item><title><![CDATA[New comment by lpage in "Launch HN: OneChronos (YC S16) – Combinatorial auctions market for US equities"]]></title><description><![CDATA[
<p>>  let's say hypothetically you create a market for "+100 FB shares, -500 SNAP shares". If everyone is competing on price to quote that combination, that creates the most competitive market<p>Some combinatorial auctions make this tradeoff, packaging goods either to deal with computational limitations or to concentrate bidding on a few packages. It can work if there's near total consensus on what the economically relevant packages are, but it doesn't work otherwise. US equities is an "otherwise" case given a huge diversity of needs. The chance of someone wanting the opposite side of even a pairs trade at any given point in time is vanishingly rare. It's far more likely that the person doing the pair would interact with two or more counterparties independently actively interested in or willing to for the right price sell FB and buy SNAP (perhaps conditional on hedging). The mechanism design game is more about giving every party the tools they need to communicate their value function to the auctioneer and creating the incentives to bid (close to) truthfully.<p>> However, if there are many expressive bids with various conditions (e.g. minimum quantities, conditional on execution of another leg, etc), they may not get "implied" into creating a reasonable market, creating exponentially more arbitrage opportunities if they become locked/crossed.<p>And this is why combinatorial auctions are a global optimization (as opposed to implied, which are effectively an iterative and greedy approximation) and, in our case, one that seeks to find uniform clearing prices. There are formats with price discrimination and others in which mechanical arbitrage within an auction is possible, but ours is not one of them. There isn't a separate price for {A}, {B}, and {A, B} — within each auction there's a uniform price for p_a and p_b, and p_{a,b} = p_a + p_b (and so on for any arbitrary linear combination). Theoretical point: linear prices don't always exist (in practice, they do for interdependent value goods that aren't strongly sub or superadditive, e.g., capital market goods), and they're not inherently desirable. We chose linear pricing largely because it's a natural fit for how capital markets work now, and perceived fairness/simplicity is itself a valid mechanism design consideration.</p>
]]></description><pubDate>Wed, 09 Feb 2022 05:32:42 +0000</pubDate><link>https://news.ycombinator.com/item?id=30269245</link><dc:creator>lpage</dc:creator><comments>https://news.ycombinator.com/item?id=30269245</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=30269245</guid></item><item><title><![CDATA[New comment by lpage in "Launch HN: OneChronos (YC S16) – Combinatorial auctions market for US equities"]]></title><description><![CDATA[
<p>> Congrats on the launch! What are the main benefits of this approach compared to creating additional combo (multi-leg) products on existing exchanges?<p>Thanks! There are two main differences. For one, combos are (as the name suggests) predefined. That works reasonably well for products like futures and options where the 80/20 approach of making combos for somewhat structural ones like different expiries in the crude and eurodollar complex or packs and bundles designed as standalone financial instruments/hedges. An implied generational liquidity mechanism can knock out some basic structural price arbs between combos, resulting in a combinatorial auction approximation.<p>This approach falls apart when the combinations are very general as they are in the markets for equities, credit, and many of the assets that trade in the screens.<p>The CLOB/predefined bundle approach also doesn't address substitutability and non-price factors, and dealing with those is key to unlocking Pareto efficiencies.<p>> There are already a lot of mechanisms in traditional markets that deal with revealing or concealing true demand (e.g. block trades, icebergs, etc)<p>The problem with block trading venues and other approaches, e.g., conditionals, boils down to incentives. Initiators of block trades are usually going in the same direction, so opportunities for direct interaction/coincidence of wants are rare. And market makers don't want to take large deltas unless they can hedge and/or know the counterparty. The net effect is not much size getting done. Conditionals are a similar story to blocks. They don't have the opportunity cost that a firm block resting on a venue does, but there's information leakage, and the surface area for interaction is still small. Market makers aren't incentivized to provide liquidity, and directional traders are worried about/behave strategically due to concerns over information leakage.<p>> what's to stop exchanges from (1) creating more common bundles that people want to trade<p>I'd say that the market has already done this in the form of ETFs and index products and an entire ecosystem of ETF market making emerged around it.<p>> (2) matching them with price-time priority so everyone gets a fair price? Wouldn't the auction model just create wider or locked/crossed markets?<p>I'm not sure that I follow this part entirely. The uniform price combinatorial auction that we're running results in everyone getting the same price on a symbol-by-symbol basis. And, we view time priority as a bad thing (the arms race dynamic of time priority was known to practitioners since markets first started going electronic but Budish et al. were the first to write about it in detail). Periodic auctions have better fairness and post-trade mark outs theoretically and in practice. Some of the European venues where batch auctions have made limited inroads demonstrated this.</p>
]]></description><pubDate>Wed, 09 Feb 2022 04:23:01 +0000</pubDate><link>https://news.ycombinator.com/item?id=30268786</link><dc:creator>lpage</dc:creator><comments>https://news.ycombinator.com/item?id=30268786</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=30268786</guid></item><item><title><![CDATA[New comment by lpage in "Launch HN: OneChronos (YC S16) – Combinatorial auctions market for US equities"]]></title><description><![CDATA[
<p>> Are you expecting to only support institutional investors or retail order flow as well?<p>We don't segment the market at all or exclude subscribers (beyond requiring that they're FINRA registered BDs), but the way that PFOF works means that we likely won't see retail order flow from the brokers that wholesale it. We do view Smart Markets as a win/win/win/win for retail customers, brokers, market makers, and regulators alike (cleaner routing, better transparency and price formation, better allocative outcomes, lower technology costs).<p>> How does the expressive bidding interact with NBBO held orders?<p><a href="https://news.ycombinator.com/item?id=30257586" rel="nofollow">https://news.ycombinator.com/item?id=30257586</a><p>Expanding on that a bit—we have the standard Rule 611 requirements, meaning that we clear within the NBBO on a symbol by symbol basis. We don't route.</p>
]]></description><pubDate>Tue, 08 Feb 2022 21:06:41 +0000</pubDate><link>https://news.ycombinator.com/item?id=30264701</link><dc:creator>lpage</dc:creator><comments>https://news.ycombinator.com/item?id=30264701</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=30264701</guid></item><item><title><![CDATA[New comment by lpage in "Launch HN: OneChronos (YC S16) – Combinatorial auctions market for US equities"]]></title><description><![CDATA[
<p>Thanks! We found that the "UX" aspect of fitting squarely into existing workflows to disrupt without disrupting is key—as is how we message the product. Both our focus on solving speed and Expressive Bids as code are "UX" decisions aimed at slotting us into existing market structure and mind space.<p>A surprising (to us) takeaway was that making a product in this space sound "vanilla"/undifferentiated is a good thing. Once folks aren't concerned about an initial integration being a lift, they're happy to onboard us as "just another trading venue" (but with great story about unique liquidity and match quality). Many then get excited about adopting the lowest hanging fruit incrementally for their specific use cases. And after peeling away a few layers of the onion, they get excited about the future state in which others do the same, and what initially seems like incremental change becomes a market structure transformation.<p>We studied the history of adoption in other markets where it's gone well (FCC spectrum, display advertising, procurement) and poorly (OptiMark, POSIT4—great attempts, ahead of their time, killed by complexity and subtle mismatches between the mechanism and market participant needs).</p>
]]></description><pubDate>Tue, 08 Feb 2022 15:07:29 +0000</pubDate><link>https://news.ycombinator.com/item?id=30259230</link><dc:creator>lpage</dc:creator><comments>https://news.ycombinator.com/item?id=30259230</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=30259230</guid></item><item><title><![CDATA[New comment by lpage in "Launch HN: OneChronos (YC S16) – Combinatorial auctions market for US equities"]]></title><description><![CDATA[
<p>This is a significant tailwind for the next wave of electronification that we're hoping to advance. US swap dealers, for example, now have a SEF reporting requirement, but most of the pre-trade is still in the screens. A Smart Market that allows dealers to control for non-price factors could change that.</p>
]]></description><pubDate>Tue, 08 Feb 2022 12:26:28 +0000</pubDate><link>https://news.ycombinator.com/item?id=30257620</link><dc:creator>lpage</dc:creator><comments>https://news.ycombinator.com/item?id=30257620</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=30257620</guid></item><item><title><![CDATA[New comment by lpage in "Launch HN: OneChronos (YC S16) – Combinatorial auctions market for US equities"]]></title><description><![CDATA[
<p>> How do you deal with best execution obligations for the "legs" of your trades?<p>Excellent question. Each leg of the trade comes in as an individual limit order with a price/quantity bound on it. This makes it easy for brokers to satisfy their 15c3-5 requirements since Expressive Bidding can only further restrict these limits. We clear the auction with a constraint that bounds the clearing region to the NBBO, snapshotted at the start of each auction. Rule 611 affords up to 1s if the market moves while we're optimizing, and away market movement has no average effect on execution quality, as auction start times are random and orders are firm.<p>In the future, we'll do ISO sweeps, but their usefulness is somewhat limited since getting fills from a sweep can change what's feasible for the auction. As we gather data on how folks use us, we'll hone on other regulatory options.<p>> What market data do you publish about your order book?<p>We report fills to the TRF to satisfy regulatory reporting requirements, but we're entirely dark otherwise.</p>
]]></description><pubDate>Tue, 08 Feb 2022 12:21:41 +0000</pubDate><link>https://news.ycombinator.com/item?id=30257586</link><dc:creator>lpage</dc:creator><comments>https://news.ycombinator.com/item?id=30257586</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=30257586</guid></item><item><title><![CDATA[New comment by lpage in "Launch HN: OneChronos (YC S16) – Combinatorial auctions market for US equities"]]></title><description><![CDATA[
<p>Thanks! We're quite fortunate in that we always knew roughly where we needed to get to from a technical, business, and regulatory standpoint, so actually getting there was just a long hike on a mostly known path, one step at a time.</p>
]]></description><pubDate>Tue, 08 Feb 2022 05:20:12 +0000</pubDate><link>https://news.ycombinator.com/item?id=30255174</link><dc:creator>lpage</dc:creator><comments>https://news.ycombinator.com/item?id=30255174</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=30255174</guid></item></channel></rss>