08:58:40 <m-relay> <r​isencrypto:matrix.org> Hi - I am amateur dabbling in cryptography & I was trying to understand Monero. I have read Zero to Monero & I have also read quite a few of the MRLs. I have understood a lot of stuff but one thing confuses me about RingCT - is this the right place to ask my question. I have tried both monero.StackExchange & also r/monero in reddit but all the technical people seem to have abandon<clipped message
08:58:41 <m-relay> <r​isencrypto:matrix.org> ed most places. And Crypto.StackExchange & r/Crypto don't seem to know much about Monero.
09:00:40 <m-relay> <j​effro256:monero.social> Probably #monero-research-lounge:monero.social is better
09:01:23 <m-relay> <r​isencrypto:matrix.org> Ok, thank you - I will join that room
15:54:29 <m-relay> <r​ucknium:monero.social> Diego Salazar: What is the skillset of the researcher(s) that would be doing the research?
16:22:49 <m-relay> <d​iego:cypherstack.com> They'd be the same guys doing the carrot research. Pretty versatile.
16:44:24 <m-relay> <r​ucknium:monero.social> Slaughter does coding theory. There's some papers about bandwidth-efficient gossip protocols that use coding. Actually I don't know if it's the same thing that Slaughter studies, but may be worth a glance. Let me fetch the papers.
16:47:22 <m-relay> <r​ucknium:monero.social> Borokhovich, M., Avin, C., & Lotker, Z. (2010). Bounds for Algebraic Gossip on Graphs (Version 4). arXiv. https://doi.org/10.48550/ARXIV.1001.3265
16:47:32 <m-relay> <r​ucknium:monero.social> Braun, M., Wiesmaier, A., & Alnahawi, N. (2023). Efficient practical Byzantine consensus using random linear network coding. Annals of Telecommunications, 78(1–2), 33–51. https://doi.org/10.1007/s12243-022-00930-x
16:47:44 <m-relay> <r​ucknium:monero.social> Chawla, N., Behrens, H. W., Tapp, D., Boscovic, D., & Candan, K. S. (2019). Velocity: Scalability Improvements in Block Propagation Through Rateless Erasure Coding. 2019 IEEE International Conference on Blockchain and Cryptocurrency (ICBC), 447–454. https://doi.org/10.1109/BLOC.2019.8751427
16:47:53 <m-relay> <r​ucknium:monero.social> Deb, S., Medard, M., & Choute, C. (2006). Algebraic gossip: A network coding approach to optimal multiple rumor mongering. IEEE Transactions on Information Theory, 52(6), 2486–2507. https://doi.org/10.1109/TIT.2006.874532
16:48:03 <m-relay> <r​ucknium:monero.social> Haeupler, B. (2012). Tighter Worst-Case Bounds on Algebraic Gossip (Version 1). arXiv. https://doi.org/10.48550/ARXIV.1205.6961
16:48:13 <m-relay> <r​ucknium:monero.social> Imtiaz, M. A., Starobinski, D., & Trachtenberg, A. (2022). Empirical Comparison of Block Relay Protocols. IEEE Transactions on Network and Service Management, 19(4), 3960–3974. https://doi.org/10.1109/TNSM.2022.3195976
16:48:23 <m-relay> <r​ucknium:monero.social> Wang, G., Lin, Z., Guan, W., & Wang, F. (2013). The Performance of Multimessage Algebraic Gossip in a Random Geometric Graph. International Journal of Distributed Sensor Networks, 9(12), 545362. https://doi.org/10.1155/2013/545362
16:48:33 <m-relay> <r​ucknium:monero.social> Yang, C., Chin, K.-W., Wang, J., Wang, X., Liu, Y., & Zheng, Z. (2022). Scaling Blockchains with Error Correction Codes: A Survey on Coded Blockchains (No. arXiv:2208.09255). arXiv. http://arxiv.org/abs/2208.09255
16:48:47 <m-relay> <r​ucknium:monero.social> Yang, L., Gilad, Y., & Alizadeh, M. (2022). Coded Transaction Broadcasting for High-throughput Blockchains (Version 1). arXiv. https://doi.org/10.48550/ARXIV.2205.01797
16:50:32 <m-relay> <r​ucknium:monero.social> Or they could look at the questions here (FCMP will make some of the questions obsolete): https://github.com/monero-project/research-lab/issues/94
16:52:29 <m-relay> <r​ucknium:monero.social> Here's info about the tx broadcast status quo and a proposal to increase bandwidth efficiency: https://github.com/monero-project/monero/issues/9334
19:21:00 <m-relay> <3​21bob321:monero.social> 👀