mariari

> > 1. Is there a notion of a goto at all? > > No. As you say, `call` comes closes. Would the argument of the `goto` live on the...

> Even though your original question 1 was about an instruction `goto`, I interpreted that the underlying issue was getting “if (…) then {…} else {…}” to work. Following that...

> I'm afraid I don't understand all the technical considerations involved in optimizing control flow graphs – or whether that string of words even makes sense. Would it help your...

I've lowered the number of samples to `20`, however it still feels like it takes too long to run.

This is somewhat solved by feature flags

Also get a csv file so that we can create comparsion tables on the fly

Yeah I need to hook up the current `Halo2` code to the bench-mark It should be possible to get both backends on the benchmark

With the latest commits the current `Halo2` code should be shown in the results

Arrays are mostly in, however one big missing feature is the lack of a range check, this is important, as it ensures we have an unique solution. Here is an...

I investigated some options, doing ```lisp (defparameter *x* nil) (defun calling-from () (dissect:with-truncated-stack () (list (ban)))) (defun ban () (again) 3) (defun again () (setf *x* (make-source-test :x (dissect:stack))) (list...