IACA’s Evidence-Driven Coding Acceptance

video1.0<iframe src="https://www.loom.com/embed/a0e1a0124faf49edb6875b831d23ff61" frameborder="0" width="1920" height="1440" webkitallowfullscreen mozallowfullscreen allowfullscreen></iframe>14401920Loomhttps://www.loom.com14401920https://cdn.loom.com/os/loom-media-content/loom/f46cf16e-a2a5-44ba-bbe1-3d51c28e94db/efa72c27-e4f7-43df-8998-fcc17b87f40f/sessions-thumbnails-a0e1a0124faf49edb6875b831d23ff61-ad986a5f86faf698.gif/binary?authToken=eyJraWQiOiJtaWNyb3MtZ3JvdXAvdGRwLW9zLWFyY2hldHlwZS9xcGE2cG03NzRjbzIzZ2w1IiwiYWxnIjoiUlMyNTYifQ.eyJicyI6Imxvb20tbWVkaWEtY29udGVudCIsImF1ZCI6InRkcC1vcy1hcmNoZXR5cGUiLCJuYmYiOjE3OTQyNTU1MzEsInRpIjoiM2QzMjUzYWUtOWNiNS00ZWRkLThlMjAtYmU2N2UxMTgwMTE5IiwiYWRpIjoibG9vbS9sb29tIiwiaXNzIjoibWljcm9zLWdyb3VwL3RkcC1vcy1hcmNoZXR5cGUiLCJwaWQiOiI4YTNhNDgxZC04NWNkLTQyODktOTk3MS1kNWNmMzIwYjFmZGYiLCJ3YSI6ImZhbHNlIiwib2lkIjoic2Vzc2lvbnMtdGh1bWJuYWlscy1hMGUxYTAxMjRmYWY0OWVkYjY4NzViODMxZDIzZmY2MS1hZDk4NmE1Zjg2ZmFmNjk4LmdpZiIsImV4cCI6MTc5NDI1NjEzMSwiaWF0IjoxNzk0MjU1NTMxLCJqdGkiOiJlY2U5NDEyMS1jYWJhLTQxZDQtYTVhZS03N2NiMDk3YzVhOGYifQ.Jii_jKJQZZzkOEQ4poO4cDhLvbtA8gLMDfKbqHco2Ycnryi_0S3Kc0stbw_MfFVhcTUKVG9aBMSurOtNOMg3QuZExxWCA-of1ITj_ta3UcmDE1Mzd7-lKxuq1A3XlqEMowCPalZP_gAk5kd9oJtbWoyFCuJURhr4cPgvgkvacGpXgCBbPGZwZu90YCvHgw6dqKuF0sC5fRYFZmNd5_vbGkzD3UHD-kz3o0HUJ5atj1B56BhCoQ-DvwsIKn0Q32vzwFkOQ5KXB0w2rwm3R_vVQtRsjZRiJ09ehdggk3SpuYNDhxAtIHSVLFc_BOdwKV7zd5zEaSqLZLfrwvf6uXvRkg&Expires=1794256131&Signature=Sz4iNScThUnzHPk5xqe2uLgDB-lIYYz%7EAoTcD-EjpzOctEOgsSggSn87PgxVOG2HxL2w5GfKFZyWGbSVPb4MxDQ8RdqtmfabmLmYzeazgWyoPeH31XvcDkBMNIaq3w4LbiBH3oO7GzR6AbvnUs%7E6YEpDhloemp%7E0fXdnSBFZVOUZwaduCx7VYZUBkJxxSNjiQXvrWK5i9JyIP61cpz%7EQkTFohB0Fing-IfS2Nf5M48YRLUsaaLsv9299j7MLGQpPoQ9n1AAqDyWYuw3KUVLyvBdLqPOGqa%7EaXS58qJO2lsZLN4cn0OsO6qKhaiGHsk2dGvj9xLV8vOhoh4skoOrbHA__&Key-Pair-Id=KQOSYIR44AIC0158.68IACA’s Evidence-Driven Coding AcceptanceThis Loom explains how IACA, an intelligent autonomous coding agent, makes code change proposals acceptable only with inspectable evidence. It describes a bounded loop connecting MetaWonder to a deterministic Rust engine to re-associate three list concatenations while preserving element order, empty lists, and nested structure by changing only one expression. IACA checks a proposal through independent oracle tests over 216 input combinations and then proves equivalence in 34 proof steps. The video also shows a deliberately incorrect fixture where the checker rejects a swap, and a later case where execution tests pass but symbolic budget is zero so the proof is left unresolved and rejected.