โฉ– powrelay.xyz

day week month year all
19 million hashes per byte
neat good.
Created at:
Tue Mar 25 09:51:44 UTC 2025
Kind:
1 Text note
Tags:
miner notemine
client https://sandwichfarm.github.io/notemine
nonce 1404078877 31
9 million hashes per byte
eggs good.
Created at:
Tue Mar 25 08:32:03 UTC 2025
Kind:
1 Text note
Tags:
miner notemine
client https://sandwichfarm.github.io/notemine
nonce 1960344963 31
5 million hashes per byte
coffee good.
Created at:
Tue Mar 25 08:09:28 UTC 2025
Kind:
1 Text note
Tags:
miner notemine
client https://sandwichfarm.github.io/notemine
nonce 61342398 29
2 million hashes per byte
meat good.
Created at:
Fri Mar 21 09:59:50 UTC 2025
Kind:
1 Text note
Tags:
miner notemine
client https://sandwichfarm.github.io/notemine
nonce 33825073 30
12 thousand hashes per byte
although its not necessary to use gzip if it turns out to be slow. i just used it because it achieved better compression than my custom compression algo...
Created at:
Sun Mar 23 11:46:38 UTC 2025
Kind:
1 Text note
Tags:
nonce 140875 18
p 4ed39cf4917f865bb6b096f88ea19d0860813696cec47037dc39ea6d4594f2ee
e 0000195c1079b66679f96f6fe3266285760eb7cb8628c7809f74e763a2f1a7bc
nonce 174659 18
5 thousand hashes per byte
hello!
Created at:
Sat Mar 22 18:30:38 UTC 2025
Kind:
1 Text note
Tags:
client getwired.app
nonce 1448336 21
4 thousand hashes per byte
what kind of classes we could use. well anything. - contains link - contains video - contains image - is less than 20 characters - is more than 20 characters - is over 100 characters - contains line break - pubkey contains two zeroes - pubkey has pow of at least 16 bit - is a reply - is kind 1 note - is kind 7 event - contains link to youtube - is a picture of car - is a picture of cat thats just 15 bits local search. of any classification information.
Created at:
Sun Mar 23 14:48:31 UTC 2025
Kind:
1 Text note
Tags:
nonce 140875 18
p 4ed39cf4917f865bb6b096f88ea19d0860813696cec47037dc39ea6d4594f2ee
e 0000195c1079b66679f96f6fe3266285760eb7cb8628c7809f74e763a2f1a7bc
nonce 664891 18
2 thousand hashes per byte
true anarchists transmit their photos in bmp however.
Created at:
Sun Mar 23 01:23:20 UTC 2025
Kind:
1 Text note
Tags:
nonce 1117319 18
p 32254c79c89036eba9a13d9d8a599ca71b0b4db4963fae5f46beeca2f25310a4
e 00001c333670cdce5a4e5a80fff638cb6eb2cfda3bc7dafbbc9df43bc393611e
nonce 527163 18
1 thousand hashes per byte
i think bitwise search could be pretty fast. how? tokenize data. each token is given a bit position. if token exists in data bit is 1, otherwise its 0. now find relevant rows in data with given input tokens. for example search could be: token1, token455, token664 create bitmask from the input data and apply to search data rows to find relevant results.
Created at:
Sat Mar 22 12:14:57 UTC 2025
Kind:
1 Text note
Tags:
nonce 284326 18
1 thousand hashes per byte
500 million notes takes: 20000/8*500000000/1000/1000/1000 1,25 TB if we can compress each row to 200 bits with method suggested in previous note, we have compressed search data of 500 million notes to: 200/8*500000000/1000/1000/1000 12,5 GB
Created at:
Sat Mar 22 12:33:25 UTC 2025
Kind:
1 Text note
Tags:
nonce 372985 18
p 2ceedb4c35a9e265b57b91ee7a371f3dffe84c65f5deb22afd9faf520b066274
e 00001b08f24f2cae56f5234e04060031d125ff77b497b5df5427a22ac29d25ff
nonce 310636 18
1 next >