CN112163036A

CN112163036A - Block chain information construction and query method and related device

Info

Publication number: CN112163036A
Application number: CN202010955277.5A
Authority: CN
Inventors: 薛立滨; 王晓煜
Original assignee: Taikang Insurance Group Co Ltd
Current assignee: Taikang Insurance Group Co Ltd
Priority date: 2020-09-11
Filing date: 2020-09-11
Publication date: 2021-01-01

Abstract

The application discloses a block chain information construction and query method and a related device. The method is used for solving the problem that the will information in the block chain still has high risk of being tampered. In the application, each will expand multiple copies, and simultaneously, each copy information has a corresponding unique identifier and can be stored in multiple blocks in a scattered manner, so that the indication information of the forward data sub-packet of the same will information can be stored in each block in order to retrieve multiple data sub-packets of the same will information, and thus, a complete piece of will information can be obtained. The will order information is dispersed and stored in a plurality of blocks after being expanded, the data volume of the will order information is increased and distributed in a plurality of blocks, a plurality of pieces of the will order information of the same will order information must be successfully tampered and used, at least one piece of the will order information is available, or one data packet is failed to be tampered, the tampering is failed. Therefore, the safety and the anti-tampering capability of the will information are improved.

Description

Block chain information construction and query method and related device

Technical Field

The present disclosure relates to the field of block chain technologies, and in particular, to a method and a device for constructing and querying block chain information.

Background

The conventional method for recording the legacy advice is not enough in digitalization degree or cannot ensure that the legacy advice is not tampered, records the legacy advice of the old people, prevents tampering, reflects the willingness of the old people, ensures the realization of the wish, and is really an important aspect of the emotional requirements of the old people.

In the related technology, the Internet technology, the block chain technology and other information technologies can be used for setting up the non-falsifiable advice records in the elderly community, so that the will of the old is reflected. However, the inventor researches and discovers that although block chain technology can be adopted to protect against tampering, the protection capability is still limited, and the risk of tampering is still high.

Disclosure of Invention

The application aims to provide a block chain information construction and query method and a related device, which are used for solving the problem that in the prior art, the will information still has high risk of being tampered.

In a first aspect, an embodiment of the present application provides a method for constructing and querying blockchain information, where the will information is divided into N data packets, where N is a positive integer, and the method includes:

expanding the testament information to obtain a plurality of pieces of testament information;

executing the following steps for each piece of the will advice information respectively:

generating a unique identifier of the will information;

and dispersedly storing the N data packets included in the will information in a plurality of blocks, wherein each block includes indication information of forward data packets of the stored data packets.

In some embodiments, before the augmenting the will information to obtain the multiple copies of the will information, the method further comprises:

dividing the will information into the N data sub-packets with equal size;

and respectively carrying out scrambling processing on each data sub-packet.

In some embodiments, the scrambling processing on each data packet separately includes:

carrying out XOR processing on the first data sub-packet by adopting a lead code to obtain a scrambling result of the first data sub-packet;

performing, for each data sub-packet subsequent to the first data sub-packet, respectively:

and carrying out exclusive OR processing on the data sub-packet by adopting a scrambling result of a previous data sub-packet of the data sub-packet to obtain a scrambling result.

In some embodiments, each copy of the order information corresponds to a sub-number, and all copies of the order information collectively correspond to an order number, the generating a unique identifier of the order information comprising:

and generating the unique identifier of the testimonial advice information by adopting the sub-number of the testimonial advice information, the testimonial advice number, the set object identifier of the testimonial advice information and the set time of the testimonial advice information.

In some embodiments, the indication information is a block identifier of a block in which the forward data packet is located.

obtaining the will-information according to the following method:

acquiring the content of the testament generated by the set object and the physical and mental state parameters to obtain initial testament data;

signing the initial testimony data by adopting the respective private keys of the set object and the notarization object to obtain a signature result, and combining the signature result and the initial testimony data to obtain basic testimony information;

and carrying out hash processing on the basic testament information and the respective public keys of the set object and the notarization object to obtain a hash number, and jointly forming the testament information by the hash number, the basic testament information and the respective public keys of the set object and the notarization object.

