π₯example
BRC-20 version Spirt stone

Story
In ancient times, there was a legendary inscription that possessed immense spiritual power, yet its energy seemed to be out of place in that era. To prevent this power from causing havoc in the mortal realm, the gods joined forces to seal its power away. For millions of time block, it lay quietly among the ruins of the gods' temple, amidst a pile of rubble, devoid of any vitality. Until block 793000...
Rule
There is no initial allocation, all tokens are generated through minting.
Anyone can mint since block height 793000 (around June 5 18:00 UTC) until block height 800000.
The first 100 inscriptions of every 10 blocks are considered valid.
The maximum limit for each individual inscription is 1000 tokens, and the reward halves every 144 blocks until the individual reward decreases to 125 tokens. After that, the reward remains unchanged until reach max supply.
Minting will stop when the total number of tokens reaches 21,000,000.
If there is any discrepancy between above textual description and the actual results of the code, the results of the code should be considered authoritative.
Deployment
Inscription ID #10835888
Donation
The inclusion of the "Donation" field in the deployment was initially intended for demonstrating a conditional whitelist. However, it was later realized that such an approach might not be considered cool. If you appreciate this protocol, you are welcome to make a donation within your means. However, please do not expect any form of return or compensation.
Mint
In this example, both "p":"brc-20" and "p":"brc-20c" will be considered valid in order to demonstrate compatibility.
OR
Other operations
As we discussed in the previous chapter, the upper-layer protocol inherits all the behaviors of the lower-layer protocol by default. Therefore, in this case, except for the overridden operation "mint", brc-20c inherits all the operations from brc-20. So, for other operations, please refer to the original protocol documentation for more details.
Verification
I suggest you guys run your own query...
Code explain
emmm, i suppose the code is quite straightforward and easy to understand, anything i need to explain?
Further work
OICP has many more interesting feature waiting to be explored, such as the polymorphism mentioned earlier, which has not been fully demonstrated in this example. Additionally, intelligent conditions can become even more interesting. Anyway, have fun and look forward.
Last updated