Abstract: According to a first aspect of the disclosure, there is provided a request-response protocol for requesting access to data from a destination transaction. According to a second aspect of the disclosure, there is provided a method of accessing data from one or more destination transactions stored on a blockchain, wherein the method comprises selecting one or more hyperlinks linking to the destination transaction(s).

Abstract: According to a first aspect of the disclosure, there is provided a method of accessing data from one or more destination transactions stored on a blockchain, wherein the method comprises selecting one or more hyperlinks linking to the destination transaction(s). According to a second aspect of the disclosure, there is provided a request-response protocol for requesting access to data from a destination transaction.

Abstract: A method comprising: retrieving a header file from a first transaction recorded on a blockchain maintained across a plurality of nodes of a blockchain network. The header file comprises: program header information, and reference information comprising one or more respective transaction IDs of one or more respective second transactions stored on the blockchain. Each second transaction comprises a respective section of a body of the program file, at least one of the sections comprising runnable program code. The method comprises, from the blockchain, retrieving the respective section of the program file from at least one of the second transactions based on the reference information; and running a program comprising the program header information and the at least one retrieved section.

Abstract: A method performed by computer equipment of a consuming party, comprising: accessing an electronic document comprising a plurality of pointers, each pointer comprising a respective transaction identifier of a respective destination transaction stored on a blockchain, wherein the destination transactions comprise one or more first transactions storing respective genetic data of at least part of a reference genome, and one or more second transactions storing respective genetic data of at least a corresponding part of a target genome in compressed form compressed relative to the reference genome; accessing the genetic data from at least one of the first destination transactions and at least a corresponding one of the second destination transactions based on the respective identifiers accessed from the electronic document; and decompressing the accessed genetic data of the target genome based on the accessed genetic data of the reference genome.

Abstract: According to a first aspect of the disclosure, there is provided a method of accessing data from one or more destination transactions stored on a blockchain, wherein the method comprises selecting one or more hyperlinks linking to the destination transaction(s). According to a second aspect of the disclosure, there is provided a request-response protocol for requesting access to data from a destination transaction.

Abstract: A computer-implemented method of linking a first party and a second party, the method being performed by the first party and comprising: obtaining a first cryptographic public-private key pair comprising a first private key and a corresponding first public key; generating a first shared private key pair known to the first party and the second party; and generating a second cryptographic public-private key pair comprising a second private key and a corresponding second public key, wherein the second private key is generated based on the first private key and the shared private key.

Abstract: A method performed by a node of a blockchain network, comprising: accessing the locking script from a first transaction on the blockchain; receiving a second transaction not yet on-chain, the second transaction comprising an unlocking script; extracting from the first transaction or another transaction on the blockchain, a portion of code formulated in a second language other than a first language used for the locking and unlocking scripts; running the extracted portion of code in the second language, wherein as a result thereof the code generates at least one value; writing this value to a storage location readable by the locking script; and running the locking script together with the unlocking script in order to validate the second transaction, wherein the unlocking script is configured to read the first value from said storage location, and a condition for validation according to the locking script is dependent on the first value.

Abstract: At least one proof transaction is received at a node of a blockchain network and comprises at least one Elliptic Curve Digital Signature Algorithm (ECDSA) signature and at least one zero-knowledge proof (ZKP) component. The node verifies the ECDSA signature of the at least one proof transaction based on a public key associated with the ECDSA signature and a signed part of the at least one proof transaction, and determined whether the ZKP component is correct for the ECDSA signature and a defined hash value and a defined hash function, in that it proves an ephemeral key counterpart to an r-part of the ECDSA signature to be a preimage of the defined hash value with respect to the defined hash function.

Abstract: A computer-implemented method comprising, at a verifying nodes of a blockchain network: obtaining a first transaction which comprises runnable code; receiving a second transaction which includes information comprising at least a submitted instance of an r-part and an s-part of a first ECDSA signature, and further comprising a nonce; and miming the code from the first transaction. The code is configured to verify that HPoW(ƒ(r, d)) meets a predetermined condition defined in the code, and to return a result of true on condition thereof, where r is the submitted instance of the r-part, d is the nonce, HPoW is a hash function, and f is a function combining q and d.

Abstract: A knowledge proof is performed using a set of transactions for recording in a blockchain maintained in a blockchain network. A challengee receives a competition challenge. The competition challenge has a derivable challenge solution but the challenge solution is not communicated to the challengee directly. The challengee competes with one or more other challengees to derive an independent instance of the challenge solution from the competition challenge. Upon the challengee successfully deriving the independent instance of the challenge solution before any of the other one or more challengees, the challengee uses data thereof as a secret challengee key to sign at least one message, and thereby generate at least one transaction signature, and submits the at least one transaction signature and the at least one message to the blockchain network for verifying at a node of the blockchain network.

Abstract: A method comprising, at a node of a blockchain network: obtaining a first transaction including runnable code specifying a reference instance of an r-part of ant ECDSA signature; receiving a second transaction including information comprising at least an s-part of the ECDSA signature, and obtaining a public key wherein the ECDSA signature signs a message based on a corresponding private key; and running the code from the first transaction, the code being configured to return a result of true, irrespective of whose private key was used as the first private key, on condition that: the ECDSA verification function, as applied to the ECDSA signature, verifies that the s-part received in the second transaction corresponds to the reference instance of the r-part specified by the first transaction, given the message received in the second transaction and the obtained first public key.

Abstract: At a node of a blockchain network: obtaining a first transaction which including runnable code, including reference data for evaluating a challenge defined based on a joint r-value rjoint; receiving one or more second transactions including information comprising an r-part ri and s-part si of each of a pair of ECDSA signatures (i=1, 2), each signing part of one of the one or more second transactions based on a respective first private key Vi corresponding to a respective first public key Pi; and running the code. The code verifies whether the challenge is met based on the reference data and the r-parts ri. The challenge comprises a criterion that: R1+R2=(?2?rjoint) mod p, where rjoint=[Rjoint]x, Rjoint=R1+R2, p is a prime modulus, (Formula (I)) mod p, Ri=ki. G, xi=[Ri]x, Yi=[Ri]y, ki is an ephemeral key, and G is an elliptic curve generator point.

Abstract: A method comprising: a second party receiving confirmation that a first party agrees to a statement; the second party receiving a piece of information after said confirmation, and after a cryptographic signature of the first party. To attest to this, the second party generates their own cryptographic signature by signing a portion of data comprising said piece of information or a transformation thereof. A network of nodes is then sent one or more transactions comprising the first and second signatures. Transactions are propagated across the network to be recorded in a blockchain on condition of meeting a validation condition. The validation condition for one of the one or more transactions comprises: the first signature is included in one of the one or more transactions, the second signature is included in one of the one or more transactions, and the second signature was generated by signing the particular portion of data.