Abstract: The present disclosure discloses a planar magnetic element and a manufacturing method thereof. The planar magnetic element includes: a housing, with an internal space; a core, accommodated in the internal space of the housing, and the core including at least one limb; at least one planar winding corresponding to the limb; and potting adhesive, filled in all air gaps in the internal space of the magnetic element, and blocking the clearance and creepage path between the planar winding and the core and/or between the two planar windings. The present disclosure may significantly reduce the volume of the magnetic element and greatly increase the partial discharge extinction voltage, thereby reducing the partial discharge risk of the magnetic element and improving the reliability. Moreover, the compact structure of the planar magnetic element is conducive to improving the power density of the module.

Abstract: Disclosed is a method for constructing an emergency reporting system of vehicle networking based on multi-signatures, which comprises the following steps: initializing an emergency reporting system to obtain a public-private key pair and pre-calculation parameters of a vehicle set; obtaining authentication information of the emergency based on the public-private key pair and the pre-calculation parameters; integrating the authentication information to obtain multi-signatures of the emergency; and completing the system construction by regulating a traffic state based on the multi-signatures. The method realizes the efficient signature generation function of the vehicle with limited computing resources, reduces the communication pressure and computing pressure of roadside units, and may effectively prevent the common rogue key attacks in other schemes.

Abstract: Disclosed is a method for constructing an emergency reporting system of vehicle networking based on multi-signatures, which comprises the following steps: initializing an emergency reporting system to obtain a public-private key pair and pre-calculation parameters of a vehicle set; obtaining authentication information of the emergency based on the public-private key pair and the pre-calculation parameters; integrating the authentication information to obtain multi-signatures of the emergency; and completing the system construction by regulating a traffic state based on the multi-signatures. The method realizes the efficient signature generation function of the vehicle with limited computing resources, reduces the communication pressure and computing pressure of roadside units, and may effectively prevent the common rogue key attacks in other schemes.

Abstract: Nodes determine a first measure of difficulty for a first branch of a split blockchain and a second measure of difficulty for a second branch of the split blockchain. The first measure of difficulty is based on a measure of block generation frequency of each node that mined for the split blockchain during a window that comprises blocks of the first branch. The second measure of difficulty is based on a measure of block generation frequency of each node that mined for the split blockchain during a window that comprises blocks of the second branch. One of the first branch and the second branch is identified as a legitimate branch based on a comparison of the first measure of difficulty and the second measure of difficulty.

Abstract: A record of authorization including user information is received and appended to a blockchain. The record of authorization authorizes access by a third-party application to the user information for an access duration. The user information is encrypted by a group key and access duration is based on a change to the group key. The group key comprises a public/private key pair, and the access duration is implemented by an authorization group of nodes having the group key. The group key corresponds to either a valid group key at or near the start of the access duration, that enables decryption of a message in the record of authorization that includes the user information, or an incompatible group key at or after the end of the access duration, that does not enable decryption of the message in the record of authorization that includes the user information.

Abstract: A nitrogen-containing polycyclic fused ring compound of formula I, a pharmaceutical composition thereof, a preparation method therefor and use thereof are related to the field of medicinal chemistry. The compound can be used as a selective and effective RET inhibitor. It has strong inhibitory effect on the RET gatekeeper residue mutant RET V804M, RET solvent-front residue mutant RET G810R and other clinically relevant RET mutants, as well as RET wt. The compound can also inhibit the growth of TT cell line derived from thyroid cancer and Ba/F3 cells transformed with various RET mutants, and induce the death of TT cells.

Abstract: The current disclosure is directed towards providing methods and mechanisms enabling computationally efficient cross-chain messaging and message validation between subchains of a large-scale decentralized network. In one example, the current disclosure provides for determining if a message generated by a first subchain, received at a second subchain, represents a valid, consensually generated message of the first subchain, by comparing the received message with a public-key-share list of the first subchain stored in the second subchain. In one example, the current disclosure provides for a method comprising receiving a first message from a first subchain at a smart contract of a second subchain, wherein the smart contract of the second subchain comprises a public-key-share list of the first subchain, determining if the first message is valid based on the public-key-share list, and executing a transaction based on the first message responsive to the first message being determined valid.

Abstract: The current disclosure is directed towards efficiently generating random sequences on a large-scale peer-to-peer network. In one example, the disclosure provides for selecting a first node based on a block generation order, where the first node is selected to generate a current block, adding a first signature share of the first node to the current block, adding at least a second signature share from a previously selected node to the current block, generating a random sequence based on the first signature share and the second signature share, adding the random sequence to the current block, and publishing the current block to a blockchain maintained by a node pool. In this way, a random sequence may be generated on-chain, with linear messaging complexity, without relying on a single trusted party/apparatus, which may thereby decrease a probability of any single party controlling the random sequence produced.

Abstract: Nodes determine a first measure of difficulty for a first branch of a split blockchain and a second measure of difficulty for a second branch of the split blockchain. The first measure of difficulty is based on a measure of block generation frequency of each node that mined for the split blockchain during a window that comprises blocks of the first branch. The second measure of difficulty is based on a measure of block generation frequency of each node that mined for the split blockchain during a window that comprises blocks of the second branch. One of the first branch and the second branch is identified as a legitimate branch based on a comparison of the first measure of difficulty and the second measure of difficulty.

Abstract: An apparatus and method control access to user information by generating a record of user information that includes the user information and appending the record of user information to a blockchain. A hash is assigned to the user information and the record of user information is encrypted prior to appending the record of user information to the blockchain. A record of authorization is received and appended to the blockchain. The record of authorization includes the user information, an identification of a third-party application authorized to read the record of authorization, and an access expiration parameter that places a restriction or limitation on access to the user information.

