Abstract: A method for extending a blockchain comprises, at a space server: allocating an amount of drive storage for generating proofs-of-space; or accessing a first challenge based on a prior block of the blockchain, the prior block comprising a first proof-of-space and a first proof-of-time; in response to accessing the first challenge, generating a second proof-of-space based on the first challenge and the amount of drive storage, the second proof-of-space indicating allocation of the amount of drive storage; accessing a second proof-of-time based on the prior block and indicating a first time delay elapsed after extension of the blockchain with the prior block; generating a new block comprising the second proof-of-space and the second proof-of-time; and broadcasting the new block over a distributed network.

Abstract: A method for extending a blockchain includes, at a space server in a distributed network: storing a plot file. The method also includes accessing a blockchain: during a current slot in the series of slots, accessing a proof-of-space challenge based on a current slot challenge associated with the current slot and a challenge chain signage point; in response to accessing the proof-of-space challenge, retrieving a proof-of-space based on the proof-of-space challenge and the plot file; calculating a quality-based number of iterations based on the quality of the proof-of-space; generating a block comprising the proof-of-space, the challenge chain signage point, and a reward chain signage point; and broadcasting the block to the distributed network.

Abstract: Disclosed are aspects of an untrusted decentralized computing platform that includes an untrusted decentralized database which participant computing systems within the platform reach consensus on an accepted representation thereof. Some aspects of the databased include one or more directed acyclic graphs, which may include cryptographic hash pointers. Some aspects include an untrusted decentralized database architecture that includes two constituent chains. Some aspects of a consensus layer of the untrusted decentralized computing platform alternate a proof of space with a verifiable delay function to reduce compute resource waste relative to systems reliant on compute sources for proofs of work. In some aspects of a consensus layer alternating the proof-of-space and the proof-of-time, a single difficulty factors may be determined by multiplying their difficulty factors together to generate a single variable which accounts for difficulty for both proofs.

Abstract: A method for extending a blockchain comprises, at a space server: allocating an amount of drive storage for generating proofs-of-space; or accessing a first challenge based on a prior block of the blockchain, the prior block comprising a first proof-of-space and a first proof-of-time; in response to accessing the first challenge, generating a second proof-of-space based on the first challenge and the amount of drive storage, the second proof-of-space indicating allocation of the amount of drive storage; accessing a second proof-of-time based on the prior block and indicating a first time delay elapsed after extension of the blockchain with the prior block; generating a new block comprising the second proof-of-space and the second proof-of-time; and broadcasting the new block over a distributed network.

Abstract: Disclosed are aspects of an untrusted decentralized computing platform that includes an untrusted decentralized database which participant computing systems within the platform reach consensus on an accepted representation thereof. Some aspects of the databased include one or more directed acyclic graphs, which may include cryptographic hash pointers. Some aspects include an untrusted decentralized database architecture that includes two constituent chains. Some aspects of a consensus layer of the untrusted decentralized computing platform alternate a proof of space with a verifiable delay function to reduce compute resource waste relative to systems reliant on compute sources for proofs of work. In some aspects of a consensus layer alternating the proof-of-space and the proof-of-time, a single difficulty factors may be determined by multiplying their difficulty factors together to generate a single variable which accounts for difficulty for both proofs.

Abstract: A method for extending a blockchain comprises, at a space server: allocating an amount of drive storage for generating proofs-of-space; or accessing a first challenge based on a prior block of the blockchain, the prior block comprising a first proof-of-space and a first proof-of-time; in response to accessing the first challenge, generating a second proof-of-space based on the first challenge and the amount of drive storage, the second proof-of-space indicating allocation of the amount of drive storage; accessing a second proof-of-time based on the prior block and indicating a first time delay elapsed after extension of the blockchain with the prior block; generating a new block comprising the second proof-of-space and the second proof-of-time; and broadcasting the new block over a distributed network.

