code-evolution-starter.csv

id,sort_date,year,date_display,date_basis,date_precision,date_confidence,title,organization,problem,problem_family,domain,language,platform,authoring_mode,authoring_level,artifact_status,snippet_status,snippet,snippet_lines,snippet_locator,code_url,source_url,source_title,revision,license,redistribution,selection_reason,provenance_tier,confidence,caveat,tags
1928-ibm-card-control-panel,1928-01-01,1928,1928,released,year,high,IBM 80-column card and wired control panel,IBM,"Reconfigure high-volume accounting, sorting, totals, and reports without rebuilding the machine.",business_data,Unit-record business processing,Card schema and patch-cord wiring,IBM punched-card machines,physical_configuration,1,conceptual,illustrative,"READ employee card
WIRE hours field -> multiplier
WIRE pay rate -> multiplier
PUNCH gross pay to output card",4,Control-panel examples in IBM punched-card training manual,https://bitsavers.computerhistory.org/pdf/ibm/punchedCard/Training/F20-0074_An_Introduction_to_IBM_Punched_Card_Data_Processing.pdf,https://www.ibm.com/history/punched-card,IBM: The punched card,,Manual scan; reuse license unclear,locator_only,The card and plugboard made data layout and business logic reconfigurable before stored programs.,B,high,"The date anchors the 80-column format, not one surviving program; the excerpt is modern illustrative notation.",punch-card|accounting|plugboard|business
1931-bush-differential-analyzer,1931-01-01,1931,1931,executed,year,high,Differential Analyzer configuration,MIT,Solve differential equations that were prohibitively slow to integrate by hand.,science_control,Analog scientific computing,"Equations, gear ratios, and shaft connections",MIT Differential Analyzer,physical_configuration,1,conceptual,illustrative,"set integrator_1 input = dy/dx
set gear ratio = scale_x / scale_y
connect integrator_1 output -> plotter_y
turn drive shaft",4,Machine setup described in institutional collection material,,https://siris-libraries.si.edu/ipac20/ipac.jsp?uri=full%3D3100001~%211105656%210,Smithsonian Libraries: Differential Analyzer material,,Catalog material; no open reuse license stated,locator_only,It turned a physical arrangement of reusable components into an executable mathematical method.,B,high,"This is continuous analog configuration, not digital source code; the excerpt is explanatory pseudocode.",analog|differential-equations|simulation|engineering
1936-turing-transition-table,1936-11-01,1936,Nov–Dec 1936,published,range,high,Turing-machine transition tables,Alan M. Turing / London Mathematical Society,Define effective computation precisely enough to prove what no algorithm can decide.,science_control,Mathematical logic,State / symbol / action table,Abstract universal machine,symbolic_text,3,conceptual,illustrative,"state q1, symbol 0 -> write 1, move R, state q2
state q1, symbol 1 -> write 0, move L, state q1
state q2, symbol blank -> halt",3,Machine tables in On Computable Numbers,https://www.cs.virginia.edu/~robins/Turing_Paper_1936.pdf,https://turingarchive.kings.cam.ac.uk/computable-numbers,The Turing Digital Archive: Computable Numbers,,Rights vary by jurisdiction; locator preferred,locator_only,It established a machine-independent model of programs and universal computation.,A,high,The transition excerpt is illustrative and was never executed on physical hardware.,theory|computability|universal-machine|algorithm
1942-zuse-trajectory-plan,1942-01-01,1942,1942,authored,year,medium,Zuse trajectory-calculation plan,Konrad Zuse,Calculate aeronautical flight trajectories with a reusable computation plan.,science_control,Aeronautical engineering,Rechenplan notation,Zuse machine lineage,symbolic_text,3,facsimile,locator_only,,0,ZIA 0365 / GMD 012/009,https://zuse.zib.de/file/1rUAfKDkirW8o3gT/64/2f/ab/ca-d50b-46ab-ac88-2de37f196247/0/original/c2d0c40d1254593104d1eef252134281.pdf,https://zuse.zib.de/pdfs,Konrad Zuse Internet Archive: PDF collection,ZIA 0365,Archive item; verify embedded license before reuse,locator_only,An unusually early surviving plan for an applied engineering computation.,B,medium,The intended execution target and whether this exact plan ran require manuscript-level verification.,zuse|trajectory|aeronautics|rechenplan
1944-colossus-lorenz,1944-02-05,1944,5 Feb 1944,executed,day,high,Colossus Lorenz wheel-setting setup,Bletchley Park,Reduce the time needed to recover Lorenz cipher wheel settings.,systems_infrastructure,Wartime cryptanalysis,"Paper-tape loop, plugs, cords, and switches",Colossus Mk I,physical_configuration,1,reconstruction,illustrative,"loop intercepted tape
set wheel pattern switches
count matches for candidate offset
print highest-scoring settings",4,Rebuilt Colossus operating description,https://www.tnmoc.org/rebuilding-colossus,https://www.tnmoc.org/colossus,The National Museum of Computing: Colossus,,Museum web content copyrighted,locator_only,It combined electronic speed with reconfigurable logic for a consequential real-world search problem.,B,high,Original machines and most documentation were destroyed; the excerpt describes the reconstructed workflow.,cryptanalysis|paper-tape|wartime|search
1945-edvac-first-draft,1945-06-30,1945,30 Jun 1945,published,day,high,First Draft of a Report on the EDVAC,University of Pennsylvania / John von Neumann,Design a reusable electronic computer whose instructions and data share addressable memory.,systems_infrastructure,Computer architecture,Logical block description,Proposed EDVAC,encoded_instructions,2,conceptual,unavailable,,0,Full report,https://library.si.edu/digital-library/book/firstdraftofrepo00vonn,https://library.si.edu/digital-library/book/firstdraftofrepo00vonn,Smithsonian Libraries: First Draft of a Report on the EDVAC,,CC0 / no known copyright,public_domain,The report widely circulated the stored-program logical design that shaped many postwar machines.,A,high,"It is an architecture document, not running application code; credit for the architecture is historically contested.",stored-program|architecture|memory|edvac
1947-booth-britten-arc-coding,1947-09-01,1947,Sep 1947,published,month,high,Coding for A.R.C.,Birkbeck College / Institute for Advanced Study archive,Express scientific routines systematically and move them from a relay machine to an electronic successor.,science_control,Crystallography and scientific computing,Binary orders and contracted symbolic notation,A.R.C.,symbolic_text,3,facsimile,locator_only,,0,Booth & Britten report scan,https://albert.ias.edu/entities/publication/27e8d743-e430-4d4d-821c-b7a7944607a7,https://albert.ias.edu/entities/publication/27e8d743-e430-4d4d-821c-b7a7944607a7,IAS Repository: Coding for A.R.C.,,No explicit open reuse license,locator_only,"It is among the earliest systematic descriptions of mnemonic, assembly-like coding.",A,high,Mnemonic notation should not be conflated with an automatically executing assembler.,assembly|symbolic-code|arc|crystallography
1948-eniac-monte-carlo,1948-04-12,1948,12 Apr 1948 (first run); later 1948 listing,executed,day,high,ENIAC Monte Carlo neutron transport,Los Alamos / University of Pennsylvania,"Simulate neutron propagation with nested loops, branching, and shared subroutines.",science_control,Nuclear physics,Register code and flow diagrams,Modified ENIAC,encoded_instructions,2,transcription,locator_only,,0,Monte Carlo Second Run Code Report,https://eniacinaction.com/docs/MonteCarloSecondRunCodeReport.pdf,https://computerhistory.org/blog/programming-the-eniac-an-example-of-why-computer-history-is-hard/,Computer History Museum: Programming the ENIAC,Second Run listing,Scans reproduced by permission; locator only,locator_only,It was a complex electronic program using recognizable modern control structures for consequential simulation.,A,high,"The surviving listing is a later second run, and any 'first modern code' claim depends on definition.",eniac|monte-carlo|simulation|neutron-transport
1948-manchester-baby-factor,1948-06-21,1948,21 Jun 1948,executed,day,high,Manchester Baby highest-factor program,University of Manchester,Stress-test writable random-access electronic memory with a long factor search.,systems_infrastructure,Computer engineering commissioning,17-instruction binary machine code,SSEM 'Baby',encoded_instructions,2,reconstruction,illustrative,"b = a - 1
while a % b != 0:
    b = b - 1
