Resource allocation method

Abstract

Disclosed in the present application is a resource allocation method, comprising: a resource supplier submitting supply information; a resource consumer submitting demand information; a resource allocation system generating a supply and demand queue, a supply and demand queue set and blockchain evidence preservation information on the basis of the information submitted by the supplier and the consumer; within a random allocation time range, the resource allocation system using, on the basis of the supply and demand queue and the supply and demand queue set, a public random number service hash allocation method to perform random allocation; and the resource allocation system performing allocation within a queuing allocation time range according to a demand information queuing sequence in the supply and demand queue. The present embodiment can solve the technical problems present in existing flash-sale-style resource allocation methods, such as unfairness, high costs, poor experience, lack of transparency, lack of trustworthiness, and difficulty in terms of auditing.

Description

A resource allocation method Technical Field

[0001] The present invention relates to the field of computers, and in particular to a method for distributing public resources through network subscription. Background Art

[0002] Online ticket booking systems have made the booking process much easier. However, with ticket supply outstripping demand, addressing issues such as unfair resource allocation, high costs, poor user experience, lack of transparency, lack of trust, and difficulty in auditing has become a challenge. For example, during the Spring Festival travel rush, train tickets were in short supply. Customers had to go to the 12306 official website to select their train number and seat type, then compete for tickets at designated sales times. Only a small number of bookmakers who placed their orders earliest were able to secure tickets, while the majority of those who didn't secure tickets might continue to try. This led to a surge in traffic and high concurrency on the 12306 website within a short period of time, necessitating significant server resources and significant costs to maintain normal operation. Third-party paid ticket-grabbing platforms, leveraging their advantages such as high-performance supercomputing centers, ultra-low-latency dedicated networks, and automated ticket-grabbing scripts, were able to secure a significant number of tickets first. This resulted in significant inequality for other bookmakers, further exacerbating the high load on the 12306 website's server resources. Furthermore, paid ticket-grabbing also increased transaction costs. Ticket bookers must abandon their daily routines and wait anxiously for tickets at a fixed release time, with a high probability of failure, resulting in a very poor booking experience. Furthermore, due to the tampering and auditability of electronic data, operators of some public resource booking platforms often secretly resell already scarce ticket resources in bulk to scalpers, who then resell them to consumers at a marked-up price. This results in non-transparent, unfair, costly, unreliable, and difficult-to-audit allocation of public resources. Currently, similar flash sale bookings for scarce public resources such as scenic spot tickets, large-scale performance tickets, sports tickets, and medical appointments are also commonly subject to unfair allocation, high costs, poor experience, non-transparency, unreliability, and difficulty in auditing. Summary of the Invention

[0003] The technical problem to be solved by the present invention is to provide a resource allocation method that can solve the technical problems of unfairness, high cost, poor experience, non-disclosure, unreliability, and difficulty in auditing in existing resource allocation methods.

[0004] The method steps include:

[0005] The resource provider submits supply information, which includes supply time, supply model, supply quantity, random allocation time range, public random number service hash allocation method, and queue allocation time range;

[0006] Resource consumers submit demand information, which includes the demand time range, demand model range, and demand quantity;

[0007] The resource allocation system generates supply and demand queues, supply and demand queue sets, and blockchain evidence based on the information submitted by suppliers and consumers, and makes the supply and demand queues, supply and demand queue sets, and blockchain evidence publicly available.

[0008] The resource allocation system uses a public random number service hash allocation method to perform random allocation based on the supply and demand queues and the supply and demand queue sets within the random allocation time range;

[0009] The resource allocation system allocates resources according to the queue order of demand information in the supply and demand queue within the queue allocation time range.

[0010] This method addresses the issues of resource allocation supply and demand information being private, unreliable, and difficult to audit by making supply and demand information public and storing it on the blockchain. It also addresses the unfairness, high costs, poor user experience, unreliability, and difficulty in auditing caused by third-party paid ticket-grabbing platforms by increasing the random allocation timeframe and using a public random number service hash allocation method. BRIEF DESCRIPTION OF THE DRAWINGS

[0011] The drawings described herein are used to provide further understanding of the present disclosure and constitute a part of this application. The illustrative embodiments of the present disclosure and their descriptions are used to explain the present disclosure and do not constitute improper limitations on the present disclosure. DETAILED DESCRIPTION

[0012] In order to enable those skilled in the art to better understand the technical solutions of the present disclosure, the technical solutions in the embodiments of the present disclosure will be clearly and completely described below in conjunction with the drawings in the embodiments of the present disclosure. Obviously, the described embodiments are only part of the embodiments of the present disclosure, not all of the embodiments. Based on the embodiments of the present disclosure, all other embodiments obtained by ordinary technicians in this field without making creative efforts should fall within the scope of protection of the present disclosure.

