Dev Radar
Support
LiveUpdated 2026-11-07 06:42 UTC

nf12

nf12 — Lossless compression of BF16 models to 12-bits. Contribute to dphnAI/nf12 development by…

nf12 is Lossless compression of BF16 models to 12-bits. Contribute to dphnAI/nf12 development by creating an account on GitHub.. It is ranked #609 on the Dev Radar, in AI dev tools, first seen 45 min ago and shared in 1 post (386 views).

Visit github.com

GitHub - dphnAI/nf12: Lossless compression of BF16 models to 12-bits · GitHub Skip to content Navigation Menu Sign in Search / Sign in Sign up Appearance settings You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert {{ message }} Repository navigation nf12 Public Notifications You must be signed in to change notification settings Fork 0 ( 0 ) Star 6 ( 6 ) You must be signed in to star a repository About Lossless compression of BF16 models to 12-bits…

What people said about nf12 on X

Impression work! This is super hard to get speed improvements with this kind of format. If we can achieve lossless compression and better speed, we will see more and more models using this.

— @bnjmn_marie, 45 min ago · 12 likes · see the post

Alternatives to nf12

nf12 in numbers

FAQ

What is nf12?

Lossless compression of BF16 models to 12-bits. Contribute to dphnAI/nf12 development by creating an account on GitHub. It was first shared on X 45 min ago and is ranked #609 on the Dev Radar.

Is nf12 free?

It is open source.

Who shared nf12?

1 account on X, including @bnjmn_marie, in 1 post totalling 386 views.

Every post is read and classified by AGK Intelligence: what it is, which market it belongs to, and whether the link is a real tool. 32k posts from 5k X accounts over the last 21 days, 9.6k tools, 12 markets. New posts are collected several times an hour and the full ranking is recomputed every hour — last update 2026-11-07 06:42 UTC. Full method.