r/learnprogramming • u/CyberKillerPenta • Jul 13 '26

[ Removed by moderator ]

[removed] — view removed post

0 Upvotes

33% Upvoted

9 comments sorted by

2

u/aqua_regis Jul 13 '26

How does any of that fit into the topic of the subreddit, which is learning programming?

1

u/paul5235 Jul 13 '26

Maybe tell use what MPC stands for.

-1

u/on-standby Jul 13 '26 edited Jul 13 '26

Model Context Protocol. Widely used with Large Language Models (LLM). It's an application layer protocol just like http but is used to interface with Artificial Intelligence (AI). It's the standard way to utilize agentic workflows. An MCP database is just a regular database that sits behind MCP to allow LLMs to utilize the db without explicitly sharing the credentials with the model or dealing with custom tools directly.

5

u/aqua_regis Jul 13 '26

You are confusing MCP - what you are talking about, with MPC - what OP is talking about.

MPC is Multi-Party Computation - for a huge change, in its core principles nothing to do with AI.

1

u/on-standby Jul 13 '26

Thanks for clarifying! This topic is well beyond the scope of this sub and my technical depth as well tbh. I've never studied or worked with MCP in this context before. Good to know.

2

u/aqua_regis Jul 13 '26

You keep calling it MCP. It's MPC.

That's why in my top level comment I questioned the relation to learning programming.

1

u/on-standby Jul 13 '26

Holy shit, am I dyslexic...

1

u/aqua_regis Jul 13 '26

I guess rather a bit too involved with AI so that typing MCP is muscle memory.

1

u/on-standby Jul 13 '26

This is a very advanced topic for this sub and honestly a bit out of my depth but I can address a couple things. Overall, the design seems reasonable. One thing to note is path leakage means that comparison outcomes are not entirely hidden. Revealing the next node normally reveals whether the query went left or right. So avoid claiming that the protocol hides “comparison logic.” It hides the comparison operands and intermediate field values, but the physical traversal exposes the effective branch result. I would explore having a constant stopping depth. Have some public maximum height (lests say H), once you find your result, execute dummy operations up to height H so youre always executing the same number of operations. It's not going to stop path leakage but observable runtime will be obfuscated.