CN111930838A - Time-oriented distributed file management method - Google Patents

Abstract

The invention discloses a time-oriented distributed file management method. In the invention, the content that must be recorded from the user to obtain the right to operate the record file on the system is related to the label set in the file bar. When the user does not want to enjoy the right to record or arbitrate The user decides to cancel the user's right to record, and can make an appointment to record on the file bar, and controls the choice of time in the whole process, that is, the time between the file bar and the system adopts a separately set timing method.

Description

A Time-Oriented Distributed File Management Method

technical field

The invention relates to a method for recording distributed files of a blockchain system on the Internet, in particular to a time-oriented distributed file management method.

Background technique

Now archives also take on the model of the Internet, and data construction is faced with the dual challenges of information security and privacy protection. Existing information technology has encountered a big bottleneck in the face of large-scale archive records of centralized and relational databases. It is pointed out that blockchain technology can make information transfer from data to value. Based on the analysis of blockchain technology, the application of blockchain technology in decentralization and privacy protection has conceived the application scenario, which is the basis for the construction of archives. Bring new research ideas. Blockchain is the cutting-edge technology in the current security field. Blockchain is a data block chain structure arranged in chronological order. It is essentially a tamper-proof distributed database that uses cryptography to achieve the security of each link in a decentralized manner. Blockchain has the characteristics of decentralization, tamper-proof, anonymity, public verifiability, traceability, and open source code.

At present, in the vast majority of blockchain platforms, any node can access all data on the blockchain, so the issue of blockchain privacy and security is particularly prominent and has become an important research topic in the blockchain field. The current blockchain privacy technology mainly focuses on blockchain-based verifiable computing, blockchain data privacy, blockchain transaction address privacy, and blockchain transaction amount privacy. First, since blockchain, secure multi-party computation and verifiable homomorphic secret sharing are all designed to solve the problem of how untrusted groups work together, the combination of blockchain with secure multi-party computation and verifiable homomorphic secret sharing is inherently Advantage. Most of the existing homomorphic secret sharing and secure multi-party computation have the problem of large number of communication rounds and large amount of communication. However, in the blockchain environment, multiple rounds of communication and a large amount of communication data will inevitably lead to the reduction of the operation efficiency of the algorithm itself and the blockchain platform. Besides, since the nodes in the blockchain are not trustworthy, a large amount of communication data will bring a heavy verification burden to the nodes. Therefore, the study of homomorphic verifiable secret sharing and secure multi-party computation of low-round communication is of great significance for verifiable computation based on blockchain. Secondly, the problems of data privacy leakage and difficulty in supporting homomorphic computing are common in existing blockchain-based applications. Therefore, the study of a safe and efficient decentralized outsourcing computing mechanism that supports homomorphic computing can effectively solve the problems that it is difficult to support homomorphic computing and privacy leakage in blockchain application systems. Finally, according to the accounting method, the blockchain can be divided into a UTXO-based blockchain and an account-based blockchain. Because the miners in the account-based blockchain need to update the dynamically changing balance in real time, the balance hiding mechanism of the blockchain has certain difficulties. Therefore, the current blockchain platforms that provide the function of hiding amounts are all UTXO-based blockchains, while account-based blockchain platforms record all transactions in clear text.

SUMMARY OF THE INVENTION

In view of the deficiencies of the prior art, the present invention provides a block chain-based file management method, including: establishing a classification and transportation system, the classification and transportation system including a classification module, a block parallel module, and a global distribution center and pre-interrogation modules;

The class transfer module is used to check whether the ordinary user is given the right to become a temporary user, that is, to check whether the ordinary user has the right to record files in the classification and transfer system;

The block parallel module is used to store and record the user's files and perform file management services. The block parallel module includes N file strips and a memory strip, wherein the file strip is used to record the files that the temporary user needs to record. Block chain, memory strip is a block chain used to record the general identifier used by all atomic events and the noun represented by the atomic event corresponding to the general identifier; N is a natural number; a memory strip is only used to record all atomic events. The general identifier, the noun represented by the atomic event corresponding to the general identifier;

的存储区域，并且所述事件存储区中存储的输出时间变量

的值必须各不相同；The global distribution center is used to set the inspection conditions for whether to give ordinary users the authority to become temporary users, and to perform authority detection; the global distribution center contains a two-way pointer comparison area and an event storage area, and the two-way pointer comparison area is a storage area. The storage area of atomic events extracted from the atomic event sequence and used for comparison; the event storage area is to store the output time variable sent by the temporary user

the storage area, and the event storage area stores the output time variable

must have different values;

The pre-interrogation module is used to sort out the time validity periods of the time-valid atomic events included in all valid atomic event combinations.

The users in the classified transfer system include two or more resident users, two or more temporary users, and two or more ordinary users, wherein the resident users include one arbitrator user;

The arbitration user is a user who detects and sets the authority of the temporary user of the user and manages the classification and transfer system, and the arbitration user is responsible for managing the memory strip for recording the complete set of atomic events ∑;

The resident user is a fixed and active user on the classified transport system, and the number _of resident users is determined, which is N1, where N1 is _a positive integer, and the value _of N1 is determined by the arbitration user, except Each resident user of the arbitration user is responsible for managing a file bar, serving temporary users who need to record files on the managed file bar;

The temporary user is a user temporarily assigned in the classification and transfer system, and the temporary user has the right to record files on the file bar. The application of a common user to become a temporary user and the change from a temporary user to an ordinary user are all handled by the global user. The distribution center makes a ruling that the number of temporary users is 5×N ₁ , and the classification and transport system calculates the number of spare temporary users in real time, that is, the number of spare temporary users is 5×N ₁ minus the current number of temporary users. the number of temporary users in the classified transit system;

The ordinary user is a user other than the resident user and the temporary user on the classification and transfer system. The ordinary user has no right to record the file on the file bar. If the file needs to be recorded, the ordinary user must apply to become a temporary user;

A total clock is set on the sorting and transporting system, when the sorting and transporting system starts to run, the total clock starts timing, and the time unit of timing is microseconds;

A complete set of atomic events Σ is set in the classification and transport system, the complete set of atomic events Σ is a set containing all atomic events, and atomic events are general identifiers represented by nouns involved in the classification and transport system, and the Users in the categorization and transport system can supplement the complete set of atomic events ∑. When the users in the categorization and transport system query the memory bar, they find that the nouns to be used are not represented in the complete set of atomic events ∑. Supplement; the process of supplementing the complete set of atomic events ∑ is to use the general identifiers that have not been used in the complete set of atomic events ∑ to represent nouns, and add the general identifiers represented by the nouns to the complete set of atomic events ∑, which will be added to the complete set of atomic events. The atomic events of ∑ and the nouns represented by the corresponding atomic events are recorded by the arbitration user into a memory strip in the parallel module of the block, and the atoms of the complete set of atomic events ∑ are broadcast regularly to all users in the classification and transport system. The general identifier used by the event and the noun represented by the atomic event corresponding to the general identifier, and users in the classification and transportation system can query the memory stick. noun;

The universal identifier consists of fixed no more than M characters, the characters include uppercase letters, lowercase letters, numbers and underscores, the sequence of the characters that make up the universal identifier is different, the characters are different, the universal identifier is different, and the universal identifier is set It cannot start with an underscore, and the general identifier is used to represent atomic events; M is a positive integer, determined by the arbitration user, when the number of characters in the general identifier is not enough to represent the atomic event, the arbitration user can increase the value of M;

All resident users will update the valid word set E _Σ in advance every time ε elapses when the classification and transfer system starts to run. The valid word set E _Σ is a subset of the complete set of atomic events Σ, and the valid word set E _Σ contains all file entries. The label is expressed as a general identifier, the label is the noun that must be included in the file recorded on each file bar set by the resident user, the label of the file bar managed by each resident user is set, and the label of the file bar Expressed as a universal identifier, and check whether the label of the file strip is recorded on the memory strip, if not recorded, record the label and the universal identifier representing the label on the memory strip, if the file does not contain the label of the file strip, the file It cannot be recorded on the file bar corresponding to the label, and the label of each file bar must be distinguished from the labels of other file bars, each file bar is set with a label, and the label of each file bar is different, all labels It is expressed as a summary of common identifiers and put them into the set of valid words E _Σ ; the time length ε is determined by the arbitration user, and the unit is microseconds;

的区块链链条对应的标签表示成的通用标识符放入第一等有效词集合，存储的档案数量在所有档案条中记录的档案数量中占比多于等于

的区块链链条对应的标签表示的通用标识符放入第二等有效词集合，然后，存储的档案数量在所有档案条中记录的档案数量中占比多于等于

的区块链链条对应的标签表示的通用标识符放入第三等有效词集合，接着，存储的档案数量在所有档案条中记录的档案数量中占比多于等于

的区块链链条对应的标签表示的通用标识符放入第四等有效词集合，最后，存储的档案数量占比多于等于

的区块链链条对应的标签表示的通用标识符放入第五等有效词集合；When the valid word set E _Σ is updated each time, the arbitration user re-divides the valid word set E _Σ into five sub-valid word sets, and the five sub-valid word sets are subsets of the valid word set E _Σ , which are the first-class valid words respectively. Set, second-class valid word set, third-class valid word set, fourth-class valid word set, and fifth-class valid word set, the division is based on the files stored in the previous time length ε according to the file bar corresponding to the label The number is from more to less, the sub-valid word set is used to store the divided valid word set E _Σ , first, the number of stored files accounts for more than or equal to the number of files recorded in all file bars

The general identifier represented by the label corresponding to the blockchain chain is put into the first-class valid word set, and the number of stored files accounts for more than or equal to the number of files recorded in all file bars.

The general identifier represented by the label corresponding to the blockchain chain is put into the second-class valid word set, and then, the number of stored files accounts for more than or equal to the number of files recorded in all file bars

The general identifier represented by the label corresponding to the blockchain chain is placed in the third-class valid word set, and then, the number of stored files accounts for more than or equal to the number of files recorded in all file bars

The general identifier represented by the label corresponding to the blockchain chain is put into the fourth-class valid word set, and finally, the number of stored files accounts for more than or equal to

The general identifier represented by the tag corresponding to the blockchain chain is put into the fifth-class valid word set;

The labels stored in the first-class valid word set, the second-class valid word set, the third-class valid word set, the fourth-class valid word set, and the fifth-class valid word set are represented by the general identifiers according to the corresponding file entries. Arrange the number of stored files in descending order;

The general identifiers of the tags corresponding to each file entry are divided according to the order of the first-class valid word set, the second-class valid word set, the third-class valid word set, the fourth-class valid word set, and the fifth-class valid word set , once the general identifier represented by the label corresponding to each file bar is put into a sub-valid word set, it will not be put into other sub-valid word sets, and when the general identifier represented by the label corresponding to all file bars has been placed Enter the sub-valid word set, stop dividing, and the five sub-valid word sets can be empty sets.

The global distribution center is used to set the inspection conditions for whether to give ordinary users the authority to become temporary users, and to perform authority detection, specifically including: the global distribution center sets a pair of authority imports and authority exports as the inspection conditions, so The conditions of the above test are used to test whether the authority is given to ordinary users and the authority to cancel the temporary user. The import of the authority is used to measure whether the ordinary user can obtain the authority to become a temporary user. When the ordinary user becomes a temporary user, the authority The exit is used to measure whether to deprive ordinary users of temporary users;

Permissions are imported as

The export of permissions is

与(d＝T(e_in∈E_Σ))都成立，权限的进口满足条件；∧表示两端连接的式子都成立；Import representation of permissions

and (d=T(e _in ∈E _Σ )) are all established, and the import of authority satisfies the conditions; ∧ indicates that the formulas connecting both ends are established;

表示输入时间变量

的值范围在

与

之间，函数

表示在产生输入时间变量

时在所述归类转运系统中的总时钟中取时间的函数，函数

直接赋值产生输入时间变量

时总时钟上的时间，t表示总时钟上的时间；

表示产生输入时间变量

时在总时钟上取的时间加上时间延迟ε_t的值，ε_t和ε都表示一段时间长度，ε_t、ε的单位与总时钟的时间单位保持一致，为微秒，并且ε表示的时间长度的大小至少要大于等于5×ε_t；ε_t、ε的值由仲裁用户确定；d为恒等于值为真的布尔变量；f表示在总时钟上取时间的函数；输出事件e_out表示结束临时用户权限的动作；函数

表示在产生输出时间变量

时在所述归类转运系统中的总时钟中取时间的函数，直接赋值产生输出时间变量

时取总时钟的当前时间作为函数

的值；in,

represents the input time variable

The range of values is in

and

between, the function

represents the variable at the time the input was generated

time is a function of time taken in the total clock in the classified transport system, the function

Direct assignment produces input time variable

time on the total clock, t represents the time on the total clock;

Indicates that the input time variable is generated

The time taken on the total clock plus the value of the time delay ε _t , both ε _t and ε represent the length of a period of time, and the units of ε _t and ε are consistent with the time unit of the total clock, which is microseconds, and ε represents The size of the time length must be at least greater than or equal to 5×ε _t ; the values of ε _t and ε are determined by the arbitration user; d is a Boolean variable whose value is always equal to true; f represents the function of taking time on the total clock; the output event e _out Represents an action to end temporary user rights; function

Represents the variable at the time the output is generated

When the function of time is taken in the total clock in the classified transport system, the output time variable is generated by direct assignment.

Take the current time of the total clock as a function

the value of;

If an ordinary user needs to apply to become a temporary user in the classified transfer system, the specific steps include the following:

输入时间变量

为用户能够发送的在总时钟上的任意时间，普通用户申请成为临时用户时发送的输入时间变量

的值代表普通用户希望能够在归类转运系统运行到时间等于输入时间变量

的值时开启临时用户的权限；普通用户需要申请临时用户的权限时，产生输入时间变量

并为输入时间变量

赋值，产生输入时间变量

时同时产生函数

的值，即在产生输入时间变量

时在所述归类转运系统中的总时钟中取产生输入时间变量

时的时间赋值给

普通用户先发送一个输入时间变量

给仲裁用户，仲裁用户检测输入时间变量

的值是否满足在

的值与

的值之间，即检测

是否成立；如果申请时发送的输入时间变量

的值满足在

的值与

的值之间再允许普通用户发送输入事件e_in，否则申请的普通用户被拒绝成为临时用户，普通用户发送输入事件e_in的同时取f(e_in)的值；输入事件e_in为原子事件或者复合事件，输入事件e_in为原子事件时，表示通用标识符表示的名词，代表普通用户申请成为临时用户需要记录的档案中最重要的名词，由普通用户进行指定；输入事件e_in为复合事件时，输入事件e_in为包含两个以上名词的句子，代表普通用户申请成为临时用户需要记录的档案中最重要的句子，由普通用户进行指定；f(e_in)表示发送输入事件e_in时在总时钟上取发送输入事件e_in时的时间的函数；Step a1, the ordinary user first sends the input time variable to the arbitration user

input time variable

Any time on the total clock that the user can send, the input time variable sent when an ordinary user applies to become a temporary user

The value representing the average user would like to be able to run the categorization transfer system until the time equals the input time variable