In a second aspect, an embodiment of the present application further provides a method for constructing and querying blockchain information, where the will-order information has multiple shares, and each share of the will-order information includes N data packets, where N is a positive integer, and the method includes:

responding to the query operation of the testament information, and querying a first block of a data sub-package containing the testament information and a unique identifier of the testament information corresponding to the data sub-package according to block generation time; each block of each data sub-packet storing the will information comprises indication information of a forward data sub-packet and a unique identifier of the will information corresponding to each data sub-packet;

starting from the first block, acquiring the N data sub-packets of the will information by referring to the acquired indication information and the unique identifier;

and analyzing the N data sub-packets to obtain complete testament information.

In some embodiments, parsing the N data packets to obtain complete the will-order information includes:

performing descrambling operation on each acquired data sub-packet to obtain a descrambling result of each data sub-packet;

and performing splicing processing on the descrambling result of each data sub-packet by referring to the sequence of each data sub-packet in the testament information to obtain the testament information.

In some embodiments, the method further comprises:

and if the inquired testament information of the testament is the testament information which is already cancelled, acquiring and outputting the cancellation description of the testament information.

In a third aspect, an embodiment of the present application further provides an apparatus for constructing blockchain information, where the will information is divided into N data packets, where N is a positive integer, and the apparatus includes:

the expansion module is used for expanding the testament information to obtain a plurality of pieces of testament information;

a processing module, configured to perform, for each piece of the will information:

generating a unique identifier of the will information;

In some embodiments, before the augmenting the will information to obtain the multiple copies of the will information, the apparatus further comprises:

the dividing module is used for dividing the testament information into N data sub-packets with equal size;

and the scrambling module is used for respectively scrambling each data sub-packet.

In some embodiments, the scrambling module is specifically configured to:

In some embodiments, each piece of the will-order information corresponds to one sub-number, and all pieces of the will-order information correspond to one will-order number, and the processing module is specifically configured to:

In some embodiments, the indication information is a hash value of a block in which the forward data packet is located.

the system comprises a testament information digitalizing module, a storage module and a display module, wherein the testament information digitalizing module is used for acquiring the testament information according to the following method:

In a fourth aspect, an embodiment of the present application further provides an apparatus for querying blockchain information, where the block chain information has multiple shares, and each share of the block chain information includes N data packets, where N is a positive integer, and the apparatus includes:

the information determining module is used for responding to the inquiry operation of the testament information, inquiring a first block of a data sub-package containing the testament information and the unique identification of the testament information corresponding to the data sub-package according to block generation time; each block of each data sub-packet storing the will information comprises indication information of a forward data sub-packet and a unique identifier of the will information corresponding to each data sub-packet;

the query module is used for acquiring the N data sub-packets of the will-order information by referring to the acquired indication information and the unique identifier from the first block;

and the generation module is used for analyzing the N data sub-packets to obtain complete testament information.

In some embodiments, the generating module is specifically configured to:

In some embodiments, the apparatus further comprises:

and the cancellation description module is used for acquiring and outputting the cancellation description of the testament information if the inquired testament information is the cancelled testament information.

In a fifth aspect, another embodiment of the present application further provides an electronic device, including at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of the first aspect and/or the second aspect as provided by embodiments of the present application.

In a sixth aspect, another embodiment of the present application further provides a non-transitory computer-readable storage medium, wherein instructions in the storage medium, when executed by a processor of the electronic device, cause the electronic device to perform the method of the first aspect and/or the second aspect in the embodiments of the present application.

In the embodiment of the application, in the block chain, each piece of the will information has a corresponding unique identifier and can be stored in a plurality of blocks in a scattered manner, and in order to facilitate retrieval of a plurality of data packets of the same piece of the will information, indication information of a forward data packet of the same piece of the will information can be stored in each block, so that a complete piece of the will information can be obtained. Therefore, the testament information is dispersed in a plurality of blocks for storage after being expanded, the data volume of the testament information is increased and is distributed in the plurality of blocks, a plurality of pieces of testament information of the same testament must be successfully tampered for use, and if at least one piece of testament information exists or one data sub-package is failed to be tampered, the tampering can be failed. Therefore, the safety and the anti-tampering capability of the will information are improved.

