In the following coindesk article, The math behind bitcoin, you can find a beautiful example of the ECDSA keypair generation, signature and signature verification algorithms in use in bitcoin. They illustrate the address generation in a finite field of order n=67 and the signing/verification in n=79, which keeps the computations manageable; even with just a calculator.
I suspect that a basic monero/cryptonote calculation example would be quite a bit longer. Still, even such longer article would be interesting to a lot of people, in order to gain a better understanding of what monero/cryptonote actually do.
Does such article exist already? (I could not find one ...)
If there is no such elaborated exercise available, I would certainly be interested in composing (and even publishing) one; if I could find help for corrections and verifications. Do you know of starting point drafts/links/documents, suitable for the composition of such numerical example?
Note: Formulas and formal proofs are interesting in their own right, but I guess that they are not as suitable as starting points like a good numerical example.