Advanced non-fungible token blockchain architecture
Methods and systems described herein may implement non-fungible tokens that implement a programmable grammar-based syntax in a variety of environments. In an embodiment, a first non-fungible token that implements a programmable grammar-based syntax standard and includes a first updatable programmable section is generated. The first non-fungible token includes at least one of first executable instructions or first data, and a first portion of the at least one of the first executable instructions or the first data is stored, according to the grammar-based syntax standard, in the first updatable programmable section. The first non-fungible token may then be stored at a first blockchain address on a blockchain, and the first portion of the at least one of the first executable instructions or the first data in the first updatable programmable section of the first non-fungible token is subsequently changed to at least one of second executable instructions or second data.
1. A system related to non-fungible tokens, comprising:
a non-transitory memory; and
one or more hardware processors coupled to the non-transitory memory and configured to read instructions from the non-transitory memory to cause the system to perform operations comprising:
generating a first non-fungible token that implements a programmable grammar-based syntax standard and includes a first updatable programmable section, wherein the first non-fungible token includes at least one of first executable instructions or first data, and wherein a first portion of the at least one of the first executable instructions or the first data is stored, according to the programmable grammar-based syntax standard, in the first updatable programmable section;
storing the first non-fungible token at a first blockchain address on a blockchain; and
subsequently changing the first portion of the at least one of the first executable instructions or the first data in the first updatable programmable section of the first non-fungible token stored at the first blockchain address to at least one of second executable instructions or second data.
2. The system related to non-fungible tokens of claim 1 , wherein the operations further comprise:
generating a first smart contract according to the programmable grammar-based syntax standard that utilizes mathematical operators to perform logic when referencing at least one of a second smart contract that implements the programmable grammar-based syntax standard or a token that implements the programmable grammar-based syntax standard; and
storing the first smart contract at a second blockchain address on the blockchain, wherein the first smart contract performs the generating of the first non-fungible token.
3. The system related to non-fungible tokens of claim 1 , wherein the operations further comprise:
generating a second non-fungible token that implements the programmable grammar-based syntax standard, wherein the second non-fungible token includes at least one of third executable instructions or third data, wherein a second portion of the at least one of the third executable instructions or the third data is included in a second updatable programmable section; and
storing the second non-fungible token at a second blockchain address on the blockchain.
4. The system related to non-fungible tokens of claim 3 , wherein the operations further comprise:
generating a permit smart contract that utilizes mathematical operators that provides permissions to a first entity to have access to at least a portion of the at least one of the third executable instructions, the third data, the second executable instructions, or the second data; and
storing the permit smart contract at a third blockchain address on the blockchain.
5. The system related to non-fungible tokens of claim 1 , wherein the first non-fungible token is in a hierarchical relation to a second token that implements the programmable grammar-based syntax standard.
6. The system related to non-fungible tokens of claim 5 , wherein the hierarchical relation includes the first non-fungible token being a parent of the second token that is a child of the first non-fungible token that implements the programmable grammar-based syntax, wherein a parent/child relationship between the first non-fungible token and the second token is defined in a permit smart contract or in the first updatable programmable section of the first non-fungible token.
7. The system related to non-fungible tokens of claim 1 , wherein the first non-fungible token enables an entity associated with the first non-fungible token to be identified.
8. The system related to non-fungible tokens of claim 7 , wherein the first non-fungible token further includes first syntax formal statements, according to the programmable grammar-based syntax standard, that provide permissions to the entity associated with the first non-fungible token.
9. The system related to non-fungible tokens of claim 8 , wherein the first non-fungible token further includes second syntax formal statements, according to the programmable grammar-based syntax standard, that enable a definition of one or more conditions to be satisfied to allow the permissions.
10. The system related to non-fungible tokens of claim 1 , wherein the operations further comprise:
transferring the first non-fungible token from a first account to a second account, when a transfer condition is satisfied by using one or more mathematical operators to define that the first account is no longer associated with the first non-fungible token while the second account is associated with the first non-fungible token.
11. The system related to non-fungible tokens of claim 1 , wherein the first non-fungible token does not use any application programming interfaces (APIs) to interact with other non-fungible tokens according to the programmable grammar-based syntax standard.
12. A method of non-fungible token generation, comprising:
generating, by a computing device, a first non-fungible token that implements a programmable grammar-based syntax standard, wherein the first non-fungible token includes at least one of first executable instructions or first data;
storing, by the computing device, the first non-fungible token at a first blockchain address on a blockchain; and
storing, by the computing device, a permit smart contract at a second blockchain address on the blockchain that uses mathematical operators to give permission to a first entity to access at least a portion of the at least one of the first executable instructions or the first data provided in the first non-fungible token.
13. The method of claim 12 , further comprising:
receiving, by the computing device through a network from a broadcast by a first transaction device, a first digital transaction that includes a plurality of digital transaction information;
identifying, by the computing device in the first digital transaction, a third blockchain address provided on the blockchain;
accessing, by the computing device on the blockchain via the first blockchain address, a first blockchain smart contract that is stored on the blockchain in association with the first blockchain address; and
executing, by the computing device, the first blockchain smart contract, wherein the execution of the first blockchain smart contract causes the generating the first non-fungible token.
14. The method of claim 12 , wherein a first portion of the at least one of the first executable instructions or the first data is included in a first updatable programmable section.
15. The method of claim 12 , wherein the first non-fungible token is in a hierarchical relation to a second token that implements the programmable grammar-based syntax standard.
16. The method of claim 15 , wherein the hierarchical relation includes the first non-fungible token being a parent of the second token that is a child of the first non-fungible token that implements the programmable grammar-based syntax standard, wherein a parent/child relationship between the first non-fungible token and the second token is defined in the permit smart contract or in an updatable programmable section of the first non-fungible token.
17. The method of claim 12 , wherein the first non-fungible token further includes first syntax formal statements, according to the programmable grammar-based syntax standard, that provide a permission to the first entity associated with the first non-fungible token.
18. The method of claim 17 , wherein the first non-fungible token further includes second syntax formal statements, according to the programmable grammar-based syntax standard, that enable a definition of one or more conditions to be satisfied to allow the permissions.
19. A method of non-fungible token generation, comprising:
generating, by a computing device, a first non-fungible token that implements a programmable grammar-based syntax standard, wherein the first non-fungible token includes at least one of first executable instructions or first data;
defining, by the computing device, a hierarchical relation to a second token that implements the programmable grammar-based syntax standard, wherein the hierarchical relation includes the first non-fungible token being a parent of the second token that is a child of the first non-fungible token that implements the programmable grammar-based syntax standard; and
storing, by the computing device, the first non-fungible token at a first blockchain address on a blockchain.
20. The method of claim 19 , wherein a parent/child relationship between the first non-fungible token and the second token is defined in a permit smart contract or in the first non-fungible token.