Patents by Inventor Sepandar Kamvar
Sepandar Kamvar has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 11899629Abstract: Systems and techniques are provided for a decentralized database associating public keys and communications addresses. A signed secret message may be sent by a validator computing device of a peer-to-peer network for a decentralized database to a communications address from a request for verification entry in a verification queue of the decentralized database. A second request for verification including the communications address and a user-signed secret message may be received. The user-signed secret message may be verified using a public key from the request for verification entry in the verification queue. The communications address and public key may be written to a verified database of the decentralized database when verifying the user-signed secret message causes a number of user-signed secret messages received in requests for verification with the communications address and successfully verified to meet a threshold number.Type: GrantFiled: August 2, 2021Date of Patent: February 13, 2024Assignee: CELO FOUNDATIONInventors: Rene Reinsberg, Sepandar Kamvar, Marek Olszewski
-
Publication number: 20230153276Abstract: Systems and techniques are provided for a decentralized database associating public keys and communications addresses. A signed secret message may be sent by a validator computing device of a peer-to-peer network for a decentralized database to a communications address from a request for verification entry in a verification queue of the decentralized database. A second request for verification including the communications address and a user-signed secret message may be received. The user-signed secret message may be verified using a public key from the request for verification entry in the verification queue. The communications address and public key may be written to a verified database of the decentralized database when verifying the user-signed secret message causes a number of user-signed secret messages received in requests for verification with the communications address and successfully verified to meet a threshold number.Type: ApplicationFiled: August 2, 2021Publication date: May 18, 2023Inventors: Rene Reinsberg, Sepandar Kamvar, Marek Olszewski
-
Patent number: 11140094Abstract: Systems and techniques are provided for a resource stabilization in a distributed network. A computing device in a distributed network may check the median value of a transactional resource in relation to a specified external resource. The computing device in the distributed network may compare the median value of the transactional resource to a threshold value for the transactional resource to determine whether the median value of the transactional resource is above the threshold value or below the threshold value. The supply of the transactional resource in the distributed network may be increased in response to determining that the transactional resource is above the threshold value or may be in response to determining that the transactional resource is below the threshold value.Type: GrantFiled: March 20, 2020Date of Patent: October 5, 2021Assignee: Celo FoundationInventors: Sepandar Kamvar, Marek Olszewski, Rene Reinsberg, Marcin Jerzy Chrzanowski, Asa Oines, Roman Croessmann, Markus Franke
-
Patent number: 11106767Abstract: Systems and techniques are provided for decentralized name verification using recursive attestation. A name and identifying information may be received at a computing device. The computing device may determine that there is a contact item that includes both the name and the identifying information in a contacts database stored on the computing device or accessible to the computing device. A positive attestation and an attestation score for an entity associated with the computing device may be sent to be used to generate an attestation score for the name and identifying information. The attestation score for the name and identifying information is used to determine whether to allow the creation of an account with the name. The attestation score for the entity associated with the computing device may be generated based a positive attestation from another computing device.Type: GrantFiled: December 11, 2018Date of Patent: August 31, 2021Assignee: CELO FOUNDATIONInventors: Rene Reinsberg, Sepandar Kamvar, Marek Olszewski
-
Patent number: 11080246Abstract: Systems and techniques are provided for a decentralized database associating public keys and communications addresses. A signed secret message may be sent by a validator computing device of a peer-to-peer network for a decentralized database to a communications address from a request for verification entry in a verification queue of the decentralized database. A second request for verification including the communications address and a user-signed secret message may be received. The user-signed secret message may be verified using a public key from the request for verification entry in the verification queue. The communications address and public key may be written to a verified database of the decentralized database when verifying the user-signed secret message causes a number of user-signed secret messages received in requests for verification with the communications address and successfully verified to meet a threshold number.Type: GrantFiled: December 11, 2018Date of Patent: August 3, 2021Assignee: CELO FOUNDATIONInventors: Rene Reinsberg, Sepandar Kamvar, Marek Olszewski
-
Patent number: 11018989Abstract: Systems and techniques are provided for a resource stabilization in a distributed network. A computing device in a distributed network may check the median value of a transactional resource in relation to a specified external resource. The computing device in the distributed network may compare the median value of the transactional resource to a threshold value for the transactional resource to determine whether the median value of the transactional resource is above the threshold value or below the threshold value. The supply of the transactional resource in the distributed network may be increased in response to determining that the transactional resource is above the threshold value or may be in response to determining that the transactional resource is below the threshold value.Type: GrantFiled: March 20, 2020Date of Patent: May 25, 2021Assignee: Celo FoundationInventors: Sepandar Kamvar, Marek Olszewski, Rene Reinsberg, Marcin Jerzy Chrzanowski, Asa Oines, Roman Croessmann, Markus Franke
-
Publication number: 20200304421Abstract: Systems and techniques are provided for a resource stabilization in a distributed network. A computing device in a distributed network may check the median value of a transactional resource in relation to a specified external resource. The computing device in the distributed network may compare the median value of the transactional resource to a threshold value for the transactional resource to determine whether the median value of the transactional resource is above the threshold value or below the threshold value. The supply of the transactional resource in the distributed network may be increased in response to determining that the transactional resource is above the threshold value or may be in response to determining that the transactional resource is below the threshold value.Type: ApplicationFiled: March 20, 2020Publication date: September 24, 2020Inventors: Sepandar Kamvar, Marek Olszewski, Rene Reinsberg, Marcin Jerzy Chrzanowski, Asa Oines, Roman Croessmann, Markus Franke
-
Publication number: 20190179806Abstract: Systems and techniques are provided for a decentralized database associating public keys and communications addresses. A signed secret message may be sent by a validator computing device of a peer-to-peer network for a decentralized database to a communications address from a request for verification entry in a verification queue of the decentralized database. A second request for verification including the communications address and a user-signed secret message may be received. The user-signed secret message may be verified using a public key from the request for verification entry in the verification queue. The communications address and public key may be written to a verified database of the decentralized database when verifying the user-signed secret message causes a number of user-signed secret messages received in requests for verification with the communications address and successfully verified to meet a threshold number.Type: ApplicationFiled: December 11, 2018Publication date: June 13, 2019Inventors: Rene Reinsberg, Sepandar Kamvar, Marek Olszewski
-
Publication number: 20190180011Abstract: Systems and techniques are provided for decentralized name verification using recursive attestation. A name and identifying information may be received at a computing device. The computing device may determine that there is a contact item that includes both the name and the identifying information in a contacts database stored on the computing device or accessible to the computing device. A positive attestation and an attestation score for an entity associated with the computing device may be sent to be used to generate an attestation score for the name and identifying information. The attestation score for the name and identifying information is used to determine whether to allow the creation of an account with the name. The attestation score for the entity associated with the computing device may be generated based a positive attestation from another computing device.Type: ApplicationFiled: December 11, 2018Publication date: June 13, 2019Inventors: Rene Reinsberg, Sepandar Kamvar, Marek Olszewski
-
Patent number: 10185770Abstract: A system and method for presenting search results is provided. The method includes submitting a query to a server and receiving from the server, in response to the query: a comprehensive list of search results that satisfy the query, and multiple position vectors, each position vector identifying a respective ordered subset of the search results in the comprehensive list. The method further includes storing the comprehensive list and the multiple position vectors, receiving a user-made selection identifying a subset of the multiple position vectors, and displaying a subset of the search results in the comprehensive list in accordance with the user-made selection.Type: GrantFiled: November 12, 2013Date of Patent: January 22, 2019Assignee: Google LLCInventors: Taher H. Haveliwala, Glen Jeh, Sepandar Kamvar
-
Publication number: 20140143226Abstract: A system and method for presenting search results is provided. The method includes submitting a query to a server and receiving from the server, in response to the query: a comprehensive list of search results that satisfy the query, and multiple position vectors, each position vector identifying a respective ordered subset of the search results in the comprehensive list. The method further includes storing the comprehensive list and the multiple position vectors, receiving a user-made selection identifying a subset of the multiple position vectors, and displaying a subset of the search results in the comprehensive list in accordance with the user-made selection.Type: ApplicationFiled: November 12, 2013Publication date: May 22, 2014Applicant: Google Inc.Inventors: Taher H. Haveliwala, Glen Jeh, Sepandar Kamvar
-
Patent number: 8600963Abstract: A system and a method that manages a user query by a single interaction between a server and a client. A plurality of clients send queries for search results to a server. The server receives these queries and performs multiple searches to generate multiple sets of search results. These sets of search results are ranked, consolidated and passed to the requesting client. The client stores these multiple sets of search results. The client then displays these search results in accordance to the boundary defined by the user. This boundary defines the portions of the search results that the user desires to view. The user may re-define the boundary. The client identifies the search results corresponding to the boundary and displays them.Type: GrantFiled: August 14, 2003Date of Patent: December 3, 2013Assignee: Google Inc.Inventors: Taher Haveliwala, Glen Jeh, Sepandar Kamvar
-
Publication number: 20070239680Abstract: In a method of profiling a website, an information server receives multiple search queries from a website submitted by different users. Different search results responsive to the search queries are provided to the requesting users. The information server monitors activities of the users on the search results and generates a profile for the website using the search queries and the user activities. When the information server receives a same search query from two different websites, it identifies a plurality of information items associated with the search query. The information server uses profiles of the two websites to customize the information items into two different orders and serves the information items to the two websites in the two different orders.Type: ApplicationFiled: March 30, 2006Publication date: October 11, 2007Inventors: Bilgehan Oztekin, Adam Klein, Taher Haveliwala, Glen Jeh, Sepandar Kamvar
-
Publication number: 20050283468Abstract: A search system monitors the input of a search query by a user. Before the user finishes entering the search query, the search system identifies and sends a portion of the query as a partial query to the search engine. Based on the partial query, the search engine creates a set of predicted queries. This process may take into account prior queries submitted by a community of users, and may take into account a user profile. The predicted queries are be sent back to the user for possible selection. The search system may also cache search results corresponding to one or more of the predicted queries in anticipation of the user selecting one of the predicted queries. The search engine may also return at least a portion of the search results corresponding to one or more of the predicted queries.Type: ApplicationFiled: June 22, 2004Publication date: December 22, 2005Inventors: Sepandar Kamvar, Taher Haveliwala, Glen Jeh
-
Publication number: 20050222989Abstract: Personalized advertisements are provided to a user using a search engine to obtain documents relevant to a search query. The advertisements are personalized in response to a search profile that is derived from personalized search results. The search results are personalized based on a user profile of the user providing the query. The user profile describes interests of the user, and can be derived from a variety of sources, including prior search queries, prior search results, expressed interests, demographic, geographic, psychographic, and activity information.Type: ApplicationFiled: June 24, 2004Publication date: October 6, 2005Inventors: Taher Haveliwala, Glen Jeh, Sepandar Kamvar
-
Publication number: 20050216434Abstract: A search engine provides personalized rankings of search results. A user interest profile identifies topics of interest to a user. Each topic is associated with one or more sites, and a boost value, which can be used to augment an information retrieval score of any document from the site. Search results from any search are provided to the user, with a variable control of the ranking of the results. The results can be ranked by their unboosted information retrieval score, thus reflecting no personalization, or by their fully or partially boosted information retrieval scores. This allows the user to selectively control how their interests affect the ranking of the documents.Type: ApplicationFiled: December 1, 2004Publication date: September 29, 2005Inventors: Taher Haveliwala, Glen Jeh, Sepandar Kamvar
-
Publication number: 20050038775Abstract: A system and a method that manages a user query by a single interaction between a server and a client. A plurality of clients send queries for search results to a server. The server receives these queries and performs multiple searches to generate multiple sets of search results. These sets of search results are ranked, consolidated and passed to the requesting client. The client stores these multiple sets of search results. The client then displays these search results in accordance to the boundary defined by the user. This boundary defines the portions of the search results that the user desires to view. The user may re-define the boundary. The client identifies the search results corresponding to the boundary and displays them.Type: ApplicationFiled: August 14, 2003Publication date: February 17, 2005Applicant: KALTIX CORPORATIONInventors: Taher Haveliwala, Glen Jeh, Sepandar Kamvar
-
Publication number: 20050033742Abstract: Techniques for assigning ranks to nodes in a large linked database, such as world wide web or any other hypermedia database, partition the nodes so that the link matrix has a predominantly block-diagonal form. Within each block, a local rank is computed for nodes in the block, possibly by different computer in a distributed computing environment. A block rank is then estimated for each block as a whole, and may optionally include block-level weights to implement customized ranking. The local ranks and block ranks are then combined to form a global rank, which may be used to rank the nodes. Alternatively, a global rank vector for the database may be used as an initial vector in an iterative link-based ranking scheme to obtain more accurate global ranks for the nodes. The global rank vector may be divided to provide local rank vectors for use in subsequent applications of the method.Type: ApplicationFiled: August 22, 2003Publication date: February 10, 2005Inventors: Sepandar Kamvar, Taher Haveliwala, Glen Jeh, Gene Golub
-
Publication number: 20050027685Abstract: A system and method is disclosed in which a ranking function for a set of document rank values is iteratively solved with respect to a set of linked documents until a first stability condition is satisfied. After such condition is satisfied, some of the ranks will have converged. The ranking function is modified to take into account these converged ranks so as to reduce the ranking function's computation cost. The modified ranking function is then solved until a second stability condition is satisfied. After such condition is satisfied more of the ranks will have converged. The ranking function is again modified and process continues until complete.Type: ApplicationFiled: August 23, 2004Publication date: February 3, 2005Inventors: Sepandar Kamvar, Taher Harveliwala