<unnamed>

Public Key

npub1rnugpdng46tm462e2a5xza78gq468nkywd63rt59ll6jqaspw30sen5d2g

Profile Code

nprofile1qqspe7yqke52a9a6a9v4w6rpwlr5q2aremz8xag346zllafqwcqhghcprpmhxue69uhhyetvv9ujuumwdae8gtnnda3kjctvqy28wumn8ghj7un9d3shjtnyv9kh2uewd9hszrthwden5te0dehhxtnvdakqsmhdel

Publishing to

relay.snort.social

relay.damus.io

nos.lol

Last Notes

2026-01-01 10:22:55 CET

another take
what if there was one master key which is only used by specific minimal app. this app publishes list of authorized subkeys. each of these subkey in practice publish content to the pubkey corresponding to the master key.
master key can at any point add or revoke these subkeys by publishing updated list.

2026-01-01 09:50:01 CET

iris files is the new mega

2026-01-01 09:36:06 CET

my take on key rotation
a new event is published, which announces new key and freezes the existing key making all further events from that key to be ignored by relay
in addition maybe relay should allow delete events from the newly announced key towards the frozen key
#devstr

2025-12-30 21:51:03 CET

- reply

can you post a longer version

2025-12-30 21:49:24 CET

- reply

the thing is like you have relays, like here is > 800
https://api.nostr.watch/v1/online
then any post can be on any relay basically
it may be complex, but at the same time it means you can even have tor relays etc.

2025-12-29 22:43:39 CET

tbh its worse than on mastodon

2025-12-29 22:41:59 CET

its really quite simple what the problem of nostr is
there is wot by default, but when you dont follow anyone, you dont see any content
there is a search bar on every app, but it does not show any results in any app

2025-12-29 21:11:17 CET

- reply

any more of this gurl?

2025-12-29 20:21:04 CET

- reply

the first part is true, right?

2025-12-17 18:16:18 CET

well that was quite a hallucination.
it seems edit is kind 1010...
#nevent1q…6uwy

2025-12-17 18:01:53 CET

- reply

can you give example tagging / event structure? i want to find one note that has been edited.

2025-12-17 17:56:44 CET

@npub1pm5…xe07
does amethyst implement editable notes, and if so how? are kind 1 editable or only 1111?

2025-12-01 09:23:05 CET

# here is a vibe coded a hash function with each step broken down and printed in binary
# this is the basis of cryptographic hashing functions
# note how each step is deterministic operation, no single step can make the process secure:
# --> we cannot identify a single thing that makes cryptographic hashing secure
# security is based on assumption that random looking probabilities in output (avalanche effect) makes the hash secure
####
import sys
def print_hash(prefix, hash_val):
text = bin(hash_val)[2:].zfill(16)
print(prefix, ' '.join([text[i:i+8] for i in range(0, len(text), 8)]) + "\n")
def minimal_crypto_hash(data, key=int("1001100110111", 2)):
if isinstance(data, str):
data = data.encode('utf-8')
# Initialize with key
hash_val = key & int("1111111111111111", 2)
print_hash("hash_val k", hash_val)
# Process each byte with nonlinear operations
for byte in data:
print("byte ", "0" * 8, bin(byte)[2:].zfill(8))
print_hash("hash_val s", hash_val)
print("# XOR with input byte")
hash_val ^= byte
print_hash("hash_val a", hash_val)
print("# Nonlinear transformation - multiplication with odd constant 1100101100011")
hash_val = hash_val * int("1100101100011", 2)
print_hash("hash_val b", hash_val)
print("bitwise and 1111111111111111")
hash_val = hash_val & int("1111111111111111", 2)
print_hash("hash_val g", hash_val)
print("# Bit rotation for better mixing, bitwise OR")
hash_val = (hash_val >> 3) | (hash_val << 13)
print_hash("hash_val c", hash_val)
print("# bitwise AND")
hash_val = hash_val & int("1111111111111111", 2)
print_hash("hash_val c", hash_val)
print("# Another nonlinear step, shift hash_val >> 7")
hash_val ^= (hash_val >> 7)
print_hash("hash_val d", hash_val)
print("# multiply by 1010101111001101")
hash_val = hash_val * int("1010101111001101", 2)
print_hash("hash_val e", hash_val)
print("# bitwise and 1111111111111111")
hash_val = hash_val & int("1111111111111111", 2)
print_hash("hash_val h", hash_val)
return hash_val & int("1111111111111111", 2)
final_hash = minimal_crypto_hash(sys.argv[1])
print_hash("hash_val f", final_hash)
print("final_hash", bin(final_hash)[2:], hex(final_hash))