frontpage.
newsnewestaskshowjobs

Made with ♥ by @iamnishanth

Open Source @Github

fp.

We Mourn Our Craft

https://nolanlawson.com/2026/02/07/we-mourn-our-craft/
1•ColinWright•2m ago•0 comments

Jim Fan calls pixels the ultimate motor controller

https://robotsandstartups.substack.com/p/humanoids-platform-urdf-kitchen-nvidias
1•robotlaunch•5m ago•0 comments

Exploring a Modern SMTPE 2110 Broadcast Truck with My Dad

https://www.jeffgeerling.com/blog/2026/exploring-a-modern-smpte-2110-broadcast-truck-with-my-dad/
1•HotGarbage•5m ago•0 comments

AI UX Playground: Real-world examples of AI interaction design

https://www.aiuxplayground.com/
1•javiercr•6m ago•0 comments

The Field Guide to Design Futures

https://designfutures.guide/
1•andyjohnson0•7m ago•0 comments

The Other Leverage in Software and AI

https://tomtunguz.com/the-other-leverage-in-software-and-ai/
1•gmays•9m ago•0 comments

AUR malware scanner written in Rust

https://github.com/Sohimaster/traur
3•sohimaster•11m ago•1 comments

Free FFmpeg API [video]

https://www.youtube.com/watch?v=6RAuSVa4MLI
3•harshalone•11m ago•1 comments

Are AI agents ready for the workplace? A new benchmark raises doubts

https://techcrunch.com/2026/01/22/are-ai-agents-ready-for-the-workplace-a-new-benchmark-raises-do...
2•PaulHoule•16m ago•0 comments

Show HN: AI Watermark and Stego Scanner

https://ulrischa.github.io/AIWatermarkDetector/
1•ulrischa•17m ago•0 comments

Clarity vs. complexity: the invisible work of subtraction

https://www.alexscamp.com/p/clarity-vs-complexity-the-invisible
1•dovhyi•17m ago•0 comments

Solid-State Freezer Needs No Refrigerants

https://spectrum.ieee.org/subzero-elastocaloric-cooling
1•Brajeshwar•18m ago•0 comments

Ask HN: Will LLMs/AI Decrease Human Intelligence and Make Expertise a Commodity?

1•mc-0•19m ago•1 comments

From Zero to Hero: A Brief Introduction to Spring Boot

https://jcob-sikorski.github.io/me/writing/from-zero-to-hello-world-spring-boot
1•jcob_sikorski•19m ago•1 comments

NSA detected phone call between foreign intelligence and person close to Trump

https://www.theguardian.com/us-news/2026/feb/07/nsa-foreign-intelligence-trump-whistleblower
7•c420•20m ago•1 comments

How to Fake a Robotics Result

https://itcanthink.substack.com/p/how-to-fake-a-robotics-result
1•ai_critic•20m ago•0 comments

It's time for the world to boycott the US

https://www.aljazeera.com/opinions/2026/2/5/its-time-for-the-world-to-boycott-the-us
3•HotGarbage•21m ago•0 comments

Show HN: Semantic Search for terminal commands in the Browser (No Back end)

https://jslambda.github.io/tldr-vsearch/
1•jslambda•21m ago•1 comments

The AI CEO Experiment

https://yukicapital.com/blog/the-ai-ceo-experiment/
2•romainsimon•22m ago•0 comments

Speed up responses with fast mode

https://code.claude.com/docs/en/fast-mode
4•surprisetalk•26m ago•0 comments

MS-DOS game copy protection and cracks

https://www.dosdays.co.uk/topics/game_cracks.php
3•TheCraiggers•27m ago•0 comments

Updates on GNU/Hurd progress [video]

https://fosdem.org/2026/schedule/event/7FZXHF-updates_on_gnuhurd_progress_rump_drivers_64bit_smp_...
2•birdculture•28m ago•0 comments

Epstein took a photo of his 2015 dinner with Zuckerberg and Musk

https://xcancel.com/search?f=tweets&q=davenewworld_2%2Fstatus%2F2020128223850316274
12•doener•28m ago•2 comments

MyFlames: View MySQL execution plans as interactive FlameGraphs and BarCharts

https://github.com/vgrippa/myflames
1•tanelpoder•29m ago•0 comments

Show HN: LLM of Babel

https://clairefro.github.io/llm-of-babel/
1•marjipan200•29m ago•0 comments

A modern iperf3 alternative with a live TUI, multi-client server, QUIC support

https://github.com/lance0/xfr
3•tanelpoder•31m ago•0 comments

