@aztec/ethereum 3.0.0-rc.5 → 4.0.0-nightly.20260107

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (84) hide show
  1. package/dest/client.js +6 -2
  2. package/dest/config.d.ts +4 -1
  3. package/dest/config.d.ts.map +1 -1
  4. package/dest/config.js +6 -0
  5. package/dest/contracts/empire_base.d.ts +2 -1
  6. package/dest/contracts/empire_base.d.ts.map +1 -1
  7. package/dest/contracts/empire_slashing_proposer.d.ts +2 -1
  8. package/dest/contracts/empire_slashing_proposer.d.ts.map +1 -1
  9. package/dest/contracts/empire_slashing_proposer.js +9 -0
  10. package/dest/contracts/governance_proposer.d.ts +2 -1
  11. package/dest/contracts/governance_proposer.d.ts.map +1 -1
  12. package/dest/contracts/governance_proposer.js +391 -8
  13. package/dest/contracts/inbox.d.ts +5 -1
  14. package/dest/contracts/inbox.d.ts.map +1 -1
  15. package/dest/contracts/inbox.js +4 -0
  16. package/dest/contracts/rollup.d.ts +125 -73
  17. package/dest/contracts/rollup.d.ts.map +1 -1
  18. package/dest/contracts/rollup.js +614 -125
  19. package/dest/deploy_aztec_l1_contracts.d.ts +3 -1
  20. package/dest/deploy_aztec_l1_contracts.d.ts.map +1 -1
  21. package/dest/deploy_aztec_l1_contracts.js +7 -2
  22. package/dest/l1_artifacts.d.ts +3370 -104
  23. package/dest/l1_artifacts.d.ts.map +1 -1
  24. package/dest/l1_contract_addresses.d.ts +1 -1
  25. package/dest/l1_contract_addresses.d.ts.map +1 -1
  26. package/dest/l1_contract_addresses.js +3 -3
  27. package/dest/l1_tx_utils/constants.d.ts +7 -1
  28. package/dest/l1_tx_utils/constants.d.ts.map +1 -1
  29. package/dest/l1_tx_utils/constants.js +25 -0
  30. package/dest/l1_tx_utils/fee-strategies/index.d.ts +10 -0
  31. package/dest/l1_tx_utils/fee-strategies/index.d.ts.map +1 -0
  32. package/dest/l1_tx_utils/fee-strategies/index.js +12 -0
  33. package/dest/l1_tx_utils/fee-strategies/p75_competitive.d.ts +8 -0
  34. package/dest/l1_tx_utils/fee-strategies/p75_competitive.d.ts.map +1 -0
  35. package/dest/l1_tx_utils/fee-strategies/p75_competitive.js +129 -0
  36. package/dest/l1_tx_utils/fee-strategies/p75_competitive_blob_txs_only.d.ts +23 -0
  37. package/dest/l1_tx_utils/fee-strategies/p75_competitive_blob_txs_only.d.ts.map +1 -0
  38. package/dest/l1_tx_utils/fee-strategies/p75_competitive_blob_txs_only.js +191 -0
  39. package/dest/l1_tx_utils/fee-strategies/types.d.ts +51 -0
  40. package/dest/l1_tx_utils/fee-strategies/types.d.ts.map +1 -0
  41. package/dest/l1_tx_utils/fee-strategies/types.js +3 -0
  42. package/dest/l1_tx_utils/index.d.ts +3 -1
  43. package/dest/l1_tx_utils/index.d.ts.map +1 -1
  44. package/dest/l1_tx_utils/index.js +2 -0
  45. package/dest/l1_tx_utils/l1_fee_analyzer.d.ts +233 -0
  46. package/dest/l1_tx_utils/l1_fee_analyzer.d.ts.map +1 -0
  47. package/dest/l1_tx_utils/l1_fee_analyzer.js +506 -0
  48. package/dest/l1_tx_utils/readonly_l1_tx_utils.d.ts +4 -15
  49. package/dest/l1_tx_utils/readonly_l1_tx_utils.d.ts.map +1 -1
  50. package/dest/l1_tx_utils/readonly_l1_tx_utils.js +34 -142
  51. package/dest/queries.d.ts +1 -1
  52. package/dest/queries.d.ts.map +1 -1
  53. package/dest/queries.js +8 -3
  54. package/dest/test/chain_monitor.js +1 -2
  55. package/dest/test/eth_cheat_codes.js +3 -1
  56. package/dest/test/rollup_cheat_codes.js +3 -1
  57. package/dest/test/tx_delayer.js +1 -1
  58. package/dest/utils.d.ts +14 -2
  59. package/dest/utils.d.ts.map +1 -1
  60. package/dest/utils.js +18 -0
  61. package/package.json +6 -5
  62. package/src/client.ts +2 -2
  63. package/src/config.ts +8 -0
  64. package/src/contracts/empire_base.ts +1 -1
  65. package/src/contracts/empire_slashing_proposer.ts +6 -1
  66. package/src/contracts/governance_proposer.ts +6 -1
  67. package/src/contracts/inbox.ts +5 -0
  68. package/src/contracts/rollup.ts +252 -84
  69. package/src/deploy_aztec_l1_contracts.ts +12 -2
  70. package/src/l1_contract_addresses.ts +22 -20
  71. package/src/l1_tx_utils/constants.ts +11 -0
  72. package/src/l1_tx_utils/fee-strategies/index.ts +22 -0
  73. package/src/l1_tx_utils/fee-strategies/p75_competitive.ts +163 -0
  74. package/src/l1_tx_utils/fee-strategies/p75_competitive_blob_txs_only.ts +245 -0
  75. package/src/l1_tx_utils/fee-strategies/types.ts +56 -0
  76. package/src/l1_tx_utils/index.ts +2 -0
  77. package/src/l1_tx_utils/l1_fee_analyzer.ts +803 -0
  78. package/src/l1_tx_utils/readonly_l1_tx_utils.ts +46 -184
  79. package/src/queries.ts +8 -2
  80. package/src/test/chain_monitor.ts +1 -1
  81. package/src/test/eth_cheat_codes.ts +1 -1
  82. package/src/test/rollup_cheat_codes.ts +1 -1
  83. package/src/test/tx_delayer.ts +1 -1
  84. package/src/utils.ts +29 -0
