#programming
1 messages · Page 224 of 1
well you know the contest rules and the intended compilation command so 
feel free to use the knowledge you have to optimize your code
just dont optimize it so much that it breaks on my system or you wont get many points
can you add -march=native to the command 
its better to specify, shiro's cpu has avx2

yeah but there's so many flags
actually Shiro, can I confirm something with you? Deno has its standard library as hosted packages not included in the runtime itself, that's fine to use right?
easier to just enable everything supported
wtf is deno 
a JS runtime that has a non-ass FFI
i would argue that its unfair for you to be able to use webgpu just because your stdlib has it

good answer
deno seems to be an extension of js so i feel like it should be restricted to the js stdlib no?
oh you sweet summer child
what stdlib
js doesn't have a stdlib, it depends on the runtime
"JS stdlib" 

deno is the stdlib
ok so
what is wrong with js
so much
what isn't wrong with js
please read this for a full list of the deno stdlib
please don't read this
invoking gpu would still break the parallel processing rule
regardless of being in stdlib
its only 41 entries
what if the parallel processing is opaque and hidden behind a function that appears to be single processed 
tbh I can totally use only the actual JS-language-only stuff without anything from the Deno stdlib, I just wanna know before I start writing anything 
cause that's how js runtimes work 
should i immerse myself into the hell that is node api for node c++ addons or whatever the fuck they call it
i'm so ready
have fun with that
most of that stuff looks pretty useless for chess at first glance anyway
ehhhhh the caching utilities could be nice
building these bots for the tournament is going to be a nightmare huh
or, i mean, most of it wont give you a special advantage
the data structures could also be nice...
you put it in the rules that it must be easy to compile right
i did put that it should be easy to build on my system
just disqualify anyone that fails to meet that
it may be pain but is the best thing we can do for compat
require docker images 
requiring deno is.... yeah
deno is just a single static executable you'll be fine
...javascript... 
not really
that the other rules dont already disqualify
it's just obscure-ish
well the usual network and filesystem stuff, but that's banned anyway
could explicitly ban the GPU if you want to
should've done wasm with wasm submissions instead 
but yes, in practice you're gonna look over everything anyway, just clarify as needed 
not hugely
you can ban those within deno too
friction for potential contenders
yeah i think its fine to use the deno runtime then
we should have limited it to c only
and node bindings will work across all runtimes

they can just use the C bindings if they want less friction
just for clarification tho, the gpu stuff is indeed considered parallel and banned
yeah, understood
also async
i think it fine

single-threaded tho
js single threaded
also this
that's under the usual banned network stuff
not parallel, just concurrent
honestly im rather impressed with how many languages there are bindings for
does async start an event thread
the rules say "otherwise run code in the background"
async is background execution 
no it isn't if the call is blocking
it schedules tasks on the current thread... how the engine manages it is its thing
if it was just single-thread coroutines that'd be fine
dunno what you mean by "event thread" but it does not start an OS thread AFAIK
single threaded coroutine is fine ye
async is single threaded unless you spawn a thread yourself through the runtime's APIs, that's defined as part of the JS standard
sounds fine to me then, at least by this description
tbh async wouldn't be helpful anyway
since you'll spend most of the time searching moves
i could see a producer-consumer pattern for producing move sequences and consuming them to evaluate, would make time management easy 
can still be useful for divide and conquer search
if search tend to terminate, the more searches you make the faster you will find non-terminating searches
possibly... maybe someone will come up with something nice
therefore async is actually useful
I'm not even a participant in the contest, and lurking over the last few days has been... fascinating 
this is definitely manageable for me alone to run
(
)
a bot will not be thinking in between moves because chess_done() is blocking. for a bot to be thinking in between moves the bindings would have to call chess_done() in a separate thread manually. js is very single threaded by default, "async" only refers to calls to native code
or interrupts
or whatever
single threaded
period
async sounds fine
it is useful for long-running and early-terminating searches though so i think its a good idea to use it
you implicitly use it when typically programming searches though 
since when is this a thing on twitch 
youtube 2
should have always been a thing
announced at twitchcon
ah
rolling out now probably since it says new
never heard of this, but the functionality itself has been a thing for ages as long as VODs are enabled
the current stream is also a VOD with a lag of a few minutes
mhm
i mean i always just clicked the clip button to do that
it was announced at the last TC EU opening ceremony
Real time VODs like youtube? 
yup
why they put this behind a paywall? 
So the paywall is worth
only for now apparently
the
is strong with this one
sth sth they want to make sure it doesn't get used to bypass ads 
which idk how that'd even work but fair enough i guess
to encourage ppl to sub to a channel I guess
Twitch is losing its money cuz no one is paying for their services. Youtube on the other hand has Google at the back
isn't twitch backed by amazon or is amazon also going in the dumpster fire rn
big corpa are weird
amazon is twitch's parent company but that doesn't mean they are one entity that's not how any of that works. same reason they pay astronomical aws bills
different entities, different bank accounts, different incomes and expenses
1 hour spent fighting msvc instead. it won