Famfamfam Silk icons – also with CSS spritesheet

https://github.com/legacy-icons/famfamfam-silk
1•thunderbong•31m ago•0 comments

Apple is the only Big Tech company whose capex declined last quarter

https://sherwood.news/tech/apple-is-the-only-big-tech-company-whose-capex-declined-last-quarter/
4•elsewhen•35m ago•0 comments

Reverse-Engineering Raiders of the Lost Ark for the Atari 2600

https://github.com/joshuanwalker/Raiders2600
2•todsacerdoti•36m ago•0 comments

Show HN: Deterministic NDJSON audit logs – v1.2 update (structural gaps)

https://github.com/yupme-bot/kernel-ndjson-proofs
1•Slaine•39m ago•0 comments
Open in hackernews

ICPC 2025 World Finals Results

https://worldfinals.icpc.global/scoreboard/2025/index.html
103•pykello•5mo ago

Comments

toonewbie•5mo ago
I was onsite today watching the contest live, and great atmosphere all around. One surprising outcome: the team in 17th place solved the same number of problems as the team that won gold in 4th place. Hopefully that isn't too demotivating to any team and we can see better separation in the future. After all, it can only mean that the problemsetters underestimated the contestants ;)

Congratulations to all the teams!

tshaddox•5mo ago
> the problemsetters underestimated the contestants

Except for problem C, which was only submitted by 4 teams, all unsuccessfully.

cperciva•5mo ago
I don't blame them. That problem statement seems to be deliberately confusing.
hatthew•5mo ago
I doesn't seem that unclear to me? I absolutely don't have the skill to solve it, but it took <2 minutes to understand the problem and goal.
orlp•5mo ago
It doesn't seem that hard to solve to me either. It's solvable with basic linear programming.

    1. Add a variable for each node, and a variable for each output edge from stations.
    2. For each reservoir add equality constraints to the sum of incoming edges with the coefficients given in the problem.
    3. For each station add equality constraints between the weighted sum of its inputs (which is 1 for the root station) and its outputs (which are the variables we added).
    4. Add an out_edge >= 0 constraint for each output edge on stations to forbid illegal negative flows.
    5. Add a variable m which is constrained to be less than all the output station variables.
    6. Maximize m.
amluto•5mo ago
This happens every now and then. Basic LP isn’t conceptually so bad, but the ICPC environment doesn’t come with CPLEX or Gurobi, let alone a less fancy open source tool. And there is definitely not a copy of cvxopt around to make this easy. Even if you want to quickly kludge up an interior point solver, you don’t have a linear algebra package available (sorry, no numpy or BLAS).

What you can do is to submit a 25 page PDF that the organizers will print and stick on your desk for the competition. And you could put a careful implementation of a very basic simplex solver using dense matrices that is optimized for ease of transcription, taking up, say, half a page. You would hope not to use it because it’s absurd, but then if this problem C shows up, the fastest typist on the team can type it in verbatim.

If I, personally, did this and won the contest as a result, I would feel slightly bad. In my opinion, the contest organizers should either provide an LP solver or refrain from giving obvious LP problems like this.

Obviously OpenAI could kick everyone’s butt by typing faster than any human and by effectively having a large memorized library of pre-written code. Honestly, LLMs vs humans in the ICPC feels a bit like IBM’s old Jeopardy stunt where the machine had a huge advantage in its ability to push the button.

orlp•5mo ago
The team manual I referred to when I was in university does in fact contain such a basic simplex LP solver: https://github.com/ludopulles/tcr/blob/master/tcr.pdf (page 22).

I'd just like to clarify that I'm not saying this is necessarily the solution the problem writers were looking for, or that it will run within the allocated time. Just that it's a feasible solution.

amluto•5mo ago
Mine did too :). But I never used it except for practice.
gregdeon•5mo ago
Wow, incredibly interesting to see what one of these manuals looks like! Thanks for sharing.
yallpendantools•5mo ago
Amazing! Thanks for sharing.

The farthest I got in the ICPC was regionals. I was tasked to make the team binder. I was a budding LaTeX enthusiast then but our coach wanted me to do it in...MS Word. Not that he didn't know LaTeX either (he's a published math/CS researcher after all), it's just the cultural ubiquity and comfort of MS Word. :(

The result was something more like https://github.com/ludopulles/tcr/blob/master/TCR-Sudo.pdf . I love how information-dense tcr.pdf looks in comparison. They even have a table of contents!

