@movq@www.uninformativ.de What if I told you there were in fact zero account(s) at all? And that you signed into your own instance or a multi-user instance with your own SSH key? 🔑 Hmmm? 🧐

@movq@www.uninformativ.de In the meantime tell me all your “wishes” and things you wish/want a good decent “pure” decentralised Git forge should do 😅

@movq@www.uninformativ.de Good 😊

I am finally building a Twtxt / Yarn.social inspired Git forge. I’m actually quite confident that y’all will quite like it, but I won’t post links yet until I’m quietly confident in its design, functionality and behaviour(s).

Stay tuned 🤞 It’ll be like no other Git forge you’ve ever seen! 🤣 Actually, it’s already more like cgit than anything with plain text feeds that power it’s “pure decentralization” as you can no doubt imagine 😅 #twtxt #git #forge

@Sumomo@sumomo.neocities.org All good 👍

@movq@www.uninformativ.de I am seriously rethinking and re-contemplating building a new Git forge of some description that avoids all of these stupid problems that we’re now seeing in the wild

@Sumomo@sumomo.neocities.org if you’re looking for a great static site generator/publishing tool by the way have a look at my project ZS

@thecanine@twtxt.net some people in this world are just giant douche bags and complete sociopaths 🤯

@movq@www.uninformativ.de Maybe I’m using the wrong term, ya know, silos and bubbles and all that 😅

@movq@www.uninformativ.de That depends. What do you mean by “The Internet”? 🤔 If you mean a bunch of large centralised sites where a majority of the world’s Internet traffic goes, then yeah, it’s boring as bat shit™ – Largely because of the concept (I think) of “confirmation bias”.

@Sumomo@sumomo.neocities.org You should report the bug and hopefully get it fixed 🤞

@Sumomo@sumomo.neocities.org Oh this is cool! 😎 It supports all v2 specs, nice! 👍

@Sumomo@sumomo.neocities.org I haven’t heard of that client before? 🤔 Got a link to it? screenshtos? Should I add it to the Listed Clients? 🤔

@Sumomo@sumomo.neocities.org Ahh if you’re using the ‘ol twtxt client from buckket, that thing isn’t really maintained anymore. I recommend you check out one of the clients listed on https://twtxt.dev or even just https://twtxt.app

@Sumomo@sumomo.neocities.org What client are you using btw? 🤔 Does it support threads, and other v2 specs? 🤔

@Sumomo@sumomo.neocities.org Hello 👋

Similar here 🥳 9 days then i’m off for 3 weeks. but really 20 working days!

@fossham@twtpub.com I hope you enjoy it 😅 You might want to update your Avatar and Description at some point in your settings 👌

@thecanine@twtxt.net LOL 😂

@lyse@lyse.isobeef.org Haha 😆 Don’t temp me 😅

@jastas@twtpub.com Out of curiosity, was it hard to figure that out, or just familiarity with the app? 🤔

@jastas@twtpub.com That’s me! 👋 Haha 😆 Welcome to Yarn.social / Twtxt 🙌

@fossham@twtpub.com Hey 👋 Welcome to Yarn.social / Twtxt 👌

@smmbear@twtpub.com Hey 👋 Welcome to Yarn.social / Twtxt 👌 Just in case you are not ware a) spam is not really tolerated by this community and b) doesn’t work anyway, you’ll just be ignored, and there are exactly zero ways to promote spam or advertise on this social system – on purpose.

I have to say. I’m really very disappointed in Microsoft. Not only did they buy out Minecraft the game, but they basically ruined it for every privacy conscious family, parents and their kids, who can no longer play the game without giving away personal identifiable information (PII) on my children that Microsoft have zero rights to. 🤦‍♂️ – Honestly… Fuck you Microsoft.

@klaxzy@klaxzy.net That set is the set of users that actually interact with one another. The “Twtxt” feed set is a bit larger, but mostly just “walls of posts” and little to no inteaction. So yeah, the real community is quite small sadly 😅

@GabesArcade@gabesarcade.com You weren’t/aren’t able to fin dmore open, less privacy evading “smartthings” ?

@klaxzy@klaxzy.net This is a good idea. I do something very simialr.

@GabesArcade@gabesarcade.com What kind of IoT devices are we talking about here?

@klaxzy@klaxzy.net I hear you! haha

Too much information? 🤔

@arg@twtpub.com You actually can, but we highly discourage it and I haven’t really built “Edit” / “Delete” functionality in the Twtxt App that I know you’re using 😅 Twtxt being purely decentralised, meaning that there are absolutely zero decentralised, with the exception of the twtpub.com service you’re using to reduce as much friction as possible for newcomers to try things, makes supporting threads a bit of a controversial topic 😆 – In the end we are sticking with the Hash v2 extension, making threads use content addressing, so even if you did delete/edit a Twt, you have to be carefuly it hasn’t already been replied to in the ecosystem 🤣