Additional features and advantages of the application will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by the practice of the application. The objectives and other advantages of the application may be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings needed to be used in the embodiments of the present application will be briefly described below, and it is obvious that the drawings described below are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.

FIG. 1 is a schematic illustration of an application environment according to one embodiment of the present application;

fig. 2 is a flowchart illustrating a method for building and querying blockchain information according to an embodiment of the present disclosure;

3-7 are schematic diagrams illustrating some embodiments of a process of building and querying blockchain information according to an embodiment of the present application;

fig. 8 is another flowchart illustrating a method for building and querying blockchain information according to an embodiment of the present disclosure;

FIG. 9 is a schematic diagram of descrambling acquired data according to an embodiment of the present application;

fig. 10-11 are schematic diagrams of an apparatus for building and querying blockchain information according to an embodiment of the present application;

FIG. 12 is a schematic view of an electronic device according to one embodiment of the present application.

Detailed Description

In order to make the technical solutions of the present disclosure better understood by those of ordinary skill in the art, the technical solutions in the embodiments of the present disclosure will be clearly and completely described below with reference to the accompanying drawings.

It should be noted that the terms "first", "second", and the like in the description of the present disclosure are used for distinguishing similar objects, and are not necessarily used for describing a particular order or sequence. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the disclosure described herein are capable of operation in sequences other than those illustrated or otherwise described herein. The implementations described in the exemplary embodiments below are not intended to represent all implementations consistent with the present disclosure. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the present disclosure, as detailed in the appended claims.

The inventor finds that, although block chain technology can be used to store the will order information in the related art, the true reliability of the will order information can be ensured. However, it is difficult to form a long chain based on the will information, and there is still a risk that the will information is falsified in the blockchain.

In view of the above, the present application provides a method and a device for constructing and querying block chain information.

The inventive concept of the method is as follows: the method comprises the steps of dividing the testament information to obtain a plurality of data sub-packets, and then expanding the testament information to obtain a plurality of pieces of testament information. In the block chain, each piece of the will information has a corresponding unique identifier and can be stored in a plurality of blocks in a scattered manner, and in order to facilitate retrieval of a plurality of data sub-packets of the same piece of the will information, indication information of a forward data sub-packet of the same piece of the will information can be stored in each block, so that a complete piece of the will information can be obtained. Therefore, the testament information is dispersed in a plurality of blocks for storage after being expanded, the data volume of the testament information is increased and is distributed in the plurality of blocks, a plurality of pieces of testament information of the same testament must be successfully tampered before being successfully tampered, and if at least one piece of testament information or one data sub-package is failed to be tampered, the tampering can be failed. Therefore, the safety and the tamper-proof capability of the will information are improved.

On the premise of effectively ensuring the real and reliable request of the testament information, the subsequent service based on the testament information can be automatically completed by referring to the testament information with high reliability in the process of insurance claim payment and claim settlement, so that the accuracy and the processing efficiency of the service are improved. On the other hand, in the old-age community, the emotional demand of the old people is also a very important demand, so that the old people's wisdom can be conveniently and accurately recorded by using a certain technical means, the realization of the wish is guaranteed, and the old people are greatly helped.

The following describes a method for constructing and querying blockchain information provided by the present application with reference to the accompanying drawings. FIG. 1 is a schematic diagram of an application environment according to one embodiment of the present application.

As shown in fig. 1, the application environment may include, for example, at least one server 20 and a plurality of terminal devices 40. The terminal devices 40 can communicate with each other, and the terminal devices 40 and the server 20 can communicate with each other based on a network. Terminal devices include, but are not limited to, computers, laptops, smart phones, tablets, or other types of user terminals. The server 20 is an interactive service accessible via a network and can be used to set up, store and query the will. For example, the elderly may set up a testimonial based on the terminal device 40, or may set up a paper testimonial and then be digitized by the terminal device for saving in the blockchain. After the old people set up the testimony, the old people can complete signature of the testimony together with the terminal equipment 40 of the notary. After the will information is sent to the server 20, the server 20 may complete various processes of the will information in the embodiment of the present application.