dchftcs•5mo ago
I suspect the lack of success of the teams resulted from overfitting for the more standard pattern that is solving a max flow, and I also suspect the organizers are deliberately using this to trick the contestants. Spending time to practice coding vanilla algorithms to solve either max flow or a linear program is a waste of time for >99% of computer scientists.
amluto•5mo ago
Replying again, having actually read the problem more carefully: the problem isn’t that simple. There will be a few tens of thousands of variables. The LP is extremely sparse, and I’m sure a good solver could solve it within the time limit, but a little team-notebook-sized dense solver would take at least a few trillion operations to finish and would not be nearly fast enough.
orlp•5mo ago
As I mentioned in my other comment:

> I'd just like to clarify that I'm not saying this is necessarily the solution the problem writers were looking for, or that it will run within the allocated time. Just that it's a feasible solution.

I don't doubt there's a clever dedicated flow algorithm the problem writers intended instead of the blunt tool which is LP.

jeremykvlim•5mo ago
I solved C using LP. You may attempt to submit a solution here if you want to try: https://open.kattis.com/problems/brideofpipestream

You may view (one of) the judge's solution to this problem (and the rest of the problems) here: https://github.com/SnapDragon64/ACMFinalsSolutions/blob/mast...

tshaddox•5mo ago
Yes, I meant to imply that the problemsetters are to blame.
pykello•5mo ago
Video recordings: https://www.youtube.com/playlist?list=PLaSPkFE9cpGT_SuxamW9e...
imadethis•5mo ago
The headers A-L are links to the problem PDFs if you want to see.
512•5mo ago
The "Diamond Sponsors" of the event are Huawei and OpenAI. I found the welcome note from OpenAI [1] quite curious:

"[...] Eventually, AI will be able to solve even the hardest contest problems that we’ve seen yet. It will work alongside us and help drive the discovery of new knowledge. What you take from this week - the sense of being stuck, the thrill of progress, and the practice of building together - will remain critical as you shape your community and the future you build. [...]"

By Chief Scientist of OpenAI, Jakub Pachocki. Who happens to be an incredibly accomplished Competitive Programmer (2nd in ICPC World Finals, Winner of Code Jam, 2nd in Hacker Cup).

[1] https://icpc.global/community/history/brochures/world-finals...

goalieca•5mo ago
That curious statement comes across as inappropriate. These talented students are among the best in the world. Yet, openai chose to make it about and praise themselves. That was not classy.
foxglacier•5mo ago
Surely it's meant to reassure the contestants that they're not wasting their time. They'll obviously know AI can do some of this stuff so it's a reminder that the true purpose of the competition isn't to be good at programming.

People still compete in playing musical instruments, riding horses, painting pictures, etc. All redundant because of technology but still they do it for other reasons, not the practical utility of the product of their work.

lordhumphrey•5mo ago
Peak HN here. Playing musical instruments is "redundant because of technology". And so is "riding horses"? And "painting pictures". Eh, what?
lioeters•5mo ago
I think they mean audio recording/reproduction, automobiles, and cameras have replaced much of what musicians, horses, and painters used to do. Similarly, AI will replace much of the thinking and problem solving done by programmers.
foxglacier•5mo ago
For example, almost all music listened to today is recorded, not live. It was the opposite way around 100+ years ago. Almost all portraits are photographs, not paintings, etc. The common practical uses of those skills are gone and they're relegated to small niches, luxury services, and personal pleasure.
IanCal•4mo ago
Yes? I do not play the guitar to get a better recreation of a song - if that’s all I wanted I’d play the original on high quality speakers.
eunos•5mo ago
Lol and the Huawei note wrote otherwise. AI still hallucinates a lot so pursue mastery over algorithms and data structures to improve the technology
Mr-Frog•5mo ago
Chinese century incoming.
brcmthrowaway•5mo ago
How many chief scientists (aka career climbers) does OpenAI have at this point?
rfoo•5mo ago
meret is really good tho.
cptroot•5mo ago
Does anyone know how long it will be until the input/output data packet is made available? I'm interested in taking a crack at some of these but know I always miss an edge case.
rfoo•5mo ago
You can try your solutions here: https://wf25open.kattis.com/contests/wf25open

I believe it runs with the same test data as in the actual contest.

dooglius•5mo ago
> You need to join the contest in order to be allowed to submit.

Doesn't seem to be publicly accessible to non-participants (yet?)

jeremykvlim•5mo ago
It has been made available here: https://open.kattis.com/problem-sources/ICPC%20World%20Final...

