{"id":"https://openalex.org/W4308391463","doi":"https://doi.org/10.1145/3548606.3559361","title":"Bullshark","display_name":"Bullshark","publication_year":2022,"publication_date":"2022-11-07","ids":{"openalex":"https://openalex.org/W4308391463","doi":"https://doi.org/10.1145/3548606.3559361"},"language":"en","primary_location":{"id":"doi:10.1145/3548606.3559361","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3548606.3559361","pdf_url":null,"source":{"id":"https://openalex.org/S4363608815","display_name":"Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021229048","display_name":"Alexander Spiegelman","orcid":"https://orcid.org/0000-0002-7148-0414"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Alexander Spiegelman","raw_affiliation_strings":["Aptos, Palo Alto, CA, USA"],"affiliations":[{"raw_affiliation_string":"Aptos, Palo Alto, CA, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059872571","display_name":"Neil Giridharan","orcid":"https://orcid.org/0009-0008-2175-2611"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Neil Giridharan","raw_affiliation_strings":["University of California, Berkeley, Berkeley , CA, USA"],"affiliations":[{"raw_affiliation_string":"University of California, Berkeley, Berkeley , CA, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006920985","display_name":"Alberto Sonnino","orcid":"https://orcid.org/0000-0001-5337-4741"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alberto Sonnino","raw_affiliation_strings":["Mysten Labs, New York, NY, USA"],"affiliations":[{"raw_affiliation_string":"Mysten Labs, New York, NY, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070324418","display_name":"Lefteris Kokoris-Kogias","orcid":"https://orcid.org/0000-0002-8827-3382"},"institutions":[{"id":"https://openalex.org/I157556583","display_name":"Institute of Science and Technology Austria","ror":"https://ror.org/03gnh5541","country_code":"AT","type":"education","lineage":["https://openalex.org/I157556583"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Lefteris Kokoris-Kogias","raw_affiliation_strings":["IST Austria, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"IST Austria, Vienna, Austria","institution_ids":["https://openalex.org/I157556583"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5021229048"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":26.9833,"has_fulltext":false,"cited_by_count":132,"citation_normalized_percentile":{"value":0.99917001,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"2705","last_page":"2718"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10502","display_name":"Advanced Memory and Neural Computing","score":0.9837999939918518,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13553","display_name":"Age of Information Optimization","score":0.965499997138977,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.8466910123825073},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7832024097442627},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.7676973342895508},{"id":"https://openalex.org/keywords/liveness","display_name":"Liveness","score":0.6991109848022461},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.48467352986335754},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.47634294629096985},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.44889408349990845},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.42112213373184204},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.419243186712265},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.340711385011673},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2232743501663208},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.09732919931411743},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.07687875628471375}],"concepts":[{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.8466910123825073},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7832024097442627},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.7676973342895508},{"id":"https://openalex.org/C15569618","wikidata":"https://www.wikidata.org/wiki/Q3561421","display_name":"Liveness","level":2,"score":0.6991109848022461},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.48467352986335754},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.47634294629096985},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.44889408349990845},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.42112213373184204},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.419243186712265},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.340711385011673},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2232743501663208},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.09732919931411743},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.07687875628471375}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3548606.3559361","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3548606.3559361","pdf_url":null,"source":{"id":"https://openalex.org/S4363608815","display_name":"Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.47999998927116394}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1965159636","https://openalex.org/W1988655303","https://openalex.org/W2035362408","https://openalex.org/W2104456311","https://openalex.org/W2106004025","https://openalex.org/W2126087831","https://openalex.org/W2131132597","https://openalex.org/W2133943294","https://openalex.org/W2186715137","https://openalex.org/W2295940006","https://openalex.org/W2328007342","https://openalex.org/W2963873436","https://openalex.org/W2964159515","https://openalex.org/W2981692198","https://openalex.org/W3013530784","https://openalex.org/W3096691500","https://openalex.org/W3185672164","https://openalex.org/W4220853208","https://openalex.org/W4300127641","https://openalex.org/W4400691701","https://openalex.org/W6678832241"],"related_works":["https://openalex.org/W2081199208","https://openalex.org/W1565271071","https://openalex.org/W3349016","https://openalex.org/W3160870209","https://openalex.org/W2139648957","https://openalex.org/W1481041875","https://openalex.org/W2391970076","https://openalex.org/W2053262709","https://openalex.org/W2360699417","https://openalex.org/W3185672164"],"abstract_inverted_index":{"We":[0],"present":[1],"Bullshark,":[2],"the":[3,19,42,50,53,61,82,97],"first":[4],"directed":[5],"acyclic":[6],"graph":[7],"(DAG)":[8],"based":[9],"asynchronous":[10,66,116],"Byzantine":[11],"Atomic":[12],"Broadcast":[13],"protocol":[14],"that":[15,76],"is":[16,120],"optimized":[17],"for":[18,84],"common":[20],"synchronous":[21,78],"case.":[22],"Like":[23],"previous":[24],"DAG-based":[25,67],"BFT":[26],"protocols":[27],"[19,":[28],"25],":[29],"Bullshark":[30,69,91],"requires":[31],"no":[32],"extra":[33],"communication":[34,110],"to":[35],"achieve":[36],"consensus":[37],"on":[38],"top":[39],"of":[40,52,60,100],"building":[41],"DAG.":[43],"That":[44],"is,":[45],"parties":[46],"can":[47],"totally":[48],"order":[49],"vertices":[51],"DAG":[54,62],"by":[55],"interpreting":[56],"their":[57],"local":[58],"view":[59],"edges.":[63],"Unlike":[64],"other":[65],"protocols,":[68],"provides":[70,113],"a":[71,124],"practical":[72],"low":[73],"latency":[74],"fast-path":[75],"exploits":[77],"periods":[79],"and":[80,88,115,118],"deprecates":[81],"need":[83],"notoriously":[85],"complex":[86],"view-change":[87],"view-synchronization":[89],"mechanisms.":[90],"achieves":[92],"this":[93],"while":[94],"maintaining":[95],"all":[96],"desired":[98],"properties":[99],"its":[101],"predecessor":[102],"DAG-Rider":[103],"[25].":[104],"Namely,":[105],"it":[106,112],"has":[107],"optimal":[108],"amortized":[109],"complexity,":[111],"fairness":[114],"liveness,":[117],"safety":[119],"guaranteed":[121],"even":[122],"under":[123],"quantum":[125],"adversary.":[126]},"counts_by_year":[{"year":2026,"cited_by_count":7},{"year":2025,"cited_by_count":50},{"year":2024,"cited_by_count":50},{"year":2023,"cited_by_count":25}],"updated_date":"2026-03-18T14:38:29.013473","created_date":"2022-11-11T00:00:00"}