Post your project for free and start receiving proposals from freelancers within minutes after publication!
DAG storage, Avalanche Blockchain
292 USD
I'm looking for someone who knows the blockchain avalanch.You need to help with (procurate) lifting the validator nodes, create submissions (Sabnet) according to certain rules.The main task:
there is the structure {Address-Balance}, having the address you can find addressBalance, parentAddress; the function read(address) returns the massive balances: addressBalance, parentBalance, parentParentBalance, ..., genesisBalance; the function write(parents, address, balance) verifies that the record with such address does not exist, if so, it adds the address to the DAG and connects it with all parents;
1 .How long will the chains be?Parent-Parent Record (How many levels of inheritance).2ndWhat kinds of requests to receive data from the Count?getGraphChain(address) -> address[]; where the address parameter will be only the address of the lower nod?Anyone in the chain?Is it necessary to return to the top (parents) or to all sides?Only such a type of request?Or other options?What controls other than duplicate addresses are needed?For example, do I need to control the graffiti on acyclicity?the correctness of structure etc.If the address is added, then you need to check if it is not in the current (where it is added) nod of the graph?Or all of the county?What to do if there is a double?Register with new parameters or reject the operation?It is also necessary to determine the price for transactions during transactions.The budget is discussed.
there is the structure {Address-Balance}, having the address you can find addressBalance, parentAddress; the function read(address) returns the massive balances: addressBalance, parentBalance, parentParentBalance, ..., genesisBalance; the function write(parents, address, balance) verifies that the record with such address does not exist, if so, it adds the address to the DAG and connects it with all parents;
1 .How long will the chains be?Parent-Parent Record (How many levels of inheritance).2ndWhat kinds of requests to receive data from the Count?getGraphChain(address) -> address[]; where the address parameter will be only the address of the lower nod?Anyone in the chain?Is it necessary to return to the top (parents) or to all sides?Only such a type of request?Or other options?What controls other than duplicate addresses are needed?For example, do I need to control the graffiti on acyclicity?the correctness of structure etc.If the address is added, then you need to check if it is not in the current (where it is added) nod of the graph?Or all of the county?What to do if there is a double?Register with new parameters or reject the operation?It is also necessary to determine the price for transactions during transactions.The budget is discussed.
Current freelance projects in the category Cryptocurrency & Blockchain
Need Smart Contract Engineer/Mentor
8000 USD
I want to find the Smart Contract Engineer/Mentor who has rich experience in Solidity smart contract development. Cryptocurrency & Blockchain, Engineering ∙ 1 day 12 hours back ∙ 10 proposals |
Bangkok