frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Old and new apps, via modern coding agents by Terry Tao

https://terrytao.wordpress.com/2026/07/11/old-and-new-apps-via-modern-coding-agents/
239•subset•5h ago•61 comments

AI Boosts Research Careers but Flattens Scientific Discovery

https://spectrum.ieee.org/ai-science-research-flattens-discovery
71•zaikunzhang•2h ago•56 comments

Understanding the Odin Programming Language

https://odinbook.com/
80•AlexeyBrin•4h ago•23 comments

How to Read More Books

https://scotto.me/blog/2026-07-12-how-to-read-more-books/
9•silcoon•34m ago•0 comments

Don't You Mean Extinct?

https://fabiensanglard.net/extinct/index.html
6•zdw•1h ago•0 comments

Ghostel.el: Terminal emulator powered by libghostty

https://dakra.github.io/ghostel/
135•signa11•7h ago•19 comments

The power of collaboration: How we can reduce traffic congestion

https://research.google/blog/the-power-of-collaboration-how-we-can-reduce-traffic-congestion/
4•raahelb•46m ago•0 comments

Gina Gallery of International Naive Art

https://www.ginagallery.com/
18•o4c•3h ago•10 comments

Why study Diophantine equations?

https://hidden-phenomena.com/articles/modular
4•mb1699•28m ago•0 comments

Unauthenticated RCE in Motorola's MR2600 Router

https://mrbruh.com/motorola/
52•MrBruh•4h ago•14 comments

Vint Cerf, a “father of the Internet”, is retiring

https://techcrunch.com/2026/06/30/the-father-of-the-internet-is-finally-retiring/
218•compiler-guy•2d ago•127 comments

Lessons from the Vasa Shipwreck

https://www.ft.com/content/200a6c44-9b66-4af3-82eb-98acb53898e4
16•bookofjoe•3d ago•9 comments

A no-brainer for protecting your brain

https://www.economist.com/leaders/2026/07/09/a-no-brainer-for-protecting-your-brain
4•saikatsg•58m ago•0 comments

Satteri: A Markdown pipeline forged in Rust for the JavaScript world

https://satteri.bruits.org/
23•nateb2022•4d ago•5 comments

Show HN: Mindwalk – Replay coding-agent sessions on a 3D map of your codebase

https://github.com/cosmtrek/mindwalk
129•cosmtrek•10h ago•53 comments

Ditching Zotero for a Text File

https://atthis.link/blog/2026/57207.html
36•speckx•5d ago•25 comments

Mesh LLM: distributed AI computing on iroh

https://www.iroh.computer/blog/mesh-llm
310•tionis•17h ago•71 comments

Protobuf-py: Protobuf for Python, without compromises

https://buf.build/blog/protobuf-py
109•ming13•4d ago•29 comments

Show HN: Skillscript – A declarative, sandboxed language for tool orchestration

https://github.com/sshwarts/skillscript
6•sshwarts•2h ago•2 comments

Nvidia, CoreWeave, and Nebius: Inside the Circular Financing of the GPU Boom

https://io-fund.com/ai-stocks/nvidia-coreweave-nebius-circular-financing-gpu-boom
337•adletbalzhanov•23h ago•141 comments

Xbox 'OG' Adventures

https://mamoniem.com/xbox-og-adventures/
33•davikr•5d ago•5 comments

Autoresearch, Claude and Constrained Optimization

https://www.elliotcsmith.com/autoresearch-claude-and-constrained-optimization/
3•gmays•1h ago•0 comments

An agent in 100 lines of Lisp

https://thebeach.dev/posts/lisp-agent/
208•jamiebeach•4d ago•61 comments

RISCBoy is an open-source portable games console, designed from scratch

https://github.com/Wren6991/RISCBoy
188•mariuz•18h ago•26 comments

Handsum: An LQIP Image File Format

https://nigeltao.github.io/blog/2026/handsum.html
38•dmit•4d ago•5 comments

Show HN: Ant – A JavaScript runtime and ecosystem

https://antjs.org
308•theMackabu•20h ago•139 comments

I Did Not Kill Stanley Lieber: How to Draw (With 9front)

https://triapul.cz/automa/i_did_not_kill_stanley_lieber
98•c-c-c-c-c•3d ago•37 comments

