# US 2025/0095454 A1 · Electronic depleting pool lottery

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2025/0095454 A1
- Document ID: US20250095454A1
- Status: Published application
- Kind: A1
- Application number: 18/965,359
- Filed: 2024-12-02
- Published: 2025-03-20
- Earliest claimed: 2020-04-09
- Assignees: Oy Veikkaus Ab
- Applicants: Veikkaus Oy
- Inventors: Markku AALTO
- Web page: https://patentgrep.com/patent/US20250095454A1

## CPC

- G07F 17/326: {Game play aspects of gaming systems}
- G07F 17/329: {Regular and instant lottery, e.g. electronic scratch cards}
- G06F 7/582: {Pseudo-random number generators}
- G07F 17/3244: {Payment aspects of a gaming system, e.g. payment schemes, setting payout ratio, bonus or consolation prizes}
- G07F: COIN-FREED OR LIKE APPARATUS (coin sorting G07D3/00; coin testing G07D5/00; {handling coins or paper currencies apart from payment activated apparatus G07D; payment architectures, schemes or protocols G06Q20/00})
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

An electronic depleting pool lottery solution, in which there is, for a set of lottery tickets, at least a record that comprises at least an identifier of the set, prize distribution information and permutation information. When a lottery ticket is bought, an initial index value is assigned, and one or more permutations are performed to the initial index value, the result being a final index value. The prize of the lottery ticket is determined using the final index value and the prize distribution information.

## Claims

### Claim 1

A computer-implemented method for running an electronic depleting pool lottery based game, the method comprising:
storing in a memory of a game management computing system, for a set of lottery tickets usable in the game, a record comprising at least an identifier of the set, prize distribution information, and permutation information, the set having a lifetime associated therewith;
in response to receiving from an apparatus different from the game management computing system information that a lottery ticket is acquired, assigning via a processor of the game management computing system and using the permutation information, an initial index value to the lottery ticket, the initial index value being an unused index value within an index space, the index space being based on a size of the set;
sending, from the game management computing system to a trusted party computing system, different from the game management computing system, an identifier of a lottery set, a size of a lottery set and an index value, to obtain a final index value by the index value sent undergoing in the trusted party computing system one or more permutations resulting to the final index value within the index space, wherein the index value sent is based on the initial index value assigned;
receiving in the game management computing system from the trusted party equipment the final index value;
mapping, by the processor of the game management computing system, a prize to the lottery ticket using the final index value and the prize distribution information; and
sending, to the apparatus, from the game management computing system, information on the mapped prize.

### Claim 2 (depends on 1)

The computer-implemented method of claim 1, wherein the permutation information comprises a list of initial index values in a random order, and the assigning of the initial index value includes selecting an index value from the list, and the index value sent is the initial index value assigned.

### Claim 3 (depends on 1)

The computer-implemented method of claim 1, wherein the permutation information comprises at least the size of the set a running number and a set-specific permutation key, and the method further comprises:
performing the assigning by setting the initial index value to be the running number;
increasing the running number by one in the record; and
performing, by the processor of the game management computing system, one or more pseudorandom permutations using the set-specific permutation key and the size to the initial index to generate, from the initial index, the index value that is sent, wherein.

### Claim 4 (depends on 1)

The computer-implemented method of claim 1, wherein the permutation information comprises at least the size of the set and a running number, and the method further comprises:
calculating, via the processor of the game management computing system, a set-specific permutation key using the identifier and a secret global permutation key stored to the memory of the game management computing system;
performing the assigning by setting the initial index value to be the running number;
increasing the running number by one in the record; and
performing, by the processor of the game management computing system, one or more pseudorandom permutations using the set-specific permutation key and the size to the initial index to generate, from the initial index, the index value that is sent.

### Claim 5 (depends on 1)

The computer-implemented method of claim 1, wherein at least one of the one or more permutations is a pseudorandom permutation.

### Claim 6 (depends on 5)

The computer-implemented method of claim 5, wherein performing a pseudorandom permutation to an index value includes:
comparing a result of the pseudorandom permutation to the size; and
re-performing the pseudorandom permutation until the result represents a resulting index value that is smaller than or equal to the size.

### Claim 7 (depends on 1)

The computer-implemented method of claim 1, the method further comprising:
in response to receiving information at least indicating the size of the set and the prize distribution information, creating, by the processor of the game management computing system, the record, wherein the creating comprises at least:
determining the identifier;
determining the index space;
determining a prize tier table using the prize distribution information and the index space;
determining the permutation information; and
performing the storing.

### Claim 8

A computer-implemented method for an electronic depleting pool lottery based game, the method comprising:
storing in a memory of a trusted party computing system at least a secret global permutation key for a game management computing system, different from the trusted party computing system, the game management computing system running the game;
receiving, in the trusted party computing system from the game management computing system, an identifier of a lottery set, a size of a lottery set and an index value;
calculating, by a processor of the trusted party computing system, a set-specific permutation key using the identifier and the secret global permutation key;
performing, by the processor of the trusted party computing system, and using the set-specific key and the size, one or more pseudorandom permutations to the index value received to generate, from the index value received a final index value; and
sending, from the trusted party computing system to the game management computing system, the final index value.

### Claim 9 (depends on 8)

The computer-implemented method of claim 8, wherein performing a pseudorandom permutation to an index value includes:
comparing a result of the pseudorandom permutation to the size; and
re-performing the pseudorandom permutation until the result represents a resulting index value that is smaller than or equal to the size.

### Claim 10

