nprofile1qy2hwumn8ghj7un9d3shjtnddaehgu3wwp6kyqpqdhnn6acp8d933rcmkrw8vceqfhyfr26jw4a9katmwqhqelwkc50swqrcc0 (nprofile…rcc0) nprofile1qy2hwumn8ghj7un9d3shjtnddaehgu3wwp6kyqpqxwvms30rp75asklr8drmhrunk70trncl3munceghqk6x26vtfhjqsehd2u (nprofile…hd2u) your thing might be exponential somewhere. like it tries too many possible combinations.
imagine something like this, where at each of the little loops you can take the top or the bottom path. that would be 2^n, if you enumerate all paths
https://talk.marq42.xyz/files/9069aa6d-6eac-4a2b-98ee-b64a803c16c9
greeeeen :v_alloaro_2: (girlfriend arc) /
npub1vm…2gx8k
2024-12-18 19:41:55
in reply to nevent1q…v96q
Author Public Key
npub1vmz0ra5ct5m6ptcs9482w7uk4thl63rd7swv8mqq5jw6lh0rkngss2gx8kPublished at
2024-12-18 19:41:55Event JSON
{
"id": "04526234357d0dc0aa5da25fcf2b2fc43fc2299be6f5f8735f999cc3db421ed5",
"pubkey": "66c4f1f6985d37a0af102d4ea77b96aaeffd446df41cc3ec00a49dafdde3b4d1",
"created_at": 1734550915,
"kind": 1,
"tags": [
[
"p",
"6de73d77013b4b188f1bb0dc7663204dc891ab52757a5b757b702e0cfdd6c51f",
"wss://relay.mostr.pub"
],
[
"p",
"3399b845e30fa9d85be33b47bb8f93b79eb1cf1f8ef93c651705b465698b4de4",
"wss://relay.mostr.pub"
],
[
"p",
"a165e2c61e5bc7612f4fe5f5f08470b16d325f295e0b8030676818209fdd9b84",
"wss://relay.mostr.pub"
],
[
"p",
"adbc2c9a56a5248c61777acc0b8c64eb5f942a44e5240987b28a67684b8db41a",
"wss://relay.mostr.pub"
],
[
"e",
"d46d9a7177c6f942dc43a6fcc484be6c5fbafffb06d0166ad3d491a32df24cd1",
"wss://relay.mostr.pub",
"reply"
],
[
"content-warning",
"Advent of Code day 16 part 2 hint; no alt text"
],
[
"imeta",
"url https://talk.marq42.xyz/files/9069aa6d-6eac-4a2b-98ee-b64a803c16c9",
"m image/png"
],
[
"proxy",
"https://talk.marq42.xyz/notes/a1xv55n9loan3f1n",
"activitypub"
]
],
"content": "nostr:nprofile1qy2hwumn8ghj7un9d3shjtnddaehgu3wwp6kyqpqdhnn6acp8d933rcmkrw8vceqfhyfr26jw4a9katmwqhqelwkc50swqrcc0 nostr:nprofile1qy2hwumn8ghj7un9d3shjtnddaehgu3wwp6kyqpqxwvms30rp75asklr8drmhrunk70trncl3munceghqk6x26vtfhjqsehd2u your thing might be exponential somewhere. like it tries too many possible combinations.\n\nimagine something like this, where at each of the little loops you can take the top or the bottom path. that would be 2^n, if you enumerate all paths\n\nhttps://talk.marq42.xyz/files/9069aa6d-6eac-4a2b-98ee-b64a803c16c9",
"sig": "dd9fd4dc0a65c76b752ea651f8d845d328540b76ef6b208b579aa6bf81de739b2620eb648a0684ec63522f331d62bb3dca94ce5b41c9da456b5fd0d89602bdb5"
}