A small tool to view real-world ActivityPub objects as JSON! Enter a URL
or username from Mastodon or a similar service below, and we'll send a
request with
the right
Accept
header
to the server to view the underlying object.
{
"@context": [
"https://www.w3.org/ns/activitystreams",
{
"ostatus": "http://ostatus.org#",
"atomUri": "ostatus:atomUri",
"inReplyToAtomUri": "ostatus:inReplyToAtomUri",
"conversation": "ostatus:conversation",
"sensitive": "as:sensitive",
"toot": "http://joinmastodon.org/ns#",
"votersCount": "toot:votersCount",
"Hashtag": "as:Hashtag"
}
],
"id": "https://mastodon.sdf.org/users/EdS/statuses/108991358503817462",
"type": "Note",
"summary": "Maths, polynomials, random numbers",
"inReplyTo": null,
"published": "2022-09-13T13:35:49Z",
"url": "https://mastodon.sdf.org/@EdS/108991358503817462",
"attributedTo": "https://mastodon.sdf.org/users/EdS",
"to": [
"https://www.w3.org/ns/activitystreams#Public"
],
"cc": [
"https://mastodon.sdf.org/users/EdS/followers",
"https://mathstodon.xyz/users/ColinTheMathmo"
],
"sensitive": true,
"atomUri": "https://mastodon.sdf.org/users/EdS/statuses/108991358503817462",
"inReplyToAtomUri": null,
"conversation": "tag:mastodon.sdf.org,2022-09-13:objectId=55361069:objectType=Conversation",
"content": "<p>Challenge: Given a 33 bit shift register based random number generator, shifting 32 times to make a random integer, we observe that a given value will always appear twice in the sequence. Generally unevenly spaced. How to find a value which has the closest repeat?</p><p>We could run for 2^33 iterations and keep a record in a many gigabyte array, but I imagine there's a better way.</p><p>Boosts OK!</p><p><span class=\"h-card\"><a href=\"https://mathstodon.xyz/@ColinTheMathmo\" class=\"u-url mention\">@<span>ColinTheMathmo</span></a></span> </p><p><a href=\"https://mastodon.sdf.org/tags/math\" class=\"mention hashtag\" rel=\"tag\">#<span>math</span></a> <a href=\"https://mastodon.sdf.org/tags/maths\" class=\"mention hashtag\" rel=\"tag\">#<span>maths</span></a> <a href=\"https://mastodon.sdf.org/tags/polynomials\" class=\"mention hashtag\" rel=\"tag\">#<span>polynomials</span></a> <a href=\"https://mastodon.sdf.org/tags/lfsr\" class=\"mention hashtag\" rel=\"tag\">#<span>lfsr</span></a> <a href=\"https://mastodon.sdf.org/tags/prng\" class=\"mention hashtag\" rel=\"tag\">#<span>prng</span></a> <a href=\"https://mastodon.sdf.org/tags/pseudorandom\" class=\"mention hashtag\" rel=\"tag\">#<span>pseudorandom</span></a></p>",
"contentMap": {
"en": "<p>Challenge: Given a 33 bit shift register based random number generator, shifting 32 times to make a random integer, we observe that a given value will always appear twice in the sequence. Generally unevenly spaced. How to find a value which has the closest repeat?</p><p>We could run for 2^33 iterations and keep a record in a many gigabyte array, but I imagine there's a better way.</p><p>Boosts OK!</p><p><span class=\"h-card\"><a href=\"https://mathstodon.xyz/@ColinTheMathmo\" class=\"u-url mention\">@<span>ColinTheMathmo</span></a></span> </p><p><a href=\"https://mastodon.sdf.org/tags/math\" class=\"mention hashtag\" rel=\"tag\">#<span>math</span></a> <a href=\"https://mastodon.sdf.org/tags/maths\" class=\"mention hashtag\" rel=\"tag\">#<span>maths</span></a> <a href=\"https://mastodon.sdf.org/tags/polynomials\" class=\"mention hashtag\" rel=\"tag\">#<span>polynomials</span></a> <a href=\"https://mastodon.sdf.org/tags/lfsr\" class=\"mention hashtag\" rel=\"tag\">#<span>lfsr</span></a> <a href=\"https://mastodon.sdf.org/tags/prng\" class=\"mention hashtag\" rel=\"tag\">#<span>prng</span></a> <a href=\"https://mastodon.sdf.org/tags/pseudorandom\" class=\"mention hashtag\" rel=\"tag\">#<span>pseudorandom</span></a></p>"
},
"attachment": [],
"tag": [
{
"type": "Mention",
"href": "https://mathstodon.xyz/users/ColinTheMathmo",
"name": "@ColinTheMathmo@mathstodon.xyz"
},
{
"type": "Hashtag",
"href": "https://mastodon.sdf.org/tags/math",
"name": "#math"
},
{
"type": "Hashtag",
"href": "https://mastodon.sdf.org/tags/maths",
"name": "#maths"
},
{
"type": "Hashtag",
"href": "https://mastodon.sdf.org/tags/polynomials",
"name": "#polynomials"
},
{
"type": "Hashtag",
"href": "https://mastodon.sdf.org/tags/lfsr",
"name": "#lfsr"
},
{
"type": "Hashtag",
"href": "https://mastodon.sdf.org/tags/prng",
"name": "#prng"
},
{
"type": "Hashtag",
"href": "https://mastodon.sdf.org/tags/pseudorandom",
"name": "#pseudorandom"
}
],
"replies": {
"id": "https://mastodon.sdf.org/users/EdS/statuses/108991358503817462/replies",
"type": "Collection",
"first": {
"type": "CollectionPage",
"next": "https://mastodon.sdf.org/users/EdS/statuses/108991358503817462/replies?only_other_accounts=true&page=true",
"partOf": "https://mastodon.sdf.org/users/EdS/statuses/108991358503817462/replies",
"items": []
}
}
}