return b",4,Reconstructed notebook listing on Manchester Digital 60 page,https://curation.cs.manchester.ac.uk/digital60/www.digital60.org/birth/program/firstprog.html,https://curation.cs.manchester.ac.uk/computer50/www.computer50.org/mark1/new.baby.html,University of Manchester: The First Program,Anniversary reconstruction,University copyright; locator only,locator_only,It demonstrated a program executing electronically from writable memory.,A,high,"The original listing was lost; the displayed program was reconstructed, and this excerpt is only algorithmic pseudocode.",stored-program|machine-code|factorization|memory
1949-edsac-squares,1949-05-06,1949,6 May 1949,executed,day,high,EDSAC Initial Orders and squares program,University of Cambridge,Load symbolic orders from paper tape and provide a practical university computing service.,science_control,Scientific computing service,Letter-coded EDSAC orders,EDSAC I,symbolic_text,3,transcription,normalized,"T0S    clear m[0]
H2S    load multiplier register
E6S    jump to main loop
I0S    read next character",4,"Initial Orders annotated listing, locations 0–8",https://www.cl.cam.ac.uk/~mr10/edsacposter.pdf,https://www.cl.cam.ac.uk/relics/elog.html,University of Cambridge: Start of the EDSAC log,1949 order code transcription,University copyright; short normalized excerpt,short_excerpt,EDSAC coupled a compact symbolic order code with the first broadly useful university computing service.,A,high,The log is contemporary; the readable order listing is a later annotated transcription.,edsac|paper-tape|initial-orders|scientific-service
1951-leo-bakery-valuations,1951-11-29,1951,29–30 Nov 1951,executed,range,high,LEO I Bakery Valuations,J. Lyons & Co.,"Produce weekly ingredient, stock, production, and profitability valuations in time for operations.",business_data,Business operations,EDSAC-derived machine instructions and flowcharts,LEO I,encoded_instructions,2,conceptual,unavailable,,0,Early LEO I program archive listing,https://www.computinghistory.org.uk/det/68910/Early-LEO-I-Programs/,https://www.sciencemuseum.org.uk/objects-and-stories/meet-leo-worlds-first-business-computer,Science Museum: Meet LEO,,Museum material; no open code license located,locator_only,"It was the first routine, time-sensitive office application on a stored-program computer.",B,medium,"The operational date is strong, but no verified surviving source listing is attached to this row.",leo|bakery|inventory|business-computing
1954-mark-i-autocode,1954-03-01,1954,Mar 1954,released,month,high,Brooker's Mark I Autocode,University of Manchester,Let scientists and engineers program without base-32 machine details or manual drum transfers.,science_control,Scientific and industrial computing,Mark I Autocode,Ferranti Mark I,high_level_language,4,transcription,illustrative,"n = 100
s = 0
1) s = s + n
n = n - 1
jnz 1",5,Historical Autocode descriptions and examples,https://www.computerconservationsociety.org/resurrection/res45.htm,https://curation.cs.manchester.ac.uk/computer50/www.computer50.org/mark1/gethomas/manchester_autocodes.html,University of Manchester: Manchester Autocodes,,Historical pages; reuse rights unclear,locator_only,"It made a high-level, diagnostic programming system usable by a real scientific and industrial community.",B,high,"The excerpt is illustrative Autocode-like notation, not a verified historical listing.",autocode|compiler|high-level|scientific-computing
1957-flow-matic-file-match,1957-01-01,1957,1957 system; 1958 manual,executed,year,high,FLOW-MATIC inventory and pricing file match,Remington Rand / Grace Hopper's team,Merge inventory and price files and route priced and unpriced business records.,business_data,Business data processing,FLOW-MATIC,UNIVAC I–II,high_level_language,4,facsimile,locator_only,,0,FLOW-MATIC Programming System manual sample,https://www.bitsavers.org/pdf/univac/flow-matic/U1518_FLOW-MATIC_Programming_System_1958.pdf,https://www.computerhistory.org/brochures/doc-4372956d57d94/,Computer History Museum: FLOW-MATIC brochure record,U1518,Sperry Rand copyright; locator only,locator_only,It made restricted English a practical business-programming interface and directly influenced COBOL.,A,high,The system operated in 1957; the surviving manual is dated 1958.,flow-matic|business-language|files|cobol-influence
1957-fortran-matrix-inversion,1957-04-01,1957,Apr 1957 system; example c. 1958,released,month,high,FORTRAN and order-5 matrix inversion,IBM,Translate algebraic scientific programs into code efficient enough to replace hand optimization.,science_control,Numerical engineering,FORTRAN I,IBM 704,high_level_language,4,facsimile,locator_only,,0,"Order-5 matrix inversion source, assembly, output, and compiler summary",https://archive.computerhistory.org/resources/text/Fortran/102679230.05.01.acc.pdf,https://softwarepreservation.computerhistory.org/FORTRAN/,Computer History Museum: History of FORTRAN and FORTRAN II,CHM 102679230,Preservation access; no general open code license,locator_only,FORTRAN showed that readable mathematical notation could compile to near-hand-optimized machine code.,A,high,The surviving example is approximately 1958 and should not be described as the first 1957 FORTRAN program.,fortran|compiler|matrix|optimization
1959-lisp-eval,1959-01-01,1959,1958–1959 work; 1960 paper,approximate,range,medium,LISP eval and programs-as-data,MIT / John McCarthy and collaborators,"Represent and manipulate symbolic expressions, recursive procedures, and programs themselves as data.",ai_automation,Artificial intelligence,LISP,IBM 704,high_level_language,4,conceptual,illustrative,"(defun eval-expr (x env)
  (cond ((atom x) (lookup x env))
        (t (apply (car x)
                  (mapcar eval-expr (cdr x))))))",4,1959 compiler memo and later LISP 1.5 materials,https://softwarepreservation.computerhistory.org/LISP/lisp1.5/Anonymous-The_Compiler_in_Lisp-1959.pdf,https://softwarepreservation.computerhistory.org/LISP/,Computer History Museum: LISP History,,Historical archive; no open license for scan,locator_only,LISP made recursive symbolic structures and the code/data symmetry central programming ideas.,B,medium,"The chronology spans 1958–1960 and the excerpt is modern illustrative Lisp, not a surviving 1959 listing.",lisp|eval|symbolic-ai|programs-as-data
