feat: batch address trees - #18

Merged
sergeytimoshin merged 33 commits into
jorrit/feat-add-testfrom
sergey/batch-address-updates
May 3, 2025
Merged

feat: batch address trees#18
sergeytimoshin merged 33 commits into
jorrit/feat-add-testfrom
sergey/batch-address-updates

Conversation

@sergeytimoshin

@sergeytimoshinsergeytimoshin commented Apr 3, 2025

Copy link
Copy Markdown

Overview

This pr adds support for batch address updates and introduces a new API endpoint getBatchAddressUpdateInfo

Changes:

API

  • NEW:getBatchAddressUpdateInfo endpoint.
    Retrieves addresses pending insertion from the new address queue, along with necessary proofs and context for batch updates.

Request:

tree: Hash
batch_size: u16

Response:

start_index: u64,
addresses: Vec<AddressQueueIndex>,
non_inclusion_proofs: Vec<MerkleContextWithNewAddressProof>,
subtrees: Vec<[u8; 32]>,

DB

Added address_queues table, corresponding models & migrations.
Table structure:

pub address: Vec<u8>,
pub tree: Vec<u8>,
pub queue_index: i64,

Events

Added PublicTransactionEventV2 structure and parsing logic which contains MerkleTreeSequenceNumberV2(tree_pubkey, queue_pubkey, tree_type, seq).

Tests

tests/integration_tests/batched_state_tree_tests.rs
Contains new test_batched_address_transactions test.

  • 50 addresses appended to the queue
  • 5 batch address append operations with batch_size=10 invoked

Asserts:

  • getBatchAddressUpdateInfo return non-empty queue after indexing of initial 50 txs and contain valid expected addresses.
  • Final root is checked against reference tree after applying batch address append txs.

TODO:

  • Add test for the case when we have 2 addresses in 1 ix.

@sergeytimoshin
sergeytimoshin marked this pull request as ready for review April 3, 2025 01:35
@sergeytimoshin
sergeytimoshinforce-pushed the sergey/batch-address-updates branch from b089102 to db382f7CompareApril 6, 2025 12:07
@sergeytimoshin
sergeytimoshinforce-pushed the sergey/batch-address-updates branch from ed8b8f0 to c24977fCompareApril 8, 2025 18:55
Comment threadsrc/ingester/parser/tx_event_parser.rs Outdated
Comment threadsrc/ingester/persist/persisted_indexed_merkle_tree.rs Outdated
Comment threadsrc/ingester/persist/persisted_indexed_merkle_tree.rs Outdated
Comment threadsrc/ingester/persist/leaf_node.rs Outdated
Comment on lines +123 to +136
for (new_address, seq) in event
.new_addresses
.iter()
.zip(event.address_sequence_numbers.iter())
{
let tree_info = TreeInfo::get(&new_address.mt_pubkey.to_string())
.ok_or(IngesterError::ParserError("Missing queue".to_string()))?
.clone();
state_update_event.addresses.push(AddressQueueUpdate {
tree: tree_info.tree.into(),
address: new_address.address,
queue_index: seq.seq,
});
}

@ananas-blockananas-blockApr 10, 2025

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggested change
for(new_address, seq)in event
.new_addresses
.iter()
.zip(event.address_sequence_numbers.iter())
{
let tree_info = TreeInfo::get(&new_address.mt_pubkey.to_string())
.ok_or(IngesterError::ParserError("Missing queue".to_string()))?
.clone();
state_update_event.addresses.push(AddressQueueUpdate{
tree: tree_info.tree.into(),
address: new_address.address,
queue_index: seq.seq,
});
}
for(new_address, seq)in event
.new_addresses
.iter()
.zip(event.address_sequence_numbers.iter())
{
state_update_event.addresses.push(AddressQueueUpdate{
tree: new_address.mt_pubkey.into(),
address: new_address.address,
queue_index: seq.seq,
});
}

Comment threadsrc/ingester/parser/tx_event_parser_v2.rs Outdated
Comment threadsrc/ingester/parser/tx_event_parser_v2.rs Outdated
Comment threadsrc/ingester/persist/persisted_state_tree.rs
Comment threadsrc/ingester/persist/mod.rs Outdated
Comment threadsrc/ingester/parser/tx_event_parser.rs Outdated
Comment threadsrc/ingester/parser/tx_event_parser.rs Outdated
Comment threadsrc/ingester/persist/persisted_indexed_merkle_tree.rs Outdated
}

