Disclaimer: I don’t represent KDE in any interaction with this account. I am just freeloading off of the kde.social server.

  • 1 Post
  • 103 Comments
Joined 11 months ago
cake
Cake day: December 20th, 2023

help-circle













  • And more de-obf:

    #include <stdio.h>
    
    const char addarr1[]
    	= { 0x40, 0x40, 0x0,  0x40, 0x40, 0x40, 0x40, 0x0,  0x40, 0x40, 0x40, 0x40,
    		0x0,  0x40, 0x40, 0x40, 0x40, 0x40, 0x40, 0x0,  0x40, 0x40, 0x40, 0x0,
    		0x40, 0x0,  0x40, 0x40, 0x40, 0x40, 0x40, 0x0,  0x40, 0x40, 0x0,  0x40,
    		0x40, 0x40, 0x0,  0x40, 0x40, 0x40, 0x40, 0x0,  0x40, 0x40, 0x0,  0x40,
    		0x40, 0x40, 0x40, 0x40, 0x40, 0x0,  0x40, 0x40, 0x40, 0x40, 0x40, 0x40,
    		0x40, 0x40, 0x40, 0x40, 0x0,  0x40, 0x0,  0x0,  0x40, 0x40, 0x0,  0x40,
    		0x40, 0x0,  0x40, 0x40, 0x40, 0x40, 0x40, 0x40, 0x0,  0x40, 0x0,  0x40,
    		0x40, 0x40, 0x40, 0x0,  0x40, 0x40, 0x40, 0x40, 0x40, 0x40, 0x0,  0x0,
    		0x40, 0x0,  0x40, 0x40, 0x40, 0x0,  0x40, 0x0,  0x40, 0x40, 0x40, 0x40,
    		0x0,  0x0,  0x40, 0x40, 0x40, 0x0,  0x40, 0x40, 0x40, 0x40, 0x0,  0x40,
    		0x0,  0x40, 0x40, 0x0,  0x40, 0x40, 0x40, 0x40, 0x0,  0x40, 0x40, 0x0,
    		0x40, 0x40, 0x40, 0x40, 0x0,  0x40, 0x0,  0x40, 0x40, 0x40, 0x40, 0x0,
    		0x40, 0x40, 0x40, 0x0,  0x0,  0x0,  0x0,  0x0 };
    
    const char addarr2[]
    	= { 0x9,  0x26, 0x20, 0x39, 0x2f, 0x35, 0x32, 0x20, 0x2c, 0x2f, 0x36, 0x25,
    		0x20, 0x2c, 0x25, 0x34, 0x34, 0x25, 0x32, 0x20, 0x29, 0x33, 0x2e, 0x27,
    		0x34, 0x20, 0x27, 0x29, 0x36, 0x25, 0x2e, 0x20, 0x29, 0x2e, 0x20, 0x34,
    		0x28, 0x25, 0x20, 0x26, 0x2f, 0x32, 0x2d, 0x20, 0x2f, 0x26, 0x20, 0x28,
    		0x29, 0x27, 0x28, 0x2c, 0x39, 0x20, 0x2f, 0x22, 0x26, 0x35, 0x33, 0x23,
    		0x21, 0x34, 0x25, 0x24, 0x20, 0x3,  0x2c, 0x20, 0x29, 0x33, 0x20, 0x29,
    		0x34, 0x20, 0x32, 0x25, 0x21, 0x2c, 0x2c, 0x39, 0x20, 0x21, 0x20, 0x2c,
    		0x2f, 0x36, 0x25, 0x20, 0x2c, 0x25, 0x34, 0x34, 0x25, 0x32, 0x3f, 0xa,
    		0x9,  0x20, 0x24, 0x2f, 0x2e, 0x27, 0x34, 0x20, 0x2b, 0x2e, 0x2f, 0x37,
    		0x2c, 0x20, 0x22, 0x35, 0x34, 0x20, 0x37, 0x28, 0x21, 0x34, 0x20, 0x9,
    		0x20, 0x24, 0x2f, 0x20, 0x2b, 0x2e, 0x2f, 0x37, 0x20, 0x29, 0x33, 0x20,
    		0x34, 0x28, 0x21, 0x34, 0x20, 0x9,  0x20, 0x2c, 0x2f, 0x36, 0x25, 0x20,
    		0x39, 0x2f, 0x35, 0x21, 0x20, 0x3c, 0x33, 0xa };
    
    int main ()
    {
    	for (int i = 0; i < 152; i++)
    	{
    		char adder1 = addarr1[i];
    
    		char adder2 = addarr2[i];
    
    		char to_print = (char)adder1 + adder2;
    
    		printf ("%c", to_print);
    	}
    	return 63;
    }
    
    

    I guess I should have kept the recursion and straightened it out in the next step, but now that it’s done…

    The next step will just have an array of the characters that would be printed, so I’ll leave it here.


  • Here’s it with some amount of de-obfuscation:

    #include <stdio.h>
    short i = 0;
    const long b[]
    	= { 0xd60,  0x3200,  0x1ca8, 0x74e2, 0x9c,   0x66e8, 0x5100,  0x14500,
    		0x63b8, 0x49c6,  0xe0,   0x6200, 0x75e8, 0x57a6, 0xe8,    0x4300,
    		0x4500, 0x63b8,  0x49ea, 0xc6,   0x548e, 0x22,   0x75e8,  0x57a6,
    		0xc6,   0x2fae,  0x7486, 0x8a,   0xd72,  0x4f9c, 0x63c6,  0x4ea2,
    		0x809c, 0x66e8,  0x5100, 0x5c00, 0x71a2, 0x51b8, 0x4e9e,  0xc6,
    		0x6200, 0x70c4,  0x8022, 0x7d00, 0x439c, 0x63b8, 0x6ae0,  0x54c0,
    		0x47e8, 0xe2,    0x5192, 0x6fc4, 0x4900, 0x60e8, 0x100ca, 0x14fe8,
    		0x6000, 0x44e92, 0x6300, 0x57c4, 0xae,   0x4ecc, 0x62de,  0xc6,
    		0xafae, 0x70c4,  0x9e,   0x4ec6, 0x639c, 0x5100, 0x4ecc,  0x74a2,
    		0x9e,   0x54e8,  0x7100, 0x608a };
    const long n = 9147811012615426336;
    long
    main ()
    {
    	if (i < 152)
    	{
    		char shifter;
    		if (i % 2 == 0)
    		{
    			shifter = 8;
    		}
    		else
    		{
    			shifter = 1;
    		}
    		char adder1 = (b[i >> 1] >> shifter) & 64;
    
    		char adder2 = (n >> (b[i >> 1] >> shifter)) & 63;
    
    		char to_print = (char)adder1 + adder2;
    		i++;
    		main ();
    		printf ("%c", to_print);
    	}
    	return 63;
    }
    

    Needless to say, the return value doesn’t matter any more. So you can change it to 0 or 69 depending upon your preferences.




  • For the average Indian, it would be just a minor inconvenience. Having to visit a site full of ads and half-assedly written information, whenever they want to know something new, is the price they will pay.

    For Uni students, looking for stuff to plagiarise, it won’t be much different either, as most of the times, Wikipedia is considered a less reliable source than a shady website having 10’s of ad popups leading to malicious targets. Probably because the one grading it, only has to check to make sure it is not a Wikipedia URL and doesn’t really need to actually open the link to see here it leads.

    Wikipedia kinda works like a Democracy of the type, ‘Logical Consensus’, making it very hard for people to just throw money at it to get false information shown, at least on topics with enough hands-on people[1]. This makes it very unappealing for political campaigns. Meaning, Govt. doesn’t have a reason to care for it.

    What we lose:

    • As a kid, most articles I read on Wikipedia were Science and Technology related. They seemed to have a certain amount of care put into writing them and I picked up a bit of “care” from it.
      • We lose this potential positive influence on future inquisitive children, which will probably turn to video based sources (assuming they don’t just give up and go back to WhatsApp/X/other stuff). While video based sources are also fine, IMHO, the way Wikipedia tends to have stuff laid out, is a really nice way to let people learn new stuff, which might be leagues away from their on level and domain.

    What Wikipedia loses:

    • India has a lot of people. A lot of them would be contributing to the information in it. That is lost.
      • Catch: A lot of the Indians in Science and Tech tend to just emigrate. So, Wikipedia still has those.
      • Blind Spot: I don’t really read much other than Science and Tech and won’t be able to assess the amount and value of other articles. By extension, the contribution by resident Indians to those.

    What Wikipedia as a company, loses:

    • A bit of money maybe.
      • Though still much less than what ANI is trying to extort

    What I gain:

    • Another reason to consider emigration
    • A reason to vote. And not incumbency this time.

    What happens if Wikipedia pays out?

    • A precept
      • I’d rather have WMF block Indian access, than this happen.

    Anti Commercial-AI license


    1. as compared to a normal democracy, which only relies on number of people supporting a decision ↩︎


  • Wikipedia vs Delhi HC Judge’s Actions

    Wikipedia explained that the delay had been caused as the platform didn’t have any physical presence in India.

    • Wikipedia here, explaining that they have a limited ability and asking HC to be reasonable.

    “We will close your business transactions here”

    • Judge, realising they are showing weakness, increasing threat level.

    Current actions vs Past actions

    • Refer “Relevant Article” in the post.
    • Low impact companies asked Supreme Court and were shot down
    • Company with a high standing and a potential political backing, asks the High Court and gets full attention
      • On top of that, Delhi HC Judge decides to move to “Contempt of Court”, making it much harder for Wikipedia, in case they move Supreme Court (SC) in the future, for a re-trial
      • I feel like this would have gone differently had ANI gone to SC from the beginning.

    Writing this part separately in a comment, because I understand this includes my bias.

    Also, if I don’t interact with any comments later, please excuse me. GOI might have stopped my internet, just for posting this, because they can.