50 results about "Decentralized computing" patented technology

Provided is a smart contract that specifies a routine to be executed by a plurality of the computing nodes of a blockchain-based, decentralized computing platform, wherein the promotion smart contract is configured to determine whether a pre-release software asset satisfies software quality criteria required to advance the pre-release software asset to a next stage, and the promotion smart contract is configured to cause an assertion indicating whether software quality criteria are satisfied to be published to a blockchain storing trust records in response to determining whether the software quality criteria are satisfied.

Systems and methods for providing a decentralized computing resource marketplace captures various attributes of a consumer's needs for remote computing services, such as cost, location, performance, network connectivity, reliability, hardware composition and service levels and identifies, provisions and manages remote resources offered by third parties on behalf of the consumers. Lease agreements may be brokered and enforced among consumers of remote computing services (e.g., storage) and the providers of such resources.

Provided is a process that includes: calling an alert program configured to execute on a decentralized computing platform and access records on a blockchain, wherein: the decentralized computing platform is configured to execute multiple instances of the program to produce multiple instances of candidate results, the decentralized computing platform is configured to determine an output of the alert program in response to the call with a first consensus algorithm, the alert program is configured to verify a cryptographic signature of the call and determine whether an alerting entity is authorized to issue the alert, and the alert program is configured to publish the information about the software asset to alert recipients or to the blockchain upon verifying the cryptographic signature and determining that the alerting entity is authorized to issue the alert.

Provided is a process that includes: calling a program executed on a decentralized computing platform configured to persist state to a blockchain, the call requesting the program to release the software asset to the production environment, wherein: respective instances of the program are configured to publish release documentation by which provenance of the software asset is verifiable to the blockchain, respective instances of the program are configured to verify a cryptographic signature associated with the software asset, the cryptographic signature establishes that the software asset being released has not been tampered with subsequent to signing, the cryptographic signature establishes that the releasing entity or a proxy of the releasing entity has access to a cryptographic key by which the cryptographic signature was formed, and the decentralized computing platform is configured to reach a consensus verification determination among verification results from the replicated instances of the program.

The invention provides a self-organizing cloud architecture and optimization method and system for edge computing. The method comprises: a model construction step: performing model construction on a hierarchical unmanned aerial vehicle system; a decentralized computing unloading algorithm step suitable for an infinite virtual machine resource situation: respectively performing game decision according to conditions met by an unmanned aerial vehicle terminal bandwidth of the unmanned aerial vehicle system so as to achieve Nash equilibrium; and a decentralized computing unloading algorithm step suitable for a finite virtual machine resource situation: designing a decentralized computing unloading algorithm to perform algorithm computing. The invention provides a layered decentralized unloading method to reduce the communication overhead while maintaining the energy efficiency; and according to the self-organizing cloud architecture and optimization method and system provided by the invention, the energy-saving computing unloading decision problem in the hierarchical unmanned aerial vehicle system is modeled as a non-cooperative game for research, the decentralized computing unloadingalgorithm is designed for the situations of infinite virtual machine resources and finite virtual machine resources, and it is proved that the algorithm can achieve the Nash equilibrium.

A physical card (in some cases without any on-board source of power or computing capabilities) is configured to maintain access information for digital bearer assets. The physical card may include disposed thereon a single address operable to receive digital bearer assets in one or more transactions on a decentralized computing platform, like a blockchain-based decentralized computing platform. Other decentralized computing platforms utilize different address generation protocols, thus preventing use of a single address on those other platforms. A set of addresses is generated, each address corresponding to a given decentralized computing platform. Each address is based on a same underlying key-pair, and a primary address is selected from the set for a given card. The remaining addresses in the set are stored, without storage of the public key or private key, and returned in a response to a request for additional addresses of the currency card.

Techniques for storing omics data that indicates long sequences of elements associated with a particular biological molecule include receiving digital omics data comprising over two kilobytes. The digital omics data is split into multiple partitions. The maximum partition size is much less than then a number of elements in a typical instance of the particular biological molecule. Each partition is encrypted. Each encrypted partition is inserted into a corresponding data packet that includes an owner field that uniquely indicates an owner of the omics data. Each data packet is uploaded into a non-centralized, peer-to-peer distributed storage network. Thus, genome data is encrypted and stored in a distributed, scalable, fully decentralized, fast, and highly secure network. The network further provides for decentralized computing, trustless validation of the genomes by way of oracles and trustless genome analysis by third party providers through smart contracts.

