Account selection program, account selection device and account selection method

By using a smart contract on the blockchain to iteratively select hashed IDs based on a seed value derived from account identifiers, the method addresses the high cost and time issues of existing random selection methods, ensuring fairness and transparency in decentralized community reward determination.

JP2024165559AInactive Publication Date: 2024-11-28FUJITSU LTD
View PDF 5 Cites 0 Cited by

Patent Information

Application Number
JP2023081841
Authority / Receiving Office
JP · JP
Patent Type
Applications
Current Assignee / Owner
Filing Date
2023-05-17
Publication Date
2024-11-28
Estimated Expiration
Not applicable · inactive patent

AI Technical Summary

Technical Problem

Current mechanisms for determining rewards in decentralized communities using blockchain technology are susceptible to fraudulent evaluations due to the use of external random number generation services, leading to high costs and authenticity issues, and the time and cost are excessive when selecting multiple evaluators.

Method used

A smart contract on the blockchain generates a seed value based on a hashed ID of each account, using it to select subsequent hashed IDs iteratively, reducing the need for repeated random number generation and minimizing time and cost.

Benefits of technology

This approach significantly reduces the time and cost of randomly selecting multiple blockchain accounts while ensuring fairness and transparency, making it suitable for decentralized communities, meetings, and other transparent selection processes.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 2024165559000001_ABST
    Figure 2024165559000001_ABST
Patent Text Reader

Abstract

To solve the problem that in order to select persons or things that require fairness and transparency, such as evaluators for a decentralized community, SC randomly selects a plurality of BC accounts on BC that correspond to the persons or things, but random selection by the SC is time-consuming.SOLUTION: An account selection program causes a computer to execute processes of: generating a seed value on the basis of a random number using a smart contract on a blockchain in which hashed IDs obtained by hashing an identifier of each of a plurality of BC accounts are stored; selecting a first hashed ID from the plurality of hashed IDs on the basis of the seed value; and selecting a second hashed ID from the plurality of hashed IDs using the selected first hashed ID as a seed value.SELECTED DRAWING: Figure 6
Need to check novelty before this filing date? Find Prior Art

Description

[Technical field]

[0001] The present invention relates to an account selection technology on a blockchain using a smart contract. [Background technology]

[0002] Recently, there has been growing interest in decentralizing communities and systems using blockchain (BC) technology, such as Web3, DAO, and token economy. Decentralized communities have a democratic reward determination mechanism that determines rewards for things and activities within the community based on evaluations by multiple people in the community. In this way, decentralized communities ensure the fairness of evaluations such as reviews by others and maintain the health of the community. [Prior art documents] [Patent documents]

[0003] [Patent Document 1] Special Publication No. 2022-541929 [Patent Document 2] Special Publication No. 2020-515942 [Patent Document 3] Special Publication No. 2022-523643 [Patent Document 4] US Patent Application Publication No. 2020 / 0204358 [Patent Document 5] Special Publication No. 2022-511623 Summary of the Invention [Problem to be solved by the invention]

[0004] However, the current mechanism for determining rewards has the problem that it makes it easy for community system operators to manipulate the system arbitrarily, such as by receiving money from users and then using accounts designed to provide fraudulent reviews (so-called fake accounts) to inflate the number of positive reviews a user has.

[0005] Therefore, a technology is considered that uses a smart contract (SC) on the BC to randomly select multiple BC accounts on the BC that are associated with each of the multiple evaluators, thereby suppressing arbitrary operations. As an example of the technology, for example, the SC randomly selects a BC account associated with an evaluator using a random number generated by an external random number generation service (hereinafter referred to as "random selection method 1").

[0006] However, random selection method 1 has problems such as the use of an external random number generation service, which is costly and makes it difficult to ensure the validity and authenticity of the generated random numbers (the so-called oracle problem).

[0007] Therefore, for example, the SC has an unspecified number of users on the BC input any number asynchronously, and generates a random number using each input number. Then, the SC uses the random number to randomly select a BC account to be associated with an evaluator (hereinafter referred to as "random selection method 2"). In random selection method 2, it is difficult for a specific user to know each number input by an unspecified number of users, so the validity and authenticity of the random number can be ensured, and since an external random number generation service is not used, costs can be reduced.

[0008] In addition, random selection using SC may be used not only for evaluators in a distributed community, but also for the selection of people or things that require fairness and transparency, such as speakers at meetings, devices for obtaining environmental data, and winners of prizes.

[0009] However, the random selection method 2 has a problem that it takes a long time to generate a random number once because it waits for asynchronous input of numbers from multiple users. In particular, in the random selection method 2, when selecting multiple BC accounts on the BC corresponding to each of the evaluators in order to select multiple evaluators, the random number generation process must be repeated many times, which is very time-consuming.

[0010] In one aspect, the present invention aims to reduce the time cost involved in randomly selecting multiple BC accounts on a BC by an SC. [Means for solving the problem]

[0011] In one aspect, the account selection program causes a computer to execute a process of generating a seed value based on a random number using a smart contract on a blockchain in which hashed IDs obtained by hashing the identifiers of each of a plurality of blockchain (BC) accounts are stored, selecting a first hashed ID from the plurality of hashed IDs based on the seed value, and selecting a second hashed ID from the plurality of hashed IDs using the selected first hashed ID as a seed value. Effect of the Invention

[0012] In one aspect, it can reduce the time cost of randomly selecting multiple BC accounts on a BC by an SC. [Brief description of the drawings]

