HN user

tripplyons

709 karma

tripplyons.com

Posts20
Comments284
View on HN
pokeemerald.com 1mo ago

Pokemon Emerald Ported to WebAssembly (100k FPS)

tripplyons
363pts103
tripplyons.com 5mo ago

Find a Niche by Intersecting Your Strengths

tripplyons
2pts0
www.youtube.com 9mo ago

One Direction Fans Believe AI-Extended Song Was Leaked Demo

tripplyons
3pts1
tripplyons.com 9mo ago

The DeepSeek v3.2 Breakthrough Simplified

tripplyons
5pts0
gist.github.com 10mo ago

Free web search MCP using a local SearXNG instance

tripplyons
2pts1
twitter.com 10mo ago

Potential plagiarism in Hierarchical Reasoning Model paper

tripplyons
2pts0
tripplyons.com 10mo ago

A Trick for Backpropagation of Linear Transformations

tripplyons
74pts6
www.youtube.com 11mo ago

Stacker.nvim: access recent Neovim buffers [video]

tripplyons
3pts0
github.com 12mo ago

Show HN: CUDA Fractal Renderer

tripplyons
44pts18
www.youtube.com 1y ago

How Rubik's Cube Blindfolded Solving Works [video]

tripplyons
1pts0
github.com 1y ago

Talk with GPT-4o from a simple keyboard shortcut

tripplyons
1pts0
tripplyons.com 1y ago

Rendering Fractals by Optimizing Pixels in Jax

tripplyons
1pts0
marketplace.visualstudio.com 1y ago

Show HN: A VSCode Extension That Keeps Your Active Tab in the Leftmost Position

tripplyons
2pts0
www.cnn.com 2y ago

GameStop, AMC shares skyrocket after meme stock trader posts

tripplyons
2pts1
github.com 2y ago

Orthogonal Fine-Tuning for Stable Diffusion

tripplyons
3pts0
tripplyons.com 3y ago

Speed Up Your Videos to Learn Faster

tripplyons
1pts1
github.com 3y ago

Fine-tune Stable Diffusion with less than 1MB of changes

tripplyons
2pts0
tripplyons.com 3y ago

Train a Text Summarizer in 5 Minutes

tripplyons
5pts0
hashframe.tripplyons.com 5y ago

HashFrame – Any file as a URL hash

tripplyons
4pts2
en.wikipedia.org 5y ago

Wikipedia: Wikipedia is not a reliable source

tripplyons
2pts0

I use a $200/mo OpenAI Codex sub. Throughout the workday I run an average of 2 concurrent agents of GPT 5.5 with high reasoning on fast mode and use less than half of my subscription usage.

For more interactive/active usage you might be better off using the low reasoning level, but I have usually found high to be a good balance of intelligence and generation speed.

I like to use Pi (https://pi.dev/), and I recently got it to make an approval extension for itself. It has a lot of documentation built-in for the agent to modify the behavior of the app.

I got it to display all proposed file change diffs and bash commands and made it so I can either approve the action or deny it with a message for it.

It was surprisingly easy to tell it to modify things things the diff viewing algorithm or syntax highlighting for the diffs.

Tree Calculus 3 months ago

The reduction rules seem kind of arbitrary to me. At that point why don't you just use combinators instead of defining a set of 5 ways their operator can be used?

[dead] 4 months ago

Your submission history looks like a bot trying to get engagement or something.

MLA makes it so the keys and values used are a function of a smaller latent vector you cache instead of a key and a value for each token. KV cache quantization reduces the size of the values in the cache by using less bits to store each value. These two approaches operate on different parts of the process so they can be used in combination. For example, you can quantize the latents that are stored for MLA.

Got it.

The scenario I'm describing there is how a service like AWS has the ability to tamper with your code or its output. If instead, each response came with a ZK proof showing that the inputs you provided lead to the outputs it returned, you could efficiently verify that nothing was modified.

As much as I like the ideas, this article looks AI generated. This line with the bullet point, bolded label and colon, em-dash, and the second clause "it's about" all point to AI writing.

"Fiber-optic cables: Fiber-optic cables enable higher bandwidth phone lines and television—it’s about getting more television channels to more people."

One problem with private age verification is that because each verification cannot be traced back to a user, it is hard to prevent abuse like credential sharing. Imagine how a single stolen credential can be used by any number of users because the verification step kept the credential private.

To answer your question, ZKPs can enable the verification step to be done privately in your example. Another use case could be allowing cloud computing hosts to prove that they did not tamper with the results of a computation.

It's a bad headline. They used publicly available blockchain transactions and didn't cause the collapse of the Terra ecosystem. Terra collapsed because it was a Ponzi scheme offering 20% APY on a fake stablecoin. The Terra stablecoin was not backed by real dollars, but instead by a cryptocurrency called Luna that did nothing else other than let you issue Terra stablecoins.

It is definitely true across different chips. The best kernel to use will vary with what chip it is running on, which often implies that the underlying operations will be executed in a different order. For example, with floating point addition, adding up the same values in a different order can return a different result because floating point addition is not associative due to rounding.