<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: jkhdigital</title><link>https://news.ycombinator.com/user?id=jkhdigital</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Mon, 17 Aug 2026 07:04:44 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=jkhdigital" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by jkhdigital in "The Case Against Formal Verification, 50 Years Later"]]></title><description><![CDATA[
<p>Yeah I feel like the hype around “formal methods” is really just a growing interest in expressive type systems that enable more and more program semantics to be declared in code rather than in comments. Correctness is good, but so are portability and modularity and extensibility.</p>
]]></description><pubDate>Mon, 17 Aug 2026 00:54:09 +0000</pubDate><link>https://news.ycombinator.com/item?id=49325419</link><dc:creator>jkhdigital</dc:creator><comments>https://news.ycombinator.com/item?id=49325419</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49325419</guid></item><item><title><![CDATA[New comment by jkhdigital in "LLMs reward expertise"]]></title><description><![CDATA[
<p>But the guy who writes the “just do it” prompt can neither formulate the conjecture in the first place, nor come up with any follow-up questions to build on the result.</p>
]]></description><pubDate>Mon, 03 Aug 2026 23:11:54 +0000</pubDate><link>https://news.ycombinator.com/item?id=49162582</link><dc:creator>jkhdigital</dc:creator><comments>https://news.ycombinator.com/item?id=49162582</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49162582</guid></item><item><title><![CDATA[New comment by jkhdigital in "LearnVector – Andrew Ng's AI company building one‑to‑one learning experiences"]]></title><description><![CDATA[
<p>Math Academy is doing it right. Their neat synthesis of spaced repetition and the knowledge DAG is slick, but honestly the extremely fine-grained skill decomposition is what’s missing in virtually all of higher education. I’m trying to follow MA’s example as I put together curricula for my undergraduate CS courses.</p>
]]></description><pubDate>Wed, 29 Jul 2026 12:01:25 +0000</pubDate><link>https://news.ycombinator.com/item?id=49096334</link><dc:creator>jkhdigital</dc:creator><comments>https://news.ycombinator.com/item?id=49096334</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49096334</guid></item><item><title><![CDATA[New comment by jkhdigital in "LearnVector – Andrew Ng's AI company building one‑to‑one learning experiences"]]></title><description><![CDATA[
<p>The dirty little secret of EdTech is that there is no money in improving learning because there is no way to capture the value. For all but a handful of highly specialized and insular professions, there is no scalable infrastructure for objectively assessing skill mastery. Most learners don’t want to learn for its own sake, they want a credential that proves their value to potential employers. All of the value in learning accrues to the credential, and everyone in the educational establishment is quite happy reserving that privilege for the accredited universities because they can just bundle more and more products and services into the tuition sticker price without ever having to justify it. Oh, and the student loan racket ensures that enough students are price-insensitive that they’ll never look for alternatives.</p>
]]></description><pubDate>Wed, 29 Jul 2026 11:51:52 +0000</pubDate><link>https://news.ycombinator.com/item?id=49096268</link><dc:creator>jkhdigital</dc:creator><comments>https://news.ycombinator.com/item?id=49096268</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49096268</guid></item><item><title><![CDATA[New comment by jkhdigital in "LearnVector – Andrew Ng's AI company building one‑to‑one learning experiences"]]></title><description><![CDATA[
<p>Most people don’t want to learn, they want a credential. The real hard problem here, that has been sidestepped for decades and decades, is how to gate credentials behind standardized skill assessments rather than branded gatekeepers. Stanford, Harvard and MIT can do whatever they hell they want in the classroom as long as they continue to skim the cream of each generation and no objective assessment exists to demonstrate that they contributed nothing above what their exceptional students probably would’ve done in four years anyway.</p>
]]></description><pubDate>Wed, 29 Jul 2026 11:41:09 +0000</pubDate><link>https://news.ycombinator.com/item?id=49096158</link><dc:creator>jkhdigital</dc:creator><comments>https://news.ycombinator.com/item?id=49096158</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49096158</guid></item><item><title><![CDATA[New comment by jkhdigital in "LearnVector – Andrew Ng's AI company building one‑to‑one learning experiences"]]></title><description><![CDATA[
<p>Yep. Literally every EdTech idea is a rehashing of the same flawed reasoning: we just need better monitoring and metrics to manage everyone’s learning process! No. Learning comes from repetitive deliberate practice in the zone of proximal development. For essentially all knowledge-based skills, what’s missing is the core foundational skill progression that leads to actual mastery.<p>How many different personal training styles do you see for competitive sports? There’s variation, but only at the margins. Nobody deviates from the essential training core because doing so leads to poor performance and competitive failure. And yet we have a total free-for-all in knowledge disciplines where we just throw untrained PhDs in front of a classroom and assume they’ll produce results. Oh, and we also provide zero tangible incentives for them to improve learning outcomes.</p>
]]></description><pubDate>Wed, 29 Jul 2026 11:30:58 +0000</pubDate><link>https://news.ycombinator.com/item?id=49096068</link><dc:creator>jkhdigital</dc:creator><comments>https://news.ycombinator.com/item?id=49096068</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49096068</guid></item><item><title><![CDATA[New comment by jkhdigital in "LearnVector – Andrew Ng's AI company building one‑to‑one learning experiences"]]></title><description><![CDATA[
<p>This is exactly right. I started teaching undergrad CS about 18 months ago after 20 years wandering through other careers, and I quickly realized that students do not need better teaching. They need frequent, direct feedback and an environment that more or less requires them to commit to studying until mastery or to quit early and do something else.<p>Effective learning techniques have been known for decades, but universities have -zero- incentive to improve teaching quality. There is no standardized assessment infrastructure to compare graduates across schools, or to evaluate the effectiveness of teaching interventions at scale. So any effort put into teaching quality is invisible and thus worthless to a university.<p>Every attempt to make high-quality instruction available for free has been largely irrelevant to the unwashed masses, because universities have a monopoly on credentialing. The self-starters can learn anything for free, but they were never the problem. It’s the middle 50% that we have utterly failed.</p>
]]></description><pubDate>Wed, 29 Jul 2026 11:13:43 +0000</pubDate><link>https://news.ycombinator.com/item?id=49095928</link><dc:creator>jkhdigital</dc:creator><comments>https://news.ycombinator.com/item?id=49095928</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49095928</guid></item><item><title><![CDATA[New comment by jkhdigital in "GPT-5.6 used a prompt to close a 30-year gap in convex optimization"]]></title><description><![CDATA[
<p>This is my exact experience right now trying to wade through the research on psychometrics and skill/knowledge assessment design. It’s mostly just applied statistics but like all such fields, over decades of specialization it acquired its own jargon for abstractions that are quickly recognizable to anyone with a sufficiently developed nose for modern mathematics. But you still have to wade through all the definitions to make those connections before you actually understand everything.</p>
]]></description><pubDate>Sun, 19 Jul 2026 07:57:50 +0000</pubDate><link>https://news.ycombinator.com/item?id=48965870</link><dc:creator>jkhdigital</dc:creator><comments>https://news.ycombinator.com/item?id=48965870</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48965870</guid></item><item><title><![CDATA[New comment by jkhdigital in "HackerRank open sourced its ATS. My resume scored 90/100. Oh wait 74. No – 88"]]></title><description><![CDATA[
<p>Saw this comment at the top with 0 replies and thought “How is that possible??” and then saw the “0 minutes ago” timestamp. Only on HN can you stumble into the comments section just moments after a CTO, founder, author, etc. left unfiltered remarks about the exact topic of the post. Never change HN.</p>
]]></description><pubDate>Mon, 29 Jun 2026 12:03:11 +0000</pubDate><link>https://news.ycombinator.com/item?id=48718150</link><dc:creator>jkhdigital</dc:creator><comments>https://news.ycombinator.com/item?id=48718150</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48718150</guid></item><item><title><![CDATA[New comment by jkhdigital in "PivCo-Huffman “merge” operations"]]></title><description><![CDATA[
<p>I love this kind of thing—going to try and use this in my data structures course.</p>
]]></description><pubDate>Mon, 22 Jun 2026 23:56:26 +0000</pubDate><link>https://news.ycombinator.com/item?id=48638225</link><dc:creator>jkhdigital</dc:creator><comments>https://news.ycombinator.com/item?id=48638225</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48638225</guid></item><item><title><![CDATA[New comment by jkhdigital in "Lattice Triangles Are Rare"]]></title><description><![CDATA[
<p>Not sure about the significance of the result here, but this article just gave me the inspiration I needed to solve Project Euler #202: <a href="https://projecteuler.net/problem=202" rel="nofollow">https://projecteuler.net/problem=202</a></p>
]]></description><pubDate>Wed, 17 Jun 2026 11:27:00 +0000</pubDate><link>https://news.ycombinator.com/item?id=48568798</link><dc:creator>jkhdigital</dc:creator><comments>https://news.ycombinator.com/item?id=48568798</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48568798</guid></item><item><title><![CDATA[New comment by jkhdigital in "An OpenAI model has disproved a central conjecture in discrete geometry"]]></title><description><![CDATA[
<p>At this point I think the category theorists hit the foundational idea squarely on the mark:<p>1. Start with a few simple but non-trivial terms and axioms<p>2. Define "universal constructions" as procedures for building uniquely identifiable structures on top of that substrate<p>3. Prove that various assemblages of these universal constructions satisfy the axioms of the substrate itself<p>4. "Lift" every theorem proven from the substrate alone into the more sophisticated construction<p>I'm not a mathematician (I just play one at my job) so the language I've used is probably imprecise but close enough.<p>It may be true that you can't prove the axioms of a system from within the system itself, but that just means that you need to make sure you start from a minimal set of axioms that, in some sense, simply says "this is what it means to exist and to interact with other things that exist". Axioms that merely give you enough to do any kind of mathematics in the first place, that is. If those axioms allow you to cleanly "bootstrap" your way to higher and higher levels up the tower of abstraction by mapping complex things back on to the simple axiomatic things, then you have an "open" or infinitely extensible system.</p>
]]></description><pubDate>Wed, 20 May 2026 23:50:01 +0000</pubDate><link>https://news.ycombinator.com/item?id=48215953</link><dc:creator>jkhdigital</dc:creator><comments>https://news.ycombinator.com/item?id=48215953</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48215953</guid></item><item><title><![CDATA[New comment by jkhdigital in "The foundations of a provably secure operating system (PSOS) (1979) [pdf]"]]></title><description><![CDATA[
<p>I'm going to first apologize for engaging in rhetorical sleight of hand myself, since I indulged in a bit of the hand-wavy argumentation that happens so often in these nit-picky debates. I'm going to respond cleanly here mostly to sharpen my own argumentative saw.<p>The original PSOS paper makes a few claims that are in tension with one another, and then buries the lede about how that tension can be addressed. Here's a few passages, directly quoted from the paper:<p>> [...] there are several important pragmatic reasons why PSOS capabilities are useful as a naming and protection mechanism for supporting abstract objects.<p>> 1. The capability mechanism has a very simple implementation. This allows capabilities to be built into the system at the lowest level of abstraction, thus making capabilities available for the most primitive objects.<p>> 2. Capabilities are uniform in size, making them easy to manage.<p>> 3. The inclusion of access rights in capabilities permits efficient fine-grained control of access to objects.<p>> 4. Capabilities can be written into storage (including secondary storage) and retrieved from storage in the same manner as other data, and therefore have many of the properties of other data.<p>Item 4 above is the one that should draw the most attention. I don't think anyone would contest the claim that PSOS has wonderful ergonomics for managing access to resources, <i>but</i> the moment you want to impose a system-wide access control policy then you must add another security mechanism, completely outside the capability abstraction, that adds some friction. This is fully acknowledged by the PSOS authors, although frankly they buried the lede since this is the only thing that the secure systems folks really cared about at the time. From the section on <i>Store permissions</i>:<p>> Because simplicity of the basic capability mechanism is extremely important to achieve the goals of PSOS, any means for restricting the propagation of capabilities should not add complexity to the capability mechanism. [...] A few access rights (only one is currently used by PSOS itself) are reserved as <i>store permissions</i>. This is the only burden placed on the capability mechanism.<p>> By properly choosing the segments that are capability store limited, some very useful restrictions on the propagation of capabilities can be achieved. The restriction used in PSOS is not allowing a process to pass certain capabilities to other processes or to place these capabilities in storage locations (e.g., a directory or interprocess communication channel) accessible to other processes. [...] The store permission mechanism has been selected as primitive in the system because it achieves the desired result with negligible additional complexity or cost.<p>This appears as claim 8 in the summary section of the paper near the end:<p>> Propagation of capabilities can be restricted by use of capability store permissions. The passage of a capability to other users can be prevented by not including process store permission in that capability's access rights.<p>Ok, so that's the PSOS paper and it's claims. Boebert's paper--really a note, since it is a mere 3 pages--states its argument in fairly direct terms:<p>> The attack is made possible by an inherent attribute of pure capability machines: the right to exercise access carries with it the right to propagate that access. Thus even if an omniscient oracle correctly creates capabilities, it cannot control their further propagation. If extra mechanisms are imposed to impose this control, the machine is no longer an unmodified capability machine.<p>The only issue here is, perhaps, semantic: Boebert (correctly) states that an <i>unmodified</i> capability machine cannot provide what is considered a very basic mandatory security policy, but the PSOS folks already acknowledged this by stating that the system needs a capability store permission manager for mandatory security policy enforcement. The phrasing that they used--"the store permission mechanism has been selected as primitive in the system"--is the bait-and-switch where they treat it like part of the capability model rather than making it clear that it is an entirely distinct mechanism that must be <i>composed</i> with pure capabilities to achieve the (genuinely difficult) security properties that systems designers were seeking.<p>I suspect the horse is already dead it's worth double-tapping to make sure, so let's continue. The <i>Myths</i> paper muddies the waters further by making this claim after supposedly debunking Boebert:<p>> Boebert’s result is valid in any capability system that cannot distinguish between data transfer and capability transfer. But partitioned and type-enforced capability systems do not have this problem, and password capability systems have been engineered to avoid this problem [1, 11].<p>> Moreover, it has been formally verified that any capability system enforcing independent controls on data transfer and capability transfer can enforce both confinement and the *-Property [22].<p>We'll focus on reference [22] since that is the stronger claim here. That paper is Shapiro & Weber (2000) "Verifying the EROS Confinement Mechanism": <a href="https://flint.cs.yale.edu/cs428/doc/eros-verify.pdf" rel="nofollow">https://flint.cs.yale.edu/cs428/doc/eros-verify.pdf</a><p>This is the motivation for their paper, which is stated unambiguously:<p>> Boebert [1] and Karger [9] have argued that unmodified capability systems cannot enforce even basic mandatory access controls such as the *-property. Both have proposed solutions in the form of hybrid protection architectures. Karger has also argued that unmodified capability systems cannot enforce confinement [8]. Given that EROS is a pure capability system, and that its security design rests on its ability to enforce confinement, a rigorous verification of the EROS confinement mechanism is necessary.<p>For some reason, they decide to respond to these claims in the <i>Related work</i> section, just before their conclusion, although they do address them head-on:<p>> Boebert [1] and Karger [9] show that pure capability systems cannot enforce the *-property. While their conclusion is correct, capability systems do provide sufficient strength to construct mandatory policies at a higher level of abstraction with reasonable performance, as has been done in KeySafe [14].<p>> Karger has also shown that unmodified capability systems cannot enforce the confinement policy [8]. The apparent discrepancy results from differences in term definition. Karger’s confinement policy is a mandatory access control policy: "this piece of information must not be disclosed to that set of unauthorized parties." That is, it is a policy concerning the flow of information to subjects. Lampson’s confinement problem [10] imposes a weaker constraint: information can flow out of the subsystem only through authorized channels. That is, in the Lampson definition the channels define an encapsulation boundary to be enforced.<p>> We believe that the KeySafe architecture can enforce both the *-property and Karger’s confinement policy, but this does not directly contradict their claims. KeySafe is a reference monitor built on top of a more primitive capability mechanism; such a reference monitor constitutes a modified capability system in the sense of Karger’s discussion.<p>It's worth questioning whether the <i>Myths</i> authors were justified in citing this paper the way they did. But either way, I think it's pretty clear that once you pin down a precise definition of the terms used in the discussion, there is little disagreement among any of these authors. However, in casual arguments this precision is lost and you end up with a situation where two things are true at the same time but people choose to talk about only one at a time and think they're winning arguments:<p>1. An unmodified capability machine cannot enforce the *-property or mandatory access control confinement policies.<p>2. Modifying a capability machine to enforce such policies (and provide proof of enforcement) is straightforward because there is a single clearly-defined interface through which the systems may be composed.<p>My stance is that the PSOS folks screwed up their marketing. They really do have a superior product, so to speak, but they tried to downplay the fact that it did not provide a solution to the genuinely difficult problem of enforcing MAC policies (which was really about reference monitor discipline, not capabilities or ACLs). The right pitch for ocap design is "we offer a cleaner, more compositional, more auditable substrate for authority management--which is itself a substantial contribution and worth caring about--and on top of that substrate you can build the same MAC policies you'd build on any other substrate, but with better starting axioms and clearer proof structures." That's a contribution that doesn't need to be defended against Boebert because it doesn't claim (or appear to claim) what Boebert showed couldn't be claimed.</p>
]]></description><pubDate>Tue, 19 May 2026 04:07:20 +0000</pubDate><link>https://news.ycombinator.com/item?id=48189052</link><dc:creator>jkhdigital</dc:creator><comments>https://news.ycombinator.com/item?id=48189052</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48189052</guid></item><item><title><![CDATA[New comment by jkhdigital in "AI eats the world (Spring 26) [pdf]"]]></title><description><![CDATA[
<p>Right, the crazy thing is that much of the groundwork for the “rules-and-heuristics” mode of AI was laid down in the 70s and 80s, long before we had the raw compute power to reliably extract patterns from reality-scale inputs. Those early efforts failed miserably mostly because the rules had to be populated manually and in a ridiculously space-inefficient format (compared to the density of information in model weights).<p>So yeah, the next stage is models that basically do what humans do: encode causal models of the world in a composable, symbolic form that can be falsified and refined through interventional experiments.</p>
]]></description><pubDate>Mon, 18 May 2026 14:30:13 +0000</pubDate><link>https://news.ycombinator.com/item?id=48180430</link><dc:creator>jkhdigital</dc:creator><comments>https://news.ycombinator.com/item?id=48180430</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48180430</guid></item><item><title><![CDATA[New comment by jkhdigital in "The foundations of a provably secure operating system (PSOS) (1979) [pdf]"]]></title><description><![CDATA[
<p>No, you’re using the same sleight of hand as the paper.<p>Boebert’s objection is about whether Alice can transmit unauthorized authority to Bob across a security boundary that’s supposed to prevent that flow. Your SCM_RIGHTS example is a case where the kernel is deliberately providing a sanctioned channel for authority transfer, with the kernel’s blessing, between two processes that the kernel does not consider to be on opposite sides of a mandatory access control boundary. Unix has no (*)-property. There is no “high” and “low” in the Bell-LaPadula sense on a standard Unix system. So of course the kernel mediates the transfer cleanly; it’s not enforcing any policy that would be violated by the transfer.<p>The moment you try to extend this to the actual case under dispute—Alice is “high,” Bob is “low,” and the security policy says high-to-low information flow is forbidden—then if the kernel refuses to deliver the fd across the boundary, the security property was enforced <i>by the separate MAC layer</i>, not the capability mechanism.<p>The conflation which is endemic in this whole debate is between “capabilities as a kernel-mediated authority mechanism” and “capabilities as a property that holds across all observable behavior of the system.” Unix file descriptors are the former. Boebert’s objection is about the latter.</p>
]]></description><pubDate>Mon, 18 May 2026 14:00:34 +0000</pubDate><link>https://news.ycombinator.com/item?id=48180037</link><dc:creator>jkhdigital</dc:creator><comments>https://news.ycombinator.com/item?id=48180037</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48180037</guid></item><item><title><![CDATA[New comment by jkhdigital in "The foundations of a provably secure operating system (PSOS) (1979) [pdf]"]]></title><description><![CDATA[
<p>Covert channels are a thing. Shared access to resources <i>always</i> opens the possibility of covert information passing through e.g. modulation of resource usage. This isn’t even out-of-band, it’s just a hard fact that a shared resource always creates a potential covert channel (source: Lampson 1972, <i>A Note on the Confinement Problem</i>).</p>
]]></description><pubDate>Mon, 18 May 2026 13:48:11 +0000</pubDate><link>https://news.ycombinator.com/item?id=48179880</link><dc:creator>jkhdigital</dc:creator><comments>https://news.ycombinator.com/item?id=48179880</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48179880</guid></item><item><title><![CDATA[New comment by jkhdigital in "The foundations of a provably secure operating system (PSOS) (1979) [pdf]"]]></title><description><![CDATA[
<p>I’m not going to argue against much of the content of this paper, but it should be pointed out that their argument in the middle section against the “confinement myth” seems pretty bogus. They say that you can isolate the capability read/write resource from the data read/write resource, but… this makes absolutely no sense. Bits are bits. If you assume some out-of-band isolation of capability distribution then you’ve changed the game, but even that isn’t enough for me to believe that isolation is possible.</p>
]]></description><pubDate>Mon, 18 May 2026 11:45:09 +0000</pubDate><link>https://news.ycombinator.com/item?id=48178315</link><dc:creator>jkhdigital</dc:creator><comments>https://news.ycombinator.com/item?id=48178315</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48178315</guid></item><item><title><![CDATA[New comment by jkhdigital in "A physics engine with incremental rollback for multiplayer games"]]></title><description><![CDATA[
<p>Let me know when you have enough demand to make it multiple full-time jobs. I’ve been making notes for a few years now about all the best patterns and principles for designing complex systems and your language + engine more or less hits all the right notes.<p>Declarative state and reactivity, lexical lifetimes and ownership, etc.
Really curious how you set it all up and what prior art was your primary inspiration.</p>
]]></description><pubDate>Sun, 03 May 2026 11:56:19 +0000</pubDate><link>https://news.ycombinator.com/item?id=47996048</link><dc:creator>jkhdigital</dc:creator><comments>https://news.ycombinator.com/item?id=47996048</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47996048</guid></item><item><title><![CDATA[New comment by jkhdigital in "Composition shouldn't be this hard"]]></title><description><![CDATA[
<p>Sotolongo's lineage is Twitter observability -> Google streaming -> Snowflake Dynamic Tables, which is a declarative, relational, query-optimizer-centric tradition. Marz's lineage is Storm -> Trident -> Rama, which is a procedural-dataflow, programmer-controls-the-plan, event-sourcing-centric tradition. Both are trying to unify OLTP + OLAP + application logic + reactivity into a coherent substrate, but they're coming at it from opposite epistemological poles. Rama says "give the programmer fine-grained control over partitioning, indexing, and dataflow, and trust them to design the right physical representation for their queries." Cambra, if your inference about Dynamic Tables is right, will almost certainly say "let the programmer describe the domain model declaratively and let the system figure out the physical representation." This is the classic Codd-vs-Codasyl split, recapitulated forty years later with much more sophisticated machinery on both sides.<p>If this is the right framing, then the two systems aren't really competitors despite solving the same problem--they're going to appeal to fundamentally different developer sensibilities. Rama is for people who want to think like Jay Kreps or Martin Kleppmann: the event log is sacred, physical data layout is a first-class design decision, and the programmer earns the performance benefits by understanding the system deeply. Cambra (if these assumptions hold) will be for people who want to think like database users: describe what you want, let the optimizer figure out how, intervene only when necessary. These are both defensible positions and both have historical track records of working. SQL's history shows the declarative camp has ecosystem advantages once the optimizer is good enough; Kafka/Rama's history shows the log-centric camp has correctness and observability advantages for event-heavy domains.</p>
]]></description><pubDate>Fri, 24 Apr 2026 11:11:48 +0000</pubDate><link>https://news.ycombinator.com/item?id=47888572</link><dc:creator>jkhdigital</dc:creator><comments>https://news.ycombinator.com/item?id=47888572</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47888572</guid></item><item><title><![CDATA[New comment by jkhdigital in "New 'negative light' technology hides data transfers in plain sight"]]></title><description><![CDATA[
<p>The paper itself mentions steganography in the second sentence at least.</p>
]]></description><pubDate>Fri, 13 Mar 2026 21:35:41 +0000</pubDate><link>https://news.ycombinator.com/item?id=47370273</link><dc:creator>jkhdigital</dc:creator><comments>https://news.ycombinator.com/item?id=47370273</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47370273</guid></item></channel></rss>