[0013] [Figure 1] FIG. 1 is a diagram for explaining an arbitrary operation in a distributed community system. [Diagram 2] FIG. 2 is a diagram for explaining the suppression of arbitrary manipulation by random selection using the SC. [Diagram 3] FIG. 3 is a diagram for explaining the random selection method 1. As shown in FIG. [Figure 4]FIG. 4 is a diagram for explaining the random selection method 2. In FIG. [Diagram 5] FIG. 5 is a diagram showing an example of this random selection method. [Figure 6] FIG. 6 is a diagram for explaining the time costs of the random selection method 2 and this random selection method. [Figure 7] FIG. 7 is a diagram showing an example of the configuration of the account selection device 10 according to the present embodiment. [Figure 8] FIG. 8 is a diagram showing an example of data stored in the user information 31 according to the present embodiment. [Figure 9] FIG. 9 is a diagram showing an example of data stored in the account ID array 32 according to the present embodiment. [Figure 10] FIG. 10 is a flowchart showing an example of the flow of the account selection process according to the present embodiment. [Figure 11] FIG. 11 is a flowchart showing another example of the flow of the account selection process according to the present embodiment. [Figure 12] FIG. 12 is a diagram (1) for explaining a flowchart showing another example of the flow of the account selection process according to the present embodiment. [Figure 13] FIG. 13 is a diagram (2) for explaining a flowchart showing another example of the flow of the account selection process according to the present embodiment. [Figure 14] FIG. 14 is a diagram (3) for explaining a flowchart showing another example of the flow of the account selection process according to this embodiment. [Figure 15] FIG. 15 is a diagram (4) for explaining a flowchart showing another example of the flow of the account selection process according to this embodiment. [Figure 16] FIG. 16 is a diagram illustrating an example of the hardware configuration of the account selection device 10 according to the present embodiment. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0014] Hereinafter, examples of the account selection program, the account selection device, and the account selection method according to the present embodiment will be described in detail with reference to the drawings. Note that the present embodiment is not limited to these examples. Also, each example can be appropriately combined within a range that does not cause inconsistency.

[0015] First, we will explain arbitrary manipulation in a distributed community system. Figure 1 is a diagram for explaining arbitrary manipulation in a distributed community system. As shown in Figure 1, in a distributed community system using BC technology, for example, when multiple users evaluate a certain thing or activity in the community, the system operator can perform arbitrary manipulation using a fake account. More specifically, for example, the system operator can easily perform arbitrary manipulation to the advantage of the person being evaluated, such as receiving money from the person being evaluated, selecting a fake account as the evaluator, and increasing the number of high ratings given by the person being evaluated. Note that such arbitrary manipulation is possible not only in the evaluators of a distributed community, but also in the selection of people or things that require fairness and transparency, such as speakers in meetings, devices for acquiring environmental data, and prize winners.

[0016] Therefore, a technology is conceivable in which multiple BC accounts on the BC are randomly selected using the SC on the BC to suppress arbitrary operations. Figure 2 is a diagram for explaining the suppression of arbitrary operations by random selection using the SC. As shown in Figure 2, for example, when selecting an evaluator from multiple users each associated with multiple BC accounts on the BC, it is possible to select a BC account using an SC that is difficult to tamper with and select the evaluator randomly. This makes it impossible for the system operator to arbitrarily select fake accounts, thereby suppressing arbitrary operations as explained using Figure 1.

[0017] In addition, random numbers must be generated to randomly select a BC account on a BC using SC. However, since BC is a mechanism that guarantees that the same output will be obtained regardless of which node (or computer that constitutes the BC network, also known as a peer) executes SC for the same input, it is not possible to implement logic that generates random numbers in SC and changes the output as a result.

[0018] Therefore, in the random selection method 1, for example, the SC randomly selects a BC account to be associated with an evaluator using a random number generated by an external random number generation service. FIG. 3 is a diagram for explaining the random selection method 1.

[0019] The random selection method 1 shown in Fig. 3 is an example in which the SC randomly selects N BC accounts using N random numbers r acquired using an external random number generation service such as Chainlink VRF. More specifically, the information processing device, for example, uses the SC to record IDs, which are identifiers such as addresses of the BC accounts of all users, in advance in the BC as an array "account ID array A". Then, the information processing device, for example, uses the SC to shape the N random numbers acquired from the external random number generation service so that they fall within the range of 0 to (length(A)-1), and then uses the shapes as indexes of the account ID array A to select N BC accounts.

[0020] However, because random selection method 1 uses an external random number generation service, it is expensive when selecting multiple evaluators, which is problematic in terms of costs. Additionally, random selection method 1 also has the problem that it is difficult to ensure the validity and authenticity of the random numbers generated by the external random number generation service (the so-called oracle problem).

[0021] In the random selection method 2, for example, the SC makes an unspecified number of users on the BC input arbitrary numbers asynchronously, and generates a random number using each input number. FIG. 4 is a diagram for explaining the random selection method 2.

[0022] The random selection method 2 shown in FIG. 4 is an example in which the SC randomly selects N BC accounts using a random number r generated using input values ​​from multiple users. More specifically, the information processing device, for example, uses the SC to record IDs, which are identifiers such as addresses of the BC accounts of all users, in advance in the BC as an array "account ID array A". Then, the information processing device, for example, uses the SC to generate one random number r using a pseudo-random number generation method as shown in FIG. 4. Furthermore, the information processing device, for example, uses the SC to shape the generated random number r so that it falls within the range of 0 to (length(A)-1), and then performs the process of selecting one BC account N times using the number as an index of the account ID array A.

[0023] Random selection method 2 does not use an external random number generation service, which reduces costs compared to random selection method 1. Also, with random selection method 2, it is difficult for a specific user to know each number entered by an unspecified number of users to generate random numbers, so the validity and authenticity of the random numbers can be ensured.

[0024] However, in random selection method 2, since it waits for numerical input from multiple users asynchronously, it takes time to generate a single random number, and since it must be repeated N times, it has the problem of being very time-consuming.

[0025] Therefore, in this embodiment, one of the objectives is to reduce the time cost when multiple BC accounts on the BC are selected by the SC. To achieve this, in this embodiment, for example, a seed value generated once by the random selection method 2 or the like is used to repeatedly apply a hashing method to an array of hashed BC account IDs to randomly select N BC accounts. Such a random selection method according to this embodiment is hereinafter referred to as "this random selection method."

