frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

The Navier–Stokes Millennium Prize Problem

https://simonwillison.net/2026/Sep/8/on-navier-stokes/
151•tosh•1h ago•127 comments

"Tweet" and the bird logo apparently enter the public domain

https://blog.ericgoldman.org/archives/2026/09/tweet-and-the-bird-logo-apparently-enter-the-public...
33•progval•1h ago•4 comments

Muse – Meta’s personal AI agent

https://ai.meta.com/muse/
473•yks•12h ago•508 comments

On Really Trying (2009)

https://gwern.net/on-really-trying
17•whoami_nr•46m ago•3 comments

Tension wood: A 'muscle' that can both bend and straighten plants

https://phys.org/news/2026-09-trees-muscle-posture-newly-role.html
103•mdp2021•6d ago•17 comments

How GPT‑5.6 Sol helps run quantum computing experiments

https://openai.com/index/codex-quantum-computing-experiments/
8•theanonymousone•22m ago•0 comments

Navier-Stokes – Tristan Buckmaster [pdf]

https://cims.nyu.edu/~tristanb/statement.pdf
1576•procedurecall•1d ago•671 comments

Researchers Spot Fake Ancient Pottery Using the Earth's Magnetic Field

https://www.smithsonianmag.com/smart-news/researchers-determine-how-to-spot-fake-ancient-pottery-...
33•cisc•3d ago•10 comments

How to build a printer

https://nishantjosh.dev/blogs/how-to-build-a-fking-printer/
296•cat-whisperer•10h ago•56 comments

Copyright does more harm than good and should be abolished

https://grapheneos.social/@GrapheneOS/117231186011306184
127•Cider9986•1h ago•71 comments

A Biography of Lee Holloway, the Architect of Cloudflare's Technology (Part 1)

https://note.com/masakazu_urabe/n/n7815f5b64fab?hl=en
34•porridgeraisin•3h ago•8 comments

AlphaGenome Atlas: a high-resolution map of human DNA

https://blog.google/innovation-and-ai/models-and-research/google-deepmind/alphagenome-atlas/
546•utiiiD•16h ago•118 comments

AI Has a Discovery Problem

https://mhacevedo.com/posts/the-discovery-problem
29•miguelacevedo•2h ago•9 comments

Large language models develop novel social biases through adaptive exploration

https://openreview.net/challenge?redirect=%2Fforum%3Fid%3Dpc7fqaOcAH
149•paimapi•9h ago•77 comments

Mercury 2.5

https://www.inceptionlabs.ai/blog/introducing-mercury-2-5
187•Topfi•11h ago•26 comments

I resigned from Anthropic today

https://twitter.com/hilbertspaess/status/2097476196791709843#m
473•yurivish•7h ago•614 comments

27.5KB language-agnostic WebGPU syntax highlighter

https://gpu-lexer.vercel.app/
66•bpierre•6h ago•19 comments

DaVinci Resolve 21.1

https://www.blackmagicdesign.com/media/release/20260908-03
393•tosh•18h ago•175 comments

The origins of Partner’s computer case

https://www.racunalniski-muzej.si/en/the-origins-of-partners-computer-case/
31•markostamcar•1d ago•2 comments

Ganon's Mysterious Origins (Revisited)

https://www.thrillingtalesofoldvideogames.com/blog/ganon-name-origin-kamen-rider
31•tobr•3d ago•17 comments

I-have-ADHD: A skill to stop coding agents from burying the answer

https://github.com/ayghri/i-have-adhd
413•domhudson•17h ago•298 comments

Tao: Open math problems being non-renewably mined by AI

https://mathstodon.xyz/@tao/117237320796901560
331•_alternator_•10h ago•307 comments

An Accidental Blackboard

https://martinfowler.com/articles/exploring-gen-ai/an-accidental-blackboard.html
52•saikatsg•3d ago•24 comments

On the Navier–Stokes Millennium Prize Problem

https://openai.com/index/navier-stokes-solution/
1243•tedsanders•14h ago•989 comments

Benchmarking Qwen3.8 27B quantizations: 4-bit holds up, 1-bit collapses

https://quesma.com/blog/qwen38-27b-quantizations-benchmarked/
244•stared•16h ago•116 comments

Into the depths of C: Elaborating the de facto standards (2016)

https://dl.acm.org/doi/10.1145/2980983.2908081
16•rramadass•15h ago•1 comments

A Topological Picture Book, Rendered

https://e-infinity.space/picture-book/
93•mathgenius•9h ago•11 comments

The Microeconomics of Artificial Intelligence (2025)