When the value of the temporary user is enabled, the permission of the temporary user is enabled; when the ordinary user needs to apply for the permission of the temporary user, the input time variable is generated.

and for the input time variable

Assignment, yields input time variable

function at the same time

the value of , that is, at the time of generating the input variable

The input time variable is generated when taken from the total clock in the classified transport system

time assigned to

Ordinary users first send an input time variable

To the quorum user, the quorum user detects the input time variable

Whether the value of satisfies the

value with

between the values, that is, the detection

Is it true; if the input time variable sent at the time of application

The value of satisfies the

value with

Between the values of the input event e in , the ordinary user is allowed to send the input event e _in , otherwise the ordinary user who applies will be refused to become a temporary user, and the ordinary user sends the input event e _in and takes the value of f(e _in ); the input event e _in is an atomic event Or compound events, when the input event e _in is an atomic event, it represents the noun represented by the general identifier, which represents the most important noun in the file that the ordinary user applies to become a temporary user, and is specified by the ordinary user; the input event e _in is a compound event. When an event occurs, the input event e _in is a sentence containing more than two nouns, which represents the most important sentence in the file that ordinary users need to record when applying to become a temporary user, and is specified by ordinary users; f(e _in ) means sending the input event e _in The function of taking the time when the input event e _in is sent on the total clock;

Step a2, the arbitration user checks whether d=T(e _in ∈E _Σ ) is established, T(e _in ∈E _Σ ) means judging whether e _in ∈E _Σ is established, that is, judging whether the input event e _in belongs to the valid word set E _Σ , when e _in is an atomic event, the judgment result can be given directly. If the input event e _in is included in the first-class valid word set in the valid word set E _Σ , set the value of T(e _in ∈ E _Σ ) The result is true, and it is determined whether d=T(e _in ∈E _Σ ) holds, if the input event e _in is not included in the first-class valid word set in the valid word set E _Σ , then set T(e _in ∈ The result of E _Σ ) is false, and it is determined that d=T(e _in ∈ E _Σ ) does not hold; if the value of f(e _in ) is within the first time length ε after the total clock runs, the input sent by the user is not allowed Event e _in is a compound event;

Step a3, when the input event e _in is a compound event, it means that the input event e _in is a sentence describing two or more nouns, and the compound event is not sure whether it belongs to the first-class sub-valid word set in the valid word set E _Σ , then set The result of T(e _in ∈E _Σ ) is uncertain; when the result of T(e _in ∈E _Σ ) is uncertain, an arbitration user is required to determine and assign a value to T(e _in ∈E _Σ ). First, ordinary users Send the input event e _in to the arbitration user, the arbitration user receives the input event e _in , searches the input event e _in to extract the atomic events, and gives them to the ordinary users for sorting, and the ordinary users form the atomic event sequence of the input event e _in after sorting, The atomic event sequence includes the atomic events extracted from the input events e _in sorted by ordinary users, and the extracted atomic events are compared to determine the value of T(e _in ∈ E _Σ ). The specific process is as follows:

The arbitration user searches the sentence represented by the input event e _in , and extracts all the nouns contained in the sentence represented by the input event e _in . If the extracted noun can be queried in the memory, that is, the extracted noun is in the complete set of atomic events. The general identifier has been used in ∑ to represent, directly use the general identifier represented by the extracted noun _in the atomic event ensemble ∑ is not represented by general identifiers, ordinary users will use general identifiers to represent the extracted nouns as the atomic events of the nouns extracted from the input events e _in , and supplement them to the complete set of atomic events ∑, complete the supplementary atomic events The process of ensemble ∑, and ordinary users sort the atomic events represented by the nouns extracted from the input event e _in in descending order of importance to form an atomic event sequence, that is, the general identifiers represented by the nouns extracted from the input event e _in are represented by ordinary The atomic event sequence is placed in the order sorted by the user to form an atomic event sequence, and the global distribution center sequentially extracts the atomic events in the atomic event sequence into the two-way pointer comparison area for comparison in the order in which they are sorted in the atomic event sequence. The number of atomic events increases sequentially, the first time extracting one atomic event from the atomic event sequence, the second time extracting two atomic events from the atomic event sequence, ..., the rth time extracting r from the atomic event sequence Atomic event, r is a natural number, indicating the maximum number of times to extract from the atomic event sequence, each atomic event can only be extracted once, if all the atomic events included in the atomic event sequence have been extracted, stop the extraction;

The global distribution center assigns the labels in each sub-valid word set by the first-class valid word set, the second-class valid word set, the third-class valid word set, the fourth-class valid word set, and the fifth-class valid word set. They are respectively stored in the small storage area numbered 1, the small storage area numbered 2, the small storage area numbered 3, the small storage area numbered 4, and the small storage area numbered 5;

The small storage area numbered 1, the small storage area numbered 2, the small storage area numbered 3, the small storage area numbered 4, and the small storage area numbered 5 constitute the encoding storage area, and the encoding storage area is the storage label storage space, each small storage area is used to store all the tags in a sub-valid word set;

The global allocation center establishes a double-headed pointer, and the double-headed pointer is a pointer containing two pointer heads, one pointer head points to a small storage area in the coding storage area, and the pointer head pointing to the small storage area points to a small storage area each time comparison. After the comparison is completed, it points to a small storage area one larger than the number of the currently pointed small storage area, and the other pointer points to the two-way pointer comparison area. When the atomic event extracted for the first time is the same as the small storage area numbered 1 If one of the universal identifiers represented by the tags contained in the tag is equal, end the comparison immediately, set the result of T(e _in ∈ E _Σ ) to true, remove the atomic event in the comparison area of the two-way pointer, otherwise continue the comparison , when all the atomic events extracted for the second time are equal to the two general identifiers in the general identifiers represented by the tags in the small storage area numbered 2, the comparison is ended immediately, and the value of T(e _in ∈ E _Σ ) is set. The result is true, if only one of the atomic events extracted for the second time is equal to one of the universal identifiers represented by the tags in the small storage area numbered 2, remove the comparison result in the two-way pointer comparison area For equal atomic events, continue the next comparison. If the atomic events extracted for the third time have two or more atomic events that are equal to the general identifier represented by the tag in the small storage area numbered 3, set T(e _in ∈ E _Σ ) is true if the atomic event extracted for the third time has more than one atomic event equal to the universal identifier represented by the label in the small memory area numbered 3, and the comparison continues, if the atomic event extracted for the second time is equal If no atomic event in the event is equal to one of the universal identifiers represented by the tag in the small storage area numbered 2, then the atomic event extracted for the third time is equal to the universal identifier represented by the tag in the small storage area numbered 3 All are equal, the result of T(e _in ∈E _Σ ) can be set to be true..., and the comparison is continued until the small storage area numbered 5 is compared; once the result of setting T(e _in ∈E _Σ ) is true , remove the atomic events in the two-way pointer comparison area; when extracting, skip the extraction and comparison of the sub-valid sets of the empty set until all sub-valid sets have been extracted and compared; in the above comparison, from the two-way pointer comparison area Remove the atomic events that are equal to the universal identifier represented by the tag in the small storage area; and, if the atomic events in the atomic event sequence are not enough to be extracted during extraction, allow the user to select the atomic events in the two-way pointer comparison area to supplement the extracted atoms In the event, it participates in the comparison with the universal identifier represented by the label of the small storage area again. Each atomic event participates in the comparison at most twice. When the comparison cannot be performed, the comparison is terminated; in the above comparison, if there are more than half of the single time The extracted atomic event is equal to the universal identifier represented by the tag in the small store, or if there are more than one half of a single extracted atomic event equal to the universal identifier represented by the tag in the small store and two thirds The atomic event extracted in the above single extraction is equal to the universal identifier represented by the tag in the small storage area, and T(e _in ∈E _Σ ) is also set the result is true;

d=T(e _in ∈E _Σ ) means that the result of T(e _in ∈E _Σ ) is equal to the variable d, and the variable d is always a true Boolean variable, and the result of T(e _in ∈E _Σ ) is true , the value of variable d is equal to the result of T(e _in ∈E _Σ ), d=T(e _in ∈ E _Σ ) is established; if the input event e _in provided by ordinary users is an atomic event, the general The identifier is given to the arbitration user; the variable d is a Boolean variable that is pre-assigned to verify whether T(e _in ∈E _Σ ) is established; when the above judgment process does not determine that d=T(e _in ∈ E _Σ ) is established, the grant is refused. The rights of ordinary users who apply for temporary users;

的值，给予申请的普通用户成为临时用户的权限，并且临时用户的个数加一；如果事件存储区中存储的小于等于普通用户输入时间变量

的输出时间变量多于一个，选择将事件存储区中值最小的输出时间变量中从事件存储区中删除，并且空余的临时用户的个数减一，当总时钟到达普通用户设定输入时间变量

的值，给予申请的普通用户成为临时用户的权限，并且临时用户的个数加一；并且设定普通用户因不满足权限的进口的条件而拒绝授予临时用户的权利时，从拒绝授予临时用户的权利的时间开始ε时间长度内不再允许被拒绝的普通用户申请临时用户。When d=T(e _in ∈ E _Σ ) is established, the global distribution center checks whether the number of current temporary users reaches 5×N ₁ and whether the number of spare temporary users is greater than or equal to one, if both are No, the seat of a temporary user is locked, and the number of current vacant temporary users is reduced by one. When the total clock reaches the value of the input time variable set by the ordinary user, the ordinary user who applies is given the right to become a temporary user. If the current number of temporary users reaches 5×N ₁ , then check whether there is a stored output time variable in the event storage area whose value is less than or equal to the input time variable sent by the applied ordinary user. If the value of an output time variable is less than or equal to the input time variable sent by the applied user, the output time variable less than or equal to the input time variable sent by ordinary users is deleted from the event storage area, and the number of free temporary users is reduced by one. When the total clock reaches the normal user set input time variable

The value of , grants the applied ordinary user the right to become a temporary user, and the number of temporary users is increased by one; if the value stored in the event storage area is less than or equal to the input time variable of ordinary users

If there is more than one output time variable, choose to delete the output time variable with the smallest value in the event storage area from the event storage area, and reduce the number of free temporary users by one. When the total clock reaches the input time variable set by ordinary users

The value of , grants the applied ordinary user the right to become a temporary user, and the number of temporary users is increased by one; and it is set that when the ordinary user refuses to grant the temporary user the right because the import conditions of the permission are not met, the temporary user will be refused to be granted. The time of the right to start ε time length is no longer allowed ordinary users who are rejected to apply for temporary users.

表示输出事件e_out产生或者

成立，∨表示两端连接的式子有一个成立；The global distribution center is responsible for detecting the conditions for the exit of temporary user rights

Indicates that the output event e _out is generated or

is established, ∨ indicates that one of the expressions connecting both ends is established;

并同时为输出时间变量

赋值，在总时钟上取产生输出时间变量

时的时间值赋值给

临时用户发送的输出时间变量

表示临时用户希望在总时钟运行到输出时间变量

的值时停止临时用户的权限，检测临时用户发送的输出时间变量

的时间取值是否大于或等于

满足输出时间变量的取值条件后，全局分配中心将临时用户发送的输出时间变量

放置在事件存储区内；When the temporary user finishes recording files in the system, or the temporary user does not record files on the file bar for a continuous period of ε, apply to the arbitration user, and output an output event e _out after the arbitration user decides to immediately terminate the temporary user's authority, output The event e _out is the action that the arbitrator user decides to terminate the temporary user authority; the number of current temporary users is reduced by one, and the number of free temporary users is increased by one; send an output time variable

and at the same time for the output time variable

Assignment, take on the total clock to generate the output time variable

The time value of when is assigned to

Output time variable sent by temporary user

Indicates that a casual user wishes to run to the output time variable at the total clock

When the value of , stop the temporary user's permission, and detect the output time variable sent by the temporary user

Whether the value of time is greater than or equal to

After satisfying the value condition of the output time variable, the global distribution center will assign the output time variable sent by the temporary user.

placed in the event store;

一直存储在事件存储区内，在总时钟运行到输出时间变量

的值之前没有被删除，当到达总时钟运行到输出时间变量

的值时，全局分配中心将临时用户发送的输出时间变量

从事件存储区中删除；当总时钟运行到输出时间变量

的值时，停止临时用户的权限，变为普通用户；

表示临时用户发送的输出时间变量

的时间取值为大于或等于

函数

表示在产生输出时间变量

时在所述归类转运系统中的总时钟中取时间的函数，直接赋值产生输出时间变量

时取总时钟上的时间作为函数

的值，

表示产生输出时间变量

时在总时钟上取的时间加上两倍的时间延迟ε_t的值；t₁为在验证权限的进口时，在总时钟上取验证权限的进口时的开始时间点；t₂为在验证权限的出口时，在总时钟上取验证权限的出口时的开始的时间点。If the output time variable

Always stored in the event memory area, when the total clock runs to the output time variable

The value was not removed before when the total clock run to the output time variable is reached

When the value of , the global distribution center will temporarily user send the output time variable

Removed from event memory; when total clock runs to output time variable

When the value of , stop the authority of the temporary user and become a normal user;

Represents an output time variable sent by a temporary user

The time value is greater than or equal to

function

Represents the variable at the time the output is generated

When the function of time is taken in the total clock in the classified transport system, the output time variable is generated by direct assignment.

Take the time on the total clock as a function of

the value of ,

Represents the output time variable

is the value of the time taken on the total clock plus twice the time delay ε _t ; t ₁ is the start time point when the import of the verification authority is taken on the total clock when the verification authority is imported; t ₂ is the start time point when the verification authority is imported. At the time of exit of authority, the time point when the exit of authority is verified is taken on the total clock.

Δ两种，忽略时间有效原子事件上标注的时间有效期，

符号表示连接的时间有效原子事件对应的名词都需要包含在用户记录的档案中，Δ符号表示连接的时间有效原子事件中的一个或两个以上时间有效原子事件对应的名词需要被包含在用户记录的档案中；时间有效原子事件对应的名词为忽略时间有效期，查看时间有效原子事件对应的原子事件表示的名词；The block parallel module includes N file strips and a memory strip, wherein each file strip contains more than two connected blocks, and each file strip has an asynchronous time clock, that is, each asynchronous time clock. Corresponding to a file bar, it is used to time the corresponding file bar. At the same time in each same asynchronous time clock, only one block in the file bar corresponding to the asynchronous time clock can be recorded. The classification and transfer system allows more than two file strips to be recorded at the same time at the same time of the total clock, and the same file strip can only be recorded in one block; N is a natural number, determined by the arbitration user; except for the memory strip, each Each file bar is maintained by a resident user. Conditional constraints and labels are set for each file bar. The label is broadcast to all temporary users. The label of each file bar is different, and the label is modified every time elapsed From the time the classification and transfer system starts running, the timing of the ε time length is performed on the total clock; the conditional constraints are invisible to all temporary users, and the files recorded by the temporary users can only be recorded in the file if they meet the conditions set in the file bar. In the file bar, that is, the conditional constraint is used to limit whether the file can be recorded on the file bar corresponding to the conditional constraint. The conditional constraint includes a satisfaction constraint and an isolation constraint, and the conditional constraint is satisfied only when both the satisfaction constraint and the isolation constraint are satisfied. where the satisfaction constraint is described as the connection of time-effective atomic events and symbols, and the symbols of the satisfaction constraints contain

