MainPA1.output

# $ java -cp ./bcprov-jdk15on-169.jar:ScroogeCoin MainPA1 > MainPA1.output
MainPA1 demonstrates functionality of TxHandler (and MaxFeeTxHandler)by running some tests.
Instantiating cryptographic primitives for [Java](en.wikipedia.org/wiki/Bouncy_Castle_(cryptography)),
for simplicity, using RSA provided by [Bouncy Castle's JAR](bouncycastle.org/download/bcprov-jdk15on-169.jar).
Caution, compare hashes before executing any .jar, running `sha256sum bcprov-jdk15on-169.jar` yields:
e469bd39f936999f256002631003ff022a22951da9d5bd9789c7abfa9763a292  bcprov-jdk15on-169.jar
For deterministic reproducibility of the probabilistic algorithms a fixed seed is used.
Initializing crypto primitives and generating Scrooge's signature keys.
Initial tokens worth 99.9 [S] (signed by Scrooge) start this blockchain.
Adding users to the network, e.g., Alice identified via (A_pk, A_sk),
	and Bob identified via (B_pk, B_sk).
Testing tx validity (one is valid, and one invalid):
Input : [B@3891771e
Output : 66.6
Input : [B@2de8284b
Output : 44.7
true
true
Valid transactions: 1