CN111552742A - Information summarization method and system in block chain - Google Patents

Information summarization method and system in block chain Download PDF

Info

Publication number
CN111552742A
CN111552742A CN202010357924.2A CN202010357924A CN111552742A CN 111552742 A CN111552742 A CN 111552742A CN 202010357924 A CN202010357924 A CN 202010357924A CN 111552742 A CN111552742 A CN 111552742A
Authority
CN
China
Prior art keywords
hash value
contract
purchase
user node
target block
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202010357924.2A
Other languages
Chinese (zh)
Inventor
陈议尊
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Individual
Original Assignee
Individual
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Individual filed Critical Individual
Priority to CN202010357924.2A priority Critical patent/CN111552742A/en
Publication of CN111552742A publication Critical patent/CN111552742A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22—Indexing; Data structures therefor; Storage structures
    • G06F16/2228—Indexing structures
    • G06F16/2255—Hash tables
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00—Commerce
    • G06Q30/06—Buying, selling or leasing transactions
    • G06Q30/0601—Electronic shopping [e-shopping]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/10—Services
    • G06Q50/18—Legal services

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Physics & Mathematics (AREA)
  • Finance (AREA)
  • Accounting & Taxation (AREA)
  • General Business, Economics & Management (AREA)
  • Economics (AREA)
  • Databases & Information Systems (AREA)
  • Marketing (AREA)
  • Strategic Management (AREA)
  • General Engineering & Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Tourism & Hospitality (AREA)
  • Technology Law (AREA)
  • Development Economics (AREA)
  • Primary Health Care (AREA)
  • Human Resources & Organizations (AREA)
  • Software Systems (AREA)
  • General Health & Medical Sciences (AREA)
  • Health & Medical Sciences (AREA)
  • Computing Systems (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The application provides an information summarization method and system in a block chain, which can generate a purchase auxiliary contract after a buyer user node makes an order request and transmit the purchase auxiliary contract to a buyer and a seller, and respectively generate hash values of the contract after the two parties agree to the contract as the information summarization of the contract and store the hash values in the block chain. When the hash values of the two parties are consistent, the transaction can be completed. Therefore, the auxiliary purchase contract is constructed in order to ensure the benefits of both parties, and the safety of the auxiliary purchase contract is ensured by adopting the block chain. The hash value is used as the information abstract of the contract, so that the lengthy contract content storage and block chain loss and calculation time loss can be avoided.

Description

Information summarization method and system in block chain
Technical Field
The invention relates to the technical field of block chains, in particular to a method and a system for abstracting information in a block chain.
Background
Distributed Application (DApp) is an internet Application that differs from traditional applications by: the DApp runs on a decentralized network, namely a block chain network, and the DApp can be completely controlled by nodes without centralization in the network; traditional applications are centralized and require a server to obtain data, process data, etc. Blockchains are the underlying environment for applications to run relative to DApp.
In daily life, people often have some articles which are not wanted or can not be used for various objective reasons, and if the articles are directly discarded, the articles are quite wasted, so that the articles can be sold to other users on a second-hand trading platform. However, in the prior art, the second-hand transaction still has some problems. Compared with commodity transaction, the second-hand transaction needs some procedures for contract guarantee, for example, after the second-hand automobile transaction, some detailed terms for the buyer and the seller need to be defined.
In the prior art, the contracts are often stored locally or on a cloud platform in a file form, and need to be called repeatedly when relevant transactions are carried out, so that the procedures are complicated, and the risk of data tampering is also caused.
Disclosure of Invention
In view of the defects in the prior art, in one aspect, the present invention provides a method for abstracting information in a block chain, including:
the buyer user node initiates a purchase request in the distributed application program;
a server of the distributed application program draws up a purchase auxiliary contract according to the commodity aimed at by the purchase request, and transmits the purchase auxiliary contract to the buyer user node and the corresponding seller user node;
after the buyer user node agrees to the purchase auxiliary contract, calculating the hash value of the agreed auxiliary contract content as a first hash value, generating a first target block to record the first hash value, and storing the first target block in a distributed system;
after the seller user node agrees with the purchase auxiliary contract, calculating the hash value of the agreed purchase auxiliary contract content as a second hash value, generating a second target block to record the second hash value, and storing the second target block in a distributed system;
after the first target block and the second target block are detected, all user nodes in the distributed system acquire the first hash value from the first target block and acquire the second hash value from the second target block, and under the condition that the first hash value and the second hash value are the same, the transaction is completed.
As an optional implementation manner, after the buyer user node agrees to the purchase auxiliary contract, the step of calculating the hash value of the content of the purchase auxiliary contract agreed by the buyer user node as a first hash value includes: after the buyer user node agrees to the purchase auxiliary contract, splitting the agreed purchase auxiliary contract into a plurality of parts; calculating a hash value for each part; sequentially arranging all hash values obtained by calculation to obtain first combined data; and recording the first combined data as the first hash value.
As an optional implementation manner, after the seller user node agrees to the purchase assistance contract, the step of calculating the hash value of the content of the purchase assistance contract agreed by the seller user node as a second hash value includes: after the seller user node agrees to the purchase assistance contract, splitting the agreed purchase assistance contract into a plurality of parts; calculating a hash value for each part; sequentially arranging all the hash values obtained by calculation to obtain second combined data; and recording the second combined data as the second hash value.
As an optional implementation manner, in a case that the first hash value is different from the second hash value, the buyer user node and the seller user node compare and find out different values of the first combined data and the second combined data, and search a local document for a portion of the purchase assistance contract corresponding to the different values, and transmit the portion of the purchase assistance contract corresponding to the different values to an opposite user node.
As an alternative embodiment, in the event that the first hash value is different from the second hash value, the server of the distributed application issues an alarm signal to indicate that the current purchase assistance contract may be tampered with.
In another aspect, the present invention provides a system for abstracting information in a block chain, including: a buyer user node for: initiating a purchase request in the distributed application; after the purchase auxiliary contract is agreed, calculating the hash value of the agreed auxiliary contract content as a first hash value, generating a first target block to record the first hash value, and storing the first target block in a distributed system;
a server of a distributed application program for: drawing up a purchase auxiliary contract according to the commodity aimed at by the purchase request, and transmitting the purchase auxiliary contract to the buyer user node and the corresponding seller user node;
a vendor user node to: after the purchase auxiliary contract is agreed, calculating the hash value of the agreed purchase auxiliary contract content as a second hash value, generating a second target block to record the second hash value, and storing the second target block in a distributed system;
all user nodes in the distributed system for: and after the first target block and the second target block are detected, acquiring the first hash value from the first target block, acquiring the second hash value from the second target block, and completing the transaction under the condition that the first hash value and the second hash value are the same.
As an optional implementation manner, the buyer user node is specifically configured to: after the purchase assistance contract, splitting the purchase assistance contract agreed by the purchase assistance contract into a plurality of parts; calculating a hash value for each part; sequentially arranging all hash values obtained by calculation to obtain first combined data; and recording the first combined data as the first hash value.
As an optional implementation manner, the seller user node is specifically configured to: after the purchase assistance contract, splitting the purchase assistance contract agreed by the purchase assistance contract into a plurality of parts; calculating a hash value for each part; sequentially arranging all the hash values obtained by calculation to obtain second combined data; and recording the second combined data as the second hash value.
As an optional implementation, the buyer user node and the seller user node are further configured to: and under the condition that the first hash value is different from the second hash value, different values of the first combined data and the second combined data are compared and found out, parts of the purchase auxiliary contract corresponding to the different values are searched in a local document, and the parts of the purchase auxiliary contract corresponding to the different values are transmitted to the opposite user node.
As an optional implementation manner, the server of the distributed application program is further configured to: in the event that the first hash value is different from the second hash value, issuing an alarm signal to indicate that the current purchase assistance contract may be tampered with.
The invention has the beneficial effects that: compared with commodity transaction, the second-hand transaction needs some procedures for contract guarantee, for example, after the second-hand automobile transaction, some detailed terms for the buyer and the seller need to be defined. The application provides an information summarization method and system in a block chain, which can generate a purchase auxiliary contract after a buyer user node makes an order request and transmit the purchase auxiliary contract to a buyer and a seller, and respectively generate hash values of the contract after the two parties agree to the contract as the information summarization of the contract and store the hash values in the block chain. When the hash values of the two parties are consistent, the transaction can be completed. Therefore, the auxiliary purchase contract is constructed in order to ensure the benefits of both parties, and the safety of the auxiliary purchase contract is ensured by adopting the block chain. The hash value is used as the information abstract of the contract, so that the lengthy contract content storage and block chain loss and calculation time loss can be avoided.
Drawings
In order to more clearly illustrate the detailed description of the invention or the technical solutions in the prior art, the drawings that are needed in the detailed description of the invention or the prior art will be briefly described below. Throughout the drawings, like elements or portions are generally identified by like reference numerals. In the drawings, elements or portions are not necessarily drawn to scale.
A schematic structural diagram of a data sharing system provided in an embodiment of the present application;
a schematic structural diagram of a block chain provided in an embodiment of the present application;
fig. 1 is a schematic flowchart of a method for abstracting information in a block chain according to an embodiment of the present disclosure;
fig. 2 is a schematic flowchart of another method for abstracting information in a blockchain according to an embodiment of the present disclosure;
fig. 3 is a schematic structural diagram of another information summarization system in a blockchain according to an embodiment of the present disclosure.
Detailed Description
Embodiments of the present invention will be described in detail below with reference to the accompanying drawings. The following examples are only for illustrating the technical solutions of the present invention more clearly, and therefore are only examples, and the protection scope of the present invention is not limited thereby.
It is to be noted that, unless otherwise specified, technical or scientific terms used herein shall have the ordinary meaning as understood by those skilled in the art to which the invention pertains.
In the illustrated data sharing system, the data sharing system 100 refers to a system for performing data sharing between nodes, the data sharing system may include a plurality of nodes 101, and the plurality of nodes 101 may refer to respective clients in the data sharing system. Each node 101 may receive input information while operating normally and maintain shared data within the data sharing system based on the received input information. In order to ensure information intercommunication in the data sharing system, information connection can exist between each node in the data sharing system, and information transmission can be carried out between the nodes through the information connection. For example, when any node in the data sharing system receives input information, other nodes in the data sharing system may acquire the input information according to a consensus algorithm, and store the input information as data in shared data, so that the data stored on all nodes in the data sharing system are consistent.
Each node in the data sharing system has a node identifier corresponding thereto, and each node in the data sharing system may store a node identifier of another node in the data sharing system, so that the generated block is broadcast to the other node in the data sharing system according to the node identifier of the other node in the following. Each node may maintain a node identifier list as shown in the following table, and store the node name and the node identifier in the node identifier list correspondingly. The node identifier may be an IP (internet protocol) address and any other information that can be used to identify the node, and table 1 only illustrates the IP address as an example.
Figure BDA0002474100930000051
Figure BDA0002474100930000061
Each node in the data sharing system stores one identical blockchain. The block chain is composed of a plurality of blocks, the starting block comprises a block head and a block main body, the block head stores an input information characteristic value, a version number, a timestamp and a difficulty value, and the block main body stores input information; the next block of the starting block takes the starting block as a parent block, the next block also comprises a block head and a block main body, the block head stores the input information characteristic value of the current block, the block head characteristic value of the parent block, the version number, the timestamp and the difficulty value, and the like, so that the block data stored in each block in the block chain is associated with the block data stored in the parent block, and the safety of the input information in the block is ensured.
The embodiments of the present application will be described below with reference to the drawings.
Referring to fig. 1, fig. 1 is a flowchart illustrating a method 300 for abstracting information in a block chain according to an embodiment of the present disclosure. The method 300 may include:
301. the buyer user node initiates a purchase request in the distributed application.
In this embodiment, the buyer user node or the room selling user node may be a terminal (client) used by a user side. In particular implementations, the above-described terminals may also be referred to as terminal devices, including but not limited to other portable devices such as mobile phones, laptop computers, or tablet computers having touch-sensitive surfaces (e.g., touch screen displays and/or touch pads), which may implement location services and navigation functions through application programs. It should also be understood that in some embodiments, the device is not a portable communication device, but is a desktop computer having a touch-sensitive surface (e.g., a touch screen display and/or touchpad).
In the embodiment of the present application, the "buyer user node initiates a purchase request in the distributed application" may be understood as that the buyer clicks an order placing button for a certain second-hand product hung by the seller in the distributed application. For example, the buying room places orders for commodities such as second-hand mobile phones, second-hand computers, second-hand vehicles and the like hung by the seller.
302. And the server of the distributed application program plans a purchase auxiliary contract according to the commodity aimed at by the purchase request and transmits the purchase auxiliary contract to the buyer user node and the corresponding seller user node.
In the embodiment of the application, the server of the distributed application program may store purchase auxiliary contracts for various types of second-hand commodities, and the purchase auxiliary contracts specify various details of the purchase of the second-hand commodities according to actual conditions and timely transmit the details to the buyer and the seller for reading.
303. After the buyer user node agrees to purchase the auxiliary contract, calculating the hash value of the agreed auxiliary contract content as a first hash value, generating a first target block to record the first hash value, and storing the first target block in the distributed system.
304. After the seller user node agrees to the purchase auxiliary contract, calculating the hash value of the agreed purchase auxiliary contract content as a second hash value, generating a second target block to record the second hash value, and storing the second target block in the distributed system.
It is understood that a first hash value, which is an information summary of the buyer-agreed purchase-assistance contract, and a second hash value, which is an information summary of the seller-agreed purchase-assistance contract, may be calculated through the SHA256 function. The first hash value and the second hash value are stored by adopting a block chain technology, so that the safety and the stability of data can be better guaranteed.
305. After the first target block and the second target block are detected, all user nodes in the distributed system acquire a first hash value from the first target block and a second hash value from the second target block, and under the condition that the first hash value and the second hash value are the same, the transaction is completed.
It can be understood that the first hash value and the second hash value carry the content of the purchase-assisting contract agreed by the buyer and the seller, so that in the case that the first hash value and the second hash value are the same, it is indicated that the purchase-assisting contract has not been tampered, the information is secure, and the transaction is completed.
As an alternative embodiment, in the event that the first hash value is different from the second hash value, the server of the distributed application issues an alert signal to indicate that the current purchase assistance contract may have been tampered with.
As shown in fig. 2, fig. 2 is a flowchart illustrating another method 400 for abstracting information in a block chain according to an embodiment of the present application. The method 400 may include:
401. the buyer user node initiates a purchase request in the distributed application.
402. And the server of the distributed application program plans a purchase auxiliary contract according to the commodity aimed at by the purchase request and transmits the purchase auxiliary contract to the buyer user node and the corresponding seller user node.
403. After the buyer user node agrees to the purchase auxiliary contract, splitting the agreed purchase auxiliary contract into a plurality of parts; calculating a hash value for each part; sequentially arranging all hash values obtained by calculation to obtain first combined data; recording the first combined data as a first hash value, generating a first target block to record the first hash value, and storing the first target block in the distributed system.
404. After the seller user node agrees to the purchase auxiliary contract, splitting the agreed purchase auxiliary contract into a plurality of parts; calculating a hash value for each part; sequentially arranging all the hash values obtained by calculation to obtain second combined data; and recording the second combined data as a second hash value, generating a second target block to record the second hash value, and storing the second target block in the distributed system.
In the embodiment of the application, the user nodes of the buyer and the seller divide the agreed purchase auxiliary contract into the chapters according to a certain chapter sequence, calculate the hash value of each chapter through the SHA256 function, and obtain the first combined data and the second combined data as the first hash value and the second hash value respectively after arranging the hash values in sequence.
405. And under the condition that the first hash value is different from the second hash value, the buyer user node and the seller user node compare and find out different values of the first combined data and the second combined data, search a part of the purchase auxiliary contract corresponding to the different values in the local document, and transmit the part of the purchase auxiliary contract corresponding to the different values to the other user node.
It can be understood that, in the present embodiment, by comparing different values of the first combination data and the second combination data, it can be finally found out which section part of the purchase contract is tampered with. Further refining security guarantee function for data security.
Based on the description of the information summarization method embodiment in the block chain, the embodiment of the application also discloses an information summarization system in the block chain. Referring to fig. 3, the information summarization system 500 includes:
a buyer user node 510 for: initiating a purchase request in the distributed application; after the auxiliary contract is agreed to be purchased, calculating the hash value of the agreed auxiliary contract content as a first hash value, generating a first target block to record the first hash value, and storing the first target block in the distributed system;
a server 520 of the distributed application for: drawing up a purchase auxiliary contract according to the commodity aimed at by the purchase request, and transmitting the purchase auxiliary contract to a buyer user node and a corresponding seller user node;
a vendor user node 530 for: after the purchase auxiliary contract is agreed, calculating the hash value of the agreed purchase auxiliary contract content as a second hash value, generating a second target block to record the second hash value, and storing the second target block in the distributed system;
all user nodes 540 in the distributed system for: and after the first target block and the second target block are detected, acquiring a first hash value from the first target block and a second hash value from the second target block, and completing the transaction under the condition that the first hash value and the second hash value are the same.
According to an embodiment of the present application, each step involved in the methods shown in fig. 1 and fig. 2 may be performed by each node in the bonus point rebate system 500 shown in fig. 3, and is not described herein again.
As an optional implementation, the buyer user node is specifically configured to: after the auxiliary contract is purchased, splitting the agreed auxiliary contract into a plurality of parts; calculating a hash value for each part; sequentially arranging all hash values obtained by calculation to obtain first combined data; and recording the first combined data as a first hash value.
As an optional implementation, the vendor user node is specifically configured to: after the auxiliary contract is purchased, splitting the agreed auxiliary contract into a plurality of parts; calculating a hash value for each part; sequentially arranging all the hash values obtained by calculation to obtain second combined data; and recording the second combined data as a second hash value.
As an alternative embodiment, the buyer user node and the seller user node are further configured to: and under the condition that the first hash value is different from the second hash value, different values of the first combined data and the second combined data are compared and found out, parts of the purchase auxiliary contract corresponding to the different values are searched in the local document, and the parts of the purchase auxiliary contract corresponding to the different values are transmitted to the opposite user node.
As an alternative implementation, the server of the distributed application program is further configured to: in the event that the first hash value is different from the second hash value, an alarm signal is issued to indicate that the current purchase assistance contract may be tampered with. Finally, it should be noted that: the above embodiments are only used to illustrate the technical solution of the present invention, and not to limit the same; while the invention has been described in detail and with reference to the foregoing embodiments, it will be understood by those skilled in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; such modifications and substitutions do not depart from the spirit and scope of the present invention, and they should be construed as being included in the following claims and description.

Claims (10)

1. A method for abstracting information in a block chain, comprising:
the buyer user node initiates a purchase request in the distributed application program;
a server of the distributed application program draws up a purchase auxiliary contract according to the commodity aimed at by the purchase request, and transmits the purchase auxiliary contract to the buyer user node and the corresponding seller user node;
after the buyer user node agrees to the purchase auxiliary contract, calculating the hash value of the agreed auxiliary contract content as a first hash value, generating a first target block to record the first hash value, and storing the first target block in a distributed system;
after the seller user node agrees with the purchase auxiliary contract, calculating the hash value of the agreed purchase auxiliary contract content as a second hash value, generating a second target block to record the second hash value, and storing the second target block in a distributed system;
after the first target block and the second target block are detected, all user nodes in the distributed system acquire the first hash value from the first target block and acquire the second hash value from the second target block, and under the condition that the first hash value and the second hash value are the same, the transaction is completed.
2. The method of claim 1,
after the buyer user node agrees to the purchase auxiliary contract, calculating the hash value of the agreed purchase auxiliary contract content as a first hash value, including:
after the buyer user node agrees to the purchase auxiliary contract, splitting the agreed purchase auxiliary contract into a plurality of parts;
calculating a hash value for each part;
sequentially arranging all hash values obtained by calculation to obtain first combined data;
and recording the first combined data as the first hash value.
3. The method of claim 2, further comprising:
after the seller user node agrees with the purchase assistance contract, calculating the hash value of the content of the purchase assistance contract agreed by the seller user node as a second hash value, including:
after the seller user node agrees to the purchase assistance contract, splitting the agreed purchase assistance contract into a plurality of parts;
calculating a hash value for each part;
sequentially arranging all the hash values obtained by calculation to obtain second combined data;
and recording the second combined data as the second hash value.
4. The method of claim 3,
and under the condition that the first hash value is different from the second hash value, the buyer user node and the seller user node compare and find out different values of the first combined data and the second combined data, search a local document for a part of the purchase auxiliary contract corresponding to the different values, and transmit the part of the purchase auxiliary contract corresponding to the different values to an opposite user node.
5. The method of claim 1, further comprising:
in the event that the first hash value is different than the second hash value, a server of the distributed application issues an alert signal to indicate that the current purchase assistance contract may have been tampered with.
6. A system for abstracting information in a blockchain, comprising:
a buyer user node for: initiating a purchase request in the distributed application; after the purchase auxiliary contract is agreed, calculating the hash value of the agreed auxiliary contract content as a first hash value, generating a first target block to record the first hash value, and storing the first target block in a distributed system;
a server of a distributed application program for: drawing up a purchase auxiliary contract according to the commodity aimed at by the purchase request, and transmitting the purchase auxiliary contract to the buyer user node and the corresponding seller user node;
a vendor user node to: after the purchase auxiliary contract is agreed, calculating the hash value of the agreed purchase auxiliary contract content as a second hash value, generating a second target block to record the second hash value, and storing the second target block in a distributed system;
all user nodes in the distributed system for: and after the first target block and the second target block are detected, acquiring the first hash value from the first target block, acquiring the second hash value from the second target block, and completing the transaction under the condition that the first hash value and the second hash value are the same.
7. The system of claim 6,
the buyer user node is specifically configured to: after the purchase assistance contract, splitting the purchase assistance contract agreed by the purchase assistance contract into a plurality of parts; calculating a hash value for each part; sequentially arranging all hash values obtained by calculation to obtain first combined data; and recording the first combined data as the first hash value.
8. The system of claim 7,
the seller user node is specifically configured to: after the purchase assistance contract, splitting the purchase assistance contract agreed by the purchase assistance contract into a plurality of parts; calculating a hash value for each part; sequentially arranging all the hash values obtained by calculation to obtain second combined data; and recording the second combined data as the second hash value.
9. The system of claim 8,
the buyer user node and the seller user node are further configured to: and under the condition that the first hash value is different from the second hash value, different values of the first combined data and the second combined data are compared and found out, parts of the purchase auxiliary contract corresponding to the different values are searched in a local document, and the parts of the purchase auxiliary contract corresponding to the different values are transmitted to the opposite user node.
10. The system of claim 6,
the server of the distributed application program is further configured to: in the event that the first hash value is different from the second hash value, issuing an alarm signal to indicate that the current purchase assistance contract may be tampered with.
CN202010357924.2A 2020-04-29 2020-04-29 Information summarization method and system in block chain Pending CN111552742A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010357924.2A CN111552742A (en) 2020-04-29 2020-04-29 Information summarization method and system in block chain

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010357924.2A CN111552742A (en) 2020-04-29 2020-04-29 Information summarization method and system in block chain

Publications (1)

Publication Number Publication Date
CN111552742A true CN111552742A (en) 2020-08-18

Family

ID=72007885

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010357924.2A Pending CN111552742A (en) 2020-04-29 2020-04-29 Information summarization method and system in block chain

Country Status (1)

Country Link
CN (1) CN111552742A (en)

Similar Documents

Publication Publication Date Title
US10902017B2 (en) Synchronizing database data to a database cache
US20120089467A1 (en) System and method of capturing point-of-sale data and providing real-time advertising content
US20190012623A1 (en) Trade management method, trade management system and trade management device
CN110717809A (en) Vehicle transaction method and device based on big data, electronic equipment and computer readable medium
CN109003093A (en) The method, apparatus and system traced to the source for commodity
CN112308552A (en) Ordering method and device for medical insurance medicines
TW201305947A (en) Information providing device, information providing method, information providing program, and computer-readable recording medium with the program recorded therein
US20240169388A1 (en) Generating a Tokenized Reputation Score
US20070130201A1 (en) System, method, and computer program product for synchronizing price information among various sources of price information
US20170177695A1 (en) Synchronization of offline data
CA2865663A1 (en) Minimizing lead creation to contact time in a sales force
WO2023124209A1 (en) Data directory generation method and apparatus, data retrieval method and apparatus, and electronic device
CN111552742A (en) Information summarization method and system in block chain
US20230103398A1 (en) Security Deposits Using Tokenized Reputation Scores
US20160275535A1 (en) Centralized system for progressive price management
JP2004318379A (en) Merger and acquisition support system
KR20140087090A (en) Method and system for registering information of merchandise
JP2009129066A (en) Commodity distribution system
CN111784376A (en) Method and apparatus for processing information
JP7354365B1 (en) Information processing device, information processing method, and information processing program
CN111652694B (en) Order processing method and device and electronic equipment
US20220222679A1 (en) Systems and methods for integration of e-commerce data
US20220366472A1 (en) Providing entity recommendations for items
US20210366010A1 (en) Systems and methods for proactively informing users of an age of a merchant during online transactions
JP2002007647A (en) Supplier introduction system

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20200818

WD01 Invention patent application deemed withdrawn after publication