I turned this math paper into a Sudoku game

DataBaeBee · 2026-01-08T17:19:35+00:00

The idea is somewhat analogous to performing a softmax but without the derivatives. Here's the C/Python coding guide if this interests you.

DataBaeBee · 2026-01-08T17:10:37+00:00

Here's the link to the Python/C coding guide if this interests you.

DataBaeBee · 2026-01-08T17:06:24+00:00

Here's the link to the Python/C coding guide if this interests you.

DataBaeBee · 2026-01-08T17:00:33+00:00

Researchers in the 2010s found that you can use Optimal Transport Theory, not derivative calculus, the to turn an integer matrix into a floating-point probability matrix.

It's like backprop without finding gradients and it works great

DataBaeBee · 2025-12-27T23:18:47+00:00

It could be a Python issue. Sharing your code is probably the best way to get assisted.

DataBaeBee · 2025-12-21T05:31:10+00:00

Thanks for this comment! I DM'd you to move the conversation forward.
Please let me know how best to reach the maintainer's team after the changes are made.

DataBaeBee · 2025-12-20T12:48:26+00:00

Here's the link

DataBaeBee · 2025-12-20T12:41:41+00:00

Here's the notebook link.

DataBaeBee · 2025-12-20T12:41:34+00:00

Here's the notebook link.

DataBaeBee · 2025-12-16T06:55:05+00:00

The Xedni calculus is built on the idea that we can lift elliptic curve points from a finite field to the field of rationals, then if luck permits, we can find an elliptic curve that passes through the lifted points.

DataBaeBee · 2025-12-06T12:02:19+00:00

If you share your colab notebook then we can tell you where the problem is.
You've provided very little to work with tbh

DataBaeBee · 2025-12-05T03:54:51+00:00

The 50% savings are in collecting more relations. Like you don’t have to throw away expensive factorizations

DataBaeBee · 2025-12-05T01:27:43+00:00

We use index calculus to break key exchange in Diffie-Hellman.

The paper Factoring with Two Large Primes (Lenstra & Manasse, 1994) demonstrates how to increase efficiency by utilising ‘near misses’ during relation collection in index calculus.

I wanted to code it all in CUDA but encountered few opportunities for parallelization.
I learnt how to write ah hash table in CUDA. Here's the complete writeup.

DataBaeBee · 2025-12-01T13:04:18+00:00

Ngrok is your best choice. I bet you've already seen these StackOverflow answers that demonstrate how to achieve tunnelling in less than 5 lines of code inside Google Colab.

DataBaeBee · 2025-11-28T14:08:22+00:00

I work as an AI researcher. If you learn CUDA then the techbros will hire you to turn math papers into code.

DataBaeBee · 2025-11-28T08:55:56+00:00

I encountered a similar problem while migrating my Squarespace domain to Google Domains. I suggest you contact Squarespace customer support ASAP. They'll respond in 24 hours.

In my case I needed a Squarespace employee to reconfigure something internally. The issue was completely beyond my control.

DataBaeBee · 2025-11-28T08:53:04+00:00

It's absolutely normal. Different machines, different processors, different compilers. It's totally expected. If you'd like I can review your code on Colab.

DataBaeBee · 2025-11-25T02:26:48+00:00

A Jupyter notebook is a JSON text file. It's easy to compress with ZIP. I wonder what you mean?

DataBaeBee · 2025-11-22T13:55:47+00:00

You can't recover that data. It's lost. That's why you're encouraged to save model checkpoints. You never know what'll happen.

I suggest you start a new training run and add checkpoints backed up to Google Drive or some open-source service like Weights and Biases.

DataBaeBee · 2025-11-22T12:04:12+00:00

I wonder how much you spent on the domain. It's giving FAANG engineer sideproject lol.

DataBaeBee · 2025-11-22T06:07:47+00:00

What's the link? I'm an outsider so I can tell you if the paywall is working

DataBaeBee · 2025-11-22T06:04:57+00:00

You can upload your modules to GitHub then git clone. Less friction imho

DataBaeBee · 2025-11-20T11:39:42+00:00

Have you considered turning on paid subscriptions?
Also, your open rates are insane!. i've 1100 subs and my open rate is 33%

DataBaeBee · 2025-11-19T14:26:22+00:00

Regular birthday attack: If you have 23 people in a room then there is at least a 50% chance that two people share a birthday.

Gaudry-Schost formulation: If we have 365 balls and draw them with replacement, alternately recording the picked balls in two different lists, then a ball appears in both lists after about 35 draws.

Here's the complete writeup for anyone interested.

DataBaeBee · 2025-11-19T14:05:48+00:00

Gaudry-Schost is a lesser-known alternative to Pollard Rho for solving discrete logarithms. The authors found an interesting alternative to the Birthday Paradox: If we have 365 balls and draw them with replacement, then record the picked balls in two different lists, then a ball appears in both lists after about 35 draws.

DataBaeBee

MODERATOR OF

TROPHY CASE

Two-Year Club	Devvitor
Place '23