over budget
UTXO Optimizer and Scheduler
Current Project Status
Unfunded
Amount
Received
$0
Amount
Requested
$3,854
Percentage
Received
0.00%
Solution

I propose creating a math model and script that developers could use to structure their transactions to minimize the number of transactions and maximize the potential power of transactions.

Problem

Concurrency with UTXOs is a tricky problem that is difficult to solve and adds to transaction load unnecessarily.

Impact / Alignment
Feasibility
Auditability

Team

1 member

close

Playlist

  • EP2: epoch_length

    Authored by: Darlington Kofa

    3m 24s
    Darlington Kofa
  • EP1: 'd' parameter

    Authored by: Darlington Kofa

    4m 3s
    Darlington Kofa
  • EP3: key_deposit

    Authored by: Darlington Kofa

    3m 48s
    Darlington Kofa
  • EP4: epoch_no

    Authored by: Darlington Kofa

    2m 16s
    Darlington Kofa
  • EP5: max_block_size

    Authored by: Darlington Kofa

    3m 14s
    Darlington Kofa
  • EP6: pool_deposit

    Authored by: Darlington Kofa

    3m 19s
    Darlington Kofa
  • EP7: max_tx_size

    Authored by: Darlington Kofa

    4m 59s
    Darlington Kofa
0:00
/
~0:00