1960-cobol-cross-vendor-demo,1960-12-06,1960,6 Dec 1960,executed,day,high,Cross-vendor COBOL validation program,CODASYL / RCA / Remington Rand,Run the same business-data program on incompatible manufacturers' computers.,business_data,Portable business computing,COBOL,RCA 501 and UNIVAC II,high_level_language,4,facsimile,locator_only,,0,Contemporary compile/run printout,https://americanhistory.si.edu/collections/nmah_1389374,https://archive.computerhistory.org/resources/access/text/2017/10/102639620-05-01-acc.pdf,Computer History Museum: COBOL cross-vendor demonstration history,NMAH 1389374,Smithsonian usage conditions; code rights unclear,locator_only,It demonstrated machine-independent business software across competing hardware vendors.,A,high,"The surviving artifact is a program printout, not compiler source.",cobol|portability|business|standardization
1961-ctss-time-sharing,1961-11-01,1961,Nov 1961 system; 1970–1972 source snapshots,executed,month,high,CTSS supervisor and interactive commands,MIT,"Let many people edit, run, and manage files interactively instead of waiting for batch jobs.",systems_infrastructure,Operating systems,FAP and MAD,IBM 7094,symbolic_text,3,original,locator_only,,0,COMC8G.txt and CTSS source archive,https://people.csail.mit.edu/saltzer/Multics/CTSS-Documents/ctss-source-files/,https://www.csail.mit.edu/ctss-documents,MIT CSAIL: CTSS documents,MIT8B3 / MIT8C0 backup snapshots,Archival source; reuse terms unclear,locator_only,"CTSS established interactive login, per-user files, editing, and a lineage leading to modern shared computing.",A,high,"The readable source snapshots date from 1970–1972, not the initial 1961 system.",ctss|time-sharing|interactive|operating-system
1963-sketchpad,1963-01-01,1963,1963,published,year,high,Sketchpad,MIT Lincoln Laboratory / Ivan Sutherland,"Create, edit, copy, and geometrically constrain engineering drawings directly on a display.",interaction_applications,CAD and interactive graphics,TX-2 assembly,Lincoln TX-2,symbolic_text,3,facsimile,locator_only,,0,Scanned TX-2 source listing,https://www.computerhistory.org/collections/catalog/102726903,https://computerhistory.org/blog/the-remarkable-ivan-sutherland/,Computer History Museum: The Remarkable Ivan Sutherland,CHM 102726903,Archival material; reuse rights unclear,locator_only,"It introduced direct manipulation, constraints, instances, and core ideas of computer-aided design.",A,high,The code is assembly even though the user-facing interaction was graphical.,sketchpad|cad|graphics|direct-manipulation
1965-eliza-doctor,1965-01-01,1965,1965,authored,year,high,Original ELIZA and DOCTOR script,MIT / Joseph Weizenbaum,Build a reusable pattern-transformation engine and configure a conversational persona separately.,ai_automation,Conversational AI and HCI,MAD-SLIP and script rules,MIT CTSS / IBM 7094,high_level_language,4,transcription,illustrative,"keyword: MOTHER
transform: * MOTHER *
reply: TELL ME MORE ABOUT YOUR FAMILY
otherwise: PLEASE GO ON",4,Original scan and MAD-SLIP transcription,https://github.com/jeffshrager/elizagen.org/blob/master/1965_Weizenbaum_MAD-SLIP/MAD-SLIP_transcription.txt,https://sites.google.com/view/elizagen-org/original-eliza,ELIZA Archaeology: Original ELIZA,1965 scan transcription,CC0 with estate permission,public_domain,ELIZA separated a general interpreter from a domain script and made conversational behavior inspectable as rules.,A,high,The included snippet illustrates the rule shape; use the scan/transcription for exact text.,eliza|conversation|pattern-matching|script
1968-bcpl-compiler,1968-02-01,1968,1967–Jun 1968,authored,range,high,BCPL compiler on CTSS,University of Cambridge / MIT,"Build compact, portable systems software without rewriting an entire compiler for each machine.",systems_infrastructure,Compilers and system software,BCPL and assembly,MIT CTSS,high_level_language,4,reconstruction,locator_only,,0,Reconstruction from 1968 printed listing,https://softwarepreservation.computerhistory.org/BCPL/,https://softwarepreservation.computerhistory.org/BCPL/,Computer History Museum: BCPL historical archive,1968 listing reconstruction,Verify archive README before excerpting,locator_only,BCPL made compact self-hosting systems code portable and directly influenced B and C.,B,high,The usable tree is explicitly a reconstruction from a contemporary listing.,bcpl|compiler|systems-language|portability
1969-apollo-guidance-computer,1969-07-20,1969,20 Jul 1969 mission,executed,day,high,Apollo 11 Guidance Computer flight software,MIT Instrumentation Laboratory / NASA,"Perform real-time guidance, navigation, landing, restart, and alarm handling in extremely limited memory.",science_control,Safety-critical aerospace,AGC assembly and interpretive code,Apollo Guidance Computer,symbolic_text,3,transcription,locator_only,,0,Luminary099/ALARM_AND_ABORT.agc,https://github.com/chrislgarry/Apollo-11/blob/master/Luminary099/ALARM_AND_ABORT.agc,https://science.nasa.gov/people/margaret-hamilton/,NASA Science: Margaret Hamilton and Apollo code,Luminary 099 / Comanche 055 transcription,Public-domain Apollo materials; volunteer transcription,public_domain,The software safely prioritized critical real-time work and helped land humans on the Moon.,A,high,The GitHub form is a later machine-readable transcription checked against MIT Museum scans.,apollo|real-time|guidance|safety-critical
1971-unix-v1-kernel,1971-11-03,1971,3 Nov 1971 tree,authored,day,high,First Edition UNIX kernel,Bell Labs,"Provide a small multiuser operating system with processes, files, and composable tools.",systems_infrastructure,Operating systems,PDP-11 assembly,PDP-11/20,symbolic_text,3,transcription,locator_only,,0,"V1 tree, e.g. u0.s",https://www.tuhs.org/cgi-bin/utree.pl?file=V1,https://computerhistory.org/blog/the-earliest-unix-code-an-anniversary-source-code-release/,Computer History Museum: The earliest UNIX code,V1 paper-listing transcription,Historical UNIX source terms; verify before reuse,locator_only,"Its process and filesystem model became the lineage behind Unix, POSIX, Linux, and macOS.",A,high,The browsable tree was transcribed/OCRed from a paper listing.,unix|kernel|processes|filesystem
1972-smalltalk-72,1972-01-01,1972,1972,authored,year,high,Smalltalk-72 live environment,Xerox PARC,Create a child-friendly personal computing environment built from message-passing objects.,interaction_applications,Object-oriented programming and GUI,Smalltalk-72,Xerox Alto,high_level_language,4,original,locator_only,,0,Original executable save image in Smalltalk Zoo,https://smalltalkzoo.computerhistory.org/,https://computerhistory.org/blog/introducing-the-smalltalk-zoo-48-years-of-smalltalk-history-at-chm/,Computer History Museum: Smalltalk Zoo,Smalltalk-72 save image,Xerox/PARC archival terms,locator_only,Smalltalk's pure object model and live graphical environment shaped modern OOP and desktop interfaces.,A,high,"The primary artifact is a save image, so line-based comparison requires an export or decompilation step.",smalltalk|objects|live-programming|gui
1973-arpanet-imp,1973-01-01,1973,1973 source version,authored,year,high,ARPANET IMP packet-switch code,BBN,Route and store-and-forward packets reliably between heterogeneous host computers.,systems_infrastructure,Networking,Modified MIDAS assembly,Honeywell 516/316 IMP,symbolic_text,3,transcription,locator_only,,0,Ready-for-assembly listing and original scan,https://www.walden-family.com/impcode/,https://www.walden-family.com/impcode/,ARPANET IMP code preservation project,1973 IMP source listing,BBN archival copyright unclear,locator_only,The IMP implemented the router-like packet-switching core of the ARPANET.,A,high,"This is the 1973 code, not the original 1969 IMP version.",arpanet|packet-switching|router|networking
1975-cpm-pre-version,1975-01-01,1975,1975 pre-version; 1976 v1.3,released,range,high,CP/M pre-version and BIOS boundary,Digital Research / Gary Kildall,Make floppy-disk software portable across small Intel microcomputers by isolating device I/O.,systems_infrastructure,Microcomputer operating systems,Intel 8080 assembly,Intel 8080 systems,symbolic_text,3,facsimile,locator_only,,0,CHM early CP/M source release,https://computerhistory.org/blog/early-digital-research-cpm-source-code/,https://computerhistory.org/press-releases/cp-m-release/,Computer History Museum: Early Digital Research CP/M source,pre-version / v1.3,Historical noncommercial source license,permission_specific,CP/M's BIOS separation made a common application platform practical across early microcomputers.,A,high,The preserved releases span 1975–1976 and v1.3 includes reverse-engineered annotations.,cpm|bios|microcomputer|portability
1982-tex82,1982-01-01,1982,1982 canonical rewrite,released,year,high,TeX82 literate source,Donald Knuth / Stanford University,"Produce deterministic, high-quality mathematical and scientific typesetting across machines.",interaction_applications,Scientific publishing,WEB (Pascal plus literate documentation),Portable,high_level_language,4,original,locator_only,,0,tex.web; line history in tex82.bug,https://mirrors.ctan.org/systems/knuth/dist/tex/tex.web,https://cs.stanford.edu/~knuth/abcde.html,Donald Knuth: TeX and METAFONT sources,Canonical TeX82 source with later fixes,"Knuth license; unchanged redistribution permitted, modified versions renamed",permission_specific,TeX transformed technical publishing and made literate programming a durable engineering practice.,A,high,The current canonical file includes later sanctioned fixes; date individual lines with tex82.bug.,tex|typesetting|literate-programming|publishing
1982-msdos-125,1982-05-01,1982,1982,released,year,high,MS-DOS 1.25 source,Microsoft,Provide a bootable 8086 PC operating system with FAT files and command execution for compatible business computers.,systems_infrastructure,Personal-computer operating systems,8086 assembly,IBM-compatible PC,symbolic_text,3,original,locator_only,,0,v1.25/source,https://github.com/microsoft/MS-DOS/tree/main/v1.25/source,https://computerhistory.org/blog/microsoft-ms-dos-early-source-code/,Computer History Museum: Microsoft MS-DOS early source,v1.25,MIT,short_excerpt,It established the dominant PC software platform and API lineage of its era.,A,high,"This is MS-DOS 1.25, not IBM PC DOS 1.0.",ms-dos|pc|fat|operating-system
1984-postscript,1984-02-29,1984,Late Feb 1984 snapshot,authored,year,high,Early Adobe PostScript interpreter,Adobe,Describe pages independently of a printer and rasterize the same document on different devices.,business_data,Desktop publishing and printing,C and PostScript,Workstation and printer interpreter,high_level_language,4,original,locator_only,,0,Mostly complete Feb 1984 source snapshot,https://computerhistory.org/blog/postscript-a-digital-printing-press/,https://computerhistory.org/press-releases/computer-history-museum-makes-adobe-postscripts-source-code-available-to-the-public-as-a-part-of-its-art-of-code-series/,Computer History Museum: PostScript source release,Feb 1984 snapshot,Adobe/CHM research-only historical release,permission_specific,Device-independent page programs enabled desktop publishing and directly influenced PDF.,A,high,Some low-level graphics modules were excluded from the historical release.,postscript|printing|page-description|desktop-publishing
1984-macpaint-quickdraw,1984-04-01,1984,Apr 1984 surviving version,released,year,high,MacPaint 1.3 and QuickDraw,Apple,Deliver responsive bitmap drawing and a graphical desktop within 128 KB of memory.,interaction_applications,Graphics and productivity,Apple Pascal and Motorola 68000 assembly,Apple Macintosh,high_level_language,4,original,locator_only,,0,MacPaint 1.3 and QuickDraw historical source package,https://computerhistory.org/blog/macpaint-and-quickdraw-source-code/,https://computerhistory.org/blog/macpaint-and-quickdraw-source-code/,Computer History Museum: MacPaint and QuickDraw source,MacPaint 1.3,Apple/CHM noncommercial historical-source terms,permission_specific,The application and raster engine became canonical examples of direct-manipulation graphics software.,A,high,"The released tree is v1.3, not the January 1984 v1.0.",macpaint|quickdraw|gui|bitmap
1985-gnu-emacs,1985-03-20,1985,20 Mar 1985 public project; v16.56 archived tree,released,year,high,GNU Emacs,GNU Project,"Create a portable, programmable, self-documenting editing and development environment.",interaction_applications,Developer tooling,C and Emacs Lisp,Unix workstations,library_framework,5,original,locator_only,,0,Archived v16.56 release tree,https://softwarepreservation.computerhistory.org/emacs/,https://www.gnu.org/software/emacs/history.html,GNU: Emacs history,v16.56 archive,Historical GNU copyleft terms; verify bundled COPYING,permission_specific,Emacs became an enduring model for an editor whose behavior is a programmable platform.,A,high,The v13 public announcement is not itself a complete verified tree; v16.56 is the exact archived artifact.,emacs|editor|elisp|extensible
1987-gcc-1,1987-05-23,1987,23 May 1987 v1.0,released,year,high,GCC 1.0,GNU Project,"Provide a free, portable, optimizing C compiler capable of bootstrapping a free operating system.",systems_infrastructure,Compilers and platform engineering,C,Multiple Unix hosts and targets,high_level_language,4,original,locator_only,,0,gcc-0.9 / GCC 1.0 release tarballs,https://gcc.gnu.org/pub/gcc/old-releases/gcc-1/gcc-0.9.tar.bz2,https://gcc.gnu.org/releases.html,GCC release timeline,GCC 0.9 / 1.0,Historical GNU copying terms in release,permission_specific,"GCC made a free, portable systems toolchain practical and later became core open-source infrastructure.",A,high,The exact release predates today's GPLv3; inspect its bundled terms before excerpting.,gcc|compiler|gnu|toolchain
1991-worldwideweb-browser,1991-01-01,1991,1990–1991; earliest surviving v0.15,authored,year,high,WorldWideWeb browser/editor,CERN / Tim Berners-Lee,Browse and edit a global linked information space in one application.,interaction_applications,The Web,Objective-C,NeXTSTEP,library_framework,5,original,locator_only,,0,WorldWideWeb 0.15 restored source,https://github.com/cynthia/WorldWideWeb,https://worldwideweb.cern.ch/code/,CERN: WorldWideWeb source archaeology,v0.15,CERN released core Web software to the public domain in 1993; inspect bundled extras,public_domain,"It embodied URL, HTTP, HTML, and a read-write Web in a single program.",A,high,"The lost October 1990 original is not the surviving v0.15 snapshot, which required restoration.",web|browser|editor|http
1991-python-091,1991-02-20,1991,20 Feb 1991 announcement,released,year,high,Python 0.9.1,CWI / Guido van Rossum,"Make rapid systems and application scripting readable, extensible, and productive.",systems_infrastructure,Programming language productivity,C interpreter and Python library,Unix-era systems,high_level_language,4,reconstruction,illustrative,"def greet(name):
    print('Hello', name)

