lorenz

Since 2020-03-16 · 2236 days · Last sync 2026-04-29 23:55

Overview
13,382
Reviews
88.2%
Retention
73
Day Streak
42.2h
Study Time
3,674
Cards
3,088
Mature
11.3s
Avg Time
119.0d
Avg Interval
73d
Best Streak
0
Due Now
Activity
Review Activity — Last 12 Months
Study Hours (All Time)
Upcoming Reviews
Card Analysis
Card States
Answer Buttons
Interval Distribution
Card Progress by Deck 93.9% overall
Deck Introduced New Left Total Progress
ETH2. SemesterAnalysis 351 121 472
74.4%
ETH1. SemesterA&D 537 0 537
100.0%
ETH1. SemesterDiskMat 1,015 0 1,015
100.0%
ETH1. SemesterEProg 205 0 205
100.0%
ETH1. SemesterLinAlg 465 0 465
100.0%
ETH2. SemesterA&W 367 0 367
100.0%
ETH2. SemesterDDCA 171 0 171
100.0%
ETH2. SemesterPProg 442 0 442
100.0%
Memory Model
117.8d
Avg Stability
2.97 / 10
Avg Difficulty
65.1%
Avg Retrievability
64.3%
At Risk (2,120 cards)
105.0d
Median Stability
106d
Memory Half-Life
Stability Distribution
Difficulty Distribution
Retrievability Snapshot — Right Now
Memory by Deck
Deck Cards Avg Stability Avg Difficulty Avg Retrievability
ETH::1. Semester::EProg 205 185.7d 1.96 85.5%
ETH::1. Semester::A&D 498 180.9d 2.04 79.9%
ETH::1. Semester::DiskMat 965 144.0d 2.69 58.8%
ETH::1. Semester::LinAlg 449 121.3d 2.26 60.1%
ETH::2. Semester::DDCA 170 75.3d 3.47 57.2%
ETH::2. Semester::PProg 309 60.4d 3.21 60.7%
ETH::2. Semester::Analysis 349 50.7d 4.65 64.5%
ETH::2. Semester::A&W 353 50.1d 4.41 60.2%
FSRS Model — Initial Stability by Deck
Review Insights
Review Time vs Answer Button
Speed by Deck
Deck Reviews Median Avg <3s 3–10s 10–20s 20–30s 30s+ Trend
ETH1. SemesterDiskMat 3,325 6.5s 12.8s 26.0% 37.6% 17.1% 7.4% 11.9%
ETH1. SemesterA&D 2,050 5.4s 11.1s 31.6% 36.4% 16.8% 5.7% 9.6%
ETH2. SemesterA&W 1,985 5.3s 11.6s 36.6% 30.3% 16.9% 5.2% 11.0%
ETH2. SemesterAnalysis 1,914 3.5s 9.8s 46.6% 28.6% 11.4% 4.3% 9.1%
ETH1. SemesterLinAlg 1,756 8.5s 15.2s 20.0% 35.8% 19.8% 8.9% 15.5%
ETH2. SemesterPProg 1,247 2.7s 7.4s 53.3% 30.5% 8.0% 2.8% 5.4%
ETH1. SemesterEProg 583 5.0s 11.0s 37.0% 35.5% 12.7% 4.8% 9.9%
ETH2. SemesterDDCA 522 2.8s 5.3s 53.3% 35.4% 7.9% 1.3% 2.1%
Sessions
142
Sessions
28.2m
Avg Session
Session Length Distribution
Intra-Session Fatigue Curve
Fun Stats
Night Owl
11,220 reviews 11pm-5am
11.0%
Human — 846 lapses across all reviews
Speed Demon
5.2s median — 34.7% under 3s, 10.4% over 30s
1
Mostly Chill — sessions ending in 3+ consecutive fails
0
Cards Buried — 0 by you, 0 by scheduler
91.2m
Absolute Unit — 251 cards on 2026-01-23
2:00
Peak Study Hour
83.8%
Reviews After Midnight
0.3
Lapses / Mature Card
34.7%
Sub-3s Reviews
16.9m
Avg Session (5m gap)
4
Worst Again Streak
0
User Buried Now
0
Sched Buried Now
Review Speed Distribution
Marathon Session Types
Fastest Cards
Front Avg Time Ease Interval Reviews
A WAITING thread transitions back to {{c1::RUNNABLE}} when {{c2::notify() or notifyAll()}} is called 1.2s 250% 51d 4
Ein {{c1::Laplace-Raum}} ist ein endlicher Wahrscheinlichkeitsraum, in dem {{c2::alle Elementarereig 1.2s 250% 38d 4
A RUNNABLE thread transitions to {{c1::BLOCKED}} when {{c2::it tries to acquire a lock held by anoth 1.2s 250% 50d 4
A function \(f: A \rightarrow B\) has a {{c1::right inverse}} if and only if \(f\) is {{c2::surje 1.3s 250% 135d 4
A BLOCKED thread transitions back to {{c1::RUNNABLE}} when {{c2::the lock it was waiting for is rele 1.3s 250% 45d 4
{{c1::Vertikale}} Asymptote \(\rightarrow\) Funktionswert gegen {{c2::\(\infty\) f 1.3s 250% 42d 4
Eine Funktion \(f : \mathbb{R} \rightarrow \mathbb{R}\) ist {{c1::gerade}} falls gilt {{c2:: \(\fora 1.4s 250% 51d 4
In a group, the {{c1::right cancellation}} law states: \(a = b\) {{c2::\(\Leftrightarrow\)}} {{c3 1.4s 250% 89d 4
For a finite group \(G\), we call \(|G|\) the {{c1::order of \(G\)}}. 1.4s 250% 138d 4
{{c1::Mutual exclusion}} means preventing {{c2::more than one thread from being in a critical sectio 1.4s 250% 160d 5
Der Grenzwert L einer Funktion ist {{c1::eindeutig bestimmt}}. 1.4s 250% 51d 4
Closed Walk 1.5s 250% 263d 5
A logic circuit is composed of:{{c1::Inputs}}{{c1::Outputs}}{{c2::Func 1.5s 250% 50d 4
Der Graph einer Funktion heißt {{c2::linksgekrümmt (Konvex)}} falls der Graph {{c1::eine 1.5s 250% 52d 4
A standard way to prevent deadlock is to always acquire multiple locks in {{c1::a globally consisten 1.5s 250% 42d 4
Hardest Cards
Front Lapses Ease Interval Reviews
Sei \(X\) eine Zufallsvariable mit Wertebereich \(W_X\subseteq\mathbb{N}_0\).Dann 6 130% 3d 23
State of the Art Matching:\( O({{c1::|E|^{1+o(1)} }}) \) für bipartite Graphen  6 130% 12d 26
{{c3::image-occlusion:rect:left=.1591:top=.8923:width=.7185:height=.0742}}{{c2::image-occlusion: 6 130% 22d 27
Youngsche UngleichungFür jedes \(x, y \in \mathbb{R}\), \(\epsilon > 0\) gilt:&nbs 6 130% 7d 24
Explain how union works in the optimised Union-Find: 5 150% 76d 19
State Lemma 5.18 about the units of a ring and the property their set satisfies? (Proof i 5 150% 55d 22
Für alle \( k \) gilt: jeder \( k \)-reguläre bipartite Graph enthält {{c1::ein perfektes Mat 5 150% 13d 25
Heuristik:\(v_n\) := Knote 5 150% 12d 25
Wie lautet die Bernoulli Ungleichung? 5 150% 9d 23
\[ \cos\!\left(\frac{7\pi}{4}\right) = {{c1::\frac{\sqrt{2} }{2} }} \] 5 150% 20d 22
Prim's Algorithm Invariants:The distances "d[.] = " in the distance array are {{c1::the 4 170% 87d 18
 A cyclic group of order \(n\) {{c1::is isomorphic to \(\langle \mathbb{Z}_n,\op 4 170% 95d 19
How do you perform polynomial division when the divisor is not monic (e.g., in \(\text{GF}(7)[x]\ 4 170% 100d 17
Jeder Graph \(G = (V, E)\) mit \(|V| \geq 3\) und {{c1::Minimalgrad \(\delta(G) \geq |V|/2\)}} 4 170% 6d 22
In einer Gruppe von \(m\) Personen (mit \(n=365\) Tagen), wie gross ist die Wahrscheinlichkeit, dass 4 170% 6d 19