[0026] FIG. 5 is a diagram showing an example of this random selection method. Details of this random selection method shown in FIG. 5 will be described later, but first, for example, the SC generates one random number r using the random selection method 2 or the like to generate a seed value, and selects the first BC account using the seed value. Next, for example, the SC selects the second BC account using the account ID of the hashed BC selected first as the next seed value. In this way, the account ID of the selected hashed BC is used as the next seed value to repeat the selection process of the BC account N-1 times, thereby selecting N-1 BC accounts. That is, N BC accounts are randomly selected from the first BC account selected using the random selection method 2 or the like and the N-1 BC accounts.

[0027] In this random selection method, random numbers with no fixed pattern can be generated without hash calculations each time in the selection process for the second and subsequent BC accounts, so the time cost of the random number generation process for N-1 times is small. Therefore, in this random selection method, the larger N is, that is, the more BC accounts are selected, the greater the effect of reducing the time cost.

[0028] Fig. 6 is a diagram for explaining the time costs of the random selection method 2 and this random selection method. The left side of Fig. 6 shows the random selection method 2, and the right side shows the this random selection method.

[0029] As shown on the left side of Figure 6, for example, when randomly selecting N BC accounts, random selection method 2 requires repeating the time-intensive random number generation process N times, resulting in a very large total time cost.

[0030] On the other hand, as shown on the right side of Figure 6, in this random selection method, a random number generation process with a high time cost is used to select the first BC account, but the selection of the second and subsequent BC accounts requires less time cost.

[0031] [Functional configuration of the account selection device 10] Next, a functional configuration of the account selection device 10 that executes this random selection method will be described. FIG. 7 is a diagram showing an example of the configuration of the account selection device 10 according to this embodiment. The account selection device 10 shown in FIG. 7 is, for example, an information processing device such as a server computer, or a desktop PC (Personal Computer) or a notebook PC. Note that while FIG. 7 shows the account selection device 10 as a single computer, it may also be a distributed computing system made up of a plurality of computers. Furthermore, the account selection device 10 may also be a cloud computer device managed by a service provider that provides cloud computing services.

[0032] As shown in FIG. 7, the account selection device 10 includes a communication unit 20, a storage unit 30, and a control unit 40.

[0033] The communication unit 20 is a processing unit that controls communication with other devices, and is, for example, a communication interface such as a network interface card or a Universal Serial Bus (USB) interface.

[0034] The storage unit 30 has a function of storing various data and programs executed by the control unit 40, and stores, for example, user information 31, an account ID array 32, and the like.

[0035] The user information 31 stores, for example, information about users of the distributed community. The user information 31 may be stored outside the BC. FIG. 8 is a diagram showing an example of data stored in the user information 31 according to the present embodiment. As shown in FIG. 8, the user information 31 stores, in association with each other, a user ID that uniquely identifies a user of the distributed community, a BC account ID that uniquely identifies an account on the BC associated with the user, and the like. The BC account ID may include a hashing flag indicating whether or not to hash the original BC account, an original indicating the original BC account, and a hash value indicating the hashed BC account ID. For example, when the BC account ID is an account address of Ethereum (registered trademark), the hashing flag is set to “0” (not hashed) since the BC account ID has already been hashed and does not need to be hashed. The hash value is, for example, the BC account ID hashed using a hash function h that is a function that outputs the lower 20 bytes of Keccak-256, which is a hash algorithm. In addition, if the BC account ID is an Ethereum account address, the size of the hash output by the hash function h is set to the size of the Ethereum account address.

[0036] The account ID array 32 stores information on identifiers such as BC account addresses of all users of the distributed community. The account ID array 32 may be stored on the BC. FIG. 9 is a diagram showing an example of data stored in the account ID array 32 according to this embodiment. As shown in FIG. 9, the account ID array 32 stores, for example, an index and an element indicating a hashed BC account ID in association with each other. That is, a hashed ID obtained by hashing the identifiers of each of the multiple BC accounts on the BC is stored in the BC in association with the index. Here, the identifiers of each of the multiple BC accounts on the BC may be, for example, a BC account ID, and the hashed ID may be a hashed BC account ID.

[0037] The storage process may include a process of storing, in association with an index, a hashed ID obtained by hashing identifiers of multiple BC accounts, each of which corresponds to multiple accounts of the same community in the distributed community system.

[0038] The storage process may include a process of storing a hashed ID obtained by hashing the identifiers of the multiple BC accounts each associated with multiple people or multiple devices in association with an index. The multiple people associated with each of the multiple BC accounts may be people who require fairness and transparency, such as evaluators in a distributed community, speakers in meetings, and prize winners. The multiple devices associated with each of the multiple BC accounts may be things that require fairness and transparency, such as devices for acquiring environmental data.

[0039] Returning to the explanation of FIG. 7, the above information stored in the storage unit 30 is merely an example, and the storage unit 30 can store various information other than the above information.

[0040] The control unit 40 is a processing unit, such as a processor, that controls the entire account selection device 10. The control unit 40 includes a generating unit 41, a selecting unit 42, and a determining unit 43. Each processing unit is an example of an electronic circuit included in a processor or an example of a process executed by a processor.

[0041] The generating unit 41 generates a seed value based on a random number by, for example, an SC. The SC may be, for example, an SC on a blockchain in which a hashed ID obtained by hashing each identifier of a plurality of BC accounts is stored in association with an index. The process of generating the seed value may include, for example, a process of performing an operation on a random number using a hash function, hashing the random number, and generating a seed value. The process of generating the seed value may include a process of generating a seed value based on a random number generated using input values ​​of a plurality of users. Here, the random number generated using input values ​​of a plurality of users is a random number generated by the random number generation process that requires time and is described in the random selection method 2 shown in FIG. 4. The random number or the seed value generated based on the random number is used to select a first hashed ID.