Relm – local LLMs as base-R objects, with interpretability

https://github.com/Vadale/R-ebirth
4•grauk•3d ago•0 comments

Sixtyfour (YC P25) Is Hiring

https://www.ycombinator.com/companies/sixtyfour/jobs/bIbgQkL-operations-associate-data-samples-cu...
1•HPMOR•23h ago

An explanation of our search results

https://web.archive.org/web/20040612082405/https://www.google.com/explanation.html
3•abj908•17m ago•0 comments
Open in hackernews

Show HN: Resonate – real-time high temporal resolution spectral analysis

https://alexandrefrancois.org/Resonate/
76•arjf•1y ago

Comments

james_a_craig•1y ago
For some reason the value of Pi given in the C++ code is wrong!

It's given in the source as 3.14159274101257324219 when the right value to the same number of digits is 3.14159265358979323846. Very weird. I noticed when I went to look at the C++ to see how this algorithm was actually implemented.

https://github.com/alexandrefrancois/noFFT/blob/main/src/Res... line 31.

pvg•1y ago
That is a very 'childhood exposure to 8 digit calculators' thing to notice.
james_a_craig•1y ago
Childhood exposure to pi generation algorithms; the correct version above was from memory.
pvg•1y ago
Close enough! The wrong 7 jumped out at me instantly although I didn't remember more than a few after.
2YwaZHXV•1y ago
seems since it's a float it's only 32-bits, and the representation of both 3.14159274101257324219 and 3.14159265358979323846 is the same in IEEE-754: 0x40490fdb

though I agree that it is odd to see, and not sure I see a reason why they wouldn't use 3.14159265358979323846

james_a_craig•1y ago
Yeah, it’s as if they wrote a program to calculate pi in a float and saved the output. Very strange choice given how many places the value of pi can be found.
arjf•1y ago
Indeed... I honestly don't remember where or how I sourced the value, and why I did not use the "correct" one - I will correct in the next release of the package. Thanks for pointing it out!
pvg•1y ago
You got off easy compared to this dude https://en.wikipedia.org/wiki/William_Shanks
phkahler•1y ago
This is very much like doing a Fourier Transform without using recursion and the butterflies to reduce the computation. It would be even closer to that if a "moving average" of the right length was used instead of an IIR low-pass filter. This is something I've considered superior for decades but it does take a lot more computation. I guess we're there now ;-)
arjf•1y ago
It only requires more computation if you really need to compute the full FFT with all the bins, in which case the FFT is more efficient... With this approach you only compute the bins you really need, without having to pre-filter your signal, or performing additional computations on the FFT result. Some sliding window FFT methods compute frequency bands independently, but they do require buffering and I really wanted to avoid that.
zevv•1y ago
I might be mistaking, but I don't see how this is novel. As far as I know, this has a proven DSP technique for ages, although it it usually only applied when a small amount of distinct frequencies need to be detected - for example DTMF.

When the number of frequencies/bins grows, it is computationally much cheaper to use the well known FFT algorithm instead, at the price of needing to handle input data by blocks instead of "streaming".

colanderman•1y ago
The difference from FFT is this is a multiresolution technique, like the constant-Q transform. And, unlike CQT (which is noncausal), this provides a better match to the actual behavior of our ears (by being causal). It's also "fast" in the sense of FFT (which CQT is not).
zipy124•1y ago
There exists the multiresolution FFT, and other forms of FFT which are based around sliding windows/SFFT techniques. CQT can also be implemented extremely quickly, utilising FFT's and kernels or other methods, like in the librosa library (dubbed pseudo-CQT).

I'm also not sure how this is causal? It has a weighted-time window (biasing the more recent sound), which is farily novel, but I wouldn't call that causal.

This is not to say I don't think this is cool, it certainly looks better than existing techniques like synchrosqueezing for pushing the limit of the heisenberg uncertainty principle (technically given ideal conditions synchrosqueezing can outperform the principle, but only a specific subset of signals).

