u/Aktem

They're a consultancy firm and this is a Rust framework. But you're right, I recycled a domain I owned from my old blog and the overlap is confusing. Renaming is on my priority list.

One thing here I forgot to mention, the graph is the data plane. There are also control plane messages that can be packed into the envelope. Say a DHT or gossip protocol which the graph sources peers from.

These would surface a component address rather than a NodeSiteID as they have no in graph destination but are use to maintain state for the progression of the graph.

I'm pretty sure this is an ad haha, but it is an interesting point and I've thought about it but really only have it partially built out right now.

Today trace spans can be enabled in the runtime to watch IO and graph progression you would just need a subscriber like Otel.

Right now the engine only surfaces a few of the InfraEvent enums when stepping. But things like PeerSuspect, PeerDown, PeerLive, BackoffNoticeSent, SilentDropActive, WireDecodeFailure, ..., etc. which all contain the meta data needed for the engine to handle them appropriately would be perfect for this kind of audit.

You can wire up an in-graph subscriber today using the EventSource syscall. It will fire a trigger whenever an InfraEvent of that kind publishes but it would only deliver the tag and not the bytes. So I should definitely add a component that lets you subscribe and emit internal events to the application.

Sans IO also means you can inspect every envelope if you really wanted to and it would have peerId, protocol (really a NodeSiteID for the dest node in the local nodes graph), raw bytes needed for

Once the event subscriber is in it would fall on the application to build there log system around it, I don't want to bog down a execution engine with a logging system especially when I want to run this in environments without filesystems.

We have a bot lane dm me

Oh interesting. What's your domain?

With RAG so popular and seemingly working, doesn't that indicate that practicly we can treat them as such?

If my understanding is correct, ANN techniques assume that close embeddings are semantically similar. If the embedding space isn't smooth, then that's not always the case?

What is your project? I'm working on a distributed vector store project and wondering if you have something I haven't read yet.

This is pretty cool! I Dmed you and would love to talk about it more.

It looks like we keep missing each other on here. You can join this server and DM matthebat

https://discord.gg/xhPY3FE5

Look forward to talking to you!

Hey left you a dm!

If you're serious, this is what I've been working on

https://github.com/matthew-alexander-love/gossipsampling

Can someone recommend resources to find conferences? I'm outside academia and not sure where to look but would like to attend.

It depends on how powerful you still consider embedded. Arm has SoC's with MMU's that support 2 levels of address virtualization ie hyperviser - os and os - application. they were designed in hardware for virtualization.

The lines between PC and Embedded are blurring as edge devices get faster and more connected. (A cliche sounding statement I know)

I looked for the documentation i have printed out that i found from a google search about a year back but cant find it. If your motivated enough, its probably still there lol.

Regarding just the contraints, you can put linux on a system without an mmu, but trying to run all the virtualization in just software on a low frequency, power constrained system sounds unusable.

There are four common flags (at least this I know to be True in ARM)

Z: zero flag: indicates that the result is zero. - if what comes out of the adder is all 0

C: carry flag: set to 1 if what came out of the adder resulted in a carry out ( could be an unsigned addition overflow

N: negative conditoon: set to 1 if the last thing put of the adder was negative when viewed as a signed integer.

V: overflow conditon: set if most significant bit of the operands is the same & most significsnt bit of the result is different othere wise it is 0

Its useful to note that the processor does not know whether the data is signed or unsigned when setting these bits and it up tp the program to use these flags correctly.

Hope this helps