| Commit message (Collapse) | Author | Age | |
|---|---|---|---|
| * | reorganization: move more things into BaseConversion |  Jade Philipoom | 2018-04-09 |
| | | |||
| * | better factoring-out of mul_converted stuff, define saturated arith operations | Jade Philipoom | 2018-04-06 |
| | | |||
| * | Use a simpler form of Uncurrying |  Jason Gross | 2018-04-04 |
| | | | | | | | | | | | | | | | | | | | | After in-person discussion with Andres, we decided that, because the previous form of uncurrying was only half-uncurried (not including identifiers nor lambdas passed to other lambdas), and the strongest driver of a full uncurrying pass would be having an easier-to-visualize intermediate representation / knowing more clearly what the pipeline is doing, and the changes required for making this a full uncurrying pass would be global to the pipeline (require changing the type of identifiers), we would instead go back the version of uncurrying that I initially proposed, where we only uncurry the top-level function. Note that we create a slightly more complicated term (with more application nodes) than we have to; if we instead took in `@expr (@expr var) t` rather than `@expr var t`, we wouldn't introduce needless abstractions. However, the current form admits an extremely simple proof of correctness, which doesn't even require well-formedness of the expression tree. | ||
| * | Stick an uncurry pass in the pipeline | Jason Gross | 2018-04-04 |
| | | | | | | This allows us to (a) consolidate the constant and non-constant pipelines and (b) vastly simplify the call-with-id-continuation logic. | ||
| * | Add Uncurry | Jason Gross | 2018-04-04 |
| | | | | | | This pass uncurries all applied lambdas. Care is taken to not do beta reduction and to not introduce spurious `Abs` or `App` nodes. | ||
| * | pass-through after Jason's review | Jade Philipoom | 2018-04-03 |
| | | |||
| * | pass-through after Andres's review in #334 | Jade Philipoom | 2018-04-03 |
| | | |||
| * | move requires to the top of the file | Jade Philipoom | 2018-04-03 |
| | | |||
| * | make montgomery not depend on intermediate weight for multiplication being ↵ | Jade Philipoom | 2018-04-03 |
| | | | | | the sqrt of the usual weight | ||
| * | rename w_half to w_mul | Jade Philipoom | 2018-04-03 |
| | | |||
| * | make a more general kind of mul_converted_halve that produces the correct ↵ | Jade Philipoom | 2018-04-03 |
| | | | | | carries even in cases where w is not necessarily the square of w', but potentially some other power | ||
| * | move some lemmas to ZUtil/ListUtil | Jade Philipoom | 2018-04-03 |
| | | |||
| * | move some shared lemmas between Columns/Rows into a Saturated module | Jade Philipoom | 2018-04-03 |
| | | |||
| * | reprint Montgomery output (order of additions in Rows.flatten changed) | Jade Philipoom | 2018-04-03 |
| | | |||
| * | more proof automation in Rows | Jade Philipoom | 2018-04-03 |
| | | |||
| * | automate some Rows proofs | Jade Philipoom | 2018-04-03 |
| | | |||
| * | organize Rows into sections | Jade Philipoom | 2018-04-03 |
| | | |||
| * | organize proofs into sections | Jade Philipoom | 2018-04-03 |
| | | |||
| * | more cleanup of flatten proofs | Jade Philipoom | 2018-04-03 |
| | | |||
| * | clean up some [flatten] proofs | Jade Philipoom | 2018-04-03 |
| | | |||
| * | move some lemmas/hints to ListUtil | Jade Philipoom | 2018-04-03 |
| | | |||
| * | fix typo and add booleans for carries | Jade Philipoom | 2018-04-03 |
| | | |||
| * | changing Montgomery notations | Jade Philipoom | 2018-04-03 |
| | | |||
| * | make add_with_get_carry with a constant zero for the carry translate to ↵ | Jade Philipoom | 2018-04-03 |
| | | | | | add_get_carry | ||
| * | inline shifts for Montgomery example | Jade Philipoom | 2018-04-03 |
| | | |||
| * | Make Montgomery example use row-wise flatten (involves adding Nat.max, ↵ | Jade Philipoom | 2018-04-03 |
| | | | | | List.tl, and List.hd to the pipeline) | ||
| * | add Rows.from_associational and some more length proofs that allow ↵ | Jade Philipoom | 2018-04-03 |
| | | | | | Rows.length_from_associational | ||
| * | move mul_converted to its own module | Jade Philipoom | 2018-04-03 |
| | | |||
| * | finish flatten_partitions and slightly change the format of _partitions ↵ | Jade Philipoom | 2018-04-03 |
| | | | | | lemma statements | ||
| * | proved admits about sum_rows | Jade Philipoom | 2018-04-03 |
| | | |||
| * | finish from_columns proofs | Jade Philipoom | 2018-04-03 |
| | | |||
| * | progress on from_columns proofs | Jade Philipoom | 2018-04-03 |
| | | |||
| * | clean up proofs a bit | Jade Philipoom | 2018-04-03 |
| | | |||
| * | prove sum_rows_div_mod and fix up Rows.from_columns a bit | Jade Philipoom | 2018-04-03 |
| | | |||
| * | rowwise flatten (more fleshed-out) and proof outline | Jade Philipoom | 2018-04-03 |
| | | |||
| * | preliminary version of rowwise flatten | Jade Philipoom | 2018-04-03 |
| | | |||
| * | some work on rowwise flatten | Jade Philipoom | 2018-04-03 |
| | | |||
| * | Add two examples of using the pipeline in a one-liner | Jason Gross | 2018-04-01 |
| | | |||
| * | Fix the pipeline to not insert extra casts | Jason Gross | 2018-03-31 |
| | | | | | | | | So long as we have subst01, it must come before bounds analysis (or followed by an extra pass of partial evaluation), because bounds analysis inserts casts at every let-in node, and so inlining some of them results in duplicated cast nodes, which we don't want to have. | ||
| * | Update printout after change to pipeline | Jason Gross | 2018-03-31 |
| | | |||
| * | Do some pipeline consolidation and reorganization | Jason Gross | 2018-03-29 |
| | | | | | | | | | | | | - Since we pass through a flat representation, we no longer need to invoke `vm_compute` twice, so we don't need to separate out bounds checking from bounds analysis - Only call partial evaluation once, not twice - Remove the call to constant reassociation, as it no longer has a place (it only works post-partial-evaluation pre-bounds-analysis) | ||
| * | Allow passing in optional bounds to the pipeline | Jason Gross | 2018-03-28 |
| | | |||
| * | Inline weight into *mod, remove rweight | Jason Gross | 2018-03-28 |
| | | |||
| * | Move mod_ops out of Positional | Jason Gross | 2018-03-28 |
| | | |||
| * | Move cps out of cache part of the pipeline | Jason Gross | 2018-03-27 |
| | | | | | | | | | | | Most of the changes are due to the fact that the PrePipeline (cache) part no longer errors, and the pre-check post-cache part of the pipeline can now error. Note that this slows rcarry_mul down from about 0.3 s to about 2.6 s (some of which is probably counter-balanced by the fact that caching is probably now faster). | ||
| * | Add Zdiv_0_l to zsimplify dbs | Jason Gross | 2018-03-27 |
| | | |||
| * | Add a test for hd and tl | Jason Gross | 2018-03-27 |
| | | |||
| * | Add support for handling match on list | Jason Gross | 2018-03-27 |
| | | | | | | | As per https://github.com/mit-plv/fiat-crypto/pull/334/files#r177112883 Currently untested | ||
| * | Add list_case, a definition for match on list | Jason Gross | 2018-03-27 |
| | | |||
| * | Response to code review comment | Jason Gross | 2018-03-23 |
| | | | | | https://github.com/mit-plv/fiat-crypto/pull/330#discussion_r176406316 | ||
 |
index : fiat-crypto | |
| fast, formally verified cryptography |
| aboutsummaryrefslogtreecommitdiff |