• 0 Posts
  • 472 Comments
Joined 1 year ago
cake
Cake day: August 16th, 2023

help-circle


  • No idea what field you’re in, but of course you have to adjust it regularly. This year it’s brown m&Ms. Next year it’s a bowl of only yellow ones. The year after, it’s Skittles (no red ones). Kit Kats already split into individual bars. A bowl of Skittles mixed with corn flakes. Brown m&MS as decoy for people skimming for the clause, then later another one about 3 musketeers at the bar. I could come up with enough for an entire career without even leaving the candy realm.

    It’s meant to be a very simple, but specific task that is easily performed by anyone that actually read and followed the instructions. It could be a bottle of Dr Pepper (as someone else mentioned), or wearing a yellow shirt upon arrival, or calling the lead “Chief”


  • Nollij@sopuli.xyztoPiracy@lemmy.mlAI for torrenting?
    link
    fedilink
    English
    arrow-up
    2
    ·
    13 days ago

    You are comparing it to a hash, following some extra rules on what the data could be. You have exactly the length of hash before you can reliably count on duplicates (and collisions happen much sooner). In torrent v1, this is SHA-1, which has a 160-bit (or 20 byte) hash. Which means for every single additional random bit, you have doubled the number of possible matches.

    If your torrent has an uncommonly small chunk size of 256KiB, that’s 261,144 bytes. Minus the 20 from above, and you have a likely 256^261124 chunks that match your hash. That’s a number so large that Google calls it infinity. It would take you forever just to generate these chunks by brute force, since each would need to be created, then hashed, then the results stored somewhere. Many years ago, I remember someone doing this on CRC32 (32 bits/4 bytes) and 6 byte files. It took all night, and produced dozens of hash-matching files. You’re talking many orders of magnitude bigger.

    But then what? You’d still need to apply the other rules on what the data could be. Rules that are probably more CPU-intensive than the hash algorithm.

    The one trick that AI might be able to use to save the day is that it may contain in its corpus the original file. In effect, that would make the AI an unlikely seeder.



  • While misrepresenting yourself or your credentials can be fraud, the title of PhD/Doctor (outside of MD) is not regulated, at least not in the US. It’s almost like an endorsement from the university that you passed their tests.

    But that’s not very regulated either, and there are countless certifying boards (Boards of Regents, typically).

    Falsely claiming to have a PhD in Neuroscience from Harvard, or an honorary Doctorate of Fine Arts from Knox College, would be fraud. But just saying that you have a PhD without specifying anything more specific is not.

    And it comes up regularly - an easy example is the author of Men Are From Mars, Women Are From Venus.









  • Nollij@sopuli.xyztoNo Stupid Questions@lemmy.world...
    link
    fedilink
    English
    arrow-up
    2
    ·
    27 days ago

    The most likely scenario is that both the presidency and vice presidency would be vacant. That means it would go to the speaker of the House, most likely to still be Mike Johnson.

    But if Democrats have an unexpectedly good result, they could control the House and elect a new speaker. Similarly, Republicans could replace Johnson with someone else.






  • It’s a numbers game. There are WAY more Jewish people in the US than there are Arabs (~7.5 vs 3.5 million, according to a quick Google search).

    Strategically, those Jewish voters are also more likely to switch to a Republican vote than the Arabs, regardless. It would take 2 Arabs (or any other Democratic voter) sitting out to counter a single Democratic voter switching to a Republican vote.

    Granted, none of this accounts for voter locations (because only the 7 swing states matter), voter enthusiasm, claims of national security, or (most importantly of all) ethics.