frontpage.
newsnewestaskshowjobs

Made with ♥ by @iamnishanth

Open Source @Github

fp.

Advent of Compiler Optimisations 2025

https://xania.org/202511/advent-of-compiler-optimisation
61•vismit2000•2h ago•3 comments

What will enter the public domain in 2026?

https://publicdomainreview.org/features/entering-the-public-domain/2026/
298•herbertl•8h ago•151 comments

Apple Releases Open Weights Video Model

https://starflow-v.github.io
187•vessenes•6h ago•44 comments

Addressing the adding situation – Matt Godbolt

https://xania.org/202512/02-adding-integers
13•messe•21m ago•0 comments

YouTube increases FreeBASIC performance (2019)

https://freebasic.net/forum/viewtopic.php?t=27927
28•giancarlostoro•2d ago•1 comments

Comparing AWS Lambda ARM64 vs. x86_64 Performance Across Runtimes in Late 2025

https://chrisebert.net/comparing-aws-lambda-arm64-vs-x86_64-performance-across-multiple-runtimes-...
27•hasanhaja•2h ago•2 comments

Rootless Pings in Rust

https://bou.ke/blog/rust-ping/
71•bouk•4h ago•39 comments

DeepSeek-v3.2: Pushing the frontier of open large language models [pdf]

https://huggingface.co/deepseek-ai/DeepSeek-V3.2/resolve/main/assets/paper.pdf
803•pretext•20h ago•381 comments

India orders smartphone makers to preload state-owned cyber safety app

https://www.reuters.com/sustainability/boards-policy-regulation/india-orders-mobile-phones-preloa...
730•jmsflknr•1d ago•474 comments

Beej's Guide to Learning Computer Science

https://beej.us/guide/bglcs/
174•amruthreddi•2d ago•53 comments

How Brian Eno Created Ambient 1: Music for Airports (2019)

https://reverbmachine.com/blog/deconstructing-brian-eno-music-for-airports/
54•dijksterhuis•4h ago•27 comments

Why Replicate is joining Cloudflare

https://blog.cloudflare.com/why-replicate-joining-cloudflare/
41•chmaynard•6h ago•30 comments

Tom Stoppard has died

https://www.bbc.com/news/articles/c74xe49q7vlo
100•mstep•2d ago•23 comments

Reverse math shows why hard problems are hard

https://www.quantamagazine.org/reverse-mathematics-illuminates-why-hard-problems-are-hard-20251201/
104•gsf_emergency_6•9h ago•20 comments

After Windows Update, Password icon invisible, click where it used to be

https://support.microsoft.com/en-us/topic/august-29-2025-kb5064081-os-build-26100-5074-preview-3f...
87•zdw•9h ago•38 comments

Invisible Details of Interaction Design

https://rauno.me/craft/interaction-design
23•bfirsh•6d ago•2 comments

Man unexpectedly cured of HIV after stem cell transplant

https://www.newscientist.com/article/2506595-man-unexpectedly-cured-of-hiv-after-stem-cell-transp...
21•doener•1h ago•1 comments

URL in C Puzzle

https://susam.net/url-in-c.html
43•birdculture•5d ago•13 comments

Ghostty compiled to WASM with xterm.js API compatibility

https://github.com/coder/ghostty-web
340•kylecarbs•17h ago•97 comments

Notes on Bhutan

https://apropos.substack.com/p/notes-on-bhutan
66•sg5421•10h ago•35 comments

Codex, Opus, Gemini try to build Counter Strike

https://www.instantdb.com/essays/agents_building_counterstrike
223•stopachka•3d ago•71 comments

Ask HN: Who is hiring? (December 2025)

261•whoishiring•19h ago•344 comments

Cartographers have been hiding illustrations inside Switzerland’s maps (2020)

https://eyeondesign.aiga.org/for-decades-cartographers-have-been-hiding-covert-illustrations-insi...
318•mhb•22h ago•67 comments

Wacky Fun Physics Ideas

https://scottlocklin.wordpress.com/2025/11/22/wacky-fun-physics-ideas/
4•surprisetalk•3d ago•0 comments

Google, Nvidia, and OpenAI

https://stratechery.com/2025/google-nvidia-and-openai/
208•tambourine_man•20h ago•177 comments

Google unkills JPEG XL?

https://tonisagrista.com/blog/2025/google-unkills-jpegxl/
329•speckx•20h ago•240 comments

Shrinking While Linking

https://www.tweag.io/blog/2025-11-27-shrinking-static-libs/
31•ingve•4d ago•3 comments