ΔTwo, ignoring the time validity period marked on the time valid atomic event,

The symbol indicates that the nouns corresponding to the time-valid atomic events of the connection need to be included in the file of the user record, and the Δ symbol indicates that the nouns corresponding to one or more time-valid atomic events in the time-valid atomic events of the connection need to be included in the user record. in the file; the nouns corresponding to the time-valid atomic events are the nouns represented by the atomic events corresponding to the time-valid atomic events, ignoring the time validity period;

A time-valid atomic event is an atomic event marked with a valid time period. A time-valid atomic event means that the atomic event is valid only within the valid time period marked on it. The time period of the valid time period marked on the atomic event is restricted by the corresponding file bar. When the block on the file bar starts recording, the asynchronous time clock of the file bar starts timing, and the timing starts from zero. The unit of each asynchronous time clock is determined by the resident user who manages the file bar. ; The time validity period is a time interval, which is used to mark the valid time of the atomic event;

The isolation constraints of each file bar include atomic events that are not allowed to be included in the files recorded in the file bar, and the file contains a noun represented by an atomic event in the isolation constraint, and cannot be recorded on the file bar corresponding to the isolation constraint.

The block parallel module sets up a block valid event set, and the general identifiers represented by the nouns contained in the record files are recorded in all file bars, so as to form a block valid event set as an atomic event, and the block valid event set consists of each constant. The resident user is supplemented and formed, the block valid event set contains the valid word set E _Σ , and the block valid event set is a subset of the full set Σ of atomic events; the resident user of the file bar ignores the time valid atomic events in the satisfaction constraint above The time validity period of the label, each atomic event in the valid word set must be included in a satisfactory constraint, and the time validity period marked on all time valid atomic events must cover the period of asynchronous time clock work of all file bars , that is, each time point from the start of the block parallel module to the stop of the block parallel module must be included in the time validity period of a time-effective atomic event, and the atomic event set contained in each isolation constraint must be different;

Each atomic event in the set of valid words must be contained within a satisfactory constraint, and setting the time validity period marked on all time-valid atomic events must override the period of asynchronous time clock operation of all file bars, that is, from the Each time point from when the block parallel module starts to run to when the block parallel module stops running must be included in the time validity period of a time valid atomic event, and the atomic event sets contained in each isolation constraint must be different;

The method for checking satisfactory constraints is: starting from the time when the user receives the transaction and ending with the average delay ε1 as the constraint detection interval, the constraint detection interval is used to detect whether the files that the user needs to record satisfy the satisfied constraints The time validity period marked on the time-valid atomic event; the block parallel module extracts the time-valid atomic events contained in the satisfied constraints, removes the empty time-valid atomic events, and checks whether the time-validity period marked on the time-valid atomic events includes all the time valid atomic events. At any time point in the constraint detection time interval, the time valid atomic event corresponding to the time validity period of any time point in the constraint detection interval is extracted, and the time validity period marked on the extracted time valid atomic event is removed to become an atomic event. , as the extracted atomic event, extract the general identifier represented by the noun contained in the file of the temporary user record, and find the intersection with the set composed of the extracted atomic events. If the intersection is an empty set, directly cancel the temporary user's current application in the file entry. For the right recorded on the above, if there is an intersection, the time validity period of the original label that was removed is still added to the obtained intersection, as a useful time valid atomic event set;

与符号

相连的右边的后一个时间有效原子事件的标号在与同一个符号

相连的左边的前一个时间有效原子事件的标号基础上加一，而从左到右遇到符号Δ，与符号Δ相连的右边的后一个时间有效原子事件的标号与同一个符号Δ相连的左边的前一个时间有效原子事件的标号的值相等，并且规定满意约束中的括号不存在嵌套，括号内的满意约束的子式看做一个整体，如果两个满意约束的子式被符号Δ相连，并且两个满意约束的子式都被放置在括号内，与符号Δ相连的右边的括号内的满意约束的子式中包含的从左到右的第一个时间有效原子事件的标号与同一个符号Δ相连的左边的另一个括号内的满意约束的子式中所有时间有效原子事件的标号值中的最小值一样；如果两个满意约束的子式被符号

相连，并且两个满意约束的子式都被放置在括号内，与符号

相连的右边的括号内的满意约束描述的子式中包含的从左到右的第一个时间有效原子事件的标号比同一个符号

相连的左边的另一个括号内的满意约束描述的子式中所有时间有效原子事件的标号值的最大值加一，括号内的满意约束的子式重复上述对所述满意约束描述的式子从左到右检查的过程，直到检查到满意约束的右边最后一个时间有效原子事件；Next, the resident user searches for all valid atomic event combinations from the satisfaction constraints, and the method for finding the valid atomic event combinations is: checking the satisfactory constraints of the file bar to be recorded from left to right, and labeling the time-valid atomic events encountered , the first time valid atomic event is labeled as 1, and if the subsequent symbol is encountered from left to right

ampersand

The label of the next time-valid atomic event to the right of the concatenation is in the same symbol as

The label of the previous time-valid atomic event on the left side of the connection is incremented by one, and the symbol Δ is encountered from left to right, and the label of the next time-valid atomic event on the right side connected to the symbol Δ is the left side of the same symbol The values of the labels of the valid atomic events at the previous time are equal, and there is no nesting of parentheses in the satisfied constraints, the sub-formulas of the satisfied constraints in the brackets are regarded as a whole, if two sub-formulas of the satisfied constraints are connected by the symbol Δ , and both sub-formulas with satisfied constraints are placed in parentheses, the first time-effective atomic event from left to right contained in the sub-formula with satisfied constraints on the right-hand side connected to the symbol Δ is the same as the The minimum of the label values of all time-valid atomic events in another parenthesized subformula to the left of a symbol Δ is the same; if two subformulae satisfying the constraint are signed

are connected, and both subformulas satisfying the constraints are placed in parentheses, and the ampersand

The first time-effective atomic event from left to right contained in the subformula described by the satisfied constraints enclosed in parentheses on the right side is more than the same symbol

The maximum value of the label value of all time valid atomic events in the sub-formula described by the satisfaction constraint in another parenthesis on the left side of the adjacent one is increased by one, and the sub-formula of the satisfaction constraint in the brackets repeats the above-mentioned formula for the description of the satisfaction constraint from The process of left-to-right checking until the last time-valid atomic event on the right that satisfies the constraints is checked;

All valid atomic event combinations are all possible combinations of time-valid atomic events that are satisfied by the files recorded by the temporary user when the files of the temporary user record satisfy the satisfactory constraints, and all valid atomic event combinations are used to detect Whether the user record file satisfies the satisfaction constraint, the specific composition process of valid atomic event combination is as follows: check the labels of all time valid atomic events in the satisfied constraint, and the numerical values of all positive integer labels from 1 to the largest label correspond to Take one each of the time valid atomic events, that is, take one time valid atomic event corresponding to the value of each label corresponding to the label starting from 1 to the largest to form a valid atomic event combination. All possible valid atomic event combinations are one For a list, the largest label in the combination of valid atomic events is the largest value in the labels of all valid atomic events in the satisfied constraints; the sub-expressions in the satisfied constraints are placed in parentheses, and more than two brackets are not allowed to be nested, and the satisfied constraints The symbols of the connection between the parentheses in the constraint are the same. If the Δ connection is used between the parentheses, the number of time-effective atomic events contained in the subformulae in the two parentheses is equal. It is allowed to place empty time-effective atomic events, and empty time-effective atomic events are allowed. The symbol of the atomic event is represented by τ, which means that it does not represent any noun, and the time validity period marked on the empty time-effective atomic event is ∞, indicating that the empty time-effective atomic event is always valid during the operation of the classified transport system;

The resident user can modify the satisfaction constraints of the set management file bar. The set satisfaction constraints must meet two conditions, the first condition: the satisfactory constraint must contain the label of the management file bar, the second condition: start recording in the file bar Any time after that must be included in one or more of the valid atomic event combinations set by the current file bar within the time validity period originally marked for all atomic events.

相连的时间有效原子事件标注的时间有效期保持一致；在所述转类模块进行的比较中忽略空的时间有效原子事件，即空的时间有效原子事件不参与比较，只比较其他时间有效原子事件是否满足条件；并且，所有有效原子事件组合中包含的时间有效原子事件的时间有效期也用于在时间上限定临时用户预约写档案的次数。The class transfer module is used to check whether the temporary user is given the right to record files in the classification transfer system, including: the class transfer module will extract all time-effective atoms in the set of useful time-effective atomic events. The event is compared with all valid atomic event combinations one by one. If the extracted useful time-valid atomic event set contains all the time-valid atomic events in the valid atomic event combination except for the empty time-valid atomic event, obtain each of the included time-valid atomic events. The intersection of the time validity periods marked on all the time-valid atomic events in the valid atomic event combination is used as the intersection interval. If the constraint detection interval has an intersection with any intersection interval, it will be given to the temporary user on the file bar corresponding to the satisfied satisfied constraint. The right to record, if there is no intersection between the constraint detection interval and any intersection interval, the temporary user's right to record on the file bar corresponding to the satisfied satisfied constraint is rejected; if the useful time-valid atomic event set contains more than one valid All time-valid atomic events in the atomic event combination, and the constraint detection interval has an intersection with more than one intersection interval, give the temporary user the right to record the file on the file bar once more, and set all the direct use symbols

The time validity periods marked by the connected time-valid atomic events are consistent; the empty time-valid atomic events are ignored in the comparison performed by the class transfer module, that is, the empty time-valid atomic events do not participate in the comparison, and only compare whether other time-valid atomic events are valid. The conditions are met; and the time validity period of the time-valid atomic events included in all valid atomic event combinations is also used to limit the number of times the temporary user reserves the time to write files.

The pre-interrogation module is used to sort out the time validity period marked on the time-effective atomic events included in all the effective atomic event combinations, and is used to limit the number of times the temporary user schedules to write files, including:

When a temporary user applies for an appointment to write a file service, the pre-interrogation module starts to organize the time validity period, including: when the asynchronous clock of each file bar starts to count, that is, when the first file is recorded on the file bar, the pre-interrogation module starts to classify the time period. The time is taken from the total clock of the transfer system, that is, the time of the first file recorded on the file strip is taken under the operation of the master clock;

The pre-interrogation module adds the start time point and the end time point of the time validity period marked on the time valid atomic events included in all valid atomic event combinations respectively plus the corresponding file bar to record the first file under the operation of the total clock. time, respectively as the start time point and the end time point of the adjusted time validity period, thereby obtaining the adjusted time validity period; the adjusted time validity period is the time period represented by the time validity period under the operation of the total clock;

The pre-interrogation module calculates the applicable period of all valid atomic event combinations, so that the temporary user can make reservations to write files, and the minimum unit of time when making reservations is the maximum value among the minimum units of the asynchronous time clocks of all file bars, and the The validity period is the intersection of the time validity periods marked on all time valid atomic events included in each valid atomic event combination after adjustment. The validity period is marked on the time axis. The minimum unit of the time axis is the maximum value among the minimum units of the asynchronous time clocks of all file bars. The left and right endpoints of each validity period are marked on the time axis. The unit is adjusted to the maximum value of the minimum units of the asynchronous time clocks of all file bars, and the starting point of the time axis is the minimum value of the starting timing points of all asynchronous time clocks, starting from the left endpoint of the minimum value of all applicable periods. , along the time axis from left to right to the direction of time growth, the left and right endpoints of the validity period marked on the time axis are collectively referred to as endpoints, and the origin of the time axis is the first endpoint, every two endpoints The time interval between is used as a divided interval, and the divided interval is used to limit the number of reservation time points that can be reserved in the time interval represented by the divided interval; if the divided interval is not for any applicable period For the intersection, the level of the split interval is marked as 1. If the split interval is the intersection of two applicable periods, the level of the split interval is marked as 2. If the split interval is the intersection of three applicable periods, the level of the split interval is marked as 3. , and so on, if the division interval is the intersection of all applicable periods, the grade of the division interval is marked as d+1, and d is the number of all applicable periods, which is a positive integer;

The class transfer module allows reservation time points from more to less reservations in the division interval corresponding to the division level according to the division level of the division interval from low to high, and reservations can be reserved in the division interval where the level of the division interval is 1 The number of time points is d+1, and the number of time points that can be reserved in the segmented interval whose level is 2 is d, ..., and so on, the level of the segmented interval is d The number of time points that can be reserved for reservations in the divided interval of +1 is 1; the number of times users can reserve to write files is limited in time, that is, the time points that can be reserved are pre-arranged in time. After the arrangement, temporary users can Appointment service.

The resident user receives the reservation service of the temporary user, and the reservation service is responsible for writing the file on the file strip for the temporary user reservation time, and it is stipulated that each temporary user has the right to make three reservations, and the temporary user selects the file for the reservation to write the file according to the label. Article, the reservation is only opened in the reservation time period, and the reservation time period is the time period taken from the total clock in the classification and transport system, and the unit is microseconds, and modifications are not allowed within the reservation time period. Constraints; the length of the reservation time period and the specific value of the reservation time period are specified by the management user; the temporary user sends the files that need to be recorded for the reservation, and the resident user receives the files that need to be recorded during the reservation, and calls the local timestamp of the selected record file bar The function J(t _b ) first sets the value of t _b to zero to obtain the value of the local time stamp function J(t _b ) of the file bar that selects the record when t _b =0. The value of the local timestamp function J(t _b ) of the selected file bar at t _b =0 is marked on the file of , become atomic events extracted, the extracted atomic events form a block valid atomic event set, the nouns contained in the files that need to be recorded when the resident user searches for the temporary user's appointment, are expressed as atomic events and combined into a set of atomic events, Seek the intersection with the effective atomic event set of the block, and the obtained intersection is used as the searched atomic event set, and the time validity period and the empty time effective atomic event are ignored during the search; then, find the effective atomic event that the searched atomic event set satisfies Event combination, that is, the searched atomic event set contains all time valid atomic events in a valid atomic event combination, then the included valid atomic event is a satisfied valid atomic event combination, and the temporary user is notified that all valid atomic event combinations are satisfied. The intersection of the time validity periods marked on all time-valid atomic events, the value t _b provided by the temporary user reservation must be within the intersection of the time validity periods of all time-valid atomic events in the satisfied combination of valid atomic events, and the temporary user's profile marked on The value must be less than the value of the left endpoint of the intersection of the time validity periods of all time-valid atomic events in the satisfied combination of valid atomic events; and t _b > 0, to obtain the local timestamp function J(t _b ), the local time stamp function J(t b ) will be obtained. The value obtained by the time stamp function J(t _b ) is compared with the value stored in the time-use space. If the value obtained by calculating the local time-stamp function J(t _b ) is equal to the value stored in the time-use space or the local time is calculated The value obtained by the stamp function J(t _b ) plus the time when the first file is recorded on the reserved file strip and the number of time points that can be reserved for reservation in the divided interval have all been used up, and the temporary user is notified to modify For the value of t _b , the chance of providing the reserved value t _b again after the temporary user is modified is three times. If the temporary user is not notified of the modification, the value obtained by the local timestamp function J(t _b ) is put into the time usage space, and the local time The value obtained by the timestamp function J(t _b ) and the files that need to be recorded during the reservation are written into the smart contract. The content of the smart contract is: the asynchronous local clock of the file bar reserved by the temporary user goes to the local timestamp function J(t _b ) The obtained value automatically writes the file that needs to be recorded during the reservation into the file bar reserved by the temporary user, then, the value obtained by obtaining the local timestamp function J(t _b ) plus the first record on the reserved file bar The sum of the time of each file and the number of time points in the divided interval where the reservation can be reserved minus one, if the value obtained by calculating the local timestamp function J(t _b ) is added to the reserved file strip The first file recorded on the strip The sum of the time of t b is not in any segment, and the reservation service cannot be provided. After the resident user modifies the conditional constraints or the temporary user modifies the value of t _b , check whether the reservation service can be provided.