As shown in fig. 2, a schematic flow chart of a method for constructing and querying block chain information provided in the embodiment of the present application is shown, where a piece of will information is divided into N data packets, where N is a positive integer, and the method provided in the embodiment of the present application includes the following steps:

in step 201: and expanding the information of the testament advice to obtain a plurality of pieces of testament advice information.

In some embodiments, before the will-order information is expanded to obtain multiple pieces of the will-order information, in order to ensure validity of the will-order, the information of the will-order may be obtained according to the following method:

step A1, acquiring the testament content generated by the set object and the physical and mental state parameters to obtain initial testament data;

the body and mind state parameters are obtained and used for representing the body and mind health state of the testimony order finalizing person, and can be obtained based on measurement, and most importantly, the testified testimony order can be guaranteed to be in line with the real will of the testy order finalizing person.

In some embodiments, the order finder may use electronic media as a carrier to carry the order content, for example, the order may be recorded by audio or video. The content of the will order can also be carried by non-electronic media of paper files. Of course, the content of the will order may be digitized when a paper-like document will order is used, for example, a scanner or a camera is used to collect the content of the will order, so as to facilitate the chain linking.

In step a2, the initial will data is signed by using the private keys of the setup object and the notary object, and a signature result is obtained.

Combining the signature result with the initial testament data to obtain basic testament information;

for example, the doctor of the will order corresponds to the setting object, and the notary personnel corresponds to the notary object. I.e. to set up the object and the notary object as user equipment. Of course, in implementation, the two may be the same user device or different user devices as long as the signature of the initial will data can be completed.

Therefore, the testimonial advice setting person can complete the testimonial advice setting operation under the accompany of notary personnel to ensure the validity of the testimonial advice setting.

In step a3, hash processing is performed on the basic will information and the public keys of the setup object and the notary object to obtain hash numbers, and the will information is composed of the hash numbers, the basic will information and the public keys of the setup object and the notary object.

The basic will information is hashed, so that the integrity of the will information is guaranteed, and the data content is prevented from being damaged or tampered.

As shown in fig. 3, the digital file of the will advice is used as the content of the will advice, initial data of the will advice is formed by combining the evaluation result of the physical state, then the signature is performed by using the respective private keys of the stereologist and the notary, and the basic information of the will advice is obtained by combining the signature result with the initial data of the will advice. And then, processing the basic testament information by adopting Hash operation to obtain a Hash value, and finally obtaining the testament information by the Hash value, the basic testament information and the respective public keys of the stereotypical person and the notary.

When the wisdom information is linked up, the intelligent contract can perform signature verification on the signature in the wisdom information, for example, when the respective signatures of the wisdom customs person and the notary pass verification, the wisdom information can be allowed to be linked up for storage.

After obtaining the wishlist information, in order to improve the anti-tampering performance of the wishlist information, dividing the wishlist information into N data sub-packets with equal size in the embodiment of the application; then, each data packet is scrambled, and the data is uplinked and distributed to a plurality of blocks. Thus, the confidentiality of information can be improved.

In implementation, the order between the data sub-packets may be defined according to the context relationship between the data sub-packets. Then, the lead code is adopted to carry out exclusive or processing on the first data sub-packet to obtain a scrambling result of the first data sub-packet; then, for each data sub-packet after the first data sub-packet, respectively: and carrying out exclusive OR processing on the data sub-packet by adopting the scrambling result of the previous data sub-packet of the data sub-packet to obtain the scrambling result of the data sub-packet.

As shown in fig. 4, the data sub-package includes data sub-package 1 …, data sub-package N, and data sub-package 1 and the preamble are subjected to xor processing to obtain data sub-package 1 for storage (i.e. scrambled sub-package 1); for the data packetization 2, the scrambling result of the data packetization 2 is obtained by performing exclusive or processing using the scrambling results of the data packetization 2 and the data packetization 1 (namely, the scrambling packetization 2), and for the subsequent data packetization 3 …, the data packetization N is processed with reference to the data packetization 2, so that the scrambling result of each data packetization is obtained.

