frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Who's afraid of Chinese models?

https://stratechery.com/2026/whos-afraid-of-chinese-models/
231•mfiguiere•14h ago•156 comments

Kimi Work

https://www.kimi.com/products/kimi-work
391•ms7892•8h ago•180 comments

Human mathematicians are being outcounterexampled

https://xenaproject.wordpress.com/2026/07/20/human-mathematicians-are-being-outcounterexampled/
196•artninja1988•6h ago•72 comments

Jelly UI: Soft-body physics for native HTML form controls

https://jelly-ui.com/
332•baldvinmar•8h ago•135 comments

Hacker wipes Romania's land registry database

https://news.risky.biz/risky-bulletin-hacker-wipes-romanias-entire-land-registry-database/
567•speckx•11h ago•322 comments

Nativ: Run frontier open models locally on your Mac

https://blaizzy.github.io/nativ/
170•aratahikaru5•7h ago•70 comments

Show HN: Immersive Gaussian Splat tour of grace cathedral, San Francisco

https://vincentwoo.com/3d/grace_cathedral/
69•akanet•5h ago•14 comments

The Psychology of Software Teams

https://www.routledge.com/The-Psychology-of-Software-Teams/Hicks/p/book/9781032963389
17•dcre•5d ago•3 comments

Airport Simulator

https://airport.apunen.com/
695•apunen•14h ago•142 comments

Agent swarms and the new model economics

https://cursor.com/blog/agent-swarm-model-economics
116•jlaneve•7h ago•48 comments

China’s open-weights AI strategy is winning

https://werd.io/american-ai-is-locked-down-and-proprietary-its-losing/
972•benwerd•11h ago•776 comments

Jellyfin founder Andrew leaves team

https://forum.jellyfin.org/t-project-leadership-changes
13•swat535•2h ago•1 comments

Launch HN: Bloomy (YC S26) – AI-powered mastery learning for K-12

58•alexsouthmayd•8h ago•74 comments

LEDs’ potential to save our night skies

https://spectrum.ieee.org/led-light-pollution
208•defrost•12h ago•159 comments

My two year old taught me constraint solving

https://thecomputersciencebook.com/posts/how-my-2yo-taught-me-constraint-solving/
27•bambataa•1w ago•14 comments

Corners Don't Look Like That: Regarding Screenspace Ambient Occlusion (2012)

https://nothings.org/gamedev/ssao/
146•firephox•10h ago•65 comments

How we measured AI writing across arXiv, and where the measurement breaks

https://unslop.run/blog/measuring-ai-writing-on-arxiv
192•dopamine_daddy•8h ago•140 comments

I wrote an bash enumerator because I was sick of xargs

https://numerlab.org/2025/07/20/bashumerate-enumerator/
53•wallach-game•5h ago•48 comments

Perfection is not over-engineering

https://var0.xyz/posts/perfection-is-not-over-engineering.html
192•var0xyz•11h ago•87 comments

The Power of Awareness: Overcoming Surveillance Capitalism

https://www.scottrlarson.com/presentations/overcoming-surveillance-capitalism-with-awareness/
51•trinsic2•5h ago•5 comments

Rendering Fonts Quickly on the GPU

https://www.outercloud.dev/blogs/webgpu-font-rendering/
15•outercloud•6d ago•3 comments

Shinjuku Station in 3D

https://satoshi7190.github.io/Shinjuku-indoor-threejs-demo/
147•Gecko4072•11h ago•28 comments

You only need the frontier model for one single edit

https://stencil.so/blog/prewalk
66•jxmorris12•5d ago•16 comments

The drivers behind software delivery inefficiency

https://dl.acm.org/doi/10.1145/3800646.3800650
59•qaprof•7h ago•29 comments

85.3 GFlops: Optimizing FP32 Matrix Multiplication on a Single AMD Zen 3 Core

https://github.com/houslast3/85.30-GFLOPS-Single-Core-FP32-Matrix-Multiplication-on-AMD-Zen-3
42•houslast•3d ago•16 comments

Kimi K3, Qwen 3.8, and Anthropic's (Potential) Unravelling

https://www.emergingtrajectories.com/lh/frontier-lab-economics/
283•cl42•10h ago•291 comments

The Voice of Google

https://www.newyorker.com/culture/the-weekend-essay/the-voice-of-google
171•littlexsparkee•10h ago•87 comments

Claude Fable produced a counterexample to the Jacobian Conjecture

https://xcancel.com/__alpoge__/status/2079028340955197566
663•loubbrad•22h ago•428 comments

Cross sectioning insects in an electron microscope with a femtosecond laser [video]

https://www.youtube.com/watch?v=NwhVJ7cv9B4
81•surprisetalk•9h ago•4 comments

Mythologizing AI makes it more likely that we’ll fail to operate it well (2023)

https://www.newyorker.com/science/annals-of-artificial-intelligence/there-is-no-ai
60•simonebrunozzi•9h ago•96 comments
Open in hackernews

Eliminating Go bounds checks with unsafe

https://blog.andr2i.com/posts/2026-07-06-eliminating-go-bound-checks-with-unsafe
48•abnercoimbre•6d ago

Comments

