├── .gitattributes ├── LICENSE ├── Makefile ├── README.md ├── lib └── ds-test │ ├── LICENSE │ ├── Makefile │ ├── default.nix │ └── src │ └── test.sol ├── out └── dapp.sol.json ├── src ├── PASTAPool.sol ├── PASTAPool2.sol ├── SpaghettiCore.sol ├── SpaghettiCore.t.sol ├── SpaghettiToken.sol └── SpaghettiTokenV2.sol └── test.sh /.gitattributes: -------------------------------------------------------------------------------- 1 | *.sol linguist-language=Solidity 2 | -------------------------------------------------------------------------------- /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 | -------------------------------------------------------------------------------- /Makefile: -------------------------------------------------------------------------------- 1 | all :; dapp build 2 | clean :; dapp clean 3 | test :; dapp test 4 | deploy :; dapp create SpaghettiCore 5 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | ## spaghetti-core 2 | 3 | # WARNING THESE ARE UNAUDITED CONTRACTS 4 | 5 | This is a deflationary ERC20 token. Every transaction burns 1% of the tokens. You can stake defi tokens to earn Spaghetti. There is no premine, dev allocation or any shennigans like that. 6 | 7 | The staking contracts are taken from synthetix. The token is a modified ds-token from DappHub. 8 | 9 | To run the hevm test, download the code, install https://github.com/dapphub/dapptools and then run `./test.sh`. Side note: hevm is very cool and people should use this more. 10 | 11 | ## Deployed Code 12 | #### Please confirm 13 | 1. There is no authorization on SpaghettiToken. 14 | 2. All $PASTA has been transfered to the pools. There is no dev premine. 15 | 3. The start times are at 08/19/2020 @ 12:00am (UTC) and 08/20/2020 @ 12:00am (UTC). 16 | 4. All ownership has been renounced from the pool contracts. 17 | 18 | SpaghettiToken: https://etherscan.io/address/0x08a2e41fb99a7599725190b9c970ad3893fa33cf 19 | 20 | MKRPool: https://etherscan.io/address/0x6a3f3e76ad1ee05f5382d79f9047effd8417670c 21 | 22 | WBTCPool: https://etherscan.io/address/0x1e237fb9a94ae18e9007b6661a974962253df0c8 23 | 24 | COMPPool: https://etherscan.io/address/0x31a5f7a7a12af1a317491b1285c59e63e16654a1 25 | 26 | yaLINKPool: https://etherscan.io/address/0xf774584b6d12a3f93bd7b5fc20a44549cc5e2f07 27 | 28 | yfiPool: https://etherscan.io/address/0x093430541975e7aa0b2d9de2085bf99f33a5e91c 29 | 30 | lendPool: https://etherscan.io/address/0xc98161569f57be86d4d22b5b3228718f9f7101ad 31 | 32 | snxPool: https://etherscan.io/address/0xf3a68aa38d8f54afaad90cd98e71e88ecc021e23 33 | 34 | wethPool: https://etherscan.io/address/0x4547a86ca6a84b9d60dc57af908472074de7af5f 35 | 36 | yycrvPool: https://etherscan.io/address/0xe05809d3465f0bccd142208c7a3bb15bca23e13f 37 | -------------------------------------------------------------------------------- /lib/ds-test/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 | -------------------------------------------------------------------------------- /lib/ds-test/Makefile: -------------------------------------------------------------------------------- 1 | all:; dapp build 2 | test:; dapp test 3 | -------------------------------------------------------------------------------- /lib/ds-test/default.nix: -------------------------------------------------------------------------------- 1 | { solidityPackage, dappsys }: solidityPackage { 2 | name = "ds-test"; 3 | src = ./src; 4 | } 5 | -------------------------------------------------------------------------------- /lib/ds-test/src/test.sol: -------------------------------------------------------------------------------- 1 | // This program is free software: you can redistribute it and/or modify 2 | // it under the terms of the GNU General Public License as published by 3 | // the Free Software Foundation, either version 3 of the License, or 4 | // (at your option) any later version. 5 | 6 | // This program is distributed in the hope that it will be useful, 7 | // but WITHOUT ANY WARRANTY; without even the implied warranty of 8 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 9 | // GNU General Public License for more details. 10 | 11 | // You should have received a copy of the GNU General Public License 12 | // along with this program. If not, see . 13 | 14 | pragma solidity >=0.4.23; 15 | 16 | contract DSTest { 17 | event eventListener (address target, bool exact); 18 | event logs (bytes); 19 | event log_bytes32 (bytes32); 20 | event log_named_address (bytes32 key, address val); 21 | event log_named_bytes32 (bytes32 key, bytes32 val); 22 | event log_named_decimal_int (bytes32 key, int val, uint decimals); 23 | event log_named_decimal_uint (bytes32 key, uint val, uint decimals); 24 | event log_named_int (bytes32 key, int val); 25 | event log_named_uint (bytes32 key, uint val); 26 | event log_named_string (bytes32 key, string val); 27 | 28 | bool public IS_TEST; 29 | bool public failed; 30 | 31 | constructor() internal { 32 | IS_TEST = true; 33 | } 34 | 35 | function fail() internal { 36 | failed = true; 37 | } 38 | 39 | function expectEventsExact(address target) internal { 40 | emit eventListener(target, true); 41 | } 42 | 43 | modifier logs_gas() { 44 | uint startGas = gasleft(); 45 | _; 46 | uint endGas = gasleft(); 47 | emit log_named_uint("gas", startGas - endGas); 48 | } 49 | 50 | function assertTrue(bool condition) internal { 51 | if (!condition) { 52 | emit log_bytes32("Assertion failed"); 53 | fail(); 54 | } 55 | } 56 | 57 | function assertEq(address a, address b) internal { 58 | if (a != b) { 59 | emit log_bytes32("Error: Wrong `address' value"); 60 | emit log_named_address(" Expected", b); 61 | emit log_named_address(" Actual", a); 62 | fail(); 63 | } 64 | } 65 | 66 | function assertEq32(bytes32 a, bytes32 b) internal { 67 | assertEq(a, b); 68 | } 69 | 70 | function assertEq(bytes32 a, bytes32 b) internal { 71 | if (a != b) { 72 | emit log_bytes32("Error: Wrong `bytes32' value"); 73 | emit log_named_bytes32(" Expected", b); 74 | emit log_named_bytes32(" Actual", a); 75 | fail(); 76 | } 77 | } 78 | 79 | function assertEqDecimal(int a, int b, uint decimals) internal { 80 | if (a != b) { 81 | emit log_bytes32("Error: Wrong fixed-point decimal"); 82 | emit log_named_decimal_int(" Expected", b, decimals); 83 | emit log_named_decimal_int(" Actual", a, decimals); 84 | fail(); 85 | } 86 | } 87 | 88 | function assertEqDecimal(uint a, uint b, uint decimals) internal { 89 | if (a != b) { 90 | emit log_bytes32("Error: Wrong fixed-point decimal"); 91 | emit log_named_decimal_uint(" Expected", b, decimals); 92 | emit log_named_decimal_uint(" Actual", a, decimals); 93 | fail(); 94 | } 95 | } 96 | 97 | function assertEq(int a, int b) internal { 98 | if (a != b) { 99 | emit log_bytes32("Error: Wrong `int' value"); 100 | emit log_named_int(" Expected", b); 101 | emit log_named_int(" Actual", a); 102 | fail(); 103 | } 104 | } 105 | 106 | function assertEq(uint a, uint b) internal { 107 | if (a != b) { 108 | emit log_bytes32("Error: Wrong `uint' value"); 109 | emit log_named_uint(" Expected", b); 110 | emit log_named_uint(" Actual", a); 111 | fail(); 112 | } 113 | } 114 | 115 | function assertEq(string memory a, string memory b) internal { 116 | if (keccak256(abi.encodePacked(a)) != keccak256(abi.encodePacked(b))) { 117 | emit log_bytes32("Error: Wrong `string' value"); 118 | emit log_named_string(" Expected", b); 119 | emit log_named_string(" Actual", a); 120 | fail(); 121 | } 122 | } 123 | 124 | function assertEq0(bytes memory a, bytes memory b) internal { 125 | bool ok = true; 126 | 127 | if (a.length == b.length) { 128 | for (uint i = 0; i < a.length; i++) { 129 | if (a[i] != b[i]) { 130 | ok = false; 131 | } 132 | } 133 | } else { 134 | ok = false; 135 | } 136 | 137 | if (!ok) { 138 | emit log_bytes32("Error: Wrong `bytes' value"); 139 | emit log_named_bytes32(" Expected", "[cannot show `bytes' value]"); 140 | emit log_named_bytes32(" Actual", "[cannot show `bytes' value]"); 141 | fail(); 142 | } 143 | } 144 | } 145 | -------------------------------------------------------------------------------- /src/PASTAPool.sol: -------------------------------------------------------------------------------- 1 | /** 2 | *Submitted for verification at Etherscan.io on 2020-07-17 3 | */ 4 | 5 | /* 6 | ____ __ __ __ _ 7 | / __/__ __ ___ / /_ / / ___ / /_ (_)__ __ 8 | _\ \ / // // _ \/ __// _ \/ -_)/ __// / \ \ / 9 | /___/ \_, //_//_/\__//_//_/\__/ \__//_/ /_\_\ 10 | /___/ 11 | 12 | * Synthetix: PASTARewards.sol 13 | * 14 | * Docs: https://docs.synthetix.io/ 15 | * 16 | * 17 | * MIT License 18 | * =========== 19 | * 20 | * Copyright (c) 2020 Synthetix 21 | * 22 | * Permission is hereby granted, free of charge, to any person obtaining a copy 23 | * of this software and associated documentation files (the "Software"), to deal 24 | * in the Software without restriction, including without limitation the rights 25 | * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell 26 | * copies of the Software, and to permit persons to whom the Software is 27 | * furnished to do so, subject to the following conditions: 28 | * 29 | * The above copyright notice and this permission notice shall be included in all 30 | * copies or substantial portions of the Software. 31 | * 32 | * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 33 | * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 34 | * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 35 | * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 36 | * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 37 | * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE 38 | */ 39 | 40 | // File: @openzeppelin/contracts/math/Math.sol 41 | 42 | pragma solidity ^0.5.0; 43 | 44 | /** 45 | * @dev Standard math utilities missing in the Solidity language. 46 | */ 47 | library Math { 48 | /** 49 | * @dev Returns the largest of two numbers. 50 | */ 51 | function max(uint256 a, uint256 b) internal pure returns (uint256) { 52 | return a >= b ? a : b; 53 | } 54 | 55 | /** 56 | * @dev Returns the smallest of two numbers. 57 | */ 58 | function min(uint256 a, uint256 b) internal pure returns (uint256) { 59 | return a < b ? a : b; 60 | } 61 | 62 | /** 63 | * @dev Returns the average of two numbers. The result is rounded towards 64 | * zero. 65 | */ 66 | function average(uint256 a, uint256 b) internal pure returns (uint256) { 67 | // (a + b) / 2 can overflow, so we distribute 68 | return (a / 2) + (b / 2) + ((a % 2 + b % 2) / 2); 69 | } 70 | } 71 | 72 | // File: @openzeppelin/contracts/math/SafeMath.sol 73 | 74 | pragma solidity ^0.5.0; 75 | 76 | /** 77 | * @dev Wrappers over Solidity's arithmetic operations with added overflow 78 | * checks. 79 | * 80 | * Arithmetic operations in Solidity wrap on overflow. This can easily result 81 | * in bugs, because programmers usually assume that an overflow raises an 82 | * error, which is the standard behavior in high level programming languages. 83 | * `SafeMath` restores this intuition by reverting the transaction when an 84 | * operation overflows. 85 | * 86 | * Using this library instead of the unchecked operations eliminates an entire 87 | * class of bugs, so it's recommended to use it always. 88 | */ 89 | library SafeMath { 90 | /** 91 | * @dev Returns the addition of two unsigned integers, reverting on 92 | * overflow. 93 | * 94 | * Counterpart to Solidity's `+` operator. 95 | * 96 | * Requirements: 97 | * - Addition cannot overflow. 98 | */ 99 | function add(uint256 a, uint256 b) internal pure returns (uint256) { 100 | uint256 c = a + b; 101 | require(c >= a, "SafeMath: addition overflow"); 102 | 103 | return c; 104 | } 105 | 106 | /** 107 | * @dev Returns the subtraction of two unsigned integers, reverting on 108 | * overflow (when the result is negative). 109 | * 110 | * Counterpart to Solidity's `-` operator. 111 | * 112 | * Requirements: 113 | * - Subtraction cannot overflow. 114 | */ 115 | function sub(uint256 a, uint256 b) internal pure returns (uint256) { 116 | return sub(a, b, "SafeMath: subtraction overflow"); 117 | } 118 | 119 | /** 120 | * @dev Returns the subtraction of two unsigned integers, reverting with custom message on 121 | * overflow (when the result is negative). 122 | * 123 | * Counterpart to Solidity's `-` operator. 124 | * 125 | * Requirements: 126 | * - Subtraction cannot overflow. 127 | * 128 | * _Available since v2.4.0._ 129 | */ 130 | function sub(uint256 a, uint256 b, string memory errorMessage) internal pure returns (uint256) { 131 | require(b <= a, errorMessage); 132 | uint256 c = a - b; 133 | 134 | return c; 135 | } 136 | 137 | /** 138 | * @dev Returns the multiplication of two unsigned integers, reverting on 139 | * overflow. 140 | * 141 | * Counterpart to Solidity's `*` operator. 142 | * 143 | * Requirements: 144 | * - Multiplication cannot overflow. 145 | */ 146 | function mul(uint256 a, uint256 b) internal pure returns (uint256) { 147 | // Gas optimization: this is cheaper than requiring 'a' not being zero, but the 148 | // benefit is lost if 'b' is also tested. 149 | // See: https://github.com/OpenZeppelin/openzeppelin-contracts/pull/522 150 | if (a == 0) { 151 | return 0; 152 | } 153 | 154 | uint256 c = a * b; 155 | require(c / a == b, "SafeMath: multiplication overflow"); 156 | 157 | return c; 158 | } 159 | 160 | /** 161 | * @dev Returns the integer division of two unsigned integers. Reverts on 162 | * division by zero. The result is rounded towards zero. 163 | * 164 | * Counterpart to Solidity's `/` operator. Note: this function uses a 165 | * `revert` opcode (which leaves remaining gas untouched) while Solidity 166 | * uses an invalid opcode to revert (consuming all remaining gas). 167 | * 168 | * Requirements: 169 | * - The divisor cannot be zero. 170 | */ 171 | function div(uint256 a, uint256 b) internal pure returns (uint256) { 172 | return div(a, b, "SafeMath: division by zero"); 173 | } 174 | 175 | /** 176 | * @dev Returns the integer division of two unsigned integers. Reverts with custom message on 177 | * division by zero. The result is rounded towards zero. 178 | * 179 | * Counterpart to Solidity's `/` operator. Note: this function uses a 180 | * `revert` opcode (which leaves remaining gas untouched) while Solidity 181 | * uses an invalid opcode to revert (consuming all remaining gas). 182 | * 183 | * Requirements: 184 | * - The divisor cannot be zero. 185 | * 186 | * _Available since v2.4.0._ 187 | */ 188 | function div(uint256 a, uint256 b, string memory errorMessage) internal pure returns (uint256) { 189 | // Solidity only automatically asserts when dividing by 0 190 | require(b > 0, errorMessage); 191 | uint256 c = a / b; 192 | // assert(a == b * c + a % b); // There is no case in which this doesn't hold 193 | 194 | return c; 195 | } 196 | 197 | /** 198 | * @dev Returns the remainder of dividing two unsigned integers. (unsigned integer modulo), 199 | * Reverts when dividing by zero. 200 | * 201 | * Counterpart to Solidity's `%` operator. This function uses a `revert` 202 | * opcode (which leaves remaining gas untouched) while Solidity uses an 203 | * invalid opcode to revert (consuming all remaining gas). 204 | * 205 | * Requirements: 206 | * - The divisor cannot be zero. 207 | */ 208 | function mod(uint256 a, uint256 b) internal pure returns (uint256) { 209 | return mod(a, b, "SafeMath: modulo by zero"); 210 | } 211 | 212 | /** 213 | * @dev Returns the remainder of dividing two unsigned integers. (unsigned integer modulo), 214 | * Reverts with custom message when dividing by zero. 215 | * 216 | * Counterpart to Solidity's `%` operator. This function uses a `revert` 217 | * opcode (which leaves remaining gas untouched) while Solidity uses an 218 | * invalid opcode to revert (consuming all remaining gas). 219 | * 220 | * Requirements: 221 | * - The divisor cannot be zero. 222 | * 223 | * _Available since v2.4.0._ 224 | */ 225 | function mod(uint256 a, uint256 b, string memory errorMessage) internal pure returns (uint256) { 226 | require(b != 0, errorMessage); 227 | return a % b; 228 | } 229 | } 230 | 231 | // File: @openzeppelin/contracts/GSN/Context.sol 232 | 233 | pragma solidity ^0.5.0; 234 | 235 | /* 236 | * @dev Provides information about the current execution context, including the 237 | * sender of the transaction and its data. While these are generally available 238 | * via msg.sender and msg.data, they should not be accessed in such a direct 239 | * manner, since when dealing with GSN meta-transactions the account sending and 240 | * paying for execution may not be the actual sender (as far as an application 241 | * is concerned). 242 | * 243 | * This contract is only required for intermediate, library-like contracts. 244 | */ 245 | contract Context { 246 | // Empty internal constructor, to prevent people from mistakenly deploying 247 | // an instance of this contract, which should be used via inheritance. 248 | constructor () internal { } 249 | // solhint-disable-previous-line no-empty-blocks 250 | 251 | function _msgSender() internal view returns (address payable) { 252 | return msg.sender; 253 | } 254 | 255 | function _msgData() internal view returns (bytes memory) { 256 | this; // silence state mutability warning without generating bytecode - see https://github.com/ethereum/solidity/issues/2691 257 | return msg.data; 258 | } 259 | } 260 | 261 | // File: @openzeppelin/contracts/ownership/Ownable.sol 262 | 263 | pragma solidity ^0.5.0; 264 | 265 | /** 266 | * @dev Contract module which provides a basic access control mechanism, where 267 | * there is an account (an owner) that can be granted exclusive access to 268 | * specific functions. 269 | * 270 | * This module is used through inheritance. It will make available the modifier 271 | * `onlyOwner`, which can be applied to your functions to restrict their use to 272 | * the owner. 273 | */ 274 | contract Ownable is Context { 275 | address private _owner; 276 | 277 | event OwnershipTransferred(address indexed previousOwner, address indexed newOwner); 278 | 279 | /** 280 | * @dev Initializes the contract setting the deployer as the initial owner. 281 | */ 282 | constructor () internal { 283 | _owner = _msgSender(); 284 | emit OwnershipTransferred(address(0), _owner); 285 | } 286 | 287 | /** 288 | * @dev Returns the address of the current owner. 289 | */ 290 | function owner() public view returns (address) { 291 | return _owner; 292 | } 293 | 294 | /** 295 | * @dev Throws if called by any account other than the owner. 296 | */ 297 | modifier onlyOwner() { 298 | require(isOwner(), "Ownable: caller is not the owner"); 299 | _; 300 | } 301 | 302 | /** 303 | * @dev Returns true if the caller is the current owner. 304 | */ 305 | function isOwner() public view returns (bool) { 306 | return _msgSender() == _owner; 307 | } 308 | 309 | /** 310 | * @dev Leaves the contract without owner. It will not be possible to call 311 | * `onlyOwner` functions anymore. Can only be called by the current owner. 312 | * 313 | * NOTE: Renouncing ownership will leave the contract without an owner, 314 | * thereby removing any functionality that is only available to the owner. 315 | */ 316 | function renounceOwnership() public onlyOwner { 317 | emit OwnershipTransferred(_owner, address(0)); 318 | _owner = address(0); 319 | } 320 | 321 | /** 322 | * @dev Transfers ownership of the contract to a new account (`newOwner`). 323 | * Can only be called by the current owner. 324 | */ 325 | function transferOwnership(address newOwner) public onlyOwner { 326 | _transferOwnership(newOwner); 327 | } 328 | 329 | /** 330 | * @dev Transfers ownership of the contract to a new account (`newOwner`). 331 | */ 332 | function _transferOwnership(address newOwner) internal { 333 | require(newOwner != address(0), "Ownable: new owner is the zero address"); 334 | emit OwnershipTransferred(_owner, newOwner); 335 | _owner = newOwner; 336 | } 337 | } 338 | 339 | // File: @openzeppelin/contracts/token/ERC20/IERC20.sol 340 | 341 | pragma solidity ^0.5.0; 342 | 343 | /** 344 | * @dev Interface of the ERC20 standard as defined in the EIP. Does not include 345 | * the optional functions; to access them see {ERC20Detailed}. 346 | */ 347 | interface IERC20 { 348 | /** 349 | * @dev Returns the amount of tokens in existence. 350 | */ 351 | function totalSupply() external view returns (uint256); 352 | 353 | /** 354 | * @dev Returns the amount of tokens owned by `account`. 355 | */ 356 | function balanceOf(address account) external view returns (uint256); 357 | 358 | /** 359 | * @dev Moves `amount` tokens from the caller's account to `recipient`. 360 | * 361 | * Returns a boolean value indicating whether the operation succeeded. 362 | * 363 | * Emits a {Transfer} event. 364 | */ 365 | function transfer(address recipient, uint256 amount) external returns (bool); 366 | 367 | /** 368 | * @dev Returns the remaining number of tokens that `spender` will be 369 | * allowed to spend on behalf of `owner` through {transferFrom}. This is 370 | * zero by default. 371 | * 372 | * This value changes when {approve} or {transferFrom} are called. 373 | */ 374 | function allowance(address owner, address spender) external view returns (uint256); 375 | 376 | /** 377 | * @dev Sets `amount` as the allowance of `spender` over the caller's tokens. 378 | * 379 | * Returns a boolean value indicating whether the operation succeeded. 380 | * 381 | * IMPORTANT: Beware that changing an allowance with this method brings the risk 382 | * that someone may use both the old and the new allowance by unfortunate 383 | * transaction ordering. One possible solution to mitigate this race 384 | * condition is to first reduce the spender's allowance to 0 and set the 385 | * desired value afterwards: 386 | * https://github.com/ethereum/EIPs/issues/20#issuecomment-263524729 387 | * 388 | * Emits an {Approval} event. 389 | */ 390 | function approve(address spender, uint256 amount) external returns (bool); 391 | 392 | /** 393 | * @dev Moves `amount` tokens from `sender` to `recipient` using the 394 | * allowance mechanism. `amount` is then deducted from the caller's 395 | * allowance. 396 | * 397 | * Returns a boolean value indicating whether the operation succeeded. 398 | * 399 | * Emits a {Transfer} event. 400 | */ 401 | function transferFrom(address sender, address recipient, uint256 amount) external returns (bool); 402 | 403 | /** 404 | * @dev Emitted when `value` tokens are moved from one account (`from`) to 405 | * another (`to`). 406 | * 407 | * Note that `value` may be zero. 408 | */ 409 | event Transfer(address indexed from, address indexed to, uint256 value); 410 | 411 | /** 412 | * @dev Emitted when the allowance of a `spender` for an `owner` is set by 413 | * a call to {approve}. `value` is the new allowance. 414 | */ 415 | event Approval(address indexed owner, address indexed spender, uint256 value); 416 | } 417 | 418 | // File: @openzeppelin/contracts/utils/Address.sol 419 | 420 | pragma solidity ^0.5.5; 421 | 422 | /** 423 | * @dev Collection of functions related to the address type 424 | */ 425 | library Address { 426 | /** 427 | * @dev Returns true if `account` is a contract. 428 | * 429 | * This test is non-exhaustive, and there may be false-negatives: during the 430 | * execution of a contract's constructor, its address will be reported as 431 | * not containing a contract. 432 | * 433 | * IMPORTANT: It is unsafe to assume that an address for which this 434 | * function returns false is an externally-owned account (EOA) and not a 435 | * contract. 436 | */ 437 | function isContract(address account) internal view returns (bool) { 438 | // This method relies in extcodesize, which returns 0 for contracts in 439 | // construction, since the code is only stored at the end of the 440 | // constructor execution. 441 | 442 | // According to EIP-1052, 0x0 is the value returned for not-yet created accounts 443 | // and 0xc5d2460186f7233c927e7db2dcc703c0e500b653ca82273b7bfad8045d85a470 is returned 444 | // for accounts without code, i.e. `keccak256('')` 445 | bytes32 codehash; 446 | bytes32 accountHash = 0xc5d2460186f7233c927e7db2dcc703c0e500b653ca82273b7bfad8045d85a470; 447 | // solhint-disable-next-line no-inline-assembly 448 | assembly { codehash := extcodehash(account) } 449 | return (codehash != 0x0 && codehash != accountHash); 450 | } 451 | 452 | /** 453 | * @dev Converts an `address` into `address payable`. Note that this is 454 | * simply a type cast: the actual underlying value is not changed. 455 | * 456 | * _Available since v2.4.0._ 457 | */ 458 | function toPayable(address account) internal pure returns (address payable) { 459 | return address(uint160(account)); 460 | } 461 | 462 | /** 463 | * @dev Replacement for Solidity's `transfer`: sends `amount` wei to 464 | * `recipient`, forwarding all available gas and reverting on errors. 465 | * 466 | * https://eips.ethereum.org/EIPS/eip-1884[EIP1884] increases the gas cost 467 | * of certain opcodes, possibly making contracts go over the 2300 gas limit 468 | * imposed by `transfer`, making them unable to receive funds via 469 | * `transfer`. {sendValue} removes this limitation. 470 | * 471 | * https://diligence.consensys.net/posts/2019/09/stop-using-soliditys-transfer-now/[Learn more]. 472 | * 473 | * IMPORTANT: because control is transferred to `recipient`, care must be 474 | * taken to not create reentrancy vulnerabilities. Consider using 475 | * {ReentrancyGuard} or the 476 | * https://solidity.readthedocs.io/en/v0.5.11/security-considerations.html#use-the-checks-effects-interactions-pattern[checks-effects-interactions pattern]. 477 | * 478 | * _Available since v2.4.0._ 479 | */ 480 | function sendValue(address payable recipient, uint256 amount) internal { 481 | require(address(this).balance >= amount, "Address: insufficient balance"); 482 | 483 | // solhint-disable-next-line avoid-call-value 484 | (bool success, ) = recipient.call.value(amount)(""); 485 | require(success, "Address: unable to send value, recipient may have reverted"); 486 | } 487 | } 488 | 489 | // File: @openzeppelin/contracts/token/ERC20/SafeERC20.sol 490 | 491 | pragma solidity ^0.5.0; 492 | 493 | 494 | 495 | 496 | /** 497 | * @title SafeERC20 498 | * @dev Wrappers around ERC20 operations that throw on failure (when the token 499 | * contract returns false). Tokens that return no value (and instead revert or 500 | * throw on failure) are also supported, non-reverting calls are assumed to be 501 | * successful. 502 | * To use this library you can add a `using SafeERC20 for ERC20;` statement to your contract, 503 | * which allows you to call the safe operations as `token.safeTransfer(...)`, etc. 504 | */ 505 | library SafeERC20 { 506 | using SafeMath for uint256; 507 | using Address for address; 508 | 509 | function safeTransfer(IERC20 token, address to, uint256 value) internal { 510 | callOptionalReturn(token, abi.encodeWithSelector(token.transfer.selector, to, value)); 511 | } 512 | 513 | function safeTransferFrom(IERC20 token, address from, address to, uint256 value) internal { 514 | callOptionalReturn(token, abi.encodeWithSelector(token.transferFrom.selector, from, to, value)); 515 | } 516 | 517 | function safeApprove(IERC20 token, address spender, uint256 value) internal { 518 | // safeApprove should only be called when setting an initial allowance, 519 | // or when resetting it to zero. To increase and decrease it, use 520 | // 'safeIncreaseAllowance' and 'safeDecreaseAllowance' 521 | // solhint-disable-next-line max-line-length 522 | require((value == 0) || (token.allowance(address(this), spender) == 0), 523 | "SafeERC20: approve from non-zero to non-zero allowance" 524 | ); 525 | callOptionalReturn(token, abi.encodeWithSelector(token.approve.selector, spender, value)); 526 | } 527 | 528 | function safeIncreaseAllowance(IERC20 token, address spender, uint256 value) internal { 529 | uint256 newAllowance = token.allowance(address(this), spender).add(value); 530 | callOptionalReturn(token, abi.encodeWithSelector(token.approve.selector, spender, newAllowance)); 531 | } 532 | 533 | function safeDecreaseAllowance(IERC20 token, address spender, uint256 value) internal { 534 | uint256 newAllowance = token.allowance(address(this), spender).sub(value, "SafeERC20: decreased allowance below zero"); 535 | callOptionalReturn(token, abi.encodeWithSelector(token.approve.selector, spender, newAllowance)); 536 | } 537 | 538 | /** 539 | * @dev Imitates a Solidity high-level call (i.e. a regular function call to a contract), relaxing the requirement 540 | * on the return value: the return value is optional (but if data is returned, it must not be false). 541 | * @param token The token targeted by the call. 542 | * @param data The call data (encoded using abi.encode or one of its variants). 543 | */ 544 | function callOptionalReturn(IERC20 token, bytes memory data) private { 545 | // We need to perform a low level call here, to bypass Solidity's return data size checking mechanism, since 546 | // we're implementing it ourselves. 547 | 548 | // A Solidity high level call has three parts: 549 | // 1. The target address is checked to verify it contains contract code 550 | // 2. The call itself is made, and success asserted 551 | // 3. The return value is decoded, which in turn checks the size of the returned data. 552 | // solhint-disable-next-line max-line-length 553 | require(address(token).isContract(), "SafeERC20: call to non-contract"); 554 | 555 | // solhint-disable-next-line avoid-low-level-calls 556 | (bool success, bytes memory returndata) = address(token).call(data); 557 | require(success, "SafeERC20: low-level call failed"); 558 | 559 | if (returndata.length > 0) { // Return data is optional 560 | // solhint-disable-next-line max-line-length 561 | require(abi.decode(returndata, (bool)), "SafeERC20: ERC20 operation did not succeed"); 562 | } 563 | } 564 | } 565 | 566 | // File: contracts/IRewardDistributionRecipient.sol 567 | 568 | pragma solidity ^0.5.0; 569 | 570 | 571 | 572 | contract IRewardDistributionRecipient is Ownable { 573 | address public rewardDistribution; 574 | 575 | function notifyRewardAmount(uint256 reward) external; 576 | 577 | modifier onlyRewardDistribution() { 578 | require(_msgSender() == rewardDistribution, "Caller is not reward distribution"); 579 | _; 580 | } 581 | 582 | function setRewardDistribution(address _rewardDistribution) 583 | external 584 | onlyOwner 585 | { 586 | rewardDistribution = _rewardDistribution; 587 | } 588 | } 589 | 590 | // File: contracts/CurveRewards.sol 591 | 592 | pragma solidity ^0.5.0; 593 | 594 | contract LPTokenWrapper { 595 | using SafeMath for uint256; 596 | using SafeERC20 for IERC20; 597 | 598 | IERC20 public lpt; 599 | 600 | uint256 private _totalSupply; 601 | mapping(address => uint256) private _balances; 602 | 603 | function totalSupply() public view returns (uint256) { 604 | return _totalSupply; 605 | } 606 | 607 | function balanceOf(address account) public view returns (uint256) { 608 | return _balances[account]; 609 | } 610 | 611 | function stake(uint256 amount) public { 612 | _totalSupply = _totalSupply.add(amount); 613 | _balances[msg.sender] = _balances[msg.sender].add(amount); 614 | lpt.safeTransferFrom(msg.sender, address(this), amount); 615 | } 616 | 617 | function withdraw(uint256 amount) public { 618 | _totalSupply = _totalSupply.sub(amount); 619 | _balances[msg.sender] = _balances[msg.sender].sub(amount); 620 | lpt.safeTransfer(msg.sender, amount); 621 | } 622 | } 623 | 624 | contract PASTAPool is LPTokenWrapper, IRewardDistributionRecipient { 625 | IERC20 public spaghetti; 626 | uint256 public DURATION = 7 days; 627 | 628 | uint256 public starttime = 1597795200; 629 | uint256 public periodFinish = 0; 630 | uint256 public rewardRate = 0; 631 | uint256 public lastUpdateTime; 632 | uint256 public rewardPerTokenStored; 633 | mapping(address => uint256) public userRewardPerTokenPaid; 634 | mapping(address => uint256) public rewards; 635 | 636 | event RewardAdded(uint256 reward); 637 | event Staked(address indexed user, uint256 amount); 638 | event Withdrawn(address indexed user, uint256 amount); 639 | event RewardPaid(address indexed user, uint256 reward); 640 | 641 | constructor(address _spaghetti, address _lptoken) public { 642 | spaghetti = IERC20(_spaghetti); 643 | lpt = IERC20(_lptoken); 644 | } 645 | 646 | modifier checkStart() { 647 | require(block.timestamp >= starttime,"not start"); 648 | _; 649 | } 650 | 651 | modifier updateReward(address account) { 652 | rewardPerTokenStored = rewardPerToken(); 653 | lastUpdateTime = lastTimeRewardApplicable(); 654 | if (account != address(0)) { 655 | rewards[account] = earned(account); 656 | userRewardPerTokenPaid[account] = rewardPerTokenStored; 657 | } 658 | _; 659 | } 660 | 661 | function lastTimeRewardApplicable() public view returns (uint256) { 662 | return Math.min(block.timestamp, periodFinish); 663 | } 664 | 665 | function rewardPerToken() public view returns (uint256) { 666 | if (totalSupply() == 0) { 667 | return rewardPerTokenStored; 668 | } 669 | return 670 | rewardPerTokenStored.add( 671 | lastTimeRewardApplicable() 672 | .sub(lastUpdateTime) 673 | .mul(rewardRate) 674 | .mul(1e18) 675 | .div(totalSupply()) 676 | ); 677 | } 678 | 679 | function earned(address account) public view returns (uint256) { 680 | return 681 | balanceOf(account) 682 | .mul(rewardPerToken().sub(userRewardPerTokenPaid[account])) 683 | .div(1e18) 684 | .add(rewards[account]); 685 | } 686 | 687 | // stake visibility is public as overriding LPTokenWrapper's stake() function 688 | function stake(uint256 amount) public updateReward(msg.sender) checkStart { 689 | require(amount > 0, "Cannot stake 0"); 690 | super.stake(amount); 691 | emit Staked(msg.sender, amount); 692 | } 693 | 694 | function withdraw(uint256 amount) public updateReward(msg.sender) checkStart { 695 | require(amount > 0, "Cannot withdraw 0"); 696 | super.withdraw(amount); 697 | emit Withdrawn(msg.sender, amount); 698 | } 699 | 700 | function exit() external { 701 | withdraw(balanceOf(msg.sender)); 702 | getReward(); 703 | } 704 | 705 | function getReward() public updateReward(msg.sender) checkStart { 706 | uint256 reward = earned(msg.sender); 707 | if (reward > 0) { 708 | rewards[msg.sender] = 0; 709 | spaghetti.safeTransfer(msg.sender, reward); 710 | emit RewardPaid(msg.sender, reward); 711 | } 712 | } 713 | 714 | function notifyRewardAmount(uint256 reward) 715 | external 716 | onlyRewardDistribution 717 | updateReward(address(0)) 718 | { 719 | if (block.timestamp > starttime) { 720 | if (block.timestamp >= periodFinish) { 721 | rewardRate = reward.div(DURATION); 722 | } else { 723 | uint256 remaining = periodFinish.sub(block.timestamp); 724 | uint256 leftover = remaining.mul(rewardRate); 725 | rewardRate = reward.add(leftover).div(DURATION); 726 | } 727 | lastUpdateTime = block.timestamp; 728 | periodFinish = block.timestamp.add(DURATION); 729 | emit RewardAdded(reward); 730 | } else { 731 | rewardRate = reward.div(DURATION); 732 | lastUpdateTime = starttime; 733 | periodFinish = starttime.add(DURATION); 734 | emit RewardAdded(reward); 735 | } 736 | } 737 | } -------------------------------------------------------------------------------- /src/PASTAPool2.sol: -------------------------------------------------------------------------------- 1 | /** 2 | *Submitted for verification at Etherscan.io on 2020-07-17 3 | */ 4 | 5 | /* 6 | ____ __ __ __ _ 7 | / __/__ __ ___ / /_ / / ___ / /_ (_)__ __ 8 | _\ \ / // // _ \/ __// _ \/ -_)/ __// / \ \ / 9 | /___/ \_, //_//_/\__//_//_/\__/ \__//_/ /_\_\ 10 | /___/ 11 | 12 | * Synthetix: PASTARewards.sol 13 | * 14 | * Docs: https://docs.synthetix.io/ 15 | * 16 | * 17 | * MIT License 18 | * =========== 19 | * 20 | * Copyright (c) 2020 Synthetix 21 | * 22 | * Permission is hereby granted, free of charge, to any person obtaining a copy 23 | * of this software and associated documentation files (the "Software"), to deal 24 | * in the Software without restriction, including without limitation the rights 25 | * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell 26 | * copies of the Software, and to permit persons to whom the Software is 27 | * furnished to do so, subject to the following conditions: 28 | * 29 | * The above copyright notice and this permission notice shall be included in all 30 | * copies or substantial portions of the Software. 31 | * 32 | * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 33 | * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 34 | * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 35 | * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 36 | * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 37 | * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE 38 | */ 39 | 40 | // File: @openzeppelin/contracts/math/Math.sol 41 | 42 | pragma solidity ^0.5.0; 43 | 44 | /** 45 | * @dev Standard math utilities missing in the Solidity language. 46 | */ 47 | library Math { 48 | /** 49 | * @dev Returns the largest of two numbers. 50 | */ 51 | function max(uint256 a, uint256 b) internal pure returns (uint256) { 52 | return a >= b ? a : b; 53 | } 54 | 55 | /** 56 | * @dev Returns the smallest of two numbers. 57 | */ 58 | function min(uint256 a, uint256 b) internal pure returns (uint256) { 59 | return a < b ? a : b; 60 | } 61 | 62 | /** 63 | * @dev Returns the average of two numbers. The result is rounded towards 64 | * zero. 65 | */ 66 | function average(uint256 a, uint256 b) internal pure returns (uint256) { 67 | // (a + b) / 2 can overflow, so we distribute 68 | return (a / 2) + (b / 2) + ((a % 2 + b % 2) / 2); 69 | } 70 | } 71 | 72 | // File: @openzeppelin/contracts/math/SafeMath.sol 73 | 74 | pragma solidity ^0.5.0; 75 | 76 | /** 77 | * @dev Wrappers over Solidity's arithmetic operations with added overflow 78 | * checks. 79 | * 80 | * Arithmetic operations in Solidity wrap on overflow. This can easily result 81 | * in bugs, because programmers usually assume that an overflow raises an 82 | * error, which is the standard behavior in high level programming languages. 83 | * `SafeMath` restores this intuition by reverting the transaction when an 84 | * operation overflows. 85 | * 86 | * Using this library instead of the unchecked operations eliminates an entire 87 | * class of bugs, so it's recommended to use it always. 88 | */ 89 | library SafeMath { 90 | /** 91 | * @dev Returns the addition of two unsigned integers, reverting on 92 | * overflow. 93 | * 94 | * Counterpart to Solidity's `+` operator. 95 | * 96 | * Requirements: 97 | * - Addition cannot overflow. 98 | */ 99 | function add(uint256 a, uint256 b) internal pure returns (uint256) { 100 | uint256 c = a + b; 101 | require(c >= a, "SafeMath: addition overflow"); 102 | 103 | return c; 104 | } 105 | 106 | /** 107 | * @dev Returns the subtraction of two unsigned integers, reverting on 108 | * overflow (when the result is negative). 109 | * 110 | * Counterpart to Solidity's `-` operator. 111 | * 112 | * Requirements: 113 | * - Subtraction cannot overflow. 114 | */ 115 | function sub(uint256 a, uint256 b) internal pure returns (uint256) { 116 | return sub(a, b, "SafeMath: subtraction overflow"); 117 | } 118 | 119 | /** 120 | * @dev Returns the subtraction of two unsigned integers, reverting with custom message on 121 | * overflow (when the result is negative). 122 | * 123 | * Counterpart to Solidity's `-` operator. 124 | * 125 | * Requirements: 126 | * - Subtraction cannot overflow. 127 | * 128 | * _Available since v2.4.0._ 129 | */ 130 | function sub(uint256 a, uint256 b, string memory errorMessage) internal pure returns (uint256) { 131 | require(b <= a, errorMessage); 132 | uint256 c = a - b; 133 | 134 | return c; 135 | } 136 | 137 | /** 138 | * @dev Returns the multiplication of two unsigned integers, reverting on 139 | * overflow. 140 | * 141 | * Counterpart to Solidity's `*` operator. 142 | * 143 | * Requirements: 144 | * - Multiplication cannot overflow. 145 | */ 146 | function mul(uint256 a, uint256 b) internal pure returns (uint256) { 147 | // Gas optimization: this is cheaper than requiring 'a' not being zero, but the 148 | // benefit is lost if 'b' is also tested. 149 | // See: https://github.com/OpenZeppelin/openzeppelin-contracts/pull/522 150 | if (a == 0) { 151 | return 0; 152 | } 153 | 154 | uint256 c = a * b; 155 | require(c / a == b, "SafeMath: multiplication overflow"); 156 | 157 | return c; 158 | } 159 | 160 | /** 161 | * @dev Returns the integer division of two unsigned integers. Reverts on 162 | * division by zero. The result is rounded towards zero. 163 | * 164 | * Counterpart to Solidity's `/` operator. Note: this function uses a 165 | * `revert` opcode (which leaves remaining gas untouched) while Solidity 166 | * uses an invalid opcode to revert (consuming all remaining gas). 167 | * 168 | * Requirements: 169 | * - The divisor cannot be zero. 170 | */ 171 | function div(uint256 a, uint256 b) internal pure returns (uint256) { 172 | return div(a, b, "SafeMath: division by zero"); 173 | } 174 | 175 | /** 176 | * @dev Returns the integer division of two unsigned integers. Reverts with custom message on 177 | * division by zero. The result is rounded towards zero. 178 | * 179 | * Counterpart to Solidity's `/` operator. Note: this function uses a 180 | * `revert` opcode (which leaves remaining gas untouched) while Solidity 181 | * uses an invalid opcode to revert (consuming all remaining gas). 182 | * 183 | * Requirements: 184 | * - The divisor cannot be zero. 185 | * 186 | * _Available since v2.4.0._ 187 | */ 188 | function div(uint256 a, uint256 b, string memory errorMessage) internal pure returns (uint256) { 189 | // Solidity only automatically asserts when dividing by 0 190 | require(b > 0, errorMessage); 191 | uint256 c = a / b; 192 | // assert(a == b * c + a % b); // There is no case in which this doesn't hold 193 | 194 | return c; 195 | } 196 | 197 | /** 198 | * @dev Returns the remainder of dividing two unsigned integers. (unsigned integer modulo), 199 | * Reverts when dividing by zero. 200 | * 201 | * Counterpart to Solidity's `%` operator. This function uses a `revert` 202 | * opcode (which leaves remaining gas untouched) while Solidity uses an 203 | * invalid opcode to revert (consuming all remaining gas). 204 | * 205 | * Requirements: 206 | * - The divisor cannot be zero. 207 | */ 208 | function mod(uint256 a, uint256 b) internal pure returns (uint256) { 209 | return mod(a, b, "SafeMath: modulo by zero"); 210 | } 211 | 212 | /** 213 | * @dev Returns the remainder of dividing two unsigned integers. (unsigned integer modulo), 214 | * Reverts with custom message when dividing by zero. 215 | * 216 | * Counterpart to Solidity's `%` operator. This function uses a `revert` 217 | * opcode (which leaves remaining gas untouched) while Solidity uses an 218 | * invalid opcode to revert (consuming all remaining gas). 219 | * 220 | * Requirements: 221 | * - The divisor cannot be zero. 222 | * 223 | * _Available since v2.4.0._ 224 | */ 225 | function mod(uint256 a, uint256 b, string memory errorMessage) internal pure returns (uint256) { 226 | require(b != 0, errorMessage); 227 | return a % b; 228 | } 229 | } 230 | 231 | // File: @openzeppelin/contracts/GSN/Context.sol 232 | 233 | pragma solidity ^0.5.0; 234 | 235 | /* 236 | * @dev Provides information about the current execution context, including the 237 | * sender of the transaction and its data. While these are generally available 238 | * via msg.sender and msg.data, they should not be accessed in such a direct 239 | * manner, since when dealing with GSN meta-transactions the account sending and 240 | * paying for execution may not be the actual sender (as far as an application 241 | * is concerned). 242 | * 243 | * This contract is only required for intermediate, library-like contracts. 244 | */ 245 | contract Context { 246 | // Empty internal constructor, to prevent people from mistakenly deploying 247 | // an instance of this contract, which should be used via inheritance. 248 | constructor () internal { } 249 | // solhint-disable-previous-line no-empty-blocks 250 | 251 | function _msgSender() internal view returns (address payable) { 252 | return msg.sender; 253 | } 254 | 255 | function _msgData() internal view returns (bytes memory) { 256 | this; // silence state mutability warning without generating bytecode - see https://github.com/ethereum/solidity/issues/2691 257 | return msg.data; 258 | } 259 | } 260 | 261 | // File: @openzeppelin/contracts/ownership/Ownable.sol 262 | 263 | pragma solidity ^0.5.0; 264 | 265 | /** 266 | * @dev Contract module which provides a basic access control mechanism, where 267 | * there is an account (an owner) that can be granted exclusive access to 268 | * specific functions. 269 | * 270 | * This module is used through inheritance. It will make available the modifier 271 | * `onlyOwner`, which can be applied to your functions to restrict their use to 272 | * the owner. 273 | */ 274 | contract Ownable is Context { 275 | address private _owner; 276 | 277 | event OwnershipTransferred(address indexed previousOwner, address indexed newOwner); 278 | 279 | /** 280 | * @dev Initializes the contract setting the deployer as the initial owner. 281 | */ 282 | constructor () internal { 283 | _owner = _msgSender(); 284 | emit OwnershipTransferred(address(0), _owner); 285 | } 286 | 287 | /** 288 | * @dev Returns the address of the current owner. 289 | */ 290 | function owner() public view returns (address) { 291 | return _owner; 292 | } 293 | 294 | /** 295 | * @dev Throws if called by any account other than the owner. 296 | */ 297 | modifier onlyOwner() { 298 | require(isOwner(), "Ownable: caller is not the owner"); 299 | _; 300 | } 301 | 302 | /** 303 | * @dev Returns true if the caller is the current owner. 304 | */ 305 | function isOwner() public view returns (bool) { 306 | return _msgSender() == _owner; 307 | } 308 | 309 | /** 310 | * @dev Leaves the contract without owner. It will not be possible to call 311 | * `onlyOwner` functions anymore. Can only be called by the current owner. 312 | * 313 | * NOTE: Renouncing ownership will leave the contract without an owner, 314 | * thereby removing any functionality that is only available to the owner. 315 | */ 316 | function renounceOwnership() public onlyOwner { 317 | emit OwnershipTransferred(_owner, address(0)); 318 | _owner = address(0); 319 | } 320 | 321 | /** 322 | * @dev Transfers ownership of the contract to a new account (`newOwner`). 323 | * Can only be called by the current owner. 324 | */ 325 | function transferOwnership(address newOwner) public onlyOwner { 326 | _transferOwnership(newOwner); 327 | } 328 | 329 | /** 330 | * @dev Transfers ownership of the contract to a new account (`newOwner`). 331 | */ 332 | function _transferOwnership(address newOwner) internal { 333 | require(newOwner != address(0), "Ownable: new owner is the zero address"); 334 | emit OwnershipTransferred(_owner, newOwner); 335 | _owner = newOwner; 336 | } 337 | } 338 | 339 | // File: @openzeppelin/contracts/token/ERC20/IERC20.sol 340 | 341 | pragma solidity ^0.5.0; 342 | 343 | /** 344 | * @dev Interface of the ERC20 standard as defined in the EIP. Does not include 345 | * the optional functions; to access them see {ERC20Detailed}. 346 | */ 347 | interface IERC20 { 348 | /** 349 | * @dev Returns the amount of tokens in existence. 350 | */ 351 | function totalSupply() external view returns (uint256); 352 | 353 | /** 354 | * @dev Returns the amount of tokens owned by `account`. 355 | */ 356 | function balanceOf(address account) external view returns (uint256); 357 | 358 | /** 359 | * @dev Moves `amount` tokens from the caller's account to `recipient`. 360 | * 361 | * Returns a boolean value indicating whether the operation succeeded. 362 | * 363 | * Emits a {Transfer} event. 364 | */ 365 | function transfer(address recipient, uint256 amount) external returns (bool); 366 | 367 | /** 368 | * @dev Returns the remaining number of tokens that `spender` will be 369 | * allowed to spend on behalf of `owner` through {transferFrom}. This is 370 | * zero by default. 371 | * 372 | * This value changes when {approve} or {transferFrom} are called. 373 | */ 374 | function allowance(address owner, address spender) external view returns (uint256); 375 | 376 | /** 377 | * @dev Sets `amount` as the allowance of `spender` over the caller's tokens. 378 | * 379 | * Returns a boolean value indicating whether the operation succeeded. 380 | * 381 | * IMPORTANT: Beware that changing an allowance with this method brings the risk 382 | * that someone may use both the old and the new allowance by unfortunate 383 | * transaction ordering. One possible solution to mitigate this race 384 | * condition is to first reduce the spender's allowance to 0 and set the 385 | * desired value afterwards: 386 | * https://github.com/ethereum/EIPs/issues/20#issuecomment-263524729 387 | * 388 | * Emits an {Approval} event. 389 | */ 390 | function approve(address spender, uint256 amount) external returns (bool); 391 | 392 | /** 393 | * @dev Moves `amount` tokens from `sender` to `recipient` using the 394 | * allowance mechanism. `amount` is then deducted from the caller's 395 | * allowance. 396 | * 397 | * Returns a boolean value indicating whether the operation succeeded. 398 | * 399 | * Emits a {Transfer} event. 400 | */ 401 | function transferFrom(address sender, address recipient, uint256 amount) external returns (bool); 402 | 403 | /** 404 | * @dev Emitted when `value` tokens are moved from one account (`from`) to 405 | * another (`to`). 406 | * 407 | * Note that `value` may be zero. 408 | */ 409 | event Transfer(address indexed from, address indexed to, uint256 value); 410 | 411 | /** 412 | * @dev Emitted when the allowance of a `spender` for an `owner` is set by 413 | * a call to {approve}. `value` is the new allowance. 414 | */ 415 | event Approval(address indexed owner, address indexed spender, uint256 value); 416 | } 417 | 418 | // File: @openzeppelin/contracts/utils/Address.sol 419 | 420 | pragma solidity ^0.5.5; 421 | 422 | /** 423 | * @dev Collection of functions related to the address type 424 | */ 425 | library Address { 426 | /** 427 | * @dev Returns true if `account` is a contract. 428 | * 429 | * This test is non-exhaustive, and there may be false-negatives: during the 430 | * execution of a contract's constructor, its address will be reported as 431 | * not containing a contract. 432 | * 433 | * IMPORTANT: It is unsafe to assume that an address for which this 434 | * function returns false is an externally-owned account (EOA) and not a 435 | * contract. 436 | */ 437 | function isContract(address account) internal view returns (bool) { 438 | // This method relies in extcodesize, which returns 0 for contracts in 439 | // construction, since the code is only stored at the end of the 440 | // constructor execution. 441 | 442 | // According to EIP-1052, 0x0 is the value returned for not-yet created accounts 443 | // and 0xc5d2460186f7233c927e7db2dcc703c0e500b653ca82273b7bfad8045d85a470 is returned 444 | // for accounts without code, i.e. `keccak256('')` 445 | bytes32 codehash; 446 | bytes32 accountHash = 0xc5d2460186f7233c927e7db2dcc703c0e500b653ca82273b7bfad8045d85a470; 447 | // solhint-disable-next-line no-inline-assembly 448 | assembly { codehash := extcodehash(account) } 449 | return (codehash != 0x0 && codehash != accountHash); 450 | } 451 | 452 | /** 453 | * @dev Converts an `address` into `address payable`. Note that this is 454 | * simply a type cast: the actual underlying value is not changed. 455 | * 456 | * _Available since v2.4.0._ 457 | */ 458 | function toPayable(address account) internal pure returns (address payable) { 459 | return address(uint160(account)); 460 | } 461 | 462 | /** 463 | * @dev Replacement for Solidity's `transfer`: sends `amount` wei to 464 | * `recipient`, forwarding all available gas and reverting on errors. 465 | * 466 | * https://eips.ethereum.org/EIPS/eip-1884[EIP1884] increases the gas cost 467 | * of certain opcodes, possibly making contracts go over the 2300 gas limit 468 | * imposed by `transfer`, making them unable to receive funds via 469 | * `transfer`. {sendValue} removes this limitation. 470 | * 471 | * https://diligence.consensys.net/posts/2019/09/stop-using-soliditys-transfer-now/[Learn more]. 472 | * 473 | * IMPORTANT: because control is transferred to `recipient`, care must be 474 | * taken to not create reentrancy vulnerabilities. Consider using 475 | * {ReentrancyGuard} or the 476 | * https://solidity.readthedocs.io/en/v0.5.11/security-considerations.html#use-the-checks-effects-interactions-pattern[checks-effects-interactions pattern]. 477 | * 478 | * _Available since v2.4.0._ 479 | */ 480 | function sendValue(address payable recipient, uint256 amount) internal { 481 | require(address(this).balance >= amount, "Address: insufficient balance"); 482 | 483 | // solhint-disable-next-line avoid-call-value 484 | (bool success, ) = recipient.call.value(amount)(""); 485 | require(success, "Address: unable to send value, recipient may have reverted"); 486 | } 487 | } 488 | 489 | // File: @openzeppelin/contracts/token/ERC20/SafeERC20.sol 490 | 491 | pragma solidity ^0.5.0; 492 | 493 | 494 | 495 | 496 | /** 497 | * @title SafeERC20 498 | * @dev Wrappers around ERC20 operations that throw on failure (when the token 499 | * contract returns false). Tokens that return no value (and instead revert or 500 | * throw on failure) are also supported, non-reverting calls are assumed to be 501 | * successful. 502 | * To use this library you can add a `using SafeERC20 for ERC20;` statement to your contract, 503 | * which allows you to call the safe operations as `token.safeTransfer(...)`, etc. 504 | */ 505 | library SafeERC20 { 506 | using SafeMath for uint256; 507 | using Address for address; 508 | 509 | function safeTransfer(IERC20 token, address to, uint256 value) internal { 510 | callOptionalReturn(token, abi.encodeWithSelector(token.transfer.selector, to, value)); 511 | } 512 | 513 | function safeTransferFrom(IERC20 token, address from, address to, uint256 value) internal { 514 | callOptionalReturn(token, abi.encodeWithSelector(token.transferFrom.selector, from, to, value)); 515 | } 516 | 517 | function safeApprove(IERC20 token, address spender, uint256 value) internal { 518 | // safeApprove should only be called when setting an initial allowance, 519 | // or when resetting it to zero. To increase and decrease it, use 520 | // 'safeIncreaseAllowance' and 'safeDecreaseAllowance' 521 | // solhint-disable-next-line max-line-length 522 | require((value == 0) || (token.allowance(address(this), spender) == 0), 523 | "SafeERC20: approve from non-zero to non-zero allowance" 524 | ); 525 | callOptionalReturn(token, abi.encodeWithSelector(token.approve.selector, spender, value)); 526 | } 527 | 528 | function safeIncreaseAllowance(IERC20 token, address spender, uint256 value) internal { 529 | uint256 newAllowance = token.allowance(address(this), spender).add(value); 530 | callOptionalReturn(token, abi.encodeWithSelector(token.approve.selector, spender, newAllowance)); 531 | } 532 | 533 | function safeDecreaseAllowance(IERC20 token, address spender, uint256 value) internal { 534 | uint256 newAllowance = token.allowance(address(this), spender).sub(value, "SafeERC20: decreased allowance below zero"); 535 | callOptionalReturn(token, abi.encodeWithSelector(token.approve.selector, spender, newAllowance)); 536 | } 537 | 538 | /** 539 | * @dev Imitates a Solidity high-level call (i.e. a regular function call to a contract), relaxing the requirement 540 | * on the return value: the return value is optional (but if data is returned, it must not be false). 541 | * @param token The token targeted by the call. 542 | * @param data The call data (encoded using abi.encode or one of its variants). 543 | */ 544 | function callOptionalReturn(IERC20 token, bytes memory data) private { 545 | // We need to perform a low level call here, to bypass Solidity's return data size checking mechanism, since 546 | // we're implementing it ourselves. 547 | 548 | // A Solidity high level call has three parts: 549 | // 1. The target address is checked to verify it contains contract code 550 | // 2. The call itself is made, and success asserted 551 | // 3. The return value is decoded, which in turn checks the size of the returned data. 552 | // solhint-disable-next-line max-line-length 553 | require(address(token).isContract(), "SafeERC20: call to non-contract"); 554 | 555 | // solhint-disable-next-line avoid-low-level-calls 556 | (bool success, bytes memory returndata) = address(token).call(data); 557 | require(success, "SafeERC20: low-level call failed"); 558 | 559 | if (returndata.length > 0) { // Return data is optional 560 | // solhint-disable-next-line max-line-length 561 | require(abi.decode(returndata, (bool)), "SafeERC20: ERC20 operation did not succeed"); 562 | } 563 | } 564 | } 565 | 566 | // File: contracts/IRewardDistributionRecipient.sol 567 | 568 | pragma solidity ^0.5.0; 569 | 570 | 571 | 572 | contract IRewardDistributionRecipient is Ownable { 573 | address public rewardDistribution; 574 | 575 | function notifyRewardAmount(uint256 reward) external; 576 | 577 | modifier onlyRewardDistribution() { 578 | require(_msgSender() == rewardDistribution, "Caller is not reward distribution"); 579 | _; 580 | } 581 | 582 | function setRewardDistribution(address _rewardDistribution) 583 | external 584 | onlyOwner 585 | { 586 | rewardDistribution = _rewardDistribution; 587 | } 588 | } 589 | 590 | // File: contracts/CurveRewards.sol 591 | 592 | pragma solidity ^0.5.0; 593 | 594 | contract LPTokenWrapper { 595 | using SafeMath for uint256; 596 | using SafeERC20 for IERC20; 597 | 598 | IERC20 public lpt; 599 | 600 | uint256 private _totalSupply; 601 | mapping(address => uint256) private _balances; 602 | 603 | function totalSupply() public view returns (uint256) { 604 | return _totalSupply; 605 | } 606 | 607 | function balanceOf(address account) public view returns (uint256) { 608 | return _balances[account]; 609 | } 610 | 611 | function stake(uint256 amount) public { 612 | _totalSupply = _totalSupply.add(amount); 613 | _balances[msg.sender] = _balances[msg.sender].add(amount); 614 | lpt.safeTransferFrom(msg.sender, address(this), amount); 615 | } 616 | 617 | function withdraw(uint256 amount) public { 618 | _totalSupply = _totalSupply.sub(amount); 619 | _balances[msg.sender] = _balances[msg.sender].sub(amount); 620 | lpt.safeTransfer(msg.sender, amount); 621 | } 622 | } 623 | 624 | contract PASTAPool2 is LPTokenWrapper, IRewardDistributionRecipient { 625 | IERC20 public spaghetti; 626 | uint256 public DURATION = 21 days; 627 | 628 | uint256 public starttime = 1597881600; 629 | uint256 public periodFinish = 0; 630 | uint256 public rewardRate = 0; 631 | uint256 public lastUpdateTime; 632 | uint256 public rewardPerTokenStored; 633 | mapping(address => uint256) public userRewardPerTokenPaid; 634 | mapping(address => uint256) public rewards; 635 | 636 | event RewardAdded(uint256 reward); 637 | event Staked(address indexed user, uint256 amount); 638 | event Withdrawn(address indexed user, uint256 amount); 639 | event RewardPaid(address indexed user, uint256 reward); 640 | 641 | constructor(address _spaghetti, address _lptoken) public { 642 | spaghetti = IERC20(_spaghetti); 643 | lpt = IERC20(_lptoken); 644 | } 645 | 646 | modifier checkStart() { 647 | require(block.timestamp >= starttime,"not start"); 648 | _; 649 | } 650 | 651 | modifier updateReward(address account) { 652 | rewardPerTokenStored = rewardPerToken(); 653 | lastUpdateTime = lastTimeRewardApplicable(); 654 | if (account != address(0)) { 655 | rewards[account] = earned(account); 656 | userRewardPerTokenPaid[account] = rewardPerTokenStored; 657 | } 658 | _; 659 | } 660 | 661 | function lastTimeRewardApplicable() public view returns (uint256) { 662 | return Math.min(block.timestamp, periodFinish); 663 | } 664 | 665 | function rewardPerToken() public view returns (uint256) { 666 | if (totalSupply() == 0) { 667 | return rewardPerTokenStored; 668 | } 669 | return 670 | rewardPerTokenStored.add( 671 | lastTimeRewardApplicable() 672 | .sub(lastUpdateTime) 673 | .mul(rewardRate) 674 | .mul(1e18) 675 | .div(totalSupply()) 676 | ); 677 | } 678 | 679 | function earned(address account) public view returns (uint256) { 680 | return 681 | balanceOf(account) 682 | .mul(rewardPerToken().sub(userRewardPerTokenPaid[account])) 683 | .div(1e18) 684 | .add(rewards[account]); 685 | } 686 | 687 | // stake visibility is public as overriding LPTokenWrapper's stake() function 688 | function stake(uint256 amount) public updateReward(msg.sender) checkStart { 689 | require(amount > 0, "Cannot stake 0"); 690 | super.stake(amount); 691 | emit Staked(msg.sender, amount); 692 | } 693 | 694 | function withdraw(uint256 amount) public updateReward(msg.sender) checkStart { 695 | require(amount > 0, "Cannot withdraw 0"); 696 | super.withdraw(amount); 697 | emit Withdrawn(msg.sender, amount); 698 | } 699 | 700 | function exit() external { 701 | withdraw(balanceOf(msg.sender)); 702 | getReward(); 703 | } 704 | 705 | function getReward() public updateReward(msg.sender) checkStart { 706 | uint256 reward = earned(msg.sender); 707 | if (reward > 0) { 708 | rewards[msg.sender] = 0; 709 | spaghetti.safeTransfer(msg.sender, reward); 710 | emit RewardPaid(msg.sender, reward); 711 | } 712 | } 713 | 714 | function notifyRewardAmount(uint256 reward) 715 | external 716 | onlyRewardDistribution 717 | updateReward(address(0)) 718 | { 719 | if (block.timestamp > starttime) { 720 | if (block.timestamp >= periodFinish) { 721 | rewardRate = reward.div(DURATION); 722 | } else { 723 | uint256 remaining = periodFinish.sub(block.timestamp); 724 | uint256 leftover = remaining.mul(rewardRate); 725 | rewardRate = reward.add(leftover).div(DURATION); 726 | } 727 | lastUpdateTime = block.timestamp; 728 | periodFinish = block.timestamp.add(DURATION); 729 | emit RewardAdded(reward); 730 | } else { 731 | rewardRate = reward.div(DURATION); 732 | lastUpdateTime = starttime; 733 | periodFinish = starttime.add(DURATION); 734 | emit RewardAdded(reward); 735 | } 736 | } 737 | } -------------------------------------------------------------------------------- /src/SpaghettiCore.sol: -------------------------------------------------------------------------------- 1 | /** 2 | *Submitted for verification at Etherscan.io on 2020-07-17 3 | */ 4 | 5 | /* 6 | ____ __ __ __ _ 7 | / __/__ __ ___ / /_ / / ___ / /_ (_)__ __ 8 | _\ \ / // // _ \/ __// _ \/ -_)/ __// / \ \ / 9 | /___/ \_, //_//_/\__//_//_/\__/ \__//_/ /_\_\ 10 | /___/ 11 | 12 | * Synthetix: PASTARewards.sol 13 | * 14 | * Docs: https://docs.synthetix.io/ 15 | * 16 | * 17 | * MIT License 18 | * =========== 19 | * 20 | * Copyright (c) 2020 Synthetix 21 | * 22 | * Permission is hereby granted, free of charge, to any person obtaining a copy 23 | * of this software and associated documentation files (the "Software"), to deal 24 | * in the Software without restriction, including without limitation the rights 25 | * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell 26 | * copies of the Software, and to permit persons to whom the Software is 27 | * furnished to do so, subject to the following conditions: 28 | * 29 | * The above copyright notice and this permission notice shall be included in all 30 | * copies or substantial portions of the Software. 31 | * 32 | * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 33 | * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 34 | * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 35 | * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 36 | * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 37 | * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE 38 | */ 39 | 40 | // File: @openzeppelin/contracts/math/Math.sol 41 | 42 | pragma solidity ^0.5.0; 43 | 44 | /** 45 | * @dev Standard math utilities missing in the Solidity language. 46 | */ 47 | library Math { 48 | /** 49 | * @dev Returns the largest of two numbers. 50 | */ 51 | function max(uint256 a, uint256 b) internal pure returns (uint256) { 52 | return a >= b ? a : b; 53 | } 54 | 55 | /** 56 | * @dev Returns the smallest of two numbers. 57 | */ 58 | function min(uint256 a, uint256 b) internal pure returns (uint256) { 59 | return a < b ? a : b; 60 | } 61 | 62 | /** 63 | * @dev Returns the average of two numbers. The result is rounded towards 64 | * zero. 65 | */ 66 | function average(uint256 a, uint256 b) internal pure returns (uint256) { 67 | // (a + b) / 2 can overflow, so we distribute 68 | return (a / 2) + (b / 2) + ((a % 2 + b % 2) / 2); 69 | } 70 | } 71 | 72 | // File: @openzeppelin/contracts/math/SafeMath.sol 73 | 74 | pragma solidity ^0.5.0; 75 | 76 | /** 77 | * @dev Wrappers over Solidity's arithmetic operations with added overflow 78 | * checks. 79 | * 80 | * Arithmetic operations in Solidity wrap on overflow. This can easily result 81 | * in bugs, because programmers usually assume that an overflow raises an 82 | * error, which is the standard behavior in high level programming languages. 83 | * `SafeMath` restores this intuition by reverting the transaction when an 84 | * operation overflows. 85 | * 86 | * Using this library instead of the unchecked operations eliminates an entire 87 | * class of bugs, so it's recommended to use it always. 88 | */ 89 | library SafeMath { 90 | /** 91 | * @dev Returns the addition of two unsigned integers, reverting on 92 | * overflow. 93 | * 94 | * Counterpart to Solidity's `+` operator. 95 | * 96 | * Requirements: 97 | * - Addition cannot overflow. 98 | */ 99 | function add(uint256 a, uint256 b) internal pure returns (uint256) { 100 | uint256 c = a + b; 101 | require(c >= a, "SafeMath: addition overflow"); 102 | 103 | return c; 104 | } 105 | 106 | /** 107 | * @dev Returns the subtraction of two unsigned integers, reverting on 108 | * overflow (when the result is negative). 109 | * 110 | * Counterpart to Solidity's `-` operator. 111 | * 112 | * Requirements: 113 | * - Subtraction cannot overflow. 114 | */ 115 | function sub(uint256 a, uint256 b) internal pure returns (uint256) { 116 | return sub(a, b, "SafeMath: subtraction overflow"); 117 | } 118 | 119 | /** 120 | * @dev Returns the subtraction of two unsigned integers, reverting with custom message on 121 | * overflow (when the result is negative). 122 | * 123 | * Counterpart to Solidity's `-` operator. 124 | * 125 | * Requirements: 126 | * - Subtraction cannot overflow. 127 | * 128 | * _Available since v2.4.0._ 129 | */ 130 | function sub(uint256 a, uint256 b, string memory errorMessage) internal pure returns (uint256) { 131 | require(b <= a, errorMessage); 132 | uint256 c = a - b; 133 | 134 | return c; 135 | } 136 | 137 | /** 138 | * @dev Returns the multiplication of two unsigned integers, reverting on 139 | * overflow. 140 | * 141 | * Counterpart to Solidity's `*` operator. 142 | * 143 | * Requirements: 144 | * - Multiplication cannot overflow. 145 | */ 146 | function mul(uint256 a, uint256 b) internal pure returns (uint256) { 147 | // Gas optimization: this is cheaper than requiring 'a' not being zero, but the 148 | // benefit is lost if 'b' is also tested. 149 | // See: https://github.com/OpenZeppelin/openzeppelin-contracts/pull/522 150 | if (a == 0) { 151 | return 0; 152 | } 153 | 154 | uint256 c = a * b; 155 | require(c / a == b, "SafeMath: multiplication overflow"); 156 | 157 | return c; 158 | } 159 | 160 | /** 161 | * @dev Returns the integer division of two unsigned integers. Reverts on 162 | * division by zero. The result is rounded towards zero. 163 | * 164 | * Counterpart to Solidity's `/` operator. Note: this function uses a 165 | * `revert` opcode (which leaves remaining gas untouched) while Solidity 166 | * uses an invalid opcode to revert (consuming all remaining gas). 167 | * 168 | * Requirements: 169 | * - The divisor cannot be zero. 170 | */ 171 | function div(uint256 a, uint256 b) internal pure returns (uint256) { 172 | return div(a, b, "SafeMath: division by zero"); 173 | } 174 | 175 | /** 176 | * @dev Returns the integer division of two unsigned integers. Reverts with custom message on 177 | * division by zero. The result is rounded towards zero. 178 | * 179 | * Counterpart to Solidity's `/` operator. Note: this function uses a 180 | * `revert` opcode (which leaves remaining gas untouched) while Solidity 181 | * uses an invalid opcode to revert (consuming all remaining gas). 182 | * 183 | * Requirements: 184 | * - The divisor cannot be zero. 185 | * 186 | * _Available since v2.4.0._ 187 | */ 188 | function div(uint256 a, uint256 b, string memory errorMessage) internal pure returns (uint256) { 189 | // Solidity only automatically asserts when dividing by 0 190 | require(b > 0, errorMessage); 191 | uint256 c = a / b; 192 | // assert(a == b * c + a % b); // There is no case in which this doesn't hold 193 | 194 | return c; 195 | } 196 | 197 | /** 198 | * @dev Returns the remainder of dividing two unsigned integers. (unsigned integer modulo), 199 | * Reverts when dividing by zero. 200 | * 201 | * Counterpart to Solidity's `%` operator. This function uses a `revert` 202 | * opcode (which leaves remaining gas untouched) while Solidity uses an 203 | * invalid opcode to revert (consuming all remaining gas). 204 | * 205 | * Requirements: 206 | * - The divisor cannot be zero. 207 | */ 208 | function mod(uint256 a, uint256 b) internal pure returns (uint256) { 209 | return mod(a, b, "SafeMath: modulo by zero"); 210 | } 211 | 212 | /** 213 | * @dev Returns the remainder of dividing two unsigned integers. (unsigned integer modulo), 214 | * Reverts with custom message when dividing by zero. 215 | * 216 | * Counterpart to Solidity's `%` operator. This function uses a `revert` 217 | * opcode (which leaves remaining gas untouched) while Solidity uses an 218 | * invalid opcode to revert (consuming all remaining gas). 219 | * 220 | * Requirements: 221 | * - The divisor cannot be zero. 222 | * 223 | * _Available since v2.4.0._ 224 | */ 225 | function mod(uint256 a, uint256 b, string memory errorMessage) internal pure returns (uint256) { 226 | require(b != 0, errorMessage); 227 | return a % b; 228 | } 229 | } 230 | 231 | // File: @openzeppelin/contracts/GSN/Context.sol 232 | 233 | pragma solidity ^0.5.0; 234 | 235 | /* 236 | * @dev Provides information about the current execution context, including the 237 | * sender of the transaction and its data. While these are generally available 238 | * via msg.sender and msg.data, they should not be accessed in such a direct 239 | * manner, since when dealing with GSN meta-transactions the account sending and 240 | * paying for execution may not be the actual sender (as far as an application 241 | * is concerned). 242 | * 243 | * This contract is only required for intermediate, library-like contracts. 244 | */ 245 | contract Context { 246 | // Empty internal constructor, to prevent people from mistakenly deploying 247 | // an instance of this contract, which should be used via inheritance. 248 | constructor () internal { } 249 | // solhint-disable-previous-line no-empty-blocks 250 | 251 | function _msgSender() internal view returns (address payable) { 252 | return msg.sender; 253 | } 254 | 255 | function _msgData() internal view returns (bytes memory) { 256 | this; // silence state mutability warning without generating bytecode - see https://github.com/ethereum/solidity/issues/2691 257 | return msg.data; 258 | } 259 | } 260 | 261 | // File: @openzeppelin/contracts/ownership/Ownable.sol 262 | 263 | pragma solidity ^0.5.0; 264 | 265 | /** 266 | * @dev Contract module which provides a basic access control mechanism, where 267 | * there is an account (an owner) that can be granted exclusive access to 268 | * specific functions. 269 | * 270 | * This module is used through inheritance. It will make available the modifier 271 | * `onlyOwner`, which can be applied to your functions to restrict their use to 272 | * the owner. 273 | */ 274 | contract Ownable is Context { 275 | address private _owner; 276 | 277 | event OwnershipTransferred(address indexed previousOwner, address indexed newOwner); 278 | 279 | /** 280 | * @dev Initializes the contract setting the deployer as the initial owner. 281 | */ 282 | constructor () internal { 283 | _owner = _msgSender(); 284 | emit OwnershipTransferred(address(0), _owner); 285 | } 286 | 287 | /** 288 | * @dev Returns the address of the current owner. 289 | */ 290 | function owner() public view returns (address) { 291 | return _owner; 292 | } 293 | 294 | /** 295 | * @dev Throws if called by any account other than the owner. 296 | */ 297 | modifier onlyOwner() { 298 | require(isOwner(), "Ownable: caller is not the owner"); 299 | _; 300 | } 301 | 302 | /** 303 | * @dev Returns true if the caller is the current owner. 304 | */ 305 | function isOwner() public view returns (bool) { 306 | return _msgSender() == _owner; 307 | } 308 | 309 | /** 310 | * @dev Leaves the contract without owner. It will not be possible to call 311 | * `onlyOwner` functions anymore. Can only be called by the current owner. 312 | * 313 | * NOTE: Renouncing ownership will leave the contract without an owner, 314 | * thereby removing any functionality that is only available to the owner. 315 | */ 316 | function renounceOwnership() public onlyOwner { 317 | emit OwnershipTransferred(_owner, address(0)); 318 | _owner = address(0); 319 | } 320 | 321 | /** 322 | * @dev Transfers ownership of the contract to a new account (`newOwner`). 323 | * Can only be called by the current owner. 324 | */ 325 | function transferOwnership(address newOwner) public onlyOwner { 326 | _transferOwnership(newOwner); 327 | } 328 | 329 | /** 330 | * @dev Transfers ownership of the contract to a new account (`newOwner`). 331 | */ 332 | function _transferOwnership(address newOwner) internal { 333 | require(newOwner != address(0), "Ownable: new owner is the zero address"); 334 | emit OwnershipTransferred(_owner, newOwner); 335 | _owner = newOwner; 336 | } 337 | } 338 | 339 | // File: @openzeppelin/contracts/token/ERC20/IERC20.sol 340 | 341 | pragma solidity ^0.5.0; 342 | 343 | /** 344 | * @dev Interface of the ERC20 standard as defined in the EIP. Does not include 345 | * the optional functions; to access them see {ERC20Detailed}. 346 | */ 347 | interface IERC20 { 348 | /** 349 | * @dev Returns the amount of tokens in existence. 350 | */ 351 | function totalSupply() external view returns (uint256); 352 | 353 | /** 354 | * @dev Returns the amount of tokens owned by `account`. 355 | */ 356 | function balanceOf(address account) external view returns (uint256); 357 | 358 | /** 359 | * @dev Moves `amount` tokens from the caller's account to `recipient`. 360 | * 361 | * Returns a boolean value indicating whether the operation succeeded. 362 | * 363 | * Emits a {Transfer} event. 364 | */ 365 | function transfer(address recipient, uint256 amount) external returns (bool); 366 | 367 | /** 368 | * @dev Returns the remaining number of tokens that `spender` will be 369 | * allowed to spend on behalf of `owner` through {transferFrom}. This is 370 | * zero by default. 371 | * 372 | * This value changes when {approve} or {transferFrom} are called. 373 | */ 374 | function allowance(address owner, address spender) external view returns (uint256); 375 | 376 | /** 377 | * @dev Sets `amount` as the allowance of `spender` over the caller's tokens. 378 | * 379 | * Returns a boolean value indicating whether the operation succeeded. 380 | * 381 | * IMPORTANT: Beware that changing an allowance with this method brings the risk 382 | * that someone may use both the old and the new allowance by unfortunate 383 | * transaction ordering. One possible solution to mitigate this race 384 | * condition is to first reduce the spender's allowance to 0 and set the 385 | * desired value afterwards: 386 | * https://github.com/ethereum/EIPs/issues/20#issuecomment-263524729 387 | * 388 | * Emits an {Approval} event. 389 | */ 390 | function approve(address spender, uint256 amount) external returns (bool); 391 | 392 | /** 393 | * @dev Moves `amount` tokens from `sender` to `recipient` using the 394 | * allowance mechanism. `amount` is then deducted from the caller's 395 | * allowance. 396 | * 397 | * Returns a boolean value indicating whether the operation succeeded. 398 | * 399 | * Emits a {Transfer} event. 400 | */ 401 | function transferFrom(address sender, address recipient, uint256 amount) external returns (bool); 402 | 403 | /** 404 | * @dev Emitted when `value` tokens are moved from one account (`from`) to 405 | * another (`to`). 406 | * 407 | * Note that `value` may be zero. 408 | */ 409 | event Transfer(address indexed from, address indexed to, uint256 value); 410 | 411 | /** 412 | * @dev Emitted when the allowance of a `spender` for an `owner` is set by 413 | * a call to {approve}. `value` is the new allowance. 414 | */ 415 | event Approval(address indexed owner, address indexed spender, uint256 value); 416 | } 417 | 418 | // File: @openzeppelin/contracts/utils/Address.sol 419 | 420 | pragma solidity ^0.5.5; 421 | 422 | /** 423 | * @dev Collection of functions related to the address type 424 | */ 425 | library Address { 426 | /** 427 | * @dev Returns true if `account` is a contract. 428 | * 429 | * This test is non-exhaustive, and there may be false-negatives: during the 430 | * execution of a contract's constructor, its address will be reported as 431 | * not containing a contract. 432 | * 433 | * IMPORTANT: It is unsafe to assume that an address for which this 434 | * function returns false is an externally-owned account (EOA) and not a 435 | * contract. 436 | */ 437 | function isContract(address account) internal view returns (bool) { 438 | // This method relies in extcodesize, which returns 0 for contracts in 439 | // construction, since the code is only stored at the end of the 440 | // constructor execution. 441 | 442 | // According to EIP-1052, 0x0 is the value returned for not-yet created accounts 443 | // and 0xc5d2460186f7233c927e7db2dcc703c0e500b653ca82273b7bfad8045d85a470 is returned 444 | // for accounts without code, i.e. `keccak256('')` 445 | bytes32 codehash; 446 | bytes32 accountHash = 0xc5d2460186f7233c927e7db2dcc703c0e500b653ca82273b7bfad8045d85a470; 447 | // solhint-disable-next-line no-inline-assembly 448 | assembly { codehash := extcodehash(account) } 449 | return (codehash != 0x0 && codehash != accountHash); 450 | } 451 | 452 | /** 453 | * @dev Converts an `address` into `address payable`. Note that this is 454 | * simply a type cast: the actual underlying value is not changed. 455 | * 456 | * _Available since v2.4.0._ 457 | */ 458 | function toPayable(address account) internal pure returns (address payable) { 459 | return address(uint160(account)); 460 | } 461 | 462 | /** 463 | * @dev Replacement for Solidity's `transfer`: sends `amount` wei to 464 | * `recipient`, forwarding all available gas and reverting on errors. 465 | * 466 | * https://eips.ethereum.org/EIPS/eip-1884[EIP1884] increases the gas cost 467 | * of certain opcodes, possibly making contracts go over the 2300 gas limit 468 | * imposed by `transfer`, making them unable to receive funds via 469 | * `transfer`. {sendValue} removes this limitation. 470 | * 471 | * https://diligence.consensys.net/posts/2019/09/stop-using-soliditys-transfer-now/[Learn more]. 472 | * 473 | * IMPORTANT: because control is transferred to `recipient`, care must be 474 | * taken to not create reentrancy vulnerabilities. Consider using 475 | * {ReentrancyGuard} or the 476 | * https://solidity.readthedocs.io/en/v0.5.11/security-considerations.html#use-the-checks-effects-interactions-pattern[checks-effects-interactions pattern]. 477 | * 478 | * _Available since v2.4.0._ 479 | */ 480 | function sendValue(address payable recipient, uint256 amount) internal { 481 | require(address(this).balance >= amount, "Address: insufficient balance"); 482 | 483 | // solhint-disable-next-line avoid-call-value 484 | (bool success, ) = recipient.call.value(amount)(""); 485 | require(success, "Address: unable to send value, recipient may have reverted"); 486 | } 487 | } 488 | 489 | // File: @openzeppelin/contracts/token/ERC20/SafeERC20.sol 490 | 491 | pragma solidity ^0.5.0; 492 | 493 | 494 | 495 | 496 | /** 497 | * @title SafeERC20 498 | * @dev Wrappers around ERC20 operations that throw on failure (when the token 499 | * contract returns false). Tokens that return no value (and instead revert or 500 | * throw on failure) are also supported, non-reverting calls are assumed to be 501 | * successful. 502 | * To use this library you can add a `using SafeERC20 for ERC20;` statement to your contract, 503 | * which allows you to call the safe operations as `token.safeTransfer(...)`, etc. 504 | */ 505 | library SafeERC20 { 506 | using SafeMath for uint256; 507 | using Address for address; 508 | 509 | function safeTransfer(IERC20 token, address to, uint256 value) internal { 510 | callOptionalReturn(token, abi.encodeWithSelector(token.transfer.selector, to, value)); 511 | } 512 | 513 | function safeTransferFrom(IERC20 token, address from, address to, uint256 value) internal { 514 | callOptionalReturn(token, abi.encodeWithSelector(token.transferFrom.selector, from, to, value)); 515 | } 516 | 517 | function safeApprove(IERC20 token, address spender, uint256 value) internal { 518 | // safeApprove should only be called when setting an initial allowance, 519 | // or when resetting it to zero. To increase and decrease it, use 520 | // 'safeIncreaseAllowance' and 'safeDecreaseAllowance' 521 | // solhint-disable-next-line max-line-length 522 | require((value == 0) || (token.allowance(address(this), spender) == 0), 523 | "SafeERC20: approve from non-zero to non-zero allowance" 524 | ); 525 | callOptionalReturn(token, abi.encodeWithSelector(token.approve.selector, spender, value)); 526 | } 527 | 528 | function safeIncreaseAllowance(IERC20 token, address spender, uint256 value) internal { 529 | uint256 newAllowance = token.allowance(address(this), spender).add(value); 530 | callOptionalReturn(token, abi.encodeWithSelector(token.approve.selector, spender, newAllowance)); 531 | } 532 | 533 | function safeDecreaseAllowance(IERC20 token, address spender, uint256 value) internal { 534 | uint256 newAllowance = token.allowance(address(this), spender).sub(value, "SafeERC20: decreased allowance below zero"); 535 | callOptionalReturn(token, abi.encodeWithSelector(token.approve.selector, spender, newAllowance)); 536 | } 537 | 538 | /** 539 | * @dev Imitates a Solidity high-level call (i.e. a regular function call to a contract), relaxing the requirement 540 | * on the return value: the return value is optional (but if data is returned, it must not be false). 541 | * @param token The token targeted by the call. 542 | * @param data The call data (encoded using abi.encode or one of its variants). 543 | */ 544 | function callOptionalReturn(IERC20 token, bytes memory data) private { 545 | // We need to perform a low level call here, to bypass Solidity's return data size checking mechanism, since 546 | // we're implementing it ourselves. 547 | 548 | // A Solidity high level call has three parts: 549 | // 1. The target address is checked to verify it contains contract code 550 | // 2. The call itself is made, and success asserted 551 | // 3. The return value is decoded, which in turn checks the size of the returned data. 552 | // solhint-disable-next-line max-line-length 553 | require(address(token).isContract(), "SafeERC20: call to non-contract"); 554 | 555 | // solhint-disable-next-line avoid-low-level-calls 556 | (bool success, bytes memory returndata) = address(token).call(data); 557 | require(success, "SafeERC20: low-level call failed"); 558 | 559 | if (returndata.length > 0) { // Return data is optional 560 | // solhint-disable-next-line max-line-length 561 | require(abi.decode(returndata, (bool)), "SafeERC20: ERC20 operation did not succeed"); 562 | } 563 | } 564 | } 565 | 566 | // File: contracts/IRewardDistributionRecipient.sol 567 | 568 | pragma solidity ^0.5.0; 569 | 570 | 571 | 572 | contract IRewardDistributionRecipient is Ownable { 573 | address public rewardDistribution; 574 | 575 | function notifyRewardAmount(uint256 reward) external; 576 | 577 | modifier onlyRewardDistribution() { 578 | require(_msgSender() == rewardDistribution, "Caller is not reward distribution"); 579 | _; 580 | } 581 | 582 | function setRewardDistribution(address _rewardDistribution) 583 | external 584 | onlyOwner 585 | { 586 | rewardDistribution = _rewardDistribution; 587 | } 588 | } 589 | 590 | // File: contracts/CurveRewards.sol 591 | 592 | pragma solidity ^0.5.0; 593 | 594 | contract LPTokenWrapper { 595 | using SafeMath for uint256; 596 | using SafeERC20 for IERC20; 597 | 598 | IERC20 public lpt; 599 | 600 | uint256 private _totalSupply; 601 | mapping(address => uint256) private _balances; 602 | 603 | function totalSupply() public view returns (uint256) { 604 | return _totalSupply; 605 | } 606 | 607 | function balanceOf(address account) public view returns (uint256) { 608 | return _balances[account]; 609 | } 610 | 611 | function stake(uint256 amount) public { 612 | _totalSupply = _totalSupply.add(amount); 613 | _balances[msg.sender] = _balances[msg.sender].add(amount); 614 | lpt.safeTransferFrom(msg.sender, address(this), amount); 615 | } 616 | 617 | function withdraw(uint256 amount) public { 618 | _totalSupply = _totalSupply.sub(amount); 619 | _balances[msg.sender] = _balances[msg.sender].sub(amount); 620 | lpt.safeTransfer(msg.sender, amount); 621 | } 622 | } 623 | 624 | contract PASTAPool is LPTokenWrapper, IRewardDistributionRecipient { 625 | IERC20 public spaghetti; 626 | uint256 public DURATION; 627 | 628 | uint256 public starttime; 629 | uint256 public periodFinish = 0; 630 | uint256 public rewardRate = 0; 631 | uint256 public lastUpdateTime; 632 | uint256 public rewardPerTokenStored; 633 | mapping(address => uint256) public userRewardPerTokenPaid; 634 | mapping(address => uint256) public rewards; 635 | 636 | event RewardAdded(uint256 reward); 637 | event Staked(address indexed user, uint256 amount); 638 | event Withdrawn(address indexed user, uint256 amount); 639 | event RewardPaid(address indexed user, uint256 reward); 640 | 641 | constructor(address _spaghetti, address _lptoken, uint _duration, uint _starttime) public { 642 | spaghetti = IERC20(_spaghetti); 643 | lpt = IERC20(_lptoken); 644 | DURATION = _duration; 645 | starttime = _starttime; 646 | } 647 | 648 | modifier checkStart() { 649 | require(block.timestamp >= starttime,"not start"); 650 | _; 651 | } 652 | 653 | modifier updateReward(address account) { 654 | rewardPerTokenStored = rewardPerToken(); 655 | lastUpdateTime = lastTimeRewardApplicable(); 656 | if (account != address(0)) { 657 | rewards[account] = earned(account); 658 | userRewardPerTokenPaid[account] = rewardPerTokenStored; 659 | } 660 | _; 661 | } 662 | 663 | function lastTimeRewardApplicable() public view returns (uint256) { 664 | return Math.min(block.timestamp, periodFinish); 665 | } 666 | 667 | function rewardPerToken() public view returns (uint256) { 668 | if (totalSupply() == 0) { 669 | return rewardPerTokenStored; 670 | } 671 | return 672 | rewardPerTokenStored.add( 673 | lastTimeRewardApplicable() 674 | .sub(lastUpdateTime) 675 | .mul(rewardRate) 676 | .mul(1e18) 677 | .div(totalSupply()) 678 | ); 679 | } 680 | 681 | function earned(address account) public view returns (uint256) { 682 | return 683 | balanceOf(account) 684 | .mul(rewardPerToken().sub(userRewardPerTokenPaid[account])) 685 | .div(1e18) 686 | .add(rewards[account]); 687 | } 688 | 689 | // stake visibility is public as overriding LPTokenWrapper's stake() function 690 | function stake(uint256 amount) public updateReward(msg.sender) checkStart { 691 | require(amount > 0, "Cannot stake 0"); 692 | super.stake(amount); 693 | emit Staked(msg.sender, amount); 694 | } 695 | 696 | function withdraw(uint256 amount) public updateReward(msg.sender) checkStart { 697 | require(amount > 0, "Cannot withdraw 0"); 698 | super.withdraw(amount); 699 | emit Withdrawn(msg.sender, amount); 700 | } 701 | 702 | function exit() external { 703 | withdraw(balanceOf(msg.sender)); 704 | getReward(); 705 | } 706 | 707 | function getReward() public updateReward(msg.sender) checkStart { 708 | uint256 reward = earned(msg.sender); 709 | if (reward > 0) { 710 | rewards[msg.sender] = 0; 711 | spaghetti.safeTransfer(msg.sender, reward); 712 | emit RewardPaid(msg.sender, reward); 713 | } 714 | } 715 | 716 | function notifyRewardAmount(uint256 reward) 717 | external 718 | onlyRewardDistribution 719 | updateReward(address(0)) 720 | { 721 | if (block.timestamp > starttime) { 722 | if (block.timestamp >= periodFinish) { 723 | rewardRate = reward.div(DURATION); 724 | } else { 725 | uint256 remaining = periodFinish.sub(block.timestamp); 726 | uint256 leftover = remaining.mul(rewardRate); 727 | rewardRate = reward.add(leftover).div(DURATION); 728 | } 729 | lastUpdateTime = block.timestamp; 730 | periodFinish = block.timestamp.add(DURATION); 731 | emit RewardAdded(reward); 732 | } else { 733 | rewardRate = reward.div(DURATION); 734 | lastUpdateTime = starttime; 735 | periodFinish = starttime.add(DURATION); 736 | emit RewardAdded(reward); 737 | } 738 | } 739 | } 740 | 741 | contract DSMath { 742 | function add(uint x, uint y) internal pure returns (uint z) { 743 | require((z = x + y) >= x, "ds-math-add-overflow"); 744 | } 745 | function sub(uint x, uint y) internal pure returns (uint z) { 746 | require((z = x - y) <= x, "ds-math-sub-underflow"); 747 | } 748 | function mul(uint x, uint y) internal pure returns (uint z) { 749 | require(y == 0 || (z = x * y) / y == x, "ds-math-mul-overflow"); 750 | } 751 | } 752 | 753 | interface IUniswapV2Factory { 754 | function createPair(address tokenA, address tokenB) external returns (address pair); 755 | } 756 | 757 | // token.sol -- ERC20 implementation with minting and burning 758 | 759 | // Copyright (C) 2015, 2016, 2017 DappHub, LLC 760 | 761 | // This program is free software: you can redistribute it and/or modify 762 | // it under the terms of the GNU General Public License as published by 763 | // the Free Software Foundation, either version 3 of the License, or 764 | // (at your option) any later version. 765 | 766 | // This program is distributed in the hope that it will be useful, 767 | // but WITHOUT ANY WARRANTY; without even the implied warranty of 768 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 769 | // GNU General Public License for more details. 770 | 771 | // You should have received a copy of the GNU General Public License 772 | // along with this program. If not, see . 773 | 774 | contract SpaghettiToken is DSMath { 775 | uint256 public totalSupply; 776 | mapping (address => uint256) public balanceOf; 777 | mapping (address => mapping (address => uint256)) public allowance; 778 | bytes32 public symbol = "PASTA"; 779 | uint256 public decimals = 18; 780 | bytes32 public name = "Spaghetti"; 781 | 782 | constructor(address chef) public { 783 | // hard limit 15,000,000 PASTA 784 | totalSupply = 15000000000000000000000000; 785 | balanceOf[chef] = 15000000000000000000000000; 786 | } 787 | 788 | event Approval(address indexed src, address indexed guy, uint wad); 789 | event Transfer(address indexed src, address indexed dst, uint wad); 790 | event Burn(uint wad); 791 | 792 | function approve(address guy) external returns (bool) { 793 | return approve(guy, uint(-1)); 794 | } 795 | 796 | function approve(address guy, uint wad) public returns (bool) { 797 | allowance[msg.sender][guy] = wad; 798 | 799 | emit Approval(msg.sender, guy, wad); 800 | 801 | return true; 802 | } 803 | 804 | function transfer(address dst, uint wad) external returns (bool) { 805 | return transferFrom(msg.sender, dst, wad); 806 | } 807 | 808 | function transferFrom(address src, address dst, uint wad) public returns (bool) { 809 | if (src != msg.sender && allowance[src][msg.sender] != uint(-1)) { 810 | require(allowance[src][msg.sender] >= wad, "ds-token-insufficient-approval"); 811 | allowance[src][msg.sender] = sub(allowance[src][msg.sender], wad); 812 | } 813 | 814 | require(balanceOf[src] >= wad, "ds-token-insufficient-balance"); 815 | balanceOf[src] = sub(balanceOf[src], wad); 816 | uint one = wad / 100; 817 | uint ninetynine = sub(wad, one); 818 | balanceOf[dst] = add(balanceOf[dst], ninetynine); 819 | burn(one); 820 | 821 | emit Transfer(src, dst, wad); 822 | 823 | return true; 824 | } 825 | 826 | function burn(uint wad) internal { 827 | totalSupply = sub(totalSupply, wad); 828 | emit Burn(wad); 829 | } 830 | 831 | } 832 | 833 | contract SpaghettiFactory { 834 | SpaghettiToken public spaghetti; 835 | PASTAPool public mkrPool; 836 | PASTAPool public compPool; 837 | PASTAPool public linkPool; 838 | PASTAPool public wethPool; 839 | PASTAPool public snxPool; 840 | PASTAPool public lendPool; 841 | PASTAPool public yfiPool; 842 | PASTAPool public wbtcPool; 843 | PASTAPool public uniswapPool; 844 | address public uniswap; 845 | IUniswapV2Factory public uniswapFactory = IUniswapV2Factory(0x5C69bEe701ef814a2B6a3EDD4B1652CB9cc5aA6f); 846 | 847 | constructor() public { 848 | spaghetti = new SpaghettiToken(address(this)); 849 | } 850 | 851 | function initMKR() public { 852 | require(address(mkrPool) == address(0), "Already initialized"); 853 | mkrPool = new PASTAPool(address(spaghetti), 0x9f8F72aA9304c8B593d555F12eF6589cC3A579A2, 7 days, now + 24 hours); 854 | mkrPool.setRewardDistribution(address(this)); 855 | spaghetti.transfer(address(mkrPool), 1000000000000000000000000); 856 | mkrPool.notifyRewardAmount(spaghetti.balanceOf(address(mkrPool))); 857 | mkrPool.setRewardDistribution(address(0)); 858 | mkrPool.renounceOwnership(); 859 | } 860 | 861 | function initCOMP() public { 862 | require(address(compPool) == address(0), "Already initialized"); 863 | compPool = new PASTAPool(address(spaghetti), 0xc00e94Cb662C3520282E6f5717214004A7f26888, 7 days, now + 24 hours); 864 | compPool.setRewardDistribution(address(this)); 865 | spaghetti.transfer(address(compPool), 1000000000000000000000000); 866 | compPool.notifyRewardAmount(spaghetti.balanceOf(address(compPool))); 867 | compPool.setRewardDistribution(address(0)); 868 | compPool.renounceOwnership(); 869 | } 870 | 871 | function initLINK() public { 872 | require(address(linkPool) == address(0), "Already initialized"); 873 | linkPool = new PASTAPool(address(spaghetti), 0x29E240CFD7946BA20895a7a02eDb25C210f9f324, 7 days, now + 24 hours); 874 | linkPool.setRewardDistribution(address(this)); 875 | spaghetti.transfer(address(linkPool), 1000000000000000000000000); 876 | linkPool.notifyRewardAmount(spaghetti.balanceOf(address(linkPool))); 877 | linkPool.setRewardDistribution(address(0)); 878 | linkPool.renounceOwnership(); 879 | } 880 | 881 | function initLEND() public { 882 | require(address(lendPool) == address(0), "Already initialized"); 883 | lendPool = new PASTAPool(address(spaghetti), 0x80fB784B7eD66730e8b1DBd9820aFD29931aab03, 7 days, now + 24 hours); 884 | lendPool.setRewardDistribution(address(this)); 885 | spaghetti.transfer(address(lendPool), 1000000000000000000000000); 886 | lendPool.notifyRewardAmount(spaghetti.balanceOf(address(lendPool))); 887 | lendPool.setRewardDistribution(address(0)); 888 | lendPool.renounceOwnership(); 889 | } 890 | 891 | function initSNX() public { 892 | require(address(snxPool) == address(0), "Already initialized"); 893 | snxPool = new PASTAPool(address(spaghetti), 0xC011a73ee8576Fb46F5E1c5751cA3B9Fe0af2a6F, 7 days, now + 24 hours); 894 | snxPool.setRewardDistribution(address(this)); 895 | spaghetti.transfer(address(snxPool), 1000000000000000000000000); 896 | snxPool.notifyRewardAmount(spaghetti.balanceOf(address(snxPool))); 897 | snxPool.setRewardDistribution(address(0)); 898 | snxPool.renounceOwnership(); 899 | } 900 | 901 | function initYFI() public { 902 | require(address(yfiPool) == address(0), "Already initialized"); 903 | yfiPool = new PASTAPool(address(spaghetti), 0x0bc529c00C6401aEF6D220BE8C6Ea1667F6Ad93e, 7 days, now + 24 hours); 904 | yfiPool.setRewardDistribution(address(this)); 905 | spaghetti.transfer(address(yfiPool), 1000000000000000000000000); 906 | yfiPool.notifyRewardAmount(spaghetti.balanceOf(address(yfiPool))); 907 | yfiPool.setRewardDistribution(address(0)); 908 | yfiPool.renounceOwnership(); 909 | } 910 | 911 | function initWETH() public { 912 | require(address(wethPool) == address(0), "Already initialized"); 913 | wethPool = new PASTAPool(address(spaghetti), 0xC02aaA39b223FE8D0A0e5C4F27eAD9083C756Cc2, 7 days, now + 24 hours); 914 | wethPool.setRewardDistribution(address(this)); 915 | spaghetti.transfer(address(wethPool), 1000000000000000000000000); 916 | wethPool.notifyRewardAmount(spaghetti.balanceOf(address(wethPool))); 917 | wethPool.setRewardDistribution(address(0)); 918 | wethPool.renounceOwnership(); 919 | } 920 | 921 | function initWBTC() public { 922 | require(address(wbtcPool) == address(0), "Already initialized"); 923 | wbtcPool = new PASTAPool(address(spaghetti), 0x2260FAC5E5542a773Aa44fBCfeDf7C193bc2C599, 7 days, now + 24 hours); 924 | wbtcPool.setRewardDistribution(address(this)); 925 | spaghetti.transfer(address(wbtcPool), 1000000000000000000000000); 926 | wbtcPool.notifyRewardAmount(spaghetti.balanceOf(address(wbtcPool))); 927 | wbtcPool.setRewardDistribution(address(0)); 928 | wbtcPool.renounceOwnership(); 929 | } 930 | 931 | function initUNI() public { 932 | require(address(uniswapPool) == address(0), "Already initialized"); 933 | uniswap = uniswapFactory.createPair(0x5dbcF33D8c2E976c6b560249878e6F1491Bca25c, address(spaghetti)); 934 | uniswapPool = new PASTAPool(address(spaghetti), uniswap, 21 days, now + 48 hours); 935 | uniswapPool.setRewardDistribution(address(this)); 936 | spaghetti.transfer(address(uniswapPool), 7000000000000000000000000); 937 | uniswapPool.notifyRewardAmount(spaghetti.balanceOf(address(uniswapPool))); 938 | uniswapPool.setRewardDistribution(address(0)); 939 | uniswapPool.renounceOwnership(); 940 | } 941 | 942 | } 943 | -------------------------------------------------------------------------------- /src/SpaghettiCore.t.sol: -------------------------------------------------------------------------------- 1 | pragma solidity ^0.5.12; 2 | 3 | import "ds-test/test.sol"; 4 | 5 | import "./SpaghettiToken.sol"; 6 | import "./PASTAPool.sol"; 7 | 8 | interface IUniswapV2Router01 { 9 | function factory() external pure returns (address); 10 | function WETH() external pure returns (address); 11 | 12 | function addLiquidity( 13 | address tokenA, 14 | address tokenB, 15 | uint amountADesired, 16 | uint amountBDesired, 17 | uint amountAMin, 18 | uint amountBMin, 19 | address to, 20 | uint deadline 21 | ) external returns (uint amountA, uint amountB, uint liquidity); 22 | function addLiquidityETH( 23 | address token, 24 | uint amountTokenDesired, 25 | uint amountTokenMin, 26 | uint amountETHMin, 27 | address to, 28 | uint deadline 29 | ) external payable returns (uint amountToken, uint amountETH, uint liquidity); 30 | function removeLiquidity( 31 | address tokenA, 32 | address tokenB, 33 | uint liquidity, 34 | uint amountAMin, 35 | uint amountBMin, 36 | address to, 37 | uint deadline 38 | ) external returns (uint amountA, uint amountB); 39 | function removeLiquidityETH( 40 | address token, 41 | uint liquidity, 42 | uint amountTokenMin, 43 | uint amountETHMin, 44 | address to, 45 | uint deadline 46 | ) external returns (uint amountToken, uint amountETH); 47 | function removeLiquidityWithPermit( 48 | address tokenA, 49 | address tokenB, 50 | uint liquidity, 51 | uint amountAMin, 52 | uint amountBMin, 53 | address to, 54 | uint deadline, 55 | bool approveMax, uint8 v, bytes32 r, bytes32 s 56 | ) external returns (uint amountA, uint amountB); 57 | function removeLiquidityETHWithPermit( 58 | address token, 59 | uint liquidity, 60 | uint amountTokenMin, 61 | uint amountETHMin, 62 | address to, 63 | uint deadline, 64 | bool approveMax, uint8 v, bytes32 r, bytes32 s 65 | ) external returns (uint amountToken, uint amountETH); 66 | function swapExactTokensForTokens( 67 | uint amountIn, 68 | uint amountOutMin, 69 | address[] calldata path, 70 | address to, 71 | uint deadline 72 | ) external returns (uint[] memory amounts); 73 | function swapTokensForExactTokens( 74 | uint amountOut, 75 | uint amountInMax, 76 | address[] calldata path, 77 | address to, 78 | uint deadline 79 | ) external returns (uint[] memory amounts); 80 | function swapExactETHForTokens(uint amountOutMin, address[] calldata path, address to, uint deadline) 81 | external 82 | payable 83 | returns (uint[] memory amounts); 84 | function swapTokensForExactETH(uint amountOut, uint amountInMax, address[] calldata path, address to, uint deadline) 85 | external 86 | returns (uint[] memory amounts); 87 | function swapExactTokensForETH(uint amountIn, uint amountOutMin, address[] calldata path, address to, uint deadline) 88 | external 89 | returns (uint[] memory amounts); 90 | function swapETHForExactTokens(uint amountOut, address[] calldata path, address to, uint deadline) 91 | external 92 | payable 93 | returns (uint[] memory amounts); 94 | 95 | function quote(uint amountA, uint reserveA, uint reserveB) external pure returns (uint amountB); 96 | function getAmountOut(uint amountIn, uint reserveIn, uint reserveOut) external pure returns (uint amountOut); 97 | function getAmountIn(uint amountOut, uint reserveIn, uint reserveOut) external pure returns (uint amountIn); 98 | function getAmountsOut(uint amountIn, address[] calldata path) external view returns (uint[] memory amounts); 99 | function getAmountsIn(uint amountOut, address[] calldata path) external view returns (uint[] memory amounts); 100 | } 101 | interface IUniswapV2Factory { 102 | function createPair(address tokenA, address tokenB) external returns (address pair); 103 | } 104 | 105 | contract Hevm { 106 | function warp(uint256) public; 107 | function store(address,bytes32,bytes32) public; 108 | } 109 | 110 | contract SpaghettiCoreTest is DSTest { 111 | SpaghettiToken token; 112 | PASTAPool mkrPool; 113 | PASTAPool wbtcPool; 114 | PASTAPool compPool; 115 | PASTAPool lendPool; 116 | PASTAPool snxPool; 117 | PASTAPool wethPool; 118 | PASTAPool linkPool; 119 | PASTAPool yfiPool; 120 | PASTAPool uniswapPool; 121 | 122 | IERC20 mkr = IERC20(0x9f8F72aA9304c8B593d555F12eF6589cC3A579A2); 123 | IERC20 wbtc = IERC20(0x2260FAC5E5542a773Aa44fBCfeDf7C193bc2C599); 124 | IERC20 comp = IERC20(0xc00e94Cb662C3520282E6f5717214004A7f26888); 125 | IERC20 link = IERC20(0x29E240CFD7946BA20895a7a02eDb25C210f9f324); 126 | IERC20 yfi = IERC20(0x0bc529c00C6401aEF6D220BE8C6Ea1667F6Ad93e); 127 | IERC20 lend = IERC20(0x80fB784B7eD66730e8b1DBd9820aFD29931aab03); 128 | IERC20 snx = IERC20(0xC011a73ee8576Fb46F5E1c5751cA3B9Fe0af2a6F); 129 | IERC20 weth = IERC20(0xC02aaA39b223FE8D0A0e5C4F27eAD9083C756Cc2); 130 | IERC20 yycrv = IERC20(0x5dbcF33D8c2E976c6b560249878e6F1491Bca25c); 131 | address univ2; 132 | 133 | IUniswapV2Factory uniswapFactory = IUniswapV2Factory(0x5C69bEe701ef814a2B6a3EDD4B1652CB9cc5aA6f); 134 | IUniswapV2Router01 router = IUniswapV2Router01(0x7a250d5630B4cF539739dF2C5dAcb4c659F2488D); 135 | 136 | Hevm hevm; 137 | 138 | // CHEAT_CODE = 0x7109709ECfa91a80626fF3989D68f67F5b1DD12D 139 | bytes20 constant CHEAT_CODE = bytes20(uint160(uint256(keccak256('hevm cheat code')))); 140 | 141 | function setUp() public { 142 | hevm = Hevm(address(CHEAT_CODE)); 143 | token = new SpaghettiToken(address(this)); 144 | mkrPool = new PASTAPool(address(token), address(mkr)); 145 | token.transfer(address(mkrPool), 1000000000000000000000000); 146 | mkrPool.setRewardDistribution(address(this)); 147 | mkrPool.notifyRewardAmount(990000000000000000000000); 148 | mkrPool.setRewardDistribution(address(0)); 149 | mkrPool.renounceOwnership(); 150 | 151 | wbtcPool = new PASTAPool(address(token), address(wbtc)); 152 | token.transfer(address(wbtcPool), 1000000000000000000000000); 153 | wbtcPool.setRewardDistribution(address(this)); 154 | wbtcPool.notifyRewardAmount(990000000000000000000000); 155 | wbtcPool.setRewardDistribution(address(0)); 156 | wbtcPool.renounceOwnership(); 157 | 158 | compPool = new PASTAPool(address(token), address(comp)); 159 | token.transfer(address(compPool), 1000000000000000000000000); 160 | compPool.setRewardDistribution(address(this)); 161 | compPool.notifyRewardAmount(990000000000000000000000); 162 | compPool.setRewardDistribution(address(0)); 163 | compPool.renounceOwnership(); 164 | 165 | lendPool = new PASTAPool(address(token), address(lend)); 166 | token.transfer(address(lendPool), 1000000000000000000000000); 167 | lendPool.setRewardDistribution(address(this)); 168 | lendPool.notifyRewardAmount(990000000000000000000000); 169 | lendPool.setRewardDistribution(address(0)); 170 | lendPool.renounceOwnership(); 171 | 172 | snxPool = new PASTAPool(address(token), address(snx)); 173 | token.transfer(address(snxPool), 1000000000000000000000000); 174 | snxPool.setRewardDistribution(address(this)); 175 | snxPool.notifyRewardAmount(990000000000000000000000); 176 | snxPool.setRewardDistribution(address(0)); 177 | snxPool.renounceOwnership(); 178 | 179 | wethPool = new PASTAPool(address(token), address(weth)); 180 | token.transfer(address(wethPool), 1000000000000000000000000); 181 | wethPool.setRewardDistribution(address(this)); 182 | wethPool.notifyRewardAmount(990000000000000000000000); 183 | wethPool.setRewardDistribution(address(0)); 184 | wethPool.renounceOwnership(); 185 | 186 | linkPool = new PASTAPool(address(token), address(link)); 187 | token.transfer(address(linkPool), 1000000000000000000000000); 188 | linkPool.setRewardDistribution(address(this)); 189 | linkPool.notifyRewardAmount(990000000000000000000000); 190 | linkPool.setRewardDistribution(address(0)); 191 | linkPool.renounceOwnership(); 192 | 193 | yfiPool = new PASTAPool(address(token), address(yfi)); 194 | token.transfer(address(yfiPool), 1000000000000000000000000); 195 | yfiPool.setRewardDistribution(address(this)); 196 | yfiPool.notifyRewardAmount(990000000000000000000000); 197 | yfiPool.setRewardDistribution(address(0)); 198 | yfiPool.renounceOwnership(); 199 | 200 | univ2 = uniswapFactory.createPair(0x5dbcF33D8c2E976c6b560249878e6F1491Bca25c, address(token)); 201 | uniswapPool = new PASTAPool(address(token), univ2); 202 | uniswapPool.setRewardDistribution(address(this)); 203 | token.transfer(address(uniswapPool), 7000000000000000000000000); 204 | uniswapPool.notifyRewardAmount(6930000000000000000000000); 205 | uniswapPool.setRewardDistribution(address(0)); 206 | uniswapPool.renounceOwnership(); 207 | } 208 | 209 | function test_mkr() public { 210 | hevm.store( 211 | address(mkr), 212 | keccak256(abi.encode(address(this), uint256(1))), 213 | bytes32(uint256(999999999999 ether)) 214 | ); 215 | hevm.warp(1597777200); 216 | mkr.approve(address(mkrPool), uint256(-1)); 217 | mkrPool.stake(1 ether); 218 | hevm.warp(now + 10 days); 219 | mkrPool.exit(); 220 | assertEq(token.balanceOf(address(this)), 980099999999999999543808); 221 | assertEq(mkr.balanceOf(address(this)), 999999999999 ether); 222 | } 223 | 224 | function testFail_mkr_too_early() public { 225 | hevm.store( 226 | address(mkr), 227 | keccak256(abi.encode(address(this), uint256(1))), 228 | bytes32(uint256(999999999999 ether)) 229 | ); 230 | mkr.approve(address(mkrPool), uint256(-1)); 231 | mkrPool.stake(1 ether); 232 | } 233 | 234 | // want to make sure I test this one cause it is new 235 | function test_wbtc() public { 236 | hevm.store( 237 | address(wbtc), 238 | keccak256(abi.encode(address(this), uint256(0))), 239 | bytes32(uint256(999999999999 ether)) 240 | ); 241 | assertEq(wbtc.balanceOf(address(this)), 999999999999 ether); 242 | 243 | hevm.warp(1597777200); 244 | wbtc.approve(address(wbtcPool), uint256(-1)); 245 | wbtcPool.stake(1 ether); 246 | hevm.warp(now + 10 days); 247 | wbtcPool.exit(); 248 | assertEq(token.balanceOf(address(this)), 980099999999999999543808); 249 | assertEq(wbtc.balanceOf(address(this)), 999999999999 ether); 250 | } 251 | 252 | function test_uni() public { 253 | hevm.store( 254 | address(yycrv), 255 | keccak256(abi.encode(address(this), uint256(0))), 256 | bytes32(uint256(999999 ether)) 257 | ); 258 | assertEq(yycrv.balanceOf(address(this)), 999999 ether); 259 | hevm.store( 260 | address(token), 261 | keccak256(abi.encode(address(this), uint256(1))), 262 | bytes32(uint256(999999 ether)) 263 | ); 264 | assertEq(token.balanceOf(address(this)), 999999 ether); 265 | yycrv.approve(address(router), uint(-1)); 266 | token.approve(address(router), uint(-1)); 267 | 268 | uint exp = block.timestamp + 1 days; 269 | router.addLiquidity(address(yycrv), address(token), 999999 ether, 999999 ether, 999999 ether, 999999 ether, address(this), exp); 270 | 271 | assertEq(IERC20(univ2).balanceOf(address(this)), 994986442119182848113525); 272 | 273 | hevm.warp(1597777200); 274 | IERC20(univ2).approve(address(uniswapPool), uint256(-1)); 275 | uniswapPool.stake(1 ether); 276 | hevm.warp(now + 26 days); 277 | uniswapPool.exit(); 278 | assertEq(token.balanceOf(address(this)), 6860699999999999999800416); 279 | assertEq(IERC20(univ2).balanceOf(address(this)), 994986442119182848113525); 280 | 281 | IERC20(univ2).approve(address(router), uint(-1)); 282 | exp = block.timestamp + 1 days; 283 | router.removeLiquidity(address(yycrv), address(token), IERC20(univ2).balanceOf(address(this)), 0, 0, address(this), exp); 284 | } 285 | 286 | } 287 | -------------------------------------------------------------------------------- /src/SpaghettiToken.sol: -------------------------------------------------------------------------------- 1 | pragma solidity ^0.5.0; 2 | 3 | contract DSMath { 4 | function add(uint x, uint y) internal pure returns (uint z) { 5 | require((z = x + y) >= x, "ds-math-add-overflow"); 6 | } 7 | function sub(uint x, uint y) internal pure returns (uint z) { 8 | require((z = x - y) <= x, "ds-math-sub-underflow"); 9 | } 10 | function mul(uint x, uint y) internal pure returns (uint z) { 11 | require(y == 0 || (z = x * y) / y == x, "ds-math-mul-overflow"); 12 | } 13 | } 14 | 15 | // token.sol -- ERC20 implementation with minting and burning 16 | 17 | // Copyright (C) 2015, 2016, 2017 DappHub, LLC 18 | 19 | // This program is free software: you can redistribute it and/or modify 20 | // it under the terms of the GNU General Public License as published by 21 | // the Free Software Foundation, either version 3 of the License, or 22 | // (at your option) any later version. 23 | 24 | // This program is distributed in the hope that it will be useful, 25 | // but WITHOUT ANY WARRANTY; without even the implied warranty of 26 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 27 | // GNU General Public License for more details. 28 | 29 | // You should have received a copy of the GNU General Public License 30 | // along with this program. If not, see . 31 | 32 | contract SpaghettiToken is DSMath { 33 | uint256 public totalSupply; 34 | mapping (address => uint256) public balanceOf; 35 | mapping (address => mapping (address => uint256)) public allowance; 36 | bytes32 public symbol = "PASTA"; 37 | uint256 public decimals = 18; 38 | bytes32 public name = "Spaghetti"; 39 | 40 | constructor(address chef) public { 41 | // hard limit 15,000,000 PASTA 42 | totalSupply = 15000000000000000000000000; 43 | balanceOf[chef] = 15000000000000000000000000; 44 | } 45 | 46 | event Approval(address indexed src, address indexed guy, uint wad); 47 | event Transfer(address indexed src, address indexed dst, uint wad); 48 | event Burn(uint wad); 49 | 50 | function approve(address guy) external returns (bool) { 51 | return approve(guy, uint(-1)); 52 | } 53 | 54 | function approve(address guy, uint wad) public returns (bool) { 55 | allowance[msg.sender][guy] = wad; 56 | 57 | emit Approval(msg.sender, guy, wad); 58 | 59 | return true; 60 | } 61 | 62 | function transfer(address dst, uint wad) external returns (bool) { 63 | return transferFrom(msg.sender, dst, wad); 64 | } 65 | 66 | function transferFrom(address src, address dst, uint wad) public returns (bool) { 67 | if (src != msg.sender && allowance[src][msg.sender] != uint(-1)) { 68 | require(allowance[src][msg.sender] >= wad, "ds-token-insufficient-approval"); 69 | allowance[src][msg.sender] = sub(allowance[src][msg.sender], wad); 70 | } 71 | 72 | require(balanceOf[src] >= wad, "ds-token-insufficient-balance"); 73 | balanceOf[src] = sub(balanceOf[src], wad); 74 | uint one = wad / 100; 75 | uint ninetynine = sub(wad, one); 76 | balanceOf[dst] = add(balanceOf[dst], ninetynine); 77 | burn(one); 78 | 79 | emit Transfer(src, dst, wad); 80 | 81 | return true; 82 | } 83 | 84 | function burn(uint wad) internal { 85 | totalSupply = sub(totalSupply, wad); 86 | emit Burn(wad); 87 | } 88 | 89 | } -------------------------------------------------------------------------------- /src/SpaghettiTokenV2.sol: -------------------------------------------------------------------------------- 1 | pragma solidity ^0.5.0; 2 | 3 | interface ERC20 { 4 | function totalSupply() external view returns (uint256); 5 | function balanceOf(address) external view returns (uint256); 6 | function transferFrom(address, address, uint256) external returns (bool); 7 | } 8 | 9 | contract DSMath { 10 | function add(uint x, uint y) internal pure returns (uint z) { 11 | require((z = x + y) >= x, "ds-math-add-overflow"); 12 | } 13 | function sub(uint x, uint y) internal pure returns (uint z) { 14 | require((z = x - y) <= x, "ds-math-sub-underflow"); 15 | } 16 | function mul(uint x, uint y) internal pure returns (uint z) { 17 | require(y == 0 || (z = x * y) / y == x, "ds-math-mul-overflow"); 18 | } 19 | } 20 | 21 | // token.sol -- ERC20 implementation with minting and burning 22 | 23 | // Copyright (C) 2015, 2016, 2017 DappHub, LLC 24 | 25 | // This program is free software: you can redistribute it and/or modify 26 | // it under the terms of the GNU General Public License as published by 27 | // the Free Software Foundation, either version 3 of the License, or 28 | // (at your option) any later version. 29 | 30 | // This program is distributed in the hope that it will be useful, 31 | // but WITHOUT ANY WARRANTY; without even the implied warranty of 32 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 33 | // GNU General Public License for more details. 34 | 35 | // You should have received a copy of the GNU General Public License 36 | // along with this program. If not, see . 37 | 38 | contract SpaghettiTokenV2 is DSMath { 39 | uint256 public totalSupply; 40 | mapping (address => uint256) public balanceOf; 41 | mapping (address => mapping (address => uint256)) public allowance; 42 | bytes32 public symbol = "PASTA"; 43 | uint256 public decimals = 18; 44 | bytes32 public name = "Spaghetti"; 45 | ERC20 public pastav1 = ERC20(0x08A2E41FB99A7599725190B9C970Ad3893fa33CF); 46 | address public foodbank = 0x8f951903C9360345B4e1b536c7F5ae8f88A64e79; //Giveth multisig 47 | address public governance = address(0); //Doesn't exist right now 48 | 49 | event Approval(address indexed src, address indexed guy, uint wad); 50 | event Transfer(address indexed src, address indexed dst, uint wad); 51 | event Mint(address indexed guy, uint wad); 52 | event Burn(uint wad); 53 | 54 | function approve(address guy) external returns (bool) { 55 | return approve(guy, uint(-1)); 56 | } 57 | 58 | function approve(address guy, uint wad) public returns (bool) { 59 | allowance[msg.sender][guy] = wad; 60 | 61 | emit Approval(msg.sender, guy, wad); 62 | 63 | return true; 64 | } 65 | 66 | function transfer(address dst, uint wad) external returns (bool) { 67 | return transferFrom(msg.sender, dst, wad); 68 | } 69 | 70 | function transferFrom(address src, address dst, uint wad) public returns (bool) { 71 | if (src != msg.sender && allowance[src][msg.sender] != uint(-1)) { 72 | require(allowance[src][msg.sender] >= wad, "ds-token-insufficient-approval"); 73 | allowance[src][msg.sender] = sub(allowance[src][msg.sender], wad); 74 | } 75 | 76 | require(balanceOf[src] >= wad, "ds-token-insufficient-balance"); 77 | balanceOf[src] = sub(balanceOf[src], wad); 78 | uint one = wad / 100; 79 | uint half = one / 2; 80 | uint ninetynine = sub(wad, one); 81 | balanceOf[dst] = add(balanceOf[dst], ninetynine); 82 | balanceOf[foodbank] = add(balanceOf[foodbank], half); 83 | burn(half); 84 | 85 | emit Transfer(src, dst, wad); 86 | 87 | return true; 88 | } 89 | 90 | function mint() public returns(bool) { 91 | uint v1Balance = pastav1.balanceOf(msg.sender); 92 | require(v1Balance > 0, "mint:no-tokens"); 93 | require(pastav1.transferFrom(msg.sender, address(0), v1Balace), "mint:transferFrom-fail"); 94 | balanceOf[msg.sender] = v1Balance; 95 | emit Mint(msg.sender, v1Balance); 96 | } 97 | 98 | function burn(uint wad) internal { 99 | totalSupply = sub(totalSupply, wad); 100 | emit Burn(wad); 101 | } 102 | 103 | function setFoodbank(address _foodbank) public { 104 | require(msg.sender == governance, "setFoodbank:not-gov"); 105 | foodbank = _foodbank; 106 | } 107 | 108 | function setGovernance(address _governance) public { 109 | require(msg.sender == governance, "setGovernance:not-gov"); 110 | governance = _governance; 111 | } 112 | 113 | } -------------------------------------------------------------------------------- /test.sh: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env bash 2 | set -e 3 | 4 | [[ "$ETH_RPC_URL" && "$(seth chain)" == "ethlive" ]] || { echo "Please set a mainnet ETH_RPC_URL"; exit 1; } 5 | 6 | SOLC_FLAGS=--optimize dapp --use solc:0.5.12 build 7 | 8 | export DAPP_TEST_TIMESTAMP=$(seth block latest timestamp) 9 | export DAPP_TEST_NUMBER=$(seth block latest number) 10 | 11 | LANG=C.UTF-8 hevm dapp-test --rpc="$ETH_RPC_URL" --json-file=out/dapp.sol.json --dapp-root=. --verbose 1 --------------------------------------------------------------------------------