Event JSON
{
"id": "db36a77a2b9afc141781717ef0a4b2176a9d8ec800b522bc1c472e9c1c6068aa",
"pubkey": "b207166394eefb74ce15a052d1559a09d364e8259d639fb7335cd64a269595e3",
"created_at": 1733771651,
"kind": 1,
"tags": [
[
"p",
"b4c50e1bc1d7c4e1372d0c767c4705509f070b0f3109447d90cd0eb34a992896",
"wss://relay.mostr.pub"
],
[
"p",
"f7346eb283902ada9d21c109a93e83128d9f87d8fcfe70ad819b3bf2ad9bce16",
"wss://relay.mostr.pub"
],
[
"e",
"02bc1582ade2aeb975ca58e97db89ffe071e8decc4e05abbb848512031f49b63",
"wss://relay.mostr.pub",
"reply"
],
[
"proxy",
"https://mathstodon.xyz/users/ducasleo/statuses/113624458947144274",
"activitypub"
]
],
"content": "nostr:nprofile1qy2hwumn8ghj7un9d3shjtnddaehgu3wwp6kyqpqknzsux7p6lzwzdedp3m8c3c92z0swzc0xyy5glvse58txj5e9ztqaufa4k These fast convergences play a key role for security proofs in lattice-based cryptography. There, they are rephrased as Gaussian distribution modulo a lattice \\(L\\) quickly converging to the uniform distribution over the torus \\(\\mathbb R^n/L\\) as the variance increases (a property called smoothness).",
"sig": "01ef528b6f54595f7354ba64edd9a0074e6dcb29647e31a56e6572ba262d89e6a0a72fad6c7b5ce4380f7e45a39f99f959cb20548a99af2c84683d3a09a29494"
}