Настройки

Укажите год
-

Небесная энциклопедия

Космические корабли и станции, автоматические КА и методы их проектирования, бортовые комплексы управления, системы и средства жизнеобеспечения, особенности технологии производства ракетно-космических систем

Подробнее
-

Мониторинг СМИ

Мониторинг СМИ и социальных сетей. Сканирование интернета, новостных сайтов, специализированных контентных площадок на базе мессенджеров. Гибкие настройки фильтров и первоначальных источников.

Подробнее

Форма поиска

Поддерживает ввод нескольких поисковых фраз (по одной на строку). При поиске обеспечивает поддержку морфологии русского и английского языка
Ведите корректный номера.
Ведите корректный номера.
Ведите корректный номера.
Ведите корректный номера.
Укажите год
Укажите год
Применить Всего найдено 9. Отображено 9.
02-11-2022 дата публикации

Subtree-based storage and retrieval of merkle tree data

Номер: GB0002606196A
Автор: STEVEN PATRICK COUGHLAN [GB], WEI ZHANG [GB]
Принадлежит:

A method for recording Merkle tree data in a page-structured memory involves determining hash values for nodes of a Merkle tree constructed from an ordered set of transaction identifiers for a block in a blockchain 804. The hash tree is partitioned into a plurality of non-overlapping subtrees 806, each subtree including at least two child nodes and a parent node. The hash values for nodes of each subtree are stored in a respective one of the pages in the page-structured memory 808. The hash values of the nodes of one of the subtrees and a hash value for the subtree root node of a paired subtree adjacent to the subtree may be stored in the same page of memory, where the subtree and the paired subtree have a common parent node.

Подробнее
Номер записи: 1
01-11-2023 дата публикации

Protocol for communicating compact scripts

Номер: GB0002618105A
Автор: STEVEN PATRICK COUGHLAN [GB], WEI ZHANG [GB], ALESSIO PAGANI [GB], BASSEM AMMAR [GB]
Принадлежит:

In a blockchain network, transactions are written in a compact script. The compact script contains an identifier of a high-level reference library. The high-level library contains functions written in a high-level scripting language. The compact script calls functions in the library using intermediate level functions. The library may be stored in a library transaction on the blockchain. The identifier of the library may be a hash of the library. Identifiers of transactions with compact scripts may be generated by expanding the intermediate level functions using the library and generating a hash of the expanded script. The intermediate level functions may be expanded by translating the corresponding high-level function to a low-level native script and replacing the intermediate level function with the native script.

Подробнее
Номер записи: 2
14-12-2022 дата публикации

Computer-implemented method and system

Номер: GB0002607618A
Автор: STEVEN PATRICK COUGHLAN [GB], OWEN VAUGHAN [GB]
Принадлежит:

A blockchain implemented method of endorsing the authenticity of at least one token in a token transaction that is an element in a chain of token transactions originating from a minting transaction used by an issuer to generate the token by providing at least one token certification element which certifies that the token was generated by the issuer. The certification element may be provided in the token transaction by the issuer or a party authorised by the issuer. The certification element may include proof of a secret known to or associated with the issuer, or cryptographic data, where the cryptographic data may be a cryptographic key, signature, digitally signed message or other cryptographic element associated with the issuer. The certification element may be provided in the token transaction in a script of the transaction or as metadata in a script on an output or following an instruction or code which renders the token transaction unspendable.

Подробнее
Номер записи: 3
27-10-2021 дата публикации

Block propagation with poisoned transactions in a blockchain network

Номер: GB0002594295A
Автор: STEVEN PATRICK COUGHLAN [GB], STEVEN PATRICK COUGHLAN, Steven Patrick Coughlan
Принадлежит:

In traditional proof of work (POW) blockchains successful blocks must be propagated to other miners for checking to achieve consensus. As blocks get bigger transmission delays increase leading to more ‘double winners’ and forking. Previously, (e.g. GB2582978) flooding blocks from all miners before the POW succeeds to reduce post success latencies is suggested. Here, it is recognised that other miners can copy validated transactions from these speculative blocks. Thereby avoiding validation work/effort and acting unfairly. The invention poisons the transmitted early blocks by hiding deliberate errors/invalid transactions in them, so that transactions cannot be reliably copied without revalidation. This destroys the value of the early blocks to other miners. As claimed encrypted corrections are included with the poisoned block and the decryption key is transmitted by the successful miner to facilitate checking by other miners. In embodiments, other miners validate early blocks to find errors ...

Подробнее
Номер записи: 4
02-11-2022 дата публикации

Methods and devices for enabling single page retrieval of merkle tree data

Номер: GB0002606195A
Автор: STEVEN PATRICK COUGHLAN [GB], WEI ZHANG [GB]
Принадлежит:

