Patent Application
20200372006
The present application hereby claims priority under 35 U.S.C. § 119 to European patent application number EP 19175903.4 filed May 22, 2019, the entire contents of which are hereby incorporated herein by reference.
At least one embodiment of the invention generally relates to techniques of validating measurement datasets. Various examples of embodiments of the invention specifically relate to validating measurement datasets using one or more validation measures implemented at a distributed database, such as a Blockchain.
Distributed databases—such as the Blockchain—offer increased security against manipulation of data. Thus, various functionality—e.g., sense and control functionality in industrial environments, control of electrical grids, transport systems, etc.—relies on data stored in a distributed database.
Various functionality relying on data stored in the distributed database can be event driven. I.e., one or more functionalities can be triggered by and/or depend on events external to the distributed database, i.e., based on external data. To this end, measurement nodes, sometimes also referred to as oracles, are known. Oracles can provide measurement datasets indicative of one or more observables of an event. Then, the measurement datasets can be stored in the distributed database. Logic functionality can depend on these measurement datasets.
The inventors have discovered that validity/integrity of measurement datasets can sometimes be compromised. The inventors have discovered that this can be due, e.g., a malfunctioning oracle or fraud. Such limited validity of the measurement datasets can also compromise the integrity of the data stored in the distributed database or any functionality depending on the measurement dataset.
Accordingly, the inventors have discovered that there is a need for techniques of validating measurement datasets. In particular, the inventors have discovered that there is a need for techniques which overcome or mitigate at least some of the above-identified restrictions and drawbacks.
The features of the claims define embodiments.
A mining node, of at least one embodiment, of an infrastructure of a distributed database includes a control circuitry. The control circuitry is configured to obtain a measurement dataset that is indicative of one or more observables of an event. The measurement dataset includes processed raw data samples. The control circuitry is also configured to perform a comparison between the measurement dataset and a reference dataset. The reference dataset includes one or more predefined constraints. The one or more predefined constraints are associated with the event.
Alternatively or additionally to the reference dataset including the one or more predefined constraints, it would also be possible that the reference dataset includes a further measurement dataset. The further measurement dataset is indicative of one or more further observables of the event. The control circuitry is further configured to selectively trigger one or more validation measures for the measurement dataset, depending on a result of the comparison. The one or more validation measures are implemented at the distributed database.
A computer-implemented method at a mining node of an infrastructure of a distributed database, of at least one embodiment, includes: obtaining a measurement dataset indicative of one or more observables of an event. The measurement dataset includes processed raw data samples. The method also includes performing a comparison between the measurement dataset and a reference dataset.
The reference dataset includes at least one of one or more predefined constraints that are associated with the event; or a further measurement dataset which is indicative of one or more further observables of the event. The method also includes, in at least one embodiment, selectively triggering one or more validation measures for the measurement dataset depending on the result of the comparison. The one or more validation measures are implemented at the distributed database.
A computer-program product or a computer program or a computer-readable storage medium, in at least one embodiment, includes program code. The program code can be loaded and executed by a processor. When executing the program code, the processor performs a method of at least one embodiment. The method includes: obtaining a measurement dataset indicative of one or more observables of an event, the measurement dataset including processed raw data samples; and performing a comparison between the measurement dataset and a reference dataset, the reference dataset including at least one of one or more predefined constraints associated with the event, or a further measurement dataset that is indicative of one or more further observables of the event; and selectively triggering one or more validation measures for the measurement dataset depending on a result of the comparison, the one or more validation measures being implemented at the distributed database.
At least one embodiment is directed to a mining node of an infrastructure of a distributed database, the mining node comprising:
a control circuitry configured to:
At least one embodiment is directed to a computer-implemented method executable by a mining node of an infrastructure of a distributed database, the method comprising:
obtaining a measurement dataset indicative of one or more observables of an event, the measurement dataset including processed raw data samples;
performing a comparison between the measurement dataset and a reference dataset, the reference dataset including at least one of
selectively triggering, dependent upon a result of the comparison, one or more validation measures for the measurement dataset, the one or more validation measures being implemented at the distributed database.
At least one embodiment is directed to a computer-implemented method executable by a mining node of an infrastructure of a distributed database, the method comprising:
obtaining a measurement dataset indicative of one or more observables of an event, the measurement dataset including processed raw data samples;
performing a comparison between the measurement dataset and a reference dataset, the reference dataset including at least one of
selectively triggering, dependent upon a result of the comparison, one or more validation measures for the measurement dataset, the one or more validation measures being implemented at the distributed database, wherein the method is executed by a mining node of an embodiment.
At least one embodiment is directed to a non-transitory computer readable storage medium storing program code, loadable and executable by a processor, which when executed by the processor, configures the processor to execute the method of an embodiment.
Some examples of the present disclosure generally provide for a plurality of circuits or other electrical devices. All references to the circuits and other electrical devices and the functionality provided by each are not intended to be limited to encompassing only what is illustrated and described herein. While particular labels may be assigned to the various circuits or other electrical devices disclosed, such labels are not intended to limit the scope of operation for the circuits and the other electrical devices. Such circuits and other electrical devices may be combined with each other and/or separated in any manner based on the particular type of electrical implementation that is desired. It is recognized that any circuit or other electrical device disclosed herein may include any number of microcontrollers, a graphics processor unit (GPU), integrated circuits, memory devices (e.g., FLASH, random access memory (RAM), read only memory (ROM), electrically programmable read only memory (EPROM), electrically erasable programmable read only memory (EEPROM), or other suitable variants thereof), and software which co-act with one another to perform operation(s) disclosed herein. In addition, any one or more of the electrical devices may be configured to execute a program code that is embodied in a non-transitory computer readable medium programmed to perform any number of the functions as disclosed.
In the following, embodiments of the invention will be described in detail with reference to the accompanying drawings. It is to be understood that the following description of embodiments is not to be taken in a limiting sense. The scope of the invention is not intended to be limited by the embodiments described hereinafter or by the drawings, which are taken to be illustrative only.
Various example embodiments will now be described more fully with reference to the accompanying drawings in which only some example embodiments are shown. Specific structural and functional details disclosed herein are merely representative for purposes of describing example embodiments. Example embodiments, however, may be embodied in various different forms, and should not be construed as being limited to only the illustrated embodiments. Rather, the illustrated embodiments are provided as examples so that this disclosure will be thorough and complete, and will fully convey the concepts of this disclosure to those skilled in the art. Accordingly, known processes, elements, and techniques, may not be described with respect to some example embodiments. Unless otherwise noted, like reference characters denote like elements throughout the attached drawings and written description, and thus descriptions will not be repeated. The present invention, however, may be embodied in many alternate forms and should not be construed as limited to only the example embodiments set forth herein.
It will be understood that, although the terms first, second, etc. may be used herein to describe various elements, components, regions, layers, and/or sections, these elements, components, regions, layers, and/or sections, should not be limited by these terms. These terms are only used to distinguish one element from another. For example, a first element could be termed a second element, and, similarly, a second element could be termed a first element, without departing from the scope of example embodiments of the present invention. As used herein, the term “and/or,” includes any and all combinations of one or more of the associated listed items. The phrase “at least one of” has the same meaning as “and/or”.
Spatially relative terms, such as “beneath,” “below,” “lower,” “under,” “above,” “upper,” and the like, may be used herein for ease of description to describe one element or feature's relationship to another element(s) or feature(s) as illustrated in the figures. It will be understood that the spatially relative terms are intended to encompass different orientations of the device in use or operation in addition to the orientation depicted in the figures. For example, if the device in the figures is turned over, elements described as “below,” “beneath,” or “under,” other elements or features would then be oriented “above” the other elements or features. Thus, the example terms “below” and “under” may encompass both an orientation of above and below. The device may be otherwise oriented (rotated 90 degrees or at other orientations) and the spatially relative descriptors used herein interpreted accordingly. In addition, when an element is referred to as being “between” two elements, the element may be the only element between the two elements, or one or more other intervening elements may be present.
Spatial and functional relationships between elements (for example, between modules) are described using various terms, including “connected,” “engaged,” “interfaced,” and “coupled.” Unless explicitly described as being “direct,” when a relationship between first and second elements is described in the above disclosure, that relationship encompasses a direct relationship where no other intervening elements are present between the first and second elements, and also an indirect relationship where one or more intervening elements are present (either spatially or functionally) between the first and second elements. In contrast, when an element is referred to as being “directly” connected, engaged, interfaced, or coupled to another element, there are no intervening elements present. Other words used to describe the relationship between elements should be interpreted in a like fashion (e.g., “between,” versus “directly between,” “adjacent,” versus “directly adjacent,” etc.).
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of example embodiments of the invention. As used herein, the singular forms “a,” “an,” and “the,” are intended to include the plural forms as well, unless the context clearly indicates otherwise. As used herein, the terms “and/or” and “at least one of” include any and all combinations of one or more of the associated listed items. It will be further understood that the terms “comprises,” “comprising,” “includes,” and/or “including,” when used herein, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof. As used herein, the term “and/or” includes any and all combinations of one or more of the associated listed items. Expressions such as “at least one of,” when preceding a list of elements, modify the entire list of elements and do not modify the individual elements of the list. Also, the term “exemplary” is intended to refer to an example or illustration.
When an element is referred to as being “on,” “connected to,” “coupled to,” or “adjacent to,” another element, the element may be directly on, connected to, coupled to, or adjacent to, the other element, or one or more other intervening elements may be present. In contrast, when an element is referred to as being “directly on,” “directly connected to,” “directly coupled to,” or “immediately adjacent to,” another element there are no intervening elements present.
It should also be noted that in some alternative implementations, the functions/acts noted may occur out of the order noted in the figures. For example, two figures shown in succession may in fact be executed substantially concurrently or may sometimes be executed in the reverse order, depending upon the functionality/acts involved.
Unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art to which example embodiments belong. It will be further understood that terms, e.g., those defined in commonly used dictionaries, should be interpreted as having a meaning that is consistent with their meaning in the context of the relevant art and will not be interpreted in an idealized or overly formal sense unless expressly so defined herein.
Before discussing example embodiments in more detail, it is noted that some example embodiments may be described with reference to acts and symbolic representations of operations (e.g., in the form of flow charts, flow diagrams, data flow diagrams, structure diagrams, block diagrams, etc.) that may be implemented in conjunction with units and/or devices discussed in more detail below. Although discussed in a particularly manner, a function or operation specified in a specific block may be performed differently from the flow specified in a flowchart, flow diagram, etc. For example, functions or operations illustrated as being performed serially in two consecutive blocks may actually be performed simultaneously, or in some cases be performed in reverse order. Although the flowcharts describe the operations as sequential processes, many of the operations may be performed in parallel, concurrently or simultaneously. In addition, the order of operations may be re-arranged. The processes may be terminated when their operations are completed, but may also have additional steps not included in the figure. The processes may correspond to methods, functions, procedures, subroutines, subprograms, etc.
Specific structural and functional details disclosed herein are merely representative for purposes of describing example embodiments of the present invention. This invention may, however, be embodied in many alternate forms and should not be construed as limited to only the embodiments set forth herein.
Units and/or devices according to one or more example embodiments may be implemented using hardware, software, and/or a combination thereof. For example, hardware devices may be implemented using processing circuitry such as, but not limited to, a processor, Central Processing Unit (CPU), a controller, an arithmetic logic unit (ALU), a digital signal processor, a microcomputer, a field programmable gate array (FPGA), a System-on-Chip (SoC), a programmable logic unit, a microprocessor, or any other device capable of responding to and executing instructions in a defined manner. Portions of the example embodiments and corresponding detailed description may be presented in terms of software, or algorithms and symbolic representations of operation on data bits within a computer memory. These descriptions and representations are the ones by which those of ordinary skill in the art effectively convey the substance of their work to others of ordinary skill in the art. An algorithm, as the term is used here, and as it is used generally, is conceived to be a self-consistent sequence of steps leading to a desired result. The steps are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of optical, electrical, or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated. It has proven convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers, or the like.
It should be borne in mind, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise, or as is apparent from the discussion, terms such as “processing” or “computing” or “calculating” or “determining” of “displaying” or the like, refer to the action and processes of a computer system, or similar electronic computing device/hardware, that manipulates and transforms data represented as physical, electronic quantities within the computer system's registers and memories into other data similarly represented as physical quantities within the computer system memories or registers or other such information storage, transmission or display devices.
In this application, including the definitions below, the term ‘module’ or the term ‘controller’ may be replaced with the term ‘circuit.’ The term ‘module’ may refer to, be part of, or include processor hardware (shared, dedicated, or group) that executes code and memory hardware (shared, dedicated, or group) that stores code executed by the processor hardware.
The module may include one or more interface circuits. In some examples, the interface circuits may include wired or wireless interfaces that are connected to a local area network (LAN), the Internet, a wide area network (WAN), or combinations thereof. The functionality of any given module of the present disclosure may be distributed among multiple modules that are connected via interface circuits. For example, multiple modules may allow load balancing. In a further example, a server (also known as remote, or cloud) module may accomplish some functionality on behalf of a client module.
Software may include a computer program, program code, instructions, or some combination thereof, for independently or collectively instructing or configuring a hardware device to operate as desired. The computer program and/or program code may include program or computer-readable instructions, software components, software modules, data files, data structures, and/or the like, capable of being implemented by one or more hardware devices, such as one or more of the hardware devices mentioned above. Examples of program code include both machine code produced by a compiler and higher level program code that is executed using an interpreter.
For example, when a hardware device is a computer processing device (e.g., a processor, Central Processing Unit (CPU), a controller, an arithmetic logic unit (ALU), a digital signal processor, a microcomputer, a microprocessor, etc.), the computer processing device may be configured to carry out program code by performing arithmetical, logical, and input/output operations, according to the program code. Once the program code is loaded into a computer processing device, the computer processing device may be programmed to perform the program code, thereby transforming the computer processing device into a special purpose computer processing device. In a more specific example, when the program code is loaded into a processor, the processor becomes programmed to perform the program code and operations corresponding thereto, thereby transforming the processor into a special purpose processor.
Software and/or data may be embodied permanently or temporarily in any type of machine, component, physical or virtual equipment, or computer storage medium or device, capable of providing instructions or data to, or being interpreted by, a hardware device. The software also may be distributed over network coupled computer systems so that the software is stored and executed in a distributed fashion. In particular, for example, software and data may be stored by one or more computer readable recording mediums, including the tangible or non-transitory computer-readable storage media discussed herein.
Even further, any of the disclosed methods may be embodied in the form of a program or software. The program or software may be stored on a non-transitory computer readable medium and is adapted to perform any one of the aforementioned methods when run on a computer device (a device including a processor). Thus, the non-transitory, tangible computer readable medium, is adapted to store information and is adapted to interact with a data processing facility or computer device to execute the program of any of the above mentioned embodiments and/or to perform the method of any of the above mentioned embodiments.
Example embodiments may be described with reference to acts and symbolic representations of operations (e.g., in the form of flow charts, flow diagrams, data flow diagrams, structure diagrams, block diagrams, etc.) that may be implemented in conjunction with units and/or devices discussed in more detail below. Although discussed in a particularly manner, a function or operation specified in a specific block may be performed differently from the flow specified in a flowchart, flow diagram, etc. For example, functions or operations illustrated as being performed serially in two consecutive blocks may actually be performed simultaneously, or in some cases be performed in reverse order.
According to one or more example embodiments, computer processing devices may be described as including various functional units that perform various operations and/or functions to increase the clarity of the description. However, computer processing devices are not intended to be limited to these functional units. For example, in one or more example embodiments, the various operations and/or functions of the functional units may be performed by other ones of the functional units. Further, the computer processing devices may perform the operations and/or functions of the various functional units without subdividing the operations and/or functions of the computer processing units into these various functional units.
Units and/or devices according to one or more example embodiments may also include one or more storage devices. The one or more storage devices may be tangible or non-transitory computer-readable storage media, such as random access memory (RAM), read only memory (ROM), a permanent mass storage device (such as a disk drive), solid state (e.g., NAND flash) device, and/or any other like data storage mechanism capable of storing and recording data. The one or more storage devices may be configured to store computer programs, program code, instructions, or some combination thereof, for one or more operating systems and/or for implementing the example embodiments described herein. The computer programs, program code, instructions, or some combination thereof, may also be loaded from a separate computer readable storage medium into the one or more storage devices and/or one or more computer processing devices using a drive mechanism. Such separate computer readable storage medium may include a Universal Serial Bus (USB) flash drive, a memory stick, a Bluray/DVD/CD-ROM drive, a memory card, and/or other like computer readable storage media. The computer programs, program code, instructions, or some combination thereof, may be loaded into the one or more storage devices and/or the one or more computer processing devices from a remote data storage device via a network interface, rather than via a local computer readable storage medium. Additionally, the computer programs, program code, instructions, or some combination thereof, may be loaded into the one or more storage devices and/or the one or more processors from a remote computing system that is configured to transfer and/or distribute the computer programs, program code, instructions, or some combination thereof, over a network. The remote computing system may transfer and/or distribute the computer programs, program code, instructions, or some combination thereof, via a wired interface, an air interface, and/or any other like medium.
The one or more hardware devices, the one or more storage devices, and/or the computer programs, program code, instructions, or some combination thereof, may be specially designed and constructed for the purposes of the example embodiments, or they may be known devices that are altered and/or modified for the purposes of example embodiments.
A hardware device, such as a computer processing device, may run an operating system (OS) and one or more software applications that run on the OS. The computer processing device also may access, store, manipulate, process, and create data in response to execution of the software. For simplicity, one or more example embodiments may be exemplified as a computer processing device or processor; however, one skilled in the art will appreciate that a hardware device may include multiple processing elements or processors and multiple types of processing elements or processors. For example, a hardware device may include multiple processors or a processor and a controller. In addition, other processing configurations are possible, such as parallel processors.
The computer programs include processor-executable instructions that are stored on at least one non-transitory computer-readable medium (memory). The computer programs may also include or rely on stored data. The computer programs may encompass a basic input/output system (BIOS) that interacts with hardware of the special purpose computer, device drivers that interact with particular devices of the special purpose computer, one or more operating systems, user applications, background services, background applications, etc. As such, the one or more processors may be configured to execute the processor executable instructions.
The computer programs may include: (i) descriptive text to be parsed, such as HTML (hypertext markup language) or XML (extensible markup language), (ii) assembly code, (iii) object code generated from source code by a compiler, (iv) source code for execution by an interpreter, (v) source code for compilation and execution by a just-in-time compiler, etc. As examples only, source code may be written using syntax from languages including C, C++, C#, Objective-C, Haskell, Go, SQL, R, Lisp, Java®, Fortran, Perl, Pascal, Curl, OCaml, Javascript®, HTML5, Ada, ASP (active server pages), PHP, Scala, Eiffel, Smalltalk, Erlang, Ruby, Flash®, Visual Basic®, Lua, and Python®.
Further, at least one embodiment of the invention relates to the non-transitory computer-readable storage medium including electronically readable control information (processor executable instructions) stored thereon, configured in such that when the storage medium is used in a controller of a device, at least one embodiment of the method may be carried out.
The computer readable medium or storage medium may be a built-in medium installed inside a computer device main body or a removable medium arranged so that it can be separated from the computer device main body. The term computer-readable medium, as used herein, does not encompass transitory electrical or electromagnetic signals propagating through a medium (such as on a carrier wave); the term computer-readable medium is therefore considered tangible and non-transitory. Non-limiting examples of the non-transitory computer-readable medium include, but are not limited to, rewriteable non-volatile memory devices (including, for example flash memory devices, erasable programmable read-only memory devices, or a mask read-only memory devices); volatile memory devices (including, for example static random access memory devices or a dynamic random access memory devices); magnetic storage media (including, for example an analog or digital magnetic tape or a hard disk drive); and optical storage media (including, for example a CD, a DVD, or a Blu-ray Disc). Examples of the media with a built-in rewriteable non-volatile memory, include but are not limited to memory cards; and media with a built-in ROM, including but not limited to ROM cassettes; etc. Furthermore, various information regarding stored images, for example, property information, may be stored in any other form, or it may be provided in other ways.
The term code, as used above, may include software, firmware, and/or microcode, and may refer to programs, routines, functions, classes, data structures, and/or objects. Shared processor hardware encompasses a single microprocessor that executes some or all code from multiple modules. Group processor hardware encompasses a microprocessor that, in combination with additional microprocessors, executes some or all code from one or more modules. References to multiple microprocessors encompass multiple microprocessors on discrete dies, multiple microprocessors on a single die, multiple cores of a single microprocessor, multiple threads of a single microprocessor, or a combination of the above.
Shared memory hardware encompasses a single memory device that stores some or all code from multiple modules. Group memory hardware encompasses a memory device that, in combination with other memory devices, stores some or all code from one or more modules.
The term memory hardware is a subset of the term computer-readable medium. The term computer-readable medium, as used herein, does not encompass transitory electrical or electromagnetic signals propagating through a medium (such as on a carrier wave); the term computer-readable medium is therefore considered tangible and non-transitory. Non-limiting examples of the non-transitory computer-readable medium include, but are not limited to, rewriteable non-volatile memory devices (including, for example flash memory devices, erasable programmable read-only memory devices, or a mask read-only memory devices); volatile memory devices (including, for example static random access memory devices or a dynamic random access memory devices); magnetic storage media (including, for example an analog or digital magnetic tape or a hard disk drive); and optical storage media (including, for example a CD, a DVD, or a Blu-ray Disc). Examples of the media with a built-in rewriteable non-volatile memory, include but are not limited to memory cards; and media with a built-in ROM, including but not limited to ROM cassettes; etc. Furthermore, various information regarding stored images, for example, property information, may be stored in any other form, or it may be provided in other ways.
The apparatuses and methods described in this application may be partially or fully implemented by a special purpose computer created by configuring a general purpose computer to execute one or more particular functions embodied in computer programs. The functional blocks and flowchart elements described above serve as software specifications, which can be translated into the computer programs by the routine work of a skilled technician or programmer.
A mining node, of at least one embodiment, of an infrastructure of a distributed database includes a control circuitry. The control circuitry is configured to obtain a measurement dataset that is indicative of one or more observables of an event. The measurement dataset includes processed raw data samples. The control circuitry is also configured to perform a comparison between the measurement dataset and a reference dataset. The reference dataset includes one or more predefined constraints. The one or more predefined constraints are associated with the event.
Alternatively or additionally to the reference dataset including the one or more predefined constraints, it would also be possible that the reference dataset includes a further measurement dataset. The further measurement dataset is indicative of one or more further observables of the event. The control circuitry is further configured to selectively trigger one or more validation measures for the measurement dataset, depending on a result of the comparison. The one or more validation measures are implemented at the distributed database.
A computer-implemented method at a mining node of an infrastructure of a distributed database, of at least one embodiment, includes: obtaining a measurement dataset indicative of one or more observables of an event. The measurement dataset includes processed raw data samples. The method also includes performing a comparison between the measurement dataset and a reference dataset.
The reference dataset includes at least one of one or more predefined constraints that are associated with the event; or a further measurement dataset which is indicative of one or more further observables of the event. The method also includes, in at least one embodiment, selectively triggering one or more validation measures for the measurement dataset depending on the result of the comparison. The one or more validation measures are implemented at the distributed database.
A computer-program product or a computer program or a computer-readable storage medium, in at least one embodiment, includes program code. The program code can be loaded and executed by a processor. When executing the program code, the processor performs a method of at least one embodiment. The method includes: obtaining a measurement dataset indicative of one or more observables of an event, the measurement dataset including processed raw data samples; and performing a comparison between the measurement dataset and a reference dataset, the reference dataset including at least one of one or more predefined constraints associated with the event, or a further measurement dataset that is indicative of one or more further observables of the event; and selectively triggering one or more validation measures for the measurement dataset depending on a result of the comparison, the one or more validation measures being implemented at the distributed database.
Unless explicitly stated otherwise the terms “perform”, “calculate”, “computer-implemented”, “calculate”, “establish”, “generate”, “configure”, “reconstruct” and the like preferably relate to actions and/or processes and/or processing steps which modify data and/or which generate data and/or which transform data in other data. Data can be represented by physical quantities or be present as physical quantities, e.g., as electrical pulses. In particular, the term “computer” should be interpreted broadly to cover all electronic devices having data processing capabilities. Computers can, thus, be implemented by personal computers, servers, memory programmable controllers, handheld computer systems, pocket PC devices, wireless communication devices and other communication devices that can process data, processors and other electronic devices for processing data.
In the context of the present disclosure “computer-implemented” can relate to an implementation of a method in which a processor performs at least one method step.
A processor in the context of the present disclosure can be a machine or electronic circuit. A processor can be specifically implemented by a central processing unit (CPU) or a microprocessor or a microcontroller, e.g., an application-specific integrated circuit (ASIC) or a digital signal processor, possibly in combination with a memory unit for storing program code, etc. A processor can alternatively or additionally be implemented by an integrated circuit (IC), specifically a field programmable gate array (FPGA), an ASIC or a digital signal processor (DSP) or a graphic processing unit (GPU). Alternatively or additionally, a processor can be implemented by a virtual processor or a virtual machine or a soft CPU. A processor can be implemented by a programmable processor having configuration interfaces that facilitate configuration of various techniques described herein. The programmable processor can be configured to implement method steps as described herein, components, modules, or other aspects of the techniques described herein.
A “memory” or “memory unit” or “memory module” or the like can be implemented by a volatile memory in the form of random access memory (RAM) or a non-volatile memory such as a hard disc or data carrier.
The term “include”—specifically with respect to data and/or information—can relate to a (computer-implemented) storing of respective information or the respective date in a data structure/data set (which, e.g., in turn is also stored in a memory unit) in the context of the present disclosure.
The term “providing”—in particular in regard to data and/or information—can relate to a computer-implemented providing in connection with the present disclosure. Said providing may be implemented by an interface, e.g., a database interface, a network interface, an interface to a memory unit. It is possible that respective data and/or information are communicated and/or transmitted and/or retrieved and/or received when providing via the interface.
The term “providing” can also relate to a loading or saving, e.g., of a transaction together with respective data in the context of the present disclosure. For example, this can be implemented on or by a memory module.
The term “providing” can also relate to communicating (or transmitting or receiving or transfer) of respective data from a node to another node of the distributed database infrastructure (respectively of the corresponding infrastructure) in the context of the present disclosure.
A “smart contract” or a smart-contract process” or “smart-contract functionality” can refer to the execution of program code, e.g., of a control instruction, in a process by way of the distributed database or the respective infrastructure.
A “checksum”, e.g., a data-block checksum, a data checksum, a node checksum, a transaction checksum, a chaining checksum or the like can relate to a cryptographic checksum or a cryptographic hash or hash value, in the context of the present disclosure. Such checksums can, in particular, be determined across a data set and/or data and/or one or more transactions and/or a subsection of a data block, e.g., the block header of a block of the blockchain or the data block header of a data block or only a part of the transaction of a data block. A checksum can be specifically implemented by a checksum or checksums or a hash value or hash values of a hash tree, e.g., a Merkle tree, a Patricia tree. Moreover, a “checksum” can also be implemented by a digital signature or a cryptographic message authentication code. By way of checksums, it is possible to implement cryptographic protection/protection against manipulation for transactions and the associated data and datasets on various levels of the distributed database. For example, if there is a need for an increased level of security, it would be possible to create and validate checksums on transaction level. For example, if a reduced level of security is required, then it would be possible to create and validate checksums on block level—e.g., across the entire block or only across a part of the data block and/or a part of the transaction.
A “data-block checksum” can relate to a checksum which is calculated across a part or all transactions of a data block in the context of the present disclosure. A node can validate/determine the integrity/authenticity of the respective part of the data block by way of data-block checksums. Alternatively or additionally, the data-block checksum can also be formed across transactions of a preceding data block/predecessor data block. The data-block checksum can, in particular, be implemented via a hash tree, e.g., a Merkle tree [1] or a Patricia tree. Here, the data-block checksum can be the root checksum of the Merkle tree of the Patricia tree or of another binary hash tree. It would be possible that transactions are saved by way of further checksums from the Merkle tree or the Patricia tree, respectively, e.g., by using the transaction checksums, wherein in particular the further checksums can relate to leaves of the Merkle tree or the Patricia tree, respectively. The data-block checksum can, thereby, protect the transaction by forming the root checksum from the further checksums. The data-block checksum can, in particular, be calculated for the transactions of a specific data block of the data blocks. In particular, such a data-block checksum can be included in a subsequent data block of the given data block, e.g., to chain this subsequent data block with the preceding data blocks and, in particular to make the integrity of the distributed database infrastructure testable. Thereby, the data-block checksum can implement the chaining checksum or, at least, go into the chaining checksum. The header of a data block (e.g., of a new data block or a data block for which the data-block checksum is determined) can include the data-block checksum.
A “transaction checksum” can relate to a checksum which is determined across a transaction of a data block, in connection with the present disclosure. In addition, the calculation of the data-block checksum of a respective data block can be accelerated, because for this already calculated transactions checksums can be readily used as leaves of a Merkle tree.
A “chaining checksum” in the context of the present disclosure can relate to a checksum which for the respective data block of a Blockchain indicates or references to a preceding data block of the Blockchain—which is often referred to as “previous block hash” in literature [1]. For this, in particular, a respective chaining checksum is determined for the preceding data block. The chaining checksum can be implemented, e.g., by a transaction checksum or a data-block checksum of a data block, i.e., of an existing data block of the Blockchain; to thereby chain a new data block with a (existing) data block of the Blockchain. For example, it would also be possible that a checksum is determined across a header of the preceding data block or across the entire preceding data block to be used as a chaining checksum. For example, this could also be calculated for multiple or all of the preceding data blocks. For example, the chaining checksum could also be implemented by a checksum determined across the header of a data block in the data-block checksum. A respective data block of the Blockchain includes, however, preferably a chaining checksum that has been calculated or relates to a preceding data block, specifically, the next-neighbor preceding data block directly adjacent to the respective data block. For example, it would also be possible that a respective chaining checksum is determined only across a part of the respective data block, e.g., the preceding data block. Thereby, a data block can be implemented which has an integrity protected part and a non-protected part. Thereby, a data block can be implemented that has a non-changeable integrity protected part and that has a non-protected part that can be modified later on. Integrity protected can mean that a change of the integrity protected data can be detected by way of a checksum.
Next, example implementations of a transaction are described.
The data—that is, e.g., stored in or written to a transaction of a data block—can be provided in various manners. Instead of data—e.g., user data such as measurement data or data/ownership structure regarding ASICs—a transaction of a data block can rather include the checksum for such data. The respective checksum can be implemented in various manners. For example, a respective data-block checksum of a data block, e.g., including the respective data, of another database or of the distributed database, a transaction checksum of a data block of the respective data, e.g., of the distributed database or of another database, or a data checksum determined across the data can be used.
In addition, the respective transaction can optionally include a link to or an indication of a memory position—e.g., an address of a file server and indications where the respective data are to be found on the file server, i.e., pertaining to off-chain storage; or an address of another distributed database which includes the data. The respective data could, e.g., also be provided in a further transaction of a further data block of the Blockchain—e.g., if the respective data and the associated checksums are included in different data blocks. It would also be possible that those data are provided via another communication channel—e.g., via another database and/or a cryptographically-secured communication channel.
In this regard, reading a dataset from a distributed database can generally correspond to reading either the entire dataset from the distributed database, or reading a checksum of the dataset from the distributed database and reading a payload data of the dataset from a non-distributed database.
Further, it would be possible that in addition to the checksum an add-on data set—e.g., a link or an indication to a memory position—is provided in the respective transaction. The add-on data set can, in particular, indicate where the data can be retrieved. This can be helpful to limit the amount of data of the blockchain.
The term “security protected” can, specifically, relate to a protection that can be implemented by a cryptographic method. For example, this can be implemented by using a distributed database infrastructure for the providing or communication or transmitting of respective data/transactions. This can be implemented by a combination of the various checksums—e.g., cryptographic—, by appropriate synergetic interaction between the checksums, to, e.g., increase the security or the cryptographic security for the data of the transactions. In other words, “security protected” in the context of the present disclosure can also relate to “cryptographically protected” and/or “protected against manipulation”, wherein “protected against manipulation” can also be referred to as “protected integrity”.
Insertion of transactions into a distributed database infrastructure can include chaining of data blocks of a Blockchain. The term “chaining of data blocks” in the connection of the present disclosure can relate to the data blocks respectively including information (such as the chaining checksum) which links to another data block or multiple other data blocks [1], [4], [5].
Insertion of transactions into a distributed database can include saving the transactions in one or more data blocks of the Blockchain.
Insertion of transactions can include validating and/or confirming transactions.
The term “insertion of transactions into the distributed database” or “writing of data to the distributed database” and the like can relate to communicating a transaction or transactions or a data block including the transactions to one or more nodes of a distributed database infrastructure. If those transactions are successfully validated, e.g., via the one or more nodes, these transactions can be chained as a new data block with at least one existing data block [1], [4], [5]. For this, the respective transactions are stored in a new data block. In particular, this validating and/or chaining can be implemented by a trusted node, e.g., a mining node, a blockchain oracle or a blockchain platform.
In particular, a blockchain can relate to a blockchain as a service, such as has been proposed by Microsoft or IBM. In particular, trusted nodes and/or other nodes can deposit a node checksum, e.g., a digital signature, in a data block, e.g., in a data block that has been validated by the respective node and which is then chained, in particular to facilitate identification of the creator of the data block and/or identification of the node. Here, the node checksum indicates which node has chained the respective data block with at least one other data block of the Blockchain.
A “transaction” or “transactions” in connection with the present disclosure can relate to a smart contract [4], [5], a data structure or a transaction data set, which, in particular, respectively include a transaction or multiple transactions. The term “transaction” or “transactions” can also relate to the data of a transaction of a data block of a blockchain, in connection with the present disclosure. A transaction can, e.g., include a program code which, e.g., implements a smart contract. For example, a transaction can also relate to a control transaction and/or a confirmation transaction in the context of the present disclosure. Alternative, a transaction can also be implemented by a data structure which saves the data (e.g., the control instructions and/or the contract data and/or other data such as video data, user data, measurement data etc.).
In particular, the term “saving or writing or storing transactions in data blocks”, “saving transaction” and the like can relate to a direct saving or indirect saving. A direct saving can relate to the respective data block of the Blockchain or the respective transaction of the Blockchain including the respective data. An indirect saving can relate to the respective data block or the respective transaction including a checksum and, optionally, an add-on data set, e.g., a link to or an indication of a memory location for respective data; hence, the respective data are not directly saved in the data block (or the transaction). Rather, a checksum is provided for these data in the data block. In particular, these checksums can be validated when saving transactions in data blocks, such as has been explained above with respect to “inserting into the distribute database”.
A “program code”—such as a smart contract—can relate to a program instruction or multiple program instructions which are saved in one or more transactions, in connection with the present disclosure. The program code can be executable and can be executed, e.g., by the distributed database. This can be implemented, e.g., by a runtime environment, e.g., of a virtual machine, wherein the runtime environment or the program code are preferably Turing complete. The program code is preferably executed by the infrastructure of the distributed database [4], [5]. Here, a virtual machine is implemented by the infrastructure of the distributed database. It is possible to execute the program code when validating a corresponding transaction.
A “smart contract” can relate to an executable program code in connection with the present disclosure [4], [5]—see, in particular, explanations with respect to “program code” provided above. The smart contract is preferably saved in a transaction of the distributed database—e.g., a blockchain—, e.g., in a data block. For example, the smart contract can be executed in the same manner as has been described in connection with the definition of “program code”, in particular in connection with the subject disclosure.
The term “proof of work” can relate to solving a computationally expensive task, in particular, depending on the content of a data block or the content of a specific transaction, in connection with the present disclosure [1], [4], [5]. Such a computationally expensive task can also be referred to as cryptographic puzzle.
The term “distributed database”, can generally relate to a decentralized, distributed database, a blockchain, a distributed ledger, a distributed memory system, a distributed ledger technology (DLT) based system (DLTS), a revision secure database system, a cloud, a cloud-service, a blockchain in a cloud or a peer-to-peer database system, in the context of the present disclosure. Also, various implementations of a blockchain or of a DLTS can be used, e.g., such as a blockchain or a DLTS that is implemented by way of a directed acyclic graph (DAG), a cryptographic puzzle, a hash graph or a combination of these variants [6], [7]. It would also be possible to implement different consensus algorithms. For example, a consensus algorithm can be implemented by way of a cryptographic puzzle, a gossip about gossip, a virtual voting or a combination of such techniques (e.g., gossip about gossip combined with virtual voting) [6], [7]. For example, if a blockchain is used, then this can, in particular, be implemented by a bitcoin-based implementation or an Ethereum-based implementation [1], [4], [5]. The term “distributed database” can also relate to a distributed database infrastructure that has at least a part of its nodes and/or devices and/or infrastructure implemented by a cloud. For example, the respective components can be implemented as nodes/devices in the cloud (e.g., as virtual nodes in a virtual machine). This can be implemented by WMware, Amazon web services or Microsoft Azure. Due to the increased flexibility of the described implementation scenarios, it is, in particular, possible to combine partial aspects of the described implementation scenarios with each other, e.g., by using a hash graph as blockchain, wherein the blockchain itself can also be a block batch.
For example, if a directed acyclic graph (DAG) is used (e.g., IOTA or Tangle), transactions or blocks or nodes of the graph are connected with each other via directed edges. I.e., (all) edges are (always) having the same direction, e.g., as observed for time. In other words it is, in particular, not possible to propagate through or visit transactions or blocks or nodes of the graph backwards (i.e., opposite to the common unified direction). Acyclic means, in particular, that there are no loops or ring closures when traversing the graph. For example, a distributed database infrastructure can relate to a public distributed database infrastructure (e.g., a public blockchain) or a closed (private) distributed databased system (e.g., a private blockchain).
For example, in the case of a public distributed database infrastructure, the nodes and/or devices can join the distributed database infrastructure without proof of authorization or authentication or login credentials, respectively be accepted by the distributed database infrastructure without such information. In particular, in such a case the operator of the nodes and/or devices can remain anonymous.
For example, in the case of implementation of the distributed database infrastructure by a closed database system, new nodes and/or devices can require a valid proof of authorization and/or valid authentication information and/or valid credentials and/or valid login information to join the distributed database infrastructure or be accepted by the distribute database infrastructure.
A distributed database infrastructure can also be implemented by a distributed communication system for data exchange. For example, this can be a network or a peer-to-peer network.
The term “data block”—that can be, depending on the context and implementation, also be referred to as “constituent” or “block”—can refer to, in the context of the present disclosure, a data block of a distributed database—e.g., a blockchain or a peer-to-peer database—, which are, in particular, implemented as a data structure and, preferably, include one of the transactions or multiple of the transactions. In an implementation, the database or the database system can be a DLT based system (DLTS) or a blockchain and the data block can be a block of the blockchain or of the DLTS.
As a general rule, a data block can, e.g., include indications of the size—e.g., data volume in bytes—of the data block, a data block header (block header), a transaction counter and one or more transactions [1]. The data block header can include a version, a chaining checksum, a data-block checksum, a timestamp, a proof of work, a Nonce—i.e., a unique value, a random value or a counter which is used for the proof of work [1], [4], [5]. A data block can, e.g., also simply relate to a respective memory range or address range of the overall data that is stored in the distributed database. Thereby, it is possible to implement blockless distributed database infrastructure such as the IOT chain (ITCA), IOTA, Byteball, etc. Here, the functionality of the blocks of a blockchain and of the transactions are combined with each other in such a manner that, e.g., the transactions themselves secure the sequence or chains of transactions of the distribute database, such that they are, in particular, saved in a secured manner. For this the transactions can be chained by way of a chaining checksum, e.g., by using a separate checksum or the transaction checksum of one or more transactions as chaining checksum, which is saved in a new transaction in the distributed database infrastructure when storing the new transaction in the distributed database. In such a scenario, a data block can, e.g., also include one or more transactions, wherein in a simple scenario a data block relates to a single transaction.
The term “Nonce” can relate to, in connection with the present disclosure, a cryptographic nonce—which is an abbreviation for “used only once” [2] or “number used once” [3]. In particular, a Nonce indicates individual numbers or a combination of letters that is preferably only used once in the respective context, e.g., transaction, data communication.
The term “preceding data blocks of a (given) data block of the Blockchain” can relate, in connection with the present disclosure, e.g., to the data block of the Blockchain that is a direct predecessor of the (given) data block. Alternatively, the term “preceding data blocks of a (given) data block of the distribute database” can also relate to all data blocks of the Blockchain that precede the given data block. Thereby, the chaining checksum or the transaction checksum can be determined across the direct preceding data block (respectively the transactions thereof) or all data blocks preceding the given data block (respectively the respective transactions).
The terms “blockchain node”, “node”, “node of an infrastructure of a distributed database”, “mining node” and the like can relate, in the context of the present disclosure, to devices—e.g., mobile devices, wireless communication devices, computers, smartphones, clients or participants—that perform operations associated with the distributed database, e.g., a blockchain [1], [4], [5]. Such nodes can, e.g., execute transactions of a distributed database or the respective data blocks or can insert new data blocks including new transactions into the distributed database by way of new data blocks. In particular, this validation and/or chaining can be implemented by a trusted node, e.g., a mining node, or exclusively by trusted nodes. A trusted node is a node that has additional security measures—e.g., firewalls, access restrictions to the node or the like—to avoid manipulation of the node. Alternatively or additionally, a trusted node can, e.g., save a node checksum—e.g., a digital signature or a certificate—in the new data block when chaining the new data block. Thereby, it is possible to provide the proof that indicates that the respective data block has been inserted by a specific node, respectively indicate the originator.
As a general rule, device or the devices can be implemented by devices of a technical system and/or an industrial plant and/or an automation network and/or a fabrication plant, that can also be nodes of the infrastructure of the distribute database. Thereby, the devices can be mobile devices or devices of the Internet of things, that can also be nodes of the infrastructure of the distributed database. Nodes can, e.g., include at least one processor, e.g., to execute their computer-implemented functionality.
The term “blockchain oracle” and the like can relate, in the context of the present disclosure, to nodes, devices or computers that include a security module that has software protection mechanisms—e.g., cryptographic methods—, mechanical protection mechanisms—e.g., a lockable housing—or electric protection measures—e.g., tamper protection or a protection system that deletes data of the security module in the case of unauthorized use/modification of the blockchain oracle. The security module can include, e.g., cryptographic keys that are required for the calculation of checksums—e.g., of transaction checksums or node checksums.
The term “computer” or “device” can relate to a computer (system), a client, a smartphone, a device or a server that are arranged outside of the blockchain, respectively or are not participants of the distributed database infrastructure, i.e., do not execute operations of the distributed database or simply retrieve those without executing transactions, inserting data blocks or calculate proof of works. Alternatively, the term “computer” or “device” can also relate to a node of the infrastructure of the distributed database. In other words, a device can in particular implement a node of the distributed database infrastructure or a device outside of the blockchain and the distributed database, respectively. A device outside of the distributed database infrastructure can, e.g., access the data—e.g., the transactions or the control transactions—of the distributed database. A device outside of the distributed database infrastructure can be controlled by nodes—e.g., by way of smart contracts and/or blockchain oracles. For example, if a control of a device—e.g., a device implemented as a node or a device outside of the distributed database infrastructure—is implemented by a node, then this can occur via a smart contract which, in particular, is saved in a transaction of the distributed database.
It is to be understood that the features mentioned above and those yet to be explained below may be used not only in the respective combinations indicated, but also in other combinations or in isolation without departing from the scope of the invention.
Some examples of the present disclosure generally provide for a plurality of circuits or other electrical devices. All references to the circuits and other electrical devices and the functionality provided by each are not intended to be limited to encompassing only what is illustrated and described herein. While particular labels may be assigned to the various circuits or other electrical devices disclosed, such labels are not intended to limit the scope of operation for the circuits and the other electrical devices. Such circuits and other electrical devices may be combined with each other and/or separated in any manner based on the particular type of electrical implementation that is desired. It is recognized that any circuit or other electrical device disclosed herein may include any number of microcontrollers, a graphics processor unit (GPU), integrated circuits, memory devices (e.g., FLASH, random access memory (RAM), read only memory (ROM), electrically programmable read only memory (EPROM), electrically erasable programmable read only memory (EEPROM), or other suitable variants thereof), and software which co-act with one another to perform operation(s) disclosed herein. In addition, any one or more of the electrical devices may be configured to execute a program code that is embodied in a non-transitory computer readable medium programmed to perform any number of the functions as disclosed.
In the following, embodiments of the invention will be described in detail with reference to the accompanying drawings. It is to be understood that the following description of embodiments is not to be taken in a limiting sense. The scope of the invention is not intended to be limited by the embodiments described hereinafter or by the drawings, which are taken to be illustrative only.
The drawings are to be regarded as being schematic representations and elements illustrated in the drawings are not necessarily shown to scale. Rather, the various elements are represented such that their function and general purpose become apparent to a person skilled in the art. Any connection or coupling between functional blocks and/or boxes, devices, components, or other physical or functional units shown in the drawings or described herein may also be implemented by an indirect connection or coupling. A coupling between components may also be established over a wireless connection. Functional blocks and/or boxes may be implemented in hardware, firmware, software, or a combination thereof.
Hereinafter, techniques are described that facilitate validating measurement datasets provided by oracles. As a general rule, oracles can be implemented by hardware oracles and/or software oracles. A hardware oracle can measure—e.g., using a sensor—one or more physical observables of a physical event. Examples would include measurement of electrical characteristics, e.g., electrical current or electrical voltage, fluid flow or fluid volume, pressure, temperature, operational activity of an industrial machine such as oil change, operating mode, switch on/switch off, etc.; logistics such as dispatch, waypoint passing, delivery, etc. Software oracles can provide measurement data indicative of software-defined events, e.g., website updates, data availability, service downtime, etc.
As a general rule, the measurement dataset can be associated with an industrial field device. More specifically, the measurement dataset can be associated with an event—e.g., a hardware and/or software event—of an operation of the industrial field device. Various kinds of industrial field devices can benefit from the techniques described herein. To give a few examples, industrial field devices such as vehicles such as trains or airplanes or ships, turbines, subsea equipment, medical equipment such as magnetic-resonance imaging or computer tomography, robotic assembly lines, robot manipulators, etc. can benefit from the techniques described herein. The particular kind and type of industrial field device is not germane to the operation of the techniques described herein.
Various examples described herein facilitate validating a given measurement dataset based on a consensus between (i) the given measurement dataset associated with a given event, and (ii) a reference dataset. The reference dataset can provide a cross-check for the measurement dataset. As a general rule, there are various options available for implementing the reference dataset. The reference dataset may be embodied or include a further measurement dataset. For example, the reference dataset may include one or more observables of one or more further measurement datasets, also associated with the same given event. Alternatively or additionally, it would be possible that the reference dataset includes one or more predefined constraints. Thereby, independent or largely independent information on one and the same event and/or the context of the event can be obtained and a respective comparison can be triggered. The comparison between the (i) measurement dataset and the (ii) reference dataset checks for the consensus regarding the observed event. Based on the result of the comparison it would then be possible to trigger or to not trigger (selectively trigger) one or more validation measures for the measurement datasets. These one or more validation measures can be implemented at a distributed database.
Such techniques are based on the finding that by using independent or largely independent measures for one and the same given event—i.e., the measurement dataset and the reference dataset—, it becomes possible to identify malfunctioning or fraud associated with an oracle. Thus, the trust level for the measurement datasets can be increased.
As a general rule, various options are available for implementing the validation measures. To give a few examples, the validation measures can include validating or invalidating the measurement datasets. For example, a variable may be stored in the distributed database, wherein the variable is indicative of the positive or negative result of the comparison. It would also be possible that the variable is indicative of the underlying measurement datasets, i.e., it would be possible that the measurement dataset is selectively stored in the distributed database, depending on the result of the comparison. Further, in case of lack of consensus, it would be possible to inform involved stakeholders accordingly, i.e., one or more nodes that would rely on the measurement dataset.
Various examples are based on the finding that a trust level in the validation measures can be increased if the comparison between (i) a given measurement dataset, and (ii) the reference dataset is implemented at a mining node of a Blockchain infrastructure, i.e., if the logic for the comparison resides at least partly at the Blockchain infrastructure. In particular, an increased trust level can be achieved if compared to reference implementations in which such consensus is checked at a node outside of the Blockchain infrastructure. Typically, nodes of the distributed database infrastructure can have an increased security level if compared to nodes outside of the distributed database infrastructure. Alternatively or additionally, processes implemented by logic residing at a mining node of the distributed database structure can be securely tracked to facilitate a later audit. Manipulation to such logic may be difficult or difficult to conceal. For example, it would be possible that in case of a later check of the validity of the measurement dataset, it is possible to check validity of the metric underlying the comparison for validity. According to various examples, it would also be possible to consider the measurement dataset that has been subject to the comparison, or even underlying raw data samples when checking the validity of the comparison.
According to various examples, the measurement dataset—even though being subject to the comparison at a mining node of the infrastructure of the distributed database—can be digitally signed close to the origin of the underlying raw data samples, e.g., close to or at an oracle. More specifically, in various examples, the measurement dataset may include a digital signature that is determined based on the raw data samples (if compared to a digital signature that is determined on the processed raw data samples). Thus, the validity of the underlying raw data samples is tracked. By way of a measurement dataset including a digital signature, subsequent manipulation of the measurement dataset is prevented. For providing the digital signature, it is possible to use a private-public keying material. Then, the digital signature can be checked for validity based on a public key of the private-public keying material, while the digital signature is created using the private key of the public-private keying material.
Various techniques are based on the finding that for various kinds and types of raw data samples it is possible to determine a performance indicator. The event can be indicative of operational characteristics of an industrial field device. It is possible to determine the performance indicator, wherein the performance indicator specifies one or more figures of merit of the operational characteristics. As such, the performance indicator can correspond to processed raw data samples. The figures of merit can summarize the operation of the industrial field device. The figures of merit can describe abnormalities of the operation. The figures of merit can describe average values of the operational characteristics.
As a general rule, the measurement dataset can include or be implemented by the performance indicator. More specifically, the processed raw data samples included in the measurement dataset can correspond to the performance indicator.
As a general rule, the performance indicator can be determined based on raw data samples, taking into consideration one or more operational constraints associated with the industrial field device. For example, depending on the particular type of industrial field device, different operational constraints can govern which information is significant for the performance of the industrial field device. To give an example: for a stereo camera, dead times in the refresh rate with which images are obtained from the image sensors can be a significant performance indicator; while, on the other hand, for a disc brake of a train car a spectral power density within a certain part of a vibrational spectrum can be a significant performance indicator. In other words, and more generally: the performance indicator can be unique to the type of industrial field device and be associated with the operational characteristics of the industrial field device.
The performance indicator can, typically, include human-understandable application-layer data regarding the operational characteristics of the industrial field device. I.e., processed information that can be directly output via a human-machine-interface may be included in the performance indicator.
As a general rule, the performance indicator can be smaller than the raw data samples. The performance indicator could condense or summarize information generally included in the raw data samples. For example, determining the performance indicator can include applying a low-pass filter, identifying a maximum or minimum, detecting events in the raw data samples, etc.
To give a few examples, the performance indicator could include at least one of the following: time-averaged data samples of the measurement dataset; peak data samples of the measurement dataset; event characteristics of the measurement dataset; or time-averaged use characteristics of the industrial field device.
Various techniques employ a distributed database for storing data associated with industrial field devices. The storage of data in a distributed database may generally be referred to as on-chain storage. In particular, various techniques employ a Blockchain for implementing the distributed database. While various techniques will be described in connection with a scenario in which the distributed database is implemented by a Blockchain, similar techniques may be applied for other kinds and types of distributed databases, e.g., blockless databases, a DLTS, etc. The storing in all such kinds of distributed databases is referred to as on-chain storage, for sake of simplicity (but this is not limited to a Blockchain).
According to various examples, it is possible to facilitate on-chain storage—i.e., storage on the Blockchain or another distributed database—of the measurement dataset. According to various examples, it is possible to facilitate off-chain storage of the raw data samples—i.e., storage on a non-distributed database. The measurement dataset and the raw data samples can be stored in a cross-referenced manner. Since typically the raw data samples are comparably large in size, not having to store the raw data samples on-chain helps to relax computational requirements imposed on the Blockchain infrastructure. At the same time, by storing the performance indicator on-chain, a high security against manipulation can be provided. For example, if the raw data samples were manipulated, this manipulation would most likely also result in a change of the measurement dataset (or else the manipulation would be insignificant). This could help to identify the manipulation by comparing the corresponding raw data samples against the measurement dataset stored on-chain. In particular, it would be possible that the measurement dataset includes a performance indicator; this performance indicator can then be stored on-chain—while the raw data samples can be stored off-chain.
In further detail, as illustrated in
As a general rule, the event 81 could be a physical event and the observables 85, 86 could be physical observables. It would also be possible that the event 81 is a software event, that the observables 85, 86 would correspond to software observables 85, 86.
The oracles 101, 102 can provide respective measurement dataset 91, 92 to a network 71, e.g., the Internet. The measurement dataset 91 provided by the oracle 101 is indicative of the observable 85 of the event 81; while the measurement dataset 92 provided by the oracle 102 is indicative of the observable 86 of the event 81. In particular, it would be possible that the observable 85 differs from the observable 86. More generally speaking, different oracles can provide measurement datasets that are indicative of different observables. For example, a first oracle could provide measurement datasets indicative of a temperature; while a second oracle provides measurement datasets indicative of pressure, to give just one example. Thereby, independent information and multiple measures of the event 81 can be obtained. This helps to reliably validate the measurement datasets 91, 92.
Sometimes it is not feasible or required to include raw data samples in the measurement datasets 91, 92. Rather, some data compression or data pre-processing may be implemented at the oracles 101, 102, respectively, before transmitting the measurement datasets 91, 92 towards the communication network 71. The measurement datasets 91, 92 can, hence, include processed raw data samples. To give an example, the measurement datasets 91, 92 could include respective performance indicators that are indicative of or correspond to one or more figures of merit of operational characteristics of the event 81.
An advantage of preprocessing the raw data samples—such that the measurement datasets 91, 92 output via the interfaces 107 include the processed raw data samples—lies in reducing the computational resources required downstream of the data processing pipeline, e.g., required at a mining node 151-153 of the Blockchain infrastructure 150 or network resources required at the network 71. For example, fewer computational resources may be required at one of the mining nodes 151-153 to implement a comparison of the respective measurement dataset 91, 92 (including the already processed raw data samples, e.g., the performance indicator) with a respective reference dataset. In particular, as mentioned above, it is possible that the pre-processing of the raw data samples reduces the data size of the measurement datasets 91, 92 if compared to the raw data samples and, e.g., discards redundant or unnecessary information. Therefore, the amount of data that needs to be processed when implementing a comparison of the measurement dataset 91, 92 with a reference dataset is reduced.
As a general rule, raw data samples can correspond to a lower-layer output of a sensor device (in a processing stack including multiple layers); while processed raw data samples can correspond to the raw measurement data after some processing in accordance with a processing algorithm. There can be a tendency that processed raw data samples are smaller if compared to the raw data samples. To give an example: it would be possible that a 2-D stereo camera outputs to 2D images having pixels, each pixel having a certain color or brightness value. Then, the raw data samples can be processed to, e.g., identify objects in the 2-D images using object recognition. The objects could be identified with a bounding box or position label and a category label indicative of the type of the object, e.g., vehicle, person, tree, etc. This can implement the raw data samples. The processed raw data samples could also include distances for the object obtained from a comparison of multiple 2-D images at a given frame. In such a scenario, the processed raw data samples may be significantly smaller if compared to the raw data samples. For example, a list of objects with associated categories and distances may be significantly smaller if compared to the set of pixels (e.g., a few megapixels), each pixel having a n-bit value indicating its brightness, etc. While the examples above have been described in connection with an implementation using a 2-D stereo camera as the source of the measurement dataset, the techniques described herein are not limited to such an example. Various other kinds and types of sources of the measurement dataset are conceivable.
The measurement datasets 91, 92 output via the communication interfaces 107 of the oracles 101, 102 may be digitally signed. The measurement datasets 91, 92 may hence include a digital signature. In some examples, the digital signature may be determined based on the raw data samples, so that the measurement dataset includes the digital signature of the raw data samples. For example, the control circuitry 105 of the oracles 101, 102 may be configured to determine the signature. By determining the signature close to the origin of the raw data samples and/or even based on the raw data samples, e.g., next to the input interface 106, it becomes possible to protect manipulation of the measurement datasets 91, 92. Since the digital signature is determined close to the origin of the raw data samples, i.e., at a point very much upstream of the data processing path, many attack vectors downstream of the data processing path can be mitigated.
In the example of
The inset of
The system 70 also includes stakeholder nodes 111, 112. Each stakeholder nodes 111, 112 includes a processor 115 that can load and execute program code stored by a respective non-volatile memory 117. The stakeholder nodes 111, 112 are connected to the networks 71 via respective interfaces 116. Each one of the stakeholder nodes 111, 112 may be operated by a respective operator. The operators may rely on functionality implemented by, e.g., the smart contract 90 of the Blockchain 159. The operators may rely on the validity of the measurement dataset 91 and/or measurement dataset 92. Therefore, each one of the stakeholder nodes 111-112 is associated with an operator that has an interest in the validation of the measurement dataset 91 and/or the measurement dataset 92.
The system 70 also includes a non-distributed database 72. The non-distributed database 72 is not replicated across multiple nodes. It is different from the Blockchain 159. It can implement off-chain storage.
Next, details with respect to the functioning of the system 70 will be explained in connection with the following FIGs.
In box 5501, raw data samples are obtained. The raw data samples are indicative of one or more operational characteristics of an industrial field device. For example, the raw data samples could be received from one or more sensor devices. At least parts of the raw data samples could be obtained from a software oracle.
Next, at box 5502, the raw data samples are processed. As an output of box 5502, a measurement dataset is obtained. As a general rule, various options are available for processing. In some examples, a performance indicator is determined based on the raw data samples. The performance indicator can correspond to one or more figures of merit of the one or more operational characteristics of the industrial field device.
As a general rule, various options are available for determining the performance indicator in box 5502. To give an example, it would be possible that the performance indicator is determined using a performance metric algorithm. The performance metric algorithm can transform the raw data samples into the performance indicator. For example, the performance metric algorithm can be unique to the particular industrial field device or type of industrial field device. The performance metric algorithm can reduce the amount of data such that the data size of the measurement dataset including performance indicator is smaller than the data size of the raw measurement samples.
In box 5503, storage of the measurement dataset including the processed raw data samples, is triggered. The measurement dataset can be stored in a distributed database, e.g., the Blockchain 159. Triggering storage in box 5503 can include, e.g., transmitting the measurement dataset to the Blockchain infrastructure 150, e.g., to an appropriate mining node and requesting storage in the Blockchain 159.
At box 5001, a measurement dataset is obtained. For example, the measurement dataset can be obtained from an oracle such as the oracle 101.
According to some examples, box 5001 can include (pre-) processing raw data samples. This can correspond to or include techniques as explained with reference to box 5502 above (cf.:
According to various examples, such processing of the raw data samples at box 5001 could be based on a predefined algorithm. Sometimes, this algorithm can have an associated validity time duration. For instance, the algorithm may be agreed upon by the operators of the stakeholder nodes 111, 112. A corresponding agreement may define the validity time duration. In such a scenario, it would be possible that the processing of the raw data samples, in box 5001, is selectively executed, if one or more timestamps of the raw data samples are in accordance with the validity time duration of the predefined algorithm. For example, it can be checked whether the timestamps of the raw data samples are within the validity time duration. This helps to avoid using an outdated algorithm for the processing. This can be of help in scenarios in which over the course of times different algorithms or different parameters of an algorithm are agreed upon by the stakeholders.
Then, the measurement dataset can be associated with a timestamp of the processing at box 5001. Alternatively or additionally, it would also be possible to associate the measurement dataset that is obtained from box 5001 with an indicator indicative of the predefined algorithm and/or the validity time duration of the predefined algorithm. By such techniques, it becomes possible to facilitate a subsequent audit/validity check of the processing at box 5001. In particular, it can be checked whether the appropriate algorithm has been used. This can be of help in scenarios in which over the course of times different algorithms or different parameters of an algorithm are agreed upon by the stakeholders.
At box 5002, a reference dataset is obtained. For example, a further measurement dataset may be obtained. The further measurement dataset is indicative of one or more further observables of the event, i.e., the same event for which at box 5001 the measurement data is obtained. The further measurement data is provided by a further oracle. For example, the measurement dataset 92 could be obtained from the oracle 102, wherein the measurement dataset 92 is indicative of the observable 86 of the event 81 (cf.
Alternatively or additionally to the further measurement dataset, it would also be possible to obtain one or more constraints associated with the event.
Next, at box 5003, a comparison between the measurement dataset—obtained at box 5001—and the reference dataset—obtained at box 5003—is performed. Box 5003 could include sending a trigger or request message to execute the comparison. Box 5003 could also include executing the comparison locally, e.g., at the respective mining node 151-153. For example, box 5003 could include invoking a corresponding function of a smart contract of a Blockchain, e.g., invoking a corresponding function of the smart contract 90 of the Blockchain 159 (cf.
As a general rule, various options are available for implementing the comparison at box 5003. The comparison can vary along with the type of measurement dataset and, more specifically, with the type of observables indicated by the measurement datasets obtained in box 5001. To give an example, it would be possible that the comparison is based on a predefined agreement indicative of a metric of the comparison. The metric can define a ruleset for comparing the various involved datasets. In particular, using an appropriate metric, it is even possible to compare different observables, e.g., temperature with pressure, or operational statistics of a field device with current consumption, to give just a few examples. In some examples, the comparison could be implemented by a machine-learning algorithm that is trained to detect abnormalities in the behavior of the multiple physical observables. In other examples, a predefined rule set could be analytically defined.
For example, a tolerance range could be defined by the metric. The tolerance range may specify certain acceptable ranges of deviation between the measurement dataset and the reference dataset.
According to various examples, it would be possible that the metric used for implementing the comparison at box 5003 has a validity time duration. The validity time duration of the metric of the comparison used at box 5003 can be comparable with the validity time duration of the processing algorithm of the processing at box 5001. For example, it would again be possible to check whether one or more timestamps associated with the measurement dataset and/or associated with the reference dataset subject to the comparison are in accordance with the validity time duration of the metric. This prevents an outdated metric to be applied to the measurement dataset and the reference dataset to perform the comparison. For example, the stakeholders may (re-)negotiate or change the metric from time to time. In particular in scenarios in which the comparison in box 5003 is implemented by a smart contract, it can then be helpful to check whether the timestamp or timestamps of the measurement dataset and/or the reference dataset are in accordance with the validity time duration. For example, the appropriate smart contract or the appropriate function of the smart contract implementing the comparison may be selected in accordance with the timestamp or timestamps and in accordance with the validity time durations associated with the smart contracts or functions of the smart contract. Sometimes, in scenarios in which the comparison is implemented by a smart contract, the smart contract cannot be simply removed from the Blockchain without affecting the integrity of the Blockchain. Thus, by implementing the check for the validity time period, the smart contract (or, more specifically, a transaction or block including the smart contract) can remain in the Blockchain; but cannot be used to perform the comparison after expiry of the validity time period.
Furthermore, a result of the comparison can be stored in the distributed database, along with a timestamp of the comparison and the metric or more specifically the validity time duration of the metric. Then, a subsequent check becomes possible whether the appropriate valid metric has been applied to implement the comparison.
In some examples, a scenario may occur in which it is detected, at box 5003, that the validity time duration of the metric has expired. Upon expiry of the validity time duration, it would be possible to trigger a re-negotiation of the metric between the stakeholder nodes 111-112, e.g., by transmitting to the stakeholder nodes 111-112 a corresponding request. Thereby, it can be continuously ensured that a valid and up-to-date metric is employed for implementing the comparison at box 5003.
Next, a few examples are given for example implementations of the reference dataset being indicative of one or more predefined constraints associated with the event. For example, it would be possible that the constraints are a location-based. To give an example, the measurement dataset may include a first geolocation and the one or more predefined constraints may include a second geolocation. Referring to
In a further example, it would be possible that the comparison considers time domain parameters. Such an example is illustrated in
Such an implementation of the timing constraint using a time window is illustrated in
It is not required in all scenarios to use an implementation of the reference dataset that relies on one or more predefined constraints. As mentioned above, it would also be possible to implement the comparison at box 5003 based on a consensus between multiple measurement datasets 91, 92. Such a scenario is illustrated in
As will be appreciated from the description of
Turning again to
In detail, if at box 5004 it is judged that the comparison yields a positive result, i.e., a (cross-) validation of the measurement dataset and the reference dataset is positively obtained, then a positive validation measure can be taken at box 5005; otherwise, a negative validation measure can be taken at box 5006. The positive validation is measure is thus selectively executed in case the comparison yields a positive result.
As a general rule, various options are available for implementing positive and negative validation measures, e.g., in connection with boxes 5005 and 5006. To give just a few examples, a positive validation measure that could be taken as part of executing box 5005 could pertain to storing the measurement data in the Blockchain, e.g., in the Blockchain 159. It would also be possible that a flag indicator is appropriately set, the flag indicator being stored in the Blockchain, e.g., the Blockchain 159. The flag indicator could indicate whether a (cross-)validation was successful or not. Yet another validation measure may include transmitting a corresponding report message to at least one of the stakeholder nodes 111, 112. Thereby, parties interested in the validation can be appropriately informed.
In case the comparison yields a negative result, it would be possible to trigger, as part of execution of box 5006, a settlement process. The settlement process can include a predefined rule set or workflow for the case of a deviation between the first measurement dataset and the second measurement dataset. For example, the settlement could be associated with a trust level of the first oracle providing the first measurement dataset (cf. oracle 101 in
At 3001, the mining node 151 receives—e.g., via the respective interface 156—the first measurement dataset 91. For example, the communication could be via a wide area network or a wired communication line (cf.
Also, the oracle 102 is registered at the mining node 151. Accordingly, at 3002, the mining node 151 receives the measurement dataset 92.
As illustrated in
Next, at 3003, the measurement dataset 91 is fed to a smart contract 61 (more specifically, a respective instance of the smart contract 61, e.g., defined by a respective function call) and, at 3004, the measurement dataset 92 is fed to a further instance of the smart contract 61. Here, a switch point functionality is implemented. In particular, the smart contract 61 can check whether the respective measurement dataset 91, 92 includes processed raw data samples, or rather includes (non-processed) raw data samples. The raw data samples can be original non-preprocessed outputs of the respective sensor device. Processed data samples, on the other hand, have been processed with a respective processing algorithm, e.g., to condense information to some smaller or larger degree. In the various examples described herein, it would be possible that the processed raw data samples correspond to a performance indicator, the performance indicator including one or more figures of merit of operational characteristics of the associated industrial field device. The event 81 can correspond to or be associated with these operational characteristics.
The switch point functionality implemented by the smart contract 61 thus check whether the respective measurement dataset 91, 92 includes raw data samples or processed raw data samples. In case the measurement dataset 91, 92 includes processed raw data samples, these are forwarded to a further smart contract 65 at 3005 and 3006, respectively. On the other hand, raw data samples are forwarded, at 3007 and 3008 to respective instances of a smart contract 62. The smart contract 62 implements the processing of the raw data samples.
As a general rule, each one of the smart contracts 61, 62, 65 can be associated with a validity time duration. The validity time duration can be indicative of an expiry time of the respective smart contract 61, 62, 65. This makes it possible to implement a check whether one or more timestamps of the respective input data is in accordance with the validity time duration. If not, there can be a check made whether an updated smart contract is existent that has another validity time duration. Furthermore, it becomes possible to later on check whether the appropriate smart contract has been used in order to implement the various functionality. For example, an identity of the respectively executed smart contract may be stored in the Blockchain 159, to facilitate such audit. The measurement datasets 91, 92, and/or the reference dataset may also include timestamps that can be compared against the validity time duration.
As a general rule, the measurement datasets 91 and/or 92 may include an identity of the respective sensor device.
As a further general rule, the measurement datasets 91 and/or 92 may include a geolocation of the respective sensor device, e.g., latitude and longitude.
As a further general rule, it would be possible that the measurement datasets 91 and/or 92 may include a respective configuration dataset that is indicative of a processing algorithm used for (pre-)processing raw data samples, in case the measurement datasets 91, 92 include the already preprocess raw data samples.
As a still further rule, it would be possible that the measurement datasets 91 and/or 92 include a respective digital signature. For example, the digital signature can be determined based on a private key of a public-private cryptographic keying material. In some examples, the digital signature is determined based on the raw data samples.
Next, the function of the smart contract 62 is explained in further detail. The smart contract 62 implements logic to process the raw data samples. The smart contract 62 also implements logic to trigger storage of the raw data samples in the non-distributed database 72. In particular, at 3009 and 3010, the raw data samples are transmitted to the non-distributed database 72, e.g., with a respective right command. Again, the smart contract 62 can implement switch point functionality.
Corresponding functions 63, 64 of the smart contract 62 can be used to process the raw data samples. This can be in accordance with a predefined algorithm. The predefined algorithm can have an associated validity time duration. The validity time duration can be compared against timestamps of the raw data samples to check whether the appropriate function 63, 64—e.g., as agreed upon by the stakeholders—is used. Such processing implemented at the Blockchain infrastructure 150 has the advantage that a higher level of trust can be provided, e.g., in connection with the employed algorithm for processing. On the other hand, certain limitations associated with the required computational resources and/or the communication network 71 may have to be observed. In this regard, as will be appreciated from
According to various examples, it is possible that the validity time duration of any one of the smart contracts 61, 62, 65 is defined by two timestamps that define the start time of the validity time duration and the stop time of the validity time duration. Thereby, it can be possible to determine a time domain distance between a respective timestamp of the measurement datasets 91, 92 and the validity time duration. It can be checked whether the valid smart contract 61-62, 65 is used. It is also possible to implement a check whether the appropriate smart contract 61-62, 65 has been used at a later point in time.
Next, details with respect to the smart contract 65 executed at 3011 are explained. To create a high degree of trust, the validation of the measurement dataset 91 and optionally of the measurement dataset 92, e.g., by executing the appropriate validation measure at box 5005 (cf.
Such correlations etc. can be considered in a metric for comparing the various measurement datasets used at the smart contract 65 to implement the comparison. To give an explicit example:
IF “maximum input power” AN “no flow rate” AND “no consumption of chemical additives” AND “timestamps of the various observables having a time domain distance below a threshold”, THEN “event equals occlusion/clogging” at time “timestamp”.
Based on such consensus between the multiple observables of the same event, an attack vector of manipulating individual oracles is essentially prevented, because a successful attack would have to manipulate all data sources.
While in the example explained above multiple measurement datasets have been used, it is generally possible to implement the comparison between a single measurement dataset and one or more predefined constraints. An example predefined constraint could be defined in time domain. For example, here, only the measurement dataset 91 could be obtained. A timing constraint could include a threshold repetition rate. For example, it could be specified that the event “occlusion/clogging” can only occur once a week. Alternatively or additionally, the timing constraint can include timing windows. For example, it could be defined that the event “occlusion/clogging” only occurs in the morning or in the evening. Here, even when operating based on a single measurement dataset, it becomes possible to implement a meaningful comparison.
Instead of such time domain constraints, it would also be possible to use spatial domain constraints. For example, geo-information such as a latitude/longitude from a GPS receiver/GPS device could be used. Here, the oracle 101 may provide the measurement dataset 91 (optionally, its identity in the timestamp), as well its geolocation. All such information can be included in the digital signature. Then, the mining node 151 can implement the comparison based on the geo-location of the oracle 101 and a predefined reference geolocation.
As a general rule, the reference dataset, in particular when including the one or more predefined constraints, can be obtained from the non-distributed database 72. Alternatively or additionally, the reference dataset could also be stored in the Blockchain, e.g., associated with a smart contract.
In case of a positive result of the comparison, at 3012, the measurement dataset 91 and/or the measurement dataset 92, or more specifically the processed raw data samples, can be stored in the Blockchain 159 (cf.
As mentioned above, the various smart contracts, in particular the smart contract 65, may be associated with a validity time duration. Upon expiry of the validity time duration, it would be possible to trigger a re-negotiation of the metric used for the comparison at the smart contract 65 between the various stakeholder nodes 111-112. For example, such changes in the metric may occur if the stakeholders agree that certain criteria used in the metric for the comparison are to strict or to relaxed. Once the respective smart contract 65 has been updated, the corresponding transaction included in the Blockchain 159 including the new smart contract 65 is synchronized between the various mining nodes 151-152 of the Blockchain infrastructure 150. The validity time duration is updated. Also, it can be possible to update the upstream smart contracts 61, 62, such that they invoke the correct, updated version of the smart contract 65. Also, the smart contract 61, 62 may be equipped with logic to autonomously identify the appropriate version of the smart contract 65, e.g., based on a comparison between the timestamps included in the measurement datasets 91, 92 and the validity time duration indicated by a variable in the smart contract 65.
At box 5011, the oracle 101 registers at the mining node 151 and the oracle 102 registers at the mining node 151.
At box 5012, the oracle 101 provides the measurement dataset 91 to the mining node 151. At box 5013, the oracle 102 provides the measurement dataset 92 to the mining node 151.
Boxes 5015-5017 are now only illustrated in connection with the measurement dataset 91 provided at box 5012; but similar boxes could also be executed for the measurement dataset 92 provided at 5013 (not illustrated in
At box 5015, it is checked whether the measurement dataset 91 obtained at box 5012 includes raw data samples or processed raw data samples. In case the measurement dataset 91 includes raw data samples, then the method continues at box 5016. Here, the raw data samples are processed to obtain the processed raw data samples. It is also possible to trigger storage of the raw data samples in the non-distributed database 72.
The processing of the raw data samples in box 5016 can be based on a predefined algorithm. In particular, the processing can be selectively executed if one or more timestamps of the raw data samples are in accordance with a validity time duration of the predefined algorithm. It would be possible that the predefined algorithm is stored in the Blockchain 159. It would also be possible that an indicator indicative of the validity time duration of the predefined algorithm is stored in the Blockchain 159. Also, the timestamps of the raw data samples or at least a derived timestamp of the measurement dataset can be stored in the Blockchain 159.
At box 5017, it is checked whether a predefined agreement positively confirms that the various stakeholders have agreed upon processing the raw data samples at the Blockchain infrastructure 150 (i.e., if the box 5016 has been legitimately executed).
If, at box 5015 it is determined that the measurement dataset 91 includes processed raw data samples (instead of raw data samples), then box 5018 is executed. At box 5018 it is checked whether the various stakeholders have agreed upon processing the raw data samples outside of the Blockchain, i.e., upstream in the data processing flow.
In case the check at box 5017 or the check at box 5018 is successful, the method commences at box 5019.
Box 5019 obtains, as an input, the various processed raw data samples of the measurement datasets 91, 92. At box 5019, a comparison between the multiple measurement datasets—or, more generally, between a measurement dataset and a reference dataset—is implemented.
At box 5020, if a positive result of the comparison of box 5019 is reached—one or more positive validation measures are implemented. For example, one or more measurement datasets may be stored in the Blockchain 159. It would also be possible that the result of the comparison of box 5019 is stored in the Blockchain 159. Box 5020 can include writing respective data into a transaction and chaining the transaction in a new block of the Blockchain. The Blockchain can be synchronized and replicated across multiple mining nodes 151-153.
Summarizing, techniques have been described which facilitate implementing a comparison between a measurement dataset in the reference dataset in a Blockchain infrastructure. This helps to implement a validity check in a manner that can be audited by various stakeholders. The comparison is transparent and can be reconstructed at a later point in time.
Although the invention has been shown and described with respect to certain preferred embodiments, equivalents and modifications will occur to others skilled in the art upon the reading and understanding of the specification. The present invention includes all such equivalents and modifications and is limited only by the scope of the appended claims.
For illustration, while various examples have been described in connection with determining a performance indicator based on raw data samples, in other examples other types of processing of raw data samples would be conceivable.
For further illustration, while various examples have been described in which a Blockchain is used to implement a distributed database, in other scenarios other kinds and types of distributed databases would be conceivable.
The patent claims of the application are formulation proposals without prejudice for obtaining more extensive patent protection. The applicant reserves the right to claim even further combinations of features previously disclosed only in the description and/or drawings.
References back that are used in dependent claims indicate the further embodiment of the subject matter of the main claim by way of the features of the respective dependent claim; they should not be understood as dispensing with obtaining independent protection of the subject matter for the combinations of features in the referred-back dependent claims. Furthermore, with regard to interpreting the claims, where a feature is concretized in more specific detail in a subordinate claim, it should be assumed that such a restriction is not present in the respective preceding claims.
Since the subject matter of the dependent claims in relation to the prior art on the priority date may form separate and independent inventions, the applicant reserves the right to make them the subject matter of independent claims or divisional declarations. They may furthermore also contain independent inventions which have a configuration that is independent of the subject matters of the preceding dependent claims.
None of the elements recited in the claims are intended to be a means-plus-function element within the meaning of 35 U.S.C. § 112(f) unless an element is expressly recited using the phrase “means for” or, in the case of a method claim, using the phrases “operation for” or “step for.”
Example embodiments being thus described, it will be obvious that the same may be varied in many ways. Such variations are not to be regarded as a departure from the spirit and scope of the present invention, and all such modifications as would be obvious to one skilled in the art are intended to be included within the scope of the following claims.
| Number | Date | Country | Kind |
|---|---|---|---|
| 19175903.4 | May 2019 | EP | regional |