[0013] It should be noted that the terms "first", "second", etc. in the specification and claims of the present disclosure and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the numbers used in this way can be interchanged where appropriate, so that the embodiments of the present disclosure described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions. For example, a process, method, system, product or device that includes a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0014] Taking the example of consumers ordering train tickets online, the specific steps include:

[0015] The first step is for the resource provider to submit supply information. On January 18, 2024, the Shanghai Railway Bureau released the supply information of train tickets from Shanghai to Beijing on 12306, including: G6 train departing at 8:00 a.m. on February 4, 2024, passing through Nanjing and Jinan, including 2 first-class tickets from Shanghai to Beijing, 3 second-class tickets from Shanghai to Beijing, and 4 second-class tickets from Nanjing to Jinan; G8 train departing at 9:00 a.m. on February 4, 2024, including 3 second-class tickets from Shanghai to Beijing. The booking start time for G6 and G8 on February 4, 2024 is specified as 8:00 a.m. on January 19, 2024, and the random allocation time range is January 20, 2024. The public random number service hash allocation method is to use the random seed generated by the public random number service provided by the National Institute of Standards and Technology of the United States at 10:00 a.m. on January 20, 2024 (https: / / csrc.nist.gov / projects / interoperable-randomness-beacons / beacon-20) and a random number hash hopping table with a message digest of e12bcb0180e75e7c29173809cb53173d64b28eb860b7404fbf4a3c2976d1eed3 (https: / / www.12306.cn / randomNoHash.txt, this URL is for reference only. The network file consists of a randomized data table of consecutive integers from 1 to 2 to the power of 28. One integer is placed per line in randomNoHash.txt, for a total of 268435456 lines). The queue allocation start time is 8:00 a.m. on January 21, 2024, and the queue allocation end time is 20 minutes before the train departure.

[0016] The second step is for resource consumers to submit demand information. Between 8:00 AM on January 19, 2024, and 8:00 AM on January 20, 2024, 18 consumers submitted demand order information. The specific demand information of consumers who book train tickets is in the following JSON data format:

[0017] [

[0018] {User ID: user01, Last 3 digits of mobile phone number: 001, Requested time range: Between 8:00 AM and 9:00 AM on February 4, 2024, Requested seat class range: [G6 first-class seat, G6 second-class seat, G8 second-class seat], Requested station: Shanghai to Beijing, Requested quantity: 2},

[0019] {User ID: user02, Last 3 digits of mobile phone number: 002, Requested time range: Between 8:00 AM and 9:00 AM on February 4, 2024, Requested seat class range: [G6 first-class, G6 second-class, G8 second-class], Requested station: Shanghai to Beijing, Requested quantity: 2},

[0020] {User ID: user03, Last 3 digits of mobile phone number: 003, Requested time range: Between 8:00 AM and 9:00 AM on February 4, 2024, Requested seat class range: [G6 first-class, G6 second-class, G8 second-class], Requested station: Shanghai to Beijing, Requested quantity: 2},

[0021] {User ID: user04, Last 3 digits of mobile phone number: 004, Requested time range: 8:00 AM, February 4, 2024, Requested train seat class range: [G6 first-class seat], Requested station: Shanghai to Beijing, Requested quantity: 1},

[0022] {User ID: user05, Last 3 digits of mobile phone number: 005, Requested time range: 8:00 AM, February 4, 2024, Requested train seat class range: [G6 first-class seat], Requested station: Shanghai to Beijing, Requested quantity: 1},

[0023] {User ID: user06, Last 3 digits of mobile phone number: 006, Requested time range: 8:00 AM, February 4, 2024, Requested train seat class range: [G6 first-class seat], Requested station: Shanghai to Beijing, Requested quantity: 1},

[0024] {User ID: user07, Last 3 digits of mobile phone number: 007, Requested time range: Between 8:00 AM and 9:00 AM on February 4, 2024, Requested train seat class range: [G6 second-class seat, G8 second-class seat], Requested station: Shanghai to Beijing, Requested quantity: 1},

[0025] {User ID: user08, Last 3 digits of mobile phone number: 008, Requested time range: Between 8:00 AM and 9:00 AM on February 4, 2024, Requested seat class range: [G6 second-class seat, G8 second-class seat], Requested station: Shanghai to Beijing, Requested quantity: 1},

[0026] {User ID: user09, Last 3 digits of mobile phone number: 009, Requested time range: Between 8:00 AM and 9:00 AM on February 4, 2024, Requested train seat class range: [G6 second-class seat, G8 second-class seat], Requested station: Shanghai to Beijing, Requested quantity: 1},

[0027] {User ID: user10, Last 3 digits of mobile phone number: 010, Requested time range: 8:00 AM, February 4, 2024, Requested train number and seat class range: [G6 second-class seat], Requested station: Nanjing to Jinan, Requested quantity: 2},

[0028] {User ID: user11, Last 3 digits of mobile phone number: 011, Requested time range: 8:00 AM, February 4, 2024, Requested train number and seat class range: [G6 second-class seat], Requested station: Nanjing to Jinan, Requested quantity: 2},

[0029] {User ID: user12, Last 3 digits of mobile phone number: 012, Requested time range: 8:00 AM, February 4, 2024, Requested train number and seat class range: [G6 second-class seat], Requested station: Nanjing to Jinan, Requested quantity: 2},

[0030] {User ID: user13, Last 3 digits of mobile phone number: 013, Requested time range: 8:00 AM, February 4, 2024, Requested train number and seat class range: [G6 second-class seat], Requested station: Nanjing to Jinan, Requested quantity: 2},

[0031] {User ID: user14, Last 3 digits of mobile phone number: 014, Requested time range: 8:00 AM, February 4, 2024, Requested train number and seat class range: [G6 second-class seat], Requested station: Nanjing to Jinan, Requested quantity: 1},

[0032] {User ID: user15, Last 3 digits of mobile phone number: 015, Requested time range: 8:00 AM, February 4, 2024, Requested train number and seat class range: [G6 second-class seat], Requested station: Nanjing to Jinan, Requested quantity: 1},

[0033] {User ID: user16, Last 3 digits of mobile phone number: 016, Requested time range: 9:00 AM, February 4, 2024, Requested train seat class range: [G8 second-class seat], Requested station: Shanghai to Beijing, Requested quantity: 1},

[0034] {User ID: user17, Last 3 digits of mobile phone number: 017, Requested time range: 9:00 AM, February 4, 2024, Requested train seat class range: [G8 second-class seat], Requested station: Shanghai to Beijing, Requested quantity: 1},

[0035] {User ID: user18, Last 3 digits of mobile phone number: 018, Requested time range: 9:00 AM, February 4, 2024, Requested train seat class range: [G8 second-class seat], Requested station: Shanghai to Beijing, Requested quantity: 2}

[0036] ].

