-
Notifications
You must be signed in to change notification settings - Fork 0
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
add ADR002 to document the storage #57
Conversation
|
||
- It should be relatively easy to order these transactions, e.g., by ledger height. | ||
|
||
- Transactions that happen in the same block should not collide. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
What do you mean by "collide"? In the database sense, have the same primary key?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
yeah, basically, the block number cannot be used as the unique identifier
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
1 question, otw LGTM
Given all these requirements, we store every contract call in its own file called: | ||
|
||
``` | ||
${STOR}/${contractId}/${height}/entry-${txHash}.json |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
So you want to say anything about the content format of these files?
Even if it's just pointing to the implementation, I think it would be helpful.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
added a comment
Co-authored-by: Kukovec <[email protected]>
This PR documents a simple design for storing the transactions that are to be extracted by the fetcher.