miden_objects/constants.rs
1/// Depth of the account database tree.
2pub const ACCOUNT_TREE_DEPTH: u8 = 64;
3
4/// The maximum allowed size of an account update is 32 KiB.
5pub const ACCOUNT_UPDATE_MAX_SIZE: u16 = 2u16.pow(15);
6
7/// The maximum number of assets that can be stored in a single note.
8pub const MAX_ASSETS_PER_NOTE: usize = 255;
9
10/// The maximum number of inputs that can accompany a single note.
11///
12/// The value is set to 128 so that it can be represented using as a single byte while being
13/// evenly divisible by 8.
14pub const MAX_INPUTS_PER_NOTE: usize = 128;
15
16/// The maximum number of notes that can be consumed by a single transaction.
17pub const MAX_INPUT_NOTES_PER_TX: usize = 1024;
18
19/// The maximum number of new notes created by a single transaction.
20pub const MAX_OUTPUT_NOTES_PER_TX: usize = MAX_INPUT_NOTES_PER_TX;
21
22/// The minimum proof security level used by the Miden prover & verifier.
23pub const MIN_PROOF_SECURITY_LEVEL: u32 = 96;
24
25/// The maximum number of VM cycles a transaction is allowed to take.
26pub const MAX_TX_EXECUTION_CYCLES: u32 = 1 << 30;
27
28/// The minimum number of VM cycles a transaction needs to execute.
29pub const MIN_TX_EXECUTION_CYCLES: u32 = 1 << 12;
30
31/// Maximum number of the foreign accounts that can be loaded.
32pub const MAX_NUM_FOREIGN_ACCOUNTS: u8 = 64;
33
34// TRANSACTION BATCH
35// ================================================================================================
36
37/// The depth of the Sparse Merkle Tree used to store output notes in a single batch.
38pub const BATCH_NOTE_TREE_DEPTH: u8 = 10;
39
40/// The maximum number of notes that can be created in a single batch.
41pub const MAX_OUTPUT_NOTES_PER_BATCH: usize = 1 << BATCH_NOTE_TREE_DEPTH;
42const _: () = assert!(MAX_OUTPUT_NOTES_PER_BATCH >= MAX_OUTPUT_NOTES_PER_TX);
43
44/// The maximum number of input notes that can be consumed in a single batch.
45pub const MAX_INPUT_NOTES_PER_BATCH: usize = MAX_OUTPUT_NOTES_PER_BATCH;
46const _: () = assert!(MAX_INPUT_NOTES_PER_BATCH >= MAX_INPUT_NOTES_PER_TX);
47
48/// The maximum number of accounts that can be updated in a single batch.
49pub const MAX_ACCOUNTS_PER_BATCH: usize = 1024;
50
51// BLOCK
52// ================================================================================================
53
54/// The final depth of the Sparse Merkle Tree used to store all notes created in a block.
55pub const BLOCK_NOTE_TREE_DEPTH: u8 = 16;
56
57/// Maximum number of batches that can be inserted into a single block.
58pub const MAX_BATCHES_PER_BLOCK: usize = 1 << (BLOCK_NOTE_TREE_DEPTH - BATCH_NOTE_TREE_DEPTH);
59
60/// Maximum number of output notes that can be created in a single block.
61pub const MAX_OUTPUT_NOTES_PER_BLOCK: usize = MAX_OUTPUT_NOTES_PER_BATCH * MAX_BATCHES_PER_BLOCK;
62const _: () = assert!(MAX_OUTPUT_NOTES_PER_BLOCK >= MAX_OUTPUT_NOTES_PER_BATCH);
63
64/// Maximum number of input notes that can be consumed in a single block.
65pub const MAX_INPUT_NOTES_PER_BLOCK: usize = MAX_OUTPUT_NOTES_PER_BLOCK;
66
67/// The maximum number of accounts that can be updated in a single block.
68pub const MAX_ACCOUNTS_PER_BLOCK: usize = MAX_ACCOUNTS_PER_BATCH * MAX_BATCHES_PER_BLOCK;
69const _: () = assert!(MAX_ACCOUNTS_PER_BLOCK >= MAX_ACCOUNTS_PER_BATCH);
70const _: () = assert!(MAX_ACCOUNTS_PER_BLOCK >= MAX_BATCHES_PER_BLOCK);