Language type The code Protocol description 1) generate code Write and verify protocol Use according to type Use type 44“Scribble” – for writing and verifying protocol module scribble.example example.Purchasing; type "QuoteRequest" from "Purchasing.xsd" as QuoteRequest; ... global protocol BuyGoods (role Buyer, role Seller) { quote(QuoteRequest) from Buyer to Seller; choice at Seller Language type The code Protocol description 1) Language type The code Protocol description 2) generate code Write the code Verify protocol Use type Infer type Extract protocol 46Three approaches

std::pair{"ftp"sv, protocol::FTP}, std::pair{"file"sv, protocol::FILE}, std::pair{"http"sv, protocol::HTTP}, std::pair{"ws"sv, protocol::WS}, std::pair{"wss"sv, protocol::WSS}, }; 8 / 58[Examples] std::pair{"ftp"sv, protocol::FTP}, std::pair{"file"sv, protocol::FILE}, std::pair{"http"sv, protocol::HTTP}, std::pair{"ws"sv, protocol::WS}, std::pair{"wss"sv, protocol::WSS}, }; template auto lookup(std::string_view) -> protocol; // Powered by TMP 8 / 58[Examples] Performance / Policies [Examples] Performance / Policies [1]: #uOps [2]: Latency [3]: RThroughput [4]:

Separation ⊡ Network Problems ⊡ External Interfaces ⊡ Simulators ⊡ Logs ⊡ MonitoringDesign your protocol and messages in a way you could always bounce back from a “bad” messageEmbedded Unit AEmbedded correctEasy to identify in memory⊡ Propriety protocol ⊡ Protobuf : ( https://protobuf.dev ) ⊡ CBOR : ( https://cbor.io ) ⊡ JSON ⊡ YAML Body structureDesign your protocol and messages in a way you could ⊡ Separate logic layer from hardware layer ⊡ Disconnect the logic from the network ⊡ Design your protocol in a way you could always bounce back from a “bad” message⊡ Use an operating system for complex

Su, XOffsetDatastructure, CppCon 2024 252.2 Current Solutions • The 2 Categories • MessagePack, Protocol Buffers, etc. • FlatBuffers, Cap’n Proto, etc. • Input, Output, and Process. // To better understand buffer. This transformation requires traversing and encoding all fields. • Both MessagePack and Protocol Buffers follow this approach. Fanchen Su, XOffsetDatastructure, CppCon 2024 28 Data Buffer2.2 structure. This conversion needs traversing and decoding all fields. • Both MessagePack and Protocol Buffers employ this method. Fanchen Su, XOffsetDatastructure, CppCon 2024 29 Data Buffer Memory

— e.g., size() == 0 instead of has_value()? — Need to convert to the range protocol & then back to the maybe-like protocol • Just as we have range concept + algorithms — Can we not have the same for — e.g., size() == 0 instead of has_value()? — Need to convert to the range protocol & then back to the maybe-like protocol • Just as we have range concept + algorithms — Can we not have the same for algorithms/views possible ○ find(), and_then(), transform_or(), etc. ○ Exclusively for the maybe protocol! ● operator|() has 2 flavors: ○ If C and D are closure objects → C | D produces another closure

slide stride split take take_while unchecked zipITERATION REVISITED IMPLEMENTING THE SEQUENCE PROTOCOL template struct my_array { T data[N]; }; template >); 34ITERATION REVISITED IMPLEMENTING THE SEQUENCE PROTOCOL template struct my_array { T data[N]; struct flux_sequence_traits static_assert(flux�::multipass_sequence>); 35ITERATION REVISITED IMPLEMENTING THE SEQUENCE PROTOCOL ▸ Considerably easier to implement vs STL ranges ▸ Even more so for higher sequence/range categories

back-end communicate with separate protocol Back-end implemented with Asio Queries serviced by proprietary database back-end (written in C++) 4 DataConn TCP protocol without login or encryption Intended to CLOSE_WAIT and TIME_WAIT in TCP 20 enum class async_control_reason { read, write, run, init, protocol }; struct async_control_statistics { std::size_t bytes_read; std::size_t bytes_written; std::size_t ctx, asio::ip::tcp::endpoint local) : acceptor(ctx), local(local) { acceptor.open(local.protocol()); acceptor.set_option(run_server::acceptor::reuse_address( true)); acceptor.bind(local);

munmap, shm_unlink, ftruncate, flock... struct ProtocolHeader { std::arrayPROTOCOL_NAME_MAX_LENGTH> protocol_name; uint64_t magic_number; uint64_t buffer_size; uint32_t major_version; uint32_t std::array queue_size_bytes; uint8_t reserved[...]; // space for future protocol changes } __attribute__((aligned));76 Concurrent Queues Bounded? Blocking? # Consumers? Message

[[maybe_unused]], c] = f(); return a + c; } https://godbolt.org/z/68WGq46dj 17in dra� P2819 Add tuple protocol to complex //before complex c{…}; auto & [r, i]{reinterpret_cast(c)}; 1 1 2 3 4 //after 5 complex c{…}; 6 auto & [r, i]{c}; 7 18in dra� P2819 Add tuple protocol to complex //before complex c{…}; auto & [r, i]{reinterpret_cast(c)}; 1 2

ofWill it CMake? 100%! We can combine Engflow's Remote Execution, which uses the same RE level protocol Bazel adopts, and tipi's single instance approach.Will it CMake?Will it CMake?Let's check !Thank