The present disclosure relates to implementing an electronic toll data collection management system in a decentralized computing network that employs a distributed ledger. An electronic toll data collection management system may comprise a plurality of nodes, wherein the plurality of nodes are connected to each other over a communication network. Each node may have access to a copy of a distributed ledger, wherein the plurality of nodes is configured to utilize blockchain protocols to verify and record a transaction occurring within the distributed ledger. Data may be recorded as a block, wherein a blockchain is formed by the addition of blocks. Each block may be encrypted and linked to a previous block, wherein a consensus must be reached to update the distributed ledger with the addition of a new block

The invention provides a method and system for sharing computing power resources and a storage medium. The method comprises the following steps: sending a task request to a server node; obtaining taskblocks which are executed in parallel; executing a calculation task according to a task block to generate a calculation result; verifying the calculation result, and returning a verified result to the server node; The task request is actively put forward according to computing nodes, a large number of task blocks generated after task processing and splitting are reasonably distributed to all available computing nodes in a network, optimal distribution is guaranteed, powerful decentralized computing resources are provided for high-strength computing type tasks by utilizing the idle states of the computing nodes, and the data processing efficiency is higher; and through an active request and distribution matching mechanism, the distribution of the computing tasks is more reasonable, and thenon-difference computing node autonomy is further realized, so that the method can be widely applied to the technical field of distributed computing networks.

Provided is a process that includes: obtaining a first request by a first program associated with a first sub-partition of a first partition of a tamper-evident data store of a decentralized computing platform to read data stored in either (i) a second sub-partition of the first partition of the tamper-evident data store of the decentralized computing platform, or (ii) a second partition of the tamper-evident data store of the decentralized computing platform; determining with a subset of peer computing nodes of a set of peer computing nodes that the first program is authorized to read from the second sub-partition or the second partition; and in response to the determination, causing the requested data to be read from the second sub-partition or the second partition.

The invention discloses a decentration computation system based on a double-layer network. The system is constituted by a plurality of light nodes, a plurality of full nodes, and a plurality of mainnodes. A plurality of light nodes, a plurality of full nodes, and a plurality of main nodes are used to form a block chain main network, and a plurality of main nodes are used to form a main node processing network. A plurality of light nodes are used to store user specific data in the block chain network. A plurality of full nodes and a plurality of main nodes are used for a consensus mechanism to store a complete block chain. In the main node processing network, a plurality of main nodes comprise computation nodes having computation functions, which are used to carry out off-chain data computation tasks to acquire computation results. According to the technical scheme provided by the invention, a plurality of main nodes are used for resource isolation, and high expandability is provided,data processing constraints are reduced, and the data throughout of the system is effectively improved.

It is typically difficult for a user to have any awareness of which private data is being used by a third party and to control the flow of the private data to the third party. A computing system is provided with a trusted node that stores encrypted private data. When the third party wishes to obtain information types from the user, the trusted node generates a scope document that specifies the requested information types. This scope document is sent to the user device as a challenge. The user device uses the scope document to display the requested information types, and the user provides input to permit providing the information types to the third party. The user device returns a signed challenge response, which includes the scope document. The trusted node then decrypts the encrypted private data, which corresponds to the requested information types, for the third party.

The present disclosure relates to implementing an electronic prescription and drug system in a decentralized computing network that employs a distributed ledger. A method for prescribing and dispensing drugs may comprise of examining a patient; checking an electronic prescription and drug system, wherein the electronic prescription and drug system comprises a plurality of nodes, wherein the plurality of nodes comprise a processor, a memory unit, and a bus, wherein the plurality of nodes are connected to each other over a communication network, wherein each of the plurality of nodes has access to a copy of a distributed ledger, wherein the plurality of nodes verify and record transactions occurring within the distributed ledger; administering a prescription; dispensing a drug; and broadcasting transactions to the distributed ledger.

A method for using cellular automata to generate quality pseudo-random numbers, which may be used in cryptographic and other applications. A cellular automaton is a decentralized computing model that enables the performance of complex computations with the help of only local information. In general, cellular automata comprise a plurality of identical basic memory building blocks that are discrete in time and space, where the structure evolves over time according to a local transition rule. Cellular automata can be used in information security as an alternative for classic Feedback Shift Registers (FSRs) for pseudo-random sequence generation. The outputs of a pair of linear FSRs (LFSRs) act as continuous inputs to the two boundaries of a one-dimensional or two-dimensional elementary cellular automata.