[0037] The third step is that at 9:00 AM on January 20, 2024, the 12306 ticket booking system will generate supply and demand queues, supply and demand queue sets, and blockchain evidence based on the supply and demand information, and make the supply and demand queues, supply and demand queue sets, and blockchain evidence information public. First, four supply and demand queues are generated and expressed in JSON data format:

[0038] {

[0039] Supply and demand queue number: 1,

[0040] Supply information: 2 G6 first-class tickets from Shanghai to Beijing at 8:00 am on February 4, 2024.

[0041] Requirements list:

[0042] {User ID: user01, last 3 digits of mobile phone number: 001, required quantity: 2},

[0043] {User ID: user02, last 3 digits of mobile phone number: 002, required quantity: 2},

[0044] {User ID: user03, last 3 digits of mobile phone number: 003, required quantity: 2},

[0045] {User ID: user04, last 3 digits of mobile phone number: 004, required quantity: 1},

[0046] {User ID: user05, last 3 digits of mobile phone number: 005, required quantity: 1},

[0047] {User ID: user06, last 3 digits of mobile phone number: 006, required quantity: 1}

[0048] ]

[0049] },

[0050] {

[0051] Supply and demand queue number: 2,

[0052] Supply information: 3 G6 second-class tickets from Shanghai to Beijing at 8:00 am on February 4, 2024.

[0053] Requirements list:

[0054] {User ID: user01, last 3 digits of mobile phone number: 001, required quantity: 2},

[0055] {User ID: user02, last 3 digits of mobile phone number: 002, required quantity: 2},

[0056] {User ID: user03, last 3 digits of mobile phone number: 003, required quantity: 2},

[0057] {User ID: user07, last 3 digits of mobile phone number: 007, required quantity: 1},

[0058] {User ID: user08, last 3 digits of mobile phone number: 008, required quantity: 1},

[0059] {User ID: user09, last 3 digits of mobile phone number: 009, required quantity: 1}

[0060] ]

[0061] },

[0062] {

[0063] Supply and demand queue number: 3,

[0064] Supply information: 4 G6 second-class tickets from Nanjing to Jinan at 8:00 am on February 4, 2024.

[0065] Requirements list:

[0066] {User ID: user10, last 3 digits of mobile phone number: 010, required quantity: 2},

[0067] {User ID: user11, last 3 digits of mobile phone number: 011, required quantity: 2},

[0068] {User ID: user12, last 3 digits of mobile phone number: 012, required quantity: 2},

[0069] {User ID: user13, last 3 digits of mobile phone number: 013, required quantity: 2},

[0070] {User ID: user14, last 3 digits of mobile phone number: 014, required quantity: 1},

[0071] {User ID: user15, last 3 digits of mobile phone number: 015, required quantity: 1}

[0072] ]

