DE102019104092A1 - Method for controlling a hardware system using a blockchain - Google Patents

Abstract

The method for controlling a hardware system using a blockchain is characterized in that the blockchain is dynamized by relocating the logic and parameters to the blocks on the blockchain itself and / or on a separate library chain by declassifying the node software, a classification of the blocks in types and an expansion of the blocks by a container structure, which contains the logic and the parameters for the block processing method.

Description

The invention relates to a method for controlling a hardware system using a blockchain.

background

The invention is a method with which dynamic database properties can be applied on a decentralized blockchain. Blockchains can either be forked or joined together by linking or referencing. They can finally be terminated and data blocks can be deleted. This is made possible by de-clustering the procedural logic and declaring new block types. The previous use of the blockchain as a continuous add-only memory becomes a dynamic, decentralized database thanks to the invention and opens up many new areas of application that were previously only possible with native database applications.

State of the art

• Das Hauptmerkmal einer Blockchain ist das manipulationssichere Speichern von Daten, in Form einer fortlaufenden, zusammenhängenden Protokollierung eines über einen durch Algorithmus errechneten Hash. Die Blockchain hat dadurch die Eigenschaft eines „Nur-Hinzufüge-Speichers“, welcher jegliche nachträgliche Veränderung der Daten wie Löschen oder Bearbeiten unmöglich macht. Das Hauptmerkmal einer Datenbank basierten Anwendung ist der flexible Umgang mit Daten. Sie können auch gelöscht oder geändert werden. In seiner Konsequenz bedeutet das, dass sich die Eigenschaften der Blockchain und die einer Datenbank basierten Anwendung gegenseitig ausschließen. Die Blockchain kann in ihrer jetzigen Form nur für sehr spezielle Einsatzbereiche in Form von dauerhaft fortlaufender und gleich bleibender Dokumentation, z.B. für Kontoführung, Notaraufgaben, Ledger etc. verwendet werden. Der Einsatzbereich einer Blockchain im Alltag ist dadurch eng begrenzt.

In the known, static methods, in contrast to the invention, the following problems arise:

• The main feature of a blockchain is the tamper-proof storage of data, in the form of continuous, coherent logging of a hash calculated using an algorithm. As a result, the blockchain has the property of an “only add memory”, which makes any subsequent changes to the data such as deleting or editing impossible. The main characteristic of a database-based application is the flexible handling of data. They can also be deleted or changed. As a consequence, this means that the properties of the blockchain and those of a database-based application are mutually exclusive. The blockchain in its current form can only be used for very special areas of application in the form of permanently ongoing and constant documentation, e.g. for account management, notary tasks, ledgers, etc. The area of application of a blockchain in everyday life is therefore very limited.

Summary of the disadvantages of the known static methods

1. 1. Narrowly limited area of application.
2. 2. Long time until a new block processing method is available and used.
3. 3. When sharing a blockchain (fork), the network is also divided.
4. 4. Computing power (hash power) of the network firmly bound to a blockchain.
5. 5. Non-controllable energy demand for block processing.
6. 6. Limited production quantity in block production (scaling).
7. 7. It is not possible to prevent new entries (no termination of the blockchain).
8. 8. Stored data cannot be changed (add-only memory).
9. 9. High storage space requirements from the overall increase in the blockchain history (fragmentation).
10. 10. Required software change of the nodes after a fork.
11. 11. Mandatory publicly transparent inspection of the source code.
12. 12. Specified type of script or programming language.
13. 13. No reliable and economically sensible prioritization of transactions.
14. 14. No merging of existing blockchains.
15. 15. Software with procedural logic can be manipulated.
16. 16. Forks are only possible on the last block of a blockchain.

Problem and solution of the invention

Object of the invention: The above-mentioned disadvantages of the prior art are to be avoided.

In a method for controlling a hardware system using a blockchain of the type mentioned at the outset, this object is achieved according to the invention in that the blockchain is dynamized by shifting the logic and parameters into the blocks on the blockchain itself and / or on a separate library chain, in that the node software is declassified, the blocks are classified into types and the blocks are expanded by a container structure which contains the logic and the parameters for the block processing method.

Advantages of the invention

• Die Architektur der Blockchain und ihrer Infrastruktur wurde dahingehend geändert, dass sich die Eigenschaften der Blockchain, gemeinsam mit den Eigenschaften einer Datenbank basierten Anwendung, direkt auf der Blockchain oder über eine separate Bibliothekenchain abbilden lassen. Intelligente Blocktypen enthalten die gesamte Verarbeitungslogik. Sie können einen von den Daten-Blöcken differenzierten Konsens-Mechanismus haben. Proof-Of-Work, Proof-Of-Stake etc. können parallel zum Einsatz kommen. Im Ergebnis kann dadurch ein breit gefächertes Spektrum neuer Einsatzgebiete, zur sicheren, dezentralen Speicherung und Verwaltung von Daten in der Industrie und für alltägliche Zwecke mit einem attraktiven Kosten-Nutzen-Faktor erzielt werden.

With the invention of the dynamic method, the following problems are solved or the following advantages are achieved:

• The architecture of the blockchain and its infrastructure was changed so that the properties of the blockchain, together with the properties of a database-based application, can be mapped directly on the blockchain or via a separate library chain. Smart block types contain all of the processing logic. They can have a different consensus mechanism from the data blocks. Proof-Of-Work, Proof-Of-Stake etc. can be used in parallel. As a result, a wide range of new areas of application can be achieved for the secure, decentralized storage and management of data in industry and for everyday purposes with an attractive cost-benefit factor.

Summary of the advantages of the method according to the invention

1. 1. Broad spectrum of new areas of application.
2. 2. Immediate provision and use of a new processing method.
3. 3. Fork-resistant, cross-blockchain network.
4. 4. Computing power dynamically distributed across all blockchains (hash power).
5. 5. Energy demand adapted to requirements.
6. 6. Variable production quantity in block production (scaling).
7. 7. Final termination of a blockchain.
8. 8. Entries can be deleted and changed.
9. 9. Lower storage space requirements for selected blockchain sections (defragmentation).
10. 10. Changing the node software in the event of process changes is not required.
11. 11. Outsourcing of processes in non-public areas.
12. 12. Free choice of script or programming language.
13. 13. Reliable and economically sensible prioritization of transactions.
14. 14. Merging of existing blockchains.
15. 15. Software with procedural logic tamper-proof.
16. 16. Forks possible at any time on any block.

These advantages are achieved through the following process steps

Advantage 1 - Broad spectrum of new areas of application, achieved through the following process steps:

1. 1. De-clustering of the node software by removing the logic and parameter definitions.
2. 2. Extension of the block parameters by optional containers.
3. 3. Insertion of the logic and parameter definition in optional containers of the blocks on the blockchain itself or on an independent blockchain (library chain).
4. 4. A data source posts a task as a transaction in the transaction pool.
5. 5. She selects transaction: fork, merge, quit, delete, inform or save.
6. 6. A node fetches a transaction from the transaction pool.
7. 7. Creation and appending of an intelligent block by a privileged node.
8. 8. Storage of rights, logic and parameter definitions by privileged nodes.

Conclusion: By using intelligent block types, a wide range of new areas of application is opened up in addition to the previous, narrowly defined area of application of a blockchain, namely the storage of data as secure add-only storage. They contain the entire processing logic and can have a consensus mechanism that is different from the data blocks. Proof-Of-Work, Proof-Of-Stake etc. can be used in parallel. Tasks such as forking, merging, ending, deleting and informing are thus immediately possible.

Advantage 2 - Immediate use of a changed processing method.

1. 1. De-clustering of the node software by removing the logic and parameter definitions.
2. 2. Extension of the block parameters by optional containers.
3. 3. Insertion of the logic and parameter definition in optional containers of the blocks on the blockchain itself or on an independent blockchain (library chain).
4. 4. Nodes access new logic and parameter definitions directly from the blocks on the blockchain or from an independent blockchain (library chain).
5. 5. Including new logic and parameter definitions in the ongoing processing process.
6. 6. Immediate application of the new logic and parameter definitions.

Conclusion: Changes to the logic and parameter definitions are immediately available to the nodes and can be used immediately to edit the following blocks.

Advantage 3 - Fork-resistant network spanning the blockchain.

1. 1. De-clustering of the node software by removing the logic and parameter definitions.
2. 2. Extension of the block parameters by optional containers.
3. 3. Insertion of the logic and parameter definition in optional containers of the blocks on the blockchain itself or on an independent blockchain (library chain).
4. 4. Nodes access new logic and parameter definitions directly from the blocks on the blockchain or from an independent blockchain (library chain).
5. 5. Including new logic and parameter definitions in the ongoing processing process.
6. 6. Immediate application of the new logic and parameter definitions.
7. 7. Parallel processing of blockchains using appropriate logic and parameter definitions.

Conclusion: The network is retained because the nodes no longer have to decide which blockchain (fork) they will process exclusively for in the future. You can opt for multiple blockchains at the same time because you have instant access to the logic and parameter definitions. The nodes can keep a library internally with the various logic and parameter definitions of the individual blockchains for immediate availability for faster processing.