Methods and systems for blockchain and smart contract-supported decentralized computation are provided. A computation task from a task initiator node is registered on a blockchain, and assigned to an edge computing node within a decentralized computing network, with task details sent by the task initiator to the edge computing node through a secure peer-to-peer connection. The edge computing node determines a solution to the computation task. The solution may be verified on-chain by a smart contract, and a token reward from the task initiator may be given to the edge computing node by the smart contract correspondingly. The solution may alternatively be verified off-chain by the task initiator node, and a token reward may be given to the edge computing node by the smart contract upon solution verification.

Computing entities in a dynamic, decentralized computing environment are treated as if these computing entities were nodes in a graph linked by edges so as to match these nodes until no further matches are possible. New nodes may dynamically be introduced into the decentralized computing environment and yet various embodiments of the present invention continue to match nodes while inhibiting deadlocks in the decentralized computing environment.

The invention provides a rendering method and system based on a cloud computing chain and a storage medium. The method comprises the following steps: sending a rendering task request to a server node;obtaining rendering task blocks which are executed in parallel; rendering according to rendering task blocks to obtain rendering results; extracting and integrating the rendering results and returning the integrated results to server nodes; actively putting forwarding task requests according to the rendering nodes, reasonably distributing the task blocks generated after task processing and splitting to all the available rendering nodes in a network, providing powerful decentralized computing resources for high-strength computing type tasks through the idle states of the rendering nodes so that data processing efficiency is higher. By the active requests and a distribution matching mechanism, the distribution of the computing tasks is more reasonable, the autonomous rendering nodes withoutdifference is further realized, and the invention can be widely applied to the technical field of distributed computing networks.

The invention discloses a programmable real-time computing and network load sensing method for a distributed computing network, which comprises the following steps of: (1) realizing the computing of anode, the network load and the state collection in a switch chip through a single-node load and state sniffing technology; synchronizing the information to other decentralized computing nodes throughthe reconstructed protocol message; (2) realizing load and state information collection of each node in a network flow transmission process in the switch chip through an end-to-end load and state sniffing technology, carrying the information in the network flow in a stack manner, and collecting the path information at a tail node; and (3) setting a flow acquisition point through calculation, network state acquisition and threshold calculation, thereby realizing analysis of all flows in the monitored network. According to the invention, the real-time load, time delay and jitter perception of the network is realized, and the capability requirements of a decentralized computing network on programmable perception and programmable scheduling are met.

The disclosure relates to zero knowledge third party guarantee of service on a decentralized computing platform. A service running on a server, for example as a cloud server, provides services with aguarantee from a guarantor. The service includes receiving, from a user using a zero-knowledge protocol to ensure privacy of the user, a request for a service with an associated quality level for a fee. Next, the request for service received requires a guarantee of the service requiring additional assurances based on a rating quantity available by a guarantor of the service is identified. At leasta portion of the rating quantity available by the guarantor of the service is received. A notification from the user that the service is unacceptable is received. In response to the notification anda verification that the associated quality level was not met, at least a portion of the fee is refunded to the user from the guarantor of the service.

The invention describes a method for operating an edge cloud computer (ECC) when providing computing power to at least one terminal device, in particular a vehicle (1), the method comprises the following steps: 1) detecting resource information (CI) at an edge cloud computer (ECC), 2) sending the resource information (CI) to at least one terminal device, and 3) providing at least one part of the computing capacity of the edge cloud computer (ECC) to the at least one terminal device according to the resource information (CI).

A method for using cellular automata to generate quality pseudo-random numbers, which may be used in cryptographic and other applications. A cellular automaton is a decentralized computing model that enables the performance of complex computations with the help of only local information. In general, cellular automata comprise a plurality of identical basic memory building blocks that are discrete in time and space, where the structure evolves over time according to a local transition rule. Cellular automata can be used in information security as an alternative for classic Feedback Shift Registers (FSRs) for pseudo-random sequence generation. The outputs of a pair of linear FSRs (LFSRs) act as continuous inputs to the two boundaries of a one-dimensional or two-dimensional elementary cellular automata.