[0073] },

[0074] {

[0075] Supply and demand queue number: 4,

[0076] Supply information: 3 G8 second-class tickets from Shanghai to Beijing at 9:00 am on February 4, 2024.

[0077] Requirements list:

[0078] {User ID: user01, last 3 digits of mobile phone number: 001, required quantity: 2},

[0079] {User ID: user02, last 3 digits of mobile phone number: 002, required quantity: 2},

[0080] {User ID: user03, last 3 digits of mobile phone number: 003, required quantity: 2},

[0081] {User ID: user07, last 3 digits of mobile phone number: 007, required quantity: 1},

[0082] {User ID: user08, last 3 digits of mobile phone number: 008, required quantity: 1},

[0083] {User ID: user09, last 3 digits of mobile phone number: 009, required quantity: 1},

[0084] {User ID: user16, last 3 digits of mobile phone number: 016, required quantity: 1},

[0085] {User ID: user17, last 3 digits of mobile phone number: 017, required quantity: 1},

[0086] {User ID: user18, last 3 digits of mobile phone number: 018, required quantity: 2}

[0087] ]

[0088] }.

[0089] The supply and demand queue set is then represented by a JSON data format array as [{supply and demand queue number: 1}, {supply and demand queue number: 2}, {supply and demand queue number: 3}, {supply and demand queue number: 4}].

[0090] The SM3 message digest algorithm was then used to calculate the digest of the files containing the text of each supply and demand queue. The digest of the file containing the text of supply and demand queue number 1 was 31806e57db59bfecb3b65bd185820330a1e69883d126d40d14d289646b539353. The digest of the file containing the text of supply and demand queue number 2 was 39ae4e59c71468224a89b463d3b015075f6c2c9500b98993448451bd2e6d2947. The digest of the file containing the text of supply and demand queue number 3 was 5e59ed66056cca0e2ff08e261bcd78cb31d8335bef9ad287600daf350775fce9. The file information summary containing the text content of supply and demand queue number 4 is f838ea97d418cd8d9a576e4c6cecbe9c85588bccc28c5ca5cd7fb1c220f19ce9.

[0091] Then, the JSON data format text required for blockchain storage is generated as follows: {Supply information: "Shanghai Railway Bureau released the Shanghai to Beijing train ticket supply information on 12306 on January 18, 2024, including: G6 train departing at 8:00 am on February 4, 2024, including 2 first-class tickets from Shanghai to Beijing, 3 second-class tickets from Shanghai to Beijing, and 4 second-class tickets from Nanjing to Jinan; G8 train departing at 9:00 am on February 4, 2024, including 3 second-class tickets from Shanghai to Beijing. The G6 and G8 trains on February 4, 2024 both specify a booking start time of 8:00 am on January 19, 2024, and a random allocation time range of January 20, 2024. The public random number service hash allocation The method uses a random seed generated by the public random number service provided by the National Institute of Standards and Technology at 10:00 AM on January 20, 2024 (https: / / csrc.nistgov / projects / interoperable-randomness-beacons / beacon-20) and a random number hash cyclic hopping table with a message digest of e12bcb0180e75e7c29173809cb53173d64b28eb860b7404fbf4a3c2976d1eed3. The queue allocation start time is 8:00 AM on January 21, 2024, and the queue allocation end time is 20 minutes before the train departure.

[0092] Supply and demand queue collection information summary: [{Supply and demand queue number: 1, information summary: 31806e57db59bfecb3b65bd185820330a1e69883d126d40d14d289646b539353}, {Supply and demand queue number: 2, information summary: 39ae4e59c71468224a89b463d3b015075f6c2c9500b98993448451bd2e6d2947}, {Supply and demand queue number: 3, information summary: 5e59ed 66056cca0e2ff08e261bcd78cb31d8335bef9ad287600daf350775fce9}, {Supply and demand queue number: 4, Information summary: f838ea97d418cd8d9a576e4c6cecbe9c85588bccc28c5ca5cd7fb1c220f19ce9}], Allocation method: "Using https: / / beacon.nist.gov / / beacon / 2.0 / pulse / tim The last seven digits of the outPutValue field of the data returned by e / 1705716000000 are used as the random seed and converted to decimal N. Starting from the N+1th row (inclusive) in the random number hash cyclic hopping code table, a number of hash random numbers equal to the number of elements in the longest supply and demand queue are extracted (because the maximum value of the random number range 268435456 cannot be divided by the length of the longest supply and demand queue 9, there is a problem that the demand information in the front has an advantage, and it is necessary to eliminate hash numbers with hash values ​​greater than 268435449. The number of hash random numbers after elimination is equal to the longest supply and demand queue). The queue length is 9. If the number of random numbers extracted to the end of the random number hash cyclic hopping code table is insufficient, continue to extract from the first row of the random number hash cyclic hopping code table. These hash random numbers are sequentially assigned to each demand information in the supply and demand queue. Then, the random number values ​​of each demand information are sorted from small to large. Then, they are allocated in order according to the queue order in the supply and demand queue set. If it is found during the allocation process that the demand has been allocated to the previous queue, it will not be allocated. After the queue allocation start time, new ticket purchase demands are added to the end of the supply and demand queue, and allocation is made from the head of the queue. ″}

[0093] Then, the national secret SM3 information digest algorithm is used to calculate the information digest of the JSON data format text that needs to be stored on the blockchain, which is eb5e5ba56af35df11e37ffdbaa552baadfedba90ae1f09e451d0521549a6963e.

[0094] The eb5e5ba56af35df11e37ffdbaa552baadfedba90ae1f09e451d0521549a6963e was then judicially deposited on the Baidu Blockchain Platform (https: / / xuper.baidu.com / ), generating a certificate numbered 69aab47c40aec8bc75a23ef5763ce28db166e9edbaca5ae0e8b85b8900222548. The public and third-party law enforcement audit agencies can use this certificate number to query and verify supply and demand information at any time at https: / / xuper.baidu.com / n / verify.

[0095] Then all supply and demand queues, supply and demand queue collections and blockchain evidence information in the third step will be announced on the 12306 platform before 9:30 am on January 20, 2024.

[0096] Step 4: At 10:01 AM on January 20, 2024, a random allocation was performed based on the supply and demand queues and the supply and demand queue sets using a public random number service hash allocation method. The 12306 system obtained the random number corresponding to 10:00 AM on January 20, 2024, from the official website of the National Institute of Standards and Technology (NIST) using the network data interface address https: / / beacon.nist.gov / / beacon / 2.O / pulse / time / 1705716000000. The number was D913973014564FD7A3657A9804EF43A81409B0F6559856A5D6BB23C33E284EAFE3B8902758FA026392C6D3F23397EBFCAF26875C399A4425DA2141E2DFFFFFFE.

[0097] Convert the last 7 digits of the 512-bit hexadecimal representation of the data (2 to the power of 28, corresponding to the amount of data in the random number hash cyclic hopping code table in the first step) FFFFFD into a decimal integer 268435454. Then, from the random number hash cyclic hopping code table with the message digest of e12bcb0180e75e7c29173809cb53173d64b28eb860b7404fbf4a3c2976d1eed3, the random number 70057484 in the 268435455th row (corresponding to the decimal of FFFFFD, because it starts from 0 and the random number hash cyclic hopping code table starts from the first row, so 1 needs to be added) the random number 211710438 in the 268435456th row, the random number 31594772 in the first row, and the random number 211710438 in the second row. The random number 55699475, the random number 21800843 in the third row, the random number 201525433 in the fourth row, the random number 37419295 in the fifth row, and the random number 268435455 in the sixth row are discarded (because the maximum value of the random number range, 268435456, is not divisible by the longest supply and demand queue length of 9, which gives the demand information in the front an advantage, it is necessary to discard hash numbers with hash values ​​greater than 268435449). The random number 3830864 in the seventh row and the random number 20920437 in the eighth row, a total of 9 numbers (the same as the longest supply and demand queue length), are assigned to the supply and demand queues. After these 9 numbers are assigned to the supply and demand queues, the JSON data format of supply and demand queue number 1 is:

[0098] {

[0099] Supply and demand queue number: 1,

[0100] Supply information: 2 G6 first-class tickets from Shanghai to Beijing at 8:00 am on February 4, 2024.

[0101] Requirements list:

[0102] {User ID: user01, last 3 digits of mobile phone number: 001, required quantity: 2, random number: 70057484},

[0103] {User ID: user02, last 3 digits of mobile phone number: 002, required quantity: 2, random number: 211710438},

[0104] {User ID: user03, last 3 digits of mobile phone number: 003, required quantity: 2, random number: 31594772},

[0105] {User ID: user04, last 3 digits of mobile phone number: 004, required quantity: 1, random number: 55699475},

[0106] {User ID: user05, last 3 digits of mobile phone number: 005, required quantity: 1, random number: 21800843},

[0107] {User ID: user06, Last 3 digits of mobile phone number: 006, Required quantity: 1, Random number: 201525433}

[0108] ]

[0109] }.

[0110] The JSON data format after sorting the random numbers from small to large is:

[0111] {

[0112] Supply and demand queue number: 1,

[0113] Supply information: 2 G6 first-class tickets from Shanghai to Beijing at 8:00 am on February 4, 2024.

[0114] Requirements list:

[0115] {User ID: user05, last 3 digits of mobile phone number: 005, required quantity: 1, random number: 21800843},

[0116] {User ID: user03, last 3 digits of mobile phone number: 003, required quantity: 2, random number: 31594772},

[0117] {User ID: user04, last 3 digits of mobile phone number: 004, required quantity: 1, random number: 55699475},

[0118] {User ID: user01, last 3 digits of mobile phone number: 001, required quantity: 2, random number: 70057484},

[0119] {User ID: user06, last 3 digits of mobile phone number: 006, required quantity: 1, random number: 201525433},

[0120] {User ID: user02, Last 3 digits of mobile phone number: 002, Required quantity: 2, Random number: 211710438}

[0121] ]

[0122] }.

[0123] Then, two G6 first-class tickets from Shanghai to Beijing at 8:00 a.m. on February 4, 2024 will be allocated to user05 and user04.

[0124] The JSON data format for the supply and demand queue number 2 is:

[0125] {

[0126] Supply and demand queue number: 2,

[0127] Supply information: 3 G6 second-class tickets from Shanghai to Beijing at 8:00 am on February 4, 2024.

[0128] Requirements list:

[0129] {User ID: user01, last 3 digits of mobile phone number: 001, required quantity: 2, random number: 70057484},

[0130] {User ID: user02, last 3 digits of mobile phone number: 002, required quantity: 2, random number: 211710438},

[0131] {User ID: user03, last 3 digits of mobile phone number: 003, required quantity: 2, random number: 31594772},

[0132] {User ID: user07, last 3 digits of mobile phone number: 007, required quantity: 1, random number: 55699475},

[0133] {User ID: user08, last 3 digits of mobile phone number: 008, required quantity: 1, random number: 21800843},

[0134] {User ID: user09, Last 3 digits of mobile phone number: 009, Required quantity: 1, Random number: 201525433}

[0135] ]

[0136] }.

[0137] The JSON data format after sorting the random numbers from small to large is:

[0138] {

[0139] Supply and demand queue number: 2,

[0140] Supply information: 3 G6 second-class tickets from Shanghai to Beijing at 8:00 am on February 4, 2024.

[0141] Requirements list:

[0142] {User ID: user08, last 3 digits of mobile phone number: 008, required quantity: 1, random number: 21800843},

[0143] {User ID: user03, last 3 digits of mobile phone number: 003, required quantity: 2, random number: 31594772},

[0144] {User ID: user07, last 3 digits of mobile phone number: 007, required quantity: 1, random number: 55699475},

[0145] {User ID: user01, last 3 digits of mobile phone number: 001, required quantity: 2, random number: 70057484},

[0146] {User ID: user09, last 3 digits of mobile phone number: 009, required quantity: 1, random number: 201525433},

[0147] {User ID: user02, Last 3 digits of mobile phone number: 002, Required quantity: 2, Random number: 211710438}

[0148] ]

[0149] }.

[0150] Then, three G6 second-class tickets from Shanghai to Beijing for 8:00 a.m. on February 4, 2024 will be allocated to user08 and user03 who are at the front of the queue.

[0151] The JSON data format for the supply and demand queue number 3 is:

[0152] {

[0153] Supply and demand queue number: 3,

[0154] Supply information: 4 G6 second-class tickets from Nanjing to Jinan at 8:00 am on February 4, 2024.

[0155] Requirements list:

[0156] {User ID: user10, last 3 digits of mobile phone number: 010, required quantity: 2, random number: 70057484},

[0157] {User ID: user11, last 3 digits of mobile phone number: 011, required quantity: 2, random number: 211710438},

[0158] {User ID: user12, last 3 digits of mobile phone number: 012, required quantity: 2, random number: 31594772},

[0159] {User ID: user13, last 3 digits of mobile phone number: 013, required quantity: 2, random number: 55699475},

[0160] {User ID: user14, last 3 digits of mobile phone number: 014, required quantity: 1, random number: 21800843},

[0161] {User ID: user15, last 3 digits of mobile phone number: 015, required quantity: 1, random number: 201525433}

[0162] ]

[0163] }.

[0164] The JSON data format after sorting the random numbers from small to large is:

[0165] {

[0166] Supply and demand queue number: 3,

[0167] Supply information: 4 G6 second-class tickets from Nanjing to Jinan at 8:00 am on February 4, 2024.

[0168] Requirements list:

[0169] {User ID: user14, last 3 digits of mobile phone number: 014, required quantity: 1, random number: 21800843},

[0170] {User ID: user12, last 3 digits of mobile phone number: 012, required quantity: 2, random number: 31594772},

[0171] {User ID: user13, last 3 digits of mobile phone number: 013, required quantity: 2, random number: 55699475},

[0172] {User ID: user10, last 3 digits of mobile phone number: 010, required quantity: 2, random number: 70057484},

[0173] {User ID: user15, last 3 digits of mobile phone number: 015, required quantity: 1, random number: 201525433},

[0174] {User ID: user11, Last 3 digits of mobile phone number: 011, Required quantity: 2, Random number: 211710438}

[0175] ]

[0176] }.

[0177] Then, four G6 second-class tickets for Nanjing to Jinan at 8:00 am on February 4, 2024 are allocated to user14, user12, and user15 at the front of the queue.

[0178] After deleting user03 and user08 assigned to supply and demand queue number 2, the JSON data format of supply and demand queue number 4 is as follows:

[0179] {

[0180] Supply and demand queue number: 4,

[0181] Supply information: 3 G8 second-class tickets from Shanghai to Beijing at 9:00 am on February 4, 2024.

[0182] Requirements list:

[0183] {User ID: user01, last 3 digits of mobile phone number: 001, required quantity: 2, random number: 70057484},

[0184] {User ID: user02, last 3 digits of mobile phone number: 002, required quantity: 2, random number: 211710438},

[0185] {User ID: user07, last 3 digits of mobile phone number: 007, required quantity: 1, random number: 31594772},

[0186] {User ID: user09, last 3 digits of mobile phone number: 009, required quantity: 1, random number: 55699475},

[0187] {User ID: user16, last 3 digits of mobile phone number: 016, required quantity: 1, random number: 21800843},

[0188] {User ID: user17, last 3 digits of mobile phone number: 017, required quantity: 1, random number: 201525433},

[0189] {User ID: user18, last 3 digits of mobile phone number: 018, required quantity: 2, random number: 37419295}

[0190] ]

[0191] }.

[0192] The JSON data format after sorting the random numbers from small to large is:

[0193] {

[0194] Supply and demand queue number: 4,

[0195] Supply information: 3 G8 second-class tickets from Shanghai to Beijing at 9:00 am on February 4, 2024.

[0196] Requirements list:

[0197] {User ID: user16, last 3 digits of mobile phone number: 016, required quantity: 1, random number: 21800843},

[0198] {User ID: user07, last 3 digits of mobile phone number: 007, required quantity: 1, random number: 31594772},

[0199] {User ID: user18, last 3 digits of mobile phone number: 018, required quantity: 2, random number: 37419295},

[0200] {User ID: user09, last 3 digits of mobile phone number: 009, required quantity: 1, random number: 55699475},

[0201] {User ID: user01, last 3 digits of mobile phone number: 001, required quantity: 2, random number: 70057484},

[0202] {User ID: user17, last 3 digits of mobile phone number: 017, required quantity: 1, random number: 201525433},

[0203] {User ID: user02, last 3 digits of mobile phone number: 002, required quantity: 2, random number: 211710438}

[0204] ]

[0205] }.

[0206] Then, three G8 second-class tickets from Shanghai to Beijing for 9:00 a.m. on February 4, 2024 will be allocated to user16, user07, and user09 who are at the front of the queue.

[0207] The 12306 system then notifies consumers user05, user04, user08, user03, user14, user12, user15, user16, user07, and user09 to pay on time within 12 hours, otherwise the ticket resources will be recovered.

[0208] In the fifth step, the 12306 system allocates tickets in the queue allocation time range (8:00 am on January 21, 2024 to 20 minutes before the train departs) according to the queue order of the demand information in the supply and demand queue after random sorting. After deleting the demand information that has been allocated train tickets in the supply and demand queue in step 4, the JSON format data of the supply and demand queue is as follows:

[0209] {

[0210] Supply and demand queue number: 1,

[0211] Supply information: 2 G6 first-class tickets from Shanghai to Beijing at 8:00 am on February 4, 2024.

[0212] Requirements list:

[0213] {User ID: user01, last 3 digits of mobile phone number: 001, required quantity: 2},

[0214] {User ID: user06, last 3 digits of mobile phone number: 006, required quantity: 1},

[0215] {User ID: user02, last 3 digits of mobile phone number: 002, required quantity: 2}

[0216] ]

[0217] },

[0218] {

[0219] Supply and demand queue number: 2,

[0220] Supply information: 3 G6 second-class tickets from Shanghai to Beijing at 8:00 am on February 4, 2024.

[0221] Requirements list:

[0222] {User ID: user01, last 3 digits of mobile phone number: 001, required quantity: 2},

[0223] {User ID: user02, last 3 digits of mobile phone number: 002, required quantity: 2}

[0224] ]

[0225] },

[0226] {

[0227] Supply and demand queue number: 3,

[0228] Supply information: 4 G6 second-class tickets from Nanjing to Jinan at 8:00 am on February 4, 2024.

[0229] Requirements list:

[0230] {User ID: user13, last 3 digits of mobile phone number: 013, required quantity: 2},

[0231] {User ID: user10, last 3 digits of mobile phone number: 010, required quantity: 2},

[0232] {User ID: user11, last 3 digits of mobile phone number: 011, required quantity: 2}

[0233] ]

[0234] },

[0235] {

[0236] Supply and demand queue number: 4,

[0237] Supply information: 3 G8 second-class tickets from Shanghai to Beijing at 9:00 am on February 4, 2024.

[0238] Requirements list:

[0239] {User ID: user18, last 3 digits of mobile phone number: 018, required quantity: 2},

[0240] {User ID: user01, last 3 digits of mobile phone number: 001, required quantity: 2},

[0241] {User ID: user17, last 3 digits of mobile phone number: 017, required quantity: 1},

[0242] {User ID: user02, last 3 digits of mobile phone number: 002, required quantity: 2}

[0243] ]

[0244] }.

[0245] If a new customer wishes to purchase a ticket, they are added to the tail end of the corresponding supply and demand queue. If a ticket refund or a temporary carriage addition occurs during the queue allocation time, the ticket is allocated from the head of the queue according to the queue order. If the number of train tickets in the supply queue exceeds the demand, the customer can complete the ticket purchase process immediately without waiting in line.

[0246] As described in the above specific implementations, this invention addresses the issues of non-disclosure, unreliability, and difficulty in auditing resource allocation supply and demand information by disclosing supply and demand information and storing it on a blockchain. This effectively addresses the issue of collusion between resource allocation system operators and scalpers in the resale of public resources. By increasing the random allocation timeframe and utilizing a public random number service hashing method, this invention eliminates the speed advantage of third-party payment platforms in ticket grabbing and queuing, significantly improving the fairness of ticket purchases. Publicly educated citizens and third-party law enforcement agencies can easily verify and audit the entire ticket purchase process based on publicly available information. By eliminating the ticket grabbing process, this invention significantly reduces the sudden load on the 12306 system, thereby significantly reducing operating costs, improving system stability, and lowering social transaction costs. Train ticket buyers no longer need to schedule extra time for intense ticket grabbing; they can simply rely on luck and queue order to purchase tickets fairly, effectively alleviating consumer anxiety and enhancing a sense of fairness and the purchasing experience.

[0247] The above is only a preferred embodiment of the present invention. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principles of the present invention. These improvements and modifications should also be regarded as within the scope of protection of the present invention.

Claims

1. A resource allocation method, characterized in that, Including: The resource provider submits supply information, where the supply information includes supply time, supply model, supply quantity, randomly assigned time range, common random number service hash assignment method, queuing assignment time range; The resource consumer submits demand information, where the demand information includes demand time range, demand model range, demand quantity; The resource allocation system generates a supply-demand queue, a set of supply-demand queues, and blockchain deposit information based on the information submitted by the provider and the consumer, and discloses the supply-demand queue, the set of supply-demand queues, and the blockchain deposit information; The resource allocation system performs random allocation within the randomly assigned time range using the common random number service hash assignment method based on the supply-demand queue and the set of supply-demand queues; The resource allocation system performs allocation in the queuing assignment time range according to the queuing order of the demand information in the supply-demand queue.

2. The method according to claim 1, characterized in that The supply-demand queue refers to an ordered queue composed of all demand information that matches the preset supply time and supply model, and the set of supply-demand queues refers to a set composed of supply-demand queues.

3. The method according to claim 1, wherein The common random number service hash assignment method includes: specifying a set of common random number service time points to be used within the randomly assigned time range and a random number hash cyclic skip code table, reordering the demand information in the supply-demand queue according to the random seed generated by the common random number service at the specified time point and the random number hash cyclic skip code table, and performing resource allocation according to the set of supply-demand queues and the queuing order of the demand information in the re-ordered supply-demand queue.

4. The method according to claim 1, wherein The method for generating the blockchain deposit information includes: first calculating the information digest of each supply-demand queue in the set of supply-demand queues respectively, then calculating the information digest S2 of the file composed of the above one or more information digests, and sending the information digest S2 to the blockchain deposit node for deposit.

5. The method according to claim 3, wherein The random number hash cyclic skip code table is a data structure formed by randomly hashing a set of integers within a continuous range and connecting the head and tail.

Images