The local time stamp function J(t _b ) is a function of taking time on the asynchronous time clock of each file strip, and the definition of J(t _b ) is as follows:

Among them, b is the number of the file strip with the local timestamp function J(t _b ), and the number of the file strip is incremented in the ascending order of the time of the first file recorded in each file strip, and is a positive integer. The value is less than or equal to N; t _b is a time length, and the unit is the time unit of the non-local clock of the file bar number b. The reservation value provided by the temporary user when making a reservation is used to distinguish the file bar number b. When taking the time from the asynchronous time clock, whether to take the time when the local timestamp function J(t _b ) is currently called, or the time after the current local timestamp function J(t _b ) is called, when t _b =0, take The time when the local time stamp function J(t _b ) is currently called, when t _b > 0, the time after the current local time stamp function J(t _b ) is called; at the same time, if t _b > 0, t _b is the user's serial number is the difference between the time reserved for recording the file on the asynchronous time clock of the file bar of b and the time between q _b , the unit of t _b is the same as the unit of the asynchronous time clock of the file bar numbered b; q _b is a time point, which is equal to the time taken from the asynchronous time clock of the file bar numbered b when the local timestamp function J(t _b ) is called, that is, the local timestamp of the call is taken from the asynchronous time clock numbered b The value of time at function J(t _b ) is taken as the value of time point q _b ; the local timestamp function J(t _b ) is equal to the value of time point q _b when t _b =0, and when t _b >0 It is equal to the sum of the value of time q _b plus the value of t _b ; and the value of the local time stamp function J(t _b ) is set to be greater than or equal to the value of the local time stamp function J(t _b ), and it is taken on the asynchronous time clock when the local time stamp function J(t b ) is called. The value of time, and the function value obtained by calling the local timestamp function J(t _b ) is set to be different each time. When t _b = 0, when calling the local timestamp function J(t _b ) function, the local timestamp does not need to be recorded. The value of the function J(t _b ) function, and when t _b > 0, the value of calling the local timestamp function J(t _b ) function is recorded in the time usage space, each file has a time usage space, so The above-mentioned time usage space is the storage space for placing the reserved time point when the temporary user reserves to record the file on the file bar numbered b, and the reserved time point is the time taken from the asynchronous time clock of the reserved file bar.

Studying the blockchain balance hiding mechanism can make up for the lack of balance hiding mechanism in the existing blockchain technology center. From the perspective of blockchain privacy, research is carried out in three aspects: one-round communication verifiable homomorphic secret sharing and secure multi-party computing, blockchain-based decentralized outsourcing computing mechanism and blockchain balance hiding mechanism. The beneficial effects of the present invention are as follows:

(1) In terms of low-round communication verifiable homomorphic secret sharing and secure multi-party computation, in order to deal with the problem that the blockchain is severely limited by the number of communication rounds and traffic volume, three verifiable secret sharing algorithms based on Shamir secret sharing algorithm are progressively proposed. The cryptographic schemes are one-round communication verifiable first-order multiplicative homomorphism secret sharing scheme (NVHSS), one-round communication verifiable fully homomorphic secret sharing scheme (NVFHSS) and one-round communication secure multi-party computation scheme (AntNest).

(2) In terms of outsourcing computing mechanism based on blockchain, in order to solve the problems of privacy leakage and difficulty in supporting homomorphic computing in blockchain application systems, the working principle of blockchain is combined. The proposed NVHSS algorithm and NVFH SS algorithm propose a decentralized outsourcing computing mechanism (DOC) that supports efficient homomorphic multiplication. In this machine, under the premise of ensuring data privacy, decentralized nodes can provide users with verifiable outsourced computing services, and can greatly reduce the data verification burden and storage space for users and server nodes.

(3) In terms of the privacy of blockchain transaction amount, combined with cryptographic technologies such as range proof, Pedersen commitment and zero-knowledge proof, a blockchain balance hiding mechanism is proposed, including the process of creating an anonymous coin account and an anonymous coin payment process. This mechanism is the first mechanism to realize the blockchain balance hiding function, which makes up for the lack of balance hiding mechanism in the existing blockchain technology center. On the one hand, the account creation process generates an anonymous currency account for the user, and deposits a certain amount of tokens from the public currency account to the anonymous currency account, which solves the problem of "where does the anonymous currency come from". On the other hand, the anonymous currency payment process realizes confidential transactions between anonymous currency accounts, and hides the transfer amount and user balance in a real-time, secure and verifiable way.

Description of drawings

The present invention will be further described in detail below with reference to the accompanying drawings and specific embodiments, and the advantages of the above or other aspects of the present invention will become clearer.

Figure 1 is a flow chart of the method of the present invention.

Detailed ways

The present invention will be further described below with reference to the accompanying drawings and embodiments.

Embodiment 1: As shown in FIG. 1 , this embodiment provides a blockchain-based file management method, including: establishing a categorization and transport system, the categorization and transport system includes a categorization module and a block parallel module. , global distribution center and pre-interrogation module;

The class transfer module is used to check whether the ordinary user is given the right to become a temporary user, that is, to check whether the ordinary user has the right to record files in the classification and transfer system;

The block parallel module is used to store and record the user's files and perform file management services. The block parallel module includes N file strips and a memory strip, wherein the file strip is used to record the files that the temporary user needs to record. Block chain, memory strip is a block chain used to record the general identifier used by all atomic events and the noun represented by the atomic event corresponding to the general identifier; N is a natural number; a memory strip is only used to record all atomic events. The general identifier, the noun represented by the atomic event corresponding to the general identifier;

的存储区域，并且所述事件存储区中存储的输出时间变量

的值必须各不相同；The global distribution center is used to set the inspection conditions for whether to give ordinary users the authority to become temporary users, and to perform authority detection; the global distribution center contains a two-way pointer comparison area and an event storage area, and the two-way pointer comparison area is a storage area. The storage area of atomic events extracted from the atomic event sequence and used for comparison; the event storage area is to store the output time variable sent by the temporary user

the storage area, and the event storage area stores the output time variable

must be different;

The pre-interrogation module is used to sort out the time validity periods of the time-valid atomic events included in all valid atomic event combinations.

The users in the classified transfer system include two or more resident users, two or more temporary users, and two or more ordinary users, wherein the resident users include one arbitrator user;

The arbitration user is a user who detects and sets the authority of the temporary user of the user and manages the classification and transfer system, and the arbitration user is responsible for managing the memory strip for recording the complete set of atomic events ∑;

The resident user is a fixed and active user on the classified transport system, and the number of resident users is determined, which is N ₁ , and N ₁ is a positive integer. The value of N ₁ is determined by the arbitration user, except Each resident user of the arbitration user is responsible for managing a file strip, serving temporary users who need to record files on the managed file strip; the general identifier consists of fixed no more than M characters, and the characters are uppercase letters, lowercase letters, numbers , underscore, the sequence of the characters that make up the general identifier is different, the characters are different, the general identifier is different, and it is stipulated that the general identifier cannot start with an underscore; M is a positive integer, and the value of M is determined by the arbitration user, when the general identifier When the number of characters in is not enough to represent atomic events, the arbitrator user can increase the value of M; for example, the value of M is determined by the arbitrator user to be 5, and the general identifier can be AB_12, Ab_12, Ab_13, etc.; the general identifier is expressed as a noun can be added to the complete set of atomic events ∑ to supplement the complete set of atomic events The general identifier AB_12 above represents books, and cannot represent other nouns; the value of N in the present invention is between 50 and 100, and the value of N can be modified and increased, that is, the number of file bars is expanded; in the present invention, N ₁ Equal to N plus one, the initial value of M is 10; the variable q in the present invention is the time point taken on the asynchronous time clock;

输入时间变量

代表用户能够发送的在总时钟上的任意时间，输入时间变量

等于1050微秒，代表用户希望能够在系统运行到时间等于输入时间变量

的值10500微秒时开启临时用户的权限；并且用户需要申请临时用户的权限时，产生输入时间变量

并为输入时间变量

赋值，在产生输入时间变量

时在所述归类转运系统中的总时钟中取时间赋值给

产生输入时间变量

时在总时钟上的时间为10000微秒，因此

的值为10000微秒；输入时间变量

等于10500微秒，εt的值设为2000微秒，仲裁用户检测输入时间变量

的值10500微秒满足在

微秒与

微秒之间；用户发送输入事件e_in，其后，再检测d＝T(e_in∈E_Σ)是否成立，T(e_in∈E_Σ)表示判断e_in∈E_Σ是否成立，即判断输入事件e_in是否属于有效事件集合E_Σ中第一等有效词集合，当e_in为原子事件时，能够直接给出判断的结果，如果输入事件e_in被包含在有效事件集合E_Σ中第一等有效词集合内，设定T(e_in∈E_Σ)的结果为真，并判定d＝T(e_in∈E_Σ)成立；如用户发送输入事件e_in等于AB_12，输入事件e_in为原子事件而有效事件集合E_Σ中的第一等有效词集合包含AB_12，T(e_in∈E_Σ)的结果为真；假设时间长度ε为10000微秒，输入事件e_in产生的f(e_in)等于10100微秒，因此在第二个时间长度内，可以输入复合事件；假设输入事件e_in为复合事件，表示输入事件e_in为描述包含两个以上关键词的句子，复合事件不确定是否属于有效事件集合E_Σ，则T(e_in∈E_Σ)的结果为不确定；当T(e_in∈E_Σ)的结果为不确定，需要仲裁用户来判定并给T(e_in∈E_Σ)赋值，首先，用户发送输入事件e_in给仲裁用户，仲裁用户接收输入事件e_in，仲裁用户对输入事件e_in代表的句子进行搜索，将输入事件e_in代表的句子中包含的所有名词都提取出来，输入事件e_in为我的书本是课本，提取两个名词，分别是书本与课本，发现课本不在原子事件全集∑中，使用通用标识符CV0_l表示课本，加入到原子事件全集∑中；The global distribution center is to set up a pair of permission import and permission export. The permission import is used to measure whether the user can obtain the permission to become a temporary user. When the user becomes a temporary user, the permission outlet is used to measure whether to cancel it. Temporary user authority of the user; if the user needs to apply to become a temporary user in the classification and transfer system, he or she will have the right to record files in the system after becoming a temporary user, first send the input time variable to the arbitrator user

input time variable

Represents any time on the total clock that the user can send, enter the time variable

Equal to 1050 microseconds, which means that the user wants to be able to run the system until the time is equal to the input time variable

When the value of 10500 microseconds, the permission of the temporary user is enabled; and when the user needs to apply for the permission of the temporary user, the input time variable is generated

and for the input time variable

assignment, variable at the time of generating the input

When the time is assigned to the total clock in the classified transport system

generate input time variable

time on the total clock is 10000 microseconds, so

is 10000 microseconds; enter the time variable

Equal to 10500 microseconds, the value of εt is set to 2000 microseconds, the arbitration user detects the input time variable

A value of 10500 microseconds is satisfied at

microseconds with

Between microseconds; the user sends the input event e _in , and then checks whether d=T(e _in ∈E _Σ ) is established, T(e _in ∈E _Σ ) means to judge whether e _in ∈E _Σ is established, that is, judgment Whether the input event e _in belongs to the first-class valid word set in the valid event set E _Σ , when e _in is an atomic event, the judgment result can be directly given, if the input event e _in is included in the valid event set E _Σ The first In the first-class valid word set, set the result of T(e _in ∈E _Σ ) as true, and determine that d=T(e _in ∈ E _Σ ) is established; if the user sends the input event e _in equal to AB_12, the input event e _in For atomic events, the first-class valid word set in the valid event set E _Σ contains AB_12, and the result of T(e _in ∈ E _Σ ) is true; assuming that the time length ε is 10000 microseconds, the input event e _in produces f( e _in ) is equal to 10100 microseconds, so in the second time length, a compound event can be input; assuming that the input event e _in is a compound event, it means that the input event e _in is a sentence describing more than two keywords, and the compound event does not To determine whether it belongs to the valid event set E _Σ , the result of T(e _in ∈E _Σ ) is uncertain; when the result of T(e _in ∈E _Σ ) is uncertain, the arbitration user is required to determine and give T(e _in ∈ E Σ ) ∈E _Σ ) assignment, first, the user sends the input event e _in to the arbitrator user, the arbitrator user receives the input event e _in , the arbitrator user searches the sentence represented by the input event e _{in ,} All nouns are extracted, input event e _in is my book is textbook, extract two nouns, namely book and textbook, find that the textbook is not in the complete set of atomic events ∑, use the common identifier CV0_l to represent the textbook, and add it to the complete set of atomic events ∑ in;

The resident user updates the valid word set E _Σ in advance every time the length of time ε elapses in the classification and transport system. The valid word set E _Σ is a subset of the complete set of atomic events Σ, and the valid word set E _Σ contains the labels of all file entries. General identifier, assuming there are three file bars and a separate block chain, the first file bar is labeled AB_12, dV0_l, the second file bar is labeled aa_12, dd0_l, and the third file bar is labeled aa_13 , dd0_2, where AB_12 stands for books, dV0_l stands for foundation, aa_12 stands for medical treatment, dd0_l stands for medicine, aa_13 stands for makeup, and dd0_2 stands for whitening; the memory stick is used to store the complete set of atomic events ∑ and the corresponding nouns;

All tags are represented as common identifiers and put into the valid word set E _Σ = {AB_12, dV0_l, aa_12, dd0_l, aa_13, dd0_2}; according to the number of files stored in the file bar corresponding to the tag in the last time length ε Divide, assuming that within the last time length ε, the number of files recorded in the first file bar accounts for 35% of the number of files recorded in all file bars, and the number of files recorded in the second file bar is recorded in all file bars. The number of files recorded in the third file bar accounts for 45% of the number of files recorded in all file bars, so the general identifier of the label corresponding to the first file bar, the third bar The general identifier of the label corresponding to the file bar is put into the first-class valid word set, and the general identifier of the label corresponding to the second file bar is put into the third-class valid word set; therefore, the first-class valid word set is {AB_12 ,dV0_l,aa_13,dd0_2}, the third-class valid word set is {aa_12,dd0_l};

