yeah that’d do it. on X11 this is a solved problem, but wayland delegates the responsibility to the wm, and i don’t think anyone other than gnome has actually implemented it. another one of the paper cuts that makes it hard for me to make the switch.
in most systems this is global. it’s provided by the desktop and programs just see a copy/paste event. are you on wayland by any chance?
i’ve seen atms running os/2 warp. they take what they are given.
x86 starts with the 8086, which is 16 bit. AMD64, IA-64 and x86-64 are all both 64-bit and x86.
when referring to specifically 32-bit x86 it’s common to use the terms i386 or IA-32, but i think just “32-bit x86” gets the point across more clearly. if you need more specificity, just mention which processor you have and people can figure it out from there.
oh is that why that brush is in there
oh, you want a 32-bit version. should probably specify that. x86 is a big umbrella.
through titles sure. but that’s not what i need from any site.
that is… pretty neat. is there some way to get it to interop with a browser’s bookmarks?
if only there was a fuzzy content search included. usually i don’t remember the page, or the topic, but just like… a quote.
that’s actually a good use for this local ai stuff, take the contents of pages i bookmark and auto-tag it based on that. for that matter, archive the contents as well.
i use bookmarks for sites i access frequently, like a speed dial thing. i’ve set up my bookmarks toolbar to be in-line with the address bar and icon-only, so that it blends in with the rest of the interface. if i’m just going to go back to something one time i leave a tab open until i get time.
if i bookmark something i will never look at it again
yup, running a global network on top of something designed to be slow seems… inadvisable.
you’re calculating the sha256 (i think) hash of the previous transaction block’s hash plus your block of transactions. What’s making it proof-of-work though, is the stipulation that “the hash has to start with at least five zeroes”, with “five” being an adjustable difficulty value. To be able to get that specific hash an otherwise meaningless number (a “nonce”) is included, and by increasing this number by one you can change the hash value.
so basically, all these servers are running hash calculations on the same thing over and over again with a single number changing between runs until they get an “approved” hash value. whoever gets there the fastest gets their block added to the chain, then everyone else has to start over with that hash as the “previous” one.
It’s called “proof of work” because it’s difficult to find a suitable value, but it’s trivial to check that it’s correct. you just need the nonce. so by presenting that nonce to everyone, you’ve proved that you “did the work”.
as for the reason why they do this, if each block’s hash is dependent on the hash of the block before it, it means the entire chain is resistant to tampering. you can’t insert a block in the middle without recalculating the entire chain.
as long as floorp’s funding can sustain 500 full-time browser engineers, sure.
because that’s the way it is. if google stops funding firefox development, all the forks disappear.
i don’t use it because it’s an 80MB Electron mess with built-in tracking and advertising that does the same thing as tools that are installed on the system from day 1.
you know on the one hand i like the idea, but on the other i would like my computer to be as unantropomorphized as possible so that i don’t start treating it like it has feelings.
i’ll take ERR 0x2038A702 UNABLE TO COMPLY; LP0 ON FIRE over oh nyo pwease don't SIGKILL me uwu any day.
doom’s netcode is weird as well, all the clients run in perfect lock-step. seems like it would be weird on non-duplex networks.
sounds something like call of cthulhu rules.
personally i think xp is too fiddly. i prefer systems like fate where you can just rewrite skills to fit your style of play better.