In the embodiment of the application, the XOR processing operation is simple, the scrambling result of the previous data sub-packet can be adopted to carry out XOR processing on the next data sub-packet, the relevance and confidentiality among the data sub-packets can be enhanced, the relation connection of different sub-packets in the same wisdom is realized, information is dispersed into a plurality of blocks, and the safety is improved.

Before scrambling each data sub-packet, as shown in fig. 5a, each data sub-packet may be backed up, and for each data sub-packet, a plurality of pieces of information, i.e., M pieces of data sub-packets, may be obtained, each of which is scrambled, thereby generating M pieces of will information.

In step 202, for each piece of will information, respectively: generating a unique identifier of the will information; then, the N data packets included in the will information are dispersedly stored in a plurality of blocks, and each block includes indication information of forward data packets of the stored data packets.

Wherein each piece of the will information includes N scrambled data packets. And if M pieces of the will advice information are set, the M pieces of the will advice information are stored in a buffer pool, and each piece of the will advice information can correspond to one queue. All data sub-packets of the piece of the will information are included in the queue, so that each piece of the will information can be stored in different data sub-packets in a scattered mode based on the queue.

First, in some embodiments, each piece of the will information corresponds to one sub-number (a queue number may be used to represent the sub-number when implemented), and the pieces of the will information collectively correspond to one will number, then the operation of generating the unique identifier of the will information may be implemented as: the unique identifier of the will information is generated by using the sub-number of the will information, the identifier of the setup object of the will information, the setup time of the will information, and the like, and a data structure of the unique identifier of the will information may be as shown in fig. 5 b. It should be noted that, in implementation, the unique identifier may be designed according to different requirements. According to the method and the system, through the comprehensive information, when the same will-be-determined person makes multiple orders, a piece of will information can be uniquely identified based on the order time, the information and the like.

In the block chain, the cloud server may generate blocks periodically, for example, new blocks are generated every 15 minutes or half an hour so as to store new data. In the embodiment of the application, the same block can store K data packets. The K data sub-packets stored in the same block can be from the doctor's information of different doctor's orders or from the doctor's information of the same doctor's orders. For the same will, the M pieces of will information form M queues, as shown in fig. 6, which shows the dynamic process of storing information into blocks in these multiple queues (which may be from different will). If the blocks are generated sequentially according to the generation time sequence, the blocks are respectively block ID1, block ID2 and block ID 3. As shown in fig. 6, there are 3 queues writing data into the block. For tile ID1, the three queues are order record 1 backup 1 queue, order record 1 backup 2 queue, and order record 2 backup 1 queue, respectively. The contents stored in the queue will be described by taking a backup 1 queue of the will record 1 as an example. In the current state, the data queue ID1 including the will record 1 backup 1 in the queue can be used as the unique identifier of the aforementioned piece of will information. Each data sub-packet in the queue further includes a previous block number, which points to a block where a forward data sub-packet of the data sub-packet is located, and a block identifier (e.g., block 1, block 2, block 3) for marking an order of different data sub-packets in a piece of will information.

The dynamic process of FIG. 6 can be briefly described as after each queue writes one data packet to tile ID1, queue 1 is empty and queues 2-3 are each decremented by one data packet. Then, since block ID1 is full, of the three queues, there is data to write to block ID2 because of the order record 1 backup 2 queue and order record 2 backup 1 queue, and both queues have one data packet written to block ID 2. By analogy, when a new queue is created, such as the order record 3 backup 1 queue in fig. 6, data packets can be written into different blocks with reference to other queues. In practice, in order to disperse the data packets of the same piece of will information in different blocks, each queue may be limited to write one data packet to the same block.

In addition, each block records the identification of the previous block to concatenate multiple data packets in the same queue. Of course, as shown by the dotted arrows in fig. 6, the data sub-packets to be written in each queue may also include the previous block number as the indication information to associate different data sub-packets. In addition to the wishlist information data as chunk data, the chunk includes a chunk ID, a chunk timestamp, a previous chunk characteristic hash number, a current chunk nonce, a merkel tree, which constitute the chunk header portion of the blockchain data structure.

Regarding the obtaining of the feature value, in some embodiments, after all the K packets are completely filled, the Hash operation is performed on the whole block to obtain the feature Hash value of the block;

