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 · Analytic Geometry / Vectors

Distance Point-Line

The distance of a point from a line in space is the length of the perpendicular; the cross product formula yields it in one step.

AdvancedExam-relevant

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

Formula

d(Q;g) = |(q⃗−p⃗)×u⃗| / |u⃗|
LaTeX: d(Q;g) = \frac{|(\vec{q} - \vec{p}) \times \vec{u}|}{|\vec{u}|}
Coordinates and d(Q;g) in length units (LU)

Variables & units – Distance Point-Line

SymbolMeaningUnit
q⃗Position vector of the point QLE
p⃗Support vector of the line gLE
u⃗Direction vector of the line gdimensionslos
d(Q;g)Distance (length of the perpendicular from Q to g)LE

Derivation & background – Distance Point-Line

Geometric interpretation: |(q⃗−p⃗) × u⃗| is the area of the parallelogram spanned by q⃗−p⃗ and u⃗; divided by the base |u⃗| its height remains, which is exactly the distance. Alternatively the perpendicular-foot method F = p⃗ + t·u⃗ with t = (q⃗−p⃗)·u⃗/(u⃗·u⃗) additionally yields the foot point F; then d = |QF⃗|. Both routes lead to the same result.

Exam blueprint

Validity range

Holds for lines in parametric form in space (u⃗ ≠ 0⃗). In the plane one uses the 2D variant via the perpendicular or the HNF of the line; skew lines have their own formula.

Derivation steps

Parallelogram area divided by the base gives the height, i.e. the distance.

  1. 1q⃗ − p⃗ and u⃗ span a parallelogram with area |(q⃗ − p⃗) × u⃗|.
  2. 2Area = base times height: division by |u⃗| leaves the height, the distance from Q to g.

Rearrangements

Perpendicular foot parameter

t = \frac{(\vec{q} - \vec{p}) \cdot \vec{u}}{\vec{u} \cdot \vec{u}}

F = p⃗ + t·u⃗ is the foot point; d = |QF⃗| as an alternative.

Distance in the plane (2D)

d = \frac{|a q_{1} + b q_{2} - c|}{\sqrt{a^{2} + b^{2}}}

HNF of the line equation ax + by = c.

Skew lines

d = \frac{|(\vec{q} - \vec{p}) \cdot (\vec{u} \times \vec{v})|}{|\vec{u} \times \vec{v}|}

Generalization with both direction vectors u⃗ and v⃗.

Task variant

g passes through the origin with u⃗ = (1|2|2). What is the distance of Q(3|0|0)?

q⃗ − p⃗ = (3|0|0). Cross product with u⃗: (0|−6|6), magnitude √72 = 6√2. |u⃗| = 3. d = 6√2/3 = 2√2 ≈ 2.83 LU.

g: x⃗ = (1|1|0) + t·(1|0|1), Q(2|1|3): determine the foot point and the distance.

t = ((1|0|3)·(1|0|1))/2 = 4/2 = 2, so F(3|1|2). QF⃗ = (1|0|−1), d = √2 ≈ 1.41 LU. Check with cross product: |(1|0|3)×(1|0|1)| = |(0|2|0)| = 2, divided by |u⃗| = √2 gives √2 ✓.

Common mistakes

Using the position vector q⃗ instead of the difference q⃗ − p⃗.

The formula needs the connection vector from the support point to Q.

Confusing cross and dot product.

The numerator is the magnitude of a vector (cross product), not a scalar from the dot product.

Forgetting to divide by |u⃗|.

Without the division the parallelogram area remains instead of the height.

Exam context

  • Distance tasks in space, applications with flight paths and cables, combined with foot point and reflection tasks.

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

Worked example

g: x⃗ = (1|0|2) + t·(2|1|2) and Q(3|4|2): q⃗−p⃗ = (2|4|0), cross product (q⃗−p⃗)×u⃗ = (8|−4|−6) with magnitude √116 ≈ 10.77. |u⃗| = 3. Distance d = √116/3 ≈ 3.59 LU.

Applications

Distance tasks in final exams, shortest distance to flight paths and cables, tolerance checks in CAD systems, precursor for the distance of skew lines

Quanta exam set

Curated exam set for "Distance Point-Line":

Question (front)

Which formula describes Distance Point-Line?

Answer in your set

Question (front)

How do you rearrange d(Q;g) = |(q⃗−p⃗)×u⃗| / |u⃗| for Perpendicular foot parameter?

Answer in your set

Question (front)

Which common mistake happens with Distance Point-Line?

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

d=|(q-p)xu|/|u|Abstand Punkt GeradeAbstand Punkt Gerade VektorenLotfußpunktverfahrenLotfußpunkt berechnendistance point line 3dAbstand Punkt Gerade Kreuzproduktkürzester Abstand Gerade