Arcee Trinity Mini: US-Trained Moe Model

https://www.arcee.ai/blog/the-trinity-manifesto?src=hn
57•hurrycane•11h ago•14 comments

10 years of writing a blog nobody reads

https://flowtwo.io/post/on-10-years-of-writing-a-blog-nobody-reads
252•thejoeflow•4d ago•125 comments

Frequently Asked Unicycling Questions

https://vale.rocks/posts/unicycle-faq
44•edent•6h ago•30 comments
Open in hackernews

NetBSD 10.x Kernel Math_emulation

https://mezzantrop.wordpress.com/2025/02/04/netbsd-10-x-kernel-math_emulation/
57•jaypatelani•6mo ago

Comments

__s•6mo ago
This sort of platform support is cool, but it's a sign when existing hardware is failing & the platform support is shown with emulation

If uou run ancient hardware, use ancient software. Preservation efforts in keeping an image of that ancient software available makes sense (which becomes harder as modern build systems pull from network to build)

boricj•6mo ago
Sometimes it's useful to be able to run modern software on ancient hardware.

I once made an image of a hard disk so old it wouldn't work on anything newer than a Pentium. I plugged in a USB PCI card+USB stick and booted a modern-ish at the time Debian Live CD.

It took over 5 minutes to decompress just the kernel and a hour to copy the HDD to the USB stick, but it did work. The time delta between the oldest and newest component on that system was well over 20 years, sometimes this is what you have to do with what you have on hand.

jmclnx•6mo ago
I saw this a few days ago, nice, especially since Linux is dropping support for older hardware. Even OpenBSD is slowly limiting i386 (32bit) support:

https://www.openbsd.org/i386.html

NetBSD so far has no plans to drop 32bit x86 support, and it is always nice to be able to run a modern UN*X on older hardware. IIRC, porting NetBSD to a new platform is quite easy when compared to other systems. This is due to how their HAL (hardware abstraction layer) is designed.

Today I saw in the OpenBSD @misc mailing list one of the issues they are having with i386 is rust is too large for them to compile on a i386 system. That means software packages that need rust are being removed from their packages.

This does not affect NetBSD because they allow cross-compiling of everything on their systems.

anthk•6mo ago
OpenBSD runs perfectly fine under i386, atom user there.

I don't care about Rust and it's killer app Firefox, there are tons of alternatives for i686. From Luakit to Vimb.

johnklos•6mo ago
Compiling rust on a 32 bit system is a several year old issue. Enough of us made a fuss about it that the rust build system was fixed enough that this became possible again.

If rust doesn't compile on an i386 system with 4 gigs of memory, then that's very odd. I don't know much about rust, but I was still able to get it to compile for earmv6hf on a Raspberry Pi 3 with 1 gig of RAM. Perhaps the OpenBSD people need to try some of the things we've already figured out.

https://mail-index.netbsd.org/tech-pkg/2025/05/09/msg031137....

makz•6mo ago
Cannot find the mail in @misc you are talking about
jmclnx•6mo ago
Here it is

https://marc.info/?l=openbsd-misc&m=174696055709421&w=2

anthk•6mo ago
On math FP emulation, by looking up the code it seems pretty close to the code from Robert F. Illyes for Forth 83.