the hash value of the previous Block, the initial Block, and the hash value of the current Block together form a final Block (End Block).

In some embodiments, the indication information for indicating the forward database may be a hash value of a block in which the forward data packet is located. Different data packets of the same piece of will information can be orderly connected in series so as to be convenient for management and query.

The remote server may include multiple servers, each having different functions. For example, the above processing of the will information, including digitizing, signing, blocking, scrambling and storing into the corresponding block, is completed by the processing server, the processing server completes the block construction and sends to the authentication server, the authentication server verifies the block sent from the processing server, and after confirming that the signature, the hash value and the like are correct, the block is added into the local block chain for storage.

The process of chaining the will information is introduced above, and the modification, revocation and inquiry of the will information are described below.

Modification and revocation of testimonial information

When a certain will is required to be cancelled, the cancellation operation of the user can be responded, whether the will is not uploaded by the person who sets up the will in the will buffer pool is checked, if yes, the will is deleted from the buffer pool, and a new cancellation description data packet is generated and is placed into the buffer pool to enter the chain. Fig. 7 is a schematic diagram of a structure of a will revocation packet, where the packet includes a will ID, a revocation identification field, and revocation information.

When the will order is retrieved, the retrieval can be performed from the new block to the old block, and a revocation instruction packet is received first to indicate that the retrieved will order is revoked.

The process of modifying the will order can be realized by modifying the original will order information in response to the modification operation of the user, and then the process is the same as the process of entering the chain of the aforementioned will order information, and will not be described here.

Retrieval of testimony

As shown in fig. 8, a flowchart of a method for retrieving a will order provided by an embodiment of the present application includes the following steps:

in step 801, in response to the query operation on the will information, querying a first block of a data packet containing the will information according to the block generation time from back to front; and each block of the data sub-package storing the will information comprises the indication information of the forward data sub-package and the unique identifier of the will information.

The query condition may be set according to an actual requirement, for example, the information of the will ordered by the person who decides the will order in a certain time period may be queried. Each piece of the will information can also be set with inquiry authority, only the users with inquiry authority can inquire. For example, the user who performs the query may be authenticated in terms of authority, and only when the user has the query authority, the will-order information can be queried. In specific implementation, the authority authentication mode may be various, for example, authentication may be performed in a mode of setting a user name and a password, or a user with a query authority may be signed in the will information, and during query, signature verification is performed on the user performing the query operation, and only when the signature verification passes, the will information can be queried.

As described above, each piece of the will information is divided into N data packets, and each block records a unique identifier of the piece of the will information corresponding to each stored data packet while each data packet is stored in the block.

Since each data sub-package of the same piece of the will information is continuously stored in a plurality of blocks, each block also records the association relationship between the forward data sub-packages of the same piece of the will information, that is, the indication information of the database is used to indicate from which block the data sub-package of which will information should be obtained after the obtained current data sub-package. It should be noted that, for the same piece of will information, one or more data packets of the piece of will information may be stored in the same block.

In step 802, N data packets of the will information are acquired with reference to the acquired instruction information and the unique identifier, starting from the first block.

That is, when there is a request for querying the will advice, the authorized query node may start to search from the latest block of the block chain of the will advice, and when it is found that the ID information of the will advice of a certain data packet meets the requirements (for example, the search condition includes information of the creator of the will advice, information of the setup time, etc.), N data packets of the information of the will advice are found. And then, according to the block information calibrated in the data sub-packets and the unique identifier of the same piece of the will information, forward indexing is carried out until the last data sub-packet is found. And confirming that the mode of the last data packet is that the indication information of the data packet is null, (if the previous block information is null), confirming that all N data packets are found.

In step 803, the N data packets are analyzed to obtain complete will information.