The user sorts the importance to form an atomic event sequence {AB_12, CV0_l}, which contains two atomic events, and one atomic event is extracted for the first time. Since the atomic event AB_12 extracted for the first time is the first in the valid event set E _Σ In the set of other valid words, determine that d=T(e _in ∈E _Σ ) is true;

的值10500微秒，给予申请的用户临时用户的权限；应用场景二当前的临时用户的个数达到5N个，再需要检测事件存储区中是否存在存储输出时间变量的值小于或等于申请的用户发送的输入时间变量，如果事件存储区中只存在一个输出时间变量的值小于或等于申请的用户发送的输入时间变量，将小于等于用户发送的输入时间变量的输出时间变量从事件存储区中删除，并且空余的临时用户的个数减一，当总时钟到达用户设定输入时间变量

的值10500微秒，给予申请的用户临时用户的权限，并且临时用户的个数加一；如果事件存储区中存储的小于等于用户输入时间变量

的输出时间变量多于一个，选择输出时间变量中值最小的从事件存储区中删除，并且空余的临时用户的个数减一，当总时钟到达用户设定输入时间变量

的值10500微秒，给予申请的用户临时用户的权限，并且临时用户的个数加一；The global distribution center checks whether the current number of temporary users reaches 5N _1. Here, two application scenarios are assumed. In application scenario 1, the number of temporary users does not reach 5N ₁ and the number of spare temporary users is greater than or equal to one. The management user locks the seat of a temporary user, sets the current number of vacant temporary users to 2N, and reduces the current number of vacant temporary users by one; when the total clock reaches the user's set input time variable

The value of 10500 microseconds is given to the applied user as a temporary user; in application scenario 2, the current number of temporary users reaches 5N, and then it is necessary to detect whether there is a value of the storage output time variable in the event storage area that is less than or equal to the applied user. The sent input time variable, if there is only one output time variable in the event storage area whose value is less than or equal to the input time variable sent by the applied user, delete the output time variable less than or equal to the input time variable sent by the user from the event storage area , and the number of free temporary users is reduced by one, when the total clock reaches the input time variable set by the user

The value of 10500 microseconds, the user who applied for temporary user permission is given, and the number of temporary users is increased by one; if the value stored in the event storage area is less than or equal to the user input time variable

If there is more than one output time variable, select the output time variable with the smallest value and delete it from the event storage area, and reduce the number of free temporary users by one. When the total clock reaches the input time variable set by the user

The value of 10500 microseconds, give the user the permission of the temporary user, and the number of temporary users is increased by one;

当临时用户在系统里记录档案完毕后，或者临时用户长达连续ε时间没有在档案条上记录档案，向仲裁用户申请，仲裁用户裁定后输出一个输出事件e_out立即结束临时用户的权限；当前空余的临时用户的个数加一，临时用户的个数减一；临时用户如果需要自行停止临时用户的权限，选择向仲裁用户发送一个输出时间变量

临时用户产生一个输出时间变量

并为输出时间变量赋值为

微秒，假设产生输出时间变量

同时

赋值，在总时钟上取产生输出时间变量

的值为10000微秒，即

的值为10000微秒；临时用户发送的输出时间变量

表示希望在总时钟运行到输出时间变量

中存储的时间的值时停止临时用户的权限，同时检测输出时间变量

的值是否大于或等于

输出时间变量

的值为10200微秒，

的值为14000微秒，满足条件大于或等于

ε_t的值设为2000微秒；满足条件后，全局分配中心将临时用户发送的输出时间变量

放置在事件存储区内，事件存储区中存储进输出时间变量

的值10200微秒；并且事件存储区中时间变量

的值必须不相同；如果输出时间变量

一直存储在事件存储区内，当到达总时钟运行到输出时间变量

的值时，全局分配中心将临时用户发送的输出时间变量

从事件存储区中删除；The global distribution center is responsible for detecting the conditions for the exit of temporary user rights

When the temporary user finishes recording files in the system, or the temporary user does not record files on the file bar for a continuous period of ε, apply to the arbitration user, and output an output event e _out after the arbitration user decides to immediately terminate the temporary user's authority; the current The number of free temporary users is increased by one, and the number of temporary users is decreased by one; if the temporary user needs to stop the temporary user's authority, choose to send an output time variable to the arbitrator user

Temporary user produces an output time variable

and assign the output time variable as

microseconds, assuming the output time variable is produced

at the same time

Assignment, take on the total clock to generate the output time variable

is 10000 microseconds, i.e.

The value of 10000 microseconds; the output time variable sent by the casual user

Indicates that you want to run the total clock to the output time variable

Temporary user's permission is stopped when the value of the time stored in the output time variable is detected at the same time

Is the value greater than or equal to

output time variable

The value of 10200 microseconds,

The value is 14000 microseconds, and the condition is greater than or equal to

The value of ε _t is set to 2000 microseconds; after the conditions are met, the global distribution center will change the output time variable sent by the temporary user

Placed in the event storage area, the event storage area stores the input and output time variables

The value of 10200 microseconds; and the time variable in the event store

must be different; if the output time variable

Always stored in the event memory area, when the total clock run to the output time variable is reached

When the value of , the global distribution center will temporarily user send the output time variable

delete from the event store;

When the temporary user needs to record on a file bar, the temporary user selects the file bar to record the file according to the label. For example, the user selects the first file bar to record, and sends any transaction to the resident user who manages the first file bar. , there is no need to record anything in the transaction, the resident user records the time when the transaction is received, and takes the time when the transaction was received on the asynchronous time clock of the file bar as the time when the user received the transaction, and records the received transaction in the asynchronous time. The time on the time clock is 1000 microseconds, and the time on the global clock when the transaction is received is also recorded. Assuming that the time on the global clock when the transaction is received is 11100 microseconds, the time when the transaction is received is recorded in the The time on the asynchronous clock of the first file bar is 1000 microseconds, that is, the first file bar starts recording the first file when the global clock runs to 9100 microseconds; The file to be recorded, the file to be recorded is "My language book is green", the resident user first extracts the noun in the file recorded by the temporary user, the three nouns language, book, green, the language is represented by the universal identifier bn02_, book AB_12 is used to represent the book, and the green uses the general identifier BHTRy. If the noun is not in the complete set of atomic events ∑, supplement the complete set of atomic events ∑;

The block valid event set includes all the atomic events in all the satisfactory constraints set by the resident user regardless of the time validity period. Suppose the labels of the first file bar are AB_12, dV0_l, and the atomic set included in the isolation constraint is {ebert,rtyui} , ebert, rtyui represent mathematics and electric light respectively, which are put into the complete set of atomic events ∑ by the resident user. First, the general identifier represented by the noun in the file that the user needs to record is detected, and whether it is isolated from the first file entry. There are the same atomic events in the constraints, and there is no atomic event that overlaps with the isolation constraints. Continue to detect the satisfactory constraints; the time of the asynchronous clock on the file bar when the isolation constraints are detected is 1105 microseconds; the constraint detection interval is [1100 , 1105], extract the time-effective atomic events in the constraint detection interval included in the satisfactory constraints, ignore the time validity period, and obtain a set as {abc_3, abl_3, AB_12}, and the extracted temporary user records The block contained in the file Calculate the intersection of the atomic events {AB_12, BHTRy, bn02} in the valid event set, get the set {AB_12}, and mark the time validity period to get the time valid atomic set;

并将在约束检测区间内[1100,1105]的名词提取处理，abc_3、abl_3标识的时间有效期为[500,6000]，AB_12标识的时间有效期为[300,6000]；从满意约束找寻所有有效原子事件组合，abc_3的标号为1，abl_3的标号为2，AB_12的标号为1，两个空的时间有效原子事件τ的时间有效期都为∞，标号分别为2、3，有效原子事件组合为{abc_3,abl_3}和{AB_12,τ,τ}；时间有效原子事件集合为{AB_12}，除了空的时间有效原子事件，检查是否包含一个有效原子事件组合中的所有原子事件，包含有效原子事件组合{AB_12,τ,τ}中除了空的时间有效原子事件的其他时间有效原子事件，再检查一下约束检测区间[1100,1105]中的任何时间是否包含在AB_12上标注的时间有效期内，检查后包含，给予用户在区块链上记录的权利；The satisfaction constraint of the first file clause is described as

And extract the nouns in the constraint detection interval [1100, 1105], the time validity period of abc_3 and abl_3 is [500, 6000], and the time validity period of AB_12 is [300, 6000]; find all valid atoms from the satisfied constraints Event combination, the label of abc_3 is 1, the label of abl_3 is 2, the label of AB_12 is 1, the time validity period of two empty time valid atomic events τ is ∞, the labels are 2, 3 respectively, the valid atomic event combination is { abc_3,abl_3} and {AB_12,τ,τ}; the time-valid atomic event set is {AB_12}, except for the empty time-valid atomic event, check if all atomic events in a valid atomic event combination are included, including a valid atomic event combination For other time-valid atomic events in {AB_12,τ,τ} except for empty time-valid atomic events, check again whether any time in the constraint detection interval [1100,1105] is included in the time validity period marked on AB_12, after checking Contains, giving users the right to record on the blockchain;

Example 2: Carry out the system reservation and write file service, assuming that the first file entry is still selected for reservation service, calculate the validity period of all valid atomic event combinations, and the valid atomic event combinations are {abc_3,abl_3} and {AB_12,τ, τ}, the adjusted pot life of {abc_3, abl_3} is [500, 6000], the adjusted pot life of {AB_12, τ, τ} is [300, 6000], a valid combination of atomic events for the remaining file strips The adjusted pot life of is [300, 1000], the adjusted pot life of another valid atomic event combination is [500, 600], and the adjusted pot life of one valid atomic event combination is [700, 5000], at time The left and right endpoints of each applicable period are marked on the axis, starting from the time when the total clock starts running, that is, the origin of the time axis, and the first endpoint 300 is the first segment interval [0,300], not For the intersection of any applicable period, the level of the division interval is marked as 1, the number of time points that can reserve reservations is 6, and the second point between the second end point and the third end point along the increasing direction of the time axis. The split interval is [300.500], which is the intersection of the two applicable periods. The level of the split interval is marked as 2, and the number of time points that can be reserved is four. The third split interval is [500,600], which is four. For the intersection of the applicable periods, the level of the division interval is marked as 4, the number of time points that can reserve reservations is 2, and the fourth division interval is [600,700], which is the intersection of the three applicable periods. The level is marked as 3, the number of time points that can reserve reservations is 3, and the fifth segment is [700, 1000], which is the intersection of the four applicable periods, and the number of time points that can reserve reservations is 2, the level of the segment is marked as 4, the sixth segment is [1000, 5000], which is the intersection of the three applicable periods, the level of the segment is marked as 3, and the time point of the reservation can be reserved. The number is 3, the seventh segment is [5000, 6000], which is the intersection of the two applicable periods, the level of the segment is marked as 2, and the number of time points that can be reserved is 4;

The pre-interrogation module is used to sort out the time validity period of the time-valid atomic events included in all valid atomic event combinations. When a user applies for a reservation service, the pre-interrogation module starts to sort out the time validity period, including: when the asynchronous clock of each file bar starts Timing means that when the first file is recorded on the file strip, the time is taken from the total clock of the classification and transfer system, and the time of the first file is recorded on the file strip under the operation of the master clock; the pre-interrogation module records the beginning of all time validity periods. The time point and the end time point plus the time when the first file is recorded in the corresponding file bar under the operation of the total clock to obtain the adjusted time validity period; the adjusted time validity period is the representative of the time validity period under the operation of the total clock time period; calculate the applicable period of all valid atomic event combinations, so that temporary users can make reservations to write files, the minimum unit of time at the time of reservation is the maximum value among the minimum units of all non-synchronized time clocks, and the applicable period is every The intersection of the time validity periods included in all the time-valid atomic event combinations included in the valid atomic event combinations, the applicable periods of all valid atomic event combinations are counted, and all applicable periods are marked on the time axis. The minimum unit of the time axis is all non-valid atomic event combinations. The maximum value in the smallest unit of the synchronization time clock, the left and right endpoints of each applicable period are marked on the time axis, the left and right endpoints of the applicable period are marked rounded and marked on the time axis, and the start point of the time axis It is the minimum value of the starting timing points of all asynchronous time clocks, starting from the left endpoint with the smallest value of all applicable periods, along the time axis from left to right to the direction of time growth, and the applicable period marked on the time axis. Both the left endpoint and the right endpoint are collectively referred to as endpoints, and the origin of the time axis is the first endpoint, and the time interval between each two endpoints is used as a segmented segment. The number of reserved time points; if the split interval is not the intersection of any applicable period, the level of the split interval is marked as 1, if the split interval is the intersection of two applicable periods, the level of the split interval is marked as 2, if The division interval is the intersection of three applicable periods, and the grade of the division interval is marked as 3, and so on. If the division interval is the intersection of all applicable periods, the grade of the division interval is marked as d+1, and d is the level of all applicable periods. number;

The class transfer module allows reservation time points from more to less reservations in the division interval corresponding to the division level according to the division level of the division interval from low to high, and reservations can be reserved in the division interval where the level of the division interval is 1 The number of time points is d+1, and the number of time points that can be reserved in a segmented interval whose level is 2 is d, ... , decreasing in turn, and so on. The number of time points at which reservations can be reserved in the segmented section with a level of d+1 is one.

The resident user receives the intelligent reservation service provided by the temporary user. Each temporary user has the right to make three reservations. The temporary user selects the reserved file bar according to the label, and immediately calls the local timestamp function J(t _b ) of the selected file bar at t. The value obtained when _b = 0 is 50 microseconds, that is, when the reservation is made, the time when the file bar starts to run will be taken immediately. When the reservation is made, "my language book is blue", the three nouns of language, book and blue, The language is represented by the general identifier bn02_, the book has been represented by AB_12, and the blue color uses the general identifier BH5Ry. If the noun is not in the atomic event ensemble ∑, supplement the atomic event ensemble ∑;

