├── .gitattributes ├── .gitignore ├── .gitmodules ├── COPYING ├── Makefile ├── README.md ├── ToB_Letter_of_Attestation_Chai.pdf ├── bin ├── conf.sh ├── conf │ ├── hevm.sh │ ├── kovan.sh │ └── mainnet.sh ├── domain_separator ├── permit └── set_constants └── src ├── chai.sol └── test └── chai.t.sol /.gitattributes: -------------------------------------------------------------------------------- 1 | *.sol linguist-language=Solidity 2 | -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | /out 2 | -------------------------------------------------------------------------------- /.gitmodules: -------------------------------------------------------------------------------- 1 | [submodule "lib/ds-test"] 2 | path = lib/ds-test 3 | url = https://github.com/dapphub/ds-test 4 | [submodule "lib/dss"] 5 | path = lib/dss 6 | url = https://github.com/dapphub/dss 7 | -------------------------------------------------------------------------------- /COPYING: -------------------------------------------------------------------------------- 1 | GNU AFFERO GENERAL PUBLIC LICENSE 2 | Version 3, 19 November 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 Affero General Public License is a free, copyleft license for 11 | software and other kinds of works, specifically designed to ensure 12 | cooperation with the community in the case of network server software. 13 | 14 | The licenses for most software and other practical works are designed 15 | to take away your freedom to share and change the works. By contrast, 16 | our General Public Licenses are intended to guarantee your freedom to 17 | share and change all versions of a program--to make sure it remains free 18 | software for all its users. 19 | 20 | When we speak of free software, we are referring to freedom, not 21 | price. Our General Public Licenses are designed to make sure that you 22 | have the freedom to distribute copies of free software (and charge for 23 | them if you wish), that you receive source code or can get it if you 24 | want it, that you can change the software or use pieces of it in new 25 | free programs, and that you know you can do these things. 26 | 27 | Developers that use our General Public Licenses protect your rights 28 | with two steps: (1) assert copyright on the software, and (2) offer 29 | you this License which gives you legal permission to copy, distribute 30 | and/or modify the software. 31 | 32 | A secondary benefit of defending all users' freedom is that 33 | improvements made in alternate versions of the program, if they 34 | receive widespread use, become available for other developers to 35 | incorporate. Many developers of free software are heartened and 36 | encouraged by the resulting cooperation. However, in the case of 37 | software used on network servers, this result may fail to come about. 38 | The GNU General Public License permits making a modified version and 39 | letting the public access it on a server without ever releasing its 40 | source code to the public. 41 | 42 | The GNU Affero General Public License is designed specifically to 43 | ensure that, in such cases, the modified source code becomes available 44 | to the community. It requires the operator of a network server to 45 | provide the source code of the modified version running there to the 46 | users of that server. Therefore, public use of a modified version, on 47 | a publicly accessible server, gives the public access to the source 48 | code of the modified version. 49 | 50 | An older license, called the Affero General Public License and 51 | published by Affero, was designed to accomplish similar goals. This is 52 | a different license, not a version of the Affero GPL, but Affero has 53 | released a new version of the Affero GPL which permits relicensing under 54 | this license. 55 | 56 | The precise terms and conditions for copying, distribution and 57 | modification follow. 58 | 59 | TERMS AND CONDITIONS 60 | 61 | 0. Definitions. 62 | 63 | "This License" refers to version 3 of the GNU Affero General Public License. 64 | 65 | "Copyright" also means copyright-like laws that apply to other kinds of 66 | works, such as semiconductor masks. 67 | 68 | "The Program" refers to any copyrightable work licensed under this 69 | License. Each licensee is addressed as "you". "Licensees" and 70 | "recipients" may be individuals or organizations. 71 | 72 | To "modify" a work means to copy from or adapt all or part of the work 73 | in a fashion requiring copyright permission, other than the making of an 74 | exact copy. The resulting work is called a "modified version" of the 75 | earlier work or a work "based on" the earlier work. 76 | 77 | A "covered work" means either the unmodified Program or a work based 78 | on the Program. 79 | 80 | To "propagate" a work means to do anything with it that, without 81 | permission, would make you directly or secondarily liable for 82 | infringement under applicable copyright law, except executing it on a 83 | computer or modifying a private copy. Propagation includes copying, 84 | distribution (with or without modification), making available to the 85 | public, and in some countries other activities as well. 86 | 87 | To "convey" a work means any kind of propagation that enables other 88 | parties to make or receive copies. Mere interaction with a user through 89 | a computer network, with no transfer of a copy, is not conveying. 90 | 91 | An interactive user interface displays "Appropriate Legal Notices" 92 | to the extent that it includes a convenient and prominently visible 93 | feature that (1) displays an appropriate copyright notice, and (2) 94 | tells the user that there is no warranty for the work (except to the 95 | extent that warranties are provided), that licensees may convey the 96 | work under this License, and how to view a copy of this License. If 97 | the interface presents a list of user commands or options, such as a 98 | menu, a prominent item in the list meets this criterion. 99 | 100 | 1. Source Code. 101 | 102 | The "source code" for a work means the preferred form of the work 103 | for making modifications to it. "Object code" means any non-source 104 | form of a work. 105 | 106 | A "Standard Interface" means an interface that either is an official 107 | standard defined by a recognized standards body, or, in the case of 108 | interfaces specified for a particular programming language, one that 109 | is widely used among developers working in that language. 110 | 111 | The "System Libraries" of an executable work include anything, other 112 | than the work as a whole, that (a) is included in the normal form of 113 | packaging a Major Component, but which is not part of that Major 114 | Component, and (b) serves only to enable use of the work with that 115 | Major Component, or to implement a Standard Interface for which an 116 | implementation is available to the public in source code form. A 117 | "Major Component", in this context, means a major essential component 118 | (kernel, window system, and so on) of the specific operating system 119 | (if any) on which the executable work runs, or a compiler used to 120 | produce the work, or an object code interpreter used to run it. 121 | 122 | The "Corresponding Source" for a work in object code form means all 123 | the source code needed to generate, install, and (for an executable 124 | work) run the object code and to modify the work, including scripts to 125 | control those activities. However, it does not include the work's 126 | System Libraries, or general-purpose tools or generally available free 127 | programs which are used unmodified in performing those activities but 128 | which are not part of the work. For example, Corresponding Source 129 | includes interface definition files associated with source files for 130 | the work, and the source code for shared libraries and dynamically 131 | linked subprograms that the work is specifically designed to require, 132 | such as by intimate data communication or control flow between those 133 | subprograms and other parts of the work. 134 | 135 | The Corresponding Source need not include anything that users 136 | can regenerate automatically from other parts of the Corresponding 137 | Source. 138 | 139 | The Corresponding Source for a work in source code form is that 140 | same work. 141 | 142 | 2. Basic Permissions. 143 | 144 | All rights granted under this License are granted for the term of 145 | copyright on the Program, and are irrevocable provided the stated 146 | conditions are met. This License explicitly affirms your unlimited 147 | permission to run the unmodified Program. The output from running a 148 | covered work is covered by this License only if the output, given its 149 | content, constitutes a covered work. This License acknowledges your 150 | rights of fair use or other equivalent, as provided by copyright law. 151 | 152 | You may make, run and propagate covered works that you do not 153 | convey, without conditions so long as your license otherwise remains 154 | in force. You may convey covered works to others for the sole purpose 155 | of having them make modifications exclusively for you, or provide you 156 | with facilities for running those works, provided that you comply with 157 | the terms of this License in conveying all material for which you do 158 | not control copyright. Those thus making or running the covered works 159 | for you must do so exclusively on your behalf, under your direction 160 | and control, on terms that prohibit them from making any copies of 161 | your copyrighted material outside their relationship with you. 162 | 163 | Conveying under any other circumstances is permitted solely under 164 | the conditions stated below. Sublicensing is not allowed; section 10 165 | makes it unnecessary. 166 | 167 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 168 | 169 | No covered work shall be deemed part of an effective technological 170 | measure under any applicable law fulfilling obligations under article 171 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 172 | similar laws prohibiting or restricting circumvention of such 173 | measures. 174 | 175 | When you convey a covered work, you waive any legal power to forbid 176 | circumvention of technological measures to the extent such circumvention 177 | is effected by exercising rights under this License with respect to 178 | the covered work, and you disclaim any intention to limit operation or 179 | modification of the work as a means of enforcing, against the work's 180 | users, your or third parties' legal rights to forbid circumvention of 181 | technological measures. 182 | 183 | 4. Conveying Verbatim Copies. 184 | 185 | You may convey verbatim copies of the Program's source code as you 186 | receive it, in any medium, provided that you conspicuously and 187 | appropriately publish on each copy an appropriate copyright notice; 188 | keep intact all notices stating that this License and any 189 | non-permissive terms added in accord with section 7 apply to the code; 190 | keep intact all notices of the absence of any warranty; and give all 191 | recipients a copy of this License along with the Program. 192 | 193 | You may charge any price or no price for each copy that you convey, 194 | and you may offer support or warranty protection for a fee. 195 | 196 | 5. Conveying Modified Source Versions. 197 | 198 | You may convey a work based on the Program, or the modifications to 199 | produce it from the Program, in the form of source code under the 200 | terms of section 4, provided that you also meet all of these conditions: 201 | 202 | a) The work must carry prominent notices stating that you modified 203 | it, and giving a relevant date. 204 | 205 | b) The work must carry prominent notices stating that it is 206 | released under this License and any conditions added under section 207 | 7. This requirement modifies the requirement in section 4 to 208 | "keep intact all notices". 209 | 210 | c) You must license the entire work, as a whole, under this 211 | License to anyone who comes into possession of a copy. This 212 | License will therefore apply, along with any applicable section 7 213 | additional terms, to the whole of the work, and all its parts, 214 | regardless of how they are packaged. This License gives no 215 | permission to license the work in any other way, but it does not 216 | invalidate such permission if you have separately received it. 217 | 218 | d) If the work has interactive user interfaces, each must display 219 | Appropriate Legal Notices; however, if the Program has interactive 220 | interfaces that do not display Appropriate Legal Notices, your 221 | work need not make them do so. 222 | 223 | A compilation of a covered work with other separate and independent 224 | works, which are not by their nature extensions of the covered work, 225 | and which are not combined with it such as to form a larger program, 226 | in or on a volume of a storage or distribution medium, is called an 227 | "aggregate" if the compilation and its resulting copyright are not 228 | used to limit the access or legal rights of the compilation's users 229 | beyond what the individual works permit. Inclusion of a covered work 230 | in an aggregate does not cause this License to apply to the other 231 | parts of the aggregate. 232 | 233 | 6. Conveying Non-Source Forms. 234 | 235 | You may convey a covered work in object code form under the terms 236 | of sections 4 and 5, provided that you also convey the 237 | machine-readable Corresponding Source under the terms of this License, 238 | in one of these ways: 239 | 240 | a) Convey the object code in, or embodied in, a physical product 241 | (including a physical distribution medium), accompanied by the 242 | Corresponding Source fixed on a durable physical medium 243 | customarily used for software interchange. 244 | 245 | b) Convey the object code in, or embodied in, a physical product 246 | (including a physical distribution medium), accompanied by a 247 | written offer, valid for at least three years and valid for as 248 | long as you offer spare parts or customer support for that product 249 | model, to give anyone who possesses the object code either (1) a 250 | copy of the Corresponding Source for all the software in the 251 | product that is covered by this License, on a durable physical 252 | medium customarily used for software interchange, for a price no 253 | more than your reasonable cost of physically performing this 254 | conveying of source, or (2) access to copy the 255 | Corresponding Source from a network server at no charge. 256 | 257 | c) Convey individual copies of the object code with a copy of the 258 | written offer to provide the Corresponding Source. This 259 | alternative is allowed only occasionally and noncommercially, and 260 | only if you received the object code with such an offer, in accord 261 | with subsection 6b. 262 | 263 | d) Convey the object code by offering access from a designated 264 | place (gratis or for a charge), and offer equivalent access to the 265 | Corresponding Source in the same way through the same place at no 266 | further charge. You need not require recipients to copy the 267 | Corresponding Source along with the object code. If the place to 268 | copy the object code is a network server, the Corresponding Source 269 | may be on a different server (operated by you or a third party) 270 | that supports equivalent copying facilities, provided you maintain 271 | clear directions next to the object code saying where to find the 272 | Corresponding Source. Regardless of what server hosts the 273 | Corresponding Source, you remain obligated to ensure that it is 274 | available for as long as needed to satisfy these requirements. 275 | 276 | e) Convey the object code using peer-to-peer transmission, provided 277 | you inform other peers where the object code and Corresponding 278 | Source of the work are being offered to the general public at no 279 | charge under subsection 6d. 280 | 281 | A separable portion of the object code, whose source code is excluded 282 | from the Corresponding Source as a System Library, need not be 283 | included in conveying the object code work. 284 | 285 | A "User Product" is either (1) a "consumer product", which means any 286 | tangible personal property which is normally used for personal, family, 287 | or household purposes, or (2) anything designed or sold for incorporation 288 | into a dwelling. In determining whether a product is a consumer product, 289 | doubtful cases shall be resolved in favor of coverage. For a particular 290 | product received by a particular user, "normally used" refers to a 291 | typical or common use of that class of product, regardless of the status 292 | of the particular user or of the way in which the particular user 293 | actually uses, or expects or is expected to use, the product. A product 294 | is a consumer product regardless of whether the product has substantial 295 | commercial, industrial or non-consumer uses, unless such uses represent 296 | the only significant mode of use of the product. 297 | 298 | "Installation Information" for a User Product means any methods, 299 | procedures, authorization keys, or other information required to install 300 | and execute modified versions of a covered work in that User Product from 301 | a modified version of its Corresponding Source. The information must 302 | suffice to ensure that the continued functioning of the modified object 303 | code is in no case prevented or interfered with solely because 304 | modification has been made. 305 | 306 | If you convey an object code work under this section in, or with, or 307 | specifically for use in, a User Product, and the conveying occurs as 308 | part of a transaction in which the right of possession and use of the 309 | User Product is transferred to the recipient in perpetuity or for a 310 | fixed term (regardless of how the transaction is characterized), the 311 | Corresponding Source conveyed under this section must be accompanied 312 | by the Installation Information. But this requirement does not apply 313 | if neither you nor any third party retains the ability to install 314 | modified object code on the User Product (for example, the work has 315 | been installed in ROM). 316 | 317 | The requirement to provide Installation Information does not include a 318 | requirement to continue to provide support service, warranty, or updates 319 | for a work that has been modified or installed by the recipient, or for 320 | the User Product in which it has been modified or installed. Access to a 321 | network may be denied when the modification itself materially and 322 | adversely affects the operation of the network or violates the rules and 323 | protocols for communication across the network. 324 | 325 | Corresponding Source conveyed, and Installation Information provided, 326 | in accord with this section must be in a format that is publicly 327 | documented (and with an implementation available to the public in 328 | source code form), and must require no special password or key for 329 | unpacking, reading or copying. 330 | 331 | 7. Additional Terms. 332 | 333 | "Additional permissions" are terms that supplement the terms of this 334 | License by making exceptions from one or more of its conditions. 335 | Additional permissions that are applicable to the entire Program shall 336 | be treated as though they were included in this License, to the extent 337 | that they are valid under applicable law. If additional permissions 338 | apply only to part of the Program, that part may be used separately 339 | under those permissions, but the entire Program remains governed by 340 | this License without regard to the additional permissions. 341 | 342 | When you convey a copy of a covered work, you may at your option 343 | remove any additional permissions from that copy, or from any part of 344 | it. (Additional permissions may be written to require their own 345 | removal in certain cases when you modify the work.) You may place 346 | additional permissions on material, added by you to a covered work, 347 | for which you have or can give appropriate copyright permission. 348 | 349 | Notwithstanding any other provision of this License, for material you 350 | add to a covered work, you may (if authorized by the copyright holders of 351 | that material) supplement the terms of this License with terms: 352 | 353 | a) Disclaiming warranty or limiting liability differently from the 354 | terms of sections 15 and 16 of this License; or 355 | 356 | b) Requiring preservation of specified reasonable legal notices or 357 | author attributions in that material or in the Appropriate Legal 358 | Notices displayed by works containing it; or 359 | 360 | c) Prohibiting misrepresentation of the origin of that material, or 361 | requiring that modified versions of such material be marked in 362 | reasonable ways as different from the original version; or 363 | 364 | d) Limiting the use for publicity purposes of names of licensors or 365 | authors of the material; or 366 | 367 | e) Declining to grant rights under trademark law for use of some 368 | trade names, trademarks, or service marks; or 369 | 370 | f) Requiring indemnification of licensors and authors of that 371 | material by anyone who conveys the material (or modified versions of 372 | it) with contractual assumptions of liability to the recipient, for 373 | any liability that these contractual assumptions directly impose on 374 | those licensors and authors. 375 | 376 | All other non-permissive additional terms are considered "further 377 | restrictions" within the meaning of section 10. If the Program as you 378 | received it, or any part of it, contains a notice stating that it is 379 | governed by this License along with a term that is a further 380 | restriction, you may remove that term. If a license document contains 381 | a further restriction but permits relicensing or conveying under this 382 | License, you may add to a covered work material governed by the terms 383 | of that license document, provided that the further restriction does 384 | not survive such relicensing or conveying. 385 | 386 | If you add terms to a covered work in accord with this section, you 387 | must place, in the relevant source files, a statement of the 388 | additional terms that apply to those files, or a notice indicating 389 | where to find the applicable terms. 390 | 391 | Additional terms, permissive or non-permissive, may be stated in the 392 | form of a separately written license, or stated as exceptions; 393 | the above requirements apply either way. 394 | 395 | 8. Termination. 396 | 397 | You may not propagate or modify a covered work except as expressly 398 | provided under this License. Any attempt otherwise to propagate or 399 | modify it is void, and will automatically terminate your rights under 400 | this License (including any patent licenses granted under the third 401 | paragraph of section 11). 402 | 403 | However, if you cease all violation of this License, then your 404 | license from a particular copyright holder is reinstated (a) 405 | provisionally, unless and until the copyright holder explicitly and 406 | finally terminates your license, and (b) permanently, if the copyright 407 | holder fails to notify you of the violation by some reasonable means 408 | prior to 60 days after the cessation. 409 | 410 | Moreover, your license from a particular copyright holder is 411 | reinstated permanently if the copyright holder notifies you of the 412 | violation by some reasonable means, this is the first time you have 413 | received notice of violation of this License (for any work) from that 414 | copyright holder, and you cure the violation prior to 30 days after 415 | your receipt of the notice. 416 | 417 | Termination of your rights under this section does not terminate the 418 | licenses of parties who have received copies or rights from you under 419 | this License. If your rights have been terminated and not permanently 420 | reinstated, you do not qualify to receive new licenses for the same 421 | material under section 10. 422 | 423 | 9. Acceptance Not Required for Having Copies. 424 | 425 | You are not required to accept this License in order to receive or 426 | run a copy of the Program. Ancillary propagation of a covered work 427 | occurring solely as a consequence of using peer-to-peer transmission 428 | to receive a copy likewise does not require acceptance. However, 429 | nothing other than this License grants you permission to propagate or 430 | modify any covered work. These actions infringe copyright if you do 431 | not accept this License. Therefore, by modifying or propagating a 432 | covered work, you indicate your acceptance of this License to do so. 433 | 434 | 10. Automatic Licensing of Downstream Recipients. 435 | 436 | Each time you convey a covered work, the recipient automatically 437 | receives a license from the original licensors, to run, modify and 438 | propagate that work, subject to this License. You are not responsible 439 | for enforcing compliance by third parties with this License. 440 | 441 | An "entity transaction" is a transaction transferring control of an 442 | organization, or substantially all assets of one, or subdividing an 443 | organization, or merging organizations. If propagation of a covered 444 | work results from an entity transaction, each party to that 445 | transaction who receives a copy of the work also receives whatever 446 | licenses to the work the party's predecessor in interest had or could 447 | give under the previous paragraph, plus a right to possession of the 448 | Corresponding Source of the work from the predecessor in interest, if 449 | the predecessor has it or can get it with reasonable efforts. 450 | 451 | You may not impose any further restrictions on the exercise of the 452 | rights granted or affirmed under this License. For example, you may 453 | not impose a license fee, royalty, or other charge for exercise of 454 | rights granted under this License, and you may not initiate litigation 455 | (including a cross-claim or counterclaim in a lawsuit) alleging that 456 | any patent claim is infringed by making, using, selling, offering for 457 | sale, or importing the Program or any portion of it. 458 | 459 | 11. Patents. 460 | 461 | A "contributor" is a copyright holder who authorizes use under this 462 | License of the Program or a work on which the Program is based. The 463 | work thus licensed is called the contributor's "contributor version". 464 | 465 | A contributor's "essential patent claims" are all patent claims 466 | owned or controlled by the contributor, whether already acquired or 467 | hereafter acquired, that would be infringed by some manner, permitted 468 | by this License, of making, using, or selling its contributor version, 469 | but do not include claims that would be infringed only as a 470 | consequence of further modification of the contributor version. For 471 | purposes of this definition, "control" includes the right to grant 472 | patent sublicenses in a manner consistent with the requirements of 473 | this License. 474 | 475 | Each contributor grants you a non-exclusive, worldwide, royalty-free 476 | patent license under the contributor's essential patent claims, to 477 | make, use, sell, offer for sale, import and otherwise run, modify and 478 | propagate the contents of its contributor version. 479 | 480 | In the following three paragraphs, a "patent license" is any express 481 | agreement or commitment, however denominated, not to enforce a patent 482 | (such as an express permission to practice a patent or covenant not to 483 | sue for patent infringement). To "grant" such a patent license to a 484 | party means to make such an agreement or commitment not to enforce a 485 | patent against the party. 486 | 487 | If you convey a covered work, knowingly relying on a patent license, 488 | and the Corresponding Source of the work is not available for anyone 489 | to copy, free of charge and under the terms of this License, through a 490 | publicly available network server or other readily accessible means, 491 | then you must either (1) cause the Corresponding Source to be so 492 | available, or (2) arrange to deprive yourself of the benefit of the 493 | patent license for this particular work, or (3) arrange, in a manner 494 | consistent with the requirements of this License, to extend the patent 495 | license to downstream recipients. "Knowingly relying" means you have 496 | actual knowledge that, but for the patent license, your conveying the 497 | covered work in a country, or your recipient's use of the covered work 498 | in a country, would infringe one or more identifiable patents in that 499 | country that you have reason to believe are valid. 500 | 501 | If, pursuant to or in connection with a single transaction or 502 | arrangement, you convey, or propagate by procuring conveyance of, a 503 | covered work, and grant a patent license to some of the parties 504 | receiving the covered work authorizing them to use, propagate, modify 505 | or convey a specific copy of the covered work, then the patent license 506 | you grant is automatically extended to all recipients of the covered 507 | work and works based on it. 508 | 509 | A patent license is "discriminatory" if it does not include within 510 | the scope of its coverage, prohibits the exercise of, or is 511 | conditioned on the non-exercise of one or more of the rights that are 512 | specifically granted under this License. You may not convey a covered 513 | work if you are a party to an arrangement with a third party that is 514 | in the business of distributing software, under which you make payment 515 | to the third party based on the extent of your activity of conveying 516 | the work, and under which the third party grants, to any of the 517 | parties who would receive the covered work from you, a discriminatory 518 | patent license (a) in connection with copies of the covered work 519 | conveyed by you (or copies made from those copies), or (b) primarily 520 | for and in connection with specific products or compilations that 521 | contain the covered work, unless you entered into that arrangement, 522 | or that patent license was granted, prior to 28 March 2007. 523 | 524 | Nothing in this License shall be construed as excluding or limiting 525 | any implied license or other defenses to infringement that may 526 | otherwise be available to you under applicable patent law. 527 | 528 | 12. No Surrender of Others' Freedom. 529 | 530 | If conditions are imposed on you (whether by court order, agreement or 531 | otherwise) that contradict the conditions of this License, they do not 532 | excuse you from the conditions of this License. If you cannot convey a 533 | covered work so as to satisfy simultaneously your obligations under this 534 | License and any other pertinent obligations, then as a consequence you may 535 | not convey it at all. For example, if you agree to terms that obligate you 536 | to collect a royalty for further conveying from those to whom you convey 537 | the Program, the only way you could satisfy both those terms and this 538 | License would be to refrain entirely from conveying the Program. 539 | 540 | 13. Remote Network Interaction; Use with the GNU General Public License. 541 | 542 | Notwithstanding any other provision of this License, if you modify the 543 | Program, your modified version must prominently offer all users 544 | interacting with it remotely through a computer network (if your version 545 | supports such interaction) an opportunity to receive the Corresponding 546 | Source of your version by providing access to the Corresponding Source 547 | from a network server at no charge, through some standard or customary 548 | means of facilitating copying of software. This Corresponding Source 549 | shall include the Corresponding Source for any work covered by version 3 550 | of the GNU General Public License that is incorporated pursuant to the 551 | following paragraph. 552 | 553 | Notwithstanding any other provision of this License, you have 554 | permission to link or combine any covered work with a work licensed 555 | under version 3 of the GNU General Public License into a single 556 | combined work, and to convey the resulting work. The terms of this 557 | License will continue to apply to the part which is the covered work, 558 | but the work with which it is combined will remain governed by version 559 | 3 of the GNU General Public License. 560 | 561 | 14. Revised Versions of this License. 562 | 563 | The Free Software Foundation may publish revised and/or new versions of 564 | the GNU Affero General Public License from time to time. Such new versions 565 | will be similar in spirit to the present version, but may differ in detail to 566 | address new problems or concerns. 567 | 568 | Each version is given a distinguishing version number. If the 569 | Program specifies that a certain numbered version of the GNU Affero General 570 | Public License "or any later version" applies to it, you have the 571 | option of following the terms and conditions either of that numbered 572 | version or of any later version published by the Free Software 573 | Foundation. If the Program does not specify a version number of the 574 | GNU Affero General Public License, you may choose any version ever published 575 | by the Free Software Foundation. 576 | 577 | If the Program specifies that a proxy can decide which future 578 | versions of the GNU Affero General Public License can be used, that proxy's 579 | public statement of acceptance of a version permanently authorizes you 580 | to choose that version for the Program. 581 | 582 | Later license versions may give you additional or different 583 | permissions. However, no additional obligations are imposed on any 584 | author or copyright holder as a result of your choosing to follow a 585 | later version. 586 | 587 | 15. Disclaimer of Warranty. 588 | 589 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 590 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 591 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 592 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 593 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 594 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 595 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 596 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 597 | 598 | 16. Limitation of Liability. 599 | 600 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 601 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 602 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 603 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 604 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 605 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 606 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 607 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 608 | SUCH DAMAGES. 609 | 610 | 17. Interpretation of Sections 15 and 16. 611 | 612 | If the disclaimer of warranty and limitation of liability provided 613 | above cannot be given local legal effect according to their terms, 614 | reviewing courts shall apply local law that most closely approximates 615 | an absolute waiver of all civil liability in connection with the 616 | Program, unless a warranty or assumption of liability accompanies a 617 | copy of the Program in return for a fee. 618 | 619 | END OF TERMS AND CONDITIONS 620 | 621 | How to Apply These Terms to Your New Programs 622 | 623 | If you develop a new program, and you want it to be of the greatest 624 | possible use to the public, the best way to achieve this is to make it 625 | free software which everyone can redistribute and change under these terms. 626 | 627 | To do so, attach the following notices to the program. It is safest 628 | to attach them to the start of each source file to most effectively 629 | state the exclusion of warranty; and each file should have at least 630 | the "copyright" line and a pointer to where the full notice is found. 631 | 632 | 633 | Copyright (C) 634 | 635 | This program is free software: you can redistribute it and/or modify 636 | it under the terms of the GNU Affero General Public License as published by 637 | the Free Software Foundation, either version 3 of the License, or 638 | (at your option) any later version. 639 | 640 | This program is distributed in the hope that it will be useful, 641 | but WITHOUT ANY WARRANTY; without even the implied warranty of 642 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 643 | GNU Affero General Public License for more details. 644 | 645 | You should have received a copy of the GNU Affero General Public License 646 | along with this program. If not, see . 647 | 648 | Also add information on how to contact you by electronic and paper mail. 649 | 650 | If your software can interact with users remotely through a computer 651 | network, you should also make sure that it provides a way for users to 652 | get its source. For example, if your program is a web application, its 653 | interface could display a "Source" link that leads users to an archive 654 | of the code. There are many ways you could offer source, and different 655 | solutions will be better for different programs; see section 13 for the 656 | specific requirements. 657 | 658 | You should also get your employer (if you work as a programmer) or school, 659 | if any, to sign a "copyright disclaimer" for the program, if necessary. 660 | For more information on this, and how to apply and follow the GNU AGPL, see 661 | . 662 | -------------------------------------------------------------------------------- /Makefile: -------------------------------------------------------------------------------- 1 | all :; dapp build 2 | clean :; dapp clean 3 | deploy :; dapp create Chai 4 | test: 5 | NETWORK=hevm ./bin/set_constants 6 | dapp test || NETWORK=mainnet ./bin/set_constants 7 | NETWORK=mainnet ./bin/set_constants 8 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # 🍵 2 | 3 | _1 Chai = 1 Dai * Pot.chi_ 4 | 5 | `chai` is an ERC20 token representing a claim on deposits in the DSR. It can be freely converted to and from `dai`: the amount of `dai` claimed by one `chai` is always increasing, at the Dai Savings Rate. Like any well-behaved token, a user's `chai` _balance_ won't change unexpectedly, while the `chai`'s _value_ grows day by day. 6 | 7 | `chai` is a very simple contract. Apart from the standard ERC20 functionality, it also implements the same `permit` off-chain approval as `dai` itself. You can also call `dai(address usr)` to check how many `dai` a given user's `chai` balance claims. The token has no owner or authority. That's all there is to it. 8 | 9 | ## mainnet deployment 10 | 11 | `chai` is live on the mainnet since December 1st at [0x06af07097c9eeb7fd685c692751d5c66db49c215](https://etherscan.io/token/0x06af07097c9eeb7fd685c692751d5c66db49c215) 12 | 13 | You can interact with the Chai contract at [chai.money](https://chai.money). The source for the ui is hosted [here](https://github.com/lucasvo/chui). 14 | 15 | ## audit 16 | 17 | The deployed `chai` contract underwent a two day audit by Trail Of Bits in the beginning of February, finding no security related issues. 18 | A summary can be found [here](./ToB_Letter_of_Attestation_Chai.pdf). 19 | 20 | ## building and testing 21 | 22 | This contract is built using [dapptools](http://dapp.tools/), and follows the standard dapptools procedure for building and testing. 23 | 24 | To compile: 25 | ```sh 26 | $ make all 27 | ``` 28 | 29 | To run the tests: 30 | ```sh 31 | $ make test 32 | ``` 33 | 34 | ## documentation 35 | 36 | ### ERC20 functions 37 | 38 | Chai.sol implements the standard ERC20 functions (balanceOf, allowance, approve, transfer, transferFrom). 39 | 40 | Similar to tokens like `WETH`, `MKR` and `DAI`, an allowance of `uint(-1)` is treated as "infinity", so `transferFrom` calls from an address that has been given an allowance of `uint(-1)` will not cause the allowance to decrease. 41 | 42 | ### Join 43 | 44 | The chai contract is an ERC20 token where minting happens in a function called `join`, which converts a users Dai balance into Chai: 45 | ```sol 46 | function join(address dst, uint wad) external { 47 | uint chi = (now > pot.rho()) ? pot.drip() : pot.chi(); 48 | uint pie = rdiv(wad, chi); 49 | balanceOf[dst] = add(balanceOf[dst], pie); 50 | totalSupply = add(totalSupply, pie); 51 | 52 | daiToken.transferFrom(msg.sender, address(this), wad); 53 | daiJoin.join(address(this), wad); 54 | pot.join(pie); 55 | emit Transfer(address(0), dst, pie); 56 | } 57 | ``` 58 | 59 | Calling this function transfers `wad` Dai into the `pot` contract from `msg.sender`, granting the `dst` address a Chai balance representing their claim of Dai in the `pot` contract. 60 | 61 | ### Exit 62 | 63 | Chai is burned (converted into Dai) through a function called `exit`: 64 | ```sol 65 | function exit(address src, uint wad) public { 66 | require(balanceOf[src] >= wad, "chai/insufficient-balance"); 67 | if (src != msg.sender && allowance[src][msg.sender] != uint(-1)) { 68 | require(allowance[src][msg.sender] >= wad, "chai/insufficient-allowance"); 69 | allowance[src][msg.sender] = sub(allowance[src][msg.sender], wad); 70 | } 71 | balanceOf[src] = sub(balanceOf[src], wad); 72 | totalSupply = sub(totalSupply, wad); 73 | 74 | uint chi = (now > pot.rho()) ? pot.drip() : pot.chi(); 75 | pot.exit(wad); 76 | daiJoin.exit(msg.sender, rmul(chi, wad)); 77 | emit Transfer(src, address(0), wad); 78 | } 79 | ``` 80 | A `msg.sender` with sufficient approval from the address `src` can call this function to decrease their Chai balance by `wad` and transfer its underlying Dai value to the `msg.sender`. 81 | 82 | ### Draw 83 | 84 | Since the `wad` argument to the `exit` function above is denominated in chai, the exact Dai transferred will be determined at the time the transaction is included in a block. If you want to ensure that a specific Dai amount must be transfered, you can use the draw function instead, which takes a dai denominated argument: 85 | 86 | ```sol 87 | // wad is denominated in dai 88 | function draw(address src, uint wad) external { 89 | uint chi = (now > pot.rho()) ? pot.drip() : pot.chi(); 90 | // rounding up ensures usr gets at least wad dai 91 | exit(src, rdivup(wad, chi)); 92 | } 93 | ``` 94 | 95 | 96 | ### Move 97 | 98 | Similarly to `draw`, there is a transferFrom function with a dai denominated argument, ensuring that the receiving address will receive Chai worth at least `wad` dai: 99 | 100 | ```sol 101 | // like transferFrom but dai-denominated 102 | function move(address src, address dst, uint wad) external returns (bool) { 103 | uint chi = (now > pot.rho()) ? pot.drip() : pot.chi(); 104 | // rounding up ensures dst gets at least wad dai 105 | return transferFrom(src, dst, rdivup(wad, chi)); 106 | } 107 | ``` 108 | 109 | ### Permit 110 | 111 | The permit method lets a user approve an address to spend on their behalf by signing a ERC712 typed message called `permit`. 112 | 113 | A `permit` consists of the following components: 114 | 115 | - `holder`, the address granting the permission and the signer of the message 116 | - `spender`, the address to which permission is being granted or denied 117 | - `nonce`, for replay attack protection 118 | - `allowed`, whether the `spender`s permission is being granted or revoked 119 | 120 | Messages are signed using the procedure described in [ERC712](https://eips.ethereum.org/EIPS/eip-712), using the `PERMIT_TYPEHASH` and `DOMAIN_SEPARATOR` constants: 121 | ```sol 122 | bytes32 public constant DOMAIN_SEPARATOR = 0x0b50407de9fa158c2cba01a99633329490dfd22989a150c20e8c7b4c1fb0fcc3; 123 | // keccak256("Permit(address holder,address spender,uint256 nonce,uint256 expiry,bool allowed)")); 124 | bytes32 public constant PERMIT_TYPEHASH = 0xea2aa0a1be11a07ed86d755c93467f4f82362b452371d1ba94d1715123511acb; 125 | ``` 126 | 127 | `permit` are processed by calling the `permit` method, which increments the `holder` nonce and approves the `spender` to spend on the behalf of `holder` if `allowed` is true, and revokes it otherwise: 128 | 129 | ```sol 130 | // --- Approve by signature --- 131 | function permit(address holder, address spender, uint256 nonce, uint256 expiry, bool allowed, uint8 v, bytes32 r, bytes32 s) external 132 | { 133 | bytes32 digest = keccak256(abi.encodePacked( 134 | "\x19\x01", 135 | DOMAIN_SEPARATOR, 136 | keccak256(abi.encode(PERMIT_TYPEHASH, 137 | holder, 138 | spender, 139 | nonce, 140 | expiry, 141 | allowed)))); 142 | require(holder != address(0), "chai/invalid holder"); 143 | require(holder == ecrecover(digest, v, r, s), "chai/invalid-permit"); 144 | require(expiry == 0 || now <= expiry, "chai/permit-expired"); 145 | require(nonce == nonces[holder]++, "chai/invalid-nonce"); 146 | 147 | uint can = allowed ? uint(-1) : 0; 148 | allowance[holder][spender] = can; 149 | emit Approval(holder, spender, can); 150 | } 151 | ``` 152 | -------------------------------------------------------------------------------- /ToB_Letter_of_Attestation_Chai.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dapphub/chai/b75edb6409d51fd91e53e73f77092b573c4242a9/ToB_Letter_of_Attestation_Chai.pdf -------------------------------------------------------------------------------- /bin/conf.sh: -------------------------------------------------------------------------------- 1 | if [ "$NETWORK" = "mainnet" ]; then 2 | # mainnet deployment 3 | # shellcheck source=conf/mainnet.sh 4 | . "${0%/*}/conf/mainnet.sh" 5 | elif [ "$NETWORK" = "kovan" ]; then 6 | # kovan deployment 7 | # shellcheck source=conf/kovan.sh 8 | . "${0%/*}/conf/kovan.sh" 9 | elif [ "$NETWORK" = "hevm" ]; then 10 | # hevm unit test deployment 11 | # shellcheck source=conf/hevm.sh 12 | . "${0%/*}/conf/hevm.sh" 13 | else 14 | echo "unknown network. Allowed values are: mainnet, kovan, hevm." 15 | exit 1 16 | fi 17 | -------------------------------------------------------------------------------- /bin/conf/hevm.sh: -------------------------------------------------------------------------------- 1 | CHAIN_ID=99 2 | ADDRESS=0xd122f8f92737fc00fb3d62d4ed9244d393663870 3 | VAT=0x0F1c6673615352379AFC1a60e3D0234101D67eb2 4 | POT=0xc351B89C286288B9201835f78dbbccaDA357671e 5 | JOIN=0x2D6B98058E84Dcb8b57fb8C79613bD858af65975 6 | DAI=0x959DC1D68ba3a9f6959239135bcbc854b781eb9a 7 | -------------------------------------------------------------------------------- /bin/conf/kovan.sh: -------------------------------------------------------------------------------- 1 | CHAIN_ID=42 2 | ADDRESS=0xb641957b6c29310926110848db2d464c8c3c3f38 3 | VAT=0xbA987bDB501d131f766fEe8180Da5d81b34b69d9 4 | POT=0xEA190DBDC7adF265260ec4dA6e9675Fd4f5A78bb 5 | JOIN=0x5AA71a3ae1C0bd6ac27A1f28e1415fFFB6F15B8c 6 | DAI=0x4F96Fe3b7A6Cf9725f59d353F723c1bDb64CA6Aa 7 | -------------------------------------------------------------------------------- /bin/conf/mainnet.sh: -------------------------------------------------------------------------------- 1 | CHAIN_ID=1 2 | ADDRESS=0x06af07097c9eeb7fd685c692751d5c66db49c215 3 | VAT=0x35D1b3F3D7966A1DFe207aa4514C12a259A0492B 4 | POT=0x197E90f9FAD81970bA7976f33CbD77088E5D7cf7 5 | JOIN=0x9759A6Ac90977b93B58547b4A71c78317f391A28 6 | DAI=0x6B175474E89094C44Da98b954EedeAC495271d0F 7 | -------------------------------------------------------------------------------- /bin/domain_separator: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env bash 2 | # shellcheck source=conf.sh 3 | source "${0%/*}/conf.sh" 4 | 5 | VERSION='1' 6 | NAME="Chai" 7 | DOMAIN_SEPARATOR=$(seth keccak \ 8 | $(seth keccak $(seth --from-ascii "EIP712Domain(string name,string version,uint256 chainId,address verifyingContract)"))\ 9 | $(echo $(seth keccak $(seth --from-ascii "$NAME"))\ 10 | $(seth keccak $(seth --from-ascii $VERSION))$(seth --to-uint256 $CHAIN_ID)\ 11 | $(seth --to-uint256 $ADDRESS) | sed 's/0x//g')) 12 | echo "$DOMAIN_SEPARATOR" 13 | -------------------------------------------------------------------------------- /bin/permit: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env bash 2 | 3 | display_usage() { 4 | echo "Usage: permit [expiry]" 5 | } 6 | 7 | if [ $# -lt 3 ]; then 8 | display_usage 9 | exit 1 10 | fi 11 | 12 | if [ -z ${ETH_FROM+x} ]; then 13 | echo "ETH_FROM must be set"; 14 | exit 1 15 | fi 16 | 17 | export NETWORK=${NETWORK:-mainnet} 18 | # shellcheck source=conf.sh 19 | source "${0%/*}/conf.sh" 20 | DOMAIN_SEPARATOR=$("${0%/*}/domain_separator") 21 | 22 | # permit type data 23 | permit_TYPEHASH=$(seth keccak $(seth --from-ascii "Permit(address holder,address spender,uint256 nonce,uint256 expiry,bool allowed)")) 24 | 25 | # permit data 26 | HOLDER=$ETH_FROM 27 | SPENDER=$1 28 | NONCE=$2 29 | ALLOWED=$3 30 | DEADLINE=${4:-0} 31 | 32 | echo "Sign the following permit?" 33 | echo "HOLDER $HOLDER" 34 | echo "SPENDER $SPENDER" 35 | echo "NONCE $NONCE" 36 | echo "ALLOWED $ALLOWED" 37 | echo "DEADLINE $DEADLINE" 38 | echo "Enter passphrase for $ETH_FROM" 39 | 40 | MESSAGE=0x1901\ 41 | $(echo $DOMAIN_SEPARATOR\ 42 | $(seth keccak \ 43 | $permit_TYPEHASH\ 44 | $(echo $(seth --to-uint256 $HOLDER)\ 45 | $(seth --to-uint256 $SPENDER)\ 46 | $(seth --to-uint256 $NONCE)\ 47 | $(seth --to-uint256 $DEADLINE)\ 48 | $(seth --to-uint256 $ALLOWED)\ 49 | | sed 's/0x//g')) \ 50 | | sed 's/0x//g') 51 | SIG=$(ethsign msg --no-prefix --data $MESSAGE) 52 | 53 | printf '{"permit": {"holder":"%s","spender":"%s","nonce":"%s", "expiry": "%s", "allowed": "%s", "v": "%s", "r": "%s", "s": "%s"}}\n' "$HOLDER" "$SPENDER" "$NONCE" "$DEADLINE" "$ALLOWED" $((0x$(echo "$SIG" | cut -c 131-132))) $(echo "$SIG" | cut -c 1-66) "0x"$(echo "$SIG" | cut -c 67-130) 54 | -------------------------------------------------------------------------------- /bin/set_constants: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env bash 2 | set -e 3 | 4 | display_usage() { 5 | echo "Usage: NETWORK={mainnet|kovan|hevm} set_constants" 6 | } 7 | 8 | export NETWORK=${NETWORK:-mainnet} 9 | # shellcheck source=conf.sh 10 | source "${0%/*}/conf.sh" 11 | DOMAIN_SEPARATOR=$("${0%/*}/domain_separator" "$1") 12 | sed -i -e "s/DOMAIN_SEPARATOR = .*;/DOMAIN_SEPARATOR = $DOMAIN_SEPARATOR;/g" ./src/chai.sol 13 | sed -i -e "s/VatLike(.*);/VatLike($VAT);/g" ./src/chai.sol 14 | sed -i -e "s/PotLike(.*);/PotLike($POT);/g" ./src/chai.sol 15 | sed -i -e "s/JoinLike(.*);/JoinLike($JOIN);/g" ./src/chai.sol 16 | sed -i -e "s/GemLike(.*);/GemLike($DAI);/g" ./src/chai.sol 17 | sed -i -e "s/GemLike(.*);/GemLike($DAI);/g" ./src/chai.sol 18 | sed -i -e "s/bytes(version)), .*,/bytes(version)), $CHAIN_ID,/g" ./src/chai.sol 19 | -------------------------------------------------------------------------------- /src/chai.sol: -------------------------------------------------------------------------------- 1 | // chai.sol -- a dai savings token 2 | // Copyright (C) 2017, 2018, 2019 dbrock, rain, mrchico, lucasvo, livnev 3 | 4 | // This program is free software: you can redistribute it and/or modify 5 | // it under the terms of the GNU Affero General Public License as published by 6 | // the Free Software Foundation, either version 3 of the License, or 7 | // (at your option) any later version. 8 | // 9 | // This program is distributed in the hope that it will be useful, 10 | // but WITHOUT ANY WARRANTY; without even the implied warranty of 11 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 12 | // GNU Affero General Public License for more details. 13 | // 14 | // You should have received a copy of the GNU Affero General Public License 15 | // along with this program. If not, see . 16 | 17 | pragma solidity 0.5.12; 18 | 19 | contract VatLike { 20 | function hope(address) external; 21 | } 22 | 23 | contract PotLike { 24 | function chi() external returns (uint256); 25 | function rho() external returns (uint256); 26 | function drip() external returns (uint256); 27 | function join(uint256) external; 28 | function exit(uint256) external; 29 | } 30 | 31 | contract JoinLike { 32 | function join(address, uint) external; 33 | function exit(address, uint) external; 34 | } 35 | 36 | contract GemLike { 37 | function transferFrom(address,address,uint) external returns (bool); 38 | function approve(address,uint) external returns (bool); 39 | } 40 | 41 | contract Chai { 42 | // --- Data --- 43 | VatLike public vat = VatLike(0x35D1b3F3D7966A1DFe207aa4514C12a259A0492B); 44 | PotLike public pot = PotLike(0x197E90f9FAD81970bA7976f33CbD77088E5D7cf7); 45 | JoinLike public daiJoin = JoinLike(0x9759A6Ac90977b93B58547b4A71c78317f391A28); 46 | GemLike public daiToken = GemLike(0x6B175474E89094C44Da98b954EedeAC495271d0F); 47 | 48 | // --- ERC20 Data --- 49 | string public constant name = "Chai"; 50 | string public constant symbol = "CHAI"; 51 | string public constant version = "1"; 52 | uint8 public constant decimals = 18; 53 | uint256 public totalSupply; 54 | 55 | mapping (address => uint) public balanceOf; 56 | mapping (address => mapping (address => uint)) public allowance; 57 | mapping (address => uint) public nonces; 58 | 59 | event Approval(address indexed src, address indexed guy, uint wad); 60 | event Transfer(address indexed src, address indexed dst, uint wad); 61 | 62 | // --- Math --- 63 | uint constant RAY = 10 ** 27; 64 | function add(uint x, uint y) internal pure returns (uint z) { 65 | require((z = x + y) >= x); 66 | } 67 | function sub(uint x, uint y) internal pure returns (uint z) { 68 | require((z = x - y) <= x); 69 | } 70 | function mul(uint x, uint y) internal pure returns (uint z) { 71 | require(y == 0 || (z = x * y) / y == x); 72 | } 73 | function rmul(uint x, uint y) internal pure returns (uint z) { 74 | // always rounds down 75 | z = mul(x, y) / RAY; 76 | } 77 | function rdiv(uint x, uint y) internal pure returns (uint z) { 78 | // always rounds down 79 | z = mul(x, RAY) / y; 80 | } 81 | function rdivup(uint x, uint y) internal pure returns (uint z) { 82 | // always rounds up 83 | z = add(mul(x, RAY), sub(y, 1)) / y; 84 | } 85 | 86 | // --- EIP712 niceties --- 87 | bytes32 public constant DOMAIN_SEPARATOR = 0x0b50407de9fa158c2cba01a99633329490dfd22989a150c20e8c7b4c1fb0fcc3; 88 | // keccak256("Permit(address holder,address spender,uint256 nonce,uint256 expiry,bool allowed)")); 89 | bytes32 public constant PERMIT_TYPEHASH = 0xea2aa0a1be11a07ed86d755c93467f4f82362b452371d1ba94d1715123511acb; 90 | 91 | constructor() public { 92 | assert (DOMAIN_SEPARATOR == 93 | keccak256(abi.encode( 94 | keccak256("EIP712Domain(string name,string version,uint256 chainId,address verifyingContract)"), 95 | keccak256(bytes(name)), keccak256(bytes(version)), 1, address(this))) 96 | ); 97 | 98 | vat.hope(address(daiJoin)); 99 | vat.hope(address(pot)); 100 | 101 | daiToken.approve(address(daiJoin), uint(-1)); 102 | } 103 | 104 | // --- Token --- 105 | function transfer(address dst, uint wad) external returns (bool) { 106 | return transferFrom(msg.sender, dst, wad); 107 | } 108 | // like transferFrom but dai-denominated 109 | function move(address src, address dst, uint wad) external returns (bool) { 110 | uint chi = (now > pot.rho()) ? pot.drip() : pot.chi(); 111 | // rounding up ensures dst gets at least wad dai 112 | return transferFrom(src, dst, rdivup(wad, chi)); 113 | } 114 | function transferFrom(address src, address dst, uint wad) 115 | public returns (bool) 116 | { 117 | require(balanceOf[src] >= wad, "chai/insufficient-balance"); 118 | if (src != msg.sender && allowance[src][msg.sender] != uint(-1)) { 119 | require(allowance[src][msg.sender] >= wad, "chai/insufficient-allowance"); 120 | allowance[src][msg.sender] = sub(allowance[src][msg.sender], wad); 121 | } 122 | balanceOf[src] = sub(balanceOf[src], wad); 123 | balanceOf[dst] = add(balanceOf[dst], wad); 124 | emit Transfer(src, dst, wad); 125 | return true; 126 | } 127 | function approve(address usr, uint wad) external returns (bool) { 128 | allowance[msg.sender][usr] = wad; 129 | emit Approval(msg.sender, usr, wad); 130 | return true; 131 | } 132 | 133 | // --- Approve by signature --- 134 | function permit(address holder, address spender, uint256 nonce, uint256 expiry, bool allowed, uint8 v, bytes32 r, bytes32 s) external 135 | { 136 | bytes32 digest = keccak256(abi.encodePacked( 137 | "\x19\x01", 138 | DOMAIN_SEPARATOR, 139 | keccak256(abi.encode(PERMIT_TYPEHASH, 140 | holder, 141 | spender, 142 | nonce, 143 | expiry, 144 | allowed)))); 145 | require(holder != address(0), "chai/invalid holder"); 146 | require(holder == ecrecover(digest, v, r, s), "chai/invalid-permit"); 147 | require(expiry == 0 || now <= expiry, "chai/permit-expired"); 148 | require(nonce == nonces[holder]++, "chai/invalid-nonce"); 149 | 150 | uint can = allowed ? uint(-1) : 0; 151 | allowance[holder][spender] = can; 152 | emit Approval(holder, spender, can); 153 | } 154 | 155 | function dai(address usr) external returns (uint wad) { 156 | uint chi = (now > pot.rho()) ? pot.drip() : pot.chi(); 157 | wad = rmul(chi, balanceOf[usr]); 158 | } 159 | // wad is denominated in dai 160 | function join(address dst, uint wad) external { 161 | uint chi = (now > pot.rho()) ? pot.drip() : pot.chi(); 162 | uint pie = rdiv(wad, chi); 163 | balanceOf[dst] = add(balanceOf[dst], pie); 164 | totalSupply = add(totalSupply, pie); 165 | 166 | daiToken.transferFrom(msg.sender, address(this), wad); 167 | daiJoin.join(address(this), wad); 168 | pot.join(pie); 169 | emit Transfer(address(0), dst, pie); 170 | } 171 | 172 | // wad is denominated in (1/chi) * dai 173 | function exit(address src, uint wad) public { 174 | require(balanceOf[src] >= wad, "chai/insufficient-balance"); 175 | if (src != msg.sender && allowance[src][msg.sender] != uint(-1)) { 176 | require(allowance[src][msg.sender] >= wad, "chai/insufficient-allowance"); 177 | allowance[src][msg.sender] = sub(allowance[src][msg.sender], wad); 178 | } 179 | balanceOf[src] = sub(balanceOf[src], wad); 180 | totalSupply = sub(totalSupply, wad); 181 | 182 | uint chi = (now > pot.rho()) ? pot.drip() : pot.chi(); 183 | pot.exit(wad); 184 | daiJoin.exit(msg.sender, rmul(chi, wad)); 185 | emit Transfer(src, address(0), wad); 186 | } 187 | 188 | // wad is denominated in dai 189 | function draw(address src, uint wad) external { 190 | uint chi = (now > pot.rho()) ? pot.drip() : pot.chi(); 191 | // rounding up ensures usr gets at least wad dai 192 | exit(src, rdivup(wad, chi)); 193 | } 194 | } 195 | -------------------------------------------------------------------------------- /src/test/chai.t.sol: -------------------------------------------------------------------------------- 1 | /// chai.t.sol -- tests for chai.sol 2 | 3 | // Copyright (C) 2017, 2018, 2019 dbrock, rain, mrchico, lucasvo, livnev 4 | 5 | // This program is free software: you can redistribute it and/or modify 6 | // it under the terms of the GNU General Public License as published by 7 | // the Free Software Foundation, either version 3 of the License, or 8 | // (at your option) any later version. 9 | 10 | // This program is distributed in the hope that it will be useful, 11 | // but WITHOUT ANY WARRANTY; without even the implied warranty of 12 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 13 | // GNU General Public License for more details. 14 | 15 | // You should have received a copy of the GNU General Public License 16 | // along with this program. If not, see . 17 | 18 | pragma solidity >=0.4.23; 19 | 20 | import "ds-test/test.sol"; 21 | import {Vat} from 'dss/vat.sol'; 22 | import {Pot} from 'dss/pot.sol'; 23 | import {Dai} from 'dss/dai.sol'; 24 | import {DaiJoin} from 'dss/join.sol'; 25 | import "../chai.sol"; 26 | 27 | contract Hevm { 28 | function warp(uint256) public; 29 | } 30 | 31 | contract ChaiSetup { 32 | Chai chai; 33 | 34 | Vat vat; 35 | Pot pot; 36 | Dai dai; 37 | DaiJoin daiJoin; 38 | address vow; 39 | 40 | function rad(uint wad_) internal pure returns (uint) { 41 | return wad_ * 10 ** 27; 42 | } 43 | function wad(uint rad_) internal pure returns (uint) { 44 | return rad_ / 10 ** 27; 45 | } 46 | 47 | function setUp() public { 48 | // set up Vat, Pot, and Dai 49 | vat = new Vat(); 50 | pot = new Pot(address(vat)); 51 | dai = new Dai(99); 52 | daiJoin = new DaiJoin(address(vat), address(dai)); 53 | vat.rely(address(pot)); 54 | dai.rely(address(daiJoin)); 55 | 56 | // use a dummy vow 57 | vow = address(bytes20("vow")); 58 | pot.file("vow", vow); 59 | 60 | // set up Chai 61 | chai = new Chai(); 62 | 63 | // gives this 100 dai to play with 64 | vat.suck(address(this), address(this), rad(100 ether)); 65 | vat.hope(address(daiJoin)); 66 | daiJoin.exit(address(this), 100 ether); 67 | 68 | dai.approve(address(daiJoin), uint(-1)); 69 | dai.approve(address(chai), uint(-1)); 70 | } 71 | } 72 | 73 | contract ChaiTest is DSTest, ChaiSetup { 74 | Hevm hevm; 75 | 76 | uint constant RAY = 10 ** 27; 77 | function mul(uint x, uint y) internal pure returns (uint z) { 78 | require(y == 0 || (z = x * y) / y == x); 79 | } 80 | function rdiv(uint x, uint y) internal pure returns (uint z) { 81 | z = mul(x, RAY) / y; 82 | } 83 | 84 | function setUp() public { 85 | hevm = Hevm(0x7109709ECfa91a80626fF3989D68f67F5b1DD12D); 86 | hevm.warp(604411200); 87 | super.setUp(); 88 | } 89 | 90 | function test_initial_balance() public { 91 | assertEq(dai.balanceOf(address(this)), 100 ether); 92 | } 93 | 94 | function test_vat() public { 95 | assertEq(address(chai.vat()), address(vat)); 96 | } 97 | 98 | function test_pot() public { 99 | assertEq(address(chai.pot()), address(pot)); 100 | } 101 | 102 | function test_daiJoin() public { 103 | assertEq(address(chai.daiJoin()), address(daiJoin)); 104 | } 105 | 106 | function test_dai() public { 107 | assertEq(address(chai.daiToken()), address(dai)); 108 | } 109 | 110 | function test_chai() public { 111 | assertEq(address(chai), address(0xd122F8f92737FC00Fb3d62d4eD9244D393663870)); 112 | } 113 | 114 | function test_join_then_exit() public { 115 | chai.join(address(this), 10 ether); 116 | assertEq(dai.balanceOf(address(this)), 90 ether); 117 | assertEq(chai.balanceOf(address(this)), 10 ether); 118 | assertEq(chai.dai(address(this)), 10 ether); 119 | chai.exit(address(this), 10 ether); 120 | assertEq(chai.balanceOf(address(this)), 0 ether); 121 | assertEq(dai.balanceOf(address(this)), 100 ether); 122 | } 123 | 124 | function testFail_join_then_exit_too_much() public { 125 | chai.join(address(this), 10 ether); 126 | chai.exit(address(this), 10 ether + 1); 127 | } 128 | 129 | function test_save_1d() public { 130 | pot.file("dsr", uint(1000000564701133626865910626)); // 5% / day 131 | 132 | chai.join(address(this), 10 ether); 133 | assertEq(chai.balanceOf(address(this)), 10 ether); 134 | assertEq(chai.dai(address(this)), 10 ether); 135 | 136 | hevm.warp(now + 1 days); 137 | assertEq(chai.balanceOf(address(this)), 10 ether); 138 | assertEq(chai.dai(address(this)), 10 ether + 0.5 ether); 139 | chai.exit(address(this), 10 ether); 140 | assertEq(dai.balanceOf(address(this)), 100 ether + 0.5 ether); 141 | } 142 | 143 | function test_save_2d() public { 144 | pot.file("dsr", uint(1000000564701133626865910626)); // 5% / day 145 | 146 | chai.join(address(this), 10 ether); 147 | assertEq(chai.balanceOf(address(this)), 10 ether); 148 | hevm.warp(now + 1 days); 149 | assertEq(chai.balanceOf(address(this)), 10 ether); 150 | 151 | pot.drip(); 152 | assertEq(chai.dai(address(this)), 10 ether + 0.5 ether); 153 | pot.file("dsr", uint(1000001103127689513476993127)); // 10% / day 154 | 155 | hevm.warp(now + 1 days); 156 | assertEq(chai.balanceOf(address(this)), 10 ether); 157 | assertEq(chai.dai(address(this)), 10 ether + 1.55 ether); 158 | chai.exit(address(this), 10 ether); 159 | assertEq(dai.balanceOf(address(this)), 100 ether + 1.55 ether); 160 | } 161 | function test_save_rounding_residue() public { 162 | pot.file("dsr", uint(1000000564701133626865910626)); // 5% / day 163 | // make chi nasty 164 | hevm.warp(now + 1 days); 165 | 166 | chai.join(address(this), 10 ether); 167 | uint chaiBal = rdiv(10 ether, pot.chi()); 168 | assertEq(chai.balanceOf(address(this)), chaiBal); 169 | // 1 wei less due to rounding 170 | assertEq(chai.dai(address(this)), 10 ether - 1); 171 | 172 | hevm.warp(now + 1 days); 173 | assertEq(chai.balanceOf(address(this)), chaiBal); 174 | assertEq(chai.dai(address(this)), 10 ether + 0.5 ether - 1); 175 | chai.exit(address(this), chaiBal); 176 | assertEq(dai.balanceOf(address(this)), 100 ether + 0.5 ether - 1); 177 | } 178 | function test_move() public { 179 | pot.file("dsr", uint(1000000564701133626865910626)); // 5% / day 180 | 181 | chai.join(address(this), 10 ether); 182 | assertEq(chai.balanceOf(address(this)), 10 ether); 183 | assertEq(chai.dai(address(this)), 10 ether); 184 | hevm.warp(now + 1 days); 185 | assertEq(chai.balanceOf(address(this)), 10 ether); 186 | assertEq(chai.dai(address(this)), 10 ether + 0.5 ether); 187 | 188 | chai.move(address(this), address(0xcafebabe), 0.5 ether); 189 | 190 | // we sent one more than requested because of rounding 191 | assertEq(chai.dai(address(this)), 10 ether - 1); 192 | // cafebabe got no less than requested 193 | assertEq(chai.dai(address(0xcafebabe)), 0.5 ether); 194 | 195 | chai.exit(address(this), chai.balanceOf(address(this))); 196 | assertEq(dai.balanceOf(address(this)), 100 ether - 1); 197 | } 198 | function test_move_receive_extra() public { 199 | pot.file("dsr", uint(1000000564701133626865910626)); // 5% / day 200 | // make chi nasty 201 | hevm.warp(now + 100 days); 202 | 203 | chai.join(address(this), 10 ether); 204 | uint chaiBal = rdiv(10 ether, pot.chi()); 205 | assertEq(chai.balanceOf(address(this)), chaiBal); 206 | // 17 wei less due to rounding 207 | assertEq(chai.dai(address(this)), 10 ether - 17); 208 | 209 | hevm.warp(now + 1 days); 210 | assertEq(chai.balanceOf(address(this)), chaiBal); 211 | // 1 wei less due to rounding 212 | assertEq(chai.dai(address(this)), 10 ether + 0.5 ether - 17 - 1); 213 | 214 | chai.move(address(this), address(0xcafebabe), 0.5 ether); 215 | 216 | // we sent 26 wei more than requested because of rounding 217 | assertEq(chai.dai(address(this)), 10 ether - 17 - 1 - 26); 218 | // cafebabe got no less than requested 219 | assertEq(chai.dai(address(0xcafebabe)), 0.5 ether + 25); 220 | // chai is globally conserved 221 | assertEq(chai.balanceOf(address(this)) + chai.balanceOf(address(0xcafebabe)), chaiBal); 222 | 223 | chai.exit(address(this), chai.balanceOf(address(this))); 224 | assertEq(dai.balanceOf(address(this)), 100 ether - 17 - 1 - 26); 225 | } 226 | function test_draw() public { 227 | pot.file("dsr", uint(1000000564701133626865910626)); // 5% / day 228 | // make chi nasty 229 | hevm.warp(now + 100 days); 230 | 231 | chai.join(address(this), 10 ether); 232 | uint chaiBal = rdiv(10 ether, pot.chi()); 233 | assertEq(chai.balanceOf(address(this)), chaiBal); 234 | // 17 wei less due to rounding 235 | assertEq(chai.dai(address(this)), 10 ether - 17); 236 | 237 | hevm.warp(now + 1 days); 238 | assertEq(chai.balanceOf(address(this)), chaiBal); 239 | // 1 wei less due to rounding 240 | assertEq(chai.dai(address(this)), 10 ether + 0.5 ether - 18); 241 | chai.draw(address(this), 10 ether); 242 | // withdrew 94 wei extra due to rounding 243 | assertEq(dai.balanceOf(address(this)), 100 ether + 94); 244 | 245 | chai.exit(address(this), chai.balanceOf(address(this))); 246 | // 1 wei less due to rounding 247 | assertEq(dai.balanceOf(address(this)), 100 ether + 0.5 ether - 18 - 1); 248 | } 249 | } 250 | 251 | contract ChaiUser { 252 | Chai token; 253 | 254 | constructor(Chai token_) public { 255 | token = token_; 256 | } 257 | 258 | function doTransferFrom(address from, address to, uint amount) 259 | public 260 | returns (bool) 261 | { 262 | return token.transferFrom(from, to, amount); 263 | } 264 | 265 | function doTransfer(address to, uint amount) 266 | public 267 | returns (bool) 268 | { 269 | return token.transfer(to, amount); 270 | } 271 | 272 | function doApprove(address recipient, uint amount) 273 | public 274 | returns (bool) 275 | { 276 | return token.approve(recipient, amount); 277 | } 278 | 279 | function doAllowance(address owner, address spender) 280 | public 281 | view 282 | returns (uint) 283 | { 284 | return token.allowance(owner, spender); 285 | } 286 | 287 | function doBalanceOf(address who) public view returns (uint) { 288 | return token.balanceOf(who); 289 | } 290 | 291 | function doApprove(address guy) 292 | public 293 | returns (bool) 294 | { 295 | return token.approve(guy, uint(-1)); 296 | } 297 | } 298 | 299 | contract TokenTest is DSTest, ChaiSetup { 300 | Hevm hevm; 301 | 302 | uint constant initialBalanceThis = 20 ether; 303 | uint constant initialBalanceCal = 10 ether; 304 | 305 | address user1; 306 | address user2; 307 | address self; 308 | 309 | uint amount = 2; 310 | uint fee = 1; 311 | uint nonce = 0; 312 | uint deadline = 0; 313 | address cal = 0xc3455912Cf4bF115835A655c70bCeFC9cF4568eB; 314 | address del = 0xdd2d5D3f7f1b35b7A0601D6A00DbB7D44Af58479; 315 | bytes32 r = 0x36c992f216dec10f498e240a4ebd001c7903de63edd515e3f61bb7c07f33864a; 316 | bytes32 s = 0x2b2848feb28c797ecb9d331a51ea2403fb10d73800cc943c8d6c617b8a52fa2a; 317 | uint8 v = 28; 318 | bytes32 _r = 0x4dcc9f68dd44287a12c46034b130072285cbe7d2b4bfb589546bbf7d1fb51192; 319 | bytes32 _s = 0x06074bac08149b9e4c5bd09911badaefa18f49b6d1fe7ee80b266289b4f84261; 320 | uint8 _v = 27; 321 | 322 | function setUp() public { 323 | hevm = Hevm(0x7109709ECfa91a80626fF3989D68f67F5b1DD12D); 324 | hevm.warp(604411200); 325 | super.setUp(); 326 | chai.join(address(this), initialBalanceThis); 327 | // have to join via this because cal can't approve chai 328 | chai.join(address(this), initialBalanceCal); 329 | chai.transfer(cal, initialBalanceCal); 330 | user1 = address(new ChaiUser(chai)); 331 | user2 = address(new ChaiUser(chai)); 332 | self = address(this); 333 | } 334 | 335 | function testSetupPrecondition() public { 336 | assertEq(chai.balanceOf(self), initialBalanceThis); 337 | } 338 | 339 | function testTransferCost() public logs_gas { 340 | chai.transfer(address(0), 10); 341 | } 342 | 343 | function testAllowanceStartsAtZero() public logs_gas { 344 | assertEq(chai.allowance(user1, user2), 0); 345 | } 346 | 347 | function testValidTransfers() public logs_gas { 348 | uint sentAmount = 250; 349 | emit log_named_address("chai11111", address(chai)); 350 | chai.transfer(user2, sentAmount); 351 | assertEq(chai.balanceOf(user2), sentAmount); 352 | assertEq(chai.balanceOf(self), initialBalanceThis - sentAmount); 353 | } 354 | 355 | function testFailWrongAccountTransfers() public logs_gas { 356 | uint sentAmount = 250; 357 | chai.transferFrom(user2, self, sentAmount); 358 | } 359 | 360 | function testFailInsufficientFundsTransfers() public logs_gas { 361 | uint sentAmount = 250; 362 | chai.transfer(user1, initialBalanceThis - sentAmount); 363 | chai.transfer(user2, sentAmount + 1); 364 | } 365 | 366 | function testApproveSetsAllowance() public logs_gas { 367 | emit log_named_address("Test", self); 368 | emit log_named_address("Chai", address(chai)); 369 | emit log_named_address("Me", self); 370 | emit log_named_address("User 2", user2); 371 | chai.approve(user2, 25); 372 | assertEq(chai.allowance(self, user2), 25); 373 | } 374 | 375 | function testChargesAmountApproved() public logs_gas { 376 | uint amountApproved = 20; 377 | chai.approve(user2, amountApproved); 378 | assertTrue(ChaiUser(user2).doTransferFrom(self, user2, amountApproved)); 379 | assertEq(chai.balanceOf(self), initialBalanceThis - amountApproved); 380 | } 381 | 382 | function testFailTransferWithoutApproval() public logs_gas { 383 | chai.transfer(user1, 50); 384 | chai.transferFrom(user1, self, 1); 385 | } 386 | 387 | function testFailChargeMoreThanApproved() public logs_gas { 388 | chai.transfer(user1, 50); 389 | ChaiUser(user1).doApprove(self, 20); 390 | chai.transferFrom(user1, self, 21); 391 | } 392 | function testTransferFromSelf() public { 393 | chai.transferFrom(self, user1, 50); 394 | assertEq(chai.balanceOf(user1), 50); 395 | } 396 | function testFailTransferFromSelfNonArbitrarySize() public { 397 | // you shouldn't be able to evade balance checks by transferring 398 | // to yourself 399 | chai.transferFrom(self, self, chai.balanceOf(self) + 1); 400 | } 401 | function testFailUntrustedTransferFrom() public { 402 | assertEq(chai.allowance(self, user2), 0); 403 | ChaiUser(user1).doTransferFrom(self, user2, 200); 404 | } 405 | function testTrusting() public { 406 | assertEq(chai.allowance(self, user2), 0); 407 | chai.approve(user2, uint(-1)); 408 | assertEq(chai.allowance(self, user2), uint(-1)); 409 | chai.approve(user2, 0); 410 | assertEq(chai.allowance(self, user2), 0); 411 | } 412 | function testTrustedTransferFrom() public { 413 | chai.approve(user1, uint(-1)); 414 | ChaiUser(user1).doTransferFrom(self, user2, 200); 415 | assertEq(chai.balanceOf(user2), 200); 416 | } 417 | function testApproveWillModifyAllowance() public { 418 | assertEq(chai.allowance(self, user1), 0); 419 | assertEq(chai.balanceOf(user1), 0); 420 | chai.approve(user1, 1000); 421 | assertEq(chai.allowance(self, user1), 1000); 422 | ChaiUser(user1).doTransferFrom(self, user1, 500); 423 | assertEq(chai.balanceOf(user1), 500); 424 | assertEq(chai.allowance(self, user1), 500); 425 | } 426 | function testApproveWillNotModifyAllowance() public { 427 | assertEq(chai.allowance(self, user1), 0); 428 | assertEq(chai.balanceOf(user1), 0); 429 | chai.approve(user1, uint(-1)); 430 | assertEq(chai.allowance(self, user1), uint(-1)); 431 | ChaiUser(user1).doTransferFrom(self, user1, 1000); 432 | assertEq(chai.balanceOf(user1), 1000); 433 | assertEq(chai.allowance(self, user1), uint(-1)); 434 | } 435 | function testChaiAddress() public { 436 | //The dai address generated by hevm 437 | //used for signature generation testing 438 | assertEq(address(chai), address(0xd122F8f92737FC00Fb3d62d4eD9244D393663870)); 439 | } 440 | 441 | function testTypehash() public { 442 | assertEq(chai.PERMIT_TYPEHASH(), 0xea2aa0a1be11a07ed86d755c93467f4f82362b452371d1ba94d1715123511acb); 443 | } 444 | 445 | function testDomain_Separator() public { 446 | assertEq(chai.DOMAIN_SEPARATOR(), 0x388ddaf68a6d95f0638353feb69385f7b35449d69961073c34f6977bc907fb8c); 447 | } 448 | 449 | function testPermit() public { 450 | assertEq(chai.nonces(cal), 0); 451 | assertEq(chai.allowance(cal, del), 0); 452 | chai.permit(cal, del, 0, 0, true, v, r, s); 453 | assertEq(chai.allowance(cal, del),uint(-1)); 454 | assertEq(chai.nonces(cal),1); 455 | } 456 | 457 | function testFailPermitAddress0() public { 458 | v = 0; 459 | chai.permit(address(0), del, 0, 0, true, v, r, s); 460 | } 461 | 462 | function testPermitWithExpiry() public { 463 | assertEq(now, 604411200); 464 | chai.permit(cal, del, 0, 604411200 + 1 hours, true, _v, _r, _s); 465 | assertEq(chai.allowance(cal, del),uint(-1)); 466 | assertEq(chai.nonces(cal),1); 467 | } 468 | 469 | function testFailPermitWithExpiry() public { 470 | hevm.warp(now + 2 hours); 471 | assertEq(now, 604411200 + 2 hours); 472 | chai.permit(cal, del, 0, 604411200 + 1 hours, true, _v, _r, _s); 473 | } 474 | 475 | function testFailReplay() public { 476 | chai.permit(cal, del, 0, 0, true, v, r, s); 477 | chai.permit(cal, del, 0, 0, true, v, r, s); 478 | } 479 | } 480 | --------------------------------------------------------------------------------