Abstract: At least one proof transaction for recording on a blockchain comprises at least an s-part for an Elliptic Curve Digital Signature Algorithm, ECDSA, signature. The s-part is computed from a set of signature components, each provided by a participant of a signing subset of a set of keyshare participants. Each of keyshare participant holds an ephemeral keyshare of an unknown ephemeral key, and each of the signing components is provided by the participant of the signing subset based on their ephemeral keyshare. The at least one proof transaction indicates an r-challenge of at least one challenge transaction, and a node of a blockchain network applies signature verification to: (i) the s-part of the at least one proof transaction, and (ii) one of: (iia) an r-part of the r-challenge, (iib) an r-part of the at least one proof transaction, and in that event checks that that r-part satisfies the r-challenge.

Abstract: In various embodiments, a process for configuring or commissioning a solar power system includes receiving, at a controller, hardware identifiers of a plurality of power electronics modules to be configured. Each of the plurality of power electronics modules of at least a portion of the plurality of power electronics modules is associated with a corresponding photovoltaic panel. A hub is configured to wirelessly communicate with the plurality of power electronics modules. The controller is physically connected to the hub and communicates with the hub via wiring that also carries power from photovoltaic panels to an inverter. The process includes configuring, by the controller, the plurality of power electronics modules using the received hardware identifiers.

Abstract: A computer program for generating an input and an output for a voting transaction for a blockchain for casting a vote, the computer program causes one or more processors to be configured to: receive voting instructions from a vote coordinator comprising one or more public keys and a set of voting options; render a user interface displaying the voting options; receive a user selection of one of the voting options; and generate an input-output pair for inclusion in a voting transaction; wherein a non-signature portion of the input comprises an outpoint identifying an unspent transaction output, and a signature portion of the input comprises a signature single flag and an associated signature signing at least the non-signature portion of the input-output pair and the output of the input-output pair but not any other output of the voting transaction, and the output of the input-output pair comprises one of public keys.

Abstract: Disclosed herein are adjuvanted protein vaccines comprising: a SARS-CoV-2 variant C.1.2 modified S1 Spike protein sequence and a non-phospholipid liposome, wherein the protein is encapsulated within the non-phospholipid liposome. The adjuvanted protein vaccines are suitable for subcutaneous administration. Also disclosed herein are modified spike protein sequences containing SARS-CoV-2 variant C.1.2 modified S1 Spike proteins and methods of use of the vaccines and sequences.

Abstract: Systems and methods for generating min-increment counting bloom filters to determine count and frequency of device identifiers and attributes in a networking environment are disclosed. The system can maintain a set of data records including device identifiers and attributes associated with device in a network. The system can generate a vector comprising coordinates corresponding to counter registers. The system can identify hash functions to update a counting bloom filter. The system can hash the data records to extract index values pointing to a set of counter registers. The system can increment the positions in the min-increment counting bloom filter corresponding to the minimum values of the counter registers. The system can obtain an aggregated public key comprising a public key. The system can encrypt the counter registers using the aggregated shared key to generate an encrypted vector. The system can transmit the encrypted vector to a networked worker computing device.

Abstract: A method of recording a target transaction in a blockchain, comprising: obtaining an updated version of the target transaction, being updated relative to a pre-existing first version; and instead of the first version, sending the updated version to be propagated through a network of nodes to be recorded in the blockchain. The target transaction comprises an input comprising an unlocking script and a pointer to an output of a first transaction, the output of the first transaction comprising a locking script specifying a plurality of alternative conditions for unlocking that output. The unlocking script of the first version of the target transaction is configured to unlock the first output of the first transaction based on a first of said alternative conditions, and the unlocking script of the updated version is configured to unlock it based on a second one of said alternative conditions.

Abstract: When cementing tubing in a borehole, a wet shoe track is created, and pressure testing of the tubing is performed. To do this, a wiper plug seats in a seat of an insert disposed in a first position in a flow bore of a tool. The insert is released and moved toward a second position in the flow bore in response to the first pressure applied against the seated wiper plug. A collar disposed on the wiper plug seats on a second seat disposed uphole of the first seat. The tubing is pressure tested by applying pressure down the tubing against the wiper plug with the collar seated in the second seat. Fluid communication is then established through the flow bore downhole of the wiper plug, the first seat, and the second seat by removing the collar from the wiper plug. This can create the wet shoe track.

Abstract: Systems and methods for generating min-increment counting bloom filters to determine count and frequency of device identifiers and attributes in a networking environment are disclosed. The system can maintain a set of data records including device identifiers and attributes associated with device in a network. The system can generate a vector comprising coordinates corresponding to counter registers. The system can identify hash functions to update a counting bloom filter. The system can hash the data records to extract index values pointing to a set of counter registers. The system can increment the positions in the min-increment counting bloom filter corresponding to the minimum values of the counter registers. The system can obtain an aggregated public key comprising a public key. The system can encrypt the counter registers using the aggregated shared key to generate an encrypted vector. The system can transmit the encrypted vector to a networked worker computing device.