Advantage 4 - Computing power dynamically distributed over all blockchains (hash power).

• 1. De-clustering of the node software by removing the logic and parameter definitions.
• 2. Extension of the block parameters by optional containers.
• 3. Insertion of the logic and parameter definition in optional containers of the blocks on the blockchain itself or on an independent blockchain (library chain).
• 4. Nodes access new logic and parameter definitions directly from the blocks on the blockchain or from an independent blockchain (library chain).
• 5. Including new logic and parameter definitions in the ongoing processing process.
• 6. Immediate application of the new logic and parameter definitions.
• 7. Parallel processing of blockchains using appropriate logic and parameter definitions.
• 8. Utilization, ownership, or reward related priorities in block processing.

Conclusion: The computing power of the entire network can be used for all blockchains (forks). Depending on the utilization and the number of transactions for a blockchain, the computing power available can be used optimally. Standstill or waiting times are avoided. Decisions can e.g. Be utilization, ownership or reward dependent.

Advantage 5 - energy demand adapted to requirements.

1. 1. De-clustering of the node software by removing the logic and parameter definitions.
2. 2. Extension of the block parameters by optional containers.
3. 3. Insertion of the logic and parameter definition in optional containers of the blocks on the blockchain itself or on an independent blockchain (library chain).
4. 4. Nodes access new logic and parameter definitions directly from the blocks on the blockchain or from an independent blockchain (library chain).
5. 5. Including new logic and parameter definitions in the ongoing processing process.
6. 6. Immediate application of the new logic and parameter definitions.
7. 7. Parallel processing of blockchains using appropriate logic and parameter definitions.
8. 8. Block processing priorities subject to ownership or authority.

Conclusion: Purpose-adapted processing parameters (e.g. lower degree of difficulty / difficulty) reduce the computing effort. Tasks or parts of them can be outsourced to privileged nodes in a protected environment. As a result, the energy requirement is reduced. This is environmentally friendly and saves costs.

Advantage 6 - Variable scaling of the amount of block production.

1. 1. De-clustering of the node software by removing the logic and parameter definitions.
2. 2. Extension of the block parameters by optional containers.
3. 3. Insertion of the logic and parameter definition in optional containers of the blocks on the blockchain itself or on an independent blockchain (library chain).
4. 4. Nodes access new logic and parameter definitions directly from the blocks on the blockchain or from an independent blockchain (library chain).
5. 5. Including new logic and parameter definitions in the ongoing processing process.
6. 6. Immediate application of the new logic and parameter definitions.
7. 7. Parallel processing of blockchains using appropriate logic and parameter definitions.
8. 8. Block processing priorities subject to ownership or authority.

Conclusion: The purpose-adapted processing as well as the outsourcing of tasks or their subareas to privileged nodes in a protected environment reduces the computing effort. The saved computing capacity is available for other tasks. More tasks can be processed in the same time. This increases production.

Benefit 7 - Final termination of a blockchain.

1. 1. De-clustering of the node software by removing the logic and parameter definitions.
2. 2. Extension of the block parameters by optional containers.
3. 3. Insertion of the logic and parameter definition in optional containers of the blocks on the blockchain itself or on an independent blockchain (library chain).
4. 4. Nodes access new logic and parameter definitions directly from the blocks on the blockchain or from an independent blockchain (library chain).
5. 5. Including new logic and parameter definitions in the ongoing processing process.
6. 6. Immediate application of the new logic and parameter definitions.
7. 7. Parallel processing of blockchains using appropriate logic and parameter definitions.
8. 8. Block processing priorities subject to ownership or authority.
9. 9. A data source posts a transaction to the transaction pool for termination.
10. 10. A privileged node fetches a transaction from the transaction pool to end it.
11. 11. Put an end block at the end of a blockchain.
12. 12. Store information.

Conclusion: An end block can be added to the end of a blockchain. This prevents the addition of new blocks. The chain is now closed. The end block can contain information in a container. Processes can thus be finalized. Completed processes no longer have to be taken into account for ongoing processes. This saves memory and computing capacity.

Advantage 8 - Entries can be deleted and changed.

1. 1. De-clustering of the node software by removing the logic and parameter definitions.
2. 2. Extension of the block parameters by optional containers.
3. 3. Insertion of the logic and parameter definition in optional containers of the blocks on the blockchain itself or on an independent blockchain (library chain).
4. 4. Nodes access new logic and parameter definitions directly from the blocks on the blockchain or from an independent blockchain (library chain).
5. 5. Including new logic and parameter definitions in the ongoing processing process.
6. 6. Immediate application of the new logic and parameter definitions.
7. 7. Parallel processing of blockchains using appropriate logic and parameter definitions.
8. 8. Block processing priorities subject to ownership or authority.
9. 9. A data source posts a transaction for deletion in the transaction pool.
10. 10. A privileged node fetches a transaction for deletion from the transaction pool.
11. 11. Delete the blocks contained in the delete transaction.
12. 12. Store information.

