Kissaki

joined 2 years ago
MODERATOR OF
[–] Kissaki@programming.dev 6 points 3 months ago

You linked a tutorial to sh. Note that nobody ends up shell scripting in sh. People will use bash, which is an alternative shell and shell language, and almost universally available where sh is available. sh is very old and limited. bash is much more common.

There's many other kinds of shells as well though. And you such an automation task you could use any number of scripting languages. The part that makes it a shell, which is interactive use, is not necessary for a scripting task like this of automating an operation. Shell languages can be used as scripting languages too though. I just want to point out alternatives and context.

Personally, I use Nushell as my daily shell and for scripts and am very satisfied with it. It's not universally available as in pre-installed, but is multi-platform and easy to install through an exe or package. Because it's a newer project, there's not that many resources yet, and still occasionally makes changes to its language with new releases. But, for me, the upsides to other shells are obvious and significant. I posted my Nushell solution in a separate comment (separating concise solution from this general prose exploration).

[–] Kissaki@programming.dev 4 points 3 months ago

My preferred shell is Nushell. I would write:

glob **/*.mp3 | wrap mp3 | insert txt { $in.mp3 | path parse | update extension 'txt' | path join } | each { ^mp3splt -A $in.txt $in.mp3 }

or with line breaks for readability

glob **/*.mp3
  | wrap mp3
  | insert txt { $in.mp3 | path parse | update extension 'txt' | path join }
  | each { ^mp3splt -A $in.txt $in.mp3 }
  1. glob to find the files (according to pattern from current dir)
  2. wrap list values in a named column
  3. add column txt with extension replaced by txt
  4. => now I have a table with mp3 and txt columns with respective full paths
  5. call mp3splt for each
[–] Kissaki@programming.dev 6 points 3 months ago (2 children)

The HackerOne report that does not even apply has 44 upvotes.

What do upvotes mean on HackerOne?

I guess, at least here, they're mindless "looks interesting" or "looks well worded" or something?

[–] Kissaki@programming.dev 3 points 3 months ago* (last edited 3 months ago)

The license doesn't get revoked. It does not apply to things it does not allow in the first place.

Some kind of restrictions are easier to describe and assess than others.

I doubt someone that generates AI slob reports would care about the restrictions anyway.

[–] Kissaki@programming.dev 3 points 3 months ago

3 hours, no chapters? :(

[–] Kissaki@programming.dev 12 points 3 months ago (1 children)

When you're working for Heinz, is it a mustard bottle?

[–] Kissaki@programming.dev 5 points 3 months ago* (last edited 3 months ago)

At my work we explored a low-code platform. It was not low on code at all. Beyond the simplest demos you had to code everything in javascript, but in a convoluted, intransparend, undocumented environment with a horrendous editing UI. Of course their marketing was something different than that.

That was not the early days of low-code mind you. It was rather recently; maybe three or four years ago.

[–] Kissaki@programming.dev 20 points 3 months ago* (last edited 3 months ago) (3 children)

I'd love to read a list of those instances/claims/tech

I imagine one of them was low-code/no-code?

/edit: I see such a list is what the posted link is about.

I'm surprised there's not low-code/no-code in that list.

[–] Kissaki@programming.dev 2 points 3 months ago

Correlation does not equal causation.

Are you saying Google paid for them to stop implementing pwa?

[–] Kissaki@programming.dev 2 points 3 months ago (2 children)

Start as in developing or as in hosting?

You're asking in a community called devs, implying you want to develop, but it seems like you want to only host?

[–] Kissaki@programming.dev 2 points 3 months ago* (last edited 3 months ago)

I looked at Wikipedia; Taler then Blind signature, then looked for docs on GNU Taler where I didn't immediately find any technical overview of how that works. Phind gave me a seemingly reasonable and understandable answer. (Surely sourced from somewhere.)

When we multiply the original message by rere, sign it, and then multiply by r−1r−1, the blinding factors cancel out while preserving the signature.

The success of this process relies on two critical properties:

  • The blinding factor must be relatively prime to N
  • The RSA keypair must satisfy the congruence relation red≡r(modN)red≡r(modN)

The magic is that you can

  1. Apply a mathematical operation on your data
  2. Sign that data
  3. Revert/Invert the mathematical operation

and the signature remains valid.

It does sound like magic. But isn't most of cryptography like that?

There's a python example in there as well, with such a calculation. I didn't go through it though.

[–] Kissaki@programming.dev 3 points 3 months ago

I just wanted to add an additional resource related to the topic.

view more: ‹ prev next ›