Assuming that each data sub-packet of the will information is subjected to scrambling operation, in the embodiment of the application, descrambling operation can be performed on each acquired data sub-packet to obtain a descrambling result of each data sub-packet; and then, the descrambling result of each data sub-packet is spliced according to the sequence of each data sub-packet in the testament information to obtain the testament information. For example, if the scrambling scheme is the scheme shown in fig. 4, the descrambling operation is performed as shown in fig. 9. The obtained first data sub-packet is subjected to exclusive-or processing by adopting a lead code to obtain a descrambling result of the first data sub-packet (namely, the data sub-packet 1 in fig. 9), then, for the second data sub-packet, the descrambling result of the first data sub-packet and the descrambling result of the second data sub-packet are subjected to exclusive-or processing by adopting the descrambling result of the first data sub-packet and the second data sub-packet to obtain a descrambling result of the second data sub-packet (namely, the data sub-packet 2 in fig. 9), and the subsequent data sub-packets are processed by referring to the processing mode of the second data sub-packet to finally obtain the descrambling results.

In summary, in the embodiment of the application, the same piece of the will information has multiple pieces, and then the data is stored in a sub-packet mode, so that the complexity of tampering the will information can be improved, and the security and the credibility of the will information are ensured.

In addition, in another embodiment, if the inquired will information is cancelled, a cancellation description of the will information is obtained and output, so that the user can know the state of the will information.

Based on the same inventive concept, an embodiment of the present application further provides an apparatus for constructing blockchain information, where the will information is divided into N data packets, where N is a positive integer, and as shown in fig. 10, the apparatus includes:

an expansion module 1001, configured to expand the will information to obtain multiple copies of the will information;

a processing module 1002, configured to respectively execute, for each piece of the will information:

generating a unique identifier of the will information;

In some embodiments, the scrambling module is specifically configured to:

An embodiment of the present application further provides an apparatus for querying block chain information, where the wishlist information has multiple pieces, and each piece of the wishlist information includes N data packets, where N is a positive integer, as shown in fig. 11, the apparatus includes:

an information determining module 1101, configured to, in response to a query operation on the will information, query, according to block generation time, a first block of a data packet containing the will information and a unique identifier of the will information corresponding to the data packet; each block of each data sub-packet storing the will information comprises indication information of a forward data sub-packet and a unique identifier of the will information corresponding to each data sub-packet;

a query module 1102, configured to obtain, starting from the first block, the N data packets of the will information with reference to the obtained indication information and the unique identifier;

a generating module 1103, configured to analyze the N data packets to obtain complete information of the will advice.

In some embodiments, the generating module is specifically configured to:

In some embodiments, the apparatus further comprises:

For implementation and beneficial effects of the operations in the block chain information constructing and querying device, reference may be made to the description of the foregoing method, and details are not described herein again.

Having described the apparatus method and apparatus for building and querying blockchain information according to an exemplary embodiment of the present application, an electronic device according to another exemplary embodiment of the present application will be described.

As will be appreciated by one skilled in the art, aspects of the present application may be embodied as a system, method or program product. Accordingly, various aspects of the present application may be embodied in the form of: an entirely hardware embodiment, an entirely software embodiment (including firmware, microcode, etc.) or an embodiment combining hardware and software aspects that may all generally be referred to herein as a "circuit," module "or" system.

In some possible implementations, an electronic device according to the present application may include at least one processor, and at least one memory. The memory stores program code, and when the program code is executed by the processor, the program code causes the processor to execute the steps of the method for building and querying blockchain information according to various exemplary embodiments of the present application described above in the specification.

The electronic device 130 according to this embodiment of the present application is described below with reference to fig. 12. The electronic device 130 shown in fig. 12 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present application.

As shown in fig. 12, the electronic device 130 is represented in the form of a general electronic device. The components of the electronic device 130 may include, but are not limited to: the at least one processor 131, the at least one memory 132, and a bus 133 that connects the various system components (including the memory 132 and the processor 131).

Bus 133 represents one or more of any of several types of bus structures, including a memory bus or memory controller, a peripheral bus, a processor, or a local bus using any of a variety of bus architectures.

The memory 132 may include readable media in the form of volatile memory, such as Random Access Memory (RAM)1321 and/or cache memory 1322, and may further include Read Only Memory (ROM) 1323.

Memory 132 may also include a program/utility 1325 having a set (at least one) of program modules 1324, such program modules 1324 including, but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which, or some combination thereof, may comprise an implementation of a network environment.

