Organize the forwarding of encrypted messages so that they can be checked for content changes and status control?

Question

Distributed Computing

I ran into the following rather theoretical problem. I don't have any ideas how to approach it.
The sender sends a message (I, Ch, S), where I is the content of the message itself, Ch is the chain of senders/recipients, and S is just some sum. Upon receipt of the letter, the addressee sees (I, Ch, S), then he can accept or reject the message, for example, if it meets or does not meet his requirements for content, amount or chain of senders. When receiving a message, he acquires the right to forward the message as many times as he likes. When a message is sent, its name is added to the Ch chain, while the sum S of all forwarded messages must be equal to the sum S of the initial message received by it.
Example. Alice sends <"First Message", Alice, 500> to Bob, and Bob forwards <"First Message", (Alice, Bob), 500> to Daenerys. Daenerys sends <“First Message”, (Alice, Bob, Daenerys), 300> to Jon and <“First Message”, (Alice, Bob, Daenerys), 200> to Tyrion.
Accordingly, the recipient of such a message must be sure of the content of the message I, that the names in the chain of senders Ch were left by those who are declared, and the sum S was calculated according to the rule that the sum indicated in all final messages is equal to the sum in original message.
I understand that with this description it sounds like a blockchain, but as far as I can tell, the blockchain is not a messenger and is not well suited for messaging.
Thank you.

Answer 1

The AH protocol in IPSec can do this. Google it.

Answer 2

everything is far -fetched in the blockchain, including messages, you can search)
there is no more practical sense in the invented blockchains than in your porridge
as for
read the school proof of the impossibility of dividing by zero and formulate the problem to be solved if you need an answer

Answer 3

Congratulations, you have come up with an electronic signature ...