for name in names: greet(name)",4,Pristine Usenet shar parts; assembled reconstruction,https://www.tuhs.org/Usenet/alt.sources.d/1991-February/000557.html,https://www.python.org/download/releases/2.6.9/license/,Python license history,0.9.1 shar archive,CWI permissive license,short_excerpt,"Python's readable high-level interface became central to automation, data work, science, and AI.",B,medium,The assembled GitHub tree contains reconstruction tweaks; the included snippet is illustrative modern Python.,python|scripting|readability|automation
1991-linux-001,1991-09-17,1991,17 Sep 1991 v0.01,released,year,high,Linux kernel 0.01,Linus Torvalds,Build a freely shareable Unix-like kernel for affordable i386 personal computers.,systems_infrastructure,Operating systems,C and x86 assembly,i386 AT,high_level_language,4,original,locator_only,,0,Historic linux-0.01 tree,https://kernel.googlesource.com/pub/scm/linux/kernel/git/nico/archive/+/v0.01,https://www.kernel.org/pub/linux/kernel/Historic/linux-0.01.tar.gz,kernel.org historic Linux archive,v0.01,Original v0.01 noncommercial redistribution terms,permission_specific,"This small kernel seeded Linux across servers, cloud, Android, and embedded systems.",A,high,Linux 0.01 was not GPL; the GPL switch came later at 0.12.,linux|kernel|i386|open-source
1993-ncsa-mosaic,1993-01-23,1993,1992–1993,released,year,high,NCSA Mosaic for X,NCSA / University of Illinois,Make the Web approachable through a graphical browser with inline images.,interaction_applications,Web browsing,C,X11/Motif Unix workstations,library_framework,5,original,locator_only,,0,NCSA Mosaic born-digital collection,https://archon.library.illinois.edu/archives/?id=9866&p=digitallibrary%2Fdigitalcontent,https://www.w3.org/History/1993/WWW/XMosaic/,W3C historical XMosaic page,Collection spans ca. 1992–1995,Historical NCSA terms; not the later OSI NCSA license,permission_specific,Mosaic popularized graphical Web browsing and seeded the commercial browser ecosystem.,A,high,Pin an individual file timestamp and version before extracting code.,mosaic|browser|web|inline-images
1994-postgres-42,1994-06-01,1994,Jun 1994 v4.2,released,year,high,POSTGRES 4.2,"University of California, Berkeley","Store complex data using extensible types, rules, and object-relational behavior.",business_data,Databases,C,Unix,library_framework,5,original,locator_only,,0,POSTGRES 4.2 source and RCS history,https://dsf.berkeley.edu/postgres-v4r2/,https://www.postgresql.org/docs/current/history.html,PostgreSQL official history,v4.2,Berkeley/BSD-style terms; verify bundled COPYRIGHT,short_excerpt,It is a directly preserved ancestor of PostgreSQL and a landmark in extensible database architecture.,A,high,"1994 dates this exact v4.2 artifact, not the project's 1986 inception.",postgres|database|object-relational|extensible
1998-apache-httpd-130,1998-06-06,1998,6 Jun 1998 v1.3.0,released,year,high,Apache HTTP Server 1.3.0,Apache Group,Serve production websites robustly through a portable and modular open infrastructure project.,systems_infrastructure,Web infrastructure,C,Unix and ports,library_framework,5,original,locator_only,,0,Official apache_1.3.0 source tar,https://archive.apache.org/dist/httpd/apache_1.3.0.tar.Z,https://httpd.apache.org/ABOUT_APACHE,Apache HTTP Server project history,1.3.0,Apache License 1.0-era terms in tar,short_excerpt,Apache became the leading Web server and a model for open collaborative infrastructure.,A,high,The project began earlier; 1998 is chosen for the directly preserved official 1.3.0 release.,apache|http|web-server|open-source
2000-ant-buildxml,2000-07-18,2000,"18 Jul 2000, Ant 1.1",released,year,high,Apache Ant build.xml,Apache Software Foundation,Make Java builds repeatable and portable instead of encoding them in platform-specific shell commands.,systems_infrastructure,Build automation,XML build DSL,JVM,declarative_configuration,6,original,exact,"<project name=""Ant"" default=""main"" basedir=""."">
  <target name=""prepare"">
    <mkdir dir=""${build.dir}""/>
  </target>",4,build.xml at pinned revision,https://github.com/apache/ant/blob/5b11971b96a39668b89d0210ac6e8c00032995a1/build.xml,https://ant.apache.org/manual/index.html,Apache Ant manual,5b11971b96a39668b89d0210ac6e8c00032995a1,Apache Software License 1.1-era source,short_excerpt,"Ant popularized a portable, declarative build graph for large JVM projects.",A,high,"The tag crossed CVS, SVN, and Git migrations; preserve the pinned SHA and migration provenance.",ant|build|xml|declarative
