Post AUsphChHeTId5KwnNQ by arnelson@mastodon.online
 (DIR) More posts by arnelson@mastodon.online
 (DIR) Post #AUcxsvPrl2lM1uox16 by arnelson@mastodon.online
       2023-04-14T01:26:42Z
       
       10 likes, 13 repeats
       
       Very funny, W3C.
       
 (DIR) Post #AUsSmUUwb7SQnPjB1E by teknomunk@apogee.polaris-1.work
       2023-04-21T13:02:39Z
       
       0 likes, 0 repeats
       
       @arnelson They aren't wrong. But they did repeat themselves there...
       
 (DIR) Post #AUsphBk5CZwc7jFW6K by arnelson@mastodon.online
       2023-04-14T03:27:10Z
       
       0 likes, 0 repeats
       
       Upon finding an implementation of this spec (https://github.com/digitalbazaar/rdf-canonize), I realize the W3C has a point. I'm just going to take the code I need from this repo and never look at it again.The algorithm involves repeatedly hashing and rehashing different permutations of graph nodes to find a canonical ordering, *with no guarantee it will ever terminate*.
       
 (DIR) Post #AUsphChHeTId5KwnNQ by arnelson@mastodon.online
       2023-04-14T03:32:10Z
       
       1 likes, 0 repeats
       
       statements dreamed up by the Utterly Deranged