I hereby claim:
- I am usinglight on github.
- I am stefanst (https://keybase.io/stefanst) on keybase.
- I have a public key ASBYvJSaa-PoPywKEqNgXS_PVDV2h8ZW6S77P6Ug6yRG0Qo
To claim this, I am signing this object:
usinglight
/ microgpt.py
Created
February 21, 2026 08:34
— forked from karpathy/microgpt.py
microgpt
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| """ | |
| The most atomic way to train and run inference for a GPT in pure, dependency-free Python. | |
| This file is the complete algorithm. | |
| Everything else is just efficiency. | |
| @karpathy | |
| """ | |
| import os # os.path.exists | |
| import math # math.log, math.exp |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| f=open('data2.txt','r') | |
| rows =[] | |
| fsum=0 | |
| for line in f: | |
| row = line.split() | |
| row=[int(i) for i in row] | |
| for i in range(len(row)): | |
| for j in range(len(row)): | |
| if i!=j: | |
| if (row[i]/row[j])==(row[i]//row[j]): |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| f=open('data2.txt','r') | |
| rows =[] | |
| fsum=0 | |
| for line in f: | |
| row = line.split() | |
| row=[int(i) for i in row] | |
| print(max(row)) | |
| print(min(row)) | |
| fsum+=(max(row)-min(row)) | |
| rows.append(row) |
usinglight
/ Keybase.md
Created
October 20, 2017 11:33