Abstract: Systems and methods for generating min-increment counting bloom filters to determine count and frequency of device identifiers and attributes in a networking environment are disclosed. The system can maintain a set of data records including device identifiers and attributes associated with device in a network. The system can generate a vector comprising coordinates corresponding to counter registers. The system can identify hash functions to update a counting bloom filter. The system can hash the data records to extract index values pointing to a set of counter registers. The system can increment the positions in the min-increment counting bloom filter corresponding to the minimum values of the counter registers. The system can obtain an aggregated public key comprising a public key. The system can encrypt the counter registers using the aggregated shared key to generate an encrypted vector. The system can transmit the encrypted vector to a networked worker computing device.

Abstract: Disclosed herein are immunogenic compositions (e.g., vaccines) and methods of using and preparing the same. In some embodiments, the immunogenic compositions are suitable for use in treating or preventing an infectious disease, such as SARS-CoV-2 or HIV.

Abstract: When cementing tubing in a borehole, a wet shoe track is created, and pressure testing of the tubing is performed. To do this, a wiper plug seats in a seat of an insert disposed in a first position in a flow bore of a tool. The insert is released and moved toward a second position in the flow bore in response to the first pressure applied against the seated wiper plug. A collar disposed on the wiper plug seats on a second seat disposed uphole of the first seat. The tubing is pressure tested by applying pressure down the tubing against the wiper plug with the collar seated in the second seat. Fluid communication is then established through the flow bore downhole of the wiper plug, the first seat, and the second seat by removing the collar from the wiper plug. This can create the wet shoe track.

Abstract: Systems and methods for generating min-increment counting bloom filters to determine count and frequency of device identifiers and attributes in a networking environment are disclosed. The system can maintain a set of data records including device identifiers and attributes associated with device in a network. The system can generate a vector comprising coordinates corresponding to counter registers. The system can identify hash functions to update a counting bloom filter. The system can hash the data records to extract index values pointing to a set of counter registers. The system can increment the positions in the min-increment counting bloom filter corresponding to the minimum values of the counter registers. The system can obtain an aggregated public key comprising a public key. The system can encrypt the counter registers using the aggregated shared key to generate an encrypted vector. The system can transmit the encrypted vector to a networked worker computing device.

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: 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 method of executing a transaction of a blockchain. The transaction comprises at least one output comprising a locking script, and the locking script comprises an instance of a first opcode and one or more instances of a second opcode. Each instance of the second opcode separates portions of the locking script. Upon calling the instance of the first opcode, a first data element is read from at least one stack, the first data element being generated during execution of the locking script with an unlocking script of a different transaction. A first part of the locking script that follows an instance of the second opcode corresponding to the first data element is output.

Abstract: A computer-implemented method of encoding a digital contract between first and second parties of a blockchain network, the digital contract being for transferring an amount of a digital asset from the first to the second party based on a condition being fulfilled; the method comprising: obtaining a plurality of data elements, each representing a different contract condition, wherein at least one of the conditions is linked to the second party; generating a hash tree based on the data elements, wherein the hash tree comprises: i) first leaf hashes generated by hashing a respective data element, and second leaf hashes comprising at least one hash key generated by hashing a secret value known only to the trusted third party, ii) internal hashes, and iii) a root hash; and making the root hash available to the first party for inclusion in a transaction of the blockchain.

Abstract: A method of executing transactions of a blockchain network. A first transaction comprises at least a first output comprising a first locking script of a stack-based scripting language, the first locking script comprising a portion of the first locking script to be executed before a first instance of an opcode is executed. A second transaction comprises a first unlocking script that references the first output in the first transaction. Upon executing the first instance of the opcode, execution of the first locking script is terminated whilst not invalidating the first transaction. A first data element is read from at least one stack, wherein the first data element is generated during execution of the first unlocking script and the portion of the first locking script. The first data element as read from the at least one stack is supplied to an off-chain function, wherein the function is configured to generate a result based on at least said first data element.

Abstract: A method of validating transactions for recordal in a blockchain comprises receiving one or more transactions at a node of a blockchain network. For each received transaction a protocol for validating the transaction is applied. The protocol is configured to allow a termination opcode to be included in an output script of the transaction. The termination opcode is configured to, upon being executed by the node, a) terminate execution of the output script, and b) not to invalidate the transaction based only on the inclusion of the termination opcode in the output script. The protocol is also configured to disallow any instance of the termination opcode from being included in an input script of the transaction, said disallowing comprising the node at least invalidating the transaction if any instance of the termination opcode is included in the input script.

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 procedure comprising: a) formulating a proposed instance of a first transaction and sending it to the second party over a side channel, the proposed instance being formulated according to a transaction protocol recognized by the nodes of a blockchain network for validating transactions, and specifying a set of one or more values of a respective one or more parameters of the transaction including at least said amount of the digital asset, b) upon the second party not accepting the proposed instance of the first transaction, receiving back over the side channel a counter-proposed instance of the first transaction, the counter-proposed instance also being formulated according to the transaction protocol, but specifying a modified set of one or more values of the one or more transaction parameters, and c) the first party selecting whether to accept the counter-proposed instance received in b).