{"claims":[{"id":"verified-euclid-cf","lab_slugs":["quick-calculator","algorithm-explorer","rectangle-reactor","fibonacci-race","quadratic-surd-loop"],"source_ids":["bell","euclid_book_vii"],"statement":"Running the Euclidean algorithm on positive integers yields the finite continued fraction of a/b.","status":"verified"},{"id":"verified-bezout","lab_slugs":["quick-calculator","algorithm-explorer","modular-lock-lab"],"source_ids":["bell"],"statement":"Extended Euclid produces coefficients x and y with a*x + b*y = gcd(a, b).","status":"verified"},{"id":"verified-mod-inverse","lab_slugs":["algorithm-explorer","modular-lock-lab"],"source_ids":["bell","mathworld_mod_inverse"],"statement":"If gcd(a, b) = 1, the x coefficient from extended Euclid gives the inverse of a modulo b.","status":"verified"},{"id":"analogy-phase","lab_slugs":["algorithm-explorer","gear-ratio-forge"],"source_ids":["bell","cambridge_gears"],"statement":"A single division step can be visualized as q full turns plus a residual phase r/b, but that is an analogy rather than a full autonomous machine.","status":"analogy_only"}],"explanation_meta":{"analogy_topics":["phase_lab","automatic_gears"],"false_topics":["sliding_center_remainder","generic_spiral_claims","historical_gear_machine"],"verified_topics":["euclidean_algorithm","extended_euclid","continued_fractions","rectangle_dissections","modular_inverse","euclidean_rhythms","rational_landscapes"]},"facts":[{"body":"Euclid's algorithm is one of the oldest named algorithms that is still used directly in modern software.","id":"fact-oldest-algorithm","illustration":{"kind":"medallion","label":"c. 300 BCE"},"lab_slugs":["quick-calculator","algorithm-explorer","home"],"source_id":"euclid_book_vii","title":"Ancient, Still Useful"},{"body":"Typeset equations help when the same integer process is shown as division, continued fractions, and recurrences.","id":"fact-katex-ready","illustration":{"kind":"formula","label":"[a0;a1,...]"},"lab_slugs":["quadratic-surd-loop","algorithm-explorer"],"source_id":"bell","title":"Fast Math Rendering"}],"inputs":{"a":240,"b":46},"lab":{"api_path":"/api/v2/euclid","claim_ids":["verified-euclid-cf","verified-bezout","verified-mod-inverse","analogy-phase"],"controller":"algorithm-explorer","default_inputs":{"a":240,"b":46},"group":"core-algorithm","nav_label":"Algorithm Explorer","related_labs":["quick-calculator","rectangle-reactor","modular-lock-lab"],"route":"/explorer","slug":"algorithm-explorer","source_ids":["bell","euclid_book_vii","cambridge_gears"],"status":"verified","subtitle":"Scrub Euclid Steps, B\u00e9zout Rows, and the One-Step Phase Analogy","summary":"Interactive Euclid and Extended Euclid tables with synced equations and callouts.","title":"Algorithm Explorer"},"model":{"bezout":{"identity":"240 * (-9) + 46 * (47) = 2","inverse_mod_b":null,"x":-9,"y":47},"continued_fraction":{"convergents":[{"decimal":5.0,"denominator":1,"error_decimal":0.2173913,"index":1,"numerator":5,"quotient":5},{"decimal":5.25,"denominator":4,"error_decimal":-0.0326087,"index":2,"numerator":21,"quotient":4},{"decimal":5.2,"denominator":5,"error_decimal":0.0173913,"index":3,"numerator":26,"quotient":1},{"decimal":5.22222222,"denominator":9,"error_decimal":-0.00483092,"index":4,"numerator":47,"quotient":1},{"decimal":5.2173913,"denominator":23,"error_decimal":0.0,"index":5,"numerator":120,"quotient":2}],"notation":"[5; 4, 1, 1, 2]","quotients":[5,4,1,1,2]},"gcd":2,"input":{"a":240,"b":46,"ratio":{"decimal":5.2173913,"denominator":23,"numerator":120}},"phase":{"dividend":240,"divisor":46,"ratio":{"decimal":5.2173913,"denominator":23,"numerator":120},"remainder":10,"summary":"One full driver turn yields 5 full follower turns and a residual phase of 10/46.","whole_turns":5},"properties":{"coprime":false,"fibonacci_like_quotients":false,"fibonacci_pair":false},"rows":[{"color":"#0f7b6d","identity":"240 * (1) + 46 * (0) = 240","index":0,"is_gcd_row":false,"is_stop_row":false,"quotient":null,"remainder":240,"remainder_expression":null,"s":1,"s_expression":null,"t":0,"t_expression":null},{"color":"#c0822b","identity":"240 * (0) + 46 * (1) = 46","index":1,"is_gcd_row":false,"is_stop_row":false,"quotient":null,"remainder":46,"remainder_expression":null,"s":0,"s_expression":null,"t":1,"t_expression":null},{"color":"#22577a","identity":"240 * (1) + 46 * (-5) = 10","index":2,"is_gcd_row":false,"is_stop_row":false,"quotient":5,"remainder":10,"remainder_expression":"240 - 5 * 46","s":1,"s_expression":"1 - 5 * 0","t":-5,"t_expression":"0 - 5 * 1"},{"color":"#8f4f4f","identity":"240 * (-4) + 46 * (21) = 6","index":3,"is_gcd_row":false,"is_stop_row":false,"quotient":4,"remainder":6,"remainder_expression":"46 - 4 * 10","s":-4,"s_expression":"0 - 4 * 1","t":21,"t_expression":"1 - 4 * -5"},{"color":"#5e548e","identity":"240 * (5) + 46 * (-26) = 4","index":4,"is_gcd_row":false,"is_stop_row":false,"quotient":1,"remainder":4,"remainder_expression":"10 - 1 * 6","s":5,"s_expression":"1 - 1 * -4","t":-26,"t_expression":"-5 - 1 * 21"},{"color":"#2d6a4f","identity":"240 * (-9) + 46 * (47) = 2","index":5,"is_gcd_row":true,"is_stop_row":false,"quotient":1,"remainder":2,"remainder_expression":"6 - 1 * 4","s":-9,"s_expression":"-4 - 1 * 5","t":47,"t_expression":"21 - 1 * -26"},{"color":"#a44a3f","identity":"240 * (23) + 46 * (-120) = 0","index":6,"is_gcd_row":false,"is_stop_row":true,"quotient":2,"remainder":0,"remainder_expression":"4 - 2 * 2","s":23,"s_expression":"5 - 2 * -9","t":-120,"t_expression":"-26 - 2 * 47"}],"sequences":{"quotients":[5,4,1,1,2],"remainders":[240,46,10,6,4,2,0]},"step_count":5,"steps":[{"color":"#0f7b6d","dividend":240,"divisor":46,"index":1,"quotient":5,"remainder":10},{"color":"#c0822b","dividend":46,"divisor":10,"index":2,"quotient":4,"remainder":6},{"color":"#22577a","dividend":10,"divisor":6,"index":3,"quotient":1,"remainder":4},{"color":"#8f4f4f","dividend":6,"divisor":4,"index":4,"quotient":1,"remainder":2},{"color":"#5e548e","dividend":4,"divisor":2,"index":5,"quotient":2,"remainder":0}]},"ok":true,"related_labs":[{"api_path":"/api/v2/euclid","claim_ids":["verified-euclid-cf","verified-bezout","verified-mod-inverse"],"controller":null,"default_inputs":{"a":12082,"b":5280},"group":"core-algorithm","nav_label":"Quick Calculator","related_labs":["algorithm-explorer","centered-euclid-race","modular-lock-lab"],"route":"/quick","slug":"quick-calculator","source_ids":["bell","euclid_book_vii"],"status":"verified","subtitle":"Fast Euclid Output for Trustworthy Spot Checks","summary":"The preserved exact-text fast path for Euclid, B\u00e9zout, and modular inverse results.","title":"Quick Calculator"},{"api_path":"/api/v2/euclid","claim_ids":["verified-euclid-cf","verified-rectangle","verified-golden-special","false-generic-spiral"],"controller":"rectangle-reactor","default_inputs":{"a":55,"b":34},"group":"ratios-and-geometry","nav_label":null,"related_labs":["algorithm-explorer","fibonacci-race","quadratic-surd-loop"],"route":"/rectangle-reactor","slug":"rectangle-reactor","source_ids":["bell","golden_rectangle","golden_spiral"],"status":"verified","subtitle":"Continued Fractions, Square Cuts, and the Golden-Only Spiral Story","summary":"A dissection lab that keeps the geometry true and labels the golden special case correctly.","title":"Rectangle Reactor"},{"api_path":"/api/v2/modular-lock","claim_ids":["verified-bezout","verified-mod-inverse"],"controller":"modular-lock-lab","default_inputs":{"a":13,"m":34},"group":"applications-and-reality-checks","nav_label":null,"related_labs":["algorithm-explorer","quick-calculator","centered-euclid-race"],"route":"/modular-lock-lab","slug":"modular-lock-lab","source_ids":["bell","mathworld_mod_inverse"],"status":"verified","subtitle":"When the Key Exists, Extended Euclid Finds It","summary":"A lock-and-key view of modular inverses with coprime gating.","title":"Modular Lock Lab"}],"sources":[{"id":"bell","note":"Primary reference for Euclid, continued fractions, and convergents.","title":"Jordan Bell, The Euclidean algorithm and finite continued fractions","url":"https://jordanbell.info/LaTeX/euclideanalgorithm/euclideanalgorithm.pdf"},{"id":"euclid_book_vii","note":"Readable translation of Euclid's arithmetic algorithm setting.","title":"Clark University, Euclid's Elements, Book VII","url":"http://aleph0.clarku.edu/~djoyce/elements/bookVII/bookVII.html"},{"id":"cambridge_gears","note":"Mechanical grounding for what actual involute gears do and do not compute.","title":"Cambridge DANotes, Gear Meshing","url":"https://www-mdp.eng.cam.ac.uk/web/library/enginfo/textbooks_dvd_only/DAN/gears/meshing/meshing.html"},{"id":"mathworld_mod_inverse","note":"Reference for modular inversion and coprime gating.","title":"Wolfram MathWorld, Modular Inverse","url":"https://mathworld.wolfram.com/ModularInverse.html"}],"ui":{"error":null,"needs_swap":false,"swap_params":null}}