@david@daiwei.me Haha 😆

@arg@twtpub.com Hello! 👋

@murad@twtxt.net Yes things do work 🤣

@murad@twtxt.net Welcome to Yarn.social / Twtxt 🥳 You might want to fiddle a bit with your settings, maybe a nice avatar, description, maybe a few links, etc 😃

@itsericwoodward@itsericwoodward.com Dropped you en Email 📧

@itsericwoodward@itsericwoodward.com Can I count you in as a potential customer then? I’ll find a way to DM and share details with you. But rest assured it’ll have everything you could possibly want 😅

@david@daiwei.me I’ll DM you 😅

@david@daiwei.me Haha 🤣

@creeper@twtpub.com Hey ! 👋 Welcome to Yarn.social / Twtxt 🤗

$599 retail purchase
$9.95/month optional subscription

☝️ Would you pay this for a fully self hosted home cloud? 🧐

And just like that Problem 10 is done and correct whoohoo 🥳 It was easy because in Problem 7 I’d already written an iterator to produce infinite primes. So the solution for finding the sum of primes under 2,000,000 is basically (shortened):

  primes := iter.take_while(iter.filter(prime_candidates(), is_prime), fn(p) { p < n })
  print(iter.sum(primes))

And of course the answer is: 142913828922 which took ~21.ss for the Go Vm to compuete.

What’s interesting here… Which is the interesting thing about Mu is the dual runtime. So the above solution for Euler Problem 9 finds the solution in ~429ms with the Go VM and ~327ms natively compiled to darwin/arm64. Not bad for a language I haven’t really done any optimization work on yet (correctness first obviously).

Oh man wow 😮 Problem 9 was quite hard 😱 I had to build two new functions in the Mu stdlib for computing combinations and permutations, but then the combinations of range(1000) for triples such as a + b == c is enormous! So i had to write iterator versions of these to do lazy evaluation. Anyway solution follows:

#!/usr/bin/env mu

// Special Pythagorean Triplet

import "iter"

fn usage() {
  print("Usage:", args()[0], "<n>")
}

fn sqr(x) { x * x }

fn main() {
  if len(args()) < 2 {
    usage()
    exit(1)
  }

  n := must(int(args()[1]))
  print("n:", n)

  // For a < b < c and a + b + c == n, both a and b are strictly less
  // than n/2. Generate only (a,b) combinations and derive c directly. This
  // keeps the search lazy and reduces n=1000 from C(999,3) = 165,668,499
  // candidate triples to C(499,2) = 124,251 candidate pairs.
  pairs := iter.combinations(iter.range(1, n / 2), 2)

  triples := iter.map(pairs, fn(xs) {
    a := xs[0]
    b := xs[1]
    return [a, b, n - a - b]
  })

  // Enforce b < c; a < b is already guaranteed by combinations over an
  // increasing range, and a + b + c == n holds by construction.
  triples = iter.filter(triples, fn(xs) {
    return xs[1] < xs[2]
  })

  // Euler 9 has one answer for n=1000. find() stops the entire upstream
  // iterator chain as soon as the first Pythagorean triple is found.
  answer := iter.find(triples, fn(xs) {
    return sqr(xs[0]) + sqr(xs[1]) == sqr(xs[2])
  })

  print(answer)

  if answer != nil {
    print(answer[0] * answer[1] * answer[2])
  }
}

main()

It is such a nice feeling that Mu is such a capable little language 😅 And I decided to write code code in Mu by hand 🤚 haha 🤣 and start solving Project Euler problems, like Problem 8 which works out to be a nice elegant solution in Mu:

#!/usr/bin/env mu

// Largest Product in a Series

import "fp"
import "sys"

fn usage() {
  print("Usage: cat |", args()[0], "<n>")
}

fn products(xs) {
  return fp.reduce(xs, 1, fn(x, y) {
    if y == nil {
      return x
    }
    return x * y
  })
}

fn main() {
  if len(args()) < 2 {
    usage()
    exit(1)
  }

  s := must(sys.read_all(0))
  if len(s) == 0 {
    usage()
    exit(1)
  }

  n := must(int(args()[1]))
  r := fp.max(fp.map(fp.sliding(fp.map(s, int), n), products))
  print(r)
}

main()

@anth@a.9srv.net Haha 😆

but yes, however you cannot currently add it or delete post via the app as I haven’t really built that feature at the moment you technically can do it, but you do run into some challenges with breaking threads if you’ve already published something and then go back and edit it so we generally advise not to do that too much if you can help it

@brytboi@twtpub.com I hope you’re seeing my replies because you absolutely can scroll up in the app. Let me know if you’ve run into a bug though and report it to me so I can fix it immediately!

@brytboi@twtpub.com no a subset of markdown is fully supported by the app!