[0042] Furthermore, the generating unit 41 generates a value that identifies one of the multiple BC accounts based on a seed value, for example, by the SC. The process of generating a value that identifies one of the multiple BC accounts may be repeated a predetermined number of times, for example, with the first hashed ID selected by the selecting unit 42 as the next seed value. This repeated process is, for example, a process for selecting the second or subsequent hashed ID. That is, by using the selected first hashed ID as a seed value, unlike the case of selecting the first hashed ID, it is not necessary to generate a random number to generate a seed value.

[0043] The selection unit 42 selects a first hashed ID from the multiple hashed IDs associated with the index based on a value that identifies one of the multiple BC accounts generated by the generation unit 41 by the SC. The SC may be, for example, an SC on a blockchain in which hashed IDs obtained by hashing the identifiers of the multiple BC accounts are stored in association with the index. In addition, the selection process of the first hashed ID may be repeated a predetermined number of times, for example, using the first hashed ID selected by the selection unit 42 as a seed value. Here, the predetermined number of times may be, for example, N-1 times when the number of BC accounts to be selected is N. As a result, N BC accounts are randomly selected from one hashed BC account ID selected using the random selection method 2 or the like and N-1 hashed BC account IDs.

[0044] The determination unit 43 receives evaluations of things in the community input by users of accounts associated with the multiple first hashed IDs selected by the selection unit 42, and determines a reward for the things based on the evaluations. If the hashed IDs selected by the selection unit 42 are not used to select evaluators for the distributed community, the account selection device 10 does not need to include the determination unit 43 that determines a reward for the things in the community. In other words, the hashed IDs selected by the selection unit 42 may be used to select not only evaluators, but also people or things that require fairness and transparency, such as speakers in meetings, devices for acquiring environmental data, and prize winners.

[0045] [Processing flow] Next, the flow of the account selection process according to this embodiment will be described with reference to Fig. 10. Fig. 10 is a flowchart showing an example of the flow of the account selection process according to this embodiment.

[0046] 10, the account selection device 10 generates a hashed ID by hashing each identifier of a plurality of BC accounts on the BC, and stores the hashed ID in association with an index (step S101). Note that, in step S101, for example, the hashed ID may be stored in the account ID array 32 in association with an index as an element of the account ID array 32. Also, the identifier of each of the plurality of BC accounts on the BC may be, for example, a BC account ID, and the hashed ID may be a hashed BC account ID.

[0047] Next, the account selection device 10 sets the selection number, which is the number of people or things to be selected, such as evaluators of a distributed community, in the SC (step S102). The selection number may be determined as a reasonable number, such as 100, each time a selection is made in order to ensure fairness, and may be stored in the storage unit 30, and the account selection device 10 acquires the selection number and sets it in the SC for the processing in step S103 and thereafter.

[0048] Next, the account selection device 10 generates a random number by the SC, for example, using the random selection method 2 shown in Fig. 4, and generates a seed value based on the random number (step S103). More specifically, the account selection device 10 generates the seed value by hashing the random number, for example.

[0049] Next, the account selection device 10 generates a specific value that is a value that identifies one of the multiple BC accounts, for example, based on a seed value (step S104). The generation of the specific value in step S104 is, for example, a calculation of the specific value i using the formula "i=r mod length(A)". The operator mod is, for example, an operator that returns the remainder when an arbitrary number x is converted to a decimal number and then divided by an arbitrary decimal number y, assuming "x mod y". Furthermore, length(A) is the array length of the account ID array A, which is, for example, the account ID array 32 shown in FIG. 9.

[0050] The seed value used in step S104 may be the seed value generated in step S103 in the first process, i.e., in the process for selecting the first hashed ID. In the second or subsequent processes, i.e., in the process for selecting the second or subsequent hashed ID, the hashed ID selected in step S105 is used as the seed value.

[0051] Next, the account selection device 10 selects a first hashed ID from the multiple hashed IDs stored in association with the index in step S101, based on the specific value generated in step S104, for example (step S105).

[0052] Next, the account selection device 10 determines whether or not the first hashed IDs have been selected the number of times equal to the number of selections set in step S102 (step S106). If the first hashed IDs have been selected the number of selections (step S106: Yes), the account selection process shown in FIG. 10 ends.

[0053] On the other hand, if the first hashed ID has not been selected for the number of selections (step S106: No), the account selection device 10 returns to step S104, for example, with the first hashed ID selected in step S105 as the next seed value, and repeats steps S104 to S106 until the first hashed ID has been selected for the number of selections.

[0054] As another example of the flow of the account selection process, the account selection process according to this embodiment will be described in more detail with reference to Figures 11 to 15. Figure 11 is a flowchart showing another example of the flow of the account selection process according to this embodiment.

[0055] As shown in Fig. 11, the account selection process according to this embodiment is processed using various functions. Note that the account selection process shown in Fig. 11 will be described from the random number generation process onwards, assuming that the hashed ID storage process (step S101) and the selection number setting process (step S102) in Fig. 10 have been executed in advance.

[0056] Moreover, the account selection process shown in FIG. 11 is executed under the following assumptions, for example. The size of the hash value is 2 bytes, and the hash function h is a hash function that outputs the lower 2 bytes of a random number generated by Keccak-256. Assume a case in which two evaluators are selected. As shown in the account ID array 32 in FIG. 9, the hash values ​​of three BC account IDs are registered as the account ID array A. Moreover, for the calculation of the elements of the account ID array A and the seed value s, for example, a function g that uses an exclusive OR (XOR) is used. If the index at the time of account selection is duplicated, the open address method is used. For example, this is a function that outputs an incremented value of the index, and if the incremented index exceeds "length(A)-1", 0 is output. Moreover, if a BC account ID that has already been selected is selected, a function next() that outputs the index of another account ID array A is used, and the argument of next() is next(i, length(A)-1). Moreover, the random number r' generated by the method of generating random numbers in the SC is set to 1.

