Repository navigation
submissions: Scalus 1.4.0 across all 8 scenarios - #262
Conversation
8d340bb to
9c4e4da
Compare
|
The The pinned source precomputes |
9c4e4da to
aeb64f2
Compare
|
Thanks, you're right: every measured input hit the table. |
Compiled with Scalus 1.4.0 (Options.release, protocol version 11) from scalus3/scalus. Each row is verified and measured on the production evaluator. factorial computes every result at run time: a @compile function with the recursion unrolled four times (scalus3/scalus 9b26ab007). ecd recurses on modInteger, following the prescribed `mod` (IntersectMBO#264). The READMEs of the three fixed scenarios quote the source that translates the prescribed algorithm and give the build commands.
aeb64f2 to
79d5df2
Compare
Scalus 1.4.0 rows for all 8 scenarios. Each is compiled with
Options.release, which targets protocol version 11 (min_protocol_version: 11), from scalus3/scalus@f1fa4a721. The compiler is thev1.4.0release. Later commits on master change no code generation; the pinned script sizes and budgets of all 8 scenarios are unchanged.All 8 pass
cape submission verifyand are measured on the production evaluator.The validators use the current fixtures (#246, #247, #253): the deposit time is the exclusive upper bound minus one, and the escrow deadline is 1,800,000 ms.
The fixed-scenario rows follow the rules of #264:
ecdrecurses onmodInteger, the prescribed`mod`. An earlier revision of this PR used Scala's%, which isrem; the two negative-input cases swap costs, and the total stays 7,886.ecd,factorial_naive_recursionandfibonacci_naive_recursionquote the source file that translates the prescribed algorithm, and give the build commands.The branch is rebased on main after #266, and the commit is signed.