You can start by using java script, but can use also python, Java, C#, C++.
No need for GUI
A presentation with the following information:
a. assignments executed with known bug
b. unexecuted assignments
Second Slide: how to install and open instructions.
Other slides: A clear explanation of the implementation of the work at the module level, needs to be specified at the method level for complex methods.
Last Slides: Skeleton log of detailed demonstration and verification.
Second Part: Merkle Tree & Bloom Filter
A. P2P network with at least three nodes, one of them is “Full nodes”
B. 18 transactions between nodes are defined in MemPool (recorded in a file for initialization read-only, or - Database)
C. Full nodes contain a blockchain chain that leases the transactions, and they are stored in Merkel wood, and the implementation of a bloom filter.
D. The other nodes are Wallet-SPV (Simplify Payment Verification).
E. Ability to demonstrate transaction verification of a transaction in Wallet-SPV. And the lack of a transaction in blockchain.
F. A blockchain contains up to 4 transactions.
G. All wallets start from the sum of 1000 mining coins per block 100 and proof of final balance 3400.