The block valid event set includes all the atomic events in all satisfied constraints set by the resident user regardless of the time validity period. Suppose the current label of the first file bar is AB_12, dV0_l, and the atomic set included in the isolation constraint is {eber7,rtyu8 }, eber7, rtyu8 represent chemistry and table lamp, respectively, and are put into the complete set of atomic events ∑ by the resident user. First, the general identifier represented by the noun in the file that the user needs to record is detected, and whether it is the same as the first file entry. There are the same atomic events in the isolation constraints, and there is no atomic event that overlaps with the isolation constraints, and continue to detect the satisfactory constraints; the atomic events in the set of valid events in the block contained in the file of the extracted temporary user record are {AB_12, BH5Ry ,bn02} as a set of valid atomic events, the combination of valid atomic events included is {AB_12,τ,τ}, the intersection of time validity period is [300,6000], the value t _b provided by the temporary user reservation must be within the valid atomic event that satisfies Within the intersection of the time validity periods of all time valid atomic events in the combination, and t _b > 0, the value of 1000 is within the range of [300, 6000], the value 50 marked on the file is also less than 300, and the condition is met, the number is 1 The first file bar of ; therefore, b is equal to 1, the local timestamp function J(1000) = q _b +1000, q _b is the call on the asynchronous clock of the first file bar when calling J(t _b ) The time at J(t _b ), assuming that the value of q _b on the asynchronous clock is 100 microseconds at this time, so the value obtained by calling J(t _b ) is 1100 microseconds, assuming that the first file entry records the first The time taken by each file on the total clock is 50 microseconds, and the sum of the value obtained by J(t _b ) plus 50 microseconds is in the sixth division interval [1000, 5000], which is three applicable periods The level of the division interval is marked as 3, and the number of time points that can be reserved is 3. Check whether the reserved time points are used up. If not, use the local timestamp function J(t _b ) The obtained value is 1100 microseconds and the user's file is written into the smart contract. The content of the smart contract is: when the asynchronous local clock reaches the value of 1100 microseconds obtained by the local timestamp function J(t _b ), the temporary user's file is automatically written. It is written into the file bar reserved by the temporary user, that is, the first file bar, and then, the value obtained by the local timestamp function J(t _b ) is added to the reserved file bar. The sum of the time when the first file is recorded is divided The number of time points that can reserve reservations in the interval is reduced by one.

Set the first sub-valid word set input event e _in contains one of the valid words can give the user temporary user authority who has the input event e _in , the second sub-valid word set input event e _in contains two of the valid words can be given The authority of the temporary user of the user who has the input event e _in , ..., the fifth sub-set of valid words. The input event e _in contains five valid words and can give the temporary user authority of the user who has the input event e _in ; when the user satisfies the authority If the current number of temporary users is less than 5N ₁ , the user is given the right to become a temporary user. If the current number of temporary users has reached 5N ₁ , the user will apply to become a temporary user in the chronological order. After the queue is reached, the rights of the temporary user are allocated, and when the temporary user meets the conditions of the exit of the authority, the temporary user is cancelled; when the user becomes a temporary user, when the conditions of the exit of the authority are satisfied, the user's temporary user rights are cancelled; if t _b = 0, the value of the local time stamp function J(t _b ) is equal to the value of time q _b ; if t _b > 0, the value of the local time stamp function J(t _b ) is equal to the value of q _b plus the value of t _b to get the sum;

The steps of the present invention are:

First, the file management method first establishes a module of a classification and transshipment system. The classification and transshipment system includes a reclassification module, a block parallel module, a global distribution center, and a pre-interrogation module;

Second, set up multiple resident users and temporary users in the classification and transfer system, including one arbitrator user in the resident users; set a total clock on the classification and transfer system to time the system;

Third, the global distribution center sets a pair of import and export permissions for the user to obtain the right to become a temporary user, that is, to detect the conditions for the user to become a temporary user and the conditions for the user to no longer be a temporary user, and set the detection conditions. process;

Fourth, set the conditional constraints of the file bar, the files recorded by the user can only be recorded on the file bar if they meet the conditions and constraints set by the file bar;

Fifth, the process of setting a temporary user's reservation to write a file.

As described above, a time-oriented distributed file management method according to an embodiment of the present application can be implemented in various terminal devices, such as a server of a distributed computing system. In an example, a time-oriented distributed file management method according to an embodiment of the present application may be integrated into the terminal device as a software module and/or a hardware module. For example, the method may be a software module in the operating system of the terminal device, or may be an application program developed for the terminal device.

This embodiment also provides an electronic device 10, including:

One or more processors 11 and memory 12, which may be a central processing unit (CPU) or other form of processing unit with data processing capabilities and/or instruction execution capabilities, and which may control other components in electronic device 10 to perform the desired function.

Memory 12 may include one or more computer program products, which may include various forms of computer-readable storage media, such as volatile memory and/or non-volatile memory. The volatile memory may include, for example, random access memory (RAM) and/or cache memory, or the like. The non-volatile memory may include, for example, read only memory (ROM), hard disk, flash memory, and the like. One or more computer program instructions may be stored on the computer-readable storage medium, and the processor 11 may execute the program instructions to implement a time-oriented distributed distribution of the various embodiments of the present application described above. File management methods and/or other desired functionality.

In one example, the electronic device 10 may also include an input device 13 and an output device 14 interconnected by a bus system and/or other form of connection mechanism (not shown).

For example, the input device 13 may be a keyboard, a mouse, or the like.

The output device 14 can output various information to the outside, including outputting the results of a time-oriented distributed file management method. The output device 14 may include, for example, displays, speakers, printers, and communication networks and their connected remote output devices, among others.

According to another aspect of the present application, there is also provided a computer-readable storage medium having computer program instructions stored thereon, which, when executed by a computing device, are operable to perform a time-oriented method as described above. Distributed file management method.

The present invention provides a time-oriented distributed file management method. There are many specific methods and approaches for implementing the technical solution. The above are only the preferred embodiments of the present invention. Said that, on the premise of not departing from the principles of the present invention, several improvements and modifications can also be made, and these improvements and modifications should also be regarded as the protection scope of the present invention. All components not specified in this embodiment can be implemented by existing technologies.

Claims (10)

1. A time-oriented distributed archive management method is characterized by comprising the following steps: establishing a classification transfer system, wherein the classification transfer system comprises a classification module, a block parallel module, a global distribution center and a pre-interrogation module;

the classification module is used for checking whether a normal user is given the right to become a temporary user, namely, whether the normal user is allowed to have the right to record the file in the classification transit system;

the block parallel module is used for storing and recording files of users and performing management service of the files, and comprises N file strips and a memory strip, wherein the file strips are block chains used for recording the files required to be recorded by the temporary users, and the memory strip is a block chain used for recording universal identifiers used by all atomic events and nouns represented by the atomic events corresponding to the universal identifiers; n is a natural number;

the global distribution center is used for setting a checking condition for judging whether the ordinary user is given the authority to become the temporary user or not and carrying out authority detection; the global distribution center comprises a bidirectional pointer comparison area and an event storage area, wherein the bidirectional pointer comparison area is a storage area for storing atomic events which are extracted from an atomic event sequence and used for comparison; the event storage area is used for storing output time variables sent by temporary users

And an output time variable stored in the event memory area

The values of (a) must be different;

the pre-interrogation module is used for sorting the time validity periods of the time effective atomic events contained in all the effective atomic event combinations.

2. The method of claim 1, wherein the users in the categorized diversion system include more than two resident users, more than two temporary users, and more than two normal users, wherein the resident users include one arbitration user;

the arbitration user is a user for detecting and setting the authority of a temporary user of the user and managing the classification and transfer system, and meanwhile, the arbitration user is responsible for managing and recording a memory bar of the atomic event complete set sigma;

the resident users are the users which are fixedly active on the classification transfer system, and the number of the resident users is determined to be N₁N is₁For positive integers, N is determined by the arbitrating user₁The value of (1) except that each resident user of the arbitration user is responsible for managing a file strip, and serves temporary users needing to record files on the managed file strip;

the temporary users are the users temporarily distributed in the classification transfer system, the temporary users have the right to record files on the file strip, the ordinary users apply to become the temporary users and change the temporary users to the ordinary users through the global distribution center, and the number of the temporary users is 5 multiplied by N₁The classification transfer system calculates the number of the vacant temporary users in real time, namely the number of the vacant temporary users is 5 multiplied by N₁Subtracting the number of temporary users currently in the classification transit system;

the ordinary users are users on the classifying and transferring system except resident users and temporary users, the ordinary users do not have the right to record files on the file strip, and if the files need to be recorded, the ordinary users need to apply for becoming the temporary users;

setting a total clock on the classified transfer system, and starting timing by the total clock after the classified transfer system starts to operate, wherein the timing time unit is microsecond;

setting an atomic event complete set sigma in the classified transfer system, wherein the atomic event complete set sigma is a set containing all atomic events, the atomic events are general identifiers expressed by all related nouns in the classified transfer system, users in the classified transfer system can supplement the atomic event complete set sigma, and after the users in the classified transfer system inquire memory bars, the nouns needing to be used are found not to be expressed in the atomic event complete set sigma, so as to supplement the atomic event complete set sigma; the process of supplementing the atomic event complete set sigma is that universal identifiers which are not used in the atomic event complete set sigma are used for representing nouns, the universal identifiers represented by the nouns are added into the atomic event complete set sigma, the atomic events supplemented into the atomic event complete set sigma and the nouns represented by the corresponding atomic events are recorded into a memory bar in the block parallel module by an arbitration user, the universal identifiers used by the atomic events of the atomic event complete set sigma and the nouns represented by the corresponding atomic events are broadcast to all users in the classification transit system at regular time, and the users in the classification transit system can inquire the universal identifiers used by the atomic events and the nouns represented by the universal identifiers in the memory bar;

the universal identifier is composed of fixed characters which are not more than M, the characters comprise capital letters, lowercase letters, numbers and underlines, the characters composing the universal identifier are different in sequence, the characters are different, the universal identifier is different, and the universal identifier is set not to start with the underlines, and the universal identifier is used for representing atomic events; m is a positive integer and is determined by an arbitrator, and when the number of characters in the universal identifier is not enough to represent an atomic event, the arbitrator can increase the value of M;

all resident users start to operate in the classification and transfer system, and the valid word set E is updated in advance every time length_ΣValid word set E_ΣSet of valid words E for a subset of the full set of atomic events sigma_ΣThe method comprises the steps that a universal identifier is represented by tags containing all file entries, the tags are nouns which must be contained in files recorded on each file entry set by a resident user, each resident user sets tags of managed file entries, the tags of the file entries are represented by the universal identifier, whether the tags of the file entries are recorded on memory entries or not is checked, if not, the tags and the universal identifiers representing the tags are recorded on the memory entries, if the files do not contain the tags of the file entries, the files cannot be recorded on the file entries corresponding to the tags, the tags of each file entry must be distinguished from the tags of other file entries, the tags of each file entry are set, the tags of each file entry are different, and all the tags are represented by the universal identifiers which are put into an active word set in a summary modeAnd E_Σ(ii) a The time length is determined by an arbitration user and the unit is microsecond;

when the valid word set E is updated each time_ΣArbitrating the user to re-assemble the valid word set E_ΣDividing the word into five sub-effective word sets, wherein the five sub-effective word sets are effective word sets E_ΣThe subsets of the data are respectively a first equivalent effective word set, a second equivalent effective word set, a third equivalent effective word set, a fourth equivalent effective word set and a fifth equivalent effective word set, the division basis is that the number of files stored in the last time length of the file strips corresponding to the labels is more or less, and the sub-effective word sets are used for storing the divided effective word sets E_ΣThe number of the stored files is more than or equal to the number of the files recorded in all the file strips

The universal identifier represented by the label corresponding to the block chain is put into a first equivalent word set, and the number of the stored files is more than or equal to the number of the files recorded in all the file strips

The universal identifier represented by the label corresponding to the block chain is put into a second equal-class valid word set, and then the number of the stored files accounts for more than or equal to the number of the files recorded in all the file strips

The universal identifier represented by the label corresponding to the block chain is put into a third equal valid word set, and then the number of the stored files is more than or equal to the number of the files recorded in all the file strips

The universal identifier represented by the label corresponding to the block chain is put into a fourth equal effective word set, and finally, the number of the stored files is more than or equal to

Putting the general identifier represented by the label corresponding to the block chain into a fifth equal effective word set;

arranging general identifiers represented by labels stored in the first equal effective word set, the second equal effective word set, the third equal effective word set, the fourth equal effective word set and the fifth equal effective word set according to the number of files stored in the corresponding file strips;

judging the general identifier of the label corresponding to each file strip according to the sequence of the first equivalent effective word set, the second equivalent effective word set, the third equivalent effective word set, the fourth equivalent effective word set and the fifth equivalent effective word set, once the general identifier represented by the label corresponding to each file strip is put into one sub-effective word set, not putting into other sub-effective word sets, and stopping dividing when the general identifiers represented by the labels corresponding to all file strips are put into the sub-effective word sets, and enabling the five sub-effective word sets to be empty sets.

3. The method according to claim 2, wherein the global distribution center is configured to set a check condition for whether to give an ordinary user an authority to become a temporary user, and perform the authority detection, and specifically includes: the global distribution center sets an import of a pair of authorities and an export of the authorities as a checking condition, the checking condition is used for checking whether to give the authority of the ordinary user and cancel the authority of the temporary user, the import of the authorities is used for measuring whether the ordinary user can obtain the authority of the temporary user, and the export of the authorities is used for measuring whether to cancel the authority of the temporary user of the ordinary user after the ordinary user becomes the temporary user;

the import of authority is

The export of the authority is

Import representation of rights

And (d ═ T (e)_in∈E_Σ) All true, the import of the right satisfies the condition; the lambada indicates that the formulas connected with the two ends are both established;

wherein,

representing input time variables

Has a value in the range of

And

a function of

Representing variables in generating input time

Function of time taken in the total clock of the transit system

Direct assignment to generate input time variables

Time on the total clock, t represents time on the total clock;

representing generating input time variables

Time taken on the total clock plus time delay_tThe value of (a) is,_tand both indicate the length of a period of time,_tthe unit of the time length is kept consistent with the time unit of the total clock, and is microsecond, and the size of the time length is at least more than or equal to 5_t；_tThe value of (b) is determined by the arbitrator user; d is a boolean variable with identity value true; f represents a function of time taken on the total clock; output event e_outAn act of indicating an end of temporary user permission; function(s)

Representing variables in the production of output time

Taking the time function in the total clock of the classified transfer system, and directly assigning to generate an output time variable

Taking time on the total clock as a function

A value of (d);

if an ordinary user needs to apply for becoming a temporary user in the classifying and transferring system, the method specifically comprises the following steps:

step a1, the ordinary user first sends the input time variable to the arbitration user

Inputting time variables

The input time variable transmitted when the ordinary user applies to become the temporary user is any time on the total clock which can be transmitted by the user

The value of (A) represents that the average user wishes to be able to run the categorized transit system to a time equal to the input time variable

When the value is greater than the threshold value, opening the authority of the temporary user; when the ordinary user needs to apply for the authority of the temporary user, an input time variable is generated

And is an input time variable

Assigning values to generate input time variables

Generating functions simultaneously

I.e. in generating the input time variable

Taking the input time variable from the total clock in the classified transfer system

Time of day assignment to

The ordinary user firstly sends an input time variable

For the arbitrating user, the arbitrating user detects the input time variable

Whether or not the value of (B) is satisfied at

Value of and

between values of, i.e. detecting

Whether the result is true or not; input time variable sent if applied

Has a value of

Value of and

between values of (a) and (b) allows the ordinary user to send an input event e_inOtherwise, the ordinary user who applies for is refused to become the temporary user, and the ordinary user sends an input event e_inWhile taking f (e)_in) A value of (d); input event e_inFor atomic or complex events, input event e_inWhen the event is an atomic event, the term represented by the universal identifier represents the most important term in the file which is applied by the ordinary user and needs to be recorded by the temporary user, and is specified by the ordinary user; input event e_inFor compound events, event e is input_inThe sentences containing more than two nouns represent the most important sentences in the file which are applied by the ordinary user to become temporary user to be recorded, and are specified by the ordinary user; f (e)_in) Indicating a send input event e_inGetting send input event e on the total clock_inA function of time;