[0057] The account selection process shown in FIG. 11 will be explained by dividing it into several processing steps using FIGS. 12 to 15. FIG. 12 is a diagram (1) for explaining a flowchart showing another example of the flow of the account selection process according to this embodiment. In FIG. 12, the flow of the process indicated by the solid arrow (from step S201 to S206: No) will be explained. The right side of FIG. 12 shows the status of each array. The account ID array A is an array corresponding to the account ID array 32 in FIG. 9 as described above. The selected index array I is, for example, an array of indexes in the account ID array A of the selected BC account ID. The random selection result storage array W is, for example, an array that stores the addresses of the selected BC accounts. At the stage of the account selection process shown in FIG. 12, since no BC accounts have been selected yet, the selected index array I and the random selection result storage array W are empty.

[0058] First, as shown in Fig. 12, the account selection device 10 calculates, for example, "r' = f()" (step S201). The function f() is, for example, a function that generates a pseudo-random number in SC as described in the random selection method 2 shown in Fig. 4. The random number r' is, for example, a pseudo-random number generated by the function f(), and as described above, the random number r' generated in step S201 is set to 1.

[0059] Next, the account selection device 10 calculates, for example, "r=h(r')" (step S202). The function h() is, for example, a hash function that outputs the lower 2 bytes of a random number generated by Keccak-256 as described above. r is, for example, a pseudo-random number obtained by hashing the random number r' by the hash function h(), and the random number calculated in step S202 is "r=h(1)=0x8bc6".

[0060] Next, the account selection device 10 calculates, for example, "s = r" (step S203). s is, for example, a seed value, and step S203 means using the random number r calculated in step S202 as the seed value, that is, "s = 0x8bc6".

[0061] Next, the account selection device 10 determines, for example, the condition "length(W) < N" (step S204). "length(W)" is, for example, a function that returns the array length of the random selection result storage array W. Since no BC account has been selected yet, the random selection result storage array W is empty, so "length(W) = 0". Also, the selection number N is, for example, the number of evaluators to be selected. As described above, since two evaluators are to be selected, "N = 2". Therefore, "length(W) < N" becomes "0 < 2", and in step S204, the process proceeds to the Yes route.

[0062] Next, the account selection device 10 calculates, for example, "i = r mod length(A)" (step S205). The operator mod is, for example, an operator that returns the remainder when any number x is divided by any decimal number y after converting x to a decimal number in the case of "x mod y". Also, since length(A) is the array length of the account ID array A, it is 3. Therefore, in step S205, "i = r mod length(A)" becomes "i = 0x8bc6 mod 3", and "i = 1". Note that the i calculated here is, for example, a specific value generated in step S104 in the account selection process shown in FIG. 10.

[0063] Next, the account selection device 10 judges, for example, whether the condition "(i in I)==true" (step S206). "i in I" is a process that returns "true" if the selected index array I has an element with i, and returns "false" otherwise. Here, since no BC account has been selected yet, there are no elements in the selected index array I, and "(i in I)=(1 in I)=false" occurs, and the process proceeds to the No route in step S206. After proceeding to the No route in step S206, step S208 is executed, which will be described with reference to FIG. 13.

[0064] Fig. 13 is a diagram (2) for explaining a flowchart showing another example of the flow of the account selection process according to this embodiment. Fig. 13 is a continuation of the account selection process explained in Fig. 12, and explains the flow of the process indicated by the arrows shown with solid lines (steps S208 to S210, returning to step S204, and up to step S204: Yes).

[0065] Proceeding from the No route of step S206, next, the account selection device 10 calculates, for example, "append(i,I)" (step S208). "append(i,I)" is a function that adds element x to array X when, for example, "append(x,X)". Therefore, "append(i,I)" is a process that adds element i to the selected index array I. Here, since "i=1" was calculated in step S205, "append(i,I)" becomes "append(1,I)", and the element "1" is added to the selected index array I, as shown on the right side of FIG. 13.

[0066] Next, the account selection device 10 calculates, for example, "append(A[i], W)" (step S209). Here, since "i = 1" is calculated in step S205, A[i] becomes A[1], and as shown on the right side of FIG. 13, A[1] is "0x6b87". Therefore, "append(A[i], W)" becomes "append(0x6b87, W)", and as shown on the right side of FIG. 13, the element "0x6b87" at index 1 of the account ID array A is added to the random selection result storage array W. Note that A[i] added here is, for example, the hashed ID selected in step S105 in the account selection process shown in FIG. 10.

[0067] Next, the account selection device 10 calculates, for example, "r = A[i] XOR s" (step S210). That is, the account selection device 10 calculates, for example, a random number r for selecting the next hashed ID using the selected hashed ID A[i] as the next seed value. Here, for example, since a simple exclusive OR (XOR) is used as the calculation process for the random number, the time cost is less compared to the calculation of the random number by the random selection method 2 that performs hash calculation. Also, in step S210, "A[i] = A[1] = 0x6b87" and the seed value s calculated in step S203 is "0x8bc6", so "r = A[i] XOR s" becomes "r = 0x6b87 XOR 0x8bc6 = 0xe041".

[0068] Next, the account selection device 10 determines, for example, the condition "length(W) < N" (step S204). Here, in step S209, one element is added to the random selection result storage array W, so "length(W) = 1", and since "N = 2", "length(W) < N" becomes "1 < 2", and the process proceeds to the Yes route. After proceeding to the Yes route of step S204, step S205 is executed, which will be described with reference to FIG. 14 from here.

[0069] Fig. 14 is a diagram (3) for explaining a flowchart showing another example of the flow of the account selection process according to the present embodiment. Fig. 14 is a continuation of the account selection process explained in Fig. 13, and explains the flow of the process indicated by the solid arrows (from step S205 to S207).

[0070] Proceeding from the Yes route in step S204, the account selection device 10 next judges, for example, the condition "(i in I)==true" (step S206). In this case, "i=1", and since the element "i=1" was added to the selected index array I in step S208, "(i in I)=(1 in I)=true" is obtained, and the process proceeds to the Yes route.

