I think you could do it at runtime with O(n^2) by examining reentry stack
Post by twetch#2782
Well most languages have a stack depth limit, and in any case it would be depth^2 not n^2. But yeah it gets pretty unwieldy pretty quick.
What the chain says
- Block
- 658 203
- Time
- 2020-10-24T01:47:44Z
- Signer
- 1486QpNpWYjokSfc3DxChCQG6gS2cTvVpL
- App
- twetch
- Type
- post
- Content type
- text/plain
- Name in tx
- twetch#2782
Fields the transaction did not carry are omitted. Open the payload to see the bytes as stored.
Signed by
1486QpNpWYjokSfc3DxChCQG6gS2cTvVpL Verified