codon VS typedload

https://github.com/exaloop/codon/blob/develop/LICENSE

Here are some others: https://github.com/search?q=%22Business+Source+License%22+%2...

I found at least one project that managed to compile python AOT to LLVM https://github.com/exaloop/codon. Even if LLVM is more expressive than Dart Kernel, that should at least be some evidence that this might not be too impractical.

Their fannkuch benchmark seems to be a bit dishonest. They claim an enormous perf delta on https://exaloop.io/benchmarks.html but fannkuch uses factorial a lot and they define factorial with a very small (n=20) table: https://github.com/exaloop/codon/blob/fb461371613049539654c1...

Disclaimer: I've worked on several Python runtimes and compilers, but I'm not by any means out to get Codon. Just happened across this by accident while looking at their inline LLVM, which is neat.

If you literally want Python, but compiled ... Look at Codon: https://github.com/exaloop/codon

Another "Python with high-performance compiled builds" would be https://github.com/exaloop/codon.

This is the project being discussed: https://github.com/exaloop/codon

Try Codon? https://github.com/exaloop/codon

https://github.com/exaloop/codon might save you from the rewrite.

Author of typedload here!

FastAPI relies on (not so fast) pydantic, which is one of the slowest libraries in that category.

Don't expect to find such benchmarks on the pydantic documentation itself, but the competing libraries will have them.

[0] https://ltworf.github.io/typedload/

I wrote typedload, which is significantly faster than pydantic. Just uses normal dataclasses/attrs/NamedTuple, has a better API and is pure Python!

I read all the perftests in the repo. I think they nearly all parse a structure that contains a repetition of the same or similar thing a couple hundred thousand times times and the timing function returns the min and max of 5 attempts. I just picked one example for posting.

Not a Python expert, but could the Pydantic tests be possibly not realistic and/or misleading because they are using kwargs in __init__ [1] to parse the object instead of calling the parse_obj class method [2]? According to some PEPs [3], isn't Python creating a new dictionary for that parameter which would be included in the timing? That would be unfortunate if that accounted for the difference.

Something else I think about is if a performance test doesn't produce a side effect that is checked, a smart compiler or runtime could optimize the whole benchmark away. Or too easy for the CPU to do branch prediction, etc. I think I recall that happening to me in Java in the past, but probably not happened here in Python.

[1] https://github.com/ltworf/typedload/blob/37c72837e0a8fd5f350...

[2] https://docs.pydantic.dev/usage/models/#helper-functions

[3] https://peps.python.org/pep-0692/