2. Some rewritten parts of the system, such as IO, were initially slower, but have now been improved to catch up to the previous implementation.
3. Chez Scheme didn't support some performance features that Racket BC had, such as unboxed floating point arithmetic, parallel GC, or continuation marks. Those have been added to (Racket's variant of) Chez Scheme.
4. Racket's prior compiler was somewhat more competitive with Chez Scheme than we expected, particularly for larger and more Racket-idiomatic programs.
[0] https://blog.racket-lang.org/2018/01/racket-on-chez-status.h...
Mostly, we did reimplement the C stuff in Racket. The I/O
subsystem, the concurrency subsystem (which includes the
scheduler for “green” threads, Concurrent ML-style events,
and custodians), and the regexp matcher were all rewritten
in Racket. Those pieces followed the rewrite of the macro
expander in Racket.
So there was a slowdown until those pieces matured. But now they get the benefit of having all those pieces in higher level of abstraction and more accessible to Racket programmers.> For example, Racket BC makes dormant code relatively cheap, so Racket libraries generate a lot of code. Future Racket libraries will likely shift to take advantage of Racket CS’s cheaper function calls and dramatically cheaper continuations. One day, probably, Racket BC will no longer be a viable alternative to Racket CS for most programs.
[1] https://blog.racket-lang.org/2020/02/racket-on-chez-status.h...