# US 2019/0318349 A1 · Method for controlling a smart contract in a network implementing a distributed ledger

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

- Number: US 2019/0318349 A1
- Document ID: US20190318349A1
- Status: Published application
- Kind: A1
- Application number: 16/382,941
- Filed: 2019-04-12
- Published: 2019-10-17
- Earliest claimed: 2018-04-12
- Assignees: Jur AG
- Applicants: Jur AG
- Inventors: Alessandro PALOMBO; Giotto DE FILIPPI; Pietro BONOMO
- Web page: https://patentgrep.com/patent/US20190318349A1

## CPC

- G06Q 20/389: {Keeping log of transactions for guaranteeing non-repudiation of a transaction}
- G06Q 40/02: Banking, e.g. interest calculation or account maintenance (credit or loans G06Q40/03)
- G06Q 20/085: {involving remote charge determination or related payment systems}
- G06Q 20/223: {based on the use of peer-to-peer networks}
- G06Q 20/3674: {involving authentication}
- G06Q 20/38215: {Use of certificates or encrypted proofs of transaction rights}
- G06Q 20/405: {Establishing or using transaction specific rules}
- H04L 9/0894: {Escrow, recovery or storing of secret information, e.g. secret key escrow or cryptographic key storage}
- H04L 9/3236: {using cryptographic hash functions}
- H04L 9/50: {using hash chains, e.g. blockchains or hash trees}
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A method for controlling a smart contract in a network implements a distributed ledger. The network includes a plurality of transaction addresses and a plurality of voting addresses. The method includes defining details of a smart contract. The details include at least an escrow amount and conditions for dispersing the escrow amount. The method also includes accepting the details of the smart contract and evaluating fulfillment of the conditions. Based on the result of the evaluating step, the method disperses the escrow amount or enters a dispute resolution step.

## Claims

### Claim 1

A method (3000) for controlling a smart contract (4000) in a network (2000) implementing a distributed ledger, the network (2000) comprising a plurality of transaction addresses (1101-1103) and a plurality of voting addresses (2301-2303), the method (3000) comprising the steps of:
defining (S3100) details (4500, 4600, 4700) of a smart contract (4000), wherein the details (4500, 4600, 4700) comprise at least an escrow amount (4700) and conditions (4500) for dispersing the escrow amount (4700),
accepting (S3200) the details (4500, 4600, 4700) of the smart contract (4000),
evaluating (S3300) fulfillment of the conditions (4500),
based on the result of the evaluating step (S3300) dispersing the escrow amount (S3400) or entering a dispute resolution step (S3500).

### Claim 2 (depends on 1)

The method (3000) according to claim 1, wherein the dispute resolution step (S3500) comprises:
a first step of amending (S3510), by a first transaction address (1101-1103), at least part of the details (4500, 4600, 4700),
a first step of evaluating (S3520) by a second transaction address (1101-1103), the details amended in the first amending step (S3510).

### Claim 3 (depends on 2)

The method (3000) according to claim 2, wherein the dispute resolution step (S3500) comprises:
a second step of amending (S3530), by the second transaction address (1101-1103), at least part of the details (4500, 4600, 4700),
a second step of evaluating (S3540) by the first transaction address (1101-1103), the details amended in the second amending step (S3530).

### Claim 4 (depends on 1)

The method (3000) according to claim 1, wherein the dispute resolution step (S3550) comprises a network-based resolution step (S3550) comprising the steps of:
voting (S3551) by one or more voting addresses (2301-2303), wherein voting comprises associating one or more voting tokens to one among a plurality of options,
ending (S3552) the voting step, when a predetermined amount of time has elapsed or when one of the plurality of options reaches a predetermined voting ratio, thereby resulting in a voted option and one or more non-voted options,
transferring (S3553) voting tokens associated to the one or more non-voted options to the voting addresses (2301-2303) whose voting tokens are associated to the voted option.

### Claim 5 (depends on 4)

The method (3000) according to claim 4, wherein
a first voting address (2301) and a second voting address (2302) have associated voting rights to the voted option, and
the first voting address (2301) carried out the voting step (S3551) before the second voting address (2302),
the transferring (S3553) step is based on a transferring function (F1) which comprises a monotonically decreasing function for transferring the voting tokens, associated to the one or more non-voted options, to the first voting address (2301) and to the second voting address (2302), such that for each voting token associated to the voted option, the first voting address (2301) receives more voting tokens than the second voting address (2302).

### Claim 6 (depends on 4)

The method (3000) according to claim 4, wherein
a first voting address (2301) and a second voting address (2302) have associated voting rights to the voted option, and
the first voting address (2301) associated more voting rights to the voted option than the second voting address (2302),
the transferring (S3553) step is based on a transferring function (F1) which comprises a monotonically decreasing function for transferring the voting tokens, associated to the one or more non-voted options, to the first voting address (2301) and to the second voting address (2302), such that for each voting token associated to the voted option, the first voting address (2301) receives less voting tokens than the second voting address (2302).

### Claim 7 (depends on 4)

The method (3000) according to claim 4, wherein
the transferring (S3553) step is based on a transferring function (F1) which, for a first voting address (2301-2303) is defined as:
If
user_start_votes_majority+user_votes_majority<=sum_votes_best_minority+C2
then the first voting address (2301-2303) receives
user_votes_majority*reward_multiplier,
If
user_start_votes_majority>=sum_votes_best_minority+C3
then the first voting address (2301-2303) receives no voting tokens,
If
user_start_votes_majority<sum_votes_best_minority+C4
and
user_start_votes_majority+user_votes_majority>=sum_votes_best_minority+C5
then
the first voting address (2301-2303) receives
(sum_votes_best_minority+C6)−user_start_votes_majority)*reward_multiplier,
wherein
majority_option is a variable defined as the voted option,
minority_option_best is a variable defined as a non-voted option that received the second most voting tokens,
sum_votes_all_minority is a variable defined as sum of all voting tokens associated to all non-voted options,
sum_votes_best_minority is a variable defined as sum of all voting tokens associated to minority_option_best,
sum_votes_majority is a variable defined as sum of all voting tokens associated to majority_option,
reward_multiplier is a variable defined as (sum_votes_all_minority)/(sum_votes_best_minority+C1),
user_start_votes_majority is a variable defined as sum of all voting tokens associated to the majority_option before the first voting address (2301) associated its voting tokens,
user_votes_majority is a variable defined as votes associated to the majority_option by the first voting address (2301),
any of C1, C2, C3, C4, C5, C6 is a predetermined value which may be preferably set to be higher than 0, even more preferably at a value of 0.1.

### Claim 8 (depends on 4)

The method (3000) according to claim 4, wherein
voting addresses (2301-2303 can carry out the voting step (S3551) only if an amount of voting tokens they intend to associate is above a predetermined threshold.
