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"
}
],
"id": "https://mastodon.cr.yp.to/users/djb/statuses/110780690497105946/activity",
"type": "Create",
"actor": "https://mastodon.cr.yp.to/users/djb",
"published": "2023-07-26T13:46:28Z",
"to": [
"https://www.w3.org/ns/activitystreams#Public"
],
"cc": [
"https://mastodon.cr.yp.to/users/djb/followers"
],
"object": {
"id": "https://mastodon.cr.yp.to/users/djb/statuses/110780690497105946",
"type": "Note",
"summary": null,
"inReplyTo": null,
"published": "2023-07-26T13:46:28Z",
"url": "https://mastodon.cr.yp.to/@djb/110780690497105946",
"attributedTo": "https://mastodon.cr.yp.to/users/djb",
"to": [
"https://www.w3.org/ns/activitystreams#Public"
],
"cc": [
"https://mastodon.cr.yp.to/users/djb/followers"
],
"sensitive": false,
"atomUri": "https://mastodon.cr.yp.to/users/djb/statuses/110780690497105946",
"inReplyToAtomUri": null,
"conversation": "tag:cr.yp.to,2023-07-26:objectId=25170:objectType=Conversation",
"content": "<p>Formally verified theorems about decoding Goppa codes: <a href=\"https://cr.yp.to/2023/leangoppa-20230726-verify.html\" target=\"_blank\" rel=\"nofollow noopener noreferrer\" translate=\"no\"><span class=\"invisible\">https://</span><span class=\"ellipsis\">cr.yp.to/2023/leangoppa-202307</span><span class=\"invisible\">26-verify.html</span></a> This is using the Lean theorem prover; I'll try formalizing the same theorems in HOL Light for comparison. This is a step towards full verification of fast software for the McEliece cryptosystem.</p>",
"contentMap": {
"en": "<p>Formally verified theorems about decoding Goppa codes: <a href=\"https://cr.yp.to/2023/leangoppa-20230726-verify.html\" target=\"_blank\" rel=\"nofollow noopener noreferrer\" translate=\"no\"><span class=\"invisible\">https://</span><span class=\"ellipsis\">cr.yp.to/2023/leangoppa-202307</span><span class=\"invisible\">26-verify.html</span></a> This is using the Lean theorem prover; I'll try formalizing the same theorems in HOL Light for comparison. This is a step towards full verification of fast software for the McEliece cryptosystem.</p>"
},
"attachment": [],
"tag": [],
"replies": {
"id": "https://mastodon.cr.yp.to/users/djb/statuses/110780690497105946/replies",
"type": "Collection",
"first": {
"type": "CollectionPage",
"next": "https://mastodon.cr.yp.to/users/djb/statuses/110780690497105946/replies?only_other_accounts=true&page=true",
"partOf": "https://mastodon.cr.yp.to/users/djb/statuses/110780690497105946/replies",
"items": []
}
}
}
}