Implementation of the Verifiable Timed Commitment scheme as described in section E "Verifiable Timed Commitment" of the paper Verifiable Timed Signatures Made Practical by Thyagarajan et al.
This implementation also features proposed optimizations such as a more efficient batch range proof generation as well as a batch puzzle solving mechanism which ensures that only one puzzle needs to be solved.
git clone <url>asdf install(optional)go test -count 1 -race ./...
go run <package-path>
go build [<package-path>]
go test [<package-path>][/...] [-v] [-cover] [-race] [-short] [-parallel <number>]
go test -bench=. [<package-path>] [-count <number>] [-benchmem] [-benchtime 2s] [-memprofile <name>]
go test -coverprofile <name> [<package-path>]
go tool cover -html <name>
go tool cover -func <name>
go fmt [<package-path>]
go mod init [<module-path>]
go mod tidy