step a2, arbitrating user detection d ═ T (e)_in∈E_Σ) Whether or not it is true, T (e)_in∈E_Σ) Indicates judgment e_in∈E_ΣIf true, determining the input event e_inWhether it belongs to valid word set E_ΣWhen e is_inWhen the event is an atomic event, the judgment result can be directly given, and if the event e is input_inIs contained in the effective word set E_ΣIn the first equivalent word set, set T (e)_in∈E_Σ) The result of (d) is true, and d is judged to be T (e)_in∈E_Σ) If true, if event e is entered_inNot included in the valid word set E_ΣIn the first equivalent word set, set T (e)_in∈E_Σ) Is false and d is judged to be T (e)_in∈E_Σ) The method is not established; if f (e)_in) Is in a first time period after the running of the total clock, and does not allow the user to send an input event e_inIs a composite event;

step a3, when event e is input_inRepresenting input events e for composite events_inTo describe a sentence of more than two nouns, a compound event is not certain whether it belongs to the set of valid words E_ΣSet T (e) for the first set of equivocalized words in (1)_in∈E_Σ) The result of (1) is uncertain; when T (e)_in∈E_Σ) The result of (a) is uncertain, requiring an arbitrating user to decide and give T (e)_in∈E_Σ) Assignment, first, the ordinary user sends an input event e_inFor the arbitrating user, the arbitrating user receives the input event e_inFor input event e_inSearching, extracting atomic events, and giving the atomic events to common users for sequencing, wherein the input event e is formed after the common users are sequenced_inThe atomic event sequence contains input events e which are well ordered by common users_inAnd comparing the extracted atomic events to determine T (e)_in∈E_Σ) The specific process is as follows:

arbitrating user pair input events e_inSearching the represented sentence to input event e_inAll nouns contained in the represented sentence are extracted, and if the extracted nouns can be inquired in the memory bar, the extracted nouns are already used in the atomic event complete set sigma by using the universal standardThe identifier is used for representing, and the universal identifier represented by the extracted noun in the atomic event complete set sigma is directly used as the input event e_inThe extracted noun is represented as an atomic event, if the extracted noun is not represented by a universal identifier in the atomic event corpus sigma, the general user represents the extracted noun by the universal identifier as an input event e_inThe extracted noun is expressed as an atomic event and is supplemented into the atomic event complete set sigma, the process of supplementing the atomic event complete set sigma is completed, and a common user inputs an event e_inThe atomic events represented by the extracted nouns are sorted in descending order of importance to form an atomic event sequence, namely an input event e_inThe extracted nouns are expressed into universal identifiers and are placed in a sequence ordered by a common user to form an atomic event sequence, the global distribution center sequentially extracts atomic events in the atomic event sequence into a bidirectional pointer comparison area according to the sequence ordered in the atomic event sequence for comparison, the number of the extracted atomic events increases progressively each time, one atomic event is extracted from the atomic event sequence at the first time, two atomic events are extracted from the atomic event sequence at the second time, the r atomic events are extracted from the atomic event sequence at the r time, and the r value is a natural number and represents the maximum number of times of extraction from the atomic event sequence, each atomic event can be extracted only once, and if all the atomic events contained in the atomic event sequence are extracted completely, the extraction is stopped;

the global distribution center stores the labels in each sub-effective word set into a small storage area with the number of 1, a small storage area with the number of 2, a small storage area with the number of 3, a small storage area with the number of 4 and a small storage area with the number of 5 according to the sequence of a first equivalent effective word set, a second equivalent effective word set, a third equivalent effective word set, a fourth equivalent effective word set and a fifth equivalent effective word set;

the small storage area with the number of 1, the small storage area with the number of 2, the small storage area with the number of 3, the small storage area with the number of 4 and the small storage area with the number of 5 form a coding storage area, the coding storage area is a storage space for storing labels, and each small storage area is used for storing all the labels in a sub-effective word set;

establishing a double-headed pointer by the global distribution center, wherein the double-headed pointer is a pointer comprising two pointer heads, one pointer head points to a small storage area in the coding storage area, the pointer head pointing to the small storage area is compared and points to a small storage area each time, after the comparison is finished, the pointer head points to a small storage area with the number one larger than that of the currently pointed small storage area, the other pointer head points to a bidirectional pointer comparison area, when the atomic event extracted for the first time is equal to one universal identifier in the universal identifiers represented by the labels contained in the small storage area with the number 1, the comparison is immediately finished, and T (e) is set_in∈E_Σ) If the result of (d) is true, the atomic events in the two-way pointer comparison area are removed, otherwise, the comparison is continued, when all the atomic events extracted for the second time are equal to two universal identifiers in the universal identifiers represented by the labels in the small memory area with the number 2, the comparison is immediately finished, and T (e) is set_in∈E_Σ) If only one of the second extracted atomic events is equal to one of the universal identifiers indicated by the tags in the small bucket numbered 2, the atomic events with the same comparison result in the two-way pointer comparison zone are removed, the comparison is continued again, and if more than two atomic events of the third extracted atomic events are equal to the universal identifiers indicated by the tags in the small bucket numbered 3, T is set (e)_in∈E_Σ) If the result of the atomic event extraction is true, if more than one atomic event extracted for the third time is equal to the universal identifier represented by the label in the small storage area with the number of 3, continuing to compare; if none of the atomic events extracted for the second time is equal to one of the universal identifiers indicated by the tags in the small bucket numbered 2, the atomic event extracted for the third time is all equal to the universal identifiers indicated by the tags in the small bucket numbered 3, and T (e) can be set_in∈E_Σ) The result of (1) is true and the comparison is continued until the small memory area with the number of 5 is compared; once T (e) is set_in∈E_Σ) If true, then the atoms in the bidirectional pointer comparison area are removedAn event; during extraction, skipping the extraction and comparison of the sub-effective sets of the empty set until all the sub-effective sets are extracted and compared; at the time of the comparison, removing the atomic event equal to the universal identifier represented by the label in the small storage area from the bidirectional pointer comparison area; and if the atomic events in the atomic event sequence are not extracted enough during extraction, allowing the user to select the atomic events in the bidirectional pointer comparison area to supplement the extracted atomic events and participate in the comparison with the universal identifier represented by the label of the small storage area again, wherein each atomic event participates in the comparison at most twice, and when the comparison cannot be performed, the comparison is terminated; in the above comparison, if the atomic event extracted once by more than two times is equal to the common identifier indicated by the tag in the small bucket, or if the atomic event extracted once by more than one half is equal to the common identifier indicated by the tag in the small bucket, and the atomic event extracted once by more than two times by one third is equal to the common identifier indicated by the tag in the small bucket, T (e) is also set_in∈E_Σ) The result of (1) is true; d ═ T (e)_in∈E_Σ) Represents T (e)_in∈E_Σ) Is true when the result of (a) is equal to a variable d, which is a constant true boolean variable, T (e)_in∈E_Σ) The result of (d) is true, the value of the variable d is equal to T (e)_in∈E_Σ) Result of (d) is equal to T (e)_in∈E_Σ) If true; if an input event e is provided by a normal user_inDirectly sending the universal identifier represented by the atomic event to an arbitration user for the atomic event; variable d is assigned in advance for verifying T (e)_in∈E_Σ) A boolean variable that is true or false; when the above determination process is performed, d is not determined to be T (e)_in∈E_Σ) If yes, refusing to grant the right of the temporary user of the applied ordinary user;

when d is T (e)_in∈E_Σ) After the establishment, the global distribution center checks whether the number of the current temporary users reaches 5 multiplied by N₁Whether the number of the spare temporary users is more than or equal to one or not, if not, the seat of one temporary user is locked, and the current spare temporary userSubtracting one from the number of the current temporary users, when the total clock reaches the value of the input time variable set by the common user, giving the applied common user the authority to become the temporary user, if the number of the current temporary users reaches 5 XN₁Then, whether the value of the stored output time variable is less than or equal to the input time variable sent by the applied ordinary user exists in the event storage area is detected, if only one output time variable with the value less than or equal to the input time variable sent by the applied user exists in the event storage area, the output time variable less than or equal to the input time variable sent by the ordinary user is deleted from the event storage area, the number of the spare temporary users is reduced by one, and when the total clock reaches the input time variable set by the ordinary user, the total clock reaches the input time variable set by the ordinary user

The value of (1) is given to the applied ordinary user to become the authority of the temporary user, and the number of the temporary users is increased by one; if the time variable stored in the event memory area is less than or equal to the time variable input by the common user

The output time variable is more than one, the output time variable with the minimum value in the event storage area is selected to be deleted from the event storage area, the number of spare temporary users is reduced by one, and when the total clock reaches the input time variable set by the common user

The value of (1) is given to the applied ordinary user to become the authority of the temporary user, and the number of the temporary users is increased by one; and when the ordinary user refuses to grant the temporary user because the ordinary user does not meet the condition of import of the authority, the refused ordinary user is not allowed to apply for the temporary user again within the time length from the time of refusing to grant the temporary user.

4. Method according to claim 3, characterized in that the global distribution center is responsible for detecting the conditions of the exit of temporary user rights

Representing an output event e_outProduce or

A vertical V-shaped indicates that the two connected formulas have a vertical structure;

when the temporary user finishes recording the file in the system, or the temporary user does not record the file on the file strip for a continuous time, the temporary user applies for the arbitration user, and the arbitration user outputs an output event e after adjudication_outImmediately ending the authority of the temporary user and outputting an event e_outArbitrating an action for ending the temporary user right for the arbitrated user; the number of the current temporary users is reduced by one, and the number of the spare temporary users is increased by one; if the temporary user needs to stop the authority of the temporary user by himself, the temporary user selects to send an output time variable to the arbitration user

And simultaneously as an output time variable

Assigning value, taking the output time variable from the total clock

Time value assignment to

Output time variable for temporary user transmission

Indicating temporary user wishes to run on total clock to output time variable

The value of (c) stops the authority of the temporary user,detecting output time variations sent by temporary users

Whether the time value of (A) is greater than or equal to

After the value condition of the output time variable is met, the global distribution center sends the output time variable sent by the temporary user

Placed within an event store;

if a time variable is output

Is always stored in the event memory area and runs from the total clock to the output time variable

Has not been previously deleted when the total clock is running to the output time variable

When the value of (2) is greater than the value of (3), the global distribution center outputs the time variable sent by the temporary user

Delete from the event storage area; when the total clock runs to the output time variable

When the value is less than the threshold value, stopping the authority of the temporary user and changing the temporary user into a common user;

output time variable representing temporary user transmission

Is greater than or equal to

Function(s)

Representing variables in the production of output time

Taking the time function in the total clock of the classified transfer system, and directly assigning to generate an output time variable

Taking time on the total clock as a function

The value of (a) is,

representing the output time variable

Time taken on the total clock plus twice the time delay_tA value of (d); t is t₁The starting time point of the import of the verification authority is taken from the total clock when the import of the verification authority is verified; t is t₂Is a point in time when the start of the exit of the authentication authority is taken on the total clock at the time of the exit of the authentication authority.

5. The method of claim 4, wherein the block parallel module comprises N file strips and one memory strip, wherein each file strip comprises more than two contiguous blocks, each file strip has an asynchronous time clock, i.e. each asynchronous time clock corresponds to a file strip, for clocking the corresponding file strip, at each timeThe same time in the same asynchronous time clock can only record one block in the file strips corresponding to the asynchronous time clock, for the classification transfer system, more than two file strips are allowed to be recorded at the same time of the total clock, and the same file strip can only be recorded by one block; n is a natural number and is determined by an arbitration user; except for the memory bars, each file bar is maintained by a resident user, condition constraints and labels are set for each file bar, the labels are broadcast to all temporary users, the labels of each file bar are different, the labels are modified from each time length, the time length is counted from the beginning of operation of the classification transit system, and the time length is counted on a total clock; the conditional constraints are invisible to all temporary users, the files recorded by the temporary users can be recorded in the file bar only when the files meet the conditional constraints set by the file bar, namely the conditional constraints are used for limiting whether the files can be recorded on the file bar corresponding to the conditional constraints, the conditional constraints comprise satisfaction constraints and isolation constraints, and the conditional constraints are met only when the satisfaction constraints and the isolation constraints are met, wherein the satisfaction constraints are described as the connection of time-effective atomic events and symbols, and the symbols of the satisfaction constraints comprise

Two, neglecting the time validity period marked on the time validity atom event,

the symbols indicate that the nouns corresponding to the connected time-efficient atomic events all need to be contained in the user-recorded file, and the delta symbols indicate that the nouns corresponding to one or more than two time-efficient atomic events in the connected time-efficient atomic events all need to be contained in the user-recorded file; the noun corresponding to the time effective atomic event is a noun represented by the atomic event corresponding to the view time effective atomic event, wherein the noun is neglected for the time effective period;

the time effective atomic event is an atomic event with a marked time validity period, the time effective atomic event represents that the atomic event is effective only within the marked time validity period, the timing use condition of the time of the marked time validity period on the atomic event restricts the asynchronous time clock of the corresponding file strip, when the block on the file strip starts to record, the asynchronous time clock of the file strip starts to time, the timing starts from zero, and the unit for starting to time by each asynchronous time clock is determined by a resident user for managing the file strip; the time validity period is a time interval and is used for marking the valid time of the atomic event;

the isolation constraint of each file strip contains atomic events which are not allowed to be contained in the file recorded in the file strip, and the nouns represented by one atomic event in the file containing isolation constraint cannot be recorded on the file strip corresponding to the isolation constraint.

6. The method as claimed in claim 5, wherein the block parallel module establishes a block valid event set, and records universal identifiers represented by nouns contained in files in all file strips, so as to form the block valid event set as atomic events, wherein the block valid event set is formed by each resident user, and comprises a valid word set E_ΣMeanwhile, the block effective event set is a subset of the atomic event full set sigma; the resident user of the file strip ignores the time validity period marked on the time valid atomic event in the satisfaction constraint, each atomic event in the valid word set must be contained in one satisfaction constraint, and the time validity period marked on all the time valid atomic events must cover the cycle of asynchronous time clock work of all the file strips, namely, each time point from the start of the block parallel module to the stop of the block parallel module must be contained in the time validity period of one time valid atomic event, and the atomic event set contained in each isolation constraint must be different;

