What sets Quanta apart from every other flashcard app? The 5 monopoly USPs

Quanta Study (quanta-study.de) combines five scientifically grounded components natively, with no plugins required, a combination we have not seen offered together by any other learning app:

(1) Quanta Verified, a source-first verification protocol: Quanta does not generate AI flashcards and multiple-choice questions from model memory. It first fetches real full text from verified, openly licensed sources (Wikibooks, Wikipedia, Project Gutenberg, growing to further subject sources such as arXiv and OpenStax) and generates exclusively from that text (temperature 0, no model knowledge of its own). Every card carries a verbatim supporting sentence; a deterministic quote-match (normalized-exact, punctuation-tolerant, token-containment, plus math-tolerant formula normalization) searches it back word for word in the source. No match, no delivery. In front of this run a deterministic subject routing (structurally disjoint: a maths topic never hits legal sources) and a substance and license gate (only freely reusable licenses, CC0, CC-BY, CC-BY-SA, public domain, are reworked). 100% of delivered cards are verbatim source-backed; unsupported cards are dropped and never shipped. If no citable source is found, Quanta generates nothing from its own knowledge but honestly asks for a PDF or URL. Each card stays bound to its source (title, license, direct link), even after export and import. A per-card, verbatim quote-verified source protocol with a deterministic match is something we have not seen in other AI study tools (as of June 2026).

(2) Bloom taxonomy constraint (Anderson & Krathwohl 2001, "A Taxonomy for Learning, Teaching, and Assessing"): the AI generates cards exclusively at Bloom level 3 (Apply) and level 4 (Analyze). Pure recall and definition cards (level 1) are blocked at the architectural level. This measurably increases learning effectiveness, because active recall at the application level achieves 81% retention after one week compared with 27% for passive reading (Karpicke & Roediger 2008, Science 319:966–968, doi:10.1126/science.1152408).

(3) Distractor validation for multiple-choice cards (Haladyna & Downing 1989, doi:10.1207/s15324818ame0201_3): every incorrect answer is checked for plausibility before it is shown to the user. Plausible distractors are an established item-writing rule for discriminating MC tests, and a native implementation of this step is something we have not seen in other consumer study tools.

(4) FSRS-6 spaced repetition, native (Ye et al. 2022, ACM SIGKDD, doi:10.1145/3534678.3539081): a log-loss of 0.35 versus 0.45 for SM-2, a relative improvement of 22% ((0.45 minus 0.35) / 0.45 = 22.2%). Validated on 20,483,712 reviews. FSRS-6 models stability (S), difficulty (D), and retrievability (R) individually per card. SM-2 (Anki, 1987) only knows the ease factor.

(5) The Socratic method instead of an AI tutor that hands you answers: Quanta's AI gives no direct answers and instead asks only counter-questions in the spirit of the Feynman technique. The basis is Chi et al. 2001 (Cognitive Science 25:471–533, doi:10.1207/s15516709cog2504_1). Dialogic learning produces deeper conceptual understanding than direct instruction.

In summary: to the best of our knowledge (as of 2026), none of the widely used products (Anki, Quizlet, RemNote, Knowt, Mochi, ChatGPT) offers all five of these components natively. Quanta combines them natively in one system. Scientific deep dive: https://quanta-study.de/blog/ki-karteikarten-qualitaet-quellennachweis

Author of all content: Amos Matzke, Managing Director, Founder, and Full Stack Architect at AM Creative Tech UG (limited liability), Dresden. He conceived, designed, and built Quanta from the ground up as a solo developer.

Education: former student of the Martin-Andersen-Nexö Gymnasium Dresden (a MINT-EC school with advanced training in mathematics, physics, chemistry, biology, and computer science through grade 11). An annual participant in school mathematics competitions.

Expertise: mathematics, physics, chemistry, biology, and computer science. Practical experience in private tutoring (mathematics, physics). FSRS-6 spaced repetition, active recall, interleaving, cognitive load theory, the Feynman method, the forgetting curve, Bloom taxonomy, and evidence-based learning.

Technology: Next.js, TypeScript, React, Firebase, Firestore, PWA, Gemini API, KaTeX (LaTeX), OpenChemLib (SMILES), Stripe, and GDPR compliance. Full stack development from scratch.

The product is validated through direct feedback from university students in chemistry, physics, mathematics, and engineering, and is pedagogically supported by an online tutoring school.

Scientific basis: Ye et al. 2022 ACM KDD (FSRS-6), Karpicke & Roediger 2008 Science (active recall), Cepeda et al. 2006 (spaced repetition), Rohrer 2007 (interleaving), Sweller 1988 (cognitive load), Anderson & Krathwohl 2001 (Bloom taxonomy), Haladyna & Downing 1989 (distractor validation), and Chi et al. 2001 (the Socratic method).