[0071] Next, the account selection device 10 calculates, for example, "i = next (i, length (A) - 1)" (step S207). The function next() is used, for example, when an already selected BC account ID is further selected, and is a function that outputs the index of another account ID array A. Here, since "length (A)" is 3, "i = next (i, length (A) - 1) = next (1, 2) = 2" is obtained. Note that if the argument i of the function next() is 2, this exceeds 2, and the return value is 0. After step S207 is executed, step S206 is executed, but from here, explanation will be given with reference to FIG. 15.

[0072] Fig. 15 is a diagram (4) for explaining a flowchart showing another example of the flow of the account selection process according to this embodiment. Fig. 15 is a continuation of the account selection process explained in Fig. 14, and explains the flow of the process indicated by the arrows shown with solid lines (steps S206 to S210, returning to step S204, step S211, and the end of the process).

[0073] Proceeding from step S207, next, the account selection device 10 determines, for example, the condition "(i in I) == true" (step S206). Here, since "i = 2" is calculated in step S207, "(i in I) = (2 in I) = false", and it proceeds to the No route.

[0074] Next, the account selection device 10 calculates, for example, "append(i, I)" (step S208). Here, since "i = 2" is calculated in step S207, "append(i, I)" becomes "append(2, I)", and as shown on the right side of FIG. 15, the element "2" is added to the selected index array I.

[0075] Next, the account selection device 10 calculates, for example, "append(A[i], W)" (step S209). Here, since "i = 1" is calculated in step S205, A[i] becomes A[2], and A[2] is "0xd473" as shown on the right side of FIG. 15. Therefore, "append(A[i], W)" becomes "append(0xd473, W)", and as shown on the right side of FIG. 15, the element "0xd473" at index 1 of the account ID array A is added to the random selection result storage array W.

[0076] Next, the account selection device 10 calculates, for example, "r = A[i] XOR s" (step S210). Here, "A[i] = A[2] = 0xd473", and the seed value s calculated in step S203 is "0x8bc6", so "r = A[i] XOR s" becomes "r = 0xd473 XOR 0x8bc6 = 0x5fb5".

[0077] Next, the account selection device 10 determines, for example, the condition "length(W) < N" (step S204). Here, in step S209, one more element is added to the random selection result storage array W, making it 2, so "length(W) = 2", and since "N = 2", "length(W) < N" becomes "2 < 2", and it proceeds to the No route.

[0078] Next, the account selection device 10 calculates, for example, "return(W)" (step S211). Since the function return() is, for example, a function that returns an argument, "return(W)" returns an element of the random selection result storage array W, becoming "return([0x6b87, 0xd473])". The element returned here is, for example, a randomly selected BC account ID, and the account selection device 10 can use this to select people or things that require fairness and transparency, such as evaluators of a distributed community. After step S211 is executed, the account selection process ends.

[0079] [effect] As described above, the account selection device 10 generates a seed value based on a random number using a smart contract on a blockchain in which hashed IDs obtained by hashing the identifiers of each of a plurality of blockchain (BC) accounts are stored, selects a first hashed ID from the plurality of hashed IDs based on the seed value, and selects a second hashed ID from the plurality of hashed IDs using the selected first hashed ID as the seed value.

[0080] In this way, when the SC randomly selects multiple hashed IDs obtained by hashing the identifiers of the BC accounts on the BC, the hashed ID selected by the seed value based on the random number is used as a seed value for selecting the next hashed ID. This allows the account selection device 10 to reduce the time cost required when the SC randomly selects multiple BC accounts on the BC.

[0081] Furthermore, the account selection device 10 repeats the process of selecting the next second hashed ID from the multiple hashed IDs a predetermined number of times, using the selected second hashed ID as a seed value.

[0082] This allows the account selection device 10 to reduce the time cost involved in randomly selecting a plurality of BC accounts on the BC using the SC.

[0083] Furthermore, the process of generating a seed value executed by the account selection device 10 includes a process of generating a seed value based on a random number generated using input values ​​of a plurality of users.

[0084] This allows the account selection device 10 to reduce the time cost involved in randomly selecting a plurality of BC accounts on the BC by the SC, while ensuring fairness and transparency.

[0085] Furthermore, the process of generating a seed value executed by the account selection device 10 includes a process of performing an operation on a random number using a hash function to generate a seed value.

[0086] This allows the account selection device 10 to reduce the time cost involved in randomly selecting a plurality of BC accounts on the BC by the SC, while ensuring fairness and transparency.

[0087] The account selection device 10 also stores, in association with an index, a hashed ID obtained by hashing the identifiers of a plurality of BC accounts each associated with a plurality of accounts in the same community in the distributed community system.

[0088] This allows the account selection device 10 to reduce the time cost involved in randomly selecting, by the SC, a plurality of BC accounts on the BC that are associated with an account in the distributed community.

[0089] The account selection device 10 also accepts evaluations of things within the community input by users of accounts associated with the selected multiple first hashed IDs.

[0090] This allows the account selection device 10 to evaluate things within the community with guaranteed fairness and transparency.

[0091] The account selection device 10 also determines a reward for the item based on the evaluation.

[0092] This allows the account selection device 10 to determine more appropriate rewards for things within the community using evaluations that ensure fairness and transparency.

[0093] Furthermore, the account selection device 10 stores a hashed ID obtained by hashing the identifiers of a plurality of BC accounts each associated with a plurality of people or a plurality of devices, in association with an index.

[0094] This allows the account selection device 10 to reduce the time cost involved in randomly selecting, by the SC, a plurality of BC accounts on the BC that are associated with a person or device, while ensuring fairness and transparency.

[0095] [system] The information including the processing procedures, control procedures, specific names, various data and parameters shown in the above documents and drawings may be changed arbitrarily unless otherwise specified. In addition, the specific examples, distributions, numerical values, etc. described in the embodiments are merely examples and may be changed arbitrarily.