pub const MAX_HEIGHT: usize = 32;
pub async fn get_subtrees(

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

shouldn't this be in persisted_indexed_merkle_tree ?

Copy link
Copy Markdown
Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I think it makes sense to leave it here, because persisted_state_tree stores nodes for indexed trees, and persisted_indexed_merkle_tree works more like indexed array.

Comment threadtests/integration_tests/batched_state_tree_tests.rs Outdated
Comment threadtests/integration_tests/batched_state_tree_tests.rs Outdated
Comment threadtests/integration_tests/batched_state_tree_tests.rs Outdated

@ananas-blockananas-block left a comment

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Thanks!
TLDR on comments:

  1. are we sure queue indices are set correctly if we insert 2 addresses in the same tree in the same tx?
  2. found some dead code in parse_public_transaction_event
  3. PublicTransactionEvent::V1 maybe we can get away with less diff by implementing From
  4. Final root assert in test
  5. couple smaller improvements

Comment threadCargo.toml
@@ -79,18 +77,15 @@ solana-program = "1.18.0"
solana-sdk = "1.18.0"

Copy link
Copy Markdown
Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Try to remove

Comment threadCargo.toml Outdated
…d address is in the AddressQueue but not in tree yet, we should return error. For V1 trees we still return non-inclusion proof, because we don't have information about V1 queue.
* Add offset as request parameter to get_batch_address_update_info.
* Various cleanups
@sergeytimoshinsergeytimoshin changed the title feat: batch address trees supportfeat: batch address treesApr 30, 2025
Comment threadCargo.toml
light-compressed-account = { git = "https://github.com/Lightprotocol/light-protocol", rev = "368f9f08272db78c74b2ade1a1c2fead27dd0a96" }
light-concurrent-merkle-tree = { git = "https://github.com/Lightprotocol/light-protocol", rev = "368f9f08272db78c74b2ade1a1c2fead27dd0a96" }
light-hasher = "2.0.0"
light-hasher = { git = "https://github.com/Lightprotocol/light-protocol", rev = "368f9f08272db78c74b2ade1a1c2fead27dd0a96" }

@ananas-blockananas-blockMay 2, 2025

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

why was this necessary?
(I didn't want to release light-hasher again.)

Copy link
Copy Markdown
Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

light-merkle-tree-reference has light-hasher dependency as well => there are multiple different versions of crate light_hasher in the dependency graph

@sergeytimoshin
sergeytimoshin merged commit 61627ae into jorrit/feat-add-testMay 3, 2025
Sign up for freeto join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants

@sergeytimoshin@ananas-block
, 'i'); if (__m === '*' || __re.test(location.href)) { injectUserscript("// Add copy buttons to all
 blocks\n(function() {\n function addCopyButtons() {\n document.querySelectorAll('pre code').forEach(function(codeBlock) {\n if (codeBlock.parentElement.hasAttribute('data-copy-added')) return;\n codeBlock.parentElement.setAttribute('data-copy-added', 'true');\n \n var btn = document.createElement('button');\n btn.textContent = 'Copy';\n btn.style.cssText = 'position:absolute;top:4px;right:4px;padding:2px 8px;font-size:11px;background:#4ecdc4;border:none;border-radius:4px;color:#1a1a2e;cursor:pointer;opacity:0.7;transition:opacity 0.2s;';\n btn.onmouseover = function() { this.style.opacity = '1'; };\n btn.onmouseout = function() { this.style.opacity = '0.7'; };\n btn.onclick = function() {\n navigator.clipboard.writeText(codeBlock.textContent).then(function() {\n btn.textContent = 'Copied!';\n setTimeout(function() { btn.textContent = 'Copy'; }, 1500);\n });\n };\n codeBlock.parentElement.style.position = 'relative';\n codeBlock.parentElement.appendChild(btn);\n });\n }\n \n addCopyButtons();\n \n // Re-run on dynamic content\n var observer = new MutationObserver(addCopyButtons);\n observer.observe(document.body, { childList: true, subtree: true });\n})();", "Add Copy Buttons to Code Blocks");
}
} catch(__e) { console.warn('[Userscript:Add Copy Buttons to Code Blocks]', __e); }
})();
(function(){
try {
var __m = "github.com";
var __re = new RegExp('^' + "github\\.com" + '
Skip to content

feat: batch address trees - #18

Merged
sergeytimoshin merged 33 commits into
jorrit/feat-add-testfrom
sergey/batch-address-updates
May 3, 2025
Merged

feat: batch address trees#18
sergeytimoshin merged 33 commits into
jorrit/feat-add-testfrom
sergey/batch-address-updates

Conversation

@sergeytimoshin

@sergeytimoshinsergeytimoshin commented Apr 3, 2025

Copy link
Copy Markdown

Overview

This pr adds support for batch address updates and introduces a new API endpoint getBatchAddressUpdateInfo

Changes:

API

  • NEW:getBatchAddressUpdateInfo endpoint.
    Retrieves addresses pending insertion from the new address queue, along with necessary proofs and context for batch updates.

Request:

tree: Hash
batch_size: u16

Response:

start_index: u64,
addresses: Vec<AddressQueueIndex>,
non_inclusion_proofs: Vec<MerkleContextWithNewAddressProof>,
subtrees: Vec<[u8; 32]>,

DB

Added address_queues table, corresponding models & migrations.
Table structure:

pub address: Vec<u8>,
pub tree: Vec<u8>,
pub queue_index: i64,

Events

Added PublicTransactionEventV2 structure and parsing logic which contains MerkleTreeSequenceNumberV2(tree_pubkey, queue_pubkey, tree_type, seq).

Tests

tests/integration_tests/batched_state_tree_tests.rs
Contains new test_batched_address_transactions test.

  • 50 addresses appended to the queue
  • 5 batch address append operations with batch_size=10 invoked

Asserts:

  • getBatchAddressUpdateInfo return non-empty queue after indexing of initial 50 txs and contain valid expected addresses.
  • Final root is checked against reference tree after applying batch address append txs.

TODO:

  • Add test for the case when we have 2 addresses in 1 ix.

@sergeytimoshin
sergeytimoshin marked this pull request as ready for review April 3, 2025 01:35
@sergeytimoshin
sergeytimoshinforce-pushed the sergey/batch-address-updates branch from b089102 to db382f7CompareApril 6, 2025 12:07
@sergeytimoshin
sergeytimoshinforce-pushed the sergey/batch-address-updates branch from ed8b8f0 to c24977fCompareApril 8, 2025 18:55
Comment threadsrc/ingester/parser/tx_event_parser.rs Outdated
Comment threadsrc/ingester/persist/persisted_indexed_merkle_tree.rs Outdated
Comment threadsrc/ingester/persist/persisted_indexed_merkle_tree.rs Outdated
Comment threadsrc/ingester/persist/leaf_node.rs Outdated
Comment on lines +123 to +136
for (new_address, seq) in event
.new_addresses
.iter()
.zip(event.address_sequence_numbers.iter())
{
let tree_info = TreeInfo::get(&new_address.mt_pubkey.to_string())
.ok_or(IngesterError::ParserError("Missing queue".to_string()))?
.clone();
state_update_event.addresses.push(AddressQueueUpdate {
tree: tree_info.tree.into(),
address: new_address.address,
queue_index: seq.seq,
});
}

@ananas-blockananas-blockApr 10, 2025

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggested change
for(new_address, seq)in event
.new_addresses
.iter()
.zip(event.address_sequence_numbers.iter())
{
let tree_info = TreeInfo::get(&new_address.mt_pubkey.to_string())
.ok_or(IngesterError::ParserError("Missing queue".to_string()))?
.clone();
state_update_event.addresses.push(AddressQueueUpdate{
tree: tree_info.tree.into(),
address: new_address.address,
queue_index: seq.seq,
});
}
for(new_address, seq)in event
.new_addresses
.iter()
.zip(event.address_sequence_numbers.iter())
{
state_update_event.addresses.push(AddressQueueUpdate{
tree: new_address.mt_pubkey.into(),
address: new_address.address,
queue_index: seq.seq,
});
}

Comment threadsrc/ingester/parser/tx_event_parser_v2.rs Outdated
Comment threadsrc/ingester/parser/tx_event_parser_v2.rs Outdated
Comment threadsrc/ingester/persist/persisted_state_tree.rs
Comment threadsrc/ingester/persist/mod.rs Outdated
Comment threadsrc/ingester/parser/tx_event_parser.rs Outdated
Comment threadsrc/ingester/parser/tx_event_parser.rs Outdated
Comment threadsrc/ingester/persist/persisted_indexed_merkle_tree.rs Outdated
}

pub const MAX_HEIGHT: usize = 32;
pub async fn get_subtrees(

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

shouldn't this be in persisted_indexed_merkle_tree ?

Copy link
Copy Markdown
Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I think it makes sense to leave it here, because persisted_state_tree stores nodes for indexed trees, and persisted_indexed_merkle_tree works more like indexed array.

Comment threadtests/integration_tests/batched_state_tree_tests.rs Outdated
Comment threadtests/integration_tests/batched_state_tree_tests.rs Outdated
Comment threadtests/integration_tests/batched_state_tree_tests.rs Outdated

@ananas-blockananas-block left a comment

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Thanks!
TLDR on comments:

  1. are we sure queue indices are set correctly if we insert 2 addresses in the same tree in the same tx?
  2. found some dead code in parse_public_transaction_event
  3. PublicTransactionEvent::V1 maybe we can get away with less diff by implementing From
  4. Final root assert in test
  5. couple smaller improvements

Comment threadCargo.toml
@@ -79,18 +77,15 @@ solana-program = "1.18.0"
solana-sdk = "1.18.0"

Copy link
Copy Markdown
Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Try to remove

Comment threadCargo.toml Outdated
…d address is in the AddressQueue but not in tree yet, we should return error. For V1 trees we still return non-inclusion proof, because we don't have information about V1 queue.
* Add offset as request parameter to get_batch_address_update_info.
* Various cleanups
@sergeytimoshinsergeytimoshin changed the title feat: batch address trees supportfeat: batch address treesApr 30, 2025
Comment threadCargo.toml
light-compressed-account = { git = "https://github.com/Lightprotocol/light-protocol", rev = "368f9f08272db78c74b2ade1a1c2fead27dd0a96" }
light-concurrent-merkle-tree = { git = "https://github.com/Lightprotocol/light-protocol", rev = "368f9f08272db78c74b2ade1a1c2fead27dd0a96" }
light-hasher = "2.0.0"
light-hasher = { git = "https://github.com/Lightprotocol/light-protocol", rev = "368f9f08272db78c74b2ade1a1c2fead27dd0a96" }

@ananas-blockananas-blockMay 2, 2025

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

why was this necessary?
(I didn't want to release light-hasher again.)

Copy link
Copy Markdown
Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

light-merkle-tree-reference has light-hasher dependency as well => there are multiple different versions of crate light_hasher in the dependency graph

@sergeytimoshin
sergeytimoshin merged commit 61627ae into jorrit/feat-add-testMay 3, 2025
Sign up for freeto join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants

@sergeytimoshin@ananas-block
, 'i'); if (__m === '*' || __re.test(location.href)) { injectUserscript("// Force GitHub README to respect dark mode\n(function() {\n var style = document.createElement('style');\n style.textContent = '\n .markdown-body {\n color-scheme: dark light;\n }\n .markdown-body pre { background: #161b22 !important; }\n .markdown-body code { background: rgba(110, 118, 129, 0.4) !important; }\n .markdown-body table th, .markdown-body table td { border-color: #30363d !important; }\n .markdown-body img { background: #0d1117; }\n .markdown-body blockquote { border-left-color: #8b949e; }\n .markdown-body hr { border-color: #30363d; }\n ';\n document.head.appendChild(style);\n})();", "GitHub Dark Mode README Fix"); } } catch(__e) { console.warn('[Userscript:GitHub Dark Mode README Fix]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + '
Skip to content

feat: batch address trees - #18

Merged
sergeytimoshin merged 33 commits into
jorrit/feat-add-testfrom
sergey/batch-address-updates
May 3, 2025
Merged

feat: batch address trees#18
sergeytimoshin merged 33 commits into
jorrit/feat-add-testfrom
sergey/batch-address-updates

Conversation

@sergeytimoshin

@sergeytimoshinsergeytimoshin commented Apr 3, 2025

Copy link
Copy Markdown

Overview

This pr adds support for batch address updates and introduces a new API endpoint getBatchAddressUpdateInfo

Changes:

API

  • NEW:getBatchAddressUpdateInfo endpoint.
    Retrieves addresses pending insertion from the new address queue, along with necessary proofs and context for batch updates.

Request:

tree: Hash
batch_size: u16

Response:

start_index: u64,
addresses: Vec<AddressQueueIndex>,
non_inclusion_proofs: Vec<MerkleContextWithNewAddressProof>,
subtrees: Vec<[u8; 32]>,

DB

Added address_queues table, corresponding models & migrations.
Table structure:

pub address: Vec<u8>,
pub tree: Vec<u8>,
pub queue_index: i64,

Events

Added PublicTransactionEventV2 structure and parsing logic which contains MerkleTreeSequenceNumberV2(tree_pubkey, queue_pubkey, tree_type, seq).

Tests

tests/integration_tests/batched_state_tree_tests.rs
Contains new test_batched_address_transactions test.

  • 50 addresses appended to the queue
  • 5 batch address append operations with batch_size=10 invoked

Asserts:

  • getBatchAddressUpdateInfo return non-empty queue after indexing of initial 50 txs and contain valid expected addresses.
  • Final root is checked against reference tree after applying batch address append txs.

TODO:

  • Add test for the case when we have 2 addresses in 1 ix.

@sergeytimoshin
sergeytimoshin marked this pull request as ready for review April 3, 2025 01:35
@sergeytimoshin
sergeytimoshinforce-pushed the sergey/batch-address-updates branch from b089102 to db382f7CompareApril 6, 2025 12:07
@sergeytimoshin
sergeytimoshinforce-pushed the sergey/batch-address-updates branch from ed8b8f0 to c24977fCompareApril 8, 2025 18:55
Comment threadsrc/ingester/parser/tx_event_parser.rs Outdated
Comment threadsrc/ingester/persist/persisted_indexed_merkle_tree.rs Outdated
Comment threadsrc/ingester/persist/persisted_indexed_merkle_tree.rs Outdated
Comment threadsrc/ingester/persist/leaf_node.rs Outdated
Comment on lines +123 to +136
for (new_address, seq) in event
.new_addresses
.iter()
.zip(event.address_sequence_numbers.iter())
{
let tree_info = TreeInfo::get(&new_address.mt_pubkey.to_string())
.ok_or(IngesterError::ParserError("Missing queue".to_string()))?
.clone();
state_update_event.addresses.push(AddressQueueUpdate {
tree: tree_info.tree.into(),
address: new_address.address,
queue_index: seq.seq,
});
}

@ananas-blockananas-blockApr 10, 2025

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggested change
for(new_address, seq)in event
.new_addresses
.iter()
.zip(event.address_sequence_numbers.iter())
{
let tree_info = TreeInfo::get(&new_address.mt_pubkey.to_string())
.ok_or(IngesterError::ParserError("Missing queue".to_string()))?
.clone();
state_update_event.addresses.push(AddressQueueUpdate{
tree: tree_info.tree.into(),
address: new_address.address,
queue_index: seq.seq,
});
}
for(new_address, seq)in event
.new_addresses
.iter()
.zip(event.address_sequence_numbers.iter())
{
state_update_event.addresses.push(AddressQueueUpdate{
tree: new_address.mt_pubkey.into(),
address: new_address.address,
queue_index: seq.seq,
});
}

Comment threadsrc/ingester/parser/tx_event_parser_v2.rs Outdated
Comment threadsrc/ingester/parser/tx_event_parser_v2.rs Outdated
Comment threadsrc/ingester/persist/persisted_state_tree.rs
Comment threadsrc/ingester/persist/mod.rs Outdated
Comment threadsrc/ingester/parser/tx_event_parser.rs Outdated
Comment threadsrc/ingester/parser/tx_event_parser.rs Outdated
Comment threadsrc/ingester/persist/persisted_indexed_merkle_tree.rs Outdated
}

pub const MAX_HEIGHT: usize = 32;
pub async fn get_subtrees(

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

shouldn't this be in persisted_indexed_merkle_tree ?

Copy link
Copy Markdown
Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I think it makes sense to leave it here, because persisted_state_tree stores nodes for indexed trees, and persisted_indexed_merkle_tree works more like indexed array.

Comment threadtests/integration_tests/batched_state_tree_tests.rs Outdated
Comment threadtests/integration_tests/batched_state_tree_tests.rs Outdated
Comment threadtests/integration_tests/batched_state_tree_tests.rs Outdated

@ananas-blockananas-block left a comment

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Thanks!
TLDR on comments:

  1. are we sure queue indices are set correctly if we insert 2 addresses in the same tree in the same tx?
  2. found some dead code in parse_public_transaction_event
  3. PublicTransactionEvent::V1 maybe we can get away with less diff by implementing From
  4. Final root assert in test
  5. couple smaller improvements

Comment threadCargo.toml
@@ -79,18 +77,15 @@ solana-program = "1.18.0"
solana-sdk = "1.18.0"

Copy link
Copy Markdown
Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Try to remove

Comment threadCargo.toml Outdated
…d address is in the AddressQueue but not in tree yet, we should return error. For V1 trees we still return non-inclusion proof, because we don't have information about V1 queue.
* Add offset as request parameter to get_batch_address_update_info.
* Various cleanups
@sergeytimoshinsergeytimoshin changed the title feat: batch address trees supportfeat: batch address treesApr 30, 2025
Comment threadCargo.toml
light-compressed-account = { git = "https://github.com/Lightprotocol/light-protocol", rev = "368f9f08272db78c74b2ade1a1c2fead27dd0a96" }
light-concurrent-merkle-tree = { git = "https://github.com/Lightprotocol/light-protocol", rev = "368f9f08272db78c74b2ade1a1c2fead27dd0a96" }
light-hasher = "2.0.0"
light-hasher = { git = "https://github.com/Lightprotocol/light-protocol", rev = "368f9f08272db78c74b2ade1a1c2fead27dd0a96" }

@ananas-blockananas-blockMay 2, 2025

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

why was this necessary?
(I didn't want to release light-hasher again.)

Copy link
Copy Markdown
Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

light-merkle-tree-reference has light-hasher dependency as well => there are multiple different versions of crate light_hasher in the dependency graph

@sergeytimoshin
sergeytimoshin merged commit 61627ae into jorrit/feat-add-testMay 3, 2025
Sign up for freeto join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants

@sergeytimoshin@ananas-block
, 'i'); if (__m === '*' || __re.test(location.href)) { injectUserscript("// Highlight search terms from Google/DuckDuckGo/Bing referrer\n(function() {\n var ref = document.referrer;\n var terms = [];\n \n if (ref.includes('google.com') || ref.includes('duckduckgo.com') || ref.includes('bing.com')) {\n var url = new URL(ref);\n var q = url.searchParams.get('q') || url.searchParams.get('p');\n if (q) {\n terms = q.split(/\\s+/).filter(function(t) { return t.length > 2; });\n }\n }\n \n if (terms.length === 0) return;\n \n var style = document.createElement('style');\n style.textContent = '.userscript-highlight { background: #fbbf24; color: #1a1a2e; padding: 1px 3px; border-radius: 2px; }';\n document.head.appendChild(style);\n \n function highlight(node) {\n if (node.nodeType === 3) { // text node\n var text = node.textContent;\n var found = false;\n terms.forEach(function(term) {\n var regex = new RegExp('(' + term.replace(/[.*+?^${}()|[\\]\\\\]/g, '\\\\') + ')', 'gi');\n if (regex.test(text)) {\n found = true;\n var frag = document.createDocumentFragment();\n var parts = text.split(regex);\n parts.forEach(function(part, i) {\n if (i % 2 === 0) {\n frag.appendChild(document.createTextNode(part));\n } else {\n var span = document.createElement('span');\n span.className = 'userscript-highlight';\n span.textContent = part;\n frag.appendChild(span);\n }\n });\n node.parentNode.replaceChild(frag, node);\n }\n });\n } else if (node.nodeType === 1 && node.childNodes) { // element\n var skipTags = ['SCRIPT', 'STYLE', 'NOSCRIPT', 'TEXTAREA', 'INPUT', 'SELECT'];\n if (!skipTags.includes(node.tagName)) {\n Array.from(node.childNodes).forEach(highlight);\n }\n }\n }\n \n highlight(document.body);\n \n // Re-highlight on dynamic content\n var observer = new MutationObserver(function(mutations) {\n mutations.forEach(function(m) {\n m.addedNodes.forEach(function(node) {\n if (node.nodeType === 1 || node.nodeType === 3) highlight(node);\n });\n });\n });\n observer.observe(document.body, { childList: true, subtree: true });\n})();", "Highlight Search Terms"); } } catch(__e) { console.warn('[Userscript:Highlight Search Terms]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + '
Skip to content

feat: batch address trees - #18

Merged
sergeytimoshin merged 33 commits into
jorrit/feat-add-testfrom
sergey/batch-address-updates
May 3, 2025
Merged

feat: batch address trees#18
sergeytimoshin merged 33 commits into
jorrit/feat-add-testfrom
sergey/batch-address-updates

Conversation

@sergeytimoshin

@sergeytimoshinsergeytimoshin commented Apr 3, 2025

Copy link
Copy Markdown

Overview

This pr adds support for batch address updates and introduces a new API endpoint getBatchAddressUpdateInfo

Changes:

API

  • NEW:getBatchAddressUpdateInfo endpoint.
    Retrieves addresses pending insertion from the new address queue, along with necessary proofs and context for batch updates.

Request:

tree: Hash
batch_size: u16

Response:

start_index: u64,
addresses: Vec<AddressQueueIndex>,
non_inclusion_proofs: Vec<MerkleContextWithNewAddressProof>,
subtrees: Vec<[u8; 32]>,

DB

Added address_queues table, corresponding models & migrations.
Table structure:

pub address: Vec<u8>,
pub tree: Vec<u8>,
pub queue_index: i64,

Events

Added PublicTransactionEventV2 structure and parsing logic which contains MerkleTreeSequenceNumberV2(tree_pubkey, queue_pubkey, tree_type, seq).

Tests

tests/integration_tests/batched_state_tree_tests.rs
Contains new test_batched_address_transactions test.

  • 50 addresses appended to the queue
  • 5 batch address append operations with batch_size=10 invoked

Asserts:

  • getBatchAddressUpdateInfo return non-empty queue after indexing of initial 50 txs and contain valid expected addresses.
  • Final root is checked against reference tree after applying batch address append txs.

TODO:

  • Add test for the case when we have 2 addresses in 1 ix.

@sergeytimoshin
sergeytimoshin marked this pull request as ready for review April 3, 2025 01:35
@sergeytimoshin
sergeytimoshinforce-pushed the sergey/batch-address-updates branch from b089102 to db382f7CompareApril 6, 2025 12:07
@sergeytimoshin
sergeytimoshinforce-pushed the sergey/batch-address-updates branch from ed8b8f0 to c24977fCompareApril 8, 2025 18:55
Comment threadsrc/ingester/parser/tx_event_parser.rs Outdated
Comment threadsrc/ingester/persist/persisted_indexed_merkle_tree.rs Outdated
Comment threadsrc/ingester/persist/persisted_indexed_merkle_tree.rs Outdated
Comment threadsrc/ingester/persist/leaf_node.rs Outdated
Comment on lines +123 to +136
for (new_address, seq) in event
.new_addresses
.iter()
.zip(event.address_sequence_numbers.iter())
{
let tree_info = TreeInfo::get(&new_address.mt_pubkey.to_string())
.ok_or(IngesterError::ParserError("Missing queue".to_string()))?
.clone();
state_update_event.addresses.push(AddressQueueUpdate {
tree: tree_info.tree.into(),
address: new_address.address,
queue_index: seq.seq,
});
}

@ananas-blockananas-blockApr 10, 2025

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggested change
for(new_address, seq)in event
.new_addresses
.iter()
.zip(event.address_sequence_numbers.iter())
{
let tree_info = TreeInfo::get(&new_address.mt_pubkey.to_string())
.ok_or(IngesterError::ParserError("Missing queue".to_string()))?
.clone();
state_update_event.addresses.push(AddressQueueUpdate{
tree: tree_info.tree.into(),
address: new_address.address,
queue_index: seq.seq,
});
}
for(new_address, seq)in event
.new_addresses
.iter()
.zip(event.address_sequence_numbers.iter())
{
state_update_event.addresses.push(AddressQueueUpdate{
tree: new_address.mt_pubkey.into(),
address: new_address.address,
queue_index: seq.seq,
});
}

Comment threadsrc/ingester/parser/tx_event_parser_v2.rs Outdated
Comment threadsrc/ingester/parser/tx_event_parser_v2.rs Outdated
Comment threadsrc/ingester/persist/persisted_state_tree.rs
Comment threadsrc/ingester/persist/mod.rs Outdated
Comment threadsrc/ingester/parser/tx_event_parser.rs Outdated
Comment threadsrc/ingester/parser/tx_event_parser.rs Outdated
Comment threadsrc/ingester/persist/persisted_indexed_merkle_tree.rs Outdated
}

pub const MAX_HEIGHT: usize = 32;
pub async fn get_subtrees(

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

shouldn't this be in persisted_indexed_merkle_tree ?

Copy link
Copy Markdown
Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I think it makes sense to leave it here, because persisted_state_tree stores nodes for indexed trees, and persisted_indexed_merkle_tree works more like indexed array.

Comment threadtests/integration_tests/batched_state_tree_tests.rs Outdated
Comment threadtests/integration_tests/batched_state_tree_tests.rs Outdated
Comment threadtests/integration_tests/batched_state_tree_tests.rs Outdated

@ananas-blockananas-block left a comment

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Thanks!
TLDR on comments:

  1. are we sure queue indices are set correctly if we insert 2 addresses in the same tree in the same tx?
  2. found some dead code in parse_public_transaction_event
  3. PublicTransactionEvent::V1 maybe we can get away with less diff by implementing From
  4. Final root assert in test
  5. couple smaller improvements

Comment threadCargo.toml
@@ -79,18 +77,15 @@ solana-program = "1.18.0"
solana-sdk = "1.18.0"

Copy link
Copy Markdown
Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Try to remove

Comment threadCargo.toml Outdated
…d address is in the AddressQueue but not in tree yet, we should return error. For V1 trees we still return non-inclusion proof, because we don't have information about V1 queue.
* Add offset as request parameter to get_batch_address_update_info.
* Various cleanups
@sergeytimoshinsergeytimoshin changed the title feat: batch address trees supportfeat: batch address treesApr 30, 2025
Comment threadCargo.toml
light-compressed-account = { git = "https://github.com/Lightprotocol/light-protocol", rev = "368f9f08272db78c74b2ade1a1c2fead27dd0a96" }
light-concurrent-merkle-tree = { git = "https://github.com/Lightprotocol/light-protocol", rev = "368f9f08272db78c74b2ade1a1c2fead27dd0a96" }
light-hasher = "2.0.0"
light-hasher = { git = "https://github.com/Lightprotocol/light-protocol", rev = "368f9f08272db78c74b2ade1a1c2fead27dd0a96" }

@ananas-blockananas-blockMay 2, 2025

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

why was this necessary?
(I didn't want to release light-hasher again.)

Copy link
Copy Markdown
Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

light-merkle-tree-reference has light-hasher dependency as well => there are multiple different versions of crate light_hasher in the dependency graph

@sergeytimoshin
sergeytimoshin merged commit 61627ae into jorrit/feat-add-testMay 3, 2025
Sign up for freeto join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants

@sergeytimoshin@ananas-block
, 'i'); if (__m === '*' || __re.test(location.href)) { injectUserscript("// Strip utm_, fbclid, gclid, etc. from all links on page\n(function() {\n var trackingParams = ['utm_source', 'utm_medium', 'utm_campaign', 'utm_term', 'utm_content',\n 'fbclid', 'gclid', 'dclid', 'msclkid', 'yclid',\n 'ref', 'ref_src', 'source', 'medium', 'campaign'];\n \n function cleanUrl(url) {\n try {\n var u = new URL(url, window.location.origin);\n var changed = false;\n trackingParams.forEach(function(p) {\n if (u.searchParams.has(p)) {\n u.searchParams.delete(p);\n changed = true;\n }\n });\n return changed ? u.toString() : url;\n } catch (e) {\n return url;\n }\n }\n \n function cleanLinks() {\n document.querySelectorAll('a[href]').forEach(function(a) {\n var clean = cleanUrl(a.href);\n if (clean !== a.href) a.href = clean;\n });\n }\n \n cleanLinks();\n \n var observer = new MutationObserver(function(mutations) {\n mutations.forEach(function(m) {\n m.addedNodes.forEach(function(node) {\n if (node.nodeType === 1) {\n if (node.tagName === 'A') cleanLinks();\n node.querySelectorAll('a[href]').forEach(function(a) {\n var clean = cleanUrl(a.href);\n if (clean !== a.href) a.href = clean;\n });\n }\n });\n });\n });\n observer.observe(document.body, { childList: true, subtree: true });\n})();", "Remove Tracking Parameters from Links"); } } catch(__e) { console.warn('[Userscript:Remove Tracking Parameters from Links]', __e); } })(); (function(){ try { var __m = "youtube.com"; var __re = new RegExp('^' + "youtube\\.com" + '
Skip to content

feat: batch address trees - #18

Merged
sergeytimoshin merged 33 commits into
jorrit/feat-add-testfrom
sergey/batch-address-updates
May 3, 2025
Merged

feat: batch address trees#18
sergeytimoshin merged 33 commits into
jorrit/feat-add-testfrom
sergey/batch-address-updates

Conversation

@sergeytimoshin

@sergeytimoshinsergeytimoshin commented Apr 3, 2025

Copy link
Copy Markdown

Overview

This pr adds support for batch address updates and introduces a new API endpoint getBatchAddressUpdateInfo

Changes:

API

  • NEW:getBatchAddressUpdateInfo endpoint.
    Retrieves addresses pending insertion from the new address queue, along with necessary proofs and context for batch updates.

Request:

tree: Hash
batch_size: u16

Response:

start_index: u64,
addresses: Vec<AddressQueueIndex>,
non_inclusion_proofs: Vec<MerkleContextWithNewAddressProof>,
subtrees: Vec<[u8; 32]>,

DB

Added address_queues table, corresponding models & migrations.
Table structure:

pub address: Vec<u8>,
pub tree: Vec<u8>,
pub queue_index: i64,

Events

Added PublicTransactionEventV2 structure and parsing logic which contains MerkleTreeSequenceNumberV2(tree_pubkey, queue_pubkey, tree_type, seq).

Tests

tests/integration_tests/batched_state_tree_tests.rs
Contains new test_batched_address_transactions test.

  • 50 addresses appended to the queue
  • 5 batch address append operations with batch_size=10 invoked

Asserts:

  • getBatchAddressUpdateInfo return non-empty queue after indexing of initial 50 txs and contain valid expected addresses.
  • Final root is checked against reference tree after applying batch address append txs.

TODO:

  • Add test for the case when we have 2 addresses in 1 ix.

@sergeytimoshin
sergeytimoshin marked this pull request as ready for review April 3, 2025 01:35
@sergeytimoshin
sergeytimoshinforce-pushed the sergey/batch-address-updates branch from b089102 to db382f7CompareApril 6, 2025 12:07
@sergeytimoshin
sergeytimoshinforce-pushed the sergey/batch-address-updates branch from ed8b8f0 to c24977fCompareApril 8, 2025 18:55
Comment threadsrc/ingester/parser/tx_event_parser.rs Outdated
Comment threadsrc/ingester/persist/persisted_indexed_merkle_tree.rs Outdated
Comment threadsrc/ingester/persist/persisted_indexed_merkle_tree.rs Outdated
Comment threadsrc/ingester/persist/leaf_node.rs Outdated
Comment on lines +123 to +136
for (new_address, seq) in event
.new_addresses
.iter()
.zip(event.address_sequence_numbers.iter())
{
let tree_info = TreeInfo::get(&new_address.mt_pubkey.to_string())
.ok_or(IngesterError::ParserError("Missing queue".to_string()))?
.clone();
state_update_event.addresses.push(AddressQueueUpdate {
tree: tree_info.tree.into(),
address: new_address.address,
queue_index: seq.seq,
});
}

@ananas-blockananas-blockApr 10, 2025

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggested change
for(new_address, seq)in event
.new_addresses
.iter()
.zip(event.address_sequence_numbers.iter())
{
let tree_info = TreeInfo::get(&new_address.mt_pubkey.to_string())
.ok_or(IngesterError::ParserError("Missing queue".to_string()))?
.clone();
state_update_event.addresses.push(AddressQueueUpdate{
tree: tree_info.tree.into(),
address: new_address.address,
queue_index: seq.seq,
});
}
for(new_address, seq)in event
.new_addresses
.iter()
.zip(event.address_sequence_numbers.iter())
{
state_update_event.addresses.push(AddressQueueUpdate{
tree: new_address.mt_pubkey.into(),
address: new_address.address,
queue_index: seq.seq,
});
}

Comment threadsrc/ingester/parser/tx_event_parser_v2.rs Outdated
Comment threadsrc/ingester/parser/tx_event_parser_v2.rs Outdated
Comment threadsrc/ingester/persist/persisted_state_tree.rs
Comment threadsrc/ingester/persist/mod.rs Outdated
Comment threadsrc/ingester/parser/tx_event_parser.rs Outdated
Comment threadsrc/ingester/parser/tx_event_parser.rs Outdated
Comment threadsrc/ingester/persist/persisted_indexed_merkle_tree.rs Outdated
}

pub const MAX_HEIGHT: usize = 32;
pub async fn get_subtrees(

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

shouldn't this be in persisted_indexed_merkle_tree ?

Copy link
Copy Markdown
Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I think it makes sense to leave it here, because persisted_state_tree stores nodes for indexed trees, and persisted_indexed_merkle_tree works more like indexed array.

Comment threadtests/integration_tests/batched_state_tree_tests.rs Outdated
Comment threadtests/integration_tests/batched_state_tree_tests.rs Outdated
Comment threadtests/integration_tests/batched_state_tree_tests.rs Outdated

@ananas-blockananas-block left a comment

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Thanks!
TLDR on comments:

  1. are we sure queue indices are set correctly if we insert 2 addresses in the same tree in the same tx?
  2. found some dead code in parse_public_transaction_event
  3. PublicTransactionEvent::V1 maybe we can get away with less diff by implementing From
  4. Final root assert in test
  5. couple smaller improvements

Comment threadCargo.toml
@@ -79,18 +77,15 @@ solana-program = "1.18.0"
solana-sdk = "1.18.0"

Copy link
Copy Markdown
Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Try to remove

Comment threadCargo.toml Outdated
…d address is in the AddressQueue but not in tree yet, we should return error. For V1 trees we still return non-inclusion proof, because we don't have information about V1 queue.
* Add offset as request parameter to get_batch_address_update_info.
* Various cleanups
@sergeytimoshinsergeytimoshin changed the title feat: batch address trees supportfeat: batch address treesApr 30, 2025
Comment threadCargo.toml
light-compressed-account = { git = "https://github.com/Lightprotocol/light-protocol", rev = "368f9f08272db78c74b2ade1a1c2fead27dd0a96" }
light-concurrent-merkle-tree = { git = "https://github.com/Lightprotocol/light-protocol", rev = "368f9f08272db78c74b2ade1a1c2fead27dd0a96" }
light-hasher = "2.0.0"
light-hasher = { git = "https://github.com/Lightprotocol/light-protocol", rev = "368f9f08272db78c74b2ade1a1c2fead27dd0a96" }

@ananas-blockananas-blockMay 2, 2025

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

why was this necessary?
(I didn't want to release light-hasher again.)

Copy link
Copy Markdown
Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

light-merkle-tree-reference has light-hasher dependency as well => there are multiple different versions of crate light_hasher in the dependency graph

@sergeytimoshin
sergeytimoshin merged commit 61627ae into jorrit/feat-add-testMay 3, 2025
Sign up for freeto join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants

@sergeytimoshin@ananas-block
, 'i'); if (__m === '*' || __re.test(location.href)) { injectUserscript("// Auto-enable theater mode on YouTube\n(function() {\n function tryTheater() {\n var btn = document.querySelector('button[aria-label=\"Theater mode\"], ytd-player #player button[title=\"Theater mode\"]');\n if (btn && !btn.classList.contains('activated')) {\n btn.click();\n }\n }\n \n // Try immediately\n tryTheater();\n \n // Try after navigation (SPA)\n var lastUrl = location.href;\n setInterval(function() {\n if (location.href !== lastUrl) {\n lastUrl = location.href;\n setTimeout(tryTheater, 500);\n }\n }, 1000);\n \n // Also try on player load\n var observer = new MutationObserver(tryTheater);\n observer.observe(document.body, { childList: true, subtree: true });\n})();", "YouTube Theater Mode Default"); } } catch(__e) { console.warn('[Userscript:YouTube Theater Mode Default]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + '
Skip to content

feat: batch address trees - #18

Merged
sergeytimoshin merged 33 commits into
jorrit/feat-add-testfrom
sergey/batch-address-updates
May 3, 2025
Merged

feat: batch address trees#18
sergeytimoshin merged 33 commits into
jorrit/feat-add-testfrom
sergey/batch-address-updates

Conversation

@sergeytimoshin

@sergeytimoshinsergeytimoshin commented Apr 3, 2025

Copy link
Copy Markdown

Overview

This pr adds support for batch address updates and introduces a new API endpoint getBatchAddressUpdateInfo

Changes:

API

  • NEW:getBatchAddressUpdateInfo endpoint.
    Retrieves addresses pending insertion from the new address queue, along with necessary proofs and context for batch updates.

Request:

tree: Hash
batch_size: u16

Response:

start_index: u64,
addresses: Vec<AddressQueueIndex>,
non_inclusion_proofs: Vec<MerkleContextWithNewAddressProof>,
subtrees: Vec<[u8; 32]>,

DB

Added address_queues table, corresponding models & migrations.
Table structure:

pub address: Vec<u8>,
pub tree: Vec<u8>,
pub queue_index: i64,

Events

Added PublicTransactionEventV2 structure and parsing logic which contains MerkleTreeSequenceNumberV2(tree_pubkey, queue_pubkey, tree_type, seq).

Tests

tests/integration_tests/batched_state_tree_tests.rs
Contains new test_batched_address_transactions test.

  • 50 addresses appended to the queue
  • 5 batch address append operations with batch_size=10 invoked

Asserts:

  • getBatchAddressUpdateInfo return non-empty queue after indexing of initial 50 txs and contain valid expected addresses.
  • Final root is checked against reference tree after applying batch address append txs.

TODO:

  • Add test for the case when we have 2 addresses in 1 ix.

@sergeytimoshin
sergeytimoshin marked this pull request as ready for review April 3, 2025 01:35
@sergeytimoshin
sergeytimoshinforce-pushed the sergey/batch-address-updates branch from b089102 to db382f7CompareApril 6, 2025 12:07
@sergeytimoshin
sergeytimoshinforce-pushed the sergey/batch-address-updates branch from ed8b8f0 to c24977fCompareApril 8, 2025 18:55
Comment threadsrc/ingester/parser/tx_event_parser.rs Outdated
Comment threadsrc/ingester/persist/persisted_indexed_merkle_tree.rs Outdated
Comment threadsrc/ingester/persist/persisted_indexed_merkle_tree.rs Outdated
Comment threadsrc/ingester/persist/leaf_node.rs Outdated
Comment on lines +123 to +136
for (new_address, seq) in event
.new_addresses
.iter()
.zip(event.address_sequence_numbers.iter())
{
let tree_info = TreeInfo::get(&new_address.mt_pubkey.to_string())
.ok_or(IngesterError::ParserError("Missing queue".to_string()))?
.clone();
state_update_event.addresses.push(AddressQueueUpdate {
tree: tree_info.tree.into(),
address: new_address.address,
queue_index: seq.seq,
});
}

@ananas-blockananas-blockApr 10, 2025

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggested change
for(new_address, seq)in event
.new_addresses
.iter()
.zip(event.address_sequence_numbers.iter())
{
let tree_info = TreeInfo::get(&new_address.mt_pubkey.to_string())
.ok_or(IngesterError::ParserError("Missing queue".to_string()))?
.clone();
state_update_event.addresses.push(AddressQueueUpdate{
tree: tree_info.tree.into(),
address: new_address.address,
queue_index: seq.seq,
});
}
for(new_address, seq)in event
.new_addresses
.iter()
.zip(event.address_sequence_numbers.iter())
{
state_update_event.addresses.push(AddressQueueUpdate{
tree: new_address.mt_pubkey.into(),
address: new_address.address,
queue_index: seq.seq,
});
}

Comment threadsrc/ingester/parser/tx_event_parser_v2.rs Outdated
Comment threadsrc/ingester/parser/tx_event_parser_v2.rs Outdated
Comment threadsrc/ingester/persist/persisted_state_tree.rs
Comment threadsrc/ingester/persist/mod.rs Outdated
Comment threadsrc/ingester/parser/tx_event_parser.rs Outdated
Comment threadsrc/ingester/parser/tx_event_parser.rs Outdated
Comment threadsrc/ingester/persist/persisted_indexed_merkle_tree.rs Outdated
}

pub const MAX_HEIGHT: usize = 32;
pub async fn get_subtrees(

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

shouldn't this be in persisted_indexed_merkle_tree ?

Copy link
Copy Markdown
Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I think it makes sense to leave it here, because persisted_state_tree stores nodes for indexed trees, and persisted_indexed_merkle_tree works more like indexed array.

Comment threadtests/integration_tests/batched_state_tree_tests.rs Outdated
Comment threadtests/integration_tests/batched_state_tree_tests.rs Outdated
Comment threadtests/integration_tests/batched_state_tree_tests.rs Outdated

@ananas-blockananas-block left a comment

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Thanks!
TLDR on comments:

  1. are we sure queue indices are set correctly if we insert 2 addresses in the same tree in the same tx?
  2. found some dead code in parse_public_transaction_event
  3. PublicTransactionEvent::V1 maybe we can get away with less diff by implementing From
  4. Final root assert in test
  5. couple smaller improvements

Comment threadCargo.toml
@@ -79,18 +77,15 @@ solana-program = "1.18.0"
solana-sdk = "1.18.0"

Copy link
Copy Markdown
Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Try to remove

Comment threadCargo.toml Outdated
…d address is in the AddressQueue but not in tree yet, we should return error. For V1 trees we still return non-inclusion proof, because we don't have information about V1 queue.
* Add offset as request parameter to get_batch_address_update_info.
* Various cleanups
@sergeytimoshinsergeytimoshin changed the title feat: batch address trees supportfeat: batch address treesApr 30, 2025
Comment threadCargo.toml
light-compressed-account = { git = "https://github.com/Lightprotocol/light-protocol", rev = "368f9f08272db78c74b2ade1a1c2fead27dd0a96" }
light-concurrent-merkle-tree = { git = "https://github.com/Lightprotocol/light-protocol", rev = "368f9f08272db78c74b2ade1a1c2fead27dd0a96" }
light-hasher = "2.0.0"
light-hasher = { git = "https://github.com/Lightprotocol/light-protocol", rev = "368f9f08272db78c74b2ade1a1c2fead27dd0a96" }

@ananas-blockananas-blockMay 2, 2025

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

why was this necessary?
(I didn't want to release light-hasher again.)

Copy link
Copy Markdown
Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

light-merkle-tree-reference has light-hasher dependency as well => there are multiple different versions of crate light_hasher in the dependency graph

@sergeytimoshin
sergeytimoshin merged commit 61627ae into jorrit/feat-add-testMay 3, 2025
Sign up for freeto join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants

@sergeytimoshin@ananas-block
, 'i'); if (__m === '*' || __re.test(location.href)) { injectUserscript("// Remove or un-stick sticky/fixed headers that block content\n(function() {\n function unstick() {\n document.querySelectorAll('header, nav, [role=\"banner\"], .header, .navbar, .sticky, .fixed-top, [style*=\"position: fixed\"], [style*=\"position:sticky\"]').forEach(function(el) {\n if (el.style.position === 'fixed' || el.style.position === 'sticky' || \n getComputedStyle(el).position === 'fixed' || getComputedStyle(el).position === 'sticky') {\n el.style.position = 'static';\n el.style.top = 'auto';\n el.style.zIndex = 'auto';\n }\n });\n }\n \n unstick();\n \n var observer = new MutationObserver(unstick);\n observer.observe(document.body, { childList: true, subtree: true, attributes: true, attributeFilter: ['style', 'class'] });\n})();", "Kill Sticky Headers"); } } catch(__e) { console.warn('[Userscript:Kill Sticky Headers]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + '
Skip to content

feat: batch address trees - #18

Merged
sergeytimoshin merged 33 commits into
jorrit/feat-add-testfrom
sergey/batch-address-updates
May 3, 2025
Merged

feat: batch address trees#18
sergeytimoshin merged 33 commits into
jorrit/feat-add-testfrom
sergey/batch-address-updates

Conversation

@sergeytimoshin

@sergeytimoshinsergeytimoshin commented Apr 3, 2025

Copy link
Copy Markdown

Overview

This pr adds support for batch address updates and introduces a new API endpoint getBatchAddressUpdateInfo

Changes:

API

  • NEW:getBatchAddressUpdateInfo endpoint.
    Retrieves addresses pending insertion from the new address queue, along with necessary proofs and context for batch updates.

Request:

tree: Hash
batch_size: u16

Response:

start_index: u64,
addresses: Vec<AddressQueueIndex>,
non_inclusion_proofs: Vec<MerkleContextWithNewAddressProof>,
subtrees: Vec<[u8; 32]>,

DB

Added address_queues table, corresponding models & migrations.
Table structure:

pub address: Vec<u8>,
pub tree: Vec<u8>,
pub queue_index: i64,

Events

Added PublicTransactionEventV2 structure and parsing logic which contains MerkleTreeSequenceNumberV2(tree_pubkey, queue_pubkey, tree_type, seq).

Tests

tests/integration_tests/batched_state_tree_tests.rs
Contains new test_batched_address_transactions test.

  • 50 addresses appended to the queue
  • 5 batch address append operations with batch_size=10 invoked

Asserts:

  • getBatchAddressUpdateInfo return non-empty queue after indexing of initial 50 txs and contain valid expected addresses.
  • Final root is checked against reference tree after applying batch address append txs.

TODO:

  • Add test for the case when we have 2 addresses in 1 ix.

@sergeytimoshin
sergeytimoshin marked this pull request as ready for review April 3, 2025 01:35
@sergeytimoshin
sergeytimoshinforce-pushed the sergey/batch-address-updates branch from b089102 to db382f7CompareApril 6, 2025 12:07
@sergeytimoshin
sergeytimoshinforce-pushed the sergey/batch-address-updates branch from ed8b8f0 to c24977fCompareApril 8, 2025 18:55
Comment threadsrc/ingester/parser/tx_event_parser.rs Outdated
Comment threadsrc/ingester/persist/persisted_indexed_merkle_tree.rs Outdated
Comment threadsrc/ingester/persist/persisted_indexed_merkle_tree.rs Outdated
Comment threadsrc/ingester/persist/leaf_node.rs Outdated
Comment on lines +123 to +136
for (new_address, seq) in event
.new_addresses
.iter()
.zip(event.address_sequence_numbers.iter())
{
let tree_info = TreeInfo::get(&new_address.mt_pubkey.to_string())
.ok_or(IngesterError::ParserError("Missing queue".to_string()))?
.clone();
state_update_event.addresses.push(AddressQueueUpdate {
tree: tree_info.tree.into(),
address: new_address.address,
queue_index: seq.seq,
});
}

@ananas-blockananas-blockApr 10, 2025

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggested change
for(new_address, seq)in event
.new_addresses
.iter()
.zip(event.address_sequence_numbers.iter())
{
let tree_info = TreeInfo::get(&new_address.mt_pubkey.to_string())
.ok_or(IngesterError::ParserError("Missing queue".to_string()))?
.clone();
state_update_event.addresses.push(AddressQueueUpdate{
tree: tree_info.tree.into(),
address: new_address.address,
queue_index: seq.seq,
});
}
for(new_address, seq)in event
.new_addresses
.iter()
.zip(event.address_sequence_numbers.iter())
{
state_update_event.addresses.push(AddressQueueUpdate{
tree: new_address.mt_pubkey.into(),
address: new_address.address,
queue_index: seq.seq,
});
}

Comment threadsrc/ingester/parser/tx_event_parser_v2.rs Outdated
Comment threadsrc/ingester/parser/tx_event_parser_v2.rs Outdated
Comment threadsrc/ingester/persist/persisted_state_tree.rs
Comment threadsrc/ingester/persist/mod.rs Outdated
Comment threadsrc/ingester/parser/tx_event_parser.rs Outdated
Comment threadsrc/ingester/parser/tx_event_parser.rs Outdated
Comment threadsrc/ingester/persist/persisted_indexed_merkle_tree.rs Outdated
}

pub const MAX_HEIGHT: usize = 32;
pub async fn get_subtrees(

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

shouldn't this be in persisted_indexed_merkle_tree ?

Copy link
Copy Markdown
Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I think it makes sense to leave it here, because persisted_state_tree stores nodes for indexed trees, and persisted_indexed_merkle_tree works more like indexed array.

Comment threadtests/integration_tests/batched_state_tree_tests.rs Outdated
Comment threadtests/integration_tests/batched_state_tree_tests.rs Outdated
Comment threadtests/integration_tests/batched_state_tree_tests.rs Outdated

@ananas-blockananas-block left a comment

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Thanks!
TLDR on comments:

  1. are we sure queue indices are set correctly if we insert 2 addresses in the same tree in the same tx?
  2. found some dead code in parse_public_transaction_event
  3. PublicTransactionEvent::V1 maybe we can get away with less diff by implementing From
  4. Final root assert in test
  5. couple smaller improvements

Comment threadCargo.toml
@@ -79,18 +77,15 @@ solana-program = "1.18.0"
solana-sdk = "1.18.0"

Copy link
Copy Markdown
Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Try to remove

Comment threadCargo.toml Outdated
…d address is in the AddressQueue but not in tree yet, we should return error. For V1 trees we still return non-inclusion proof, because we don't have information about V1 queue.
* Add offset as request parameter to get_batch_address_update_info.
* Various cleanups
@sergeytimoshinsergeytimoshin changed the title feat: batch address trees supportfeat: batch address treesApr 30, 2025
Comment threadCargo.toml
light-compressed-account = { git = "https://github.com/Lightprotocol/light-protocol", rev = "368f9f08272db78c74b2ade1a1c2fead27dd0a96" }
light-concurrent-merkle-tree = { git = "https://github.com/Lightprotocol/light-protocol", rev = "368f9f08272db78c74b2ade1a1c2fead27dd0a96" }
light-hasher = "2.0.0"
light-hasher = { git = "https://github.com/Lightprotocol/light-protocol", rev = "368f9f08272db78c74b2ade1a1c2fead27dd0a96" }

@ananas-blockananas-blockMay 2, 2025

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

why was this necessary?
(I didn't want to release light-hasher again.)

Copy link
Copy Markdown
Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

light-merkle-tree-reference has light-hasher dependency as well => there are multiple different versions of crate light_hasher in the dependency graph

@sergeytimoshin
sergeytimoshin merged commit 61627ae into jorrit/feat-add-testMay 3, 2025
Sign up for freeto join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants

@sergeytimoshin@ananas-block
, 'i'); if (__m === '*' || __re.test(location.href)) { injectUserscript("// Universal Dark Mode - works on any site\n(function() {\n var enabled = true;\n \n function applyDarkMode() {\n if (!enabled) return;\n \n // Create style element if it doesn't exist\n var style = document.getElementById('universal-dark-mode-style');\n if (!style) {\n style = document.createElement('style');\n style.id = 'universal-dark-mode-style';\n document.head.appendChild(style);\n }\n \n // Dark mode CSS - inverts colors but preserves images/video\n style.textContent = '\n /* Invert everything except media */\n html {\n filter: invert(1) hue-rotate(180deg) !important;\n background: #1a1a2e !important;\n }\n \n /* Restore images, videos, iframes, canvas */\n img, video, iframe, canvas, svg, picture, [style*=\"background-image\"] {\n filter: invert(1) hue-rotate(180deg) !important;\n }\n \n /* Preserve specific elements that should not be inverted */\n .no-dark-mode, .no-dark-mode *,\n [data-theme=\"light\"], [data-theme=\"light\"],\n .ace_editor, .ace_editor *,\n .CodeMirror, .CodeMirror *,\n .monaco-editor, .monaco-editor *,\n .markdown-body pre, .markdown-body pre *,\n .highlight, .highlight *,\n pre code, pre code * {\n filter: none !important;\n }\n \n /* Fix common UI elements */\n .modal, .popup, .dropdown-menu, .tooltip, .popover {\n filter: invert(1) hue-rotate(180deg) !important;\n background: #2d2d44 !important;\n border-color: #444 !important;\n }\n \n /* Scrollbars */\n ::-webkit-scrollbar { background: #1a1a2e !important; }\n ::-webkit-scrollbar-thumb { background: #444 !important; }\n ::-webkit-scrollbar-thumb:hover { background: #555 !important; }\n \n /* Selection */\n ::selection { background: #4ecdc4 !important; color: #1a1a2e !important; }\n ::-moz-selection { background: #4ecdc4 !important; color: #1a1a2e !important; }\n ';\n }\n \n function removeDarkMode() {\n var style = document.getElementById('universal-dark-mode-style');\n if (style) style.remove();\n }\n \n // Toggle with Alt+Shift+D\n document.addEventListener('keydown', function(e) {\n if (e.altKey && e.shiftKey && e.key === 'D') {\n e.preventDefault();\n enabled = !enabled;\n if (enabled) {\n applyDarkMode();\n console.log('[Universal Dark Mode] Enabled');\n } else {\n removeDarkMode();\n console.log('[Universal Dark Mode] Disabled');\n }\n }\n });\n \n // Apply on load\n applyDarkMode();\n \n // Re-apply on dynamic content\n var observer = new MutationObserver(function(mutations) {\n if (enabled && !document.getElementById('universal-dark-mode-style')) {\n applyDarkMode();\n }\n });\n observer.observe(document.head, { childList: true });\n \n console.log('[Universal Dark Mode] Loaded - Press Alt+Shift+D to toggle');\n})();", "Universal Dark Mode"); } } catch(__e) { console.warn('[Userscript:Universal Dark Mode]', __e); } })(); })();
Skip to content

feat: batch address trees - #18

Merged
sergeytimoshin merged 33 commits into
jorrit/feat-add-testfrom
sergey/batch-address-updates
May 3, 2025
Merged

feat: batch address trees#18
sergeytimoshin merged 33 commits into
jorrit/feat-add-testfrom
sergey/batch-address-updates

Conversation

@sergeytimoshin

@sergeytimoshinsergeytimoshin commented Apr 3, 2025

Copy link
Copy Markdown

Overview

This pr adds support for batch address updates and introduces a new API endpoint getBatchAddressUpdateInfo

Changes:

API

  • NEW:getBatchAddressUpdateInfo endpoint.
    Retrieves addresses pending insertion from the new address queue, along with necessary proofs and context for batch updates.

Request:

tree: Hash
batch_size: u16

Response:

start_index: u64,
addresses: Vec<AddressQueueIndex>,
non_inclusion_proofs: Vec<MerkleContextWithNewAddressProof>,
subtrees: Vec<[u8; 32]>,

DB

Added address_queues table, corresponding models & migrations.
Table structure:

pub address: Vec<u8>,
pub tree: Vec<u8>,
pub queue_index: i64,

Events

Added PublicTransactionEventV2 structure and parsing logic which contains MerkleTreeSequenceNumberV2(tree_pubkey, queue_pubkey, tree_type, seq).

Tests

tests/integration_tests/batched_state_tree_tests.rs
Contains new test_batched_address_transactions test.

  • 50 addresses appended to the queue
  • 5 batch address append operations with batch_size=10 invoked

Asserts:

  • getBatchAddressUpdateInfo return non-empty queue after indexing of initial 50 txs and contain valid expected addresses.
  • Final root is checked against reference tree after applying batch address append txs.

TODO:

  • Add test for the case when we have 2 addresses in 1 ix.

@sergeytimoshin
sergeytimoshin marked this pull request as ready for review April 3, 2025 01:35
@sergeytimoshin
sergeytimoshinforce-pushed the sergey/batch-address-updates branch from b089102 to db382f7CompareApril 6, 2025 12:07
@sergeytimoshin
sergeytimoshinforce-pushed the sergey/batch-address-updates branch from ed8b8f0 to c24977fCompareApril 8, 2025 18:55
Comment threadsrc/ingester/parser/tx_event_parser.rs Outdated
Comment threadsrc/ingester/persist/persisted_indexed_merkle_tree.rs Outdated
Comment threadsrc/ingester/persist/persisted_indexed_merkle_tree.rs Outdated
Comment threadsrc/ingester/persist/leaf_node.rs Outdated
Comment on lines +123 to +136
for (new_address, seq) in event
.new_addresses
.iter()
.zip(event.address_sequence_numbers.iter())
{
let tree_info = TreeInfo::get(&new_address.mt_pubkey.to_string())
.ok_or(IngesterError::ParserError("Missing queue".to_string()))?
.clone();
state_update_event.addresses.push(AddressQueueUpdate {
tree: tree_info.tree.into(),
address: new_address.address,
queue_index: seq.seq,
});
}

@ananas-blockananas-blockApr 10, 2025

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggested change
for(new_address, seq)in event
.new_addresses
.iter()
.zip(event.address_sequence_numbers.iter())
{
let tree_info = TreeInfo::get(&new_address.mt_pubkey.to_string())
.ok_or(IngesterError::ParserError("Missing queue".to_string()))?
.clone();
state_update_event.addresses.push(AddressQueueUpdate{
tree: tree_info.tree.into(),
address: new_address.address,
queue_index: seq.seq,
});
}
for(new_address, seq)in event
.new_addresses
.iter()
.zip(event.address_sequence_numbers.iter())
{
state_update_event.addresses.push(AddressQueueUpdate{
tree: new_address.mt_pubkey.into(),
address: new_address.address,
queue_index: seq.seq,
});
}

Comment threadsrc/ingester/parser/tx_event_parser_v2.rs Outdated
Comment threadsrc/ingester/parser/tx_event_parser_v2.rs Outdated
Comment threadsrc/ingester/persist/persisted_state_tree.rs
Comment threadsrc/ingester/persist/mod.rs Outdated
Comment threadsrc/ingester/parser/tx_event_parser.rs Outdated
Comment threadsrc/ingester/parser/tx_event_parser.rs Outdated
Comment threadsrc/ingester/persist/persisted_indexed_merkle_tree.rs Outdated
}

pub const MAX_HEIGHT: usize = 32;
pub async fn get_subtrees(

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

shouldn't this be in persisted_indexed_merkle_tree ?

Copy link
Copy Markdown
Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I think it makes sense to leave it here, because persisted_state_tree stores nodes for indexed trees, and persisted_indexed_merkle_tree works more like indexed array.

Comment threadtests/integration_tests/batched_state_tree_tests.rs Outdated
Comment threadtests/integration_tests/batched_state_tree_tests.rs Outdated
Comment threadtests/integration_tests/batched_state_tree_tests.rs Outdated

@ananas-blockananas-block left a comment

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Thanks!
TLDR on comments:

  1. are we sure queue indices are set correctly if we insert 2 addresses in the same tree in the same tx?
  2. found some dead code in parse_public_transaction_event
  3. PublicTransactionEvent::V1 maybe we can get away with less diff by implementing From
  4. Final root assert in test
  5. couple smaller improvements

Comment threadCargo.toml
@@ -79,18 +77,15 @@ solana-program = "1.18.0"
solana-sdk = "1.18.0"

Copy link
Copy Markdown
Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Try to remove

Comment threadCargo.toml Outdated
…d address is in the AddressQueue but not in tree yet, we should return error. For V1 trees we still return non-inclusion proof, because we don't have information about V1 queue.
* Add offset as request parameter to get_batch_address_update_info.
* Various cleanups
@sergeytimoshinsergeytimoshin changed the title feat: batch address trees supportfeat: batch address treesApr 30, 2025
Comment threadCargo.toml
light-compressed-account = { git = "https://github.com/Lightprotocol/light-protocol", rev = "368f9f08272db78c74b2ade1a1c2fead27dd0a96" }
light-concurrent-merkle-tree = { git = "https://github.com/Lightprotocol/light-protocol", rev = "368f9f08272db78c74b2ade1a1c2fead27dd0a96" }
light-hasher = "2.0.0"
light-hasher = { git = "https://github.com/Lightprotocol/light-protocol", rev = "368f9f08272db78c74b2ade1a1c2fead27dd0a96" }

@ananas-blockananas-blockMay 2, 2025

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

why was this necessary?
(I didn't want to release light-hasher again.)

Copy link
Copy Markdown
Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

light-merkle-tree-reference has light-hasher dependency as well => there are multiple different versions of crate light_hasher in the dependency graph

@sergeytimoshin
sergeytimoshin merged commit 61627ae into jorrit/feat-add-testMay 3, 2025
Sign up for freeto join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants

@sergeytimoshin@ananas-block