Abstract: Disclosed are aspects of an untrusted decentralized computing platform that includes an untrusted decentralized database which participant computing systems within the platform reach consensus on an accepted representation thereof. Some aspects of the databased include one or more directed acyclic graphs, which may include cryptographic hash pointers. Some aspects include an untrusted decentralized database architecture that includes two constituent chains. Some aspects of a consensus layer of the untrusted decentralized computing platform alternate a proof of space with a verifiable delay function to reduce compute resource waste relative to systems reliant on compute sources for proofs of work. In some aspects of a consensus layer alternating the proof-of-space and the proof-of-time, a single difficulty factors may be determined by multiplying their difficulty factors together to generate a single variable which accounts for difficulty for both proofs.

Abstract: A method for extending a blockchain comprises, at a space server: allocating an amount of drive storage for generating proofs-of-space; or accessing a first challenge based on a prior block of the blockchain, the prior block comprising a first proof-of-space and a first proof-of-time; in response to accessing the first challenge, generating a second proof-of-space based on the first challenge and the amount of drive storage, the second proof-of-space indicating allocation of the amount of drive storage; accessing a second proof-of-time based on the prior block and indicating a first time delay elapsed after extension of the blockchain with the prior block; generating a new block comprising the second proof-of-space and the second proof-of-time; and broadcasting the new block over a distributed network.

Abstract: There is described inter alia a device having a surface comprising a layered coating wherein the outer coating layer comprises a plurality of cationic hyperbranched polymer molecules characterized by having (i) a core moiety of molecular weight 14-1,000 Da (ii) a total molecular weight of 1,500 to 1,000,000 Da (iii) a ratio of total molecular weight to core moiety molecular weight of at least 80:1 and (iv) functional end groups, whereby one or more of said functional end groups have an anti-coagulant entity covalently attached thereto.

Abstract: The method of obtaining methane clathrates consists in the fact that pure methane or methane in a gas mixture not containing hydrocarbons other than methane in amounts not exceeding 1% is contacted with a mixture of alkanes from C7 to C16 and most preferably light paraffin oil containing alkanes from C10 to C14, at a temperature of 5 to 20° C. and absolute pressure above 1 bar, until the solvent is fully saturated.

Abstract: A method for extending a blockchain includes, at a space server in a distributed network: storing a plot file. The method also includes accessing a blockchain: during a current slot in the series of slots, accessing a proof-of-space challenge based on a current slot challenge associated with the current slot and a challenge chain signage point; in response to accessing the proof-of-space challenge, retrieving a proof-of-space based on the proof-of-space challenge and the plot file; calculating a quality-based number of iterations based on the quality of the proof-of-space; generating a block comprising the proof-of-space, the challenge chain signage point, and a reward chain signage point; and broadcasting the block to the distributed network.

Abstract: Disclosed are aspects of an untrusted decentralized computing platform that includes an untrusted decentralized database which participant computing systems within the platform reach consensus on an accepted representation thereof. Some aspects of the databased include one or more directed acyclic graphs, which may include cryptographic hash pointers. Some aspects include an untrusted decentralized database architecture that includes two constituent chains. Some aspects of a consensus layer of the untrusted decentralized computing platform alternate a proof of space with a verifiable delay function to reduce compute resource waste relative to systems reliant on compute sources for proofs of work. In some aspects of a consensus layer alternating the proof-of-space and the proof-of-time, a single difficulty factors may be determined by multiplying their difficulty factors together to generate a single variable which accounts for difficulty for both proofs.

Abstract: Disclosed are aspects of an untrusted decentralized computing platform that includes an untrusted decentralized database which participant computing systems within the platform reach consensus on an accepted representation thereof. Some aspects of the databased include one or more directed acyclic graphs, which may include cryptographic hash pointers. Some aspects include an untrusted decentralized database architecture that includes two constituent chains. Some aspects of a consensus layer of the untrusted decentralized computing platform alternate a proof of space with a verifiable delay function to reduce compute resource waste relative to systems reliant on compute sources for proofs of work. In some aspects of a consensus layer alternating the proof-of-space and the proof-of-time, a single difficulty factors may be determined by multiplying their difficulty factors together to generate a single variable which accounts for difficulty for both proofs.