waffletower•1y ago
Curious if there is available math to show the gain scale properties of this technique across the spectrum -- in other words its frequency response. The system doesn't appear to be LTI so I don't believe we can utilize the Z-transform to do this. Phase response would also be important as well.
arjf•1y ago
The Sliding Windowed Infinite Fourier Transform (SWIFT) has very similar math, and they provide some analysis in the paper. I use a different heuristic for alpha so I am not sure the analysis transfers directly. In my upcoming paper I have some numerical experiments and graphs that show resonator response across the range.
arjf•1y ago
Actually digging into SWIFT a bit more, the formulas differ by more than just the heuristic for alpha (unless I missed something) so the analysis in the SWIFT paper does not apply directly to(or maybe even at all).
dr_dshiv•1y ago
Thanks for your contribution! Reminds me of Helmholtz resonators.

I wrote this cross-disciplinary paper about resonance a few years ago. You may find it useful or at least interesting.

https://www.frontiersin.org/journals/neurorobotics/articles/...

arjf•1y ago
Interesting - thanks for sharing!
colanderman•1y ago
Nice! I've used a homegrown CQT-based visualizer for a while for audio analysis. It's far superior to the STFT-based view you get from e.g. Audacity, since it is multiresolution, which is a better match to how we actually experience sound. I have for a while wanted to switch my tool to a gammatone-filter-based method [1] but I didn't know how to make it efficient.

Actually I wonder if this technique can be adapted to use gammatone filters specifically, rather than simple bandpass filters.

[1] https://en.wikipedia.org/wiki/Gammatone_filter

mofeien•1y ago
If you already have the implementation for the CQT, wouldn't you just be able to replace the morlet wavelet used in the CQT by the gammatone wavelet without much of on efficiency hit? I'm just learning about the gammatone filter, and it sounds interesting since it apparently better models human hearing.
vessenes•1y ago
Nice! Can any signals/AI folks comment on whether using this would improve vocoder outputs? The visuals look much higher res, which makes me think a vocoder using them would have more nuance. But, I'm a hobbyist.
drmikeando•1y ago
You can view this result as the convolution of the signal with an exponentially decaying sine and cosine.

That is, `y(t') = integral e^kt x(t' - t) dt`, with k complex and negative real part.

If you discretize that using simple integration and t' = i dt, t = j dt you get

    y_i = dt sum_j e^(k j dt) x_{i - j}
    y_{i+1} = dt sum_j e^(k j dt) x_{i+1 - j}
            = (dt e^(k dt) sum_j' e^(k j' dt) x_{i - j'}) + x_i 
            = dt e^(k dt) y_i + x_i
If we then scale this by some value, such that A y_i = z_i we can write this as

    z_{i+1} = dt e^(k dt) z_i + A x_i
Here the `dt e^(k dt)` plays a similar role to (1-alpha) and A is similar to P alpha - the difference being that P changes over time, while A is constant.

We can write `z_i = e^{w dt i} r_i` where w is the imaginary part of k

   e^{w dt (i+1)} r_{i+1} = dt e^(k dt) e^{w dt i} r_i + A x_i
             r_{i+1} = dt e^((k - w) dt) r_i + e^{-w dt (i+1) } A x_i
                     = (1-alpha) r_i + p_i x_i
Where p_i = e^{-w dt (i+1) } A = e^{-w dt ) p_{i-1} Which is exactly the result from the resonate web-page.

The neat thing about recognising this as a convolution integral, is that we can use shaping other than exponential decay - we can implement a box filter using only two states, or a triangular filter (this is a bit trickier and takes more states). While they're tricky to derive, they tend to run really quickly.

arjf•1y ago
This formulation is close to that of the Sliding Windowed Infinite Fourier Transform (SWIFT), of which I became aware only yesterday.

For me the main motivation developing Resonate was for interactive systems: very simple, no buffering, no window... Also, no need to compute all the FFT bins so in that sense more efficient!

arjf•1y ago
Just want to call out the resources listed at the bottom of the Resonate website:

- The Oscillators app demonstrates real-time linear, log and Mel scale spectrograms, as well as derived audio features such as chromagrams and MFCCs https://alexandrefrancois.org/Oscillators/

- The Resonate Youtube playlist features video captures of real-time demonstrations. https://www.youtube.com/playlist?list=PLVcB_ABiKC_cbemxXUUJX...

- The open source Oscillators Swift package contains reference implementations in Swift and C++.https://github.com/alexandrefrancois/Oscillators

- The open source python module noFFT provides python and C++ implementations of Resonate functions and Jupyter notebooks illustrating their use in offline settings. https://github.com/alexandrefrancois/noFFT