{"id":"W4289599795","doi":"10.4230/lipics.disc.2023.26","title":"Cordial Miners: Fast and Efficient Consensus for Every Eventuality","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Azrieli Foundation","keywords":"Equivocation; Asynchrony (computer programming); Computer science; Byzantine fault tolerance; Latency (audio); Byzantine architecture; Block (permutation group theory); Atomic broadcast; Computer network; Distributed computing; Broadcasting (networking); Fault tolerance; Mathematics; History; Telecommunications; Combinatorics; Asynchronous communication; Philosophy","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004699221,0.0002933895,0.0004150906,0.0001297865,0.00022224,0.0001293577,0.001068482,0.0001730605,0.00001573511],"category_scores_gemma":[0.00004704537,0.0003478293,0.0002284815,0.0003416935,0.0001250772,0.00005195546,0.001953481,0.0003546689,0.000007466213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002086359,"about_ca_system_score_gemma":0.000220413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002220484,"about_ca_topic_score_gemma":0.00002311427,"domain_scores_codex":[0.9978483,0.0001806397,0.000264054,0.001204565,0.0001271146,0.0003752702],"domain_scores_gemma":[0.9982253,0.0002146115,0.0002964379,0.0009346607,0.0001516364,0.000177336],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002460456,0.0004042969,0.002720116,0.0005004383,0.0002713651,0.0004362225,0.000835907,0.7117078,0.00006029848,0.2711951,0.009127237,0.002495156],"study_design_scores_gemma":[0.001271556,0.0001129253,0.001533455,0.00007852889,0.00006849117,0.00001483981,0.0004168735,0.9789607,0.00001330025,0.004315439,0.01256567,0.0006482048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4907946,0.000162531,0.5045018,0.0001411773,0.001594329,0.0006927747,0.0005670785,0.0001592933,0.001386392],"genre_scores_gemma":[0.9968472,0.00001566696,0.00075284,0.00007384754,0.00007937604,0.00000697837,0.00005328964,0.0000130667,0.002157749],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5060526,"threshold_uncertainty_score":0.9998974,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06788937075502022,"score_gpt":0.2045272714509784,"score_spread":0.1366379006959582,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}