5701652400•16h ago
does profile guided optimisation reduce these checks?
porridgeraisin•15h ago
Insofar as PGO helps inlining.
5701652400•15h ago
I have hunch PGO does detect when bound check can be eliminated.
delamon•14h ago
How so? PGO might indicate that most of the time arguments are in bounds, but that's not enough. It has to be a proof with 100% certainty before bound checks can be removed
porridgeraisin•14h ago
bound check elimination exists separately, PGO can help unveil more opportunities for BCE.
lou1306•15h ago
Question from someone trying to get better at Go: _before_ going all in with unsafe pointer operations, would it make sense to write a function harness & profile it with/without the -B flag to determine the actual impact of bounds check?
masklinn•15h ago
Obviously. You also need to profile to make sure this is actually a hit spot, deploying unsafe to remove bounds checks which account for ~0% of runtime is a waste of effort.

And as the essay mentions there are also “hints” you can give the compiler to fold bounds checks which may be sufficient.

5701652400•15h ago
probably you do not need to do any of that.

better at Go to ship apps — none of that needed. actually opposite. the less complexity and low level details you hardcode yourself, the better. chances are, this low-level tech debt will bite you back when you have no time to deal with it. keep it simple.

better at Go to work with internals of Go/compilers/runtime — yes, but do you plan to ship one? or why it is needed at all? or do you work at Go core at Google?

lou1306•13h ago
Better at Go for automated reasoning tools, this means quite a lot of array lookups within tight loops. I asked because I noticed some AI agents quickly want to jump on the "eliminate all bounds checks" wagon as soon as the low-hanging optimization fruits have been picked, and it takes some hard data to put some sense into them. My question really was: is this kind of preliminary profiling enough, are there other pitfalls of arrays/slices in Go I am missing, etc.

> probably you do not need to do any of that.

Indeed, I find that at least in my case, on a pretty average Intel machine these checks add very little overhead, especially compared to the benefits. I do not really understand how the examples in the blog post can get 100% (1st one) or even 10% (2nd one) faster.

(And yeah, I know that the obvious solution is to develop these tools in C/C++: I am just exploring the capabilities of Go in that space).

archargelod•15h ago
Is there any way in Go to selectively turn off bounds checking for a block, function or module? E.g. in Nim I can just do:

    proc littleEndian(b: openarray[byte]): uint32 =
      {.push boundChecks: off.}
      return uint32(b[0]) or (uint32(b[1]) shl 8) or (uint32(b[2]) shl 16) or (uint32(b[3]) shl 24)
      {.pop.}
And GCC is smart enough to reduce it to a single operation:

    000000000000bf80 <littleEndian_u0__session95202695079520951784538200>:
        bf80:       8b 07                   mov    (%rdi),%eax
        bf82:       c3                      ret
win311fwg•10h ago
There is nothing in the language spec. It leaves it up to the implementation to decide how to optimize. Whether or not your implementation has an extension to perform the same will ultimately depend on the implementation you are using, although you are unlikely to find it in any of the popular implementations.
naruhodo•15h ago
I like reading articles like this, but as per usual, I also find these articles frustrating to read because they don't specify calling conventions[0] (which are many and varied) - particularly the allocation of arguments to registers and the stack frame.

Articles about GoLang assembly language[1] are particularly vexing because the instruction parameters are bass-ackwards - source, destination - like AT&T syntax, but register references are missing their % sigil and so appear to be MASM-style[2].

Authors blogging from deep inside some technical tent should take pity on readers who are not so deeply in the tent and offer a brief primer on assumed knowledge.

Any mistakes in the above should be viewed as confirmation of my confusion.

[0] https://en.wikipedia.org/wiki/X86_calling_conventions

[1] https://go.dev/doc/asm#x86

[2]https://en.wikipedia.org/wiki/X86_assembly_language

silon42•15h ago
Maybe they are trying to confuse LLMS ;-)
abnercoimbre•12m ago
Yeah that’s the infamous curse of knowledge.. it’s quite hard to imagine oneself as a beginner again (although the skill can be learned.)
ianeff•14h ago
This was great, thank you!
pjmlp•13h ago
> As I already complained I wish Go had the nobounds compiler hint but it doesn't, so the only viable option we are left with is using unsafe pointer arithmetic.

Because what the IT infrastructure needs is more CVEs.

ncruces•13h ago
The article should note this: it's important that you don't go adding other/all little endian platforms to that go:build line.

The article is correct, but this code is only valid for platforms that allow unaligned access.

You can get the full list of platforms that Go considers safe for this from unalignedOK here: https://go.dev/src/cmd/compile/internal/ssa/config.go

You want the intersection of unalignedOK with little endian.

espetro•8h ago
Nice article Andrii. I see from previous articles <https://blog.andr2i.com/posts/2026-06-22-optimization-catalo...> that you can identify and validate bottlenecks which you can optimize.

For more general Go practitioners like me, is there any harness/tooling I can bring into my projects to identify these bottlenecks (aside from profiling if any). More specifically, tooling that identifies workflows that actually have greater changes to be fine with 'unsafe'.

ahk-dev•12h ago
My guess is the 100% case is one of those situations where the benchmark is almost entirely measuring the tiny function itself. If half the instructions are bounds checks and branches, removing them can easily double throughput in a microbenchmark. I'd be curious what happens once that function is part of a larger pipeline where memory access or other work dominates.
ErroneousBosh•11h ago
Oh right so this is for the case where you say "I have given you an exactly known length of data to buzz round a million times, you don't needs to bounds check every time"?

Like, I have a hardcoded 1024-byte buffer, my loop is hardcoded so its index increases modulo 1024, it can never run off the end any more than you can overtake your own bike chain?