[0096] Furthermore, the specific form of distribution or integration of the components of the account selection device 10 is not limited to that shown in the figure. For example, the selection unit 42 of the account selection device 10 may be distributed to multiple processing units, or the generation unit 41 and the selection unit 42 of the account selection device 10 may be integrated into one processing unit. In other words, all or some of the components may be functionally or physically distributed or integrated in any unit depending on various loads and usage conditions. Furthermore, all or any part of the processing functions of each device may be realized by a CPU or a program analyzed and executed by the CPU (Central Processing Unit), or may be realized as hardware using wired logic.

[0097] Fig. 16 is a diagram showing an example of a hardware configuration of the account selection device 10 according to the present embodiment. As shown in Fig. 16, the account selection device 10 has a communication interface 10a, a HDD (Hard Disk Drive) 10b, a memory 10c, and a processor 10d. Moreover, each unit shown in Fig. 16 is connected to each other via a bus or the like.

[0098] The communication interface 10a is a network interface card or the like, and communicates with other information processing devices. For example, when the account selection device 10 is the account selection device 10, the HDD 10b stores programs and data for operating each function shown in FIG.

[0099] The processor 10d is a CPU, a micro processing unit (MPU), a graphics processing unit (GPU), etc. The processor 10d may also be realized by an integrated circuit such as an application specific integrated circuit (ASIC) or a field programmable gate array (FPGA). The processor 10d reads out a program that executes the same processes as the processing units shown in FIG. 7, etc. from the HDD 10b, etc., and loads it in the memory 10c. This allows the processor 10d to operate as a hardware circuit that executes a process that realizes each function described in FIG. 7, etc.

[0100] Furthermore, the account selection device 10 can also realize functions similar to those of the above-described embodiment by reading the above-described program from a recording medium using a medium reading device and executing the read program. Note that the program in these other embodiments is not limited to being executed by the account selection device 10. For example, the above-described embodiment may also be applied in the same manner to a case where an information processing device other than the account selection device 10 executes a program, or a case where the account selection device 10 and another information processing device cooperate to execute a program.

[0101] The program may be distributed via a network such as the Internet. The program may be recorded on a computer-readable storage medium such as a hard disk, a flexible disk (FD), a CD-ROM, a magneto-optical disk (MO), or a digital versatile disk (DVD). The program may be executed by being read from the storage medium by the account selection device 10 or the like.

[0102] The following supplementary notes are further disclosed regarding the embodiments including the above examples.

[0103] (Appendix 1) A smart contract on the blockchain that stores hashed IDs, which are the hashed identifiers of multiple blockchain (BC) accounts, Generate a seed value based on a random number, selecting a first hashed ID from the plurality of hashed IDs based on the seed value; Selecting a second hashed ID from the plurality of hashed IDs using the selected first hashed ID as the seed value. An account selection program that causes a computer to execute a process.

[0104] (Appendix 2) The account selection program according to appendix 1, characterized in that the computer is caused to execute a process of repeating a process of selecting the next second hashed ID from a plurality of the hashed IDs a predetermined number of times using the selected second hashed ID as the seed value.

[0105] (Additional Note 3) The process of generating the seed value includes: generating the seed value based on the random number generated using a plurality of user input values; 3. The account selection program according to claim 1 or 2, further comprising a process for:

[0106] (Additional Note 4) The process of generating the seed value includes: A hash function is used to calculate the random number to generate the seed value. 3. The account selection program according to claim 1 or 2, further comprising a process for:

[0107] (Appendix 5) An account selection program as described in Appendix 1 or 2, characterized in that the computer is caused to execute a process of hashing the identifiers of each of the multiple BC accounts, each of which corresponds to multiple accounts of the same community in a distributed community system, and storing the hashed ID associated with an index.

[0108] (Appendix 6) The account selection program described in Appendix 5, characterized in that it causes the computer to execute a process of accepting evaluations of things within the community entered by users of the accounts corresponding to the selected multiple first hashed IDs.

[0109] (Appendix 7) The account selection program according to appendix 6, characterized in that the computer is caused to execute a process of determining a reward for the item based on the evaluation.

[0110] (Appendix 8) The account selection program according to appendix 1 or 2, characterized in that the computer is caused to execute a process of hashing the identifiers of each of the multiple BC accounts, each of which corresponds to multiple people or multiple devices, and storing the hashed ID associated with an index.

[0111] (Appendix 9) A smart contract on a blockchain that stores hashed IDs obtained by hashing the identifiers of each of multiple blockchain (BC) accounts. Generate a seed value based on a random number, selecting a first hashed ID from the plurality of hashed IDs based on the seed value; Selecting a second hashed ID from the plurality of hashed IDs using the selected first hashed ID as the seed value. An account selection device having a control unit for executing a process.

[0112] (Supplementary Note 10) The account selection device described in Supplementary Note 9, characterized in that the control unit executes a process of repeating a process of selecting the next second hashed ID from a plurality of the hashed IDs a predetermined number of times using the selected second hashed ID as the seed value.

[0113] (Appendix 11) The process of generating the seed value includes: generating the seed value based on the random number generated using a plurality of user input values; 11. The account selection device according to claim 9 or 10, further comprising a process.

[0114] (Appendix 12) The process of generating the seed value includes: A hash function is used to calculate the random number to generate the seed value. 11. The account selection device according to claim 9 or 10, further comprising a process.

[0115] (Appendix 13) The account selection device described in Appendix 9 or 10, characterized in that the control unit executes a process of storing the hashed ID, which is obtained by hashing the identifiers of each of the multiple BC accounts, each of which corresponds to multiple accounts of the same community in a distributed community system, in association with an index.

[0116] (Appendix 14) The account selection device described in Appendix 13, characterized in that the control unit executes a process of accepting evaluations of things within the community entered by users of the accounts corresponding to the selected multiple first hashed IDs.

