Log in Open app

Log in Open app

Swapnil

2,065 posts

Swapnil

@SJ_Swapnil_Jain

Backend & AI Engineer ⚙️ Enterprise HIPAA/SOC2 compliance for startups 🧠 AWS, RAG, MCP, LangChain 📌 founder @firstimpresslab 🎓 MS @GeorgiaTech Open for hire

Looking for AI engineer ? 📩

Joined March 2013

1,320 Followers

RepliesReplies RepostsReposts MediaMedia

Get the full app experience

Unlock more features and see what people are talking about right now.

Pinned
Swapnil
@SJ_Swapnil_Jain
Sep 9
Is ANYONE hiring in the Agentic AI/Infra/Healthcare domain ? Remote offers only cuz I was born in 3rd world country yo not my fault
4
666
Swapnil
@SJ_Swapnil_Jain
1h
I am announcing an update on this 3SUM problem. We now have the fastest deterministic 3SUM algorithm known: n¹·⁹⁹⁶¹ That's 4.5× the deterministic saving below n², with zero randomness, and it matches the best randomized bound.
ZhaoSong
@nojobafterphoto
Oct 6
Truly Subquadratic 3SUM and Truly Subcubic APSP via Triangles in Sparse Lopsided Graphs (Josh Alman)@firebat03 , Virginia Vassilevska Williams This is really a huge breakthrough result in fine-grained complexity. arxiv.org/abs/2610.06783
4
6
111
3K
Swapnil
@SJ_Swapnil_Jain
11h
Publishing results that can help advance mathematics as a whole. In search of faster integer multiplication, we found where the walls are: proven ceilings and no-go theorems for the finite-witness approach to beating n log n. Open access, fully reproducible.
zenodo.org
Ceilings and Impossibility Results for Finite Witnesses of Sub-n log n Integer Multiplication
OpenAI's manuscript Integer multiplication below n log n reduces bounds T(n) = O(n (log n)^(1-κ)) to finite, exactly certified constructions, and a public effort around Douglas Colkitt's repository...
3
6
105
8K
Swapnil
@SJ_Swapnil_Jain
13h
Eleventh update to OpenAI problem #109 (integer multiplication): κ rises to 2⁻¹⁰·⁵⁴⁷, still past 2⁻¹¹. Witness value: κ = 2⁻¹⁰·⁵⁴⁷ = 6.6857 × 10⁻⁴ (tightened from κ = 2⁻¹⁸²) This κ is about 1.09 fold our previous witness value κ = 2⁻¹⁰·⁶⁶⁶ = 6.1534 ×
Swapnil
@SJ_Swapnil_Jain
17h
Tenth update to OpenAI problem #109 (integer multiplication): we are now past 2^-11. κ = 2^-10.666 (6.1534 × 10⁻⁴), tightened from κ = 2⁻¹⁸² That is about 1.32 fold over our previous 2^-11.066 (4.6637 × 10⁻⁴), and a 2¹⁷¹ fold improvement over the original OAI result.
18
27
679
33K
Swapnil
@SJ_Swapnil_Jain
14h
Looking for an @arxiv endorser in cs.CC (Computational Complexity). The paper collects proofs from our work on OpenAI problem #109
3
1
48
4.2K