The electronic device 130 may also communicate with one or more external devices 134 (e.g., keyboard, pointing device, etc.), with one or more devices that enable a user to interact with the electronic device 130, and/or with any devices (e.g., router, modem, etc.) that enable the electronic device 130 to communicate with one or more other electronic devices. Such communication may occur via input/output (I/O) interfaces 135. Also, the electronic device 130 may communicate with one or more networks (e.g., a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network, such as the internet) via the network adapter 136. As shown, network adapter 136 communicates with other modules for electronic device 130 over bus 133. It should be understood that although not shown in the figures, other hardware and/or software modules may be used in conjunction with electronic device 130, including but not limited to: microcode, device drivers, redundant processors, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, among others.

In some possible embodiments, the aspects of a method for building and querying blockchain information provided by the present application may also be implemented in the form of a program product, which includes program code for causing a computer device to execute the steps in a method for building and querying blockchain information according to various exemplary embodiments of the present application described above in this specification when the program product is run on the computer device.

The program product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. A readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium include: an electrical connection having one or more wires, a portable disk, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

The program product for building and querying of blockchain information of embodiments of the present application may employ a portable compact disc read only memory (CD-ROM) and include program code, and may be executable on an electronic device. However, the program product of the present application is not limited thereto, and in this document, a readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.

A readable signal medium may include a propagated data signal with readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A readable signal medium may also be any readable medium that is not a readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.

Program code embodied on a readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

Program code for carrying out operations of the present application may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the consumer electronic device, partly on the consumer electronic device, as a stand-alone software package, partly on the consumer electronic device and partly on a remote electronic device, or entirely on the remote electronic device or server. In the case of remote electronic devices, the remote electronic devices may be connected to the consumer electronic device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external electronic device (e.g., through the internet using an internet service provider).

It should be noted that although several units or sub-units of the apparatus are mentioned in the above detailed description, such division is merely exemplary and not mandatory. Indeed, the features and functions of two or more units described above may be embodied in one unit, according to embodiments of the application. Conversely, the features and functions of one unit described above may be further divided into embodiments by a plurality of units.

Further, while the operations of the methods of the present application are depicted in the drawings in a particular order, this does not require or imply that these operations must be performed in this particular order, or that all of the illustrated operations must be performed, to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step execution, and/or one step broken down into multiple step executions.

As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.

The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

While the preferred embodiments of the present application have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all alterations and modifications as fall within the scope of the application.

It will be apparent to those skilled in the art that various changes and modifications may be made in the present application without departing from the spirit and scope of the application. Thus, if such modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is intended to include such modifications and variations as well.

Claims

1. A block chain information construction method is characterized in that the will information is divided into N data sub-packets, N is a positive integer, and the method comprises the following steps:

generating a unique identifier of the will information;

2. The method of claim 1, wherein prior to said augmenting said order information to obtain a plurality of said order information, said method further comprises:

dividing the will information into the N data sub-packets with equal size;

and respectively carrying out scrambling processing on each data sub-packet.

3. The method of claim 2, wherein the scrambling each data packet separately comprises:

4. The method of claim 1, wherein each copy of the order information corresponds to a sub-number, and all copies of the order information collectively correspond to an order number, and wherein the generating of the unique identifier of the order information comprises:

5. The method of claim 1, wherein the indication information is a block identifier of a block in which the forward data packet is located.

6. The method of claim 1, wherein prior to said augmenting said order information to obtain a plurality of said order information, said method further comprises:

obtaining the will-information according to the following method:

7. A block chain information query method is characterized in that the block chain information comprises a plurality of parts, each part of the block chain information comprises N data packets, N is a positive integer, and the method comprises the following steps:

and analyzing the N data sub-packets to obtain complete testament information.

8. The method of claim 7, wherein parsing the N data packets to obtain complete the order information comprises:

9. The method according to claim 7 or 8, characterized in that the method further comprises:

10. An apparatus for constructing blockchain information, wherein the will information is divided into N data packets, N being a positive integer, the apparatus comprising:

generating a unique identifier of the will information;

11. An apparatus for querying blockchain information, wherein the testament information has a plurality of shares, each of the testament information includes N data packets, N is a positive integer, the apparatus comprising: