{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":805567023,"defaultBranch":"develop","name":"keepassxc","ownerLogin":"Agnibaan","currentUserCanPush":false,"isFork":true,"isEmpty":false,"createdAt":"2024-05-24T21:39:29.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/125951234?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1716586771.665405","currentOid":""},"activityList":{"items":[{"before":"2a62000b28c7db843a95519a20f3f34ab9e1a45c","after":"c7d318236f367ad8ba61af61460973529c17155d","ref":"refs/heads/develop","pushedAt":"2024-08-25T06:21:09.000Z","pushType":"push","commitsCount":67,"pusher":{"login":"Agnibaan","name":"ARCHISMAN DAS","path":"/Agnibaan","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/125951234?s=80&v=4"},"commit":{"message":"Prevent duplicate entries in passphrase wordlists\n\nReplace a QVector for the wordlist with a QSet. This removes all duplicate entries in a given wordlist.\nThus, it hinders a malicious wordlist that has the proper length (>4000 entries) but with repetitions (effectively << 4000 entries) to be used and potentially create weaker passphrases than estimated.\n\nExample:\nList with 4000 items but only 64 unique words would lead to only 48 bit of Entropy instead of ~95 bit!","shortMessageHtmlLink":"Prevent duplicate entries in passphrase wordlists"}}],"hasNextPage":false,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"Y3Vyc29yOnYyOpK7MjAyNC0wOC0yNVQwNjoyMTowOS4wMDAwMDBazwAAAASjXkP4","startCursor":"Y3Vyc29yOnYyOpK7MjAyNC0wOC0yNVQwNjoyMTowOS4wMDAwMDBazwAAAASjXkP4","endCursor":"Y3Vyc29yOnYyOpK7MjAyNC0wOC0yNVQwNjoyMTowOS4wMDAwMDBazwAAAASjXkP4"}},"title":"Activity · Agnibaan/keepassxc"}