├── .gitignore ├── .npmignore ├── .travis.yml ├── LICENSE ├── README.md ├── benchmark ├── ethereum.js ├── multikey.js ├── package.json ├── radixTree-lmza.js ├── radixTree.js └── results.md ├── datastore.js ├── docs ├── index.md └── spec.md ├── fetch.js ├── index.js ├── package-lock.json ├── package.json ├── remoteDatastore.js ├── tests ├── index.js ├── jsonTests.js ├── remote.js └── tests.json └── treeNode.js /.gitignore: -------------------------------------------------------------------------------- 1 | node_modules 2 | testdb 3 | localdb 4 | -------------------------------------------------------------------------------- /.npmignore: -------------------------------------------------------------------------------- 1 | /tests 2 | /benchmark 3 | -------------------------------------------------------------------------------- /.travis.yml: -------------------------------------------------------------------------------- 1 | language: node_js 2 | node_js: 3 | - "8" 4 | env: 5 | global: 6 | - CXX=g++-4.8 7 | matrix: 8 | - TEST_SUITE=test 9 | addons: 10 | apt: 11 | sources: 12 | - ubuntu-toolchain-r-test 13 | packages: 14 | - g++-4.8 15 | matrix: 16 | fast_finish: true 17 | include: 18 | - os: linux 19 | node_js: "8" 20 | env: TEST_SUITE=coveralls 21 | - os: linux 22 | node_js: "8" 23 | env: TEST_SUITE=lint 24 | script: npm run $TEST_SUITE 25 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | [![NPM Package](https://img.shields.io/npm/v/dfinity-radix-tree.svg?style=flat-square)](https://www.npmjs.org/package/dfinity-radix-tree) 2 | [![Build Status](https://img.shields.io/travis/dfinity/js-dfinity-radix-tree.svg?branch=master&style=flat-square)](https://travis-ci.org/dfinity/js-dfinity-radix-tree) 3 | [![Coverage Status](https://img.shields.io/coveralls/dfinity/js-dfinity-radix-tree.svg?style=flat-square)](https://coveralls.io/dfinity/js-dfinity-radix-tree) 4 | 5 | [![js-standard-style](https://cdn.rawgit.com/feross/standard/master/badge.svg)](https://github.com/feross/standard) 6 | 7 | # Synopsis 8 | 9 | :evergreen_tree: This implements a binary merkle radix tree. The point of using a binary radix 10 | tree is that it generates smaller proof size then trees with larger radixes. 11 | This tree is well suited for storing large dictionaries of fairly random keys. 12 | And is optimized for storing keys of the same length. If the keys are not 13 | random better performance can be archived by hashing them first. It builds on 14 | top of [ipld-graph-builder](https://github.com/ipld/js-ipld-graph-builder) 15 | and the resulting state and proofs are generated using it. 16 | 17 | ## Install 18 | `npm install dfinity-radix-tree` 19 | 20 | ## Usage 21 | 22 | ```javascript 23 | const RadixTree = require('js-dfinity-radix-tree') 24 | const level = require('level') 25 | const db = level('./tempdb') 26 | 27 | async function main () { 28 | const prover = new RadixTree({ 29 | db: db 30 | }) 31 | 32 | await prover.set('test', Buffer.from('value')) 33 | await prover.set('doge', Buffer.from('coin')) 34 | await prover.set('cat', Buffer.from('dog')) 35 | await prover.set('monkey', Buffer.from('wrench')) 36 | 37 | // create a merkle root and save the tree 38 | const merkleroot = await prover.flush() 39 | 40 | // start a new Instance with the root 41 | const verifier = new RadixTree({ 42 | db: db, 43 | root: merkleroot 44 | }) 45 | 46 | const result = await verifier.get('monkey') 47 | console.log(result.value.toString()) 48 | } 49 | 50 | main() 51 | ``` 52 | ## API 53 | ['./docs/'](./docs/index.md) 54 | 55 | ## Specification 56 | ['./docs/spec.md'](./docs/spec.md) 57 | 58 | ## Benchmarks 59 | The result of the benchmarks show that the binary radix tree produces proofs on 60 | average 67% small then the Ethereum Trie with 100000 keys stored. 61 | 62 | ['./benchmarks/benchmarks.md'](./benchmark/results.md) 63 | 64 | ## License 65 | 66 | [**(C) 2018 DFINITY STIFTUNG**](http://dfinity.network) 67 | 68 | All code and designs are open sourced under GPL V3. 69 | 70 | ![image](https://user-images.githubusercontent.com/6457089/32753794-10f4cbc2-c883-11e7-8dcf-ff8088b38f9f.png) 71 | -------------------------------------------------------------------------------- /benchmark/ethereum.js: -------------------------------------------------------------------------------- 1 | var Trie = require('merkle-patricia-tree') 2 | const crypto = require('crypto') 3 | // const rlp = require('rlp') 4 | const level = require('level') 5 | const db = level('./eth-testdb') 6 | 7 | db._get = db.get 8 | let lookups = 0 9 | db.get = function (key, opts, cb) { 10 | lookups++ 11 | return db._get(key, opts, cb) 12 | } 13 | 14 | let trie = new Trie(db) 15 | 16 | const entries = 100000 17 | console.log('entries', entries) 18 | 19 | async function run () { 20 | 21 | let start = new Date() 22 | let hrstart = process.hrtime() 23 | 24 | for (let i = 0; i < entries; i++) { 25 | const key = crypto.createHash('sha256').update(i.toString()).digest().slice(0, 20) 26 | await new Promise((resolve, reject) => { 27 | trie.put(key, i, resolve) 28 | }) 29 | } 30 | 31 | let end = new Date() - start 32 | let hrend = process.hrtime(hrstart) 33 | 34 | console.info('state root creation time: %dms', end) 35 | console.info('state root creation time (hr): %ds %dms', hrend[0], hrend[1] / 1000000) 36 | 37 | start = new Date() 38 | hrstart = process.hrtime() 39 | 40 | console.log('root', trie.root.toString('hex')) 41 | 42 | let proofSize = 0 43 | for (let i = 0; i < entries; i++) { 44 | const key = crypto.createHash('sha256').update(i.toString()).digest().slice(0, 20) 45 | trie = new Trie(db, trie.root) 46 | const promise = new Promise((resolve, reject) => { 47 | trie.get(key, (err, value) => { 48 | // console.log(value) 49 | // let proof = stack.map(el => { 50 | // return el.raw 51 | // }) 52 | // let encoded = rlp.encode(proof) 53 | // proofSize += encoded.length 54 | resolve() 55 | }) 56 | }) 57 | await promise 58 | } 59 | 60 | end = new Date() - start 61 | hrend = process.hrtime(hrstart) 62 | 63 | console.info('read time: %dms', end) 64 | console.info('read time (hr): %ds %dms', hrend[0], hrend[1] / 1000000) 65 | console.info('db lookups', lookups) 66 | // console.log('rlp size', proofSize / entries) 67 | } 68 | 69 | run() 70 | -------------------------------------------------------------------------------- /benchmark/multikey.js: -------------------------------------------------------------------------------- 1 | const IPFS = require('ipfs') 2 | const crypto = require('crypto') 3 | const RadixTree = require('../') 4 | const cbor = require('borc') 5 | const zlib = require('zlib') 6 | 7 | // start ipfs 8 | const node = new IPFS({ 9 | start: false, 10 | repo: './ipfs-repo' 11 | }) 12 | 13 | node.on('ready', async () => { 14 | const tree = new RadixTree({ 15 | dag: node.dag, 16 | // root: { '/': 'zdpuArkpWFfw49S1tNLY26YNkHCoKt2CG7rJ6iCaqkcwsGqH7' } 17 | }) 18 | 19 | const entries = 10000 //5117051 20 | console.log('entries', entries) 21 | for (let i = 0; i < entries; i++) { 22 | const key = crypto.createHash('sha256').update(i.toString()).digest().slice(0, 20) 23 | await tree.set(key, i) 24 | } 25 | console.log('flushing') 26 | const sr = await tree.flush() 27 | console.log('done', sr) 28 | 29 | let proofSize = 0 30 | let compressedSize = 0 31 | 32 | const gzip = zlib.createGzip() 33 | gzip.on('data', (data) => { 34 | compressedSize += data.length 35 | }) 36 | 37 | const numOfKeys = 3 38 | for (let i = 0; i < numOfKeys; i++) { 39 | const key = crypto.createHash('sha256').update(i.toString()).digest().slice(0, 20) 40 | await tree.get(key) 41 | } 42 | 43 | const encoded = cbor.encode(tree.root) 44 | proofSize += encoded.length 45 | 46 | const promise = new Promise((resolve, reject) => { 47 | gzip.on('end', () => { 48 | resolve() 49 | }) 50 | }) 51 | gzip.end(encoded) 52 | await promise 53 | console.log('cbor size', proofSize) 54 | console.log('compressed size', compressedSize) 55 | }) 56 | 57 | // if (i % 10000 === 0) { 58 | // console.log(i) 59 | // console.log(JSON.stringify(tree.root, null, 2)) 60 | // try { 61 | // let start = new Date() 62 | // let hrstart = process.hrtime() 63 | // await tree.flush() 64 | // const end = new Date() - start 65 | // const hrend = process.hrtime(hrstart) 66 | 67 | // console.info('Execution time: %dms', end) 68 | // console.info('Execution time (hr): %ds %dms', hrend[0], hrend[1] / 1000000) 69 | // console.log(tree.root) 70 | // start = new Date() 71 | // hrstart = process.hrtime() 72 | // } catch (e) { 73 | // console.log(e) 74 | // } 75 | // } 76 | -------------------------------------------------------------------------------- /benchmark/package.json: -------------------------------------------------------------------------------- 1 | { 2 | "name": "benchmark", 3 | "version": "1.0.0", 4 | "description": "", 5 | "main": "index.js", 6 | "scripts": { 7 | "test": "echo \"Error: no test specified\" && exit 1" 8 | }, 9 | "author": "", 10 | "license": "ISC", 11 | "dependencies": { 12 | "bn.js": "^4.11.8", 13 | "borc": "^2.0.2", 14 | "lzma": "^2.3.2", 15 | "merkle-patricia-tree": "^2.2.0" 16 | } 17 | } 18 | -------------------------------------------------------------------------------- /benchmark/radixTree-lmza.js: -------------------------------------------------------------------------------- 1 | const IPFS = require('ipfs') 2 | const crypto = require('crypto') 3 | const RadixTree = require('../') 4 | const cbor = require('borc') 5 | const lzma = require('lzma') 6 | 7 | // start ipfs 8 | const node = new IPFS({ 9 | start: false, 10 | repo: './ipfs-repo' 11 | }) 12 | 13 | node.on('ready', async () => { 14 | const tree = new RadixTree({ 15 | dag: node.dag, 16 | // root: { '/': 'zdpuAmHPs6YDFyFoaUHg5YgyNHoUGKzug5n5ZzdjUrk36Gnzg'} 17 | }) 18 | 19 | const entries = 10000 //5117051 20 | console.log('entries', entries) 21 | for (let i = 0; i < entries; i++) { 22 | const key = crypto.createHash('sha256').update(i.toString()).digest().slice(0, 20) 23 | await tree.set(key, i) 24 | } 25 | console.log('flushing') 26 | const sr = await tree.flush() 27 | console.log('done', sr) 28 | 29 | let proofSize = 0 30 | let compressedSize = 0 31 | const root = tree.root 32 | 33 | for (let i = 0; i < entries; i++) { 34 | const tree = new RadixTree({ 35 | dag: node.dag, 36 | root: {'/': root['/']} 37 | }) 38 | const key = crypto.createHash('sha256').update(i.toString()).digest().slice(0, 20) 39 | await tree.get(key) 40 | removeLink(tree.root['/']) 41 | const encoded = cbor.encode(tree.root['/']) 42 | proofSize += encoded.length 43 | compressedSize += lzma.compress(encoded, 9).length 44 | } 45 | console.log('cbor size', proofSize / entries) 46 | console.log('compressed size', compressedSize / entries) 47 | }) 48 | 49 | function removeLink (root) { 50 | if (root) { 51 | if (root[0]) { 52 | root[0] = root[0]['/'] 53 | } 54 | 55 | if (root[1]) { 56 | root[1] = root[1]['/'] 57 | } 58 | 59 | if (!Buffer.isBuffer(root[1])) { 60 | removeLink(root[1]) 61 | } 62 | 63 | if (!Buffer.isBuffer(root[0])) { 64 | removeLink(root[0]) 65 | } 66 | } 67 | } 68 | -------------------------------------------------------------------------------- /benchmark/radixTree.js: -------------------------------------------------------------------------------- 1 | const crypto = require('crypto') 2 | const RadixTree = require('../') 3 | const cbor = require('borc') 4 | const zlib = require('zlib') 5 | 6 | const level = require('level') 7 | const db = level('./testdb') 8 | const DAG = require('../dag.js') 9 | const proof = require('../proofStore.js') 10 | 11 | const dag = new DAG(db) 12 | 13 | async function main () { 14 | const tree = new RadixTree({ 15 | dag: dag, 16 | // root: { '/': 'zdpuArkpWFfw49S1tNLY26YNkHCoKt2CG7rJ6iCaqkcwsGqH7' } 17 | }) 18 | 19 | const entries = 100000 // 5117051 20 | console.log('entries', entries) 21 | for (let i = 0; i < entries; i++) { 22 | const key = crypto.createHash('sha256').update(i.toString()).digest().slice(0, 20) 23 | await tree.set(key, i) 24 | } 25 | console.log('flushing') 26 | const sr = await tree.flush() 27 | console.log('done', sr['/'].toString('hex')) 28 | 29 | let proofSize = 0 30 | let binaryProofSize = 0 31 | let compressedSize = 0 32 | 33 | for (let i = 0; i < entries; i++) { 34 | const tree = new RadixTree({ 35 | dag: dag, 36 | root: {'/': sr['/']} 37 | }) 38 | const key = crypto.createHash('sha256').update(i.toString()).digest().slice(0, 20) 39 | await tree.get(key) 40 | const encoded = cbor.encode(tree.root) 41 | proofSize += encoded.length 42 | const binary = proof.encodeProof(tree.root['/']) 43 | // console.log(JSON.stringify(tree.root, null, 2)) 44 | // console.log(binary) 45 | binaryProofSize += binary.length 46 | 47 | const gzip = zlib.createGzip() 48 | gzip.on('data', (data) => { 49 | compressedSize += data.length 50 | }) 51 | const promise = new Promise((resolve, reject) => { 52 | gzip.on('end', () => { 53 | resolve() 54 | }) 55 | }) 56 | gzip.end(encoded) 57 | await promise 58 | } 59 | console.log('cbor size', proofSize / entries) 60 | console.log('cbor compressed size', compressedSize / entries) 61 | console.log('binary', binaryProofSize / entries) 62 | } 63 | main() 64 | 65 | // if (i % 10000 === 0) { 66 | // console.log(i) 67 | // console.log(JSON.stringify(tree.root, null, 2)) 68 | // try { 69 | // let start = new Date() 70 | // let hrstart = process.hrtime() 71 | // await tree.flush() 72 | // const end = new Date() - start 73 | // const hrend = process.hrtime(hrstart) 74 | 75 | // console.info('Execution time: %dms', end) 76 | // console.info('Execution time (hr): %ds %dms', hrend[0], hrend[1] / 1000000) 77 | // console.log(tree.root) 78 | // start = new Date() 79 | // hrstart = process.hrtime() 80 | // } catch (e) { 81 | // console.log(e) 82 | // } 83 | // } 84 | -------------------------------------------------------------------------------- /benchmark/results.md: -------------------------------------------------------------------------------- 1 | This compares the binary radix tree's proof to Ethereum tree. The proofs where 2 | encoded in cbor and compressed with gzip. Etherum's proof where encoded using 3 | rlp. The compressed results for Ethereum where not recoded since they where 4 | larger then the uncompressed proofs 5 | 6 | ## 10000 keys 7 | ### Binary Radix Tree 8 | ``` 9 | cbor 660 bytes 10 | compressed size 572 11 | ``` 12 | 13 | ### Ethereum 14 | ``` 15 | rlp 1649 bytes 16 | ``` 17 | 18 | Diff 65% 19 | 20 | ## 20000 keys 21 | ### Binary Radix Tree 22 | ``` 23 | cbor 705 bytes 24 | compressed size 607 25 | ``` 26 | 27 | ### Ethereum 28 | ``` 29 | rlp 1772 bytes 30 | ``` 31 | 32 | Diff 66% 33 | 34 | ## 30000 keys 35 | ### Binary Radix Tree 36 | ``` 37 | cbor 731 bytes 38 | compressed 628 size 39 | ``` 40 | 41 | ### Ethereum 42 | ``` 43 | rlp 1829 bytes 44 | ``` 45 | 46 | Diff 66% 47 | 48 | ## 40000 keys 49 | ### Binary Radix Tree 50 | ``` 51 | cbor 749 bytes 52 | compressed 643 size 53 | ``` 54 | 55 | ### Ethereum 56 | ``` 57 | rlp 1876 bytes 58 | ``` 59 | 60 | Diff 66% 61 | 62 | ## 50000 keys 63 | ### Binary Radix Tree 64 | ``` 65 | cbor 764 bytes 66 | compressed 654 size 67 | ``` 68 | 69 | ### Ethereum 70 | ``` 71 | rlp 1917 bytes 72 | ``` 73 | 74 | Diff 66% 75 | 76 | ## 60000 keys 77 | ### Binary Radix Tree 78 | ``` 79 | cbor 776 bytes 80 | compressed 663 size 81 | ``` 82 | 83 | ### Ethereum 84 | ``` 85 | rlp 1956 bytes 86 | ``` 87 | 88 | ## 70000 keys 89 | ### Binary Radix Tree 90 | ``` 91 | cbor 786 bytes 92 | compressed 671 size 93 | ``` 94 | 95 | ### Ethereum 96 | ``` 97 | rlp 1990 bytes 98 | ``` 99 | 100 | Diff 66% 101 | 102 | ## 80000 keys 103 | ### Binary Radix Tree 104 | ``` 105 | cbor 795 bytes 106 | compressed 679 size 107 | ``` 108 | 109 | ### Ethereum 110 | ``` 111 | rlp 2021 bytes 112 | ``` 113 | 114 | Diff 66% 115 | 116 | ## 90000 keys 117 | ### Binary Radix Tree 118 | ``` 119 | cbor 803 bytes 120 | compressed 685 size 121 | ``` 122 | 123 | ### Ethereum 124 | ``` 125 | rlp 2050 bytes 126 | ``` 127 | 128 | Diff 67% 129 | 130 | ## 100000 keys 131 | ### Binary Radix Tree 132 | ``` 133 | cbor 810 bytes 134 | compressed 691 size 135 | ``` 136 | 137 | ### Ethereum 138 | ``` 139 | rlp 2075 bytes 140 | ``` 141 | 142 | Diff 67% 143 | 144 | # multikey 145 | The following show that multikey are more compact the single key proofs . Each 146 | tree was populated with 10000 keys 147 | 148 | ## Two Keys Proofs 149 | ``` 150 | cbor 1088 151 | compressed 916 152 | ``` 153 | 154 | ## Three Keys Proofs 155 | ``` 156 | cbor 1675 157 | compressed 1381 158 | ``` 159 | ## Four Keys Proofs 160 | ``` 161 | cbor 2221 162 | compressed 1801 163 | ``` 164 | -------------------------------------------------------------------------------- /datastore.js: -------------------------------------------------------------------------------- 1 | const Buffer = require('safe-buffer').Buffer 2 | const crypto = require('crypto') 3 | const DAG = require('ipld-graph-builder/datastore.js') 4 | const cbor = require('borc') 5 | const node = require('./treeNode.js') 6 | 7 | const HASH_LEN = 20 8 | 9 | module.exports = class TreeDAG extends DAG { 10 | constructor (dag, decoder = new cbor.Decoder({ 11 | tags: { 12 | 42: val => { 13 | return { 14 | '/': val 15 | } 16 | } 17 | }, 18 | size: 4194304 // set heap usage to 4MB 19 | })) { 20 | super(dag) 21 | this.decoder = decoder 22 | } 23 | 24 | async put (val) { 25 | const encoded = node.encodeNode(val) 26 | const key = await TreeDAG.getMerkleLink(encoded) 27 | 28 | return new Promise((resolve, reject) => { 29 | this._dag.put(key, encoded.toString('hex'), () => { 30 | resolve(key) 31 | }) 32 | }) 33 | } 34 | 35 | get (link) { 36 | return new Promise((resolve, reject) => { 37 | this._dag.get(link, (err, val) => { 38 | if (err) { 39 | reject(err) 40 | } else { 41 | val = Buffer.from(val, 'hex') 42 | const decoded = this.decoder.decodeFirst(val) 43 | resolve(decoded) 44 | } 45 | }) 46 | }) 47 | } 48 | 49 | static isValidLink (link) { 50 | return Buffer.isBuffer(link) && link.length === HASH_LEN 51 | } 52 | 53 | static getMerkleLink (buf) { 54 | const hash = crypto.createHash('sha256') 55 | hash.update(buf) 56 | return hash.digest().slice(0, HASH_LEN) 57 | } 58 | } 59 | -------------------------------------------------------------------------------- /docs/index.md: -------------------------------------------------------------------------------- 1 | 2 | 3 | ### Table of Contents 4 | 5 | - [constructor][1] 6 | - [root][2] 7 | - [get][3] 8 | - [set][4] 9 | - [delete][5] 10 | - [done][6] 11 | - [flush][7] 12 | - [rootExists][8] 13 | - [emptyTreeState][9] 14 | - [ArrayConstructor][10] 15 | - [getMerkleLink][11] 16 | 17 | ## constructor 18 | 19 | [index.js:18-25][12] 20 | 21 | **Parameters** 22 | 23 | - `opts` 24 | - `opts.root` {object} a merkle root to a radix tree. If none, RadixTree will create an new root. 25 | - `opts.db` {object} a level db instance; alternatively, `opts.graph` can be used 26 | - `opts.graph` {object} an instance of [ipld-graph-builder][13]; alternatively, `opts.dag` can be used 27 | - `opts.dag` {object} an instance if [ipfs.dag][14]. If there is no `opts.graph` this will be used to create a new graph instance. 28 | - `opts.decoder` {object} a cbor decoder 29 | 30 | ## root 31 | 32 | [index.js:31-33][15] 33 | 34 | the root of the tree 35 | 36 | Type: [Buffer][16] 37 | 38 | ## get 39 | 40 | [index.js:44-48][17] 41 | 42 | gets a value given a key 43 | 44 | **Parameters** 45 | 46 | - `key` **any** 47 | 48 | Returns **[Promise][18]** 49 | 50 | ## set 51 | 52 | [index.js:98-101][19] 53 | 54 | stores a value at a given key returning the tree node that the value was saved in 55 | 56 | **Parameters** 57 | 58 | - `key` **any** 59 | - `value` 60 | 61 | Returns **[Promise][18]** 62 | 63 | ## delete 64 | 65 | [index.js:150-153][20] 66 | 67 | smContainer.js deletes a value at a given key 68 | 69 | **Parameters** 70 | 71 | - `key` **any** 72 | 73 | Returns **[Promise][18]** 74 | 75 | ## done 76 | 77 | [index.js:212-218][21] 78 | 79 | returns a promise that resolve when the tree is done with all of its writes 80 | 81 | Returns **[Promise][18]** 82 | 83 | ## flush 84 | 85 | [index.js:234-238][22] 86 | 87 | creates a merkle root for the current tree and stores the data persistently 88 | 89 | Returns **[Promise][18]** 90 | 91 | ## rootExists 92 | 93 | [index.js:250-258][23] 94 | 95 | Checks if a given root exists or not 96 | 97 | **Parameters** 98 | 99 | - `root` **[Buffer][16]** 100 | 101 | Returns **[Promise][18]<[boolean][24]>** 102 | 103 | ## emptyTreeState 104 | 105 | [index.js:279-281][25] 106 | 107 | returns the state of an empty tree 108 | 109 | ## ArrayConstructor 110 | 111 | [index.js:287-289][26] 112 | 113 | returns an Uint1Array constructor which is used to represent keys 114 | 115 | Returns **[object][27]** 116 | 117 | ## getMerkleLink 118 | 119 | [index.js:296-298][28] 120 | 121 | returns a merkle link for some given data 122 | 123 | **Parameters** 124 | 125 | - `data` **[Buffer][16]** the data which you would like to hash 126 | 127 | Returns **[Buffer][16]** 128 | 129 | [1]: #constructor 130 | 131 | [2]: #root 132 | 133 | [3]: #get 134 | 135 | [4]: #set 136 | 137 | [5]: #delete 138 | 139 | [6]: #done 140 | 141 | [7]: #flush 142 | 143 | [8]: #rootexists 144 | 145 | [9]: #emptytreestate 146 | 147 | [10]: #arrayconstructor 148 | 149 | [11]: #getmerklelink 150 | 151 | [12]: https://github.com/dfinity/js-dfinity-radix-tree/blob/588bfeefe36f73792935e70a42db416f2a0d838c/index.js#L18-L25 "Source code on GitHub" 152 | 153 | [13]: https://github.com/ipld/js-ipld-graph-builder 154 | 155 | [14]: https://github.com/ipfs/js-ipfs#dag 156 | 157 | [15]: https://github.com/dfinity/js-dfinity-radix-tree/blob/588bfeefe36f73792935e70a42db416f2a0d838c/index.js#L31-L33 "Source code on GitHub" 158 | 159 | [16]: https://nodejs.org/api/buffer.html 160 | 161 | [17]: https://github.com/dfinity/js-dfinity-radix-tree/blob/588bfeefe36f73792935e70a42db416f2a0d838c/index.js#L44-L48 "Source code on GitHub" 162 | 163 | [18]: https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Promise 164 | 165 | [19]: https://github.com/dfinity/js-dfinity-radix-tree/blob/588bfeefe36f73792935e70a42db416f2a0d838c/index.js#L98-L101 "Source code on GitHub" 166 | 167 | [20]: https://github.com/dfinity/js-dfinity-radix-tree/blob/588bfeefe36f73792935e70a42db416f2a0d838c/index.js#L150-L153 "Source code on GitHub" 168 | 169 | [21]: https://github.com/dfinity/js-dfinity-radix-tree/blob/588bfeefe36f73792935e70a42db416f2a0d838c/index.js#L212-L218 "Source code on GitHub" 170 | 171 | [22]: https://github.com/dfinity/js-dfinity-radix-tree/blob/588bfeefe36f73792935e70a42db416f2a0d838c/index.js#L234-L238 "Source code on GitHub" 172 | 173 | [23]: https://github.com/dfinity/js-dfinity-radix-tree/blob/588bfeefe36f73792935e70a42db416f2a0d838c/index.js#L250-L258 "Source code on GitHub" 174 | 175 | [24]: https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Boolean 176 | 177 | [25]: https://github.com/dfinity/js-dfinity-radix-tree/blob/588bfeefe36f73792935e70a42db416f2a0d838c/index.js#L279-L281 "Source code on GitHub" 178 | 179 | [26]: https://github.com/dfinity/js-dfinity-radix-tree/blob/588bfeefe36f73792935e70a42db416f2a0d838c/index.js#L287-L289 "Source code on GitHub" 180 | 181 | [27]: https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Object 182 | 183 | [28]: https://github.com/dfinity/js-dfinity-radix-tree/blob/588bfeefe36f73792935e70a42db416f2a0d838c/index.js#L296-L298 "Source code on GitHub" 184 | -------------------------------------------------------------------------------- /docs/spec.md: -------------------------------------------------------------------------------- 1 | This document provides the structure of the [Dfinity Radix Tree.](https://ipfs.io/ipns/QmdJiuMWp2FxyaerfLrtdLF6Nr1EWpL7dPAxA9oKSPYYgV/wiki/Radix_tree.html) 2 | The radix tree data structure stores the key-values; the tree is an instance of nodes that contains the value and the key is the path to the node in the tree. All values are encoded with [CBOR](http://cbor.io) 3 | 4 | ## Node 5 | Each node has a type and contains at most four elements: 6 | "extension", "left branch", "right branch" and "value". 7 | 8 | ``` 9 | node : = TYPE | EXTENSION | LBRANCH | RBRANCH | VALUE 10 | ``` 11 | 12 | ### Type 13 | The type field contains a byte. The first 4 bits are padded to zero while the Node is stored in the tree. These bits are reserved as indicators of type when sending the nodes to other clients which we will describe later. The last 4 bits are used to signify which elements a node contains. The bit field is defined a the following 14 | 15 | ``` 16 | Type := 0 | 0 | 0 | 0 | HasEXTENSION | HasLBRANCH | HasRBRANCH | HasVALUE 17 | ``` 18 | 19 | For example a node that contained a left branch and a value would have a prefix byte of 00000101 or 0x07 20 | 21 | The full encoded node would then look something like. `0x07<20_bytes_for_lbranch>` 22 | 23 | 24 | ### Branches 25 | 26 | The branch elements point to the next node in the tree using a merkle link. 27 | A merkle link is defined by the first 20 bytes of the result SHA2-256 of an encoded node. 28 | 29 | 30 | ``` 31 | branch : = 32 | ``` 33 | 34 | ``` 35 | link := SHA2(encoded_node)[0..20] 36 | ``` 37 | 38 | 39 | ### Extensions 40 | For optimization, we use the Extension element that encodes shared paths in the tree. Extensions are defined as 41 | 42 | ``` 43 | extension := Length | ExtensionValue 44 | 45 | ``` 46 | Where the length is the number of bits that extension represents. This varuint32 47 | encoded with leb128. And the extension is bit array padded with 0's to the nearest byte. 48 | 49 | For example if the binary keys [0, 0, 1, 1] and 50 | [0, 0, 1, 0] have a shared path of [0, 0, 1]. The extension node would therefor be 51 | 52 | `0x03, 0x04` 53 | 54 | where 3 is the the shared path length and the `0x04` is the shared path encoded 55 | as a little endian byte array. 56 | -------------------------------------------------------------------------------- /fetch.js: -------------------------------------------------------------------------------- 1 | module.exports = self.fetch 2 | -------------------------------------------------------------------------------- /index.js: -------------------------------------------------------------------------------- 1 | const Graph = require('ipld-graph-builder') 2 | const DataStore = require('./datastore.js') 3 | const treeNode = require('./treeNode.js') 4 | 5 | module.exports = class RadixTree { 6 | /** 7 | * @param opts 8 | * @param opts.root {object} a merkle root to a radix tree. If none, RadixTree will create an new root. 9 | * @param opts.db {object} a level db instance; alternatively, `opts.graph` can be used 10 | * @param opts.graph {object} an instance of [ipld-graph-builder](https://github.com/ipld/js-ipld-graph-builder); alternatively, `opts.dag` can be used 11 | * @param opts.dag {object} an instance if [ipfs.dag](https://github.com/ipfs/js-ipfs#dag). If there is no `opts.graph` this will be used to create a new graph instance. 12 | * @param opts.decoder {object} a cbor decoder 13 | */ 14 | constructor (opts) { 15 | this._root = {} 16 | this.root = opts.root || RadixTree.emptyTreeState 17 | 18 | this.dag = opts.dag || new DataStore(opts.db, opts.decoder) 19 | this.graph = opts.graph || new Graph(this.dag) 20 | this._setting = Promise.resolve() 21 | } 22 | 23 | /** 24 | * the root of the tree 25 | * @type {Buffer} 26 | */ 27 | get root () { 28 | return this._root['/'] 29 | } 30 | 31 | set root (root) { 32 | this._root['/'] = root 33 | } 34 | 35 | /** 36 | * gets a value given a key 37 | * @param {*} key 38 | * @return {Promise} 39 | */ 40 | async get (key) { 41 | key = RadixTree.formatKey(key) 42 | await this.done() 43 | return this._get(key) 44 | } 45 | 46 | async _get (key) { 47 | let index = 0 48 | let root = this._root 49 | let parent 50 | 51 | while (1) { 52 | // load the root 53 | const exNode = await this.graph.get(root, treeNode.EXTENSION, true) 54 | if (exNode) { 55 | let subKey = key.slice(index) 56 | const {extensionIndex, extensionLen, extension} = findMatchBits(subKey, root) 57 | index += extensionIndex 58 | // check if we complete traversed the extension 59 | if (extensionIndex !== extensionLen) { 60 | return {index, root, extension, extensionIndex} 61 | } 62 | } 63 | 64 | let keySegment = key[index] 65 | if (keySegment !== undefined) { 66 | const branch = treeNode.getBranch(root) 67 | await this.graph.get(branch, keySegment, true) 68 | // preserves the '/' 69 | const nextRoot = branch[keySegment] 70 | if (!nextRoot) { 71 | return {root, index} 72 | } else { 73 | parent = root 74 | root = nextRoot 75 | } 76 | } else { 77 | break 78 | } 79 | 80 | index++ 81 | } 82 | 83 | const value = treeNode.getValue(root) 84 | const node = root['/'] 85 | 86 | return {value, root, node, parent, index} 87 | } 88 | 89 | /** 90 | * stores a value at a given key returning the tree node that the value was saved in 91 | * @param {*} key 92 | * @return {Promise} 93 | */ 94 | set (key, value) { 95 | key = RadixTree.formatKey(key) 96 | return this._mutationLock(this._set.bind(this, key, value)) 97 | } 98 | 99 | async _set (key, value) { 100 | if (treeNode.isEmpty(this._root)) { 101 | this._root['/'] = createNode(key, [null, null], value)['/'] 102 | return this._root['/'] 103 | } else { 104 | let {node, root, extensionIndex, extension, index, value: rValue} = await this._get(key) 105 | 106 | if (rValue) { 107 | treeNode.setValue(root, value) 108 | return node 109 | } else { 110 | if (extensionIndex !== undefined) { 111 | // split the extension node in two 112 | const extensionKey = extension[extensionIndex] 113 | const remExtension = extension.slice(extensionIndex + 1) 114 | extension = extension.slice(0, extensionIndex) 115 | 116 | treeNode.setExtension(root, remExtension) 117 | const branch = [null, null] 118 | branch[extensionKey] = { 119 | '/': root['/'] 120 | } 121 | root['/'] = createNode(extension, branch)['/'] 122 | } 123 | 124 | // if there are remaning key segments create an extension node 125 | if (index < key.length) { 126 | const keySegment = key[index] 127 | const extension = key.slice(index + 1, key.length) 128 | const newNode = createNode(extension, [null, null], value) 129 | const rootBranch = treeNode.getBranch(root) 130 | rootBranch[keySegment] = newNode 131 | treeNode.setBranch(root, rootBranch) 132 | return newNode['/'] 133 | } else { 134 | treeNode.setValue(root, value) 135 | return root['/'] 136 | } 137 | } 138 | } 139 | } 140 | 141 | /** 142 | *smContainer.js deletes a value at a given key 143 | * @param {*} key 144 | * @return {Promise} 145 | */ 146 | delete (key) { 147 | key = RadixTree.formatKey(key) 148 | return this._mutationLock(this._delete.bind(this, key)) 149 | } 150 | 151 | async _delete (key) { 152 | const results = await this._get(key) 153 | if (results.value !== undefined) { 154 | const root = results.root 155 | const parent = results.parent 156 | 157 | treeNode.deleteValue(root) 158 | 159 | const branch = treeNode.getBranch(root) 160 | if (branch.some(el => el !== null)) { 161 | joinNodes(root) 162 | } else { 163 | if (!parent) { 164 | root['/'] = RadixTree.emptyTreeState 165 | } else { 166 | let branch = treeNode.getBranch(parent) 167 | branch = branch.map(node => node === root ? null : node) 168 | treeNode.setBranch(parent, branch) 169 | await this.graph.tree(parent, 2) 170 | 171 | joinNodes(parent) 172 | } 173 | } 174 | } 175 | 176 | function joinNodes (root) { 177 | if (treeNode.getValue(root) === undefined) { 178 | let index 179 | const branch = treeNode.getBranch(root) 180 | const nodes = branch.filter((node, i) => { 181 | if (node) { 182 | index = i 183 | return true 184 | } 185 | }) 186 | 187 | if (nodes.length === 1) { 188 | const child = nodes[0] 189 | const pExtension = treeNode.getExtension(root) 190 | const childExtension = treeNode.getExtension(child) 191 | 192 | let newExtension = pExtension.slice(0) 193 | newExtension[pExtension.length] = index 194 | newExtension = newExtension.concat(childExtension) 195 | 196 | treeNode.setExtension(child, newExtension) 197 | root['/'] = child['/'] 198 | } 199 | } 200 | } 201 | } 202 | 203 | /** 204 | * returns a promise that resolve when the tree is done with all of its writes 205 | * @returns {Promise} 206 | */ 207 | async done () { 208 | let setting 209 | while (this._setting !== setting) { 210 | setting = this._setting 211 | await setting 212 | } 213 | } 214 | 215 | _mutationLock (func) { 216 | const setting = this._setting 217 | this._setting = new Promise((resolve, reject) => { 218 | return setting.then(() => { 219 | return func().then(resolve).catch(reject) 220 | }) 221 | }) 222 | return this._setting 223 | } 224 | 225 | /** 226 | * creates a merkle root for the current tree and stores the data persistently 227 | * @returns {Promise} 228 | */ 229 | async flush () { 230 | await this.done() 231 | await this.graph.flush(this._root) 232 | return this.root 233 | } 234 | 235 | toJSON (node = this.root) { 236 | const json = [null, null, null] 237 | if (node[0]) { 238 | json[0] = [node[0][0], treeNode.buffer2bits(node[0][1]).slice(0, node[0][0]).toString()] 239 | } 240 | 241 | if (node[1]) { 242 | if (Buffer.isBuffer(node[1]['/'])) { 243 | json[1] = { 244 | '/': '0x' + node[1]['/'].toString('hex') 245 | } 246 | } else { 247 | json[1] = { 248 | '/': this.toJSON(node[1]['/']) 249 | } 250 | } 251 | } 252 | 253 | if (node[2]) { 254 | if (Buffer.isBuffer(node[2]['/'])) { 255 | json[2] = { 256 | '/': '0x' + node[2]['/'].toString('hex') 257 | } 258 | } else { 259 | json[2] = { 260 | '/': this.toJSON(node[2]['/']) 261 | } 262 | } 263 | } 264 | 265 | if (node[3]) { 266 | json[3] = '0x' + node[3].toString('hex') 267 | } 268 | return json 269 | } 270 | 271 | /** 272 | * Checks if a given root exists or not 273 | * @param {Buffer} root 274 | * @return {Promise} 275 | */ 276 | async rootExists (root) { 277 | await this.flush() 278 | try { 279 | await this.dag.get(root) 280 | } catch (e) { 281 | return false 282 | } 283 | return true 284 | } 285 | 286 | static formatKey (key) { 287 | if (typeof key === 'string') { 288 | key = Buffer.from(key) 289 | } 290 | 291 | if (!Array.isArray(key)) { 292 | return treeNode.buffer2bits(key) 293 | } else { 294 | return key 295 | } 296 | } 297 | 298 | /** 299 | * returns the state of an empty tree 300 | */ 301 | static get emptyTreeState () { 302 | return [null, null, null] 303 | } 304 | 305 | /** 306 | * returns a merkle link for some given data 307 | * @param {Buffer} data - the data which you would like to hash 308 | * @returns {Buffer} 309 | */ 310 | static getMerkleLink (data) { 311 | return DataStore.getMerkleLink(data) 312 | } 313 | } 314 | 315 | function createNode (ex, branch, value) { 316 | const node = { 317 | '/': [] 318 | } 319 | 320 | treeNode.setValue(node, value) 321 | treeNode.setExtension(node, ex) 322 | treeNode.setBranch(node, branch) 323 | 324 | return node 325 | } 326 | 327 | function findMatchBits (key, node) { 328 | let extensionIndex = 0 329 | const extension = treeNode.getExtension(node) 330 | const extensionLen = extension.length 331 | 332 | // checks the extension against the key 333 | while (extensionIndex < extensionLen && extension[extensionIndex] === key[extensionIndex]) { 334 | extensionIndex++ 335 | } 336 | 337 | return {extensionIndex, extensionLen, extension} 338 | } 339 | -------------------------------------------------------------------------------- /package.json: -------------------------------------------------------------------------------- 1 | { 2 | "name": "dfinity-radix-tree", 3 | "version": "0.2.7", 4 | "description": "This implements a binary merkle radix tree", 5 | "main": "index.js", 6 | "scripts": { 7 | "coveralls": "npm run coverage && nyc report --reporter=text-lcov | coveralls", 8 | "coverage": "nyc npm test", 9 | "lint": "standard", 10 | "test": "node ./tests/index.js", 11 | "build:docs": "documentation build ./index.js --github --sort-order source -f md > ./docs/index.md" 12 | }, 13 | "author": "mjbecze ", 14 | "license": "MPL-2.0", 15 | "keywords": [ 16 | "merkle", 17 | "tree", 18 | "ipfs", 19 | "dfinity" 20 | ], 21 | "devDependencies": { 22 | "coveralls": "^3.0.1", 23 | "documentation": "^8.0.0", 24 | "fs-extra": "^6.0.0", 25 | "level-browserify": "^1.1.2", 26 | "nyc": "^12.0.1", 27 | "standard": "^11.0.1", 28 | "tape": "^4.6.3" 29 | }, 30 | "dependencies": { 31 | "borc": "^2.0.3", 32 | "ipld-graph-builder": "^1.3.8", 33 | "node-fetch": "^2.1.2" 34 | }, 35 | "browser": { 36 | "node-fetch": "./fetch.js" 37 | }, 38 | "standard": { 39 | "ignore": [ 40 | "/benchmark/", 41 | "fetch.js" 42 | ] 43 | }, 44 | "bugs": { 45 | "url": "https://github.com/dfinity/js-dfinity-radix-tree/issues" 46 | }, 47 | "repository": { 48 | "type": "git", 49 | "url": "https://github.com/dfinity/js-dfinity-radix-tree.git" 50 | } 51 | } 52 | -------------------------------------------------------------------------------- /remoteDatastore.js: -------------------------------------------------------------------------------- 1 | const Buffer = require('safe-buffer').Buffer 2 | const TreeDAG = require('./datastore.js') 3 | const fetch = require('node-fetch') 4 | 5 | module.exports = class RemoteTreeDAG extends TreeDAG { 6 | /** 7 | * @param dag {object} a level db instance 8 | * @param remoteOpts 9 | * @param remoteOpts.uri {string} the HTTP uri which has an interface: GET /:key -> value 10 | * @param remoteOpts.encoding {string} the encoding of the reponse 11 | * @param opts.decoder {object} a cbor decoder 12 | */ 13 | constructor (dag, remoteOpts, decoder) { 14 | super(dag, decoder) 15 | this.remoteOpts = Object.assign({ 16 | uri: null, 17 | encoding: 'base64' 18 | }, remoteOpts) 19 | } 20 | 21 | async get (link) { 22 | try { 23 | return await super.get(link) 24 | } catch (e) { 25 | if (this.remoteOpts.uri) { 26 | await this.fetchRemote(link) 27 | return super.get(link) 28 | } 29 | } 30 | } 31 | 32 | fetchRemote (key) { 33 | if (!Buffer.isBuffer(key)) { 34 | key = Buffer.from(key.buffer) 35 | } 36 | 37 | const route = `${this.remoteOpts.uri}/${key.toString('hex')}` 38 | return fetch(route) 39 | .then(res => res.text()) 40 | .then(text => { 41 | const encoded = Buffer.from(text, this.remoteOpts.encoding) 42 | return new Promise((resolve, reject) => { 43 | this._dag.put(key, encoded.toString('hex'), () => { 44 | resolve(key) 45 | }) 46 | }) 47 | }) 48 | .catch(err => { 49 | console.warn(`error fetching ${route}:`, err.message) 50 | }) 51 | } 52 | } 53 | -------------------------------------------------------------------------------- /tests/index.js: -------------------------------------------------------------------------------- 1 | const fs = require('fs-extra') 2 | const tape = require('tape') 3 | const crypto = require('crypto') 4 | const level = require('level-browserify') 5 | const RadixTree = require('../') 6 | const RemoteDataStore = require('../remoteDatastore') 7 | const remote = require('./remote') 8 | const db = level('./testdb') 9 | 10 | tape('root existance', async t => { 11 | let tree = new RadixTree({ 12 | db: db 13 | }) 14 | let exists = await tree.rootExists(Buffer.from([0])) 15 | t.equals(exists, false) 16 | 17 | tree.set('test', Buffer.from('cat')) 18 | exists = await tree.rootExists(Buffer.from('01cff22f1e93e25d8691d6238031d98885ab468f', 'hex')) 19 | t.equals(exists, true) 20 | t.end() 21 | }) 22 | 23 | tape('should generate the same stateRoot', async t => { 24 | let tree = new RadixTree({ 25 | db: db 26 | }) 27 | tree.root = [null, null, null] 28 | const stateRoot = await tree.flush() 29 | const stateRoot2 = await tree.flush() 30 | t.deepEquals(stateRoot2, stateRoot) 31 | t.end() 32 | }) 33 | 34 | tape('should generate the same stateRoot', async t => { 35 | let tree1 = new RadixTree({ 36 | db 37 | }) 38 | 39 | let tree2 = new RadixTree({ 40 | db 41 | }) 42 | await tree1.flush() 43 | tree1.set('test', Buffer.from('cat')) 44 | tree2.set('test', Buffer.from('cat')) 45 | const stateRoot = await tree1.flush() 46 | const stateRoot2 = await tree2.flush() 47 | t.deepEquals(stateRoot2, stateRoot) 48 | t.end() 49 | }) 50 | 51 | tape('insert that creates one new node', async t => { 52 | let tree = new RadixTree({ 53 | db: db 54 | }) 55 | tree.set('foo', Buffer.from('bar')) 56 | tree.set('foob', Buffer.from('baz')) 57 | const node = await tree.get('foob') 58 | t.equals(node.value.toString(), 'baz') 59 | 60 | tree.delete('foob') 61 | const node2 = await tree.get('foo') 62 | t.equals(node2.value.toString(), 'bar') 63 | t.end() 64 | }) 65 | 66 | tape('insert that creates one new node', async t => { 67 | let tree = new RadixTree({ 68 | db: db 69 | }) 70 | tree.set([0, 0, 1], Buffer.from('bar')) 71 | await tree.set([0, 0, 0], Buffer.from('baz')) 72 | await tree.set([0, 0], Buffer.from('lol')) 73 | const node = await tree.get([0, 0, 0]) 74 | t.equals(node.value.toString(), 'baz') 75 | 76 | await tree.delete([0, 0]) 77 | const node2 = await tree.get([0, 0, 1]) 78 | t.equals(node2.value.toString(), 'bar') 79 | t.end() 80 | }) 81 | 82 | tape('set and get', async t => { 83 | const r = await RadixTree.getMerkleLink(Buffer.from([0])) 84 | 85 | t.equal(r.toString('hex'), '6e340b9cffb37a989ca544e6bb780a2c78901d3f', 'should hash') 86 | 87 | let tree = new RadixTree({ 88 | db: db 89 | }) 90 | 91 | tree.set('test', Buffer.from('cat')) 92 | let val = await tree.get('test') 93 | t.equals(val.value.toString(), 'cat') 94 | tree.set('te', Buffer.from('blop')) 95 | val = await tree.get('test') 96 | t.equals(val.value.toString(), 'cat') 97 | 98 | val = await tree.get('te') 99 | t.equals(val.value.toString(), 'blop') 100 | 101 | tree.set('rad', Buffer.from('cat2')) 102 | 103 | val = await tree.get('rad') 104 | t.equals(val.value.toString(), 'cat2') 105 | 106 | tree.set('test', Buffer.from('cat111')) 107 | val = await tree.get('test') 108 | t.equals(val.value.toString(), 'cat111') 109 | 110 | const stateRoot = await tree.flush() 111 | 112 | // try reteriving node from ipfs 113 | tree = new RadixTree({ 114 | db: db, 115 | root: stateRoot 116 | }) 117 | 118 | val = await tree.get('te') 119 | t.equals(val.value.toString(), 'blop') 120 | 121 | val = await tree.get('rad') 122 | t.equals(val.value.toString(), 'cat2') 123 | 124 | val = await tree.get('test') 125 | t.equals(val.value.toString(), 'cat111') 126 | 127 | const json = [ 128 | [5, '0,1,1,1,0'], { 129 | '/': [ 130 | [18, '1,0,0,1,1,0,0,0,0,1,0,1,1,0,0,1,0,0'], null, null, '0x63617432' 131 | ] 132 | }, { 133 | '/': [ 134 | [10, '0,0,0,1,1,0,0,1,0,1'], { 135 | '/': [ 136 | [15, '1,1,1,0,0,1,1,0,1,1,1,0,1,0,0'], null, null, '0x636174313131' 137 | ] 138 | }, 139 | null, '0x626c6f70' 140 | ] 141 | } 142 | ] 143 | t.deepEquals(tree.toJSON(), json) 144 | t.end() 145 | }) 146 | 147 | tape('branch nodes', async t => { 148 | const tree = new RadixTree({ 149 | db: db 150 | }) 151 | 152 | let key0 = [1, 1] 153 | let key1 = [0, 1] 154 | let key2 = [1, 0] 155 | let key3 = [0, 0] 156 | 157 | tree.set(key0, Buffer.from('cat')) 158 | tree.set(key1, Buffer.from('cat2')) 159 | tree.set(key2, Buffer.from('cat')) 160 | tree.set(key3, Buffer.from('cat3')) 161 | 162 | let val = await tree.get(key0) 163 | t.equals(val.value.toString(), 'cat') 164 | val = await tree.get(key1) 165 | t.equals(val.value.toString(), 'cat2') 166 | val = await tree.get(key2) 167 | t.equals(val.value.toString(), 'cat') 168 | val = await tree.get(key3) 169 | t.equals(val.value.toString(), 'cat3') 170 | 171 | t.end() 172 | }) 173 | 174 | tape('delete', async t => { 175 | const tree = new RadixTree({ 176 | db: db 177 | }) 178 | tree.set('test', Buffer.from('cat')) 179 | tree.set('ter', Buffer.from('cat3')) 180 | tree.delete('te') 181 | tree.delete('test') 182 | await tree.delete('ter') 183 | t.deepEquals(tree.root, RadixTree.emptyTreeState) 184 | 185 | // tests delete midle branchs 186 | tree.set('test', Buffer.from('cat')) 187 | tree.set('te', Buffer.from('cat2')) 188 | tree.set('ter', Buffer.from('cat3')) 189 | await tree.delete('te') 190 | let val = await tree.get('test') 191 | t.equals(val.value.toString(), 'cat') 192 | 193 | // tests delete end branchs 194 | tree.set('te', 'cat2') 195 | tree.delete('ter') 196 | tree.delete('te') 197 | await tree.delete('test') 198 | t.deepEquals(tree._root['/'], RadixTree.emptyTreeState) 199 | t.end() 200 | }) 201 | 202 | tape('large values', async t => { 203 | const tree = new RadixTree({ 204 | db: db 205 | }) 206 | const saved = Buffer.alloc(33).fill(1) 207 | tree.set('test', saved) 208 | const value = await tree.get('test') 209 | t.equals(value.value.toString(), saved.toString()) 210 | t.end() 211 | }) 212 | 213 | tape('errors', async t => { 214 | const tree = new RadixTree({ 215 | db: db, 216 | root: { 217 | '/': Buffer.alloc(20) 218 | } 219 | }) 220 | 221 | try { 222 | await tree.get('test') 223 | } catch (e) { 224 | t.end() 225 | } 226 | }) 227 | 228 | tape('random', async t => { 229 | const tree = new RadixTree({ 230 | db: db 231 | }) 232 | const entries = 100 233 | for (let i = 0; i < entries; i++) { 234 | const key = crypto.createHash('sha256').update(i.toString()).digest().slice(0, 20) 235 | tree.set(key, Buffer.from([i])) 236 | } 237 | await tree.flush() 238 | 239 | for (let i = 0; i < entries; i++) { 240 | const key = crypto.createHash('sha256').update(i.toString()).digest().slice(0, 20) 241 | const value = await tree.get(key) 242 | t.equals(value.value[0], i) 243 | } 244 | 245 | await tree.flush() 246 | for (let i = 0; i < entries; i++) { 247 | const key = crypto.createHash('sha256').update(i.toString()).digest().slice(0, 20) 248 | await tree.delete(key) 249 | } 250 | 251 | t.deepEquals(tree._root['/'], RadixTree.emptyTreeState) 252 | 253 | t.end() 254 | }) 255 | 256 | tape('remote', async t => { 257 | // remote 258 | const remoteTree = new RadixTree({ 259 | db: db 260 | }) 261 | const server = remote.listen(db) 262 | 263 | const entries = 100 264 | for (let i = 0; i < entries; i++) { 265 | const key = crypto.createHash('sha256').update(i.toString()).digest().slice(0, 20) 266 | remoteTree.set(key, Buffer.from([i])) 267 | } 268 | const stateRoot = await remoteTree.flush() 269 | 270 | // local 271 | fs.removeSync('./localdb') 272 | const localTree = new RadixTree({ 273 | dag: new RemoteDataStore(level('./localdb'), {uri: 'http://localhost:3000'}) 274 | }) 275 | localTree.root = stateRoot 276 | 277 | for (let i = 0; i < entries; i++) { 278 | const key = crypto.createHash('sha256').update(i.toString()).digest().slice(0, 20) 279 | const value = await localTree.get(key) 280 | t.equals(value.value[0], i) 281 | } 282 | 283 | server.close() 284 | t.end() 285 | }) 286 | 287 | tape('reset', async t => { 288 | const tree = new RadixTree({ 289 | db: db 290 | }) 291 | 292 | const stateRoot1 = await tree.flush() 293 | 294 | const entries = 100 295 | for (let i = 0; i < entries; i++) { 296 | const key = crypto.createHash('sha256').update(i.toString()).digest().slice(0, 20) 297 | tree.set(key, Buffer.from([i])) 298 | } 299 | 300 | await tree.flush() 301 | 302 | tree.root = RadixTree.emptyTreeState 303 | 304 | const stateRoot2 = await tree.flush() 305 | 306 | t.deepEquals(stateRoot1, stateRoot2) 307 | 308 | t.end() 309 | }) 310 | -------------------------------------------------------------------------------- /tests/jsonTests.js: -------------------------------------------------------------------------------- 1 | const tape = require('tape') 2 | const level = require('level-browserify') 3 | const RadixTree = require('../') 4 | const db = level('./testdb') 5 | let tests = require('./tests.json') 6 | 7 | const generate = false 8 | 9 | async function main () { 10 | for (const testName in tests) { 11 | await new Promise((resolve, reject) => { 12 | tape(testName, async t => { 13 | const test = tests[testName] 14 | let tree = new RadixTree({ 15 | db: db 16 | }) 17 | 18 | for (const index in test) { 19 | const op = test[index] 20 | if (op.op === 'set') { 21 | const val = Buffer.from(op.value.slice(2), 'hex') 22 | const key = Buffer.from(op.key.slice(2), 'hex') 23 | await tree.set(key, val) 24 | } else if (op.op === 'get') { 25 | const key = Buffer.from(op.key.slice(2), 'hex') 26 | const val = await tree.get(key) 27 | t.equals('0x' + val.value.toString('hex'), op.value, `value at key ${op.key} should be ${op.value}`) 28 | } else if (op.op === 'delete') { 29 | const key = Buffer.from(op.key.slice(2), 'hex') 30 | await tree.delete(key) 31 | } else if (op.op === 'stateRoot') { 32 | await tree.flush() 33 | const sr = '0x' + tree.root.toString('hex') 34 | if (generate) { 35 | op.value = sr 36 | } else { 37 | t.equals(sr, op.value, 'should have correct state root') 38 | } 39 | } 40 | } 41 | // console.log(JSON.stringify(tree.toJSON(), null, 2)) 42 | t.end() 43 | resolve() 44 | }) 45 | }) 46 | } 47 | if (generate) { 48 | console.error(JSON.stringify(tests, null, 2)) 49 | } 50 | } 51 | 52 | main() 53 | -------------------------------------------------------------------------------- /tests/remote.js: -------------------------------------------------------------------------------- 1 | const RadixTree = require('../') 2 | 3 | const cbor = require('borc') 4 | const http = require('http') 5 | 6 | let tree 7 | 8 | const server = http.createServer(async (req, res) => { 9 | const key = Buffer.from(req.url.slice(1), 'hex') 10 | const value = await tree.graph._dag.get(key) 11 | res.end(cbor.encode(value).toString('base64')) 12 | }) 13 | 14 | module.exports = { 15 | listen: (db, port = 3000) => { 16 | server.listen(port, (err) => { 17 | if (err) { return console.error(err) } 18 | 19 | tree = new RadixTree({db}) 20 | 21 | console.log(`server is listening on ${port}`) 22 | }) 23 | 24 | return server 25 | } 26 | } 27 | -------------------------------------------------------------------------------- /tests/tests.json: -------------------------------------------------------------------------------- 1 | { 2 | "empty": [ 3 | { 4 | "op": "stateRoot", 5 | "value": "0x4cf812be9be2c6008325050f43d06676a08612c7" 6 | } 7 | ], 8 | "insert_and_lookup": [ 9 | { 10 | "op": "set", 11 | "key": "0x74657374", 12 | "value": "0x636174" 13 | }, 14 | { 15 | "op": "stateRoot", 16 | "value": "0x01cff22f1e93e25d8691d6238031d98885ab468f" 17 | }, 18 | { 19 | "op": "get", 20 | "key": "0x74657374", 21 | "value": "0x636174" 22 | }, 23 | { 24 | "op": "set", 25 | "key": "0x7465", 26 | "value": "0x626c6f70" 27 | }, 28 | { 29 | "op": "get", 30 | "key": "0x74657374", 31 | "value": "0x636174" 32 | }, 33 | { 34 | "op": "get", 35 | "key": "0x7465", 36 | "value": "0x626c6f70" 37 | }, 38 | { 39 | "op": "set", 40 | "key": "0x726164", 41 | "value": "0x63617432" 42 | }, 43 | { 44 | "op": "stateRoot", 45 | "value": "0x05213318991804dad6a926aacfd4ac3481161371" 46 | }, 47 | { 48 | "op": "get", 49 | "key": "0x726164", 50 | "value": "0x63617432" 51 | }, 52 | { 53 | "op": "set", 54 | "key": "0x74657374", 55 | "value": "0x636174313131" 56 | }, 57 | { 58 | "op": "stateRoot", 59 | "value": "0x80a385b4f06471e95a5993ef0e3b7aa99b64241c" 60 | }, 61 | { 62 | "op": "get", 63 | "key": "0x74657374", 64 | "value": "0x636174313131" 65 | } 66 | ], 67 | "insert_and_lookup_2": [ 68 | { 69 | "op": "set", 70 | "key": "0x61", 71 | "value": "0x3239" 72 | }, 73 | { 74 | "op": "set", 75 | "key": "0x612f", 76 | "value": "0x3136313438" 77 | }, 78 | { 79 | "op": "set", 80 | "key": "0x612f30", 81 | "value": "0x36373132" 82 | }, 83 | { 84 | "op": "set", 85 | "key": "0x612f31", 86 | "value": "0x3732" 87 | }, 88 | { 89 | "op": "set", 90 | "key": "0x62", 91 | "value": "0x3237" 92 | }, 93 | { 94 | "op": "set", 95 | "key": "0x622f", 96 | "value": "0x3136313438" 97 | }, 98 | { 99 | "op": "set", 100 | "key": "0x622f30", 101 | "value": "0x36373132" 102 | }, 103 | { 104 | "op": "set", 105 | "key": "0x622f31", 106 | "value": "0x3232" 107 | }, 108 | { 109 | "op": "set", 110 | "key": "0x622f31", 111 | "value": "0x3730" 112 | }, 113 | { 114 | "op": "get", 115 | "key": "0x612f31", 116 | "value": "0x3732" 117 | } 118 | ], 119 | "insert_and_delete": [ 120 | { 121 | "op": "set", 122 | "key": "0x666f6f", 123 | "value": "0x626172" 124 | }, 125 | { 126 | "op": "set", 127 | "key": "0x666f6f62", 128 | "value": "0x62617a" 129 | }, 130 | { 131 | "op": "set", 132 | "key": "0x666f6f61", 133 | "value": "0x626172" 134 | }, 135 | { 136 | "op": "stateRoot", 137 | "value": "0xbccc80ab0d248beb8e6ce7b81c78559c506cedac" 138 | }, 139 | { 140 | "op": "delete", 141 | "key": "0x666f6f62" 142 | }, 143 | { 144 | "op": "delete", 145 | "key": "0x666f6f62" 146 | }, 147 | { 148 | "op": "get", 149 | "key": "0x666f6f", 150 | "value": "0x626172" 151 | }, 152 | { 153 | "op": "stateRoot", 154 | "value": "0x3a6305b358770cafa44b3b358fa98746fbd8679f" 155 | } 156 | ], 157 | "insert_and_delete_2": [ 158 | { 159 | "op": "set", 160 | "key": "0x20", 161 | "value": "0x626172" 162 | }, 163 | { 164 | "op": "set", 165 | "key": "0x00", 166 | "value": "0x62617a" 167 | }, 168 | { 169 | "op": "set", 170 | "key": "0x00", 171 | "value": "0x626172" 172 | }, 173 | { 174 | "op": "stateRoot", 175 | "value": "0x42c33979750064d830468c4cc954642a14d97497" 176 | }, 177 | { 178 | "op": "delete", 179 | "key": "0x00" 180 | }, 181 | { 182 | "op": "get", 183 | "key": "0x20", 184 | "value": "0x626172" 185 | }, 186 | { 187 | "op": "stateRoot", 188 | "value": "0x52c8cef4b4014aba94b7bc1990919335b417cf13" 189 | } 190 | ], 191 | "delete_with_one_branch": [ 192 | { 193 | "op": "set", 194 | "key": "0x00", 195 | "value": "0x626172" 196 | }, 197 | { 198 | "op": "set", 199 | "key": "0x01", 200 | "value": "0x62617a" 201 | }, 202 | { 203 | "op": "set", 204 | "key": "0x0002", 205 | "value": "0x626172" 206 | }, 207 | { 208 | "op": "delete", 209 | "key": "0x00" 210 | }, 211 | { 212 | "op": "stateRoot", 213 | "value": "0xf47670c01ff5450ff83c1e7f46092e94fc2c0d0b" 214 | } 215 | ], 216 | "delete_with_two_branches": [ 217 | { 218 | "op": "set", 219 | "key": "0x00", 220 | "value": "0x626172" 221 | }, 222 | { 223 | "op": "set", 224 | "key": "0x00f0", 225 | "value": "0x626172" 226 | }, 227 | { 228 | "op": "set", 229 | "key": "0x0000", 230 | "value": "0x626172" 231 | }, 232 | { 233 | "op": "delete", 234 | "key": "0x00" 235 | }, 236 | { 237 | "op": "stateRoot", 238 | "value": "0xf7d7490a412c72a2fa66bf3b85af4a1027f02058" 239 | } 240 | ], 241 | "delete_with_no_branches": [ 242 | { 243 | "op": "set", 244 | "key": "0x00", 245 | "value": "0x626172" 246 | }, 247 | { 248 | "op": "set", 249 | "key": "0x00f0", 250 | "value": "0x626172" 251 | }, 252 | { 253 | "op": "set", 254 | "key": "0x0000", 255 | "value": "0x626172" 256 | }, 257 | { 258 | "op": "delete", 259 | "key": "0x0000" 260 | }, 261 | { 262 | "op": "stateRoot", 263 | "value": "0x230a8e726c6444964d027d906fe0fdc361122163" 264 | } 265 | ], 266 | "saturatedTree": [ 267 | { 268 | "op": "set", 269 | "key": "0x00", 270 | "value": "0x636174" 271 | }, 272 | { 273 | "op": "set", 274 | "key": "0x01", 275 | "value": "0x63617431" 276 | }, 277 | { 278 | "op": "set", 279 | "key": "0x02", 280 | "value": "0x63617432" 281 | }, 282 | { 283 | "op": "set", 284 | "key": "0x03", 285 | "value": "0x63617433" 286 | }, 287 | { 288 | "op": "set", 289 | "key": "0x04", 290 | "value": "0x63617434" 291 | }, 292 | { 293 | "op": "set", 294 | "key": "0x05", 295 | "value": "0x63617435" 296 | }, 297 | { 298 | "op": "set", 299 | "key": "0x06", 300 | "value": "0x63617436" 301 | }, 302 | { 303 | "op": "set", 304 | "key": "0x07", 305 | "value": "0x63617437" 306 | }, 307 | { 308 | "op": "set", 309 | "key": "0x08", 310 | "value": "0x63617438" 311 | }, 312 | { 313 | "op": "set", 314 | "key": "0x09", 315 | "value": "0x63617439" 316 | }, 317 | { 318 | "op": "set", 319 | "key": "0x0a", 320 | "value": "0x63617461" 321 | }, 322 | { 323 | "op": "set", 324 | "key": "0x0b", 325 | "value": "0x63617462" 326 | }, 327 | { 328 | "op": "stateRoot", 329 | "value": "0xc4bf5d2ff89e90cd9edd81e8e160953406ac446b" 330 | }, 331 | { 332 | "op": "get", 333 | "key": "0x00", 334 | "value": "0x636174" 335 | }, 336 | { 337 | "op": "get", 338 | "key": "0x01", 339 | "value": "0x63617431" 340 | }, 341 | { 342 | "op": "get", 343 | "key": "0x02", 344 | "value": "0x63617432" 345 | }, 346 | { 347 | "op": "get", 348 | "key": "0x03", 349 | "value": "0x63617433" 350 | }, 351 | { 352 | "op": "get", 353 | "key": "0x04", 354 | "value": "0x63617434" 355 | }, 356 | { 357 | "op": "get", 358 | "key": "0x05", 359 | "value": "0x63617435" 360 | }, 361 | { 362 | "op": "get", 363 | "key": "0x06", 364 | "value": "0x63617436" 365 | }, 366 | { 367 | "op": "get", 368 | "key": "0x07", 369 | "value": "0x63617437" 370 | }, 371 | { 372 | "op": "get", 373 | "key": "0x08", 374 | "value": "0x63617438" 375 | }, 376 | { 377 | "op": "get", 378 | "key": "0x09", 379 | "value": "0x63617439" 380 | }, 381 | { 382 | "op": "get", 383 | "key": "0x0a", 384 | "value": "0x63617461" 385 | }, 386 | { 387 | "op": "get", 388 | "key": "0x0b", 389 | "value": "0x63617462" 390 | }, 391 | { 392 | "op": "delete", 393 | "key": "0x00" 394 | }, 395 | { 396 | "op": "delete", 397 | "key": "0x01" 398 | }, 399 | { 400 | "op": "delete", 401 | "key": "0x02" 402 | }, 403 | { 404 | "op": "delete", 405 | "key": "0x03" 406 | }, 407 | { 408 | "op": "delete", 409 | "key": "0x04" 410 | }, 411 | { 412 | "op": "delete", 413 | "key": "0x05" 414 | }, 415 | { 416 | "op": "delete", 417 | "key": "0x06" 418 | }, 419 | { 420 | "op": "delete", 421 | "key": "0x07" 422 | }, 423 | { 424 | "op": "delete", 425 | "key": "0x08" 426 | }, 427 | { 428 | "op": "delete", 429 | "key": "0x09" 430 | }, 431 | { 432 | "op": "delete", 433 | "key": "0x0a" 434 | }, 435 | { 436 | "op": "delete", 437 | "key": "0x0b" 438 | }, 439 | { 440 | "op": "stateRoot", 441 | "value": "0x4cf812be9be2c6008325050f43d06676a08612c7" 442 | } 443 | ] 444 | } 445 | -------------------------------------------------------------------------------- /treeNode.js: -------------------------------------------------------------------------------- 1 | const cbor = require('borc') 2 | const EMPTY_STATE_ROOT = Buffer.from('4cf812be9be2c6008325050f43d06676a08612c7', 'hex') 3 | 4 | const LINK_TAG = 42 5 | 6 | function insertTags (val) { 7 | if (Array.isArray(val)) { 8 | val = val.map(v => { 9 | if (v && v.hasOwnProperty('/')) { 10 | return new cbor.Tagged(LINK_TAG, v['/']) 11 | } else { 12 | return insertTags(v) 13 | } 14 | }) 15 | } 16 | return val 17 | } 18 | 19 | // helper functions for nodes 20 | const EXTENSION = exports.EXTENSION = 0 21 | const LBRANCH = exports.LBRANCH = 1 22 | const RBRANCH = exports.RBRANCH = 2 23 | const VALUE = exports.VALUE = 3 24 | 25 | exports.setBranch = function (node, branch) { 26 | node['/'][LBRANCH] = branch[0] 27 | node['/'][RBRANCH] = branch[1] 28 | } 29 | 30 | exports.getBranch = function (node) { 31 | return node['/'].slice(LBRANCH, LBRANCH + 2) 32 | } 33 | 34 | exports.getValue = function (node) { 35 | return node['/'][VALUE] 36 | } 37 | 38 | exports.deleteValue = function (node) { 39 | node['/'] = node['/'].slice(0, 3) 40 | } 41 | 42 | exports.getExtension = function (node) { 43 | if (node['/'][EXTENSION]) { 44 | const len = node['/'][EXTENSION][0] 45 | const extension = exports.buffer2bits(node['/'][EXTENSION][1]) 46 | return extension.slice(0, len) 47 | } else { 48 | return [] 49 | } 50 | } 51 | 52 | exports.setExtension = function (node, ex) { 53 | if (ex && ex.length) { 54 | node['/'][EXTENSION] = [ex.length, exports.bit2buffer(ex)] 55 | } else { 56 | node['/'][EXTENSION] = null 57 | } 58 | } 59 | 60 | exports.setValue = function (node, val) { 61 | if (val !== undefined) { 62 | node['/'][VALUE] = val 63 | } 64 | } 65 | 66 | exports.isEmpty = function (node) { 67 | if (Buffer.isBuffer(node['/'])) { 68 | return !Buffer.compare(node['/'], EMPTY_STATE_ROOT) 69 | } else { 70 | return node['/'].every(el => !el) 71 | } 72 | } 73 | 74 | exports.encodeNode = function (node) { 75 | const val = insertTags(node) 76 | const encoded = cbor.encode(val) 77 | return encoded 78 | } 79 | 80 | exports.buffer2bits = function (buffer) { 81 | const bitArray = [] 82 | for (const elem of buffer) { 83 | for (let i = 7; i >= 0; i--) { 84 | bitArray.push((elem & (1 << i)) >> i) 85 | } 86 | } 87 | return bitArray 88 | } 89 | 90 | exports.bit2buffer = function (bits) { 91 | bits = bits.slice(0) 92 | const byteArray = [] 93 | for (const index in bits) { 94 | const bit = bits[index] 95 | const arrayIndex = Math.floor(index / 8) 96 | byteArray[arrayIndex] = byteArray[arrayIndex] | bit << (7 - (index % 8)) 97 | } 98 | return Buffer.from(byteArray) 99 | } 100 | --------------------------------------------------------------------------------