???
lmao
you mean c++ as c right
no
me when i can't compile to the same language i wrote it in
lemme guess, it really wants to compile as c++
💀
isn't v8 c++ only or am i missing something
it shoves /std:c++20 into the c dep
chessapi isn't
least disruptive pr
actually can't you compile chessapi as c++? doesn't it have some c++-aware stuff in there?
that's a pretty big issue 
that's fine in c though and should not be an issue if you compile it as such
i also got errors in threads.h of all fucking places
c++ is stricter when it comes to pointer types and type conversions
you have to explicitly cast void* to whatever pointer type you want
what errors
not anymore nvm
also ints to enums are implicitly cast
yup
@real sierra i made a pr so the chessapi.c compiles with c++ compilers too, feel free to merge if you want to (it's just a bunch of type casts) 
Someone else would have to test with msvc if they care
i'm running into thethreads.hthing again
#ifdef __cplusplus // TRANSITION, [[_Noreturn]]
[[noreturn]] void __cdecl thrd_exit(int _Res);
#else
_Noreturn void __cdecl thrd_exit(int _Res);
#endif
``` basically i somehow end up on the `_Noreturn` macro even though i'm compiling as cpp
i don't even know at this point

static inline int __cdecl thrd_sleep(const struct timespec* duration, struct timespec* remaining) {
return _thrd_sleep64((struct _timespec64*) duration, (struct _timespec64*) remaining);
}
``` oh and it doesn't like this too
is defining functions in headers even ok
in cpp
they're special to me! 
C:\Program Files\Microsoft Visual Studio\2022\Community\VC\Tools\MSVC\14.41.34120\include\threads.h(116, 99): error C2143: syntax error: no ";" before "{" i had to translate so the text of the error may not be exact. my msvc is in russian for some crazy reason even though the system language is english
oh the vs install is probably in russian because at some point i downloaded it from a russian ip
that would make sense
i can't believe i'm unironically trying to install visual studio via wine now
what has my life become
too late 
does this classify as self-harm?
pretty sure it does
or at least should
also speaking of wine
i found out the other day apparently if you install specific combinations of packages in the same prefix it can kill the kernel 
lovely
I remember trying to install software on wine only to have to try and install it
I swear I was trying to run python as windows for some reason
I remember so many errors and giving up on that

windows huh
bro, why, no god no. Whatever sanity you've got left will disappear.
Also, you can technically just run msvc directly via wine... but don't. VM it

I tried the MSVC package in the AUR once. The errors were something to behold
not breaking? won't make development painful? cross-platform compatibility?
it's literally just casting the return value from malloc and casting some ints to the enum types

there was another change i made about some scanf's return value being unused but i removed that from the pr
I fear the merge conflicts my other branch will suffer 

is it even worth resolving or do I just reimplement it all 
the pthreads only one?
right
unsure if it works or not tho
was considering expanding it to just use win32 threads as well
at that point you may as well 
because windows just doesn't support anything else reliably

it means testing will be a pain in the ass
mint was hitting some weird errors with msvc in c++ mode around threads.h too apparently
supporting pthread and win32 threads should be enough for all platforms
mac and linux should both be POSIX compliant
and win32 is... yeah...
future problem anyway
fixes may come tomorrow as today has proven to be quite busy irl 
I can review some PRs tonight but probably not write code myself
its fine to update it i just used 8 because shiro had it on ubuntu
awa
Support DOS API now
okay i give up with msvc 
No LLVM or clang?
i was trying to get msvc working under nixos to debug some things 
Msvc is notorious for giving shit errors
the installer doesn't like my wine
remove words 2, 3, 5, and 7
wait, only 3, 5, 7
I used to use MinGW as an alternative and now on the rare chance I use C++ ill use clang

The real legends just ask chatgpt to compile it
I should try that tomorrow actually
Make a shell script to build
they have a separate type for that (std::bitset) but it's fixed size only 
i know 
these are actually 18 bytes per token, you can use "\x57\x1e\xab\xb8\x64\xe9\x9b\xc1" though which is 8 bytes
i'm killing you
Make a program to calculate the best method
i bet you have a variable name over 8 characters
smh
rulebreaker
C devs storing everything under single letters
variable names dont encode info
the rules explicitly disallow using them for storing data
shiro said no issues i trust shiro
shiro wrong 
anything but making it as horrifically unreadable as possible

Sorry pal u gotta program like it's the 90s
@real sierra please confirm a string literal with 18 characters is too long 
i'm gonna cry

Everything must be single letter with no context or help to anyone reading it
sounds like a literal that stores more than 64 bits 
NOOOO
Rip bozo
me the best
this is allowed as it doesnt encode info 
Doesn't want hashing
NeuroopaTalk
Make an array of the string then
skill issue storing 8 bytes in 18 bytes
nyanleaf
how do i even convert that to ulong...
why dont you build the string token counter into toknt
i guess there's that other way
@sage crag this is why 
i think the reason was effort
that way people can use strings without getting undercounted
ye lazyleaf 
they can complain even if they dont have issues 
i use a python script
i would share it with you but i dont need you getting an edge
not a bad idea to make includes one token but context sensitive lexing 
you've already leaked your secrets

it's too late

i have an option
i do wonder what adding python to this shit would let me do.
probably not that much actually
nevermind fuck that
i'll just go with the annoying option of having c*mmas
shiro
that is
literally
what i do
each one of those ulongs is 38 parameters

could make it 40 per ulong but would actually cost extra tokens to do that
Trying to compile the C version of the chess api on Windows, I am running into "threads.h" being missing. Is there a recommended route to avoid this? The change log claims that as of a couple days ago Windows should be working but Mac OS still has this issue, but I'm not on Mac
use clang
that's the method we've found
known issue unfortunately
damn it i thought i was so clever putting the ulongs in strings and doing this to extract them
included in stdlib as well

clang also says it's missing threads.h, is there something else needed on top of that?
uhh
what version 
and did you pass -std=c23
version is 21.1.1-1, and no I did not pass that
Yeah from 2022 
bruh
The latest stable version is 21.1
You'll have to download it separately if you want it
shiro does 
What is -std=c23 supposed to do for me? Didn't seem to make a difference
i'll test on linux in the proper environment when i feel it's about ready
but they were unofficial features before c23 either way
removes implicit integers, mostly (from what i've seen of it affecting people's code)
how did you install clang
pacman -S mingw-w64-x86_64-clang in MSYS2
try gcc in msys2 maybe
and of course pacman -Syu
I tried gcc first, switched to clang because it might have threads.h

Guess they don't ship that for mingw huh

if all else fails wsl will just work
i mean you can rewrite again using windows.h and CRITICAL_SECTION if you want 
Honestly just accept your fate and make a layer on top of pthread and win32 threads
that's probably what's coming yeah 
if only there was some sort of header in the standard that allowed you to write cross platform threading code
Yeah if only

"everyone supports threads.h!"
nobody supports threads.h
🪟
"nuhuh we dont wanna use stinky pthread"
🍎
"nah we dont like threads.h"
🐧 👍 "use whatever idc"
🪟 threads.h is supported or isnt idk we havent decided it depends on your compiler
std::thread is well supported
Shouldn't be too bad to make a c header and the implementation in c++
c++
i love c++ 
can i..?
Yes

example me 
but if i go down the slippery slope people will make me rewrite the entire thing in cpp features
Well your current version doesn't compile as c++, hence my pr
and you will have given every bindings author an aneurysm 
ill just solve it myself 
people havent made you rewrite the horrible repetition you have in move checking with macros
i just need to abstract the synchronization primitives with clever macros
and provide a windows.h derived impl
and a pthread.h derived impl
and then i win 

that reminds me
in windows 11 they changed the layout of CRITICAL_SECTION
they didnt make it bigger
but they started using more of the bytes in there
which broke some legacy code 
i only know from reverse engineering windows code that CRITICAL_SECTION is windows mutex
idk how you'd do cvs
CONDITION_VARIABLE
how convenient
surely its more abstracted than this
there is one part i kinda dread
which is the typing for the function the thread runs
DWORD WINAPI MyThreadFunction( LPVOID lpParam )
like what is this trash 
WINAPI is more or less __stdcall
(which just means uh, not __cdecl)
LPVOID is void*
tokens 
and DWORD is just 4 bytes (unsigned)
16 bit words 
it stands for double word
this is silly to have to include in code tho
Isn't that signature identical to the one in pthread_create
even though modern words are not 16-bit
LPVOID stands for long pointer (i think) but on modern platforms no difference between short and long pointers
its kinda incredible how far back winapi dates
linux just relies on source code to update programs for new library versions but windows like actually kept the api mostly stable ever since the 16-bit days
For better or worse
its not an issue with the kernel, "just" with the entire ecosystem around it
and honestly i dont really mind it
i dont like every windows app shipping its own dlls
What's wsl? Sorry for all the basic setup questions, I haven't done C on my PC before (obviously), but Python C and C++ are the only available languages that I have experience with so it seems compiling the c version of the api is unavoidable 
it seems like shiro will also implement winapi support soon so if you don't wanna bother you can just check back in a couple days 
as an addendum to this, it's likely (though not set in stone) that i will push the submission deadline to accomodate the bugs that people have encountered at the onset, so no need to feel too pressed for time :)
-# (oops sorry for ping)
its ok 
I'll ping you with an interesting question to make up for it
what is the most portable "hello world" possible
are there language restrictions
nope
and how is portability defined, binary or source portability
I'm not stressed about a time limit (I know regardless of how much time I have I'm not going to produce anything that competitive, I'm just doing this for fun and experience). Trying to solve all these problems is an adventure of its own I guess 
i so tired
binary
sleep sleep sleep 
need
like, can you polyglot the binary to run on multiple architectures
code
bed comfy
wanna write code for me 
sometimes you can polyglot a binary
you can ✅
sometimes not


smog
@stray dragon wanna exchange trade secrets
I think if we share C code hacks
we can mutually benefit

despite my extensive research, most online C code golf knowledge is for source length, not token count, and often runs counter to the goal
I think the real token saver knowledge is all bespoke
i'm working on making c toknt count include names as 1 token
&&
||
free 2 tokens
when i have tips to share i will share them but currently i am procrastinating a bit
can just replace <> with ""
can I just send you my code and you shorten it for me

lmao

!!
I think you are pretty locked into using a different method than I am
terminating not
so I think there's minimal code theft risk
ah, that's the issue
🍞‼️
i'm procrastinating to unlock myself

hiding my code from t
you don't want this it's so many tokens
it even performs badly

yeah you don't want my code
koni macro abuser

#define fl_bytecode(x) x(tex, 0, 0) x(evc, 1, 0)
(it was actually pretty good until I introduced the latest bug)
along the critical line it usually hits depth 6 ish I think
damn ok
🎷
your bot's*
life skill or in the bot

oh
because the answers in order would be "horrendous" and "i still haven't actually run it with my code yet"
i think pretty good though?
you haven't run your code yet?
nope.
procrastinating
i have to rewrite it all into the bot
make sure it all compiles and follows the rules i didn't consider
I see
will have to edit a lot, and i also want to redo the search algorithm
add better pruning, instead of just doing "remove a fraction of the least promising paths" every step
maybe, if i have space, add in a transposition table, so i can cache the evals
#include "stdint.h"
#if __STDC_VERSION__ < 202311L
#include <stdbool.h>
#endif
would probably take a lot of fucking around to shave down to that point though :(
TT very cheap in tokens

you can just include unconditionally 
it's just a problem for me because it turned my tree into a graph
but also only saves me like
maybe 2/3 of searches
the notion of "parent" node no longer applies to my game tree
probably?
not really
literally any board where you have two moves that can be done in either order
TT cuts that work in half
no compiler warning

thats because it's only depth 2
it turns out its really easy to repeat positions you've already done
unused header 
also: my method prunes a fraction of the trees at each pruning step
it actually would be about half or so between the bot's turns
a bit more from doing the multiple searches within each turn
so i'll say 2/3
still significant though
actually... within endgame, cache hits would probably increase
hmm
earlygame and endgame are where i see the most cache hits
and while it might seem insignificant to worry about opening moves, if your hash moves are strong enough you might even be able to cut down on time spent on the opening
having extra time later could give you a win even against a better bot
that's actually relieving tbh
sorry i think i phrased that poorly
earlygame and endgame are where i expect the most cache hits
ah
earlygame i can 100% understand
especially if it carried over the cache between games
even if not, the cache being carried forward within the same game is worth a lot
if you search up to 8 plies ahead, and then you make a move and black makes a move, there's still 6 plies ahead worth of cached moves
yeah
unless the opponent did something truly wacky, i dont think the moves you're checking will change that much
i'll simply have to see
lectures cancelled tomorrow
long weekend
make a bot so awful to replicate that nobody will want to try
my code is probably far worse than my bot tbh
im amazed how many tokens it uses for how few features it implements

yeah seeing how many tokens my neural net takes up hurts
especially the part where it's slotted into the eval function properly
was at like 500 tokens just for that + eval function, and that was before realizing the rules and compile issues
i think i need to trim stuff
horrible :(
so is it impossible to process that with neural net within 1k tokens?
its possible but the net's gotta be pretty small
but it doesn't leave as much room as i'd like, with the implementation i have
or maybe you can use 1.5-bit neural network 
yeah mine has 1020 parameters
i use ternary
either way you'll have to use some unconventional approaches
creativity is the name of the game
weights can each be -1, 0, or 1
how to get maximum chess performance from a fixed token budget is a very abstract problem
seems to have good performance
gpt says even 16k is not enough for an able-to use nn 🙁
gpt is wrong
gpt doesnt know anything
i've implemented it myself
i know
i will do updates on it though
i feel the key to making it work well is to have it adjust the big numbers that get summed into the evaluation
takes them in as inputs, spits out factors that it multiplies them by, sums them, that's the evaluation result
by "big numbers" i mean material, mobility, etc.
king safety
pawn structure, maybe
that way, it skips having to figure out what the inputs mean, and can do away with all the abstraction you'd normally want for a neural network like that
yes this is 1.5 bit
or referred to as such

1.58 bit i've seen
yup
chayleaf said 3 bit initially so i corrected
1.58496250072
you can keep going forever
its log_2(3)
ok no need to get too specific
you know
we're kinda like the bots, in a way
our search space is code strings instead of games
you can pack the entire network into a base-3 integer
and our time limit is a token limit
and then write its binary representation
did you know?
i already do this.

that's how i compress my parameters into ulongs
38 parameters (40 - 2 for token reasons) per 64 bits
ye it's an option if i still go the string route
wait
i can just do that still
and it would actually save me tokens potentially.
even from the current method that is illegal.
huh....
on the unpacking perhaps, you would need to write a python encoder though
no
i wouldn't
i could just
take the characters as ints
and use the same ternary unpacking method i use already
but with less iterations per number
and i could remove the string parsing function in its entirety
meh i'll do it tomorrow
probably
trits = [-1, 0, 1, 1, -1, 0, -1, 1, -1]
out = bytearray()
i = 0
n = len(trits)
while i < n:
block = trits[i:i+5]
while len(block) < 5: block.append(0)
val = 0
mul = 1
for t in block:
val += (t + 1) * mul
mul *= 3
out.append(val)
i += 5
print(list(out))
trits = []
for b in out:
val = b
for _ in range(5):
val, d = divmod(val, 3)
trits.append(d - 1)
print(trits[:n])
all you need to do with out is convert it to ulongs from here, not my problem

i just change the 8-character representations to the hex-byte formatting method chayleaf showed earlier, then i change the numbers in this bit and fix it so it doesn't do /=3 before it gets the parameter, and i'm chilling
ez
what
ideas!!!
some compilers have char as unsigned char and some as signed char
chayleaf you might have helped me.
meh, easy fix
probably still worth
its theoretically better than either of the previous methods i said
at asymptote at least

you can just say signed/unsigned explicitly but +1 token 

this is looking like... 6 extra tokens added, 22 tokens removed, a few added and removed elsewhere for the other non-ternary params
nna just uint8_t

shiro uses stdint.h in chessapi.h
ye ye
oh i can just remove that from my bot then?
man.
ok

that feels so obvious

damn it brain
could use _Bool even before c23 
i never added it i'm not shiro
stdbool enjoyers


i should've figured you'd be all-in on this contest
why would you ever do that
even your username is minimum tokens
LOL
shiro its normal to have a 1 token username
shimo did you know about flexible struct members
nope
typedef struct {
uint32_t len;
uint8_t data[];
} Erm;
data isnt a pointer
its a flexible struct member
konii out here pulling C tricks out of a hat
some old compilers complain when it isnt data[0] or data[1]
but ye you can do that
equivalent of rust's !Sized types
its a struct with an arbitrary size

not any worse than opaque types
opaque types are best
then u dont have to worry because u cant
its a pointer
NFI

struct {
int len;
char x[];
} *s = malloc(sizeof(int) + 256);
s->len = 256;
for (int i = 0; i < s->len; ++i) s->x[i] = i;
you can actually also use sizeof(T)
not here 
you not define struct 
branch and link
what have you given me
even skimming this creates new and interesting ideas for how to compress my stuff to silly levels

oh to answer your question, you can do that on macos but i dont think you can do it on linux
elfs are arch and os specific

windows supports it too
linux didnt have to since it doesnt rely on binaries but on source code
there was an attempt at introducing it https://raw.githubusercontent.com/icculus/fatelf/ed748c44c3a5eefa669ecf684acc6c4b2d23408a/docs/fatelf-specification.txt
but it didnt gain traction
makes me wonder
could you make it do #!/usr/bin/env bash on linux
but be pe on window/macho on macos
(or /bin/sh)
then you could patch the elf depending on cpu architecture from within bash
not implementing it btw 
my bot is getting a lot of disconnects on cute chess, how can I check where and waht is going wrong?
a disconnect is usually indicative of your bot crashing somehow
is it disconnecting immediately, or seemingly at random?
fully random
i dont think there's a super clean way to identify the cause without much more information
i wonder if theres a way thats easier to debug (with stderr logs at least)
running it in a terminal and feeding it UCI commands manually will let you see what kind of error it is
but that could take a while
and is annoying if you dont know for sure what caused the error
sometimes even the bot the plays random gets disconnected
the last time you updated it prety sure
also just to be sure, which operating system and language are you using


if you happen to resolve those issues, or pinpoint a more exact cause, let me know
windows is notoriously difficult for everything
and the python bindings have a few known bugs that are being fixed soon
okay





I've never seen that one
linear algebra is the bane of my existence
lost to basis again
cannot build an intuition for basis no matter how many times i encounter it



So you basically replace your array with a formula?
not really a formula 
its a single number (though you cant really enter it as a single number as per the contest rules)
then you decode that number based on expected probabilities of symbols in the message
just read about huffman coding if you want something simpler to get an intuition of how compression works
haha c# go brrr
You have unlocked new role
what

all programs are formulas
// Convert one array to a Set for faster lookup
const set2 = new Set(arr2);
// Filter arr1 to only elements that exist in set2
const common = arr1.filter(item => set2.has(item));
// Remove duplicates if needed
return [new Set(common)];
}
// Example usage
const array1 = [1, 2, 3, 4, 5, 6];
const array2 = [4, 5, 6, 7, 8, 9];
const commonElements = findCommonElements(array1, array2);
console.log("Common elements:", commonElements);```
you can use new Set(array1).intersection(new Set(array2))
also you forgot ... in list expansion
it seens board.get_piece_from_index(target) is returning a 0, causing my crashes, someone reported this on issues in github already
You have to be sure that index actually has a piece in current board
not really its fine for it to return 0
its a python bindings issue
it will get fixed

Then how can it crash anything
a lot can happen at ffi boundaries
(in this case its just enum conversion and shiro forgetting what his own function can return)
mhm
I get this in my logs
ERROR: 0 is not a valid PieceType
shiro will fix
change it to return None if it encounters 0
this is likely how it will work in a future api version
willfix ✅
finally time tomorrow, no more assignments and class cancelled
now I eep 
goodnight chess channel
Goodmorning 
I have 2 hours of math today
But its math i learned 3 years ago, so my motivation to go to school today is non-existant
So does Chess API still work or did you explode it?
chess
have something not related to Chess for a change
yep
meanwhile im just tryna get bazzite and obs to play nice (PipeWire hates me)
chess 
I wouldn't be surprised, they churn out updated checkpoints of each model gen over at google
Surely i will make it beat random bot every time this weekend 
Also is 3fold draw check not working or is it me
maybe it's time I got a new type c hub 
duct tape it 
65w going through that wire
typeC.png 
Huh? Which one
It looks weirdly alligned
Compare it to other ports
Oh i think thats the reflection
Or what is that, a dust clump
i had a dream where my compiler told me to use uint_8_t instead of uint8_t 
what a world that would be
that's actually evil
flash lite actually became much better with this one, comparable to flash, but also retaining the insane speed
couldnt say the same about flash's upgrade
Looks like they added a USB-C port at the last moment so someone shopped it into an existing product shot (poorly).
At first i thought you were talking about flash player
ye me scary 
https://youtu.be/RFWJM8JMXBs
@stray dragon @obsidian mantle video about ans
an explanation of the source coding theorem, arithmetic coding, and asymmetric numeral systems
this was my entry into #SoMEpi. this video can get pretty confusing, so don't worry if it takes some rewatches to understand. if i had more time i would've made it better....but anyway i hadn't seen many videos on this so i hope it is a helpful introdu...
This is altogether more exciting imo
yeah, google finally revealing what they cooked in robotics
and even deployed a test model on AI studio too
Oh sweet!
I can't wait to play with this
Did they add a preview of the non ER version as well?
unfortunately all gemini models, including this one, are still not good enough for counting tasks on image
mambo mambo
ded chat 
Tested it out a bit
Its a very impressive reasoner
im back home 
i wonder how long i've had this qemu instance open for 
"gee i wonder why i'm using so much ram"
the kde fedora instance i launched for testing days ago:

forgot 

how can you forget 
cantjam


no this emoji can leave

i forgot 
@tender river writeShellScriptBin
writeShellApplication


mimimi











not abuse just correct