Forth implementation in Eforth it's like this:

    ( FORTH-83 FLOATING POINT.
      ----------------------------------
      COPYRIGHT 1985 BY ROBERT F. ILLYES
            PO BOX 2516, STA. A
            CHAMPAIGN, IL 61820
            PHONE: 217/826-2734  )     HEX
    : ZERO  OVER 0= IF DROP 0 THEN ;
    : FNEGATE 8000 XOR ZERO ;
    : FABS  7FFF AND ;
    : NORM  >R 2DUP OR
            IF BEGIN DUP 0< NOT
               WHILE D2* R> 1- >R
               REPEAT SWAP 0< - ?DUP
               IF R> ELSE 8000 R> 1+ THEN
            ELSE R> DROP THEN ;
    : F2*   1+ ZERO ;
    : F*    ROT + 4000 - >R UM* R> NORM ;
    : FSQ   2DUP F* ;
    : F2/   1- ZERO ;
    : UM/   DUP >R UM/MOD SWAP R>
            OVER 2* 1+ U< SWAP 0< OR - ;
    : F/    ROT SWAP - 4000 + >R
            0 ROT ROT 2DUP U<
            IF   UM/ R> ZERO
            ELSE >R D2/ FABS R> UM/ R> 1+
            THEN ;
    : ALIGN 20 MIN 0 DO D2/ LOOP ;
    : RALIGN 1- ?DUP IF ALIGN THEN
            1 0 D+ D2/ ;
    : FSIGN FABS OVER 0< IF >R DNEGATE R>
            8000 OR THEN ;
    : F+    ROT 2DUP >R >R FABS SWAP FABS -
            DUP IF DUP 0<
                    IF   ROT SWAP  NEGATE
                         R> R> SWAP >R >R
                    THEN 0 SWAP RALIGN
            THEN SWAP 0 R> R@ XOR 0<
            IF   R@ 0< IF 2SWAP THEN D-
                 R> FSIGN ROT SWAP NORM
            ELSE D+ IF 1+ 2/ 8000 OR R> 1+
                    ELSE R> THEN THEN ;
    : F-    FNEGATE F+ ;
    : F<    F- 0< SWAP DROP ;
    ( FLOATING POINT INPUT/OUTPUT ) DECIMAL
    CREATE PL 3 , HERE  ,001 , ,   ,010 , ,
              ,100 , ,            1,000 , ,
            10,000 , ,          100,000 , ,
         1,000,000 , ,       10,000,000 , ,
       100,000,000 , ,    1,000,000,000 , ,
    : TENS  2* 2* LITERAL + 2@ ;     HEX
    : PLACES PL ! ;
    : SHIFTS FABS 4010 - DUP 0< NOT
            ABORT" TOO BIG" NEGATE ;
    : F#    >R PL @ TENS DROP UM* R> SHIFTS
            RALIGN PL @ ?DUP IF 0 DO # LOOP
            ". HOLD THEN #S ROT SIGN ;
    : TUCK  SWAP OVER ;
    : F.    TUCK <# F# #> TYPE SPACE ;
    : DFLOAT 4020 FSIGN NORM ;
    : F     DFLOAT POINT TENS DFLOAT F/ ;
    : FCONSTANT F 2CONSTANT ;
    : FLOAT DUP 0< DFLOAT ;
    : -+    DROP SWAP 0< IF NEGATE THEN ;
    : FIX   TUCK 0 SWAP SHIFTS RALIGN -+ ;
    : INT   TUCK 0 SWAP SHIFTS  ALIGN -+ ;
    1.      FCONSTANT ONE DECIMAL
    34.6680 FCONSTANT X1
    -57828. FCONSTANT X2
    2001.18 FCONSTANT X3
    1.4427  FCONSTANT X4
    : EXP   2DUP INT DUP >R FLOAT F-
            F2* X2 2OVER FSQ X3 F+ F/
            2OVER F2/ F-     X1 F+ F/
            ONE F+ FSQ R> + ;
    : FEXP  X4 F* EXP ;
    : GET   BL WORD DUP 1+ C@ "- = TUCK -
            0 0 ROT CONVERT DROP -+ ;
    : E     F GET >R R@ ABS 13301 4004 */MOD
            >R FLOAT 4004 FLOAT F/ EXP R> +
            R> 0< IF F/ ELSE F* THEN ;
    : E.    TUCK FABS 16384 TUCK -
            4004 13301 */MOD >R
            FLOAT 4004 FLOAT F/ EXP F*
            2DUP ONE F<
            IF 10 FLOAT F* R> 1- >R THEN
            <# R@ ABS 0 #S R> SIGN 2DROP
            "E HOLD F# #>     TYPE SPACE ;
the float abs function it's literally the same, operating over the same bits.

On the lack of floating point on some arch, Forth itself (even ANS Forth) encourages you to follow a fixed point philosophy unless it's absolutely neccesary, because you can always scale up the magnitudes on big 32 bit machines.

And Pi can be prise enough by using scaling with 'double' (for 16 bit machines) numbers:

100.000 355 113 m*/ d. 314159 ok

SudoSuccubus•6mo ago
This is the most worthless thing in the world. Why would anybody give a rat's fucking ass about a third? Not even a third rate like a 10th rate. Fucking operating system having math support. Oh wow! Congratulations! Now you can go ahead and support computers from 1985 now
2000UltraDeluxe•6mo ago
It's a hobbyist project. It doesn't need any "worth" apart from the joy the author got from it.

Kudos to the author for doing this _and_ sharing it with the world.

anthk•6mo ago
This is about software emulated FP. OFC NetBSD used the FP module in CPU's since long ago.

Also, FP is not math, it's just a kind of math. And even Forth users will use a fixed point before going into float. With 32 bits, they will just scale the point and call it a day.

And seasoned Forth users will just use quotient arithmetic and output fractional parts as two items in the stack.