2003-memcached-initial,2003-05-27,2003,27 May 2003,authored,year,high,memcached initial server,LiveJournal / Brad Fitzpatrick,Relieve database load for high-traffic dynamic web services using a distributed in-memory cache.,systems_infrastructure,Web-scale caching,C,Unix and libevent,high_level_language,4,original,exact,"enum conn_states {
    conn_listening,
    conn_read,
    conn_write,
};",5,memcached.c in initial commit,https://github.com/memcached/memcached/blob/32f382b605b4565bddfae5c9d082af3bfd30cf02/memcached.c,https://github.com/memcached/memcached,Official memcached repository,32f382b605b4565bddfae5c9d082af3bfd30cf02,BSD-3-Clause,short_excerpt,memcached made scale-out caching a standard architecture for dynamic Web businesses.,A,high,"The excerpt shows the event-driven connection state machine, not the entire distributed-cache behavior.",memcached|cache|scaling|web
2004-google-mapreduce,2004-12-01,2004,OSDI 2004,published,year,high,MapReduce word-count mapper and reducer,Google Research,"Process multi-terabyte datasets across commodity clusters while the runtime handles partitioning, scheduling, and failures.",business_data,Distributed data processing,C++-like pseudocode and runtime API,Google cluster runtime,library_framework,5,transcription,illustrative,"map(document): emit(word, 1)