[0117] (Supplementary Note 15) The account selection device according to Supplementary Note 14, characterized in that the control unit executes a process of determining a reward for the thing based on the evaluation.

[0118] (Appendix 16) The account selection device described in Appendix 9 or 10, characterized in that the control unit executes a process of storing the hashed ID, which is obtained by hashing the identifiers of each of the multiple BC accounts, each of which is associated with multiple people or multiple devices, in association with an index.

[0119] (Appendix 17) A smart contract on a blockchain that stores hashed IDs obtained by hashing the identifiers of each of multiple blockchain (BC) accounts, Generate a seed value based on a random number, selecting a first hashed ID from the plurality of hashed IDs based on the seed value; Selecting a second hashed ID from the plurality of hashed IDs using the selected first hashed ID as the seed value. The account selection method under which the computer will run the operation.

[0120] (Appendix 18) The account selection method described in Appendix 17, characterized in that the control unit executes a process of repeating a process of selecting the next second hashed ID from a plurality of the hashed IDs a predetermined number of times using the selected second hashed ID as the seed value.

[0121] (Supplementary Note 19) The process of generating the seed value includes: generating the seed value based on the random number generated using a plurality of user input values; 19. The account selection method according to claim 17 or 18, further comprising the steps of:

[0122] (Supplementary Note 20) The process of generating the seed value includes: A hash function is used to calculate the random number to generate the seed value. 19. The account selection method according to claim 17 or 18, further comprising the steps of:

[0123] (Appendix 21) The account selection method described in Appendix 17 or 18, characterized in that the computer executes a process of hashing the identifiers of each of the multiple BC accounts, each of which corresponds to multiple accounts of the same community in a distributed community system, and storing the hashed ID in association with an index.

[0124] (Appendix 22) The account selection method described in Appendix 21, characterized in that the computer executes a process of accepting evaluations of things within the community entered by users of the accounts corresponding to the selected multiple first hashed IDs.

[0125] (Appendix 23) The account selection method described in Appendix 22, characterized in that the computer executes a process of determining a reward for the item based on the evaluation.

[0126] (Appendix 24) The account selection method described in Appendix 17 or 18, characterized in that the computer executes a process of hashing the identifiers of each of the multiple BC accounts, each of which is associated with multiple people or multiple devices, and storing the hashed ID in association with an index.

[0127] (Appendix 25) A processor; a memory operatively connected to the processor; An account selection device comprising: A smart contract on the blockchain stores hashed IDs, which are the hashed identifiers of multiple blockchain (BC) accounts. Generate a seed value based on a random number, selecting a first hashed ID from the plurality of hashed IDs based on the seed value; Selecting a second hashed ID from the plurality of hashed IDs using the selected first hashed ID as the seed value. 23. An account selection device comprising: a processor for executing a process for selecting an account; [Explanation of symbols]

[0128] 10 Account selection device 10a Communication Interface 10b HDD 10c Memory 10d Processor 20 Communications Department 30 Storage section 31 User Information 32 Account ID array 40 Control section 41 Generation part 42 Selection section 43 Decision Section

Claims

1. A smart contract on a blockchain in which hashed IDs obtained by hashing the identifiers of each of a plurality of blockchain (BC) accounts are stored, Generate a seed value based on a random number, selecting a first hashed ID from the plurality of hashed IDs based on the seed value; Selecting a second hashed ID from the plurality of hashed IDs using the selected first hashed ID as the seed value. An account selection program that causes a computer to execute a process.

2. The account selection program of claim 1, further comprising causing the computer to execute a process of repeating a process of selecting the next second hashed ID from a plurality of the hashed IDs a predetermined number of times using the selected second hashed ID as the seed value.

3. The process of generating a seed value includes the steps of: generating the seed value based on the random number generated using a plurality of user input values; 3. The account selection program according to claim 1, further comprising a process for:

4. The process of generating a seed value includes the steps of: A hash function is used to calculate the random number to generate the seed value.

3. The account selection program according to claim 1, further comprising a process for:

5. The account selection program of claim 1 or 2, characterized in that the computer is caused to execute a process of storing the hashed ID, which is obtained by hashing the identifiers of each of the multiple BC accounts that correspond to multiple accounts of the same community in a distributed community system, in association with an index.

6. The account selection program according to claim 5, characterized in that the computer is caused to execute a process of accepting evaluations of things within the community entered by users of the accounts corresponding to the selected multiple first hashed IDs.

7. 7. The account selection program according to claim 6, wherein the computer is caused to execute a process of determining a reward for the item based on the evaluation.

8. The account selection program according to claim 1 or 2, characterized in that the computer is caused to execute a process of storing the hashed ID, which is a hashed version of the identifiers of each of the multiple BC accounts, each of which corresponds to a multiple number of persons or multiple devices, in association with an index.

9. A smart contract on a blockchain in which hashed IDs obtained by hashing the identifiers of each of a plurality of blockchain (BC) accounts are stored, Generate a seed value based on a random number, selecting a first hashed ID from the plurality of hashed IDs based on the seed value; Selecting a second hashed ID from the plurality of hashed IDs using the selected first hashed ID as the seed value. An account selection device having a control unit for executing a process.

10. A smart contract on a blockchain in which hashed IDs obtained by hashing the identifiers of each of a plurality of blockchain (BC) accounts are stored, Generate a seed value based on a random number, selecting a first hashed ID from the plurality of hashed IDs based on the seed value; Selecting a second hashed ID from the plurality of hashed IDs using the selected first hashed ID as the seed value. The account selection method under which the computer will run the operation.

Citation Information

Patent Citations

  • Parallel execution of transactions in a blockchain network

    JP2020515942A

  • Blockchain-based content sharing and creation server, content distribution server and system including these

    JP2022511623A

  • How to generate random numbers in a blockchain smart contract

    JP2022523643A

  • Method and Apparatus for Issuing Smart Contracts

    JP2022541929A

  • File redaction database system

    US20200204358A1