@@ -0,0 +1,129 @@
1
+ import { median } from '@aztec/foundation/collection';
2
+ import { formatGwei } from 'viem';
3
+ import { calculatePercentile } from '../../utils.js';
4
+ import { WEI_CONST } from '../constants.js';
5
+ import { HISTORICAL_BLOCK_COUNT } from './types.js';
6
+ /**
7
+ * Our current competitive priority fee strategy.
8
+ * Analyzes p75 of pending transactions and 5-block fee history to determine a competitive priority fee.
9
+ * Falls back to network estimate if data is unavailable.
10
+ */ export const P75AllTxsPriorityFeeStrategy = {
11
+ name: 'Competitive (P75 + History) - CURRENT',
12
+ id: 'p75_pending_txs_and_history_all_txs',
13
+ async execute (client, context) {
14
+ const { isBlobTx, logger } = context;
15
+ // Fire all RPC calls in parallel
16
+ const [latestBlockResult, blobBaseFeeResult, networkEstimateResult, pendingBlockResult, feeHistoryResult] = await Promise.allSettled([
17
+ client.getBlock({
18
+ blockTag: 'latest'
19
+ }),
20
+ isBlobTx ? client.getBlobBaseFee() : Promise.resolve(undefined),
21
+ client.estimateMaxPriorityFeePerGas().catch(()=>0n),
22
+ client.getBlock({
23
+ blockTag: 'pending',
24
+ includeTransactions: true
25
+ }).catch(()=>null),
26
+ client.getFeeHistory({
27
+ blockCount: HISTORICAL_BLOCK_COUNT,
28
+ rewardPercentiles: [
29
+ 75
30
+ ],
31
+ blockTag: 'latest'
32
+ }).catch(()=>null)
33
+ ]);
34
+ // Extract latest block
35
+ if (latestBlockResult.status === 'rejected') {
36
+ throw new Error(`Failed to get latest block: ${latestBlockResult.reason}`);
37
+ }
38
+ const latestBlock = latestBlockResult.value;
39
+ // Extract blob base fee (only for blob txs)
40
+ let blobBaseFee;
41
+ if (isBlobTx) {
42
+ if (blobBaseFeeResult.status === 'fulfilled' && typeof blobBaseFeeResult.value === 'bigint') {
43
+ blobBaseFee = blobBaseFeeResult.value;
44
+ } else {
45
+ logger?.warn('Failed to get L1 blob base fee');
46
+ }
47
+ }
48
+ // Extract network estimate
49
+ const networkEstimate = networkEstimateResult.status === 'fulfilled' && typeof networkEstimateResult.value === 'bigint' ? networkEstimateResult.value : 0n;
50
+ let competitiveFee = networkEstimate;
51
+ const debugInfo = {
52
+ networkEstimateGwei: formatGwei(networkEstimate)
53
+ };
54
+ // Extract pending block
55
+ const pendingBlock = pendingBlockResult.status === 'fulfilled' ? pendingBlockResult.value : null;
56
+ // Analyze pending block transactions
57
+ if (pendingBlock?.transactions && pendingBlock.transactions.length > 0) {
58
+ const pendingFees = pendingBlock.transactions.map((tx)=>{
59
+ if (typeof tx === 'string') {
60
+ return 0n;
61
+ }
62
+ return tx.maxPriorityFeePerGas || 0n;
63
+ }).filter((fee)=>fee > 0n);
64
+ if (pendingFees.length > 0) {
65
+ // Use 75th percentile of pending fees to be competitive
66
+ const pendingCompetitiveFee = calculatePercentile(pendingFees, 75);
67
+ if (pendingCompetitiveFee > competitiveFee) {
68
+ competitiveFee = pendingCompetitiveFee;
69
+ }
70
+ debugInfo.pendingTxCount = pendingFees.length;
71
+ debugInfo.pendingP75Gwei = formatGwei(pendingCompetitiveFee);
72
+ logger?.debug('Analyzed pending transactions for competitive pricing', {
73
+ pendingTxCount: pendingFees.length,
74
+ pendingP75: formatGwei(pendingCompetitiveFee)
75
+ });
76
+ }
77
+ }
78
+ // Extract fee history
79
+ const feeHistory = feeHistoryResult.status === 'fulfilled' ? feeHistoryResult.value : null;
80
+ // Analyze fee history
81
+ if (feeHistory?.reward && feeHistory.reward.length > 0) {
82
+ // Extract 75th percentile fees from each block
83
+ const percentile75Fees = feeHistory.reward.map((rewards)=>rewards[0] || 0n).filter((fee)=>fee > 0n);
84
+ if (percentile75Fees.length > 0) {
85
+ // Calculate median of the 75th percentile fees across blocks
86
+ const medianHistoricalFee = median(percentile75Fees) ?? 0n;
87
+ // Debug: Log suspicious fees from history
88
+ if (medianHistoricalFee > 100n * WEI_CONST) {
89
+ logger?.warn('Suspicious high fee in history', {
90
+ historicalMedian: formatGwei(medianHistoricalFee),
91
+ allP75Fees: percentile75Fees.map((f)=>formatGwei(f))
92
+ });
93
+ }
94
+ if (medianHistoricalFee > competitiveFee) {
95
+ competitiveFee = medianHistoricalFee;
96
+ }
97
+ debugInfo.historicalMedianGwei = formatGwei(medianHistoricalFee);
98
+ logger?.debug('Analyzed fee history for competitive pricing', {
99
+ historicalMedian: formatGwei(medianHistoricalFee)
100
+ });
101
+ }
102
+ }
103
+ // Sanity check: cap competitive fee at 100x network estimate to avoid using unrealistic fees
104
+ const maxReasonableFee = networkEstimate * 100n;
105
+ if (competitiveFee > maxReasonableFee && networkEstimate > 0n) {
106
+ logger?.warn('Competitive fee exceeds sanity cap, using capped value', {
107
+ competitiveFee: formatGwei(competitiveFee),
108
+ networkEstimate: formatGwei(networkEstimate),
109
+ cappedTo: formatGwei(maxReasonableFee)
110
+ });
111
+ competitiveFee = maxReasonableFee;
112
+ debugInfo.cappedToGwei = formatGwei(maxReasonableFee);
113
+ }
114
+ // Log final decision
115
+ if (competitiveFee > networkEstimate) {
116
+ logger?.debug('Using competitive fee from market analysis', {
117
+ networkEstimate: formatGwei(networkEstimate),
118
+ competitive: formatGwei(competitiveFee)
119
+ });
120
+ }
121
+ debugInfo.finalFeeGwei = formatGwei(competitiveFee);
122
+ return {
123
+ priorityFee: competitiveFee,
124
+ latestBlock,
125
+ blobBaseFee,
126
+ debugInfo
127
+ };
128
+ }
129
+ };
@@ -0,0 +1,23 @@
1
+ import { type GetFeeHistoryReturnType } from 'viem';
2
+ import type { ViemClient } from '../../types.js';
3
+ import { type PriorityFeeStrategy } from './types.js';
4
+ /**
5
+ * Fetches historical blocks and calculates reward percentiles for blob transactions only.
6
+ * Returns data in the same format as getFeeHistory for easy drop-in replacement.
7
+ *
8
+ * @param client - Viem client to use for RPC calls
9
+ * @param blockCount - Number of historical blocks to fetch
10
+ * @param rewardPercentiles - Array of percentiles to calculate (e.g., [75] for 75th percentile)
11
+ * @returns Object with reward field containing percentile fees for each block, similar to getFeeHistory
12
+ * @throws Error if fetching blocks fails
13
+ */
14
+ export declare function getBlobPriorityFeeHistory(client: ViemClient, blockCount: number, rewardPercentiles: number[]): Promise<GetFeeHistoryReturnType>;
15
+ /**
16
+ * Similar to our current competitive priority fee strategy, but only considers blob transactions
17
+ * when calculating competitive priority fee for blob transactions.
18
+ * This strategy also has NO cap on the competitive fee if it's much higher than the network estimate.
19
+ * Analyzes p75 of pending transactions and 5-block fee history to determine a competitive priority fee.
20
+ * Falls back to network estimate if data is unavailable.
21
+ */
22
+ export declare const P75BlobTxsOnlyPriorityFeeStrategy: PriorityFeeStrategy;
23
+ //# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoicDc1X2NvbXBldGl0aXZlX2Jsb2JfdHhzX29ubHkuZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uLy4uL3NyYy9sMV90eF91dGlscy9mZWUtc3RyYXRlZ2llcy9wNzVfY29tcGV0aXRpdmVfYmxvYl90eHNfb25seS50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiQUFFQSxPQUFPLEVBQUUsS0FBSyx1QkFBdUIsRUFBYyxNQUFNLE1BQU0sQ0FBQztBQUVoRSxPQUFPLEtBQUssRUFBRSxVQUFVLEVBQUUsTUFBTSxnQkFBZ0IsQ0FBQztBQUdqRCxPQUFPLEVBRUwsS0FBSyxtQkFBbUIsRUFHekIsTUFBTSxZQUFZLENBQUM7QUFFcEI7Ozs7Ozs7OztHQVNHO0FBQ0gsd0JBQXNCLHlCQUF5QixDQUM3QyxNQUFNLEVBQUUsVUFBVSxFQUNsQixVQUFVLEVBQUUsTUFBTSxFQUNsQixpQkFBaUIsRUFBRSxNQUFNLEVBQUUsR0FDMUIsT0FBTyxDQUFDLHVCQUF1QixDQUFDLENBc0VsQztBQUVEOzs7Ozs7R0FNRztBQUNILGVBQU8sTUFBTSxpQ0FBaUMsRUFBRSxtQkF5SS9DLENBQUMifQ==
@@ -0,0 +1 @@
1
+ {"version":3,"file":"p75_competitive_blob_txs_only.d.ts","sourceRoot":"","sources":["../../../src/l1_tx_utils/fee-strategies/p75_competitive_blob_txs_only.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,KAAK,uBAAuB,EAAc,MAAM,MAAM,CAAC;AAEhE,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAGjD,OAAO,EAEL,KAAK,mBAAmB,EAGzB,MAAM,YAAY,CAAC;AAEpB;;;;;;;;;GASG;AACH,wBAAsB,yBAAyB,CAC7C,MAAM,EAAE,UAAU,EAClB,UAAU,EAAE,MAAM,EAClB,iBAAiB,EAAE,MAAM,EAAE,GAC1B,OAAO,CAAC,uBAAuB,CAAC,CAsElC;AAED;;;;;;GAMG;AACH,eAAO,MAAM,iCAAiC,EAAE,mBAyI/C,CAAC"}
@@ -0,0 +1,191 @@
1
+ import { median } from '@aztec/foundation/collection';
2
+ import { formatGwei } from 'viem';
3
+ import { calculatePercentile, isBlobTransaction } from '../../utils.js';
4
+ import { WEI_CONST } from '../constants.js';
5
+ import { HISTORICAL_BLOCK_COUNT } from './types.js';
6
+ /**
7
+ * Fetches historical blocks and calculates reward percentiles for blob transactions only.
8
+ * Returns data in the same format as getFeeHistory for easy drop-in replacement.
9
+ *
10
+ * @param client - Viem client to use for RPC calls
11
+ * @param blockCount - Number of historical blocks to fetch
12
+ * @param rewardPercentiles - Array of percentiles to calculate (e.g., [75] for 75th percentile)
13
+ * @returns Object with reward field containing percentile fees for each block, similar to getFeeHistory
14
+ * @throws Error if fetching blocks fails
15
+ */ export async function getBlobPriorityFeeHistory(client, blockCount, rewardPercentiles) {
16
+ const latestBlockNumber = await client.getBlockNumber();
17
+ // Fetch multiple blocks in parallel
18
+ const blockPromises = Array.from({
19
+ length: blockCount
20
+ }, (_, i)=>client.getBlock({
21
+ blockNumber: latestBlockNumber - BigInt(i),
22
+ includeTransactions: true
23
+ }));
24
+ const blocks = await Promise.all(blockPromises);
25
+ // Process each block to extract blob transaction fees and other data
26
+ const baseFeePerGas = [];
27
+ const gasUsedRatio = [];
28
+ const reward = [];
29
+ for (const block of blocks){
30
+ // Collect base fee per gas
31
+ baseFeePerGas.push(block.baseFeePerGas || 0n);
32
+ // Calculate gas used ratio
33
+ const gasUsed = block.gasUsed || 0n;
34
+ const gasLimit = block.gasLimit || 1n; // Avoid division by zero
35
+ gasUsedRatio.push(Number(gasUsed) / Number(gasLimit));
36
+ if (!block.transactions || block.transactions.length === 0) {
37
+ // No transactions in this block - return zeros for each percentile
38
+ reward.push(rewardPercentiles.map(()=>0n));
39
+ continue;
40
+ }
41
+ // Extract priority fees from blob transactions only
42
+ const blobFees = block.transactions.map((tx)=>{
43
+ // Transaction can be just a hash string
44
+ if (typeof tx === 'string') {
45
+ return 0n;
46
+ }
47
+ if (!isBlobTransaction(tx)) {
48
+ return 0n;
49
+ }
50
+ return tx.maxPriorityFeePerGas || 0n;
51
+ }).filter((fee)=>fee > 0n);
52
+ if (blobFees.length === 0) {
53
+ // No blob transactions in this block - return zeros for each percentile
54
+ reward.push(rewardPercentiles.map(()=>0n));
55
+ continue;
56
+ }
57
+ // Calculate requested percentiles
58
+ const percentiles = rewardPercentiles.map((percentile)=>calculatePercentile(blobFees, percentile));
59
+ reward.push(percentiles);
60
+ }
61
+ // Calculate oldest block number (the last block in our array)
62
+ const oldestBlock = latestBlockNumber - BigInt(blockCount - 1);
63
+ // Reverse arrays to match getFeeHistory behavior (oldest first)
64
+ return {
65
+ baseFeePerGas: baseFeePerGas.reverse(),
66
+ gasUsedRatio: gasUsedRatio.reverse(),
67
+ oldestBlock,
68
+ reward: reward.reverse()
69
+ };
70
+ }
71
+ /**
72
+ * Similar to our current competitive priority fee strategy, but only considers blob transactions
73
+ * when calculating competitive priority fee for blob transactions.
74
+ * This strategy also has NO cap on the competitive fee if it's much higher than the network estimate.
75
+ * Analyzes p75 of pending transactions and 5-block fee history to determine a competitive priority fee.
76
+ * Falls back to network estimate if data is unavailable.
77
+ */ export const P75BlobTxsOnlyPriorityFeeStrategy = {
78
+ name: 'Competitive (P75 + History) - Blob Txs Only',
79
+ id: 'p75_pending_txs_and_history_blob_txs_only',
80
+ async execute (client, context) {
81
+ const { isBlobTx, logger } = context;
82
+ // Fire all RPC calls in parallel
83
+ const [latestBlockResult, blobBaseFeeResult, networkEstimateResult, pendingBlockResult, feeHistoryResult] = await Promise.allSettled([
84
+ client.getBlock({
85
+ blockTag: 'latest'
86
+ }),
87
+ isBlobTx ? client.getBlobBaseFee() : Promise.resolve(undefined),
88
+ client.estimateMaxPriorityFeePerGas().catch(()=>0n),
89
+ client.getBlock({
90
+ blockTag: 'pending',
91
+ includeTransactions: true
92
+ }).catch(()=>null),
93
+ isBlobTx ? getBlobPriorityFeeHistory(client, HISTORICAL_BLOCK_COUNT, [
94
+ 75
95
+ ]) : client.getFeeHistory({
96
+ blockCount: HISTORICAL_BLOCK_COUNT,
97
+ rewardPercentiles: [
98
+ 75
99
+ ],
100
+ blockTag: 'latest'
101
+ }).catch(()=>null)
102
+ ]);
103
+ // Extract latest block (required)
104
+ if (latestBlockResult.status === 'rejected') {
105
+ throw new Error(`Failed to get latest block: ${latestBlockResult.reason}`);
106
+ }
107
+ const latestBlock = latestBlockResult.value;
108
+ // Extract blob base fee (only for blob txs)
109
+ let blobBaseFee;
110
+ if (isBlobTx) {
111
+ if (blobBaseFeeResult.status === 'fulfilled' && typeof blobBaseFeeResult.value === 'bigint') {
112
+ blobBaseFee = blobBaseFeeResult.value;
113
+ } else {
114
+ logger?.warn('Failed to get L1 blob base fee');
115
+ }
116
+ }
117
+ // Extract network estimate
118
+ const networkEstimate = networkEstimateResult.status === 'fulfilled' && typeof networkEstimateResult.value === 'bigint' ? networkEstimateResult.value : 0n;
119
+ let competitiveFee = networkEstimate;
120
+ const debugInfo = {
121
+ networkEstimateGwei: formatGwei(networkEstimate)
122
+ };
123
+ // Extract pending block
124
+ const pendingBlock = pendingBlockResult.status === 'fulfilled' ? pendingBlockResult.value : null;
125
+ // Analyze pending block transactions
126
+ if (pendingBlock?.transactions && pendingBlock.transactions.length > 0) {
127
+ const pendingFees = pendingBlock.transactions.map((tx)=>{
128
+ if (typeof tx === 'string') {
129
+ return 0n;
130
+ }
131
+ if (isBlobTx) {
132
+ if (!isBlobTransaction(tx)) {
133
+ return 0n;
134
+ }
135
+ }
136
+ return tx.maxPriorityFeePerGas || 0n;
137
+ }).filter((fee)=>fee > 0n);
138
+ if (pendingFees.length > 0) {
139
+ const pendingCompetitiveFee = calculatePercentile(pendingFees, 75);
140
+ if (pendingCompetitiveFee > competitiveFee) {
141
+ competitiveFee = pendingCompetitiveFee;
142
+ }
143
+ debugInfo.pendingTxCount = pendingFees.length;
144
+ debugInfo.pendingP75Gwei = formatGwei(pendingCompetitiveFee);
145
+ logger?.debug('Analyzed pending transactions for competitive pricing', {
146
+ pendingTxCount: pendingFees.length,
147
+ pendingP75: formatGwei(pendingCompetitiveFee)
148
+ });
149
+ }
150
+ }
151
+ // Extract fee history
152
+ const feeHistory = feeHistoryResult.status === 'fulfilled' ? feeHistoryResult.value : null;
153
+ // Analyze fee history
154
+ if (feeHistory?.reward && feeHistory.reward.length > 0) {
155
+ // Extract 75th percentile fees from each block
156
+ const percentile75Fees = feeHistory.reward.map((rewards)=>rewards[0] || 0n).filter((fee)=>fee > 0n);
157
+ if (percentile75Fees.length > 0) {
158
+ // Calculate median of the 75th percentile fees across blocks
159
+ const medianHistoricalFee = median(percentile75Fees) ?? 0n;
160
+ // Debug: Log suspicious fees from history
161
+ if (medianHistoricalFee > 100n * WEI_CONST) {
162
+ logger?.warn('Suspicious high fee in history', {
163
+ historicalMedian: formatGwei(medianHistoricalFee),
164
+ allP75Fees: percentile75Fees.map((f)=>formatGwei(f))
165
+ });
166
+ }
167
+ if (medianHistoricalFee > competitiveFee) {
168
+ competitiveFee = medianHistoricalFee;
169
+ }
170
+ debugInfo.historicalMedianGwei = formatGwei(medianHistoricalFee);
171
+ logger?.debug('Analyzed fee history for competitive pricing', {
172
+ historicalMedian: formatGwei(medianHistoricalFee)
173
+ });
174
+ }
175
+ }
176
+ // Log final decision
177
+ if (competitiveFee > networkEstimate) {
178
+ logger?.debug('Using competitive fee from market analysis', {
179
+ networkEstimate: formatGwei(networkEstimate),
180
+ competitive: formatGwei(competitiveFee)
181
+ });
182
+ }
183
+ debugInfo.finalFeeGwei = formatGwei(competitiveFee);
184
+ return {
185
+ priorityFee: competitiveFee,
186
+ latestBlock,
187
+ blobBaseFee,
188
+ debugInfo
189
+ };
190
+ }
191
+ };
@@ -0,0 +1,51 @@
1
+ import type { Logger } from '@aztec/foundation/log';
2
+ import type { Block } from 'viem';
3
+ import type { ViemClient } from '../../types.js';
4
+ import type { L1TxUtilsConfig } from '../config.js';
5
+ /**
6
+ * Historical block count for fee history queries
7
+ */
8
+ export declare const HISTORICAL_BLOCK_COUNT = 5;
9
+ /**
10
+ * Result from a priority fee strategy calculation
11
+ */
12
+ export interface PriorityFeeStrategyResult {
13
+ /** The calculated priority fee in wei */
14
+ priorityFee: bigint;
15
+ /** The latest block (fetched as part of the strategy) */
16
+ latestBlock: Block;
17
+ /** The blob base fee (only present for blob transactions) */
18
+ blobBaseFee?: bigint;
19
+ /** Optional debug info about how the fee was calculated */
20
+ debugInfo?: Record<string, string | number>;
21
+ }
22
+ /**
23
+ * Context passed to the strategy function
24
+ */
25
+ export interface PriorityFeeStrategyContext {
26
+ /** Gas configuration */
27
+ gasConfig: L1TxUtilsConfig;
28
+ /** Whether this is for a blob transaction */
29
+ isBlobTx: boolean;
30
+ /** Logger for debugging */
31
+ logger?: Logger;
32
+ }
33
+ /**
34
+ * A strategy for calculating the priority fee for L1 transactions.
35
+ * The function handles all RPC calls and returns
36
+ * the priority fee, along with any block data needed by the caller.
37
+ */
38
+ export type PriorityFeeStrategy = {
39
+ /** Human-readable name for logging */
40
+ name: string;
41
+ /** Unique identifier for metrics */
42
+ id: string;
43
+ /**
44
+ * Calculate the priority fee.
45
+ * @param client - The viem client to use for RPC calls
46
+ * @param context - Contains gas config, whether it's a blob tx, and logger
47
+ * @returns The calculated priority fee result including block data
48
+ */
49
+ execute: (client: ViemClient, context: PriorityFeeStrategyContext) => Promise<PriorityFeeStrategyResult>;
50
+ };
51
+ //# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoidHlwZXMuZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uLy4uL3NyYy9sMV90eF91dGlscy9mZWUtc3RyYXRlZ2llcy90eXBlcy50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiQUFBQSxPQUFPLEtBQUssRUFBRSxNQUFNLEVBQUUsTUFBTSx1QkFBdUIsQ0FBQztBQUVwRCxPQUFPLEtBQUssRUFBRSxLQUFLLEVBQUUsTUFBTSxNQUFNLENBQUM7QUFFbEMsT0FBTyxLQUFLLEVBQUUsVUFBVSxFQUFFLE1BQU0sZ0JBQWdCLENBQUM7QUFDakQsT0FBTyxLQUFLLEVBQUUsZUFBZSxFQUFFLE1BQU0sY0FBYyxDQUFDO0FBRXBEOztHQUVHO0FBQ0gsZUFBTyxNQUFNLHNCQUFzQixJQUFJLENBQUM7QUFFeEM7O0dBRUc7QUFDSCxNQUFNLFdBQVcseUJBQXlCO0lBQ3hDLHlDQUF5QztJQUN6QyxXQUFXLEVBQUUsTUFBTSxDQUFDO0lBQ3BCLHlEQUF5RDtJQUN6RCxXQUFXLEVBQUUsS0FBSyxDQUFDO0lBQ25CLDZEQUE2RDtJQUM3RCxXQUFXLENBQUMsRUFBRSxNQUFNLENBQUM7SUFDckIsMkRBQTJEO0lBQzNELFNBQVMsQ0FBQyxFQUFFLE1BQU0sQ0FBQyxNQUFNLEVBQUUsTUFBTSxHQUFHLE1BQU0sQ0FBQyxDQUFDO0NBQzdDO0FBRUQ7O0dBRUc7QUFDSCxNQUFNLFdBQVcsMEJBQTBCO0lBQ3pDLHdCQUF3QjtJQUN4QixTQUFTLEVBQUUsZUFBZSxDQUFDO0lBQzNCLDZDQUE2QztJQUM3QyxRQUFRLEVBQUUsT0FBTyxDQUFDO0lBQ2xCLDJCQUEyQjtJQUMzQixNQUFNLENBQUMsRUFBRSxNQUFNLENBQUM7Q0FDakI7QUFFRDs7OztHQUlHO0FBQ0gsTUFBTSxNQUFNLG1CQUFtQixHQUFHO0lBQ2hDLHNDQUFzQztJQUN0QyxJQUFJLEVBQUUsTUFBTSxDQUFDO0lBQ2Isb0NBQW9DO0lBQ3BDLEVBQUUsRUFBRSxNQUFNLENBQUM7SUFDWDs7Ozs7T0FLRztJQUNILE9BQU8sRUFBRSxDQUFDLE1BQU0sRUFBRSxVQUFVLEVBQUUsT0FBTyxFQUFFLDBCQUEwQixLQUFLLE9BQU8sQ0FBQyx5QkFBeUIsQ0FBQyxDQUFDO0NBQzFHLENBQUMifQ==
@@ -0,0 +1 @@
1
+ {"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/l1_tx_utils/fee-strategies/types.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,uBAAuB,CAAC;AAEpD,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,MAAM,CAAC;AAElC,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AACjD,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAEpD;;GAEG;AACH,eAAO,MAAM,sBAAsB,IAAI,CAAC;AAExC;;GAEG;AACH,MAAM,WAAW,yBAAyB;IACxC,yCAAyC;IACzC,WAAW,EAAE,MAAM,CAAC;IACpB,yDAAyD;IACzD,WAAW,EAAE,KAAK,CAAC;IACnB,6DAA6D;IAC7D,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,2DAA2D;IAC3D,SAAS,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC,CAAC;CAC7C;AAED;;GAEG;AACH,MAAM,WAAW,0BAA0B;IACzC,wBAAwB;IACxB,SAAS,EAAE,eAAe,CAAC;IAC3B,6CAA6C;IAC7C,QAAQ,EAAE,OAAO,CAAC;IAClB,2BAA2B;IAC3B,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED;;;;GAIG;AACH,MAAM,MAAM,mBAAmB,GAAG;IAChC,sCAAsC;IACtC,IAAI,EAAE,MAAM,CAAC;IACb,oCAAoC;IACpC,EAAE,EAAE,MAAM,CAAC;IACX;;;;;OAKG;IACH,OAAO,EAAE,CAAC,MAAM,EAAE,UAAU,EAAE,OAAO,EAAE,0BAA0B,KAAK,OAAO,CAAC,yBAAyB,CAAC,CAAC;CAC1G,CAAC"}
@@ -0,0 +1,3 @@
1
+ /**
2
+ * Historical block count for fee history queries
3
+ */ export const HISTORICAL_BLOCK_COUNT = 5;
@@ -1,10 +1,12 @@
1
1
  export * from './config.js';
2
2
  export * from './constants.js';
3
3
  export * from './factory.js';
4
+ export * from './fee-strategies/index.js';
4
5
  export * from './interfaces.js';
6
+ export * from './l1_fee_analyzer.js';
5
7
  export * from './l1_tx_utils.js';
6
8
  export * from './readonly_l1_tx_utils.js';
7
9
  export * from './signer.js';
8
10
  export * from './types.js';
9
11
  export * from './utils.js';
10
- //# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiaW5kZXguZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9sMV90eF91dGlscy9pbmRleC50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiQUFBQSxjQUFjLGFBQWEsQ0FBQztBQUM1QixjQUFjLGdCQUFnQixDQUFDO0FBQy9CLGNBQWMsY0FBYyxDQUFDO0FBQzdCLGNBQWMsaUJBQWlCLENBQUM7QUFDaEMsY0FBYyxrQkFBa0IsQ0FBQztBQUNqQyxjQUFjLDJCQUEyQixDQUFDO0FBQzFDLGNBQWMsYUFBYSxDQUFDO0FBQzVCLGNBQWMsWUFBWSxDQUFDO0FBQzNCLGNBQWMsWUFBWSxDQUFDIn0=
12
+ //# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiaW5kZXguZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9sMV90eF91dGlscy9pbmRleC50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiQUFBQSxjQUFjLGFBQWEsQ0FBQztBQUM1QixjQUFjLGdCQUFnQixDQUFDO0FBQy9CLGNBQWMsY0FBYyxDQUFDO0FBQzdCLGNBQWMsMkJBQTJCLENBQUM7QUFDMUMsY0FBYyxpQkFBaUIsQ0FBQztBQUNoQyxjQUFjLHNCQUFzQixDQUFDO0FBQ3JDLGNBQWMsa0JBQWtCLENBQUM7QUFDakMsY0FBYywyQkFBMkIsQ0FBQztBQUMxQyxjQUFjLGFBQWEsQ0FBQztBQUM1QixjQUFjLFlBQVksQ0FBQztBQUMzQixjQUFjLFlBQVksQ0FBQyJ9
@@ -1 +1 @@
1
- {"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/l1_tx_utils/index.ts"],"names":[],"mappings":"AAAA,cAAc,aAAa,CAAC;AAC5B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,cAAc,CAAC;AAC7B,cAAc,iBAAiB,CAAC;AAChC,cAAc,kBAAkB,CAAC;AACjC,cAAc,2BAA2B,CAAC;AAC1C,cAAc,aAAa,CAAC;AAC5B,cAAc,YAAY,CAAC;AAC3B,cAAc,YAAY,CAAC"}
1
+ {"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/l1_tx_utils/index.ts"],"names":[],"mappings":"AAAA,cAAc,aAAa,CAAC;AAC5B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,cAAc,CAAC;AAC7B,cAAc,2BAA2B,CAAC;AAC1C,cAAc,iBAAiB,CAAC;AAChC,cAAc,sBAAsB,CAAC;AACrC,cAAc,kBAAkB,CAAC;AACjC,cAAc,2BAA2B,CAAC;AAC1C,cAAc,aAAa,CAAC;AAC5B,cAAc,YAAY,CAAC;AAC3B,cAAc,YAAY,CAAC"}
@@ -1,7 +1,9 @@
1
1
  export * from './config.js';
2
2
  export * from './constants.js';
3
3
  export * from './factory.js';
4
+ export * from './fee-strategies/index.js';
4
5
  export * from './interfaces.js';
6
+ export * from './l1_fee_analyzer.js';
5
7
  export * from './l1_tx_utils.js';
6
8
  export * from './readonly_l1_tx_utils.js';
7
9
  export * from './signer.js';