reduce(word, counts):
    emit(word, sum(counts))",4,Word-count example in MapReduce paper,https://research.google/pubs/mapreduce-simplified-data-processing-on-large-clusters/,https://research.google/pubs/mapreduce-simplified-data-processing-on-large-clusters/,Google Research: MapReduce,OSDI 2004 paper,Paper copyright; production implementation not released,locator_only,"MapReduce compressed distributed scheduling, communication, and failure recovery into two user-defined functions.",A,high,"The code is normalized paper pseudocode, not Google's production source.",mapreduce|distributed|big-data|fault-tolerance
2005-rails-100,2005-12-13,2005,"13 Dec 2005, Rails 1.0",released,year,high,Ruby on Rails 1.0 ActionController,Ruby on Rails,Deliver database-backed business Web applications rapidly with conventional structure and less configuration.,interaction_applications,Web application development,Ruby,Web MVC framework,library_framework,5,original,illustrative,"class ProductsController < ApplicationController
  def show
    @product = Product.find(params[:id])
  end
end",5,ActionController base documentation at v1.0.0,https://github.com/rails/rails/blob/v1.0.0/actionpack/lib/action_controller/base.rb,https://rubyonrails.org/2005/12/13/rails-1-0-party-like-it-s-one-oh-oh,Official Rails 1.0 announcement,v1.0.0 / 37e0d5d,MIT,short_excerpt,Rails popularized convention over configuration and a compact full-stack MVC workflow.,A,high,The example is framework-idiomatic and illustrative; tag metadata was migrated later.,rails|mvc|web|convention
2006-hadoop-010,2006-04-01,2006,"1 Apr 2006, Hadoop 0.1.0",released,year,high,Hadoop 0.1.0 WordCount,Apache Hadoop,Make distributed storage and MapReduce-style data processing available outside Google.,business_data,Distributed data platforms,Java,Commodity clusters,library_framework,5,original,locator_only,,0,src/examples/org/apache/hadoop/examples/WordCount.java in 0.1.0 tar,https://archive.apache.org/dist/hadoop/common/,https://hadoop.apache.org/docs/r3.1.1/hadoop-project-dist/hadoop-common/release/0.1.0/CHANGES.0.1.0.html,Apache Hadoop 0.1.0 changelog,hadoop-0.1.0.tar.gz,Apache-2.0,short_excerpt,Hadoop operationalized the distributed-file and MapReduce pattern for the broader software industry.,A,medium,Confirm the exact example path and record the source tar checksum during ingestion.,hadoop|mapreduce|distributed-storage|big-data
2008-android-helloactivity,2008-12-19,2008,19 Dec 2008 public commit; file copyright 2007,authored,year,high,Android HelloActivity,Android Open Source Project,Package a touch-oriented mobile interface around an application lifecycle and system-managed components.,interaction_applications,Mobile applications,Java,Android,library_framework,5,original,exact,"public class HelloActivity extends Activity {
  public void onCreate(Bundle savedInstanceState) {
    super.onCreate(savedInstanceState);
    setContentView(view);",4,HelloActivity.java at pinned AOSP revision,https://github.com/aosp-mirror/platform_development/blob/303a8c73c94b56e118680ce4b2e081557b1d876a/samples/HelloActivity/src/com/example/android/helloactivity/HelloActivity.java,https://android.googlesource.com/platform/development/,Android Open Source Project development tree,303a8c73c94b56e118680ce4b2e081557b1d876a,Apache-2.0,short_excerpt,The tiny lifecycle example represents the framework-managed mobile application model that reached billions of devices.,A,high,"The public commit is from 2008, while the source header dates the file to 2007.",android|mobile|activity|lifecycle
2009-bitcoin-015,2009-01-08,2009,2009 v0.1 lineage,released,year,high,Bitcoin v0.1 transaction and block processing,Bitcoin / Satoshi Nakamoto,Transfer value peer-to-peer without a central clearing party while preventing double spending.,business_data,Distributed ledger and payments,C++,Peer-to-peer network,high_level_language,4,original,locator_only,,0,main.cpp at v0.1.5 historical revision,https://github.com/bitcoin/bitcoin/blob/8dca7864f793072701f810e4c5ea12a6e1087085/main.cpp,https://bitcoin.org/bitcoin.pdf,Bitcoin: A Peer-to-Peer Electronic Cash System,8dca7864f793072701f810e4c5ea12a6e1087085,MIT,short_excerpt,"The source combined proof of work, replicated validation, and transaction rules into an executable payment network.",A,medium,Historical import metadata can differ from original authorship time; preserve release files and commit timestamps separately.,bitcoin|payments|blockchain|peer-to-peer
2010-node-020,2010-08-20,2010,"20 Aug 2010, Node 0.2.0",released,year,high,Node.js HTTP server example,Node.js,Handle many concurrent network connections with nonblocking I/O in a mainstream Web language.,systems_infrastructure,Server-side Web development,JavaScript,V8 and event-loop runtime,library_framework,5,original,normalized,"var http = require('http');
http.createServer(function (req, res) {
  res.end('Hello World\n');
}).listen(8124);",4,README.md at v0.2.0,https://github.com/nodejs/node/blob/v0.2.0/README.md,https://nodejs.org/en/blog/release/v0.2.0,Official Node.js v0.2.0 release,v0.2.0,MIT plus bundled dependency notices,short_excerpt,Node made event-loop concurrency legible in a few lines and moved JavaScript to the server.,A,high,The excerpt is whitespace-normalized from the release README example.,nodejs|javascript|nonblocking-io|server
2013-docker-040,2013-06-03,2013,"3 Jun 2013, Docker 0.4.0",released,year,high,Docker 0.4.0 Dockerfile builder,Docker / dotCloud,Package an application and its runtime dependencies reproducibly for movement between development and production.,systems_infrastructure,Containers and software delivery,Dockerfile DSL and Go,Linux containers,declarative_configuration,6,original,locator_only,,0,Dockerfile at v0.4.0,https://github.com/moby/moby/blob/a8ae398bf52e97148ee7bd0d5868de2e15bd297f/Dockerfile,https://docs.docker.com/engine/release-notes/prior-releases/,Docker prior release notes,a8ae398bf52e97148ee7bd0d5868de2e15bd297f,Apache-2.0 at revision,short_excerpt,"The Dockerfile made deployable environments versioned, repeatable artifacts and tightened dev/prod parity.",A,high,"This pins a directly preserved release, not the first internal container prototype.",docker|containers|deployment|dockerfile
2014-kubernetes-pod,2014-06-06,2014,6 Jun 2014 public repo; 29 Oct pinned sample,released,year,high,Kubernetes Pod desired-state declaration,Google / Kubernetes,"Schedule, heal, expose, and scale containerized applications across a machine fleet.",systems_infrastructure,Cluster orchestration,JSON declarative API and Go control plane,Container clusters,declarative_configuration,6,original,illustrative,"{
  ""id"": ""redis-master"",
  ""desiredState"": { ""manifest"": { ... } }
}",4,api/examples/pod.json or guestbook redis-master.json at v0.4.2,https://github.com/kubernetes/kubernetes/blob/2902951c445da6e6ead9e406b3c8e19bc28c2b4a/api/examples/pod.json,https://kubernetes.io/blog/2018/06/06/4-years-of-k8s/,Kubernetes: Four years of Kubernetes,2902951c445da6e6ead9e406b3c8e19bc28c2b4a,Apache-2.0,short_excerpt,Kubernetes turned cluster operations into a reconciled desired-state API.,A,high,The snippet is a compact illustration of the early schema; distinguish the first-public date from the pinned sample date.,kubernetes|orchestration|desired-state|containers
2014-terraform-010,2014-07-28,2014,"2014, Terraform 0.1.0",released,year,high,Terraform 0.1.0 infrastructure declaration,HashiCorp,"Version, plan, graph, and safely change cloud infrastructure across providers.",systems_infrastructure,Infrastructure as code,Terraform HCL,Multi-cloud,declarative_configuration,6,original,exact,"resource ""aws_instance"" ""foo"" {
}
resource ""aws_instance"" ""bar"" {
}",4,terraform/test-fixtures/apply-minimal/main.tf at v0.1.0,https://github.com/hashicorp/terraform/blob/v0.1.0/terraform/test-fixtures/apply-minimal/main.tf,https://github.com/hashicorp/terraform/blob/v0.1.0/README.md,Terraform v0.1.0 README,fd88908 / v0.1.0,MPL-2.0 at this historical revision,short_excerpt,"Terraform made vendor-neutral desired infrastructure, a change plan, and graph-based execution mainstream.",A,high,Do not apply the project's later Business Source License retroactively to this MPL-licensed revision.,terraform|infrastructure-as-code|cloud|plan
2015-tensorflow-050,2015-11-09,2015,9 Nov 2015 initial public release,released,year,high,TensorFlow 0.5.0 computation graph,Google,"Express and execute machine-learning computation graphs across CPUs, GPUs, and distributed runtimes.",ai_automation,Deep-learning infrastructure,Python API and C++ runtime,CPU/GPU/distributed systems,library_framework,5,original,locator_only,,0,MNIST-from-scratch notebook cells at initial release,https://github.com/tensorflow/tensorflow/blob/b2dc60eaa9c00421293b87824a2047fdcf6fa331/tensorflow/tools/docker/notebooks/3_mnist_from_scratch.ipynb,https://blog.tensorflow.org/2022/10/building-the-future-of-tensorflow.html,TensorFlow blog: Building the future of TensorFlow,b2dc60eaa9c00421293b87824a2047fdcf6fa331 / 0.5.0,Apache-2.0,short_excerpt,TensorFlow mainstreamed production-scale differentiable programming and accelerator-backed deep learning.,A,high,Notebook extraction should preserve cell index or cell ID as the snippet locator.,tensorflow|deep-learning|computation-graph|gpu
2017-transformer-tensor2tensor,2017-06-15,2017,15 Jun 2017,authored,year,high,Tensor2Tensor Transformer implementation,Google Brain,Model and translate sequences using attention without recurrent networks.,ai_automation,Machine learning architecture,Python and TensorFlow,Accelerators,library_framework,5,original,locator_only,,0,tensor2tensor/models/transformer.py at initial push,https://github.com/tensorflow/tensor2tensor/blob/3d9c62f2aca9492db5c22676416974005b9dcbae/tensor2tensor/models/transformer.py,https://arxiv.org/abs/1706.03762,Attention Is All You Need,3d9c62f2aca9492db5c22676416974005b9dcbae,Apache-2.0,short_excerpt,This implementation embodied the architecture that later underpinned foundation models and LLMs.,A,high,The paper and code dates are close but should remain separate provenance fields in a full corpus.,transformer|attention|sequence-model|foundation-model
2018-bert-initial,2018-10-31,2018,31 Oct 2018,released,year,high,BERT run_classifier.py,Google Research,Adapt one pretrained bidirectional language representation to many classification tasks with small task heads.,ai_automation,Natural-language processing,Python and TensorFlow,GPU/TPU,library_framework,5,original,locator_only,,0,run_classifier.py at initial release,https://github.com/google-research/bert/blob/fe354751d7de010f60d362ae8d9343849ec39456/run_classifier.py,https://research.google/blog/open-sourcing-bert-state-of-the-art-pre-training-for-natural-language-processing/,Google Research: Open-sourcing BERT,fe354751d7de010f60d362ae8d9343849ec39456,Apache-2.0,short_excerpt,BERT standardized the pretrain-then-finetune workflow across practical NLP tasks.,A,high,"The source shows a task-specific fine-tuning pipeline, not the entire pretraining system.",bert|pretraining|nlp|fine-tuning
2019-openai-gpt2,2019-02-11,2019,11 Feb 2019,released,year,high,OpenAI GPT-2 model implementation,OpenAI,Use one pretrained Transformer as a general language model whose behavior can be conditioned by text context.,ai_automation,Generative language models,Python and TensorFlow,Accelerators,library_framework,5,original,locator_only,,0,src/model.py at initial commit,https://github.com/openai/gpt-2/blob/c2dae27c1029770cea40978813f17a5fd545b883/src/model.py,https://developers.openai.com/,OpenAI Developers,c2dae27c1029770cea40978813f17a5fd545b883,MIT,short_excerpt,GPT-2 made the shift from task-specific NLP systems toward prompt-conditioned general text generation visible in code.,A,high,Use the pinned repository and original release material for detailed model provenance.,gpt2|language-model|generation|prompting
2021-openai-humaneval,2021-07-08,2021,8 Jul 2021,released,year,high,HumanEval natural-language-to-code tasks,OpenAI,Measure whether a model can turn a Python signature and docstring into working code that passes executable tests.,ai_automation,Code generation and evaluation,"Natural-language docstrings, Python, and tests",Codex research evaluation,natural_language,7,original,normalized,"def has_close_elements(numbers, threshold):
    """"""Return True if any two numbers are closer
    than the threshold.""""""",3,HumanEval task corpus and evaluator,https://github.com/openai/human-eval/blob/463c980b59e818ace59f6f9803cd92c749ceae61/human_eval/data.py,https://arxiv.org/abs/2107.03374,Evaluating Large Language Models Trained on Code,463c980b59e818ace59f6f9803cd92c749ceae61,MIT,short_excerpt,HumanEval made natural-language programming measurable through executable tests rather than visual plausibility.,A,high,Generated completions are untrusted code; the evaluator warns that execution requires a robust sandbox.,humaneval|codex|code-generation|evaluation
