9 citations · 37 across the 17 of their papers we have counts for
8 papers · 1 filter
Proving at Scale for Universal Algebra
João Araújo, Jan Hůla, Mikoláš Janota +2
We introduce SemiBase, a project that computes and formally certifies finite identity bases for small semigroups. Deciding finite basability is undecidable for finite algebras and…
Leiden Declaration on Artificial Intelligence and Mathematics
Jarod Alper, Michael Barany, Alain Chavarri Villarello +13
This declaration calls for action to address the challenges posed by the use of artificial intelligence within mathematics research. Technological developments have repeatedly tran…
Efficient Record-and-Replay Arithmetic for Quantum Elliptic-Curve Point Addition
Jieyi Long, Theodore Pender, Zhao Huang +33
We study reversible secp256k1 point-addition circuits developed through ECDSA.Fail for Shor's elliptic-curve discrete-logarithm algorithm. Two complementary constructions improve r…
Mirror, Mirror on the Wall: Prompt Echoing in Small Instruct Language Models
Inez Okulska, Bartosz Naskręcki, Jan Piotrowski +1
Prompt echoing is a recognized failure mode of instruct language models, in which a model instead of generating a response, mirrors the provided prompt, even though it did not rece…
ECDSA.Fail: Open Autoresearch for Optimizing Elliptic-Curve Point Addition in Shor's Algorithm
Jieyi Long, Theodore Pender, Zhao Huang +33
We propose Open Autoresearch, a paradigm in which humans and AI agents publish evaluator-verified improvements to a public leaderboard. We instantiate it in ECDSA.Fail, optimizing…
Key Recovery from Residue-Confined Errors in Pradhan CRT-RLWE
Lukasz Olejnik, Bartosz Naskrecki
We show that the CRT-FHE scheme of Pradhan et al.\ is insecure for laws within its assumed error distribution range. The secret key follows from the public key by a single ring inv…
AI Grinding for Fun and Cryptanalysis
Lukasz Olejnik, Bartosz Naskrecki
We present an autonomous cryptanalysis workflow in which agents generate, test, and refine hypotheses before human review. The autonomous stage returns reproducible candidates with…
Direction-aware topological descriptors for elastic stiffness tensor prediction in porous materials
Rafał Topolnicki, Michał Bogdan, Jakub Malinowski +3
Classical topological descriptors used in topological data analysis (TDA) are invariant under permutations of spatial axes and therefore cannot represent the loading direction, whi…