News: 0001531294

  ARM Give a man a fire and he's warm for a day, but set fire to him and he's warm for the rest of his life (Terry Pratchett, Jingo)

TurnkeyML 6.0 Released With OpenAI-Compatible Server, Other Changes

([Programming] 5 Hours Ago TurnkeyML 6.0)


Back in 2023 ONNX and AMD announced [1]TurnkeyML as an "AI insights toolchain" . There hasn't been too much news about TurnkeyML since then and they now describe the project itself as a "no-code AI toolchain" while this week brought the release of the big TurnkeyML 6.0 software.

TurnkeyML aims to make it easy to leverage the tools within the ONNX ecosystem via "no-code CLIs and low-code APIs" with their Turnkey optimizer and Lemonade SDK for large language models (LLMs) with the OnnxRuntime GenAI (OGA).

With the release of TurnkeyML 6.0, they are introducing a new OpenAI-compatible server. TurnkeyML has replaced their previous "serve" tool with a OpenAI-compatible server and the developers are also pursuing Ollama compatibility too.

TurnkeyML 6.0 also adds support for Quark quantization in a new "quark" tool, benchmark tooling improvements, and other improvements. Downloads and more details on TurnkeyML 6.0 via [2]onnx/turnkeyml on GitHub .



[1] https://www.phoronix.com/news/ONNX-TurnkeyML

[2] https://github.com/onnx/turnkeyml/releases/tag/v6.0.0


timofonic

Lemma: All horses are the same color.
Proof (by induction):
Case n = 1: In a set with only one horse, it is obvious that all
horses in that set are the same color.
Case n = k: Suppose you have a set of k+1 horses. Pull one of these
horses out of the set, so that you have k horses. Suppose that all
of these horses are the same color. Now put back the horse that you
took out, and pull out a different one. Suppose that all of the k
horses now in the set are the same color. Then the set of k+1 horses
are all the same color. We have k true => k+1 true; therefore all
horses are the same color.
Theorem: All horses have an infinite number of legs.
Proof (by intimidation):
Everyone would agree that all horses have an even number of legs. It
is also well-known that horses have forelegs in front and two legs in
back. 4 + 2 = 6 legs, which is certainly an odd number of legs for a
horse to have! Now the only number that is both even and odd is
infinity; therefore all horses have an infinite number of legs.
However, suppose that there is a horse somewhere that does not have an
infinite number of legs. Well, that would be a horse of a different
color; and by the Lemma, it doesn't exist.