tl;dr: Ligero + <?> = Ligerito!
Implementations
There is an initial Julia implementation, by Bane Capital Crypto.
Rust implementation, by Ashutosh Ahelleya.
None of them are as succinct as they can be, apparently.
For $2^{20}$-sized polynomial, the Rust code gives:
Prover time: 4.34s
Verifier time: 317.90ms
Julia seems to give:
Prover time: 0.114s
Verifier time: 19ms
Andrija says it should be 2ms.
References
For cited works, see below 👇👇