<?xml version="1.0" encoding="utf-8" standalone="yes"?><?xml-stylesheet type="text/xsl" href="/rss.xsl"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Mavai — Testing Non-Deterministic Systems — Projects</title><link>https://mavai.org/projects/</link><description>Open-source tools for probabilistic testing and non-deterministic system validation.</description><generator>Hugo 0.162.1</generator><language>en</language><managingEditor>Mavai</managingEditor><lastBuildDate>Mon, 01 Jan 0001 00:00:00 +0000</lastBuildDate><atom:link href="https://mavai.org/projects/index.xml" rel="self" type="application/rss+xml"/><item><title>mavai-R</title><link>https://mavai.org/projects/mavai-r/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://mavai.org/projects/mavai-r/</guid><description>&lt;p&gt;&lt;strong&gt;mavai-R&lt;/strong&gt; is the statistical oracle for the mavai project family. It uses R — the gold standard for statistical computing — to generate language-agnostic reference datasets against which all mavai framework implementations verify their statistics engines.&lt;/p&gt;
&lt;h2 id="why-it-exists"&gt;Why it exists&lt;/h2&gt;
&lt;p&gt;The mavai family includes multiple independent implementations of the same statistical methodology: &lt;a href="https://mavai.org/projects/punit/"&gt;punit&lt;/a&gt; (Java), feotest (Rust), and future frameworks in other languages. Each implements Wilson score confidence intervals, threshold derivation, power analysis, feasibility checking, and verdict evaluation independently, in its own language and idiom.&lt;/p&gt;</description></item><item><title>feotest examples</title><link>https://mavai.org/projects/feotest-examples/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://mavai.org/projects/feotest-examples/</guid><description>&lt;p&gt;&lt;strong&gt;feotest examples&lt;/strong&gt; will be a companion repository containing worked examples that demonstrate the &lt;a href="https://mavai.org/projects/feotest/"&gt;feotest&lt;/a&gt; framework across its major capabilities, mirroring the scenarios covered by &lt;a href="https://mavai.org/projects/punitexamples/"&gt;punit examples&lt;/a&gt; in idiomatic Rust.&lt;/p&gt;
&lt;h2 id="coming-soon"&gt;Coming soon&lt;/h2&gt;
&lt;p&gt;feotest examples is in active development alongside feotest. The repository will be available at &lt;a href="https://github.com/mavai-org/feotest-examples"&gt;github.com/mavai-org/feotest-examples&lt;/a&gt; once published.&lt;/p&gt;</description></item><item><title>feotest</title><link>https://mavai.org/projects/feotest/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://mavai.org/projects/feotest/</guid><description>&lt;p&gt;&lt;strong&gt;feotest&lt;/strong&gt; is a probabilistic testing framework for Rust. It brings the same statistical methodology as &lt;a href="https://mavai.org/projects/punit/"&gt;punit&lt;/a&gt; — repeated trials, confidence intervals, threshold-based verdicts — to the Rust ecosystem, built from the ground up as idiomatic Rust rather than a port.&lt;/p&gt;
&lt;h2 id="coming-soon"&gt;Coming soon&lt;/h2&gt;
&lt;p&gt;feotest is in active development and its public release is imminent. The repository will be available at &lt;a href="https://github.com/mavai-org/feotest"&gt;github.com/mavai-org/feotest&lt;/a&gt; once published.&lt;/p&gt;
&lt;h2 id="why-rust"&gt;Why Rust&lt;/h2&gt;
&lt;p&gt;Rust&amp;rsquo;s ownership model, zero-cost abstractions, and strong type system make it a natural fit for infrastructure and safety-critical systems — exactly the kind of services where probabilistic testing matters most. feotest is designed to feel native to Rust developers, following the conventions and idioms of the Rust testing ecosystem.&lt;/p&gt;</description></item><item><title>outcome</title><link>https://mavai.org/projects/outcome/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://mavai.org/projects/outcome/</guid><description>&lt;p&gt;&lt;strong&gt;outcome&lt;/strong&gt; is a Java framework that provides a formal boundary between deterministic application code and fallible, non-deterministic operations such as network calls, database queries, and external API requests.&lt;/p&gt;
&lt;h2 id="the-problem"&gt;The problem&lt;/h2&gt;
&lt;p&gt;Java&amp;rsquo;s exception model conflates three fundamentally different failure categories: operational failures (network timeouts, service unavailability), defects (null pointers, logic errors), and terminal errors (out of memory). This leads to inconsistent error handling, ad-hoc retry loops, and swallowed exceptions across codebases.&lt;/p&gt;</description></item><item><title>punit examples</title><link>https://mavai.org/projects/punitexamples/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://mavai.org/projects/punitexamples/</guid><description>&lt;p&gt;&lt;strong&gt;punit examples&lt;/strong&gt; is a companion repository containing a fully worked example application that demonstrates the &lt;a href="https://mavai.org/projects/punit/"&gt;punit&lt;/a&gt; framework across all its major capabilities.&lt;/p&gt;
&lt;h2 id="two-example-domains"&gt;Two example domains&lt;/h2&gt;
&lt;h3 id="shopping-basket-empirical-approach"&gt;Shopping Basket (empirical approach)&lt;/h3&gt;
&lt;p&gt;An LLM translates natural language instructions (e.g. &amp;ldquo;Add 2 apples&amp;rdquo;) into structured JSON actions for a shopping basket API. Because LLM behaviour is inherently probabilistic — it may hallucinate fields, produce malformed JSON, or invent invalid actions — success rates are established empirically through measurement experiments rather than predetermined.&lt;/p&gt;</description></item><item><title>punit</title><link>https://mavai.org/projects/punit/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://mavai.org/projects/punit/</guid><description>&lt;p&gt;&lt;strong&gt;punit&lt;/strong&gt; is a JUnit 5 extension framework for probabilistic testing. It is designed for systems where behaviour is non-deterministic by nature — LLM integrations, ML model inference, distributed systems, and randomised algorithms.&lt;/p&gt;
&lt;h2 id="how-it-works"&gt;How it works&lt;/h2&gt;
&lt;p&gt;Instead of the traditional binary pass/fail model, punit executes a test multiple times and treats each run as a Bernoulli trial. It then applies statistical inference to determine whether the observed success rate meets a defined threshold at a given confidence level.&lt;/p&gt;</description></item></channel></rss>