Abstract: A method for extending a blockchain comprises, at a space server: allocating an amount of drive storage for generating proofs-of-space; or accessing a first challenge based on a prior block of the blockchain, the prior block comprising a first proof-of-space and a first proof-of-time; in response to accessing the first challenge, generating a second proof-of-space based on the first challenge and the amount of drive storage, the second proof-of-space indicating allocation of the amount of drive storage; accessing a second proof-of-time based on the prior block and indicating a first time delay elapsed after extension of the blockchain with the prior block; generating a new block comprising the second proof-of-space and the second proof-of-time; and broadcasting the new block over a distributed network.

Abstract: Disclosed are aspects of an untrusted decentralized computing platform that includes an untrusted decentralized database which participant computing systems within the platform reach consensus on an accepted representation thereof. Some aspects of the databased include one or more directed acyclic graphs, which may include cryptographic hash pointers. Some aspects include an untrusted decentralized database architecture that includes two constituent chains. Some aspects of a consensus layer of the untrusted decentralized computing platform alternate a proof of space with a verifiable delay function to reduce compute resource waste relative to systems reliant on compute sources for proofs of work. In some aspects of a consensus layer alternating the proof-of-space and the proof-of-time, a single difficulty factors may be determined by multiplying their difficulty factors together to generate a single variable which accounts for difficulty for both proofs.

Abstract: A method for extending a blockchain comprises, at a space server: allocating an amount of drive storage for generating proofs-of-space; or accessing a first challenge based on a prior block of the blockchain, the prior block comprising a first proof-of-space and a first proof-of-time; in response to accessing the first challenge, generating a second proof-of-space based on the first challenge and the amount of drive storage, the second proof-of-space indicating allocation of the amount of drive storage; accessing a second proof-of-time based on the prior block and indicating a first time delay elapsed after extension of the blockchain with the prior block; generating a new block comprising the second proof-of-space and the second proof-of-time; and broadcasting the new block over a distributed network.

Abstract: Disclosed are aspects of an untrusted decentralized computing platform that includes an untrusted decentralized database which participant computing systems within the platform reach consensus on an accepted representation thereof. Some aspects of the databased include one or more directed acyclic graphs, which may include cryptographic hash pointers. Some aspects include an untrusted decentralized database architecture that includes two constituent chains. Some aspects of a consensus layer of the untrusted decentralized computing platform alternate a proof of space with a verifiable delay function to reduce compute resource waste relative to systems reliant on compute sources for proofs of work. In some aspects of a consensus layer alternating the proof-of-space and the proof-of-time, a single difficulty factors may be determined by multiplying their difficulty factors together to generate a single variable which accounts for difficulty for both proofs.

Abstract: There is described inter alia a device having a surface comprising a layered coating wherein the outer coating layer comprises a plurality of cationic hyperbranched polymer molecules characterized by having (i) a core moiety of molecular weight 14-1,000 Da (ii) a total molecular weight of 1,500 to 1,000,000 Da (iii) a ratio of total molecular weight to core moiety molecular weight of at least 80:1 and (iv) functional end groups, whereby one or more of said functional end groups have an anti-coagulant entity covalently attached thereto.

Abstract: There is described inter alia a device having a surface comprising a layered coating wherein the outer coating layer comprises a plurality of cationic hyperbranched polymer molecules characterized by having (i) a core moiety of molecular weight 14-1,000 Da (ii) a total molecular weight of 1,500 to 1,000,000 Da (iii) a ratio of total molecular weight to core moiety molecular weight of at least 80:1 and (iv) functional end groups, whereby one or more of said functional end groups have an anti-coagulant entity covalently attached thereto.

Abstract: There is described inter alia a device having a surface comprising a layered coating wherein the outer coating layer comprises a plurality of cationic hyperbranched polymer molecules characterized by having (i) a core moiety of molecular weight 14-1,000 Da (ii) a total molecular weight of 1,500 to 1,000,000 Da (iii) a ratio of total molecular weight to core moiety molecular weight of at least 80:1 and (iv) functional end groups, whereby one or more of said functional end groups have an anti-coagulant entity covalently attached thereto.