Free · No login required
Video Loop Alignment
Find the first positive shared boundary of two frame-counted loops running at one frame rate.
Loop A frame count: 1–1000000; Loop B frame count: 1–1000000; Shared playback rate (fps): 1–240
Inputs stay on this page and clear on refresh.
Video Loop Alignment
Loop A frame count: 240 Loop B frame count: 360 Shared playback rate (fps): 24
- Next shared boundary (s)
- 30.000000
- Completed loops A
- 3
- Completed loops B
- 2
Common frames = A × B / gcd(A,B). Time = common frames / shared fps; completed loops = common frames divided by each loop’s frame count. Counts include the first pass. Each N-frame loop lasts N frame periods; time zero is excluded. Start both loops together and use the same constant frame rate and clock. This does not resample files or guarantee seamless content, genlock, timecode alignment or drift-free playback. Seconds are approximate for fractional rates; integer loop counts are exact within the stated bounds.
Methodology
How it works
Common frames = A × B / gcd(A,B). Time = common frames / shared fps; completed loops = common frames divided by each loop’s frame count. Counts include the first pass. Each N-frame loop lasts N frame periods; time zero is excluded. Start both loops together and use the same constant frame rate and clock. This does not resample files or guarantee seamless content, genlock, timecode alignment or drift-free playback. Seconds are approximate for fractional rates; integer loop counts are exact within the stated bounds.
Method and assumptions documented by Techrider.live
2026-11-12
Frequently asked questions
Can the loops use different frame rates?
No. Convert or conform both to one shared frame rate first. This calculation assumes exact frame counts, simultaneous starts and uninterrupted playback.