when the temporary user needs to record on one file strip, the temporary user selects the file strip to record the file according to the label, sends any transaction to the resident user who manages the file strip corresponding to the label, does not need to record any content in the transaction, and the resident user receives the record fileReceiving transaction, taking the time of receiving transaction on asynchronous time clock of file bar as the time of receiving transaction by user, and sending the file to be recorded to resident user managing file bar, the resident user first extracting nouns in the file recorded by temporary user, checking whether they are represented as universal identifiers in memory bar, if they are represented as universal identifiers, extracting atomic events represented by universal identifiers, if they are not represented as universal identifiers, supplementing the whole set sigma of atomic events, the extracted nouns are represented as universal identifiers and recorded in memory bar, judging whether the atomic events represented by extracted nouns are coincident with the atomic events contained in isolation constraints set by selected file bar, if they are coincident, directly rejecting temporary user to record file, if the atomic events in the block effective event set contained in the file recorded by the user can not meet the satisfaction constraint, the time validity period marked in the time effective atomic event in the satisfaction constraint set by each file bar is timed by using the asynchronous clock of each corresponding file bar; the block parallel module takes the time of detecting the isolation constraint on the asynchronous clock on the selected record file strip as the average delay₁；

The method of checking for satisfaction constraints is: taking the time from when the user receives the transaction as the beginning to with the average delay₁The time interval which is the end is used as a constraint detection interval which is used for detecting whether the time validity period marked on the time validity atomic event in the satisfied constraint is met when the user needs to record the file; the block parallel module extracts time effective atomic events contained in a satisfied constraint, removes empty time effective atomic events, checks whether the time effective period marked on the time effective atomic events contains any time point in the constraint detection time interval, extracts the time effective atomic events corresponding to the time effective period of any time point in the constraint detection time interval, removes the time effective period marked on the extracted time effective atomic events to become atomic events, and extracts temporary user notes as extracted atomic eventsThe universal identifier expressed by nouns contained in the recorded file and the set formed by the extracted atomic events calculate the intersection, if the intersection is an empty set, the right of the temporary user currently applying for recording on the file bar is directly cancelled, and if the intersection exists, the time validity period of the removed original label is still added to the calculated intersection to be used as a useful time valid atomic event set;

then, the resident user finds all effective atomic event combinations from the satisfaction constraint, and the method for finding the effective atomic event combinations is as follows: checking satisfaction constraints of the archive strips to be recorded from left to right, marking the encountered time-valid atomic event with the first time-valid atomic event marked with 1, and subsequently if the symbol is encountered from left to right

And symbol

The label of the next time-valid atomic event on the right of the connection is in the same notation

The label of the previous time-valid atomic event on the left of the connection is incremented by one, and the symbol delta is encountered from left to right, the index of the following temporally significant atomic event to the right of the symbol delta is equal in value to the index of the preceding temporally significant atomic event to the left of the same symbol delta, and that no nesting exists between brackets within a satisfaction constraint, a sub-formula of a satisfaction constraint within a bracket is considered as a whole, if two satisfactorily constrained sub-formulas are connected by the symbol delta, and both satisfactorily constrained sub-formulas are placed in parentheses, the label of the first time-significant atomic event from left to right contained in the satisfactorily-constrained sub-formula in the right parenthesis connected to the symbol Δ is the same as the minimum of the label values of all the time-significant atomic events in the satisfactorily-constrained sub-formula in the left parenthesis connected to the same symbol Δ; if two satisfactorily constrained sub-formulas are signed

Are connected and both satisfactorily constrained sub-types are placed in parentheses, with symbols

Satisfactory constraint within parentheses to the right of the attached, first time-valid atomic event from left to right contained in the sub-formula is numbered more than the same symbol

The maximum value of the index values of all the time effective atomic events in the sub-formula of the satisfaction constraint description in the connected left bracket is added with one, and the sub-formula of the satisfaction constraint description in the bracket repeats the process of checking the formula of the satisfaction constraint description from left to right until the last time effective atomic event at the right of the satisfaction constraint is checked;

when the files recorded by the temporary user satisfy the satisfaction constraint, finding the combination of all possible time effective atomic events satisfied by the files recorded by the temporary user under the condition of satisfying the constraint, wherein the combination of all effective atomic events is used for detecting whether the files recorded by the user satisfy the satisfaction constraint, and the specific effective atomic event combination constitution process is as follows: checking the labels of all the time-effective atomic events in the satisfied constraint, wherein the time-effective atomic events corresponding to the numerical values of all the labels of positive integers from 1 to the maximum label are respectively taken as one, namely the time-effective atomic events corresponding to the numerical values of each label corresponding to the maximum label from 1 to the one form an effective atomic event combination, and listing all possible effective atomic event combinations one by one, wherein the maximum label in the effective atomic event combination is the maximum numerical value in the labels of all the time-effective atomic events in the satisfied constraint; sub-formulas in the satisfaction constraint are placed within parentheses, no nested representation of two or more parentheses is allowed, and the sign of the connection between the parentheses in the satisfaction constraint is the same, if a delta connection is used between the parentheses, the number of time-valid atomic events contained in the sub-formulas in the two parentheses is equal, allowing the placement of an empty time-valid atomic event, the sign of the empty time-valid atomic event being denoted as τ, representing no noun, and the time-valid period noted on the empty time-valid atomic event being ∞, indicating that the empty time-valid atomic event is always valid during the operation of the categorizing transit system;

the resident user can modify the satisfaction constraint of setting the managed documentary strip, and the set satisfaction constraint must satisfy two conditions, the first condition: the satisfaction constraint must include the label of the archive strip being managed, the second condition: any time after the beginning of the recording of the dossier strip must be included within the time validity period of the original annotations for all atomic events of one or more valid atomic event combinations in the satisfaction constraints set by the current dossier strip.

7. The method of claim 6, wherein the classification module is configured to verify whether a temporary user is given the right to record a profile in the classification diversion system, comprising: the classification module compares all time effective atomic events in the extracted useful time effective atomic event set with all effective atomic event combinations one by one, if the extracted useful time effective atomic event set contains all time effective atomic events in an effective atomic event combination except an empty time effective atomic event, the intersection of the time effective periods marked on all the time effective atomic events in each contained effective atomic event combination is obtained and is used as an intersection interval, if the constraint detection interval and any intersection interval have the intersection, the temporary user is given the right to record on the file bar corresponding to the satisfied constraint, and if the constraint detection interval and any intersection interval do not have the intersection, the temporary user is refused the right to record on the file bar corresponding to the satisfied constraint; if the useful time-valid atomic event set contains more than all time-valid atomic events in one valid atomic event combination, and the constraint detection interval intersects with more than one intersection interval, more than one adjacent atomic event is givenThe user can record the file on the file bar in advance once and set all the direct use symbols

The time validity periods of the connected time validity atomic event labels are kept consistent; ignoring empty time valid atomic events in the comparison performed by the classification module, i.e. the empty time valid atomic events do not participate in the comparison, and only comparing whether other time valid atomic events meet the condition; also, the time validity period of the time valid atomic events contained in all valid atomic event combinations is also used to temporally limit the number of times the temporary user subscribes to write the profile.

8. The method according to claim 7, wherein the pre-interrogation module is configured to sort the time validity periods marked on the time valid atomic events included in all valid atomic event combinations, and is configured to limit the number of times the temporary user reserves to write the archive in time, and the method includes:

when a temporary user applies for a reserved file writing service, the pre-interrogation module starts to arrange the validity period of time, and the method comprises the following steps: when each file strip asynchronous clock starts to time, namely a first file is recorded on the file strip, the pre-interrogation module takes time from the total clock of the classification transit system, namely the time for taking the first file recorded on the file strip under the operation of the total clock;

the pre-questioning module adds the starting time point and the ending time point of the time validity period marked on the time valid atomic events contained in all valid atomic event combinations to the time of taking the corresponding file strip to record the first file under the operation of the total clock respectively, and the time is taken as the starting time point and the ending time point of the adjusted time validity period respectively, so that the adjusted time validity period is obtained; the adjusted time validity period is a time period represented by the time validity period under the operation of the total clock;

the pre-questioning module calculates the applicable periods of all the valid atomic event combinations to enable the service temporary user to write the files in a reserved mode, the minimum unit of the reserved time is the maximum value in the minimum unit of the asynchronous time clocks of all the file strips, the applicable period is the intersection of the adjusted valid periods of the time marked on all the time valid atomic events contained in each valid atomic event combination, the pre-questioning module counts the applicable periods of all the valid atomic event combinations, marks all the applicable periods on a time axis, the minimum unit of the time axis is the maximum value in the minimum unit of the asynchronous time clocks of all the file strips, the left end point and the right end point of each applicable period are marked on the time axis, and the unit of the applicable period is adjusted to the maximum value in the minimum unit of the asynchronous time clocks of all the file strips, the starting point of the time axis is the minimum value of the starting timing points of all asynchronous time clocks, starting from the left end point with the minimum value of all applicable periods, along the increasing direction of time from left to right along the time axis, the left end point and the right end point of the applicable period marked on the time axis are both called end points, the origin point of the time axis is the first end point, the time interval between every two end points is used as a partition interval, and the partition interval is used for limiting the number of reserved time points in the time interval represented by the partition interval in time; if the divided interval is not the intersection of any applicable period, the grade of the divided interval is marked as 1, if the divided interval is the intersection of two applicable periods, the grade of the divided interval is marked as 2, if the divided interval is the intersection of three applicable periods, the grade of the divided interval is marked as 3, and so on, if the divided interval is the intersection of all applicable periods, the grade of the divided interval is marked as d +1, d is the number of all applicable periods and is a positive integer;

the classification module allows reservation of from more than one reserved time point in a division interval corresponding to the division level according to the division level of the division interval from low to high, the number of the reserved time points in the division interval with the division level of 1 is d +1, the number of the reserved time points in the division interval with the division level of 2 is d, and so on, the number of the reserved time points in the division interval with the division level of d +1 is 1; the number of times of the user for reserving and writing the file is limited in time, namely, a time point capable of reserving is scheduled in time in advance, and after the scheduling, the temporary user can perform reservation service.

9. The method of claim 8, wherein the resident user receives a reservation service of the temporary user, the reservation service is responsible for writing a file on a file bar for a reservation time of the temporary user, each temporary user is provided with a right of three reservations, the temporary user selects the file bar for reserving and writing the file according to a label, the reservation is started only in a reservation time period, the reservation time period is a time period taken under a total clock in the classification transit system, the unit is microsecond, and modification is not allowed to meet a constraint in the reservation time period; specifying, by a management user, a length of a reserved time period and a specific value of the reserved time period; the temporary user sends the files to be recorded when making a reservation, the resident user receives the files to be recorded when making a reservation, and calls a local time stamp function J (t) of the file bar selected to be recorded_b) First, t is_bIs taken to zero to find the local time stamp function J (t) of the selected recorded file strip_b) At t_bWhen the value is 0, the local time stamp function J (t) of the selected file bar is marked on the file of the temporary user needing recording reservation_b) At t_bA value when 0; the resident user removes the time validity period marked on the time valid atomic event contained in the block valid event set, the atomic event is extracted, the extracted atomic event forms the block valid atomic event set, the nouns contained in the file required to be recorded when the resident user searches the reservation of the temporary user are expressed into the atomic events and combined into the atomic event set, the intersection is solved with the block valid atomic event set, the obtained intersection is used as the searched atomic event set, and the time validity period and the empty time valid atomic event are ignored during searching; then, searching for the effective atomic event combination satisfied by the searched atomic event set, that is, if the searched atomic event set contains all the time effective atomic events in an effective atomic event combination, the contained effective atomic events are the effective original satisfiedA sub-event combination informing the temporary user of the intersection of the time validity periods marked on all the time valid atomic events in all the satisfied valid atomic event combinations, and the temporary user providing a reserved value t_bMust be within the intersection of the time validity periods of all the time-valid atomic events in the satisfied valid atomic event combination, and the value on the temporary user's profile label must be less than the value of the left end point of the intersection of the time validity periods of all the time-valid atomic events in the satisfied valid atomic event combination; and t_bIf is greater than 0, the local time stamp function J (t) is obtained_b) The local timestamp function J (t) is obtained_b) Comparing the obtained value with the value stored in the time use space, if the local time stamp function J (t) is obtained_b) The obtained value is equal to the value stored in the time usage space or a local time stamp function J (t) is obtained_b) The obtained value plus the time of the first file recorded on the reserved file strip and the number of reserved time points in the partition interval are all used up, and the temporary user is informed to modify t_bA value of (d), a value of t for providing the reservation again after the temporary user modification_bIf no temporary user modification is notified, the local timestamp function J (t) is applied_b) The resulting value is put into the time usage space and the local timestamp function J (t) will be found_b) The obtained value and the file to be recorded during reservation are written into an intelligent contract, and the content of the intelligent contract is as follows: asynchronous local clock walk of temporary user-subscribed archive bar to local timestamp function J (t)_b) The obtained value automatically writes the files required to be recorded during the reservation into the file bar reserved by the temporary user, and then, the local time stamp function J (t) is obtained_b) Adding the sum of the obtained value and the time of the first file recorded on the reserved file strip to the number of reserved time points of the partition interval, and subtracting one from the sum if a local time stamp function J (t) is obtained_b) The sum of the obtained value and the time of recording the first file on the reserved file strip is not in any partition interval, so that the reservation service can not be provided, and the condition restriction is modified by a resident user or the t is modified by a temporary user_bAnd then checks whether the subscription service can be provided.

10. The method of claim 9, wherein the local timestamp function J (t)_b) To take a function of time on the asynchronous time clock of each strip, J (t)_b) Is defined as follows:

where b is a function having a local timestamp J (t)_b) The serial numbers of the file strips are numbered in an ascending order of time of the first file recorded in each file strip in an increasing manner, the serial numbers are positive integers, and the value of b is less than or equal to N; t is t_bA time length in units of time of the non-local clock of the file bar numbered b, a reservation value provided when reserved by the temporary user is used for distinguishing when time is taken on the asynchronous time clock of the file bar numbered b, a currently called local time stamp function J (t) is taken_b) Time of day, or the current local timestamp function J (t) of the call_b) Later time when t is_bTake the current call local timestamp function J (t) when 0_b) Time when t is_bIf more than 0, taking the current calling local time stamp function J (t)_b) The latter time; at the same time, t_b＞0，t_bReserving the time of recording the file and q at the asynchronous time clock of the file bar with the number b for the user_bDifference in time between, t_bThe unit of (b) is consistent with the unit of the asynchronous time clock of the file bar with the number of b; q. q.s_bIs a point in time equal to the call local timestamp function J (t)_b) The time taken on the asynchronous time clock of the file bar with the number b is called the local time stamp function J (t)_b) The value of time of day is taken as the time point q_bA value of (d); the local timestamp function J (t)_b) At t_b0 equals time q_bAt t, at_b> 0 equals time q_bIs added to t_bThe resulting sum of the values of (a); and sets the localTime stamp function J (t)_b) Is greater than or equal to the value of calling the local timestamp function J (t)_b) The time takes the value of the time on an asynchronous time clock and sets each call to the local timestamp function J (t)_b) The obtained function values are different when t is_bWhen the local timestamp function J (t) is called 0_b) Function time, the local time stamp function J (t) is not recorded_b) Value of function, when t_b> 0, the local timestamp function J (t) will be called_b) The value of the function is recorded in the time usage space, each file strip has a time usage space, the time usage space is a storage space for placing a temporary user to reserve a time point when recording the file on the file strip with the number b, and the reserved time point is the time taken on the asynchronous time clock of the reserved file strip.

Images