This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# The goal with this program is to demonstrate how to construct pedersen | |
# commitments in similar fashion to how the Monero tx protocol does, but in a hugely | |
# simplified way (read: not exact, but close), to show how we can prove hidden input | |
# and output amounts balance. | |
# Some stuff is left as an exercise to the reader where commented. | |
# **Corrections are very much so welcome.** | |
# I encourage anyone who doesn't know much about pedersen commitments to | |
# go through coinstudent2048's excellent tutorial on elliptic curve | |
# cryptography [1] first. And anyone interested in this to first read through | |
# Zero to Monero v2 chapters 5 and 6 [3]. |