An apparatus for a game management computing system running an electronic depleting pool lottery based game, the apparatus comprising:
at least one processor; and
at least one memory including computer program code,
wherein the at least one memory and the computer program code are configured to, with the at least one processor cause the apparatus to perform at least:
storing, in at least one of the at least one memory, for a set of lottery tickets usable in the game, a record comprising at least an identifier of the set, prize distribution information and permutation information, the set having a lifetime associated therewith;
in response to receiving from a device different from the apparatus information that a lottery ticket is acquired, assigning via using the permutation information, an initial index value to the lottery ticket, the initial index value being an unused index value within an index space, the index space being based on a size of the set;
sending, from the apparatus to a trusted party computing system, different from the game management computing system, an identifier of a lottery set, a size of a lottery set and an index value to obtain a final index value by the index value sent undergoing in the trusted party computing system one or more permutations resulting to the final index value within the index space, wherein the index value sent is based on the initial index value assigned;
receiving, in the apparatus from the trusted party equipment, the final index value;
mapping a prize to the lottery ticket using the final index value and the prize distribution information; and
sending, from the apparatus to the device, information on the mapped prize.

### Claim 11 (depends on 10)

The apparatus of claim 10, wherein the permutation information comprises a list of initial index values in a random order and the at least one processor and the at least one memory storing instructions, when executed by the at least one processor, further cause the apparatus to perform the assigning of the initial index value by selecting an index value from the list, and sending the initial index value assigned as the index value to the trusted party computing system.

### Claim 12 (depends on 10)

The apparatus of claim 10, wherein the permutation information comprises at least the size of the set, a running number and a set-specific permutation key and the at least one processor and the at least one memory storing instructions, when executed by the at least one processor, further cause the apparatus to perform at least:
performing the assigning by setting the initial index value to be the running number;
increasing the running number by one in the record; and
performing one or more pseudorandom permutations using the set-specific permutation key and the size to the initial index to generate, from the initial index, the index value that is sent to the trusted party computing system.

### Claim 13 (depends on 10)

The apparatus of claim 10, wherein the permutation information comprises at least the size of the set and a running number and the at least one processor and the at least one memory storing instructions, when executed by the at least one processor, further cause the apparatus to perform at least:
calculating a set-specific permutation key using the identifier and a secret global permutation key stored to at least one of the at least one memory;
performing the assigning by setting the initial index value to be the running number;
increasing the running number by one in the record; and
performing, using the set-specific permutation key and the size, one or more pseudorandom permutations to the initial index to generate, from the initial index, the index value that is sent to the trusted party computing system.

### Claim 14 (depends on 10)

The apparatus of claim 10, wherein at least one of the one or more permutations is a pseudorandom permutation and performing a pseudorandom permutation to an index value includes:
comparing a result of the pseudorandom permutation to the size; and
re-performing the pseudorandom permutation until the result represents a resulting index value that is smaller than or equal to the size.

### Claim 15 (depends on 10)

The apparatus of claim 10, wherein the at least one processor and the at least one memory storing instructions, when executed by the at least one processor, further cause the apparatus to perform at least:
in response to receiving information at least indicating the size of the set and the prize distribution information, creating, by the processor of the game management computing system, the record, wherein the creating comprises at least:
determining the identifier;
determining the index space;
determining a prize tier table using the prize distribution information and the index space;
determining the permutation information; and
performing the storing.

### Claim 16

A system for an electronic depleting pool lottery based game, the system comprising at least game management computing equipment for running the electronic depleting pool lottery based game and trusted party computing equipment, different from the game management computing equipment,
wherein the game management computing equipment is configured at least to perform:
storing in a memory of the game management computing equipment, for a set of lottery tickets, a record comprising at least an identifier of the set, prize distribution information and permutation information the set having a lifetime associated therewith;
in response to receiving from a terminal device information that a lottery ticket is acquired, assigning via using the permutation information, an initial index value to the lottery ticket, the initial index value being an unused index value within an index space, the index base being based on a size of the set;
sending to the trusted party computing equipment, an identifier of a lottery set, a size of a lottery set and an index value to the trusted party computing equipment to obtain a final index value within the index space, wherein the index value sent is based on the initial index value assigned;
receiving from the trusted party computing equipment the final index value;
mapping a prize to the lottery ticket using the final index value and the prize distribution information; and
sending to the terminal device information on the mapped prize,
wherein the trusted party computing equipment is configured at least to perform:
storing in a memory of the trusted party computing equipment at least a secret global permutation key;
receiving from the game management computing equipment an identifier of a lottery set, a size of a lottery set and an index value;
calculating a set-specific permutation key using the identifier and the secret global permutation key;
performing to the index value received one or more pseudorandom permutations by using the set-specific key and the size to generate, from the index value received, a final index value; and
causing sending to the game management computing equipment the final index value.

### Claim 17 (depends on 16)

The system of claim 16, wherein the permutation information comprises a list of initial index values in a random order and the game management computing equipment is further configured to assign the initial index value by selecting an index value from the list, and to send, to the trusted party computing equipment, the initial index value assigned as the index value.

### Claim 18 (depends on 16)

The system of claim 16, wherein the permutation information comprises at least the size of the set, a running number and a set-specific permutation key, and the game management computing equipment is further configured to at least:
assign the initial index value by setting the initial index value to be the running number;
increase the running number by one in the record; and
perform one or more pseudorandom permutations using the set-specific permutation key and the size to the initial index to generate, from the initial index, the index value that is sent to the trusted party computing equipment.

### Claim 19 (depends on 16)

The system of claim 16, wherein the permutation information comprises at least the size of the set and a running number, and the game management computing equipment is further configured to at least:
calculate a set-specific permutation key using the identifier and a secret global permutation key stored to at least one of the at least one memory;
assign the initial index value by setting the initial index value to be the running number;
increase the running number by one in the record; and
perform, using the set-specific permutation key and the size, one or more pseudorandom permutations to the initial index to generate, from the initial index, the index value that is sent to the trusted party computing equipment.