Abstract: An apparatus and method control access to user information by generating a record of user information that includes the user information and appending the record of user information to a blockchain. A hash is assigned to the user information and the record of user information is encrypted prior to appending the record of user information to the blockchain. A record of authorization is received and appended to the blockchain. The record of authorization includes the user information, an identification of a third-party application authorized to read the record of authorization, and an access expiration parameter that places a restriction or limitation on access to the user information.

Abstract: A processing node receives a finality proposal for a subject block within a blockchain. The finality proposal including an identifier of the subject block and one or more measures, wherein each of the one or more measures is based on the number of blocks within the blockchain that were mined by a respective node within the network of nodes other than the processing node. The processing node determines the subject block is a finalized block when a value based on the one or more measures satisfies a finality criterion. When the value fails to satisfy the finality criterion, the processing node transmits a subsequent finality proposal for the subject block. The subsequent finality proposal includes the identifier of the subject block, the one or more measures from the finality proposal, and an additional measure based on the number of blocks within the blockchain that were mined by the processing node.

Abstract: Nodes determine a first measure of difficulty for a first branch of a split blockchain and a second measure of difficulty for a second branch of the split blockchain. The first measure of difficulty is based on a measure of block generation frequency of each node that mined for the split blockchain during a window that comprises blocks of the first branch. The second measure of difficulty is based on a measure of block generation frequency of each node that mined for the split blockchain during a window that comprises blocks of the second branch. One of the first branch and the second branch is identified as a legitimate branch based on a comparison of the first measure of difficulty and the second measure of difficulty.

Abstract: A record of authorization including user information is received and appended to a blockchain. The record of authorization authorizes access by a third-party application to the user information for an access duration. The user information is encrypted by a group key and access duration is based on a change to the group key. The group key comprises a public/private key pair, and the access duration is implemented by an authorization group of nodes having the group key. The group key corresponds to either a valid group key at or near the start of the access duration, that enables decryption of a message in the record of authorization that includes the user information, or an incompatible group key at or after the end of the access duration, that does not enable decryption of the message in the record of authorization that includes the user information.

Abstract: A processing node receives a finality proposal for a subject block within a blockchain. The finality proposal including an identifier of the subject block and one or more measures, wherein each of the one or more measures is based on the number of blocks within the blockchain that were mined by a respective node within the network of nodes other than the processing node. The processing node determines the subject block is a finalized block when a value based on the one or more measures satisfies a finality criterion. When the value fails to satisfy the finality criterion, the processing node transmits a subsequent finality proposal for the subject block. The subsequent finality proposal includes the identifier of the subject block, the one or more measures from the finality proposal, and an additional measure based on the number of blocks within the blockchain that were mined by the processing node.

Abstract: A mechanism for managing a decentralized application functioning within an application shard in a decentralized network includes an access control mechanism and a resource control mechanism. The access control mechanism includes access logic that determines if a request to submit a transaction for execution by the decentralized application is valid. The request is received from an originator through the decentralized application. The resource control mechanism is called when a request is determined by the access control mechanism to be a valid request. The resource control mechanism includes resource logic that determines if a criterion is satisfied. The criterion may include one or more of a first criterion associated with the originator and a second criterion associated with the application shard. The resource control mechanism further includes forwarding logic that initiates a forwarding of the validated request to the application shard if the criterion is satisfied.

Abstract: The current disclosure is directed towards efficiently generating random sequences on a large-scale peer-to-peer network. In one example, the disclosure provides for selecting a first node based on a block generation order, where the first node is selected to generate a current block, adding a first signature share of the first node to the current block, adding at least a second signature share from a previously selected node to the current block, generating a random sequence based on the first signature share and the second signature share, adding the random sequence to the current block, and publishing the current block to a blockchain maintained by a node pool. In this way, a random sequence may be generated on-chain, with linear messaging complexity, without relying on a single trusted party/apparatus, which may thereby decrease a probability of any single party controlling the random sequence produced.

Abstract: Nodes determine a first measure of difficulty for a first branch of a split blockchain and a second measure of difficulty for a second branch of the split blockchain. The first measure of difficulty is based on a measure of block generation frequency of each node that mined for the split blockchain during a window that comprises blocks of the first branch. The second measure of difficulty is based on a measure of block generation frequency of each node that mined for the split blockchain during a window that comprises blocks of the second branch. One of the first branch and the second branch is identified as a legitimate branch based on a comparison of the first measure of difficulty and the second measure of difficulty.

Abstract: An apparatus and method control access to user information by generating a record of user information that includes the user information and appending the record of user information to a blockchain. A hash is assigned to the user information and the record of user information is encrypted prior to appending the record of user information to the blockchain. A record of authorization is received and appended to the blockchain. The record of authorization includes the user information, an identification of a third-party application authorized to read the record of authorization, and an access expiration parameter that places a restriction or limitation on access to the user information.

Abstract: A packet including a message intended for a smart contract associated with the second subchain and a node identifier is constructed at each of a plurality of nodes associated with the first subchain. The message constructed by the plurality of nodes are identical and may be a transaction request requesting the smart contract to execute on a blockchain. Each of the packets is sent to one or more nodes associated with the second subchain. The packets and messages received by one or more of a plurality of nodes associated with the second subchain are monitored and processed at the second subchain to determine if a consensus on request has been reached from the first subchain. If a consensus on request has been reached from the first subchain, the smart contract associated with the second subchain executes on the blockchain in accordance with the transaction request.