Fair Math

[Fair Math @FairMath]

1/8 Today, we’re introducing a completely new FHERMA.

What started as a challenge and benchmarking platform for FHE is evolving into a much bigger infrastructure layer: a common system for discovering, evaluating and using the state-of-the-art building blocks/components behind modern privacy technologies and the applications built on top of them.

[Fair Math @FairMath]

👀

[Gurgen Arakelov @g_arakelov]

Railway reported that attackers may have accessed encrypted customer data and potentially its decrypted contents.

A reminder that encryption ≠ security.

AI doesn't need to break cryptography to break cryptographic systems.

I wrote more about why: https://t.co/d6qjt4j7Cv

[Fair Math @FairMath]

We've introduced a new feature on https://t.co/v8RWPCPfyt that we believe will be useful for researchers and developers: Kernel Radars.

Kernel Radars allow you to track developments related to a specific kernel, including new research, algorithms, implementations, optimizations, security attacks, and other relevant findings.

Each radar continuously monitors multiple sources, identifies significant developments, and connects them to the corresponding kernel.

The goal is to provide a continuously updated view of the research and technological landscape surrounding each kernel, making it easier to discover relevant advances, understand their significance, and assess their potential impact on performance, security, and implementation.

Radars powered by https://t.co/5PyW0sTkY7 .

Explore an example - CKKS Bootstrapping Radar:
https://t.co/YrVbVtVty2

[Fair Math @FairMath]

Impressive result from Anthropic, well beyond cryptography.

Claude reportedly took less than 30 minutes to trace the origins of NIST elliptic curve seeds, a question open for over 25 years.

No vulnerability found, but the implications for research are significant.

As AI accelerates discoveries, we face a new bottleneck: understanding what matters and adapting existing systems.

https://t.co/OMgQSxWmLd

[Fair Math @FairMath]

FHERMA has an official stream on Monstream.
Follow it to stay up to date with new benchmarks, challenges, platform updates, and everything happening across the FHERMA ecosystem.

All updates in one place, automatically.

https://t.co/xA4m3q5Lrj

[Fair Math @FairMath]

“Attacks on Public-Key Cryptography” is a new stream on Monstream.

It monitors 1,000+ sources daily for attacks on RSA, elliptic curves and PQC, plus side channels, implementation flaws and quantum threats and filtering out the noise.

https://t.co/heBTqgIYwh

[Gurgen Arakelov @g_arakelov]

Launched a new FHE stream on Monstream.
It tracks relevant developments across the field: new implementations and releases, research updates, attacks and security findings, benchmarks, events, talks, and other technical developments.

You can follow it here and receive the updates automatically:
https://t.co/D0RgMIRxwX

[Fair Math @FairMath]

Poulpy CKKS Bootstrapping board on FHERMA, with benchmark results for the full bootstrapping kernel and for each stage separately: SlotsToCoeffs, ModUp, CoeffsToSlots, and EvalMod.

All runs use the same keys and inputs, making it easy to inspect the full bootstrap and each kernel under the same setup.
Based on Poulpy 0.8.3, CPU only.

FHERMA Boards are probably one of the most interesting features on the platform. Anyone can combine results from different kernels into a board like this and share it as a single view.

https://t.co/xIeQG9jK44

[Fair Math @FairMath]

Today's best result is 260 µs — 20% faster than yesterday's best.

https://t.co/CByPbWf1ua

[Fair Math @FairMath]

Current fastest submission in one of the NVIDIA × FHERMA challenges:
Negacyclic polynomial multiplication, degree 32,768, with 868-bit coefficients is under 0.5 ms on GPU.

https://t.co/4ZHmmIxntC

[Fair Math @FairMath]

Current fastest submission in one of the NVIDIA × FHERMA challenges:
Negacyclic polynomial multiplication, degree 32,768, with 868-bit coefficients is under 0.5 ms on GPU.

https://t.co/4ZHmmIxntC

[Fair Math @FairMath]

NVIDIA × Fair Math Challenges are LIVE on FHERMA!

We're excited to collaborate with @NVIDIAHPCDev to bring GPU acceleration layer support to the FHE ecosystem using NVIDIA's cuPQC.

To kickstart this initiative, we're launching two new developer challenges with GPU compute:

- Polynomial Multiplication: Build high-performance polynomial multiplication on cuPQC's bigint backend.  (Great entry point for GPU/CUDA devs!)

- Key Switching in CKKS: Optimize one of FHE's biggest bottlenecks using GPU-native arithmetic.

Whether you're an FHE researcher or a CUDA/GPU dev, you can help build open-source infrastructure that projects worldwide will use.

Join the challenges: https://t.co/9KeQ9qBkeN

#FHE #Cryptography #CUDA #GPU #cuPQC #NVIDIA #OpenSource

[Fair Math @FairMath]

Join us next week for the OpenFHE webinar on Efficient Large-Integer Arithmetic for FHE.

We’ll present recent results from the collaboration between NVIDIA, Fair Math and Duality Technologies, including cuPQC, FHERMA, and our recent joint work on large-integer arithmetic.

Register here: https://t.co/Iw4G3rmGiw

[Fair Math @FairMath]

8/8 FHERMA is live.
Explore the platform:
https://t.co/AD3D41KCuv
Read the full vision:
https://t.co/weG8uescPl
Start building:
https://t.co/RWSM0XVcqE

[Fair Math @FairMath]

1/8 Today, we’re introducing a completely new FHERMA.

What started as a challenge and benchmarking platform for FHE is evolving into a much bigger infrastructure layer: a common system for discovering, evaluating and using the state-of-the-art building blocks/components behind modern privacy technologies and the applications built on top of them.

[Fair Math @FairMath]

7/8 The new FHERMA is infrastructure for making this fragmented and constantly changing computational landscape usable.
A common way to:
• discover what exists
• understand where different approaches win
• compare implementations across workloads and hardware
• bring better implementations into real systems as the state of the art evolves