2023-autogen-020,2023-11-24,2023,"24 Nov 2023, AutoGen 0.2.0",released,year,high,AutoGen multi-agent conversation,Microsoft Research,"Coordinate LLM agents, humans, and code execution to complete multi-step work.",ai_automation,Agent orchestration,Python plus natural-language agent instructions,LLM APIs and tool execution,natural_language,7,original,illustrative,"assistant = AssistantAgent(name=""assistant"")
user = UserProxyAgent(name=""user"")
user.initiate_chat(assistant,
    message=""Analyze the data and write the code."")",4,README agent-pair example at v0.2.0,https://github.com/microsoft/autogen/blob/d8d05279a5e4bde4bc618f2c0117e78b1d135312/README.md,https://www.microsoft.com/en-us/research/project/autogen/,Microsoft Research: AutoGen,d8d05279a5e4bde4bc618f2c0117e78b1d135312,MIT at revision,short_excerpt,"AutoGen codified conversation, handoff, and tool execution as a programmable multi-agent workflow.",A,high,The excerpt is compact illustrative usage; AutoGen's spin-off date differs from the older FLAML repository history.,autogen|agents|conversation|tools
2024-openai-swarm-handoff,2024-10-10,2024,10 Oct 2024,released,year,high,OpenAI Swarm agent handoff,OpenAI,Express a lightweight transfer of control between specialized language-model agents.,ai_automation,Agent orchestration,Python plus natural-language instructions,OpenAI API,natural_language,7,original,exact,"def transfer_to_agent_b():
    return agent_b