Related formulas

More Mathematics formulas

Frequently asked questions about Distance Point-Line

How do you calculate the distance of a point from a line in space?+

Fastest with the cross product formula d = |(q⃗ − p⃗) × u⃗|/|u⃗|. Procedure: form the connection vector from the support point of the line to the point, compute the cross product with the direction vector, divide its magnitude by |u⃗|. Example: g: x⃗ = (1|0|2) + t·(2|1|2) and Q(3|4|2): q⃗ − p⃗ = (2|4|0), cross product (8|−4|−6), magnitude √(64 + 16 + 36) = √116 ≈ 10.77; divided by |u⃗| = 3 gives d ≈ 3.59 LU. The formula automatically measures the shortest, i.e. perpendicular distance. Important: use (q⃗ − p⃗), not the position vector q⃗ alone, and do not forget the final division.

How does the perpendicular foot point method work?+

You look for the point F on the line where the perpendicular from Q lands. Ansatz: F = p⃗ + t·u⃗, and the vector QF⃗ must be perpendicular to u⃗, i.e. QF⃗·u⃗ = 0. Solving yields t = (q⃗ − p⃗)·u⃗/(u⃗·u⃗). Example: g: x⃗ = (1|1|0) + t·(1|0|1) and Q(2|1|3): t = ((1|0|3)·(1|0|1))/2 = 4/2 = 2, so F(3|1|2) and d = |QF⃗| = |(1|0|−1)| = √2 ≈ 1.41 LU. The added value over the cross product formula: you obtain the foot point F itself and can continue working with it, e.g. construct the reflected point Q′ = Q + 2·QF⃗.

Which method should you use when: cross product or foot point?+

Ask yourself what the task really requires. If only the distance number is required, the cross product formula is the shortest route: one cross product, two magnitudes, one division, done. If instead you need the foot point itself, a reflected point, the contact point of a perpendicular or a justification via orthogonality, there is no way around the foot point method; it delivers F and the distance at once. In exams the combination is also strong: compute with the foot point and check with the cross product formula in one line (or vice versa). Both methods must give exactly the same value; deviations immediately reveal a calculation error.

How do you calculate the point-line distance in the plane (2D)?+

In the plane there is the Hesse normal form of the line: for g: ax + by = c and the point Q(q₁|q₂), d = |a·q₁ + b·q₂ − c|/√(a² + b²). Example: g: 3x + 4y = 10 and Q(5|5): d = |15 + 20 − 10|/√(9 + 16) = 25/5 = 5 LU. If the line is given as y = mx + t, first bring it into the form mx − y = −t. The cross product is not available in 2D (it needs three dimensions); alternatively the foot point method works with the normal slope −1/m. The 2D formula is the exact counterpart of the point-plane formula in space, just with two instead of three coordinates.

How does the distance of skew lines differ from this?+

Skew lines do not intersect and are not parallel; their distance is the length of the common perpendicular. The formula uses both direction vectors: d = |(q⃗ − p⃗)·(u⃗ × v⃗)|/|u⃗ × v⃗|, where p⃗ and q⃗ are the support vectors. The difference from the point-line formula: instead of the magnitude of a cross product, the numerator holds a scalar triple product, i.e. the projection of the connection vector onto the common normal direction u⃗ × v⃗. If the lines are parallel (u⃗ × v⃗ = 0⃗), this formula fails; then you pick a point of one line and compute point-line as usual. So first check the relative position, then the matching formula.

Retain Distance Point-Line for exams

Create a curated FSRS exam set for d(Q;g) = |(q⃗−p⃗)×u⃗| / |u⃗|: 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 Distance Point-Line?

Here is how to work through a typical Distance Point-Line (d(Q;g) = |(q⃗−p⃗)×u⃗| / |u⃗|) task step by step:

  1. 1

    Task

    g passes through the origin with u⃗ = (1|2|2). What is the distance of Q(3|0|0)?

    Solution path

    q⃗ − p⃗ = (3|0|0). Cross product with u⃗: (0|−6|6), magnitude √72 = 6√2. |u⃗| = 3. d = 6√2/3 = 2√2 ≈ 2.83 LU.

  2. 2

    Task

    g: x⃗ = (1|1|0) + t·(1|0|1), Q(2|1|3): determine the foot point and the distance.

    Solution path

    t = ((1|0|3)·(1|0|1))/2 = 4/2 = 2, so F(3|1|2). QF⃗ = (1|0|−1), d = √2 ≈ 1.41 LU. Check with cross product: |(1|0|3)×(1|0|1)| = |(0|2|0)| = 2, divided by |u⃗| = √2 gives √2 ✓.

d(Q;g) = |(q⃗−p⃗)×u⃗| / |u⃗| · 10 cards ready

Study as an exam set