20 Commits

Author	SHA1	Message	Date
Daniel Lubarov	c7ba4eb6ee	Feedback	2022-07-20 09:45:05 -07:00
Daniel Lubarov	78fb34a9b6	Minor	2022-07-20 00:10:52 -07:00
Daniel Lubarov	05a1fbfbae	Stack manipulation macro ... Uses a variant of Dijkstra's, with a few pruning mechanics, to find a path of instructions between the two stack states. We don't explicitly store the graph though. The Dijkstra implementation is somewhat inspired by the `pathfinding` crate. That crate doesn't quite fit our needs though. If we need to make it faster later, there are a lot of allocations and clones that we could probably eliminate.	2022-07-19 22:59:56 -07:00
wborgeaud	4316be96cd	Test exp kernel function	2022-07-07 19:15:39 +02:00
wborgeaud	434615a03c	PR feedback + comments	2022-07-07 08:26:57 +02:00
wborgeaud	9747343ac2	PR feedback	2022-07-06 09:25:41 +02:00
wborgeaud	5bae732ea0	Minor	2022-07-05 21:24:51 +02:00
wborgeaud	8ffd25c127	Add zero case for mul	2022-07-05 21:22:05 +02:00
wborgeaud	fb8a67b0d9	Working ecmul	2022-07-05 21:12:11 +02:00
wborgeaud	9e90d7d115	Add check for zero point	2022-07-05 20:27:55 +02:00
wborgeaud	fd1d9fe85e	Add range check	2022-07-05 17:37:34 +02:00
wborgeaud	8e711d413a	Minor	2022-07-05 16:41:28 +02:00
wborgeaud	7364248e60	Fixes	2022-07-05 15:43:41 +02:00
wborgeaud	eed7cde388	Add moddiv for testing	2022-07-05 15:01:40 +02:00
wborgeaud	8a44c557c5	Curve mul assembly	2022-07-05 12:11:35 +02:00
wborgeaud	4d37685744	Comment	2022-07-05 11:12:56 +02:00
wborgeaud	a5988d6c26	Simplify	2022-07-05 11:09:25 +02:00
wborgeaud	6db8539bc8	Minor	2022-07-05 10:46:07 +02:00
wborgeaud	683efc0d74	Impl double	2022-07-05 10:45:26 +02:00
wborgeaud	797bece7bd	First attempt	2022-07-01 18:28:22 +02:00