Conclusion: data that is optionally to be deleted is stored on a separate blockchain. This blockchain is marked as deletable in its limb block or an independent blockchain (library chain). After deletion, this data area can optionally be written again or finally closed by an end block before further writing. This enables, among other things, the "right to be forgotten" from the EU GDPR to be implemented. An info file can contain the reason for the deletion (e.g. personal data deleted at the customer's request).

Advantage 9 - space requirement only for selected blockchain sections.

1. 1. De-clustering of the node software by removing the logic and parameter definitions.
2. 2. Extension of the block parameters by optional containers.
3. 3. Insertion of the logic and parameter definition in optional containers of the blocks on the blockchain itself or on an independent blockchain (library chain).
4. 4. A data source posts a transaction for forking into the transaction pool.
5. 5. A privileged node fetches a transaction from the transaction pool for fork.
6. 6. Creation and appending of a limb block by a privileged node.
7. 7. Storage of rights, logic and parameter definitions.
8. 8. Nodes access new logic and parameter definitions directly from the blocks on the blockchain or from an independent blockchain (library chain).
9. 9. Including new logic and parameter definitions in the ongoing processing process.
10. 10. Immediate application of the new logic and parameter definitions.
11. 11. Storage of the history for the new blockchain.

Conclusion: Tasks are outsourced in independent chains. Only the path from the historical beginning of the chain to the current most recent block is required for the task ( 10 ). All other tasks on the blockchain are not relevant to the outsourced task. This minimizes the storage space at the nodes. A full node feature with a task history is guaranteed.

Advantage 10 - it is not necessary to change the node software when the process changes.

1. 1. De-clustering of the node software by removing the logic and parameter definitions.
2. 2. Extension of the block parameters by optional containers.
3. 3. Insertion of the logic and parameter definition in optional containers of the blocks on the blockchain itself or on an independent blockchain (library chain).
4. 4. A data source posts a transaction for forking into the transaction pool.
5. 5. A privileged node fetches a transaction from the transaction pool for fork.
6. 6. Creation and appending of a limb block by a privileged node.
7. 7. Storage of rights, logic and parameter definitions.
8. 8. Nodes access new logic and parameter definitions directly from the blocks on the blockchain or from an independent blockchain (library chain).
9. 9. Including new logic and parameter definitions in the ongoing processing process.
10. 10. Immediate application of the new logic and parameter definitions.

Conclusion: There is no need to replace or update the node software, because the logic and parameter definitions are obtained directly from the superordinate limb block of the block to be processed or from a block of an independent blockchain (library chain) by the declassified node software. For faster processing, the nodes can keep a library with the various logic and parameter definitions of the individual blockchains for which they want to process, for immediate availability.

Advantage 11 - outsourcing of processes to areas that are not open to the public.

1. 1. De-clustering of the node software by removing the logic and parameter definitions.
2. 2. Extension of the block parameters by optional containers.
3. 3. Insertion of the logic and parameter definition in optional containers of the blocks on the blockchain itself or on an independent blockchain (library chain).
4. 4. A data source posts a transaction for forking into the transaction pool.
5. 5. A privileged node fetches a transaction from the transaction pool for fork.
6. 6. Creation and appending of a limb block by a privileged node.
7. 7. Storage of rights, logic and parameter definitions, interface to external systems.
8. 8. Nodes access new logic and parameter definitions directly from the blocks on the blockchain or from an independent blockchain (library chain).
9. 9. Including new logic and parameter definitions in the ongoing processing process.
10. 10. Immediate application of the new logic and parameter definitions.

Conclusion: Sub-processes can optionally be transferred to external areas (black box) during block processing. The results of the external processing can optionally be returned to the block processing process as processing parameters. The processing process within the external area is not publicly visible (black box).

Advantage 12 - Free choice of script or programming language.

1. 1. De-clustering of the node software by removing the logic and parameter definitions.
2. 2. Extension of the block parameters by optional containers.
3. 3. Insertion of the logic and parameter definition in optional containers of the blocks on the blockchain itself or on an independent blockchain (library chain).
4. 4. A data source posts a transaction for forking into the transaction pool.
5. 5. A privileged node fetches a transaction from the transaction pool for fork.
6. 6. Creation and appending of a limb block by a privileged node.
7. 7. Storage of rights, logic and parameter definitions with scripts in different languages.
8. 8. Nodes access new logic and parameter definitions directly from the blocks on the blockchain or from an independent blockchain (library chain).
9. 9. Including new logic and parameter definitions in the ongoing processing process.
10. 10. Immediate application of the new logic and parameter definitions.

Conclusion: A software choice adapted to the hardware and purpose leads to optimized production results. Middleware between different script and programming languages is no longer necessary. This is economical and makes the overall system less prone to errors.

Advantage 13 - Reliable and economically sensible prioritization of transactions.

1. 1. De-clustering of the node software by removing the logic and parameter definitions.
2. 2. Extension of the block parameters by optional containers.
3. 3. Insertion of the logic and parameter definition in optional containers of the blocks on the blockchain itself or on an independent blockchain (library chain).
4. 4. Nodes access new logic and parameter definitions directly from the blocks on the blockchain or from an independent blockchain (library chain).
5. 5. Including new logic and parameter definitions in the ongoing processing process.
6. 6. Immediate application of the new logic and parameter definitions.
7. 7. Parallel processing of blockchains using appropriate logic and parameter definitions.
8. 8. Utilization, ownership, or reward related priorities in block processing.

Conclusion: privileged nodes that e.g. can be owned by a data source, always process their own transactions first. If there is free capacity, they use their computing power, e.g. available to other blockchains for a fee. From an economic point of view, this can result in a cost-neutral node operation or even a further source of income.

Advantage 14 - Merging of existing blockchains.

1. 1. De-clustering of the node software by removing the logic and parameter definitions.
2. 2. Extension of the block parameters by optional containers.
3. 3. Insertion of the logic and parameter definition in optional containers of the blocks on the blockchain itself or on an independent blockchain (library chain).
4. 4. A data source posts a transaction to be merged into the transaction pool.
5. 5. A privileged node fetches a transaction from the transaction pool for merging.
6. 6. Creation and appending of a limb block by a privileged node.
7. 7. Storage of rights, logic and parameter definitions with references.
8. 8. Nodes access new logic and parameter definitions directly from the blocks on the blockchain or from an independent blockchain (library chain).
9. 9. Including new logic and parameter definitions in the ongoing processing process.
10. 10. Immediate application of the new logic and parameter definitions.
11. 11. Storage of the history for the new blockchain and its references.

Conclusion: By merging any blockchains at any data blocks, it is also possible to reference blockchains with external technologies that are outside the network access. This means that supply chains and manufacturing processes can be clearly documented across all suppliers.

Advantage 15 - software with procedural logic tamper-proof.

1. 1. De-clustering of the node software by removing the logic and parameter definitions.
2. 2. Extension of the block parameters by optional containers.
3. 3. Insertion of the logic and parameter definition in optional containers of the blocks on the blockchain itself or on an independent blockchain (library chain).
4. 4. A data source places a transaction in the transaction pool for a new procedure.
5. 5. A privileged node picks up the transaction for the new procedure from the transaction pool.
6. 6. Creation and appending of a limb block by a privileged node.
7. 7. Storage of rights, logic and parameter definitions.
8. 8. Nodes access new logic and parameter definitions directly from the blocks on the blockchain or from an independent blockchain (library chain).
9. 9. Including new logic and parameter definitions in the ongoing processing process.
10. 10. Immediate application of the new logic and parameter definitions.

Conclusion: The procedural logic is an integral part directly on the blockchain or in an independent blockchain (library chain). It belongs to the data of a genesis block, a limb block or a merge block or any data block on the blockchain itself or on an independent blockchain (library chain) and, together with the start value, is used to hash the end value in these blocks used. Any manipulation of it inevitably leads to a recognizable inconsistency of the blockchain.

Advantage 16 - Forks possible at any block at any time.

1. 1. De-clustering of the node software by removing the logic and parameter definitions.
2. 2. Optional creation of an independent library chain.
3. 3. A privileged node picks up the transaction for the new procedure from the transaction pool.
4. 4. Generation and attachment of a limb block by privileged nodes to an independent blockchain (library chain) or to the referencing blockchain itself.
5. 5. Storage of rights, logic and parameter definitions with the block reference.
6. 6.Nodes get the new logic and parameter definitions from the library chain or from the referencing blockchain itself.
7. 7. Including new logic and parameter definitions in the ongoing processing process.
8. 8. Immediate application of the new logic and parameter definitions.

Conclusion: The procedural logic is an integral part directly on the library chain or on the referencing blockchain itself. It contains a reference to any block of a backbone chain. Because the referencing blockchain does not have to make any changes with regard to the fork, the fork can also take place retrospectively on any block, i.e. also on blocks that already have subsequent blocks. This creates another property that otherwise only database-based applications have.

The dynamization of the blockchain and its infrastructure for opening up new areas of application using intelligent block types for immediate use is particularly important.

Only the relocation of the logic and parameters to the blocks on the blockchain itself or on a separate library chain creates the possibility of immediate changes to the processing method. It enables an extended range of functions with new block types, block connections and combination options ( 12 , compare to 18th , as well 19th ). They contain the entire processing logic and can have a consensus mechanism that is different from the data blocks. Proof-Of-Work, Proof-Of-Stake etc. can be used in parallel. There is a speed and production advantage. It is immediately transferred to the subsequent blocks of the newly created blockchain. The previous processing method on the original blockchain is not affected. Existing documentation channels are guaranteed. Both machining processes can be used in parallel independently of one another. There is no need to coordinate the network. An economic and ecological advantage is achieved.

Compared to the previous procedures, the licensees participate in the shortened value chain for data applications, a significant speed advantage for provision and lower production costs.

The unique selling point is the dynamization of the blockchain and its infrastructure.

The target group are all companies that have to store and manage data securely and decentrally. The data can also be made available to the public in a tamper-proof manner for documentation purposes. Manufacturing and supply chains can also be mapped transparently, quickly and securely. Possible partners can be found both in industry and in the form of service providers or manufacturers for everyday purposes. The range of uses is broad.

Small excerpt of specific application examples:

1.

Maintenance contracts

2.

Tenders

3.

Proof of ID (e.g. to be able to conclude contracts - identify yourself - age check over 18)

4th

Algorithm check (e.g. banknotes - system checks the presence of the serial number and anomalies such as average excessive use)

5.

Fingerprint storage e.g. B. at authorities

6.

M2M solutions

7th

Participation and examination certificate (e.g. online seminars - training courses - high school diploma)

8th.

time clock

9.

Vacation planner

10.

Sweepstakes

11.

Photo evidence (ownership and creation date) also in real time directly when the photo is taken

12.

Advertisements (Ads Control)

13.

Business processes and document management (especially for compliance, data protection, contract management and investment management

14th

testament

15th

Heating, electricity, gas, water reading service

16.

Multi-signature = triggers contracts

17th

consent form

18th

Shareholder resolutions

19th

Conclusion of contracts

20th

Medicinal prescription

21st

POS systems

22nd

IoT communication in networked systems

23

Copyright - rights management and access authorization for digital assets

24

Archiving - documents and file storage - audit-proof archiving - e.g. B. Land registers State archives

1.

Logistik

2.

Cloud-Speicher

3.

Öffentlicher Sektor

4.

Energie

5.

Versorgungswirtschaft

6.

Supply-Chain-Management

7.

Regierung

8.

Ride-Sharing

9.

Musik

10.

Wahlen

11.

Spenden

12.

Internationale Zahlungen

13.

Versicherungen

14.

Künstler, Medien & Werbung

15.

Fälschungen entdecken

16.

Mobilität

17.

Gesundheitswesen

18.

Datenverwaltung von Bürgern

19.

Identitätsmanagement

20.

Wahlen

21.

Steuern

22.

NGOs und Non-Profit Organisationen

23.

Compliance und legislatorische Kontrollen

24.

Shareholder Voting

25.

Datenverwaltung

26.

Cybersecurity

27.

Diplome und Zertifikate

28.

Big Data & Datenspeicherung

29.

Internet of Things (IoT)

In particular, the following areas are strongly influenced by this:

1.

logistics

2.

Cloud storage

3.

public sector

4th

energy

5.

Utilities

6.

Supply chain management

7th

government

8th.

Ride sharing

9.

music

10.

elections

11.

donate

12.

International payments

13th

Insurance

14th

Artists, media & advertising

15th

Discover forgeries

16.

mobility

17th

Healthcare

18th

Citizen data management

19th

Identity management

20th

elections

21st

Taxes

22nd

NGOs and non-profit organizations

23.

Compliance and Legislative Controls

24.

Shareholder voting

25th

Data management

26th

Cybersecurity

27.

Diplomas and certificates

28.

Big data & data storage

29

Internet of Things (IoT)

1. 1. Die Nodes sind statisch an eine Software gebunden.
2. 2. Diese Software enthält die Logik des Verfahrens wie jeder Block zu bearbeiten ist.
3. 3. Jeder Block unterliegt den gleichen Bearbeitungsregeln.
4. 4. Alle Blöcke sind starr vom gleichen Typ.
5. 5. Eine individuelle Bearbeitung von Blöcken ist nicht möglich.
6. 6. Durch die fehlende Logik herkömmlicher Ein- oder mehrteiliger Blockchains/Sidechains entsteht keine Dynamik.

In developing the system according to the invention, the inventors overcame the following technical difficulties in an unobvious way.

1. 1. The nodes are statically linked to software.
2. 2. This software contains the logic of how to edit each block.
3. 3. Each block is subject to the same processing rules.
4. 4. All blocks are rigid of the same type.
5. 5. Individual processing of blocks is not possible.
6. 6. The lack of logic in conventional one-part or multi-part blockchains / sidechains does not create any dynamics.

Solution: Only the de-clustering of the node software, the classification of the blocks into types and the expansion of the blocks by a container structure, which contains the logic and the parameters for the block processing method, enables fast, individual block processing. They contain the entire processing logic and can have a consensus mechanism that is different from the data blocks. Proof-Of-Work, Proof-Of-Stake etc. can be used in parallel.

Advantageous configurations of the invention are given in the subclaims.

Embodiments

Several exemplary embodiments of the invention are described in more detail below with reference to drawings. In all drawings, the same reference symbols have the same meaning and are therefore only explained once if necessary.

• 1: Entclusterung der Nodesoftware des neuen, dynamischen Verfahrens,
• 2: Fork einer Blockchain des neuen, dynamischen Verfahrens,
• 3: Finales Beenden einer Blockchain des neuen, dynamischen Verfahrens,
• 4: Löschen von Datenblöcken auf einer Blockchain des neuen, dynamischen Verfahrens,
• 5: Script- und Black Box-Nutzung des neuen, dynamischen Verfahrens,
• 6: Mergen von Blockchains des neuen, dynamischen Verfahrens,
• 7: Praxisbeispiel Kundenverwaltung auf der Blockchain (fokussiert), neues, dynamisches Verfahren,
• 8: Praxisbeispiel EU-DSGVO Art. 17 auf der Blockchain (fokussiert), neues, dynamisches Verfahren,
• 9: Praxisbeispiel Produktions-Dokumentation (fokussiert), neues, dynamisches Verfahren,
• 10: Speicherplatzbedarf und Gruppierung der Daten im neuen, dynamischen Verfahren,
• 11: Einfachste Definition einer Blockchain (Mindestanforderung), neues, dynamisches Verfahren,
• 12: Mögliche Blockverbindungen im neuen, dynamischen Verfahren,
• 13: Möglicher Aufbau des Containers im neuen, dynamischen Verfahren,
• 14: Statische Blockchain des aus dem Stand der Technik bekannten Verfahrens,
• 15: Fork einer statischen Blockchain des aus dem Stand der Technik bekannten Verfahrens,
• 16: Speicherplatzbedarf und Fragmentierung der Daten im bekannten, statischen Verfahren,
• 17: Einfachste Definition einer Blockchain (Mindestanforderung), bekanntes, statisches Verfahren,
• 18: Mögliche Blockverbindungen im bekannten, statischen Verfahren und
• 19: Referenzierter Fork einer Blockchain des neuen, dynamischen Verfahrens.

Show it

• 1 : De-clustering of the node software of the new, dynamic process,
• 2 : Fork a blockchain of the new, dynamic process,
• 3 : Final termination of a blockchain of the new, dynamic process,
• 4th : Deletion of data blocks on a blockchain of the new, dynamic process,
• 5 : Script and black box use of the new, dynamic process,
• 6th : Merging of blockchains of the new, dynamic process,
• 7th : Practical example of customer management on the blockchain (focused), new, dynamic process,
• 8th : Practical example EU GDPR Art. 17 on the blockchain (focused), new, dynamic procedure,
• 9 : Practical example of production documentation (focused), new, dynamic process,
• 10 : Storage space requirements and grouping of the data in the new, dynamic process,
• 11 : Simplest definition of a blockchain (minimum requirement), new, dynamic process,
• 12 : Possible block connections in the new, dynamic process,
• 13th : Possible construction of the container in the new, dynamic process,
• 14th : Static blockchain of the method known from the prior art,
• 15th : Fork of a static blockchain of the method known from the prior art,
• 16 : Storage space requirements and fragmentation of the data in the known, static method,
• 17th : Simplest definition of a blockchain (minimum requirement), known, static method,
• 18th : Possible block connections in the known, static method and
• 19th : Referenced fork of a blockchain of the new, dynamic process.

Operation of the invention

The method of operation of the method according to the invention is explained in detail below with reference to the drawings:

De-clustering of the node software of the new procedure

1 : From a central software memory ( 1 ) get the nodes ( 2 ) of a network ( 3 ) a software ( 6th ) with the basic operating function ( 4th ) of a node. The initial processing logic ( 5 ) for processing the data blocks ( 7th ) on a backbonechain ( 8th ) get the nodes ( 2 ) directly from a container ( 17th , 13th ) in the Genesis block ( 9 ) the backbonechain ( 8th ) from. It contains the entire processing logic ( 5 ) and can be one of the data blocks ( 7th ) have a differentiated consensus mechanism. Proof-Of-Work, Proof-Of-Stake, etc. are used in parallel. The nodes ( 2 ) get from a transaction pool ( 28 ) the transactions ( 29 ) to process the new data block ( 11 ) from a data source ( 30th ) were delivered there. With the help of the processing logic ( 5 ) the content of a new data block ( 11 ) calculated ( 11 ). The Backbonechain ( 8th ) is created from a Genesis block ( 9 ) with a container ( 17th ) to record files, including, but not limited to, the processing logic ( 5 ) for processing data blocks ( 7th ), Is provided. To this Genesis block ( 9 ) further data blocks ( 7th ) appended. To the last added data block ( 10 ) the newest data block ( 11 ) appended. Written data blocks ( 7th ) cannot be changed and cannot be deleted. The Backbonechain ( 8th ) extends infinitely ( 10 ).

Fork a blockchain of the new procedure

2 : At a fork ( 16 ) (Fork) from the backbonechain ( 8th ) a limbchain is created ( 13th ). One in the Genesis block ( 9 ) in the container ( 17th , 13th ) stored rights file ( 19th ) can certain nodes ( 18th ) grant them special rights. One of these rights can be the addition of a limb block ( 20th ) to the Backbonechain ( 8th ) be. It contains the entire processing logic ( 5 ) and can be one of the data blocks ( 7th ) have a differentiated consensus mechanism. Proof-Of-Work, Proof-Of-Stake, etc. are used in parallel. The privileged node ( 18th ) gets the transaction ( 29 ) from the transaction pool ( 28 ) to add a limb block ( 20th ) that were previously downloaded from a data source ( 30th ) was delivered there. The Limb Block ( 20th ) is like the Genesis block ( 9 ), with a container ( 17th ) for files. Here the limb block receives ( 20th ) from the privileged node ( 18th ) for the limbchain ( 13th ) the new processing logic ( 15th ) and a new rights file ( 21st ). The nodes ( 2 ) get from the limb block in addition to the already existing processing logic ( 5 ) the processing logic ( 15th ) and can now both blocks of the original backbonechain ( 8th ) as well as that of the limbchain ( 13th ) to process. The network ( 3 ) remains intact (compare 15th ). All nodes ( 2 ) new data blocks ( 11 ) according to the original processing logic ( 5 ) to the most recently added limb block ( 20th ) the original backbonechain ( 8th ) as well as new data blocks ( 14th ) for the limbchain ( 13th ) with a modified processing logic ( 15th ) and new rights ( 21st ) to the limb block ( 20th ) append.

Final termination of a blockchain of the new procedure

3 : At a fork ( 16 , 2 ) (Fork) from the backbonechain ( 8th ) a limbchain is created ( 13th ). One in the Genesis block ( 9 ) in the container ( 17th , 13th ) stored rights file ( 19th ) can certain nodes ( 18th ) grant special rights. One of these rights can be added to the addition of a limb block ( 20th ) to the Backbonechain ( 8th ) also the final option to terminate the addition of further blocks by setting an end block ( 22nd ) be. The privileged node ( 18th ) gets the transaction ( 29 ) from the transaction pool ( 28 ) to add an end block ( 22nd ) that were previously downloaded from a data source ( 30th ) was delivered there. The end block ( 22nd ) is like the Genesis block ( 9 ) or the limb block ( 20th ), with a container ( 17th ) for files. An info file ( 23 ) inform about the reason for the termination or further procedures. To the limbchain ( 13th ) no further data blocks ( 14th ) more can be added ( 10 ).

Deletion of data blocks on a blockchain using the new method

4th : At a fork ( 16 , 2 ) (Fork) from the backbonechain ( 8th ) a limbchain is created ( 13th ). One in the limb block ( 20th ) in the container ( 17th , 13th ) stored rights file ( 21st ) can certain nodes ( 18th ) grant special rights. One of these rights can be added to the addition of a limb block ( 20th ) to the Backbonechain ( 8th ) also the possibility of deleting data blocks ( 14th ) be. The privileged node ( 18th ) gets the transaction ( 29 ) from the transaction pool ( 28 ) to delete and add an info block ( 24 ) that were previously downloaded from a data source ( 30th ) was delivered there. Erasing is only from the end of the limbchain ( 13th ) from possible, up to a maximum of before the limb block ( 20th ). There can also be the right to add an info block ( 24 ) to be added. The info block ( 24 ) is like the limb block ( 20th ), with a container ( 17th ) for files. An info file ( 23 ) inform about the reason for the deletion or further procedures. To an info block ( 24 ) further data blocks ( 14th ) can be added.

Script and black box use of the new procedure

5 : From a central software memory ( 1 ) get the nodes ( 2 ) of a network ( 3 ) a software ( 6th ) with the basic operating function ( 4th ) for nodes ( 2 ) from. The initial processing logic ( 5 ) for processing the data blocks ( 7th ) on a backbonechain ( 8th ) get the nodes ( 2 ) directly from a container ( 17th , 13th ) in the Genesis block ( 9 ) the backbonechain ( 8th ) from. The nodes ( 2 ) get from a transaction pool ( 28 ) the transactions ( 29 ) to process the new data block ( 11 ) from a data source ( 30th ) were delivered there. With the help of the processing logic ( 5 ) the content of a new data block ( 11 ) calculated. The Backbonechain ( 8th ) is created from a Genesis block ( 9 ) with a container ( 17th ) to record files, including, but not limited to, the processing logic ( 5 ) for processing data blocks ( 7th ), Is provided. This container also contains ( 17th ) a rights file ( 19th ) the specific nodes ( 18th ) Special rights, such as inserting a limb block ( 20th ) admits. To this Genesis block ( 9 ) further data blocks ( 7th ) appended. To the last added data block ( 10 ) the newest data block ( 11 ) appended. Written data blocks ( 7th ) are immutable ( 11 ) and cannot be deleted. The Backbonechain ( 8th ) extends infinitely ( 10 ). The privileged node ( 18th ) gets the transaction ( 29 ) to add a limb block ( 20th ) from the transaction pool ( 28 ) that were previously downloaded from a data source ( 30th ) was delivered there. At a fork ( 16 , 2 ) (Fork) of a limb block ( 20th ) from the Backbonechain ( 8th ) a limbchain is created ( 13th ). The Limb Block ( 20th ) is like the Genesis block ( 9 ), with a container ( 17th ) for files. The node ( 18th ) fills this container with a rights file ( 21st ) and a new processing logic ( 15th ). The nodes ( 2 ) get for processing the data blocks ( 14th ) on the limbchain ( 13th ) the processing logic ( 15th ) in addition to the existing processing logic ( 5 ) the backbonechain ( 8th ) from. In a processing logic ( 15th ) multilingual scripts can also be used during block processing via an interface ( 26th ) to external systems ( 25th ), submit data there and receive a result back. The result can be applied to the block processing of the data block ( 14th ) Have influence. The processes of the external system ( 25th ) are for the nodes ( 2 ) in the network ( 3 ) not apparent.

Merging of blockchains of the new procedure

6th : A privileged node ( 18th ) from the network ( 3 ) forks (27, 2 ) from a backbone chain ( 8th ) a new blockchain to merge as a merge chain ( 32 ) out. When merging ( 31a-c ) (Merge) the blockchains ( 13a-c ) from a limb block ( 20th ) or from any data block ( 14b + c ) a blockchain becomes a merge chain ( 32 ). One in the merge block ( 33 ) in the container ( 17th , 13th ) stored rights file ( 21st ) can certain nodes ( 18th ) with special rights for the merge chain ( 32 ) equip. A parameter file also stored there ( 34 ) contains the identifier of the merged ( 31a-c ) Blockchains ( 13a-c ) as well as the identifier of the limb block ( 20th ) or the data block ( 14b-c ) from which the merge ( 31a-c ) has been referenced. When referencing a limb block ( 20th ) that was added specifically for the merge can be stored in its container ( 17th ) an info file ( 23 ) for the reason for the merger ( 31a ). Referencing to data blocks ( 14b + c ) from any blockchains ( 13b + c ) and any architecture outside the network ( 3 ) is possible and required no special authorization for referencing. The blockchains ( 13a-c ) continue regardless of the merge (3 1a-c) according to their purpose. The privileged node ( 18th ) gets the transaction ( 29 ) to create a merge block ( 33 ) from the transaction pool ( 28 ) that were previously downloaded from a data source ( 30th ) was delivered there. The merge block ( 33 ) is with a container ( 17th ) for files. Here the merge block contains ( 33 ) from the node ( 18th ) for the new merge chain ( 32 ) the new processing logic ( 15th ), a new rights file ( 21st ) and a parameter file ( 34 ). The nodes ( 2 ) get from the merge block ( 33 ) additionally the new processing logic ( 15th ). All nodes ( 2 ) new data blocks ( 11 ) for the new blockchain ( 32 ) with a new processing logic ( 15th ) and new rights ( 21st ) to the merge block ( 33 ) append.

Practical example of customer management on the blockchain (focused), new procedure

7th : For a customer, an authorized node ( 18th ) from the network ( 3 ) a backbonechain ( 8th ) forked (27, 2 ). The authorized node ( 18th ) adds a limb block ( 20a ) for the fork ( 16a ) a blockchain ( 13a ) for processing personal data, another limb block ( 20b ) for the fork ( 16b ) a blockchain ( 13b ) for processing account movements and a limb block ( 20c ) for the fork ( 16c ) a blockchain ( 13c ) for a secret purpose. Nodes ( 2 ) from the network ( 3 ) can according to their authorization from the rights file ( 21a-21c ) the blockchains ( 13a-13c ) with data blocks ( 14a-c ) to the conditions from the processing logic ( 15a-15c ) to fill ( 11 ). Processing logic ( 15c ) requires the data for the secret purpose via the interface ( 26th ) to an external system ( 25th ) to hand over. The external system ( 25th ) gives over the interface ( 26th ) a return value that is used during block processing of the data block ( 14c ) is taken into account.

Practical example EU GDPR Art. 17 on the blockchain (focused), new procedure

8th : For a customer, an authorized node ( 18th ) from the network ( 3 ) a backbonechain ( 8th ) forked (27, 2 ). The authorized node ( 18th ) adds a limb block ( 20a ) for the fork ( 16a ) a blockchain ( 13a ) for processing personal data, another limb block ( 20b ) for the fork ( 16b ) a blockchain ( 13b ) for processing account movements and a limb block ( 20c ) for the fork ( 16c ) a blockchain ( 13c ) for a secret purpose. Nodes ( 2 ) from the network ( 3 ) can according to their authorization from the rights file ( 21a-21c ) the blockchains ( 13a-13c ) with data blocks ( 14a-c ) to the conditions from the processing logic ( 15a-15c ) to fill ( 11 ). The rights file ( 21a ) allows authorized nodes ( 18th ) deleting data blocks ( 14a) and adding an end block ( 22nd ) with information about the reason for the deletion in the info file ( 23 ). The personal data of the customer ( 14a ) are permanently deleted. Account details ( 14b ) and the secret purpose ( 14c ) remain permanently ( 10 ).

Practical example of production documentation (focused), new, dynamic process

9 : A milk processing company documents the production of strawberry yogurt on a merge chain ( 32 ). Forks (27, 2 ) a privileged node ( 18th ) from the network ( 3 ) from a backbone chain ( 8th ) a new blockchain as a merge chain ( 32 ) out. The packaging supplier uses the same dynamic documentation model and documents the production of its yogurt pots on its own limbchain ( 13a , 10 ). He has the delivery of the batch to the milk processing plant in a limb block ( 20th ) documented. The milk supplier documents the individual milk deliveries on a continuous blockchain ( 13b , 16 ). The supplier of the strawberries documents the origin of his strawberries on a blockchain ( 13c , 16 ). Both suppliers use external, static documentation models ( 13b + c ). In the merge block ( 33 ) is referenced to the published delivery of the packaging manufacturer (31a). On the milk batch and the strawberry batch, the current production ( 14b + c ) referenced in the external documentation models (31b + c). The filled and packed yoghurt pots are stored in data blocks ( 11 ) continuously documented ( 11 ). The entire production chains of the milk processing company and the suppliers can be viewed at any time.

Storage space requirements and grouping of the data in the new, dynamic process

10 : The Backbonechain ( 8th ) grows by adding new data blocks ( 11 ) from the Genesis block ( 9 ) via the data blocks ( 7th ) to the most recently added data, limb, info or merge block ( 10 ) infinitely further. Transactions ( 29 ) a task are given a limb block ( 20th ) in an independent limbchain ( 13th ) processed. The task can be terminated by an end block ( 22nd ) be finalized. Transactions ( 29 ) of a task are grouped and not fragmented. For complete documentation of a self-contained task, only the backbone chain ( 8th ) from the Genesis block ( 9 ) to the limb block ( 20th ), such as the limbchain ( 13th ) to the end block ( 22nd ) can be saved and retained. Forks ( 2 ) on the Backbonechain ( 8th ), both before and after the limb block ( 20th ) are for the task on the limbchain ( 13th ) are not relevant and therefore do not have to be saved and documented for task-related full nodes (cf. 16 ).

Simplest definition of a blockchain (minimum requirement), dynamic procedure

11 : The Backbonechain ( 8th ) can also be a limbchain ( 13th ) or a merge chain ( 32 ) be. Depending on which, it starts with a Genesis block ( 9 ), a limb block ( 20th ) or a merge block ( 33 ). Any, freely selectable start value ( 35 ) [here: 00000000000000000000000000000000] assigned. From the start value ( 35 ) together with any data ( 36 ) [here: DATA1], together with a container ( 17th , 13th ) with possible scripts for dynamization, here the processing logic ( 5 ), a rights file ( 19th ) and a parameter file ( 34 ) is performed with an algorithm ( 37 ) [here: MD5] an end value ( 38 ) [here: 7906ded4f829316e0e4ea7b6e5dcad56] calculated. In the following data block ( 7th ) is used for the start value ( 35 ) the final value ( 38 ) of the Genesis block ( 9 ) binding. Together with any data ( 36 ) [here: DATA2] is processed with an algorithm ( 37 ) the final value ( 38 ) [here: 2c82a8b4ca93ebf5f60041b9f1087f9d] calculated. In the last data block ( 10 ) is used as a binding start value ( 35 ) the final value ( 38 ) from data block ( 7th ). Together with any data ( 36 ) [here: DATA3] is processed via an algorithm ( 37 ) the final value ( 38 ) [here: c820465dd180deff225939057ffb9915] calculated. This procedure is used for all further additions of new data blocks ( 11 ) continued continuously. The Backbonechain ( 8th ) extends infinitely ( 10 ). The procedure ( 37 ) always remains the same. The subsequent change of a start value ( 35 ), any data ( 36 ), the scripts ( 5/19/34 ) or a final value ( 38 ) makes the continuous structure of the backbonechain ( 8th ) inconsistent. A recalculation automatically leads to different final values. The content of the data blocks can therefore be recognized as not authentic. Scripts ( 5/19/34 ) remain protected from manipulation from the start as they are a fixed, unchangeable part of the blockchain. Required changes are in limb blocks ( 20th ) or merge blocks ( 33 ) transparently documented.

Possible block connections in the new, dynamic process

12 : The beginning ( 39 , 11 ) a backbonechain ( 8th ) begins with a Genesis block ( 9 ). This contains a container ( 17th , 13th ) to record files, for example the procedural logic ( 5 ) to calculate the final values ( 38 ). A new data block ( 11 ) goes directly to the Genesis block ( 9 ) attached ( 11 ).

The further line up ( 40 , 11 ) is done by directly adding new data blocks ( 11 ) to the last added data block ( 10 ) on the Backbonechain ( 8th ).

At the fork ( 41 , 2 ) the backbonechain ( 8th ) a limb block ( 20th ) appended. This contains a container ( 17th , 13th ) to accept files, for example the new processing logic ( 15th ) for the new, forked (16) limbchain ( 13th ). New data blocks ( 11 ) to continue the backbonechain ( 8th ) as well as new data blocks ( 14th ) for the limbchain ( 13th ).

For a change in service ( 42 ) the running backbonechain ( 8th ) becomes a limb block ( 20th ) appended. This contains a container ( 17th ) to accept files, here e.g. the new processing logic ( 15th ) the forked (16, 2 ) on the limbchain ( 13th ) will be used from now on. To the limb block ( 20th ) becomes an end block ( 22nd , 3 ) appended. This contains a container ( 17th , 13th ) for recording files, here e.g. an info file ( 23 ) that informs about the change in service. To the Backbonechain ( 8th ) no wide blocks can be added. New data blocks ( 14th ) become continuous instead of backbonechain ( 8th ), exclusively on the limbchain ( 13th ) to the conditions of the new processing logic ( 15th ) appended ( 11 ).

When referencing ( 43 ) to a dynamic blockchain section in a limbchain ( 13th ) is sent to the blockchain to be referenced ( 13th ) a limb block ( 20th ) appended. This contains a container ( 17th , 13th ) for recording files, here e.g. an info file ( 23 ) which informs about the referencing. From a fork process described above ( 27 , 2 ) becomes a merge chain ( 32 ) forked. This contains a mergeblock ( 33 ) with a container ( 17th ) to accept files, here e.g. the new processing logic ( 15th ) and a parameter file ( 34 ) with references to the limbchain to be referenced ( 13th ) and the position of the limb block ( 20th ) which is referenced (31). The Limbchain ( 13th ) continues unchanged as before. The forked (27) merge chain ( 32 ) will henceforth be referred to as reference ( 34 ) according to the processing logic ( 15th ) operated.

For referencing ( 44 ) to any block of an unknown blockchain ( 13th ) with any architecture becomes a previously described forking process ( 27 , 2 ) a merge chain ( 32 ) forked. This contains a mergeblock ( 33 ) with a container ( 17th , 13th ) to accept files, here e.g. the new processing logic ( 15th ) and a parameter file ( 34 ) with references to the blockchain to be referenced ( 13th ) and the position of the data block ( 14th ) which is referenced. The blockchain ( 13th ) continues unchanged as before. The forked ( 27 ) Mergechain ( 32 ) will henceforth be referred to as reference ( 34 ) according to the processing logic ( 15th ) operated.

When merging ( 45 ) of several (31) dynamic blockchains ( 13a + b ) are sent to the (31) blockchains ( 13a + b ) one limb block each ( 20th ) appended. This contains a container ( 17th , 13th ) for recording files, here e.g. an info file ( 23 ) which informs about the merger. To each of the limb blocks ( 20th ) becomes an end block ( 22nd , 3 ) added to terminate the previous processing procedure. Both end blocks contain a container ( 17th ) for recording files, here e.g. an info file ( 23 ) which informs about the merger. From a fork process described above ( 27 , 2 ) becomes a merge chain ( 32 ) forked. This contains a mergeblock ( 33 ) with a container ( 17th ) to accept files, here e.g. the new processing logic ( 15th ) and a parameter file ( 34 ) with references to the merged (31) blockchains ( 13a + b ) and the position of the limb blocks ( 20th ) to which the merge references. To the blockchains ( 13a + b ) no further blocks can be appended. The forked ( 27 ) Mergechain ( 32 ) is from now on with reference to the references ( 34 ) on the blockchains ( 13a + b ) according to the processing logic ( 15th ) operated.

To add information ( 46 ) an info block ( 24 ) to the last data block ( 10 ) a backbonechain ( 8th ) appended. This contains a container ( 17th , 13th ) for recording files, here e.g. an info file ( 23 ) that informs about anything. Further blocks can be appended as before ( 11 ).

For the final exit ( 47 , 3 ) a backbonechain ( 8th ) becomes an end block ( 22nd ) to the last data block ( 10 ) a backbonechain ( 8th ) appended. This contains a container ( 17th , 13th ) for recording files, here e.g. an info file ( 23 ) which informs about the termination. No further blocks can be appended ( 10 ).

To delete blocks and connections ( 48 , 4th ) these are from the newest data block ( 11 ) via the last data block ( 10 ) erased backwards in sequence. To do this, the deletion option must be explicitly permitted in a blockchain rights file. New blocks can then be appended ( 11 ). The block positions are overwritten.

Possible construction of the container in the new, dynamic process

13th : The container ( 17th ) has a tree structure that can be mapped using methods commonly used today (e.g. arrays, XML, JSON, SQL, CSV, etc.). The structure is that of a file system consisting of folders and files. Thanks to this structure, it can contain further containers. Contents can be any files (5/21/15/19/23/34 /?). Parameters are shown in it, for example, as a key-value pair. Scripts and parameters contained here can be accessed by the nodes ( 2 ) can be included as software for further use. In its digital form, it and all of its content become an integral part of the dynamic blockchain ( 11 ).

Comparative example: method known from the prior art

Static blockchain of the method known from the prior art

14th : From a central software memory ( 1 ) get the nodes ( 2 ) of a network ( 3 ) a basic operating function ( 4th ) and processing logic ( 5 ) binding software ( 6th ) for processing the data blocks ( 7th ) on a blockchain ( 52 ). With the help of the processing logic ( 5 ) the content of a new data block ( 11 ) calculated. The blockchain ( 52 ) is created from a Genesis block ( 9 ). To this genes block ( 9 ) further data blocks ( 7th ) appended. To the last added data block ( 10 ) the newest data block ( 11 ) appended. Written data blocks ( 7th ) cannot be changed and cannot be deleted. The blockchain ( 52 ) extends infinitely as an add-only memory (compare 1 ).

Fork a blockchain of the method known from the prior art

15th : At a fork ( 16 ) (Fork) from the blockchain ( 52 ) a new blockchain is created ( 13th ). The nodes ( 2 ) have to decide for which blockchain they will process in the future. Such a decision-making process can take several months. A new network is created ( 12 ). The reduced, original network ( 3 ) continues to add new data blocks ( 11 ) according to the original processing logic ( 5 ) to the last added data block ( 10 ) the original blockchain ( 52 ) on. The nodes ( 2 ) in the new network ( 12 ) get from a central location ( 1 ) a new software ( 6th ) consisting of basic operating software ( 4th ) and a changed processing logic ( 15th ) from. New data blocks ( 14th ) the new blockchain ( 53 ) are processed according to the new processing logic ( 15th ) processed. The original blockchain ( 52 ) and the new blockchain ( 53 ) only the shared computing power is available exclusively. A dynamic distribution is not possible (compare 2 ).

Storage space requirements and fragmentation of the data in the known, static method

16 : The blockchain ( 52 ) grows by adding new data blocks ( 11 ) from the Genesis block ( 9 ) via the data blocks ( 7th ) to the last added data block ( 10 ) infinitely further ( 17th ). It's an add-only store. Transactions ( 29 ) a task are related to other transactions ( 29 ) other tasks across the entire blockchain ( 52 ) fragmented. For complete documentation of a self-contained task, the entire blockchain ( 8th ) with every single data block ( 7th ) are always saved and kept up-to-date (compare 10 ).

Simplest definition of a blockchain (minimum requirement), static procedure

17th : The blockchain ( 52 ) begins with a Genesis block ( 9 ). Since it is the first block in the blockchain ( 52 ), it receives any starting value ( 35 ) [here: 00000000000000000000000000000000]. From the start value ( 35 ) together with any data ( 36 ) [here: DATA1] is processed with an algorithm ( 37 ) [here: MD5] an end value ( 38 ) [here: 7906ded4f829316e0e4ea7b6e5dcad56] calculated. In the following data block ( 7th ) is used for the start value ( 35 ) the final value ( 38 ) of the Genesis block ( 9 ) binding. Together with any data ( 36 ) [here: DATA2] is processed with an algorithm ( 37 ) the final value ( 38 ) [here: 2c82a8b4ca93ebf5f60041b9f1087f9d] calculated. In the last data block ( 10 ) is used as a binding start value ( 35 ) the final value ( 38 ) from data block ( 7th ). Together with any data ( 36 ) [here: DATA3] is processed via an algorithm ( 37 ) the final value ( 38 ) [here: c820465dd180deff225939057ffb9915] calculated. This procedure is used for all further additions of new data blocks ( 11 ) continued continuously. The blockchain ( 52 ) extends infinitely. The procedure ( 37 ) always remains the same. The subsequent change of a start value ( 35 ), any data ( 36 ) or a final value ( 38 ) makes the ongoing structure of the blockchain ( 52 ) inconsistent. A recalculation automatically leads to different final values. The content of the data blocks can therefore be recognized as not authentic. The processing logic ( 5 ) is not part of the blockchain ( 52 ) (compare 11 ).

Possible block connections, known, static method

18th : The beginning ( 49 ) a blockchain ( 52 ) begins with a Genesis block ( 9 ). A new data block ( 11 ) goes directly to the Genesis block ( 9 ) appended.

The further line up ( 50 ) is done by directly adding new data blocks ( 11 ) to the last added data block ( 10 ) on the blockchain ( 52 ).

At the fork ( 51 ) the blockchain ( 52 ) arise after a lengthy coordination process of the network ( 3 , 15th ) two separate blockchains (52 + 53). There is no dynamic connection. Both blockchains are used indefinitely as add-only storage separately from each other (cf. 12 ).

Referenced fork of a blockchain of the new procedure

19th : With a fork ( 16 ) (Fork) from the backbonechain ( 8th ) a new limbchain is created ( 13th ). One in the library chain ( 54 ) in the limb block ( 20a ) in the container ( 17th ) stored rights file ( 19th ) can certain nodes ( 18th ) grant special rights. One of these rights can be the insertion of a limb block ( 20b ) to the library chain ( 54 ) be. The privileged node ( 18th ) gets the transaction ( 29 ) to add a limb block ( 20b ) from the transaction pool ( 28 ) previously from a data source ( 30th ) was delivered there. The Limb Block ( 20b ) is like the limb block ( 20a ), with a container ( 17th ) for files. Here the limb block contains ( 20b ) from the node ( 18th ) for the new limbchain ( 13th ) the new processing logic ( 15th ) and a new rights file ( 21st ). The nodes ( 2 ) get from the limb block ( 20b ) additionally the new processing logic ( 15th ) and can now both blocks of the original backbonechain ( 8th ) as well as that of the new limbchain ( 13th ) to process. The network ( 3 ) remains intact. All nodes ( 2 ) new data blocks ( 11 ) according to the original processing logic ( 5 ) to the last added data block ( 10 ) the original backbonechain ( 8th ) as well as new data blocks ( 14th ) for the limbchain ( 13th ) with a modified processing logic ( 15th ) and new rights ( 21st ) to the limbchain ( 20th ) append.

Possible blockchain types of the new, dynamic process

designation task Advantage and special features Backbonechain carrier A limbchain arises from a backbone chain. A backbonechain can carry several limbchains. transformation A backbone chain can be a limb chain of another backbone chain. Root history For the task-related history of a backbone chain, only the path from the genesis block to its limb discharge is relevant. Limbchain Functionality The range of functions and properties of a limbchain can be equivalent to the backbone chain or differentiated from it. The range of functions and properties are freely definable. transformation A limbchain can be a new backbone chain. Root history For the task-related history of a limb chain, only the path from the original limb block to its latest data block is relevant. Merge chain Functionality A merge chain is the continuation of the merger of two open blockchain ends. The range of functions and properties of a merge chain can be equivalent to one of the previous backbone chains or differentiated from both. The range of functions and properties are freely definable. transformation A merge chain can be a new backbone chain. It arises from a limbchain. Root history For the task-related history of a merge chain, only the path from the original limb block to its latest data block is relevant. Endchain Finalization The mapping of the last blockchain section contains the endchain from its limb block to the end block all relevant blocks of a final task. It defines the minimum storage space required for permanent archiving. transformation An endchain can be a new backbone chain. It arises from a limbchain. Root history For the task-related history of an endchain, only the path from its original limb block to its end block is relevant.

Possible block types of the new, dynamic procedure

designation task Advantage and special features Genesis block Root The Genesis block is the first block in a blockchain. There is nothing in front of him. It is already known from the known, static method and is used there as the first data block. In the new, dynamic process, it is equipped with a container (17) for files. Data block to save The data block contains transactions. It is already known from the known, static method. It cannot be deleted there. It remains permanently unchangeable. In the new, dynamic process, data blocks can also be deleted on a specially designed blockchain. Otherwise it remains unchangeable here as well. Limb block Forks The limb block offers the possibility of a fork in a backbonechain. It contains a container (17) for files with rights and processing logic that affect the new limbchain. The backbone chain remains subject to the rights and processing mechanisms assigned to it. The limb block is attached to a blockchain or a separate library chain by a privileged node. Limb blocks are not used in the known, static method. Merge block Connect The merge block offers the possibility of merging the open ends of two blockchains into a merge chain. It contains a container (17) for files with rights and processing logic that affect the new merge chain. New data blocks for the two merged blockchains will be added to the merge chain in the future. The merge block is attached to two blockchains by a privileged node, which must have the rights for both blockchains. In the known, static method, merge blocks are not used. Info block To inform The info block is a data block with a container (17) for files with an informative character. It is attached to a blockchain by a privileged node. In the known, static method, info blocks are not used. End block Finalize The end block prevents further blocks from being added to a blockchain. It is equipped with a container (17) for files with an informative character. It is attached to a blockchain by a privileged node. In the known, static method, end blocks are not used.

Possible contents of a container (17) of the new, dynamic method

Type of content task Advantage and special features Scripts Multiple programming languages The nodes (2) in a network (3) are not tied to a script or programming language. Permanent compatibility All script or programming languages known today or appearing in the future can be provided in the container (17) for the nodes (2). Open options Software restrictions can be circumvented by choosing a suitable language as required. interface External systems (25) can be integrated via an interface (26) of any architecture that can be integrated in the script. complexity Nodes (2) can do much more complex tasks than the stupid computing of hashes. Encryption Individual encryption techniques can be used within the scripts and / or in connection with an external system (25). parameter Data sources Data can come as transactions from a wide variety of sources, e.g. external systems, machines or sensors are delivered for further processing. credentials A reference can be set to any data blocks on any blockchain across the system and architecture. The reference thus becomes part of the blockchain referencing it. Initial values New initial values can be set at any time for block processing. Quick adjustments to block sizes or difficulty are thus ensured. Locations Nodes (2) can be dynamically assigned to storage locations e.g. Access URL's, hardware, etc. If necessary, these can be reset or expanded during operation using privileged nodes (18). right Private or public In a rights file (21), a specially authorized node (18) can define whether a task should be private or public. Known or unknown Unknown nodes (2) or known nodes (18) can be authorized for certain tasks. Authentication IP-based and / or private-key-based authentication is possible. Authentication via external systems (25) is also possible. info transparency Public information can be stored in an info block (23) or in an end block (22) via info files (21).

List of reference symbols

1

Central software storage (location where software is stored for download)

2

Node (executing computer)

3

Network (grouping of nodes)

4th

Basic software (software for operating a node)

5

Processing logic (software that defines the process and type of processing)

6th

Software package (may contain software for various purposes)

7th

Data block within a chain (contains e.g. transaction data)

8th

Backbonechain (chaining of data blocks, carrier of limbchains)

9

Genesis block (first block of a blockchain)

10

Last data block (block to which a subsequent block can be added)

11

New data block (block to be appended)

12

New network (split from the original network)

13

Limbchain (fork, fork of a backbonechain)

14th

Data block in a new blockchain (contains e.g. transaction data)

15th

New processing logic (method and type defines a privileged node)

16

Forking process (forking, fork of the blockchain)

17th

Container (contains folders or files e.g. scripts, binary, text, rights, parameters)

18th

Node with special rights (privileged, can have its own properties and rights)

19th

Rights file of the Genesis block (privileges certain nodes)

20th

Limb block (controls the fork, is inserted by a privileged node)

21st

Rights file of a limb block (is defined by a privileged node)

22nd

End block (ends a blockchain, is inserted by a privileged node)

23

Readme file (contains information from a privileged node)

24

Info block (only informational, is inserted by a privileged node)

25th

External system (black box outside the network)

26th

Interface (connection between node and external system)

27

Abstract, focused process (placeholder for a previously described process)

28

Transaction pool (contains transactions that must be processed)

29

Transaction (contains data or instructions, is supplied by a data source)

30th

Data source (an external system, a machine, sensors or other data generator)

31

Merge process (merge, consolidation of blockchains)

32

Mergechain (arises from the merging of blockchains)

33

Merge block (defines the merging, merge, generation by privileged node)

34

Parameter file (contains parameters for initiation, referencing, processing, etc.)

35

Start value (output value, reference for calculating the end value)

36

Data (any data e.g. scripts, binary, text, rights, parameters)

37

Calculation (any hash algorithms such as MD5, SHA128, SHA256, etc.)

38

End value (calculated hash value from start value and data)

39

Beginning of a blockchain (dynamic block connection)

40

Alignment of data blocks (dynamic + static block connection)

41

Fork in two blockchains (dynamic block connection)

42

Change in performance during operation (dynamic block connection)

43

Referencing to dynamic blockchain section (dynamic block connection)

44

Referencing to static blockchain section (dynamic block connection)

45

Merging of dynamic blockchains (dynamic block connection)

46

Appending information (dynamic block connection)

47

Ending a blockchain (dynamic block connection)

48

Deleting blocks and connections (dynamic block connection)

49

Start of a blockchain (static block connection)

50

Alignment of data blocks (dynamic + static block connection)

51

Fork in two blockchains (static block connection)

52

Blockchain (chaining of data blocks, carrier of limbchains)

53

New blockchain (fork of a blockchain)

54

Library chain (directory of all limbchains and their processing logic)

Claims (10)

A method for controlling a hardware system using a blockchain, characterized in that a dynamization of the blockchain is provided by shifting the logic and parameters into the blocks on the blockchain itself and / or on a separate library chain by declustering the node software, a classification of the Blocks in types and an expansion of the blocks by a container structure, which contains the logic and the parameters for the block processing method. Method for controlling a hardware system using a blockchain Claim 1 , characterized in that the following procedural steps are carried out: 1. De-clustering of the node software by removing the logic and parameter definitions, 2. Extension of the block parameters by optional containers, 3. Insertion of the logic and parameter definition in optional containers of the blocks, 4. A Data source places a task as a transaction in the transaction pool, 5. It selects transaction: fork, merge, terminate, delete, inform or save, 6. A node fetches a transaction from the transaction pool, 7. Create and append an intelligent block a privileged node, 8. storage of rights, logic and parameter definitions by privileged nodes. Method for controlling a hardware system using a blockchain Claim 1 , characterized in that the following process steps are carried out: 1. De-clustering of the node software by removing the logic and parameter definitions, 2. Extension of the block parameters to include optional containers, 3. Insertion of the logic and parameter definition in the optional containers of the blocks, 4. Nodes Access new logic and parameter definitions directly on the blockchain itself or on a separate blockchain (library chain), 5. Including new logic and parameter definitions in the ongoing processing process, 6. Immediate application of the new logic and parameter definitions. Method for controlling a hardware system using a blockchain Claim 1 , characterized in that the following process steps are carried out: 1. De-clustering of the node software by removing the logic and parameter definitions, 2. Extension of the block parameters by optional containers, 3. Insertion of the logic and parameter definition in optional containers of the blocks, 4. Nodes access new logic and parameter definitions directly on the blockchain itself or on a separate blockchain (library chain), 5. Including new logic and parameter definitions in the ongoing processing process , 6. Immediate application of the new logic and parameter definitions, 7. Parallel processing of blockchains using appropriate logic and parameter definitions. Method for controlling a hardware system using a blockchain Claim 1 , characterized in that the following process steps are carried out: 1. De-clustering of the node software by removing the logic and parameter definitions, 2. Extension of the block parameters to include optional containers, 3. Insertion of the logic and parameter definition in the optional containers of the blocks, 4. Nodes access new logic and parameter definitions directly on the blockchain itself or on a separate blockchain (library chain), 5.Including new logic and parameter definitions in the ongoing processing process, 6. Immediate application of the new logic and parameter definitions, 7. Parallel processing of Blockchains through appropriate logic and parameter definitions, 8. Priorities related to utilization, property or reward in block processing. Method for controlling a hardware system using a blockchain Claim 1 , characterized in that the following process steps are carried out: 1. De-clustering of the node software by removing the logic and parameter definitions, 2. Extension of the block parameters to include optional containers, 3. Insertion of the logic and parameter definition in the optional containers of the blocks, 4. Nodes access new logic and parameter definitions directly on the blockchain itself or on a separate blockchain (library chain), 5.Including new logic and parameter definitions in the ongoing processing process, 6. Immediate application of the new logic and parameter definitions, 7. Parallel processing of Blockchains through appropriate logic and parameter definitions, 8. Priorities that depend on ownership or authorization in block processing. Method for controlling a hardware system using a blockchain Claim 1 , characterized in that the following process steps are carried out: 1. De-clustering of the node software by removing the logic and parameter definitions, 2. Extension of the block parameters to include optional containers, 3. Insertion of the logic and parameter definition in the optional containers of the blocks, 4. Nodes access new logic and parameter definitions directly on the blockchain itself or on a separate blockchain (library chain), 5.Including new logic and parameter definitions in the ongoing processing process, 6. Immediate application of the new logic and parameter definitions, 7. Parallel processing of Blockchains through appropriate logic and parameter definitions, 8.Property or authorization-dependent priorities in block processing, 9. A data source places a transaction in the transaction pool for termination, 10. A privileged node fetches a transaction for termination from the transaction pool, 11 . Set an end Blocks at the end of a blockchain, 12. Storing information. Method for controlling a hardware system using a blockchain Claim 1 , characterized in that the following process steps are carried out: 1. De-clustering of the node software by removing the logic and parameter definitions, 2. Extension of the block parameters to include optional containers, 3. Insertion of the logic and parameter definition in the optional containers of the blocks, 4. Nodes access new logic and parameter definitions directly on the blockchain itself or on a separate blockchain (library chain), 5.Including new logic and parameter definitions in the ongoing processing process, 6. Immediate application of the new logic and parameter definitions, 7. Parallel processing of Blockchains through appropriate logic and parameter definitions, 8.Property or authorization-dependent priorities in block processing, 9. A data source places a transaction for deletion in the transaction pool, 10. A privileged node picks up a transaction for deletion from the transaction pool, 11 Delete the in de The blocks contained in the delete transaction, 12. Storage of information. Method for controlling a hardware system using a blockchain Claim 1 , characterized in that the following procedural steps are carried out: 1. De-clustering of the node software by removing the logic and parameter definitions, 2. Extension of the block parameters by optional containers, 3. Insertion of the logic and parameter definition in optional containers of the blocks, 4. A Data source places a transaction for forking in the transaction pool, 5. a privileged node fetches a transaction for forking from the transaction pool, 6. generation and appending of a limb block by a privileged node, 7. Storage of rights, logic and parameter definitions, 8. Nodes access new logic and parameter definitions directly on the blockchain itself or on a separate blockchain (library chain), 9.Including new logic and parameter definitions in the ongoing processing process, 10. Immediate application of the new logic and parameter definitions, 11. Storage of the history for the new blockchain. Method for controlling a hardware system using a blockchain Claim 1 , characterized in that the following procedural steps are carried out: 1. De-clustering of the node software by removing the logic and parameter definitions. 2. Extension of the block parameters by optional containers. 3. Insertion of the logic and parameter definition in the optional containers of the blocks. 4. A data source posts a transaction for forking into the transaction pool. 5. A privileged node fetches a transaction from the transaction pool for fork. 6. Creation and appending of a limb block by a privileged node. 7. Storage of rights, logic and parameter definitions. 8. Nodes access new logic and parameter definitions directly on the blockchain itself or on a separate blockchain (library chain), 9. Including new logic and parameter definitions in the ongoing processing process. 10. Immediate application of the new logic and parameter definitions.

Images