agent_a = Agent(functions=[transfer_to_agent_b])",4,examples/basic/agent_handoff.py at initial commit,https://github.com/openai/swarm/blob/e5eabc6f0bdc5193d8342b6d0cafa1073632870a/examples/basic/agent_handoff.py,https://developers.openai.com/,OpenAI Developers,e5eabc6f0bdc5193d8342b6d0cafa1073632870a,MIT,short_excerpt,Swarm made an agent handoff visible as a tiny programming primitive and helped clarify later agent SDK patterns.,A,high,The repository describes Swarm as educational and experimental; it was superseded by production SDK work.,swarm|agents|handoff|orchestration
2025-openai-agents-sdk,2025-03-11,2025,11 Mar 2025,released,year,high,OpenAI Agents SDK hello-world agent,OpenAI,"Run an instruction-driven agent with tools, handoffs, guardrails, sessions, and tracing.",ai_automation,Production agent applications,Python plus natural-language instructions,OpenAI API,natural_language,7,original,exact,"agent = Agent(
  name=""Assistant"",
  instructions=""You are a helpful assistant"")
result = Runner.run_sync(agent, ""Write a haiku about recursion"")",4,examples/basic/hello_world.py at initial commit,https://github.com/openai/openai-agents-python/blob/aaec57a426b35079480d96cef473a7494c95b0ad/examples/basic/hello_world.py,https://developers.openai.com/,OpenAI Developers: Agents and tools documentation,aaec57a426b35079480d96cef473a7494c95b0ad,MIT,short_excerpt,Natural-language instructions become a first-class executable control surface alongside typed tools and runtime safeguards.,A,high,"The two-line experience hides a substantial model, tool, state, and tracing runtime.",agents-sdk|instructions|tools|guardrails
2026-openai-symphony-workflow,2026-04-27,2026,4 Mar source; 27 Apr 2026 announcement,released,year,high,OpenAI Symphony WORKFLOW.md,OpenAI,"Turn issue-tracker work into isolated, autonomous coding-agent runs governed by versioned repository policy.",ai_automation,Autonomous software engineering,Markdown natural-language policy and YAML configuration,Codex app-server and Symphony orchestrator,natural_language,7,prompt,illustrative,"Pick one ready issue.
Create an isolated workspace.
Implement the change and run the required checks.
Report evidence, caveats, and the handoff.",4,elixir/WORKFLOW.md at initial revision; SPEC.md for semantics,https://github.com/openai/symphony/blob/fa75ec68c23fbf773c43197da618f88684d8d3f6/elixir/WORKFLOW.md,https://developers.openai.com/,OpenAI Developers: Codex workflows and engineering automation,fa75ec68c23fbf773c43197da618f88684d8d3f6,Apache-2.0,short_excerpt,"A repository-versioned prose policy now governs workspace setup, agent work, validation, and handoff—the clearest endpoint of natural language as program in this seed.",A,high,The excerpt is an illustrative condensation; the project is an engineering preview intended for trusted environments.,symphony|codex|workflow|natural-language-programming