A Subexponential Time Algorithm for Elliptic Curve Discrete Logarithm (github.com)

The runtime follows from a reduction to Boolean tensor contraction problem - recently claimed to be subexponential, and for now very impractical.