It does seem to be missing 3 problems though.

akamaka•5mo ago
In the TV show Silicon Valley, there’s a joke that Nelson “Big Head” Bighetti, the perennial underperformer, did his undergrad at ASU. But I guess that’s one thing the show got wrong, because Arizona State University finished among the top three American schools in the world finals.
riku_iki•5mo ago
I expected fast response from AI labs about what kind of medals top models could win.
coolThingsFirst•5mo ago
Great memories of ICPC. Their problem statements are so creative it’s insane.

Nothing like CF garbage, solving imaginary patterns that no one cares about.

osti•5mo ago
What do you mean by imaginary patterns from Codeforces?
coolThingsFirst•5mo ago
The problems are really low quality.

Topcoder/ICPC/CodeJam have the best problem statements.

Check out this for example: https://codeforces.com/contest/2136/problem/C

Why would I care if some array can be obtained by combining some other patterns?

pxx•5mo ago
This is a pretty neat problem. Maybe this isn't the activity for you...
coolThingsFirst•5mo ago
No, sorry. You have a bad taste.
jmpman•5mo ago
Wow ASU, the 4th highest US School. Not bad when also being a top party school.
pedrosorio•5mo ago
You can check all the teams and their members here: https://cphof.org/advanced/icpc/2025

It's rarely the case that looking at school names is useful (for many things in life) when there are more data points.

In this case, without any insider knowledge, just by looking at their profiles, the relevant name would appear to be Benjamin Jeter (https://codeforces.com/profile/BenjaminJ) rather than ASU. Currently 5th active American in the top competitive programming platform, top 200 worldwide (https://codeforces.com/ratings/country/United%20States). That's elite.

In teams of 3, even one "super player" can make a big difference. Almost certainly carrying that team.

sanatik•5mo ago
My alma-mater is only 61st. I remember the times we’re top 30. Great atmosphere though! I wonder if these competitions will become obsolete as LLMs advance.
MisterSandman•5mo ago
I don’t see why it would. Chess is still bigger than ever.
agnishom•5mo ago
What is Moscow's secret to training their programmers so well?
pedrosorio•5mo ago
*St. Petersburg

I guess, like a lot of other sports at the college level, having a reputation that attracts the best competitive programmers (and a great coach to go along with it) doesn't hurt: https://en.wikipedia.org/wiki/Andrey_Stankevich

userbinator•5mo ago
The "Russian hacker" stereotype is not at all fiction. If you've ever worked with developers from any of the former USSR, you'll know what I mean; they are not afraid to be creative and do whatever it takes to solve the problem.
dikei•5mo ago
Start training them from a very young age: competitive coders typical start in secondary/high school or even earlier.

Russia has specialized schools to support this kind of education, so are China and many other countries. Thus, they rank very high in IOI and ICPC contests

partomniscient•5mo ago
The ICFP progamming contest for this years International Conference on Functional Programming started today if anyone's interested.

https://icfpcontest2025.github.io/index.html

wiz21c•5mo ago
what's the meaning of of the A,B,C... columns It's a ratio but of what over what ?
acomjean•5mo ago
The columns are the questions. The score is “total att/solved”, (attempted/ solved?) though that doesn’t help much. I’m guessing you need to get the answer within the time limit.

https://worldfinals.icpc.global/scoreboard/2025/problems/A.p...

saagarjha•5mo ago
They're the problems with how many teams correctly solved it over the number of teams that attempted to solve it.
concacinquant•5mo ago
A, B, C... are the ID of the problems (not sorted by difficulty, teams have to figure out the order).

For each cell of (team, problem), the "ratio" x/y isn't actually a ratio. x means how many submissions were made. y is the minute when the accepted solution was submitted. For example, "3/298" means they made 3 submissions in total, and the accepted solution was submitted in the 298th minute (the contest lasted 300 minutes).

The penalty ("Time" column) is calculated as (sum of y) + 20 * (sum of (x-1)).

lordhumphrey•5mo ago
Wow, China with a pretty dominant position there with 3 teams in the top five. Interesting seeing Karlsruhe there too, I'd been looking at that school.
concacinquant•5mo ago
They have won the championship multiple times actually. There are times where "Western teams" are just full of mainland Chinese communicating in Mandarin (e.g. a few MIT teams in the past including the 2021 champions...)
lordhumphrey•5mo ago
Wowser. Is it a similar story to the Chinese olympics successes - train kids from a (very) young age in specialised schools?
muldvarp•5mo ago
I expect OpenAI to have crushed the competition here.