I just found this draft/informal IETF specification: Alternative Elliptic Curve Representation:
This document specifies how to represent Montgomery curves and (twisted) Edwards curves as curves in short-Weierstrass form and illustrates how this can be used to implement elliptic curve computations using existing implementations that already implement, e.g., ECDSA and ECDH using NIST prime curves.
This triggered my curiosity as I thought that ECDSA and EdDSA had many more differences than just different curves.
From what I understand, Edwards curves can be expressed in the Weierstrass form.
How is EdDSA different from using ECDSA with an Edwards curve (e.g., Curve25519) converted to a Weierstrass curve? I am mostly interested in functional aspects rather than possible optimization(s) due to curve parameters.