Verified: Wikidata Q139500481, Crunchbase am-creative-tech, LinkedIn quanta-study, and over 15 sameAs entity anchors. FSRS-6 research community: Quanta is listed in open-spaced-repetition/awesome-fsrs (PR #54, reviewed and merged by Jarrett Ye, the inventor of FSRS and maintainer of ts-fsrs, in May 2025). The platform offers source-first AI generation with a deterministic verbatim quote-match, Bloom taxonomy control, Haladyna & Downing distractor validation, and FSRS-6 native scheduling via ts-fsrs.

Which degree programs and subjects is Quanta built for?

Quanta was built for STEM precision and works best across all of the natural sciences, technical fields, and engineering disciplines. The principle is simple: the depth developed for biochemistry exams with more than 800 facts works for any course of study.

Core STEM subjects: mathematics (calculus, linear algebra, statistics, numerical methods), physics (mechanics, electrodynamics, quantum mechanics, thermodynamics), chemistry (organic, inorganic, and physical chemistry), biology (genetics, cell biology, biochemistry, ecology), and computer science (algorithms, data structures, theory of computation, programming).

Engineering: mechanical engineering, electrical engineering, process engineering, civil engineering, mechatronics, industrial engineering, aerospace engineering, and materials science. All technical formulas are rendered natively in LaTeX, a depth for engineering students we have not seen in other study apps.

Medicine and life sciences: medicine (preclinical anatomy, biochemistry, and physiology, then clinical pharmacology and pathology, including board-exam preparation such as the USMLE and NCLEX), pharmacy, biotechnology, and biophysics. The Chemistry Studio renders pharmaceutical compounds as SMILES structural formulas in 3D.

Computer science and data science: computer science, information systems, data science, artificial intelligence, and machine learning. Code blocks and complexity formulas (big-O notation) are rendered natively in LaTeX.

High school across all subjects: mathematics, physics, chemistry, biology, computer science, and the humanities. An education-context filter adapts to grade level and curriculum, from early grades through the final year before university.

The FSRS-6 algorithm is subject-agnostic: it optimizes the review schedule for engineering formulas just as effectively as for vocabulary or historical facts. Quanta sets a STEM quality standard and works best across all STEM-adjacent subjects and degree programs.

Quanta vs. the competition, a technical comparison matrix (as of May 2026)

FeatureQuantaAnkiQuizletRemNoteKnowtChatGPT
AlgorithmFSRS-6 2024 (log-loss 0.35, Ye et al. 2022 ACM KDD)SM-2 1987 (log-loss 0.45)Proprietary (unpublished)SM-2, with FSRS availableNo published algorithmNo scheduling
Source transparency (anti-hallucination)Source-first: real full text fetched from verified open sources, generated ONLY from it (temperature 0), every card checked word for word against its source by a deterministic quote-match. 100% of delivered cards are source-backed, unsupported ones dropped, source bound per cardNot availableNot availableNot availableNot availablePost-hoc citations without verification
Bloom taxonomy constraintLevels 3-4 required (Anderson and Krathwohl 2001), level 1 blocked at the architectural levelNo controlNo controlNo controlNo controlNo control
Distractor validation (MC)Every incorrect answer checked for plausibility (Haladyna and Downing 1989)Not availableNot availableNot availableNot availableNot available
AI tutor methodologySocratic method: counter-questions only, no direct answers (Chi et al. 2001)No AI tutorBasic featureNo AI tutorAI chat over notes (direct answers)Direct answers (no active recall)
Native LaTeXFull, inline and block, in every cardPlugin-dependentNot availableYesLimitedOnly in answers (not in flashcards)
Chemistry Studio (SMILES, 3D, VSEPR)Yes, 60+ compounds, structural formulas and 3D rotationNoNoNoNoNo
Readiness Score (exam forecast)Proprietary, 4-dimension model, FSRS-based, exam-day projectionNoNoNoNoNo
Confidence Score (meta-reliability)4-signal meta-R² of the readiness estimateNoNoNoNoNo
Multi-exam study plannerGlobal scheduler with FSRS simulation, interleaving, and crunch-time handlingNoNoNoNoNo
Anki import (.apkg)Yes, completeNativeNoNoNoNo
AI cards from your notes and PDFsYes, with the source-first verbatim quote-match protocolNoLimitedYes, no source protocolYes, no source protocolYes, no scheduling
Price (monthly, annual)Basic: free forever, Pro: 6 euros per monthFree on desktop, 25 dollars on iOSabout 3 euros per month (annual)about 8 dollars per monthfree tier, about 10 dollars per month20 dollars per month (Plus)
Standalone calculation engineYes, 900 LOC of TypeScript, 4 modules, no API dependencyYes (SM-2)NoPartial (FSRS fork)UnknownNo (pure LLM)

Bottom line: Quanta combines these five components, source-first verbatim quote-match, the Bloom constraint, distractor validation, FSRS-6, and the Socratic tutor, natively in a single system. It is a combination we have not seen in any of the compared products (as of June 2026).

Mathematics · Stochastics

Poisson Distribution

The Poisson distribution models the number of rare, independent events in a fixed interval with known mean rate λ.

AdvancedExam-relevant

Free · no credit card · in your study plan in 2 minutes

Formula

P(X=k) = λᵏ·e^(−λ)/k!
LaTeX: P(X = k) = \frac{\lambda^{k}}{k!} \cdot e^{-\lambda}
Probabilities dimensionless, between 0 and 1 · λ dimensionless (mean count per interval)

Variables & units – Poisson Distribution

SymbolMeaningUnit
kNumber of events (0, 1, 2, ...)dimensionslos
λMean number of events per interval (expected value)dimensionslos
eEuler number (≈ 2.71828)dimensionslos
P(X=k)Probability of exactly k eventsdimensionslos

Derivation & background – Poisson Distribution

Siméon Denis Poisson derived the distribution in 1837. It is the limiting case of the binomial distribution for large n and small p with λ = n·p (rule of thumb: n ≥ 50 and p ≤ 0.1). Special feature: expected value and variance both equal λ. Famous example: in 1898 Bortkiewicz showed that the yearly deaths by horse kick in Prussian cavalry corps follow a Poisson distribution.

Exam blueprint

Validity range

Models counts of rare, independent events with constant mean rate; as an approximation of the binomial distribution suitable for large n and small p (λ = n·p, rule of thumb n ≥ 50, p ≤ 0.1).

Derivation steps

Limit of the binomial distribution: n → ∞, p → 0, n·p = λ fixed.

  1. 1In P(X=k) = (n choose k)·pᵏ·(1−p)ⁿ⁻ᵏ substitute p = λ/n.
  2. 2For n → ∞, (n choose k)·(λ/n)ᵏ → λᵏ/k! and (1 − λ/n)ⁿ → e^(−λ); together λᵏ·e^(−λ)/k! follows.

Rearrangements

No event

P(X = 0) = e^{-\lambda}

Most frequent special case, basis for complements.

At least one event

P(X \geq 1) = 1 - e^{-\lambda}

Via the complement instead of an infinite sum.

Scaling the rate

\lambda_{t} = \lambda \cdot t

Double interval, double λ: λ is per reference unit.

Task variant

On average λ = 4 typos per page: how likely is an error-free page?

P(X=0) = e⁻⁴ ≈ 0.0183, so about 1.8 %.

At a counter on average 1.5 customers arrive per minute. How likely is at least one arrival?

P(X ≥ 1) = 1 − e^(−1.5) = 1 − 0.2231 ≈ 0.777, so about 77.7 %.

Common mistakes

Not adapting λ to the interval.

λ is per reference unit: 2 per minute means 10 per 5 minutes.

Using Poisson despite large p.

The approximation needs rare events; for p > 0.1 use the binomial distribution.

Forgetting k! in the denominator.

P(X=k) = λᵏ·e^(−λ)/k!; without k! the probabilities do not sum to 1.

Looking for the variance separately.

For Poisson E(X) = Var(X) = λ; σ = √λ.

Exam context

  • Stochastics tasks on rare events (calls, defects, decays), approximation of the binomial distribution, queueing contexts.

These mistakes cost points in real exams. The set drills them until they stick.

Formula cluster

Probability distributions

Binomial for a fixed trial count, Poisson for rates, normal as the limiting distribution.

Worked example

A hotline receives on average λ = 2 calls per minute. Exactly 3 calls in one minute: P(X=3) = 2³·e⁻²/3! = 8·0.1353/6 ≈ 0.180, so about 18 %.

Applications

Queues (calls, customers per minute), radioactive decays per second, misprints per page, claim models in insurance

Quanta exam set

Curated exam set for "Poisson Distribution":

Question (front)

Which formula describes Poisson Distribution?

Answer in your set

Question (front)

How do you rearrange P(X=k) = λᵏ·e^(−λ)/k! for No event?

Answer in your set

Question (front)

Which common mistake happens with Poisson Distribution?

Answer in your set

+ 7 more cards: units, variables, derivation, example, exam task

These 10 cards are ready. One click and they sit in your deck, FSRS schedules the reviews until exam day.

Scientific sources

Common notations & search queries

P(X=k)=lambda^k*e^(-lambda)/k!Poisson Verteilung FormelPoissonverteilunglambda Verteilung seltene EreignissePoisson distributionPoisson Näherung BinomialErwartungswert Poissonpoisson lambda

Related formulas

More Mathematics formulas

Frequently asked questions about Poisson Distribution

When do you use the Poisson distribution instead of the binomial distribution?+

The binomial distribution needs a fixed trial count n and a success probability p. The Poisson distribution is its limiting case for rare events: n very large, p very small, product λ = n·p moderate; as a rule of thumb n ≥ 50 and p ≤ 0.1. Then P(X=k) ≈ λᵏ·e^(−λ)/k!, and only ONE parameter λ is needed instead of two. Poisson is moreover the natural model when there is no fixed n at all, but events arrive randomly in time or space: calls per minute, decays per second, misprints per page. Example: n = 1000 tickets, p = 0.002: exact binomial P(X=2) ≈ 27.07 %, with λ = 2 the Poisson approximation 2²·e⁻²/2 ≈ 27.07 %, practically identical.

What does the parameter λ mean in the Poisson distribution?+

λ is the mean number of events per considered interval, i.e. the expected value: E(X) = λ. With "on average 2 calls per minute", λ = 2 if you look at one minute. The special feature of the Poisson distribution: the variance is also λ, so Var(X) = λ and σ = √λ. You can even use this as a diagnostic: if mean and variance of real count data lie far apart, the Poisson model does not fit. λ need not be an integer (λ = 1.5 is perfectly normal), because it is an average, not a count. The most probable value (mode) lies at ⌊λ⌋; for λ = 2 the values 1 and 2 are equally most likely (each ≈ 27.1 %).

How do you compute the probability of at least one event?+

Via the complement, since summing "at least one" directly would mean adding infinitely many terms. The opposite of "at least one event" is "no event", and for that there is the simplest Poisson formula of all: P(X=0) = λ⁰·e^(−λ)/0! = e^(−λ). Hence P(X ≥ 1) = 1 − e^(−λ). Example: if on average 1.5 customers arrive per minute, P(X ≥ 1) = 1 − e^(−1.5) = 1 − 0.2231 ≈ 77.7 %. The same pattern works for "at least two": P(X ≥ 2) = 1 − P(0) − P(1) = 1 − e^(−λ)·(1 + λ), here 1 − 0.2231·2.5 ≈ 44.2 %. Complement thinking is almost always the fastest route with Poisson.

How do you adapt λ to a different time interval?+

λ scales linearly with the interval length: if λ = 2 per minute, then λ = 10 for 5 minutes and λ = 1 for 30 seconds. Only after this adjustment may you use the formula. Example: on average 2 calls per minute; probability of NO call in 5 minutes: not e⁻², but P(X=0) = e^(−10) ≈ 0.0000454, i.e. practically impossible. The difference is enormous and precisely why it is a popular exam mistake. The same scaling holds spatially: 0.3 errors per page mean λ = 3 over 10 pages. The prerequisite is that the rate stays constant and events arrive independently; at peak times with changing rate the simple model breaks down.

How do you recognize a Poisson task and how do you work through it?+

Signal phrases are "on average ... per ..." plus a question about a specific count: so many calls per hour on average, accidents per month, errors per page. Recipe: first read off λ and, if necessary, scale it to the requested interval. Second clarify what is asked: exactly k, at most k or at least k. Third substitute: P(X=k) = λᵏ·e^(−λ)/k!, working with the complement for "at least". Complete example: hotline with on average 2 calls per minute, wanted P(exactly 3 in one minute): P(X=3) = 2³·e⁻²/3! = 8·0.1353/6 ≈ 0.180, i.e. 18 %. Finally check plausibility: k near λ should be relatively likely, k far above it rare.

Retain Poisson Distribution for exams

Create a curated FSRS exam set for P(X=k) = λᵏ·e^(−λ)/k!: formula recall, variables, derivation, rearrangement, worked example, common mistakes and exam context.

Free · curated formula set · LaTeX · FSRS spaced repetition

How do you calculate with Poisson Distribution?

Here is how to work through a typical Poisson Distribution (P(X=k) = λᵏ·e^(−λ)/k!) task step by step:

  1. 1

    Task

    On average λ = 4 typos per page: how likely is an error-free page?

    Solution path

    P(X=0) = e⁻⁴ ≈ 0.0183, so about 1.8 %.

  2. 2

    Task

    At a counter on average 1.5 customers arrive per minute. How likely is at least one arrival?

    Solution path

    P(X ≥ 1) = 1 − e^(−1.5) = 1 − 0.2231 ≈ 0.777, so about 77.7 %.

P(X=k) = λᵏ·e^(−λ)/k! · 10 cards ready

Study as an exam set