https://direct.mit.edu/books/oa-monograph/6067/The-Microeconomics-of-Artificial-Intelligence
52•neehao•2d ago•27 comments

We built our house for LAN parties (2024)

https://lanparty.house/
496•fittingopposite•3d ago•323 comments

Sam Altman's statement on the Navier-Stokes dispute

https://twitter.com/sama/status/2097385167002415140
8•vertigoruntime•40m ago•0 comments
Open in hackernews

Detecting if an expression is constant in C

https://nrk.neocities.org/articles/c-constexpr-macro#detecting-if-an-expression-is-constant-in-c
49•signa11•1y ago

Comments

wahern•1y ago
> This works. But both gcc and clang warn about the enum being anonymous... even though that's exactly what I wanted to do. And this cannot be silenced with #pragma since it's a macro, so the warning occurs at the location where the macro is invoked.

You can use _Pragma instead of #pragma. E.g.

  #define C(x) ( \
    _Pragma("clang diagnostic push") \
    _Pragma("clang diagnostic ignored \"-Wvisibility\"") \
    (x) + 0*sizeof(void (*)(enum { tmp = (int)(x) })) \
    _Pragma("clang diagnostic pop") \
  )
EDIT: Alas, GCC is a little pickier about where _Pragma is allowed so you may need to use a statement expression. Also, it seems GCC 14 doesn't have a -W switch that will disable the anonymous enum warning.
pjc50•1y ago
It's remarkable that people will say that doing this kind of thing is better than learning a language which actually lets you enforce this with the type system.

(or even just insist that users use the version of the language which supports "constexpr"!)

oguz-ismail•1y ago
What language is that? Is it available everywhere (everywhere) C is?
mitthrowaway2•1y ago
Indeed, usually if I'm using C these days it's because I only have access to a c compiler for my target platform, or because I'm modifying an existing C codebase.
uecker•1y ago
I do not think anybody said this. The point is that these macros work for early versions of C. If you need to support early versions of C, learning another language is not a solution. If you don't have to, you can use C23's constexpr.
trealira•1y ago
C used to seem like a beautiful and simple language to me, but as I used it and learned more about it, it seemed more complex under the surface, and kind of janky as well. It's just utilitarian.
wat10000•1y ago
Learning such a language doesn’t mean I can use it.
o11c•1y ago
The problem is that no such language exists.

There are many languages that provide one particular feature that C doesn't provide, but they do this at the cost of excluding numerous other features that C widely relies on.

kjs3•1y ago
"I have no idea what problem you're trying to solve, what the constraints are, what the use cases might be, what tools are available on the platform, what the job or regulations require, what the skillsets of the people involved are, what the timeline is...but I'm absolutely, unshakably certain that I have a magic bullet that will make all your problems go away."

FTFY.

sleirsgoevy•1y ago
The Linux kernel has even a way to determine whether the expression is compile-time, WITHOUT aborting compilation in either case.

The trick is this (copied vebratim from Linux):

#define __is_constexpr(x) (sizeof(int) == sizeof(*(8 ? ((void *)((long)(x) * 0l)) : (int *)8)))

Explanation: if x is a constant expression, then multiplying it by zero yields a constant 0, and casting a constant 0 to void* makes a null pointer constant. And the ternary expression, if one of its sides is a null pointer constant, collapses to the type of the other side (thus the type of the returned pointer will be int*, and the sizeof will match). And if x was not constant, then the lefthand side would not be considered a null pointer constant by type inference, the type of the ternary expression will be void*, and the sizeof check will not match.

With a few more clever tricks, it's even possible to implement a compile-time "type ternary expression", like this: TYPE_IF(2 * 2 == 4, int, long). This is left as an exercise for the reader.

amelius•1y ago
This reminds me of the days when Boost was a thing. It was full of tricks like this.
usrnm•1y ago
It still is a thing, though.
cperciva•1y ago
With a few more clever tricks...

I did this with my PARSENUM macro (https://github.com/Tarsnap/libcperciva/blob/master/util/pars...) to parse strings into floating-point, unsigned integer, or signed integer types (and check bounds) using a single interface.

bobbyi•1y ago
I thought this would work:

#define C(x) (sizeof(char[x]), x)

sizeof is a compile-time operation so x need to be known at compile time.

It didn't work as expected. It turns out there is an exception and the standard says that sizeof is actually calculated at runtime specifically for variable length arrays:

> The sizeof operator yields the size (in bytes) of its operand, which may be an expression or the parenthesized name of a type. The size is determined from the type of the operand. The result is an integer. If the type of the operand is a variable length array type, the operand is evaluated; otherwise, the operand is not evaluated and the result is an integer constant.