Ok, so I wrote up a quick piece on the spurious and bullshit "dispute" over the Dec 16 crowdstrike D-30.apk blog post. They made a minor error allowing their credibility to be called into question. I provide additional data + analysis to spike that bollocks: https://medium.com/@thegrugq/voice-of-russia-50ae874777ca
throw-back to 'ask the geneticist' - shows that mathematicians aren't the only ones that feel this way.... https://mastodon.social/media/7bsUB5v8ER4q7YVmFBk
nice afternoon reading - UAC bypass on Win10 using disk cleanup
QM and crypto
Ok, WTF with the 'quantum resistance' claims? They're getting f*cking stupid now.
The problem is this - the claim that there is no quantum efficient algo in existence is the only argument for the 'resistance' of certain algos.
I've explained this to a number of friends in complexity and QC/Computing over Quantum systems - they *ALL* think this argument is BS. It needs fixed.
I have a solution. But it's like a FB rel. status; complicated.
It's kinda weird to think about a social network where businesses own their own presences, rather than relying on a capricious third party service like Twitter or Facebook. Imagine NBC or The Verge running a Mastodon instance for their reporters to toot from, or Bethesda operating an instance for PR and customer support. No more lost business when Facebook changes their algorithms again because they need more money from boosted posts.
PhD rant and foul lang.
In other news, I have a PA-unprovable combinatorial thing/object/theorem that shows how relatively simple combinatorial ideas, in this case tilings, can be made to have properties independent of a 'reasonable' theory of arithmetic. Also, I've done it by making the original Domino Problem unprovable in PA in a very obvious sense - still, doesn't feel like a real theorem. Feels like I just pointed out the glaringly obvious... O.o
PhD rant and foul lang.
So, I can't currently reconcile two ways of thinking about hypergraphs and it's driving me up the fucking wall. Trying to fix the lack of existence of results on hypergraph colourings seems a futile task. They split into combinatorially complex objects in an instant.
I'm wondering, too, if there is some new way of thinking about transforms of hypergraphs in an algebraic-topological way; Homologies as colour mappings between pre-coloured graphs. idk.
I think I'm losing it
I am not reading comments on Hacker News because I pretty much remember all the various sentiments from my first "Show HN", and I do not have the energy to also answer questions there
But as others have pointed out, these are all nice problems to have. I am so happy that people are finally using my work at large. <3
graphic images. blood. worker exploitation.
I interviewed delivery riders working in Melbourne's online gig-economy https://medium.com/p/meet-the-food-delivery-workers-in-the-decentralised-dickensian-online-gig-economy-8dc100e1f2b7
PhD student in Mathematics, Researcher/Consultant in security. Jazz thinker w/out portfolio. Specialises in hardware security and anything considered 'tricky'
Server run by the main developers of the project It is not focused on any particular niche interest - everyone is welcome as long as you follow our code of conduct!