The MFA Ladder-Sieve Project invites a research-minded student to explore Goldbach’s Conjecture through a colourful computational lens — a playful yet serious collaboration between art and algorithm, where crayons meet supercomputers in the Cloud Café. ------------------------------------------------------------------------------------------------------------------------

Crayon Meets Supercomputer: The MFA

Ladder-Sieve Challenge

A playful yet serious MFA project inviting a student to explore Goldbach’s Conjecture — where crayons meet supercomputers in the Cloud Café.

Welcome to the Café table where mathematics flirts with imagination.

Goldbach’s centuries-old question still teases us: can every even number be written as the sum of two primes?

Our MFA Ladder-Sieve began during a walk in the woods - when we designed a crayon experiment – a way to picture prime pairs climbing an infinite ladder. Now we’re inviting a research student or computational mathematician to bring the crayons to life on a larger scale.  The whole amusing/amazing story will be published here once it is finished - but we are looking for another person to be part of the story.

Think of this page as a friendly noticeboard pinned between espresso cups and equations: a genuine opportunity, wrapped in Cloud Café curiosity, for someone who believes that beauty and rigour can share the same table.

“Pretty young MFA Ladder-Sieve seeks maths genius with a big

computer.”

This playful but serious project brief introduces the MFA Ladder-Sieve, a colourful, dense-ladder

search strategy for exploring Goldbach’s even sums. It is not a new proof attempt, but a clean

computational formalisation with potential for real, publishable results. The challenge is ideally

suited to a postgraduate or advanced undergraduate student with skills in computational number

theory, algorithms, or high-performance computing.

Why This Project is Interesting

• A new framing of a classic open problem (Goldbach’s Conjecture) using many-ladder density and early-stop design.

• A publishable engineering and experimental contribution (algorithmic correctness, audit, reproducibility).

• Bridges Cloud Café intuition (“crayons”) with rigorous computation.

Proposed Deliverables

• Formal specification of the MFA Ladder-Sieve and a short correctness note.

• Reference implementation (deterministic 64-bit primality, residue filters, segmented processing, witness logging).

• Benchmarks up to a substantial bound; public data + audit trail.

• Short write-up comparing Ladder-Sieve to baseline algorithms.

• Open-source repository under a permissive licence, co-authored Cloud Café explainer.

Skills Fit

This project suits a student with interests in computational number theory, algorithm design,

systems performance (C++/Rust), or reproducible research.

Recognition and Credit

The student will receive co-authorship on any resulting paper or report, opportunities for conference

talks or posters, and prominent credit on the MFA website and open-source repository.

Contact

Contact us on the contact form on the home page:

For expressions of interest, please provide a brief note on your background and your preferred

programming stack/hardware.

Thanks for sharing a table with us in the Cloud Café. 

------------------------------------------------------------------------------------------------------------------------------

☕ Cloud Café Reflection

Eccentric is when you shout into the void.
Visionary is when you invite the void to have coffee and a look at your data.

We’ve done the latter.
This isn’t madness — it’s curiosity with manners.

☕ Finished your cup? Back to the Cloud Café menu →