A method for recording Merkle tree data in a page-structured memory having a defined page size includes constructing a Merkle tree from a set of transaction identifiers, the Merkle tree having hash values for each node of the Merkle tree and having a lowest portion containing a plurality of layers including a bottom layer containing the set of transaction identifiers. The lowest portion of the Merkle tree is partitioned into a plurality of nonoverlapping subtrees. For each subtree, intermediate paired nodes for a Merkle proof from a root of the subtree to a Merkle root of the Merkle tree are identified, and the hash values for each subtree and its intermediate paired nodes are stored in a respective one of the pages in the page-structured memory. The transaction identifiers may correspond to a block in a blockchain. Storing the hash tree data in this way allows retrieval of the data necessary for a Merkle proof by retrieving a single page of memory.

Подробнее
Номер записи: 5
01-11-2023 дата публикации

Messaging protocol for compact script transactions

Номер: GB0002618106A
Автор: STEVEN PATRICK COUGHLAN [GB], WEI ZHANG [GB], ALESSIO PAGANI [GB], BASSEM AMMAR [GB]
Принадлежит:

Computer-implemented methods of transmitting blockchain transactions to nodes are disclosed, wherein a compact transaction is a blockchain transaction comprising a compact script (CS) at least partly written in a high-level (HL) scripting language, and the CS is configured to perform an operation equivalent to an expanded script (ES) written in the low-level (LL) scripting language. The method performed by a CS-enabled node comprises: obtaining a set of compact transactions; transmitting one or more of the set of compact transactions to at least one other CS-enabled node; converting one or more of the set of compact transactions to one or more respective expanded transactions, wherein said converting comprises, for a given compact transaction, replacing the CS of that compact transaction with an equivalent ES; and transmitting the one or more expanded transactions to at least one CS-disabled node. The method performed by a CS-disabled node comprises: obtaining a compact transaction; determining ...

Подробнее
Номер записи: 6
02-11-2022 дата публикации

Devices and methods for consolidating serialized tokens

Номер: GB0002606216A
Автор: STEVEN PATRICK COUGHLAN [GB], WEI ZHANG [GB], CHLOE CEREN TARTAN [GB]
Принадлежит:

A method of consolidating tokens in a token system, such as tokens representing ownership of fungible entities. Each token has a serial number comprising a denomination code, a root identifier, and a leaf identifier allocated to the denomination code. The tokens to be consolidated represent denominations selected from a defined ordered set of denominations that, when summed, equate to a larger denomination from the set. For example, the tokens may represent fiat currency banknotes wherein two £10 tokens are consolidated into a single £20 token. A candidate root identifier and candidate leaf identifier allocated to the larger denomination are identified. If the combination of the identified root and leaf identifiers are available for use, a new token is generated having a new serial number containing the identified root and leaf identifiers and a denomination code corresponding to the larger denomination. An issuer is notified of the consolidation and deactivation of the smaller denomination ...

Подробнее
Номер записи: 7
06-10-2021 дата публикации

Methods and devices for double-spend relay in a blockchain network

Номер: GB0002593779A
Автор: STEVEN PATRICK COUGHLAN [GB], STEVEN PATRICK COUGHLAN, Steven Patrick Coughlan
Принадлежит:

Relaying double-spend attempt notifications in a blockchain network. A double-spend notification is received from a node in the blockchain network, such as a mining node that has detected a double-spending attempt. The notification contains two transaction identifiers and is signed by a miner identifier. Transaction data is obtained for the two transactions associated with the identifiers. A determination is made as to whether the two transactions have at least one matching input. If they do have a matching input, the double-spend notification is confirmed as valid and it is transmitted/relayed to at least one other node in the network. Otherwise, the notification is invalid and is not propagated. Invalid notifications may have a negative impact on a reputation score of the associated miner. A repudiation notice may be generated by a node that determines a double-spend notification is invalid.

Подробнее
Номер записи: 8
02-11-2022 дата публикации

Methods and devices for pruning stored merkle tree data

Номер: GB0002606194A
Автор: STEVEN PATRICK COUGHLAN [GB], WEI ZHANG [GB]
Принадлежит:

A method for storing Merkle tree data in a page-structured memory having a defined page size for storage and retrieval of data includes storing, in the page-structure memory, hash values for a Merkle tree constructed from an ordered set of transaction identifiers in a subtree-based format 1202. The hash tree is partitioned into subtrees including upper subtrees and lower subtrees. When it is determined that the Merkle tree data is to be pruned 1204, at least a portion of the plurality of lower subtrees is deleted from the page-structured memory 1210. The transaction identifiers may correspond to a block in a blockchain. The decision to prune the data may be based on the age of the block or determining that the frequency of related Merkle proof requests is below a threshold. If the leaf nodes, i.e. the transaction identifiers, are to be pruned, the identifiers may be stored elsewhere.

Подробнее
Номер записи: 9