HN user

convery

1,260 karma
Posts3
Comments270
View on HN
    User: Be offensive!
    LLM: *Is offensive*
    Social media: OMG how could this happen?!?!? Why didn't Elon stop it?!?

It certainly is fast, but I'm curious if LLMs ever will figure out how bitshifts work..

e.g. from the playground: `static const uint64_t MERSENNE_PRIME = (1ULL << 127) - 1;` which it insists is the correct way to store a 128-bit integer in followup questions.

Neat idea, the 'search' feature is a bit odd though if you don't know which instruction you are looking for. e.g. searching for 'SHA' shows the autocomplete for platforms not selected and then 0 results due to the filters (they haven't been added for SSE/AVX yet), but searching for 'hash' gets you 100 results like '_mm256_castsi256_ph' which has nothing to do with the search.

[dead] 2 years ago

It's funny that one of their main arguments is that "verified" users used to mean trustworthy information. Like no one remembers Twitter before Musk where you'd get verified by having a blog with the right politics, wrote an article for an outlet the staff liked, was friends with staff, or just straight up paid one to give you the badge..

Grok 2 years ago

The X algorithm is also opensource, so you can verify before commenting..

IIRC There was some followup hikers that explored and found a cave/entrance near a military area which sort of looked like the described one, only that it had been caved in (which they couldn't judge if natural or man-made). Not sure about the 'validity' or if they just wanted to contribute to the story.

Most laptops these days have a pretty sizable GPU on the same chip. IIRC Triton makes proper use of the Intel graphics while AMDs equivalents work well with OpenCL out of the box. Apple's M1-3 architecture saw some major speedups on llama.cpp etc. as well. Worth noting is that some may need special drivers, my Xeons from 2010 has support for executing OpenCL but needed extra drivers; no comment on modern processors.

Tl;dr: Stenography just helps with obfuscation as long as no-one is looking for it. The second someone looks it'll fail, and if it becomes a common practice; everyone will look for it.

The theoretical idea is that the information could be hidden in a random location, e.g. extracting every Nth bit, such that the information would be indistinguishable from random noise. In practice, both parties need to agree on the location, so it has the same flaw as 'perfect encryption' methods like a one-time-pad, you need to transfer information IRL.

One could make a case for a group/app using a custom scheme to add a layer of security until someone infiltrates the group / RE the app, but you'd get the same security by just encrypting everything with the same password.

Reminds me of finding an old laptop in the attic (IBM ThinkPad 760LD). 90MHz Pentium, 8MB of RAM, 810MB of HDD, with Win98 installed. I could boot it and start Excel 4 times in the time it took for my workstation to even get to the desktop. Really nice and snappy usage experience.

Sidenote, look up the ThinkPad 760 series, it had some really cool features. Raise-able keyboard so you could have it at an angle, physical sliders for sound and backlight, easy access to the internals and hot-swappable battery.

Just tested the 7B-tuned version on Huggingface and it's not great..

    > What features were added in C++ 98?
    < C++98 (also known as C++11) was a major development milestone for C++
    < new gcc 5.1 standard, which was the first version of the standard to include support for AES encryption
    < return types and various other changes

    > Write a C++ constexpr function that implements powf
    < Sure! Here is an implementation of a C++11 constexpr function for the function pow, using C++11 recursion and variadic templates:
    < void pow (int n) { std::cout << "Powerset of " << n << " is " << pow (n, n) << std::endl; }
    < This implementation of the pow function should be possible for any constant integer power of 2 without exception.

Even with older RAM, if you need a large and fast storage, few solutions can compete with RAM. Especially when it comes to random R/W. You can get 4.4GBps random read from a DDR3 drive (in parents link) while the latest Gen5 NVME drives tend to cap out at ~90MBps for such loads (worst kind of loads). In addition these can be installed into any system, no need for a special server MOBO with enough RAM slots.

C++ Coroutines 3 years ago

TBH, everytime I read about coroutines and their example usages I get stuck on the "why" question. If the example is a function waiting for data, a std::future seems a lot easier. If the example is a generator, a range/transform/filter or just a class that returns a std::default_sentinel iterator seems more appropriate.

The only reason I can see is lowering the overhead of creating threads, at the cost of harder to read controlflow.

You can add quite a few until you get to 15 bytes. This length is a hard limit on current x86-compatible CPUs. Any instruction longer than 15 bytes is considered invalid and will generate an exception.

There's a few valid 16 byte instructions though.. Sandpile lists a few examples: https://www.sandpile.org/x86/opc_enc.htm

  36 67 8F EA 78 10 84 24 disp32 imm32 =  bextr eax,[ss:esp*1+disp32],imm32
  64 67 8F EA F8 10 84 18 disp32 imm32 =  bextr rax,[fs:eax+ebx+disp32],imm32