| Mute these words in your settings here: https://twitter.com/settings/muted_keywords | |
| ActivityTweet | |
| generic_activity_highlights | |
| generic_activity_momentsbreaking | |
| RankedOrganicTweet | |
| suggest_activity | |
| suggest_activity_feed | |
| suggest_activity_highlights | |
| suggest_activity_tweet |
Below are table of various projects that can completely exhaust n-bits of keyspace. In other words, counting completely and fully from 0 to 2ⁿ-1.
This Gist implies no discussion about how this is relevant to quantum computing using Grover's algorithm, meet-in-the-middle or birthday attacks, or anything of the like. It's strictly a Gist about raw speed, measuring the result in bits.
If you know of other noteworthy and verifiable brute force searching projects,
| # in /etc/systemd/system | |
| [Unit] | |
| Description=Bluetooth Agent | |
| [Service] | |
| ExecStart=/usr/bin/bt-agent -c NoInputNoOutput | |
| Type=simple | |
| [Install] | |
| WantedBy=multi-user.target |
| import { useEffect, useState } from "react" | |
| import { createBrowserHistory } from "history" | |
| const history = createBrowserHistory() | |
| const toLocation = path => new URL(path, window.location.href) | |
| // without this react won't re-render as location is the same object | |
| // @see https://reactjs.org/docs/hooks-reference.html#bailing-out-of-a-state-update | |
| const cloneLocation = () => Object.assign({}, window.location) |
| defaultdb=> SELECT * FROM pg_available_extensions; | |
| name | default_version | installed_version | comment | |
| ------------------------------+-----------------+-------------------+--------------------------------------------------------------------------------------------------------------------- | |
| aiven_extras | 1.0.2 | | aiven_extras | |
| plpgsql | 1.0 | 1.0 | PL/pgSQL procedural language | |
| btree_gist | 1.5 | | support for indexing common datatypes in GiST | |
| tcn | 1.0 | | Triggered change notifications | |
| seg | 1.3 | | data type for representing line segments or floating-point intervals | |
| pgrowlocks | 1.2 | |
Below are examples for best practices that have been set aside specifically for writing documentation, fictional stories, source code, or anything else where an example needs to be given without the fear of resolving to an actual phone number, domain, website, etc.
In 1999, the "example.com" domains have been set aside by the IETF in RFC 2606 and updated in RFC 6761 specifically for documentation and source code. They include example.com, example.net, and example.org. The example.edu domain was added by ICANN in 2000. Later, the ".example" top-level domain name has since been added explicitly for documentation purposes. While the pseudo-top-level domain ".local" carries no meaning, it is commonly deployed in multicast DNS, local DNS, and private networks. While it too could be used for documentation, it's better left alone, and to use the "example.com" and ".example" domains.
However, "test" [re
| package main | |
| import ( | |
| "context" | |
| "flag" | |
| "fmt" | |
| "log" | |
| "net/http" | |
| "os" | |
| "os/signal" |
| let cache = new Map(); | |
| let pending = new Map(); | |
| function fetchTextSync(url) { | |
| if (cache.has(url)) { | |
| return cache.get(url); | |
| } | |
| if (pending.has(url)) { | |
| throw pending.get(url); | |
| } |
XML processing modules may be not secure against maliciously constructed data. An attacker could abuse XML features to carry out denial of service attacks, access logical files, generate network connections to other machines, or circumvent firewalls.
The penetration tester running XML tests against application will have to determine which XML parser is in use, and then to what kinds of below listed attacks that parser will be vulnerable.
