Trailblazing Braille Taser

  • 0 Posts
  • 115 Comments
Joined 2 years ago
Cake day: August 16th, 2023
  • Trailblazing Braille Taser@lemmy.dbzer0.comtoProgrammer Humor@lemmy.ml•Labels go brrrr
    24·
    3 months ago

    Are you arguing that assembly languages are not architecture-specific? I don’t think that’s the typical definition.

    Nasm is an assembler, but it also represents a specific assembly language targeting x86 architectures.

    Gas is an assembler of a higher order. It can emit code for many architectures, and thus it accepts many different architecture-specific assembly languages.

  • Trailblazing Braille Taser@lemmy.dbzer0.comtoPiracy: ꜱᴀɪʟ ᴛʜᴇ ʜɪɢʜ ꜱᴇᴀꜱ@lemmy.dbzer0.com•Piracy in Mexico.English
    8·
    3 months ago

    You can also “simply” raw-dog Wireguard. It’s built into the Linux kernel, so you barely have to install anything besides the userspace tools.

    Basically, I objected to being reliant on the generosity of a for-profit company. “We do these things not because they are easy, but because we thought they would be easy.”

    This is a rough sketch:

    • Create a Linux server. It can even be a VM/container if you get the networking right.
    • Create a Wireguard interface and pick a private IP address subnet that won’t conflict with your home subnet: https://www.wireguard.com/quickstart/
    • Define PostUp and PostDown rules in your Wireguard config that modify iptables to masquerade traffic from the Wireguard subnet
    • Also set net.ipv4.ip_forward=1 with sysctl. (There is probably an IPv6 equivalent but I live in the past.)
    • Generate keypairs and configs for each device you want to use
    • Set up dynamic DNS, e.g. https://freedns.afraid.org/
    • Forward UDP port 51820 to your server
    • Install the Wireguard app on your client devices. If Linux, you can just write a client config containing the necessary magic words and start it up with wg-quick.

    Boom. Tailscale’d.

    I’m sure I’ve forgotten some steps. I have some janky automation that’s broken in a new way every time I try to use it.

  • Trailblazing Braille Taser@lemmy.dbzer0.comtoTechnology@lemmy.world•A young computer scientist and two colleagues show that searches within data structures called hash tables can be much faster than previously deemed possible.English
    5·
    5 months ago

    I wrote my comment not to antagonize you but to point out that you’re asking the wrong questions. I failed to articulate that, and I’m sorry for being harsh.

    Your prior comment indicated that you have used hash tables in Java, which were very fast. You said that your program accessed the hash tables, but did not “search” the table. These operations are the same thing, which led me to believe you’re out of your depth.

    This last comment asks me how much this paper’s contribution speeds up an average program. You’re asking the wrong question, and you seem to be implying the work was useless if it doesn’t have an immediate practical impact. This is a theoretical breakthrough far over my head. I scanned the paper, but I’m unsurprised they haven’t quantified the real-world impact yet. It’s entirely possible that despite finding an asymptotic improvement, the constant factors (elided by the big O analysis) are so large as to be impractical… or maybe not! I think we need to stay tuned.

    Again, sorry for being blunt. We all have to start somewhere. My advice is to be mindful of where the edge of your expertise lies and try to err on the side of not devaluing others’ work.