Title: Pull requests · D3vRandom/Shor-s-Factoring-Algorithm · GitHub
Open Graph Title: Pull requests · D3vRandom/Shor-s-Factoring-Algorithm
X Title: Pull requests · D3vRandom/Shor-s-Factoring-Algorithm
Description: This is a python implemented factoring algorithm, that can be executed in polynomial time on a quantum computer such that it has sufficient Qbits and accuracy. - Pull requests · D3vRandom/Shor-s-Factoring-Algorithm
Open Graph Description: This is a python implemented factoring algorithm, that can be executed in polynomial time on a quantum computer such that it has sufficient Qbits and accuracy. - Pull requests · D3vRandom/Shor-s-Fa...
X Description: This is a python implemented factoring algorithm, that can be executed in polynomial time on a quantum computer such that it has sufficient Qbits and accuracy. - Pull requests · D3vRandom/Shor-s-Fa...
Opengraph URL: https://github.com/D3vRandom/Shor-s-Factoring-Algorithm
X: @github
Domain: patch-diff.githubusercontent.com
| route-pattern | /:user_id/:repository/pulls(.:format) |
| route-controller | pull_requests |
| route-action | index |
| fetch-nonce | v2:9c2c8519-874b-c428-952c-9dbed91a8ad8 |
| current-catalog-service-hash | ae870bc5e265a340912cde392f23dad3671a0a881730ffdadd82f2f57d81641b |
| request-id | BB72:3D950A:BD91D7F:FD44936:698C6F28 |
| html-safe-nonce | 136de722682028a2f31464f13218958bc78c6d39caacb81544184e2bf52087ad |
| visitor-payload | eyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJCQjcyOjNEOTUwQTpCRDkxRDdGOkZENDQ5MzY6Njk4QzZGMjgiLCJ2aXNpdG9yX2lkIjoiNDM1ODk4MTI0MjY5NzA1MTk0NCIsInJlZ2lvbl9lZGdlIjoiaWFkIiwicmVnaW9uX3JlbmRlciI6ImlhZCJ9 |
| visitor-hmac | 092742bde9d1a844f42251246bb8184c638226f182e1c772e6835f179cd7de5d |
| hovercard-subject-tag | repository:249559477 |
| github-keyboard-shortcuts | repository,pull-request-list,pull-request-conversation,pull-request-files-changed,copilot |
| google-site-verification | Apib7-x98H0j5cPqHWwSMm6dNU4GmODRoqxLiDzdx9I |
| octolytics-url | https://collector.github.com/github/collect |
| analytics-location-query-strip | true |
| analytics-location | / |
| fb:app_id | 1401488693436528 |
| apple-itunes-app | app-id=1477376905, app-argument=https://github.com/D3vRandom/Shor-s-Factoring-Algorithm/pulls |
| twitter:image | https://opengraph.githubassets.com/40f5a9adaa7afec518880115b9b88c55d3da8a45a2c8d2198260274964c8a4af/D3vRandom/Shor-s-Factoring-Algorithm |
| twitter:card | summary_large_image |
| og:image | https://opengraph.githubassets.com/40f5a9adaa7afec518880115b9b88c55d3da8a45a2c8d2198260274964c8a4af/D3vRandom/Shor-s-Factoring-Algorithm |
| og:image:alt | This is a python implemented factoring algorithm, that can be executed in polynomial time on a quantum computer such that it has sufficient Qbits and accuracy. - Pull requests · D3vRandom/Shor-s-Fa... |
| og:image:width | 1200 |
| og:image:height | 600 |
| og:site_name | GitHub |
| og:type | object |
| hostname | github.com |
| expected-hostname | github.com |
| None | 640eeb7b6ff4d8d106235d228c0c286e82592d4d2403227b5b2b4fc5832297a4 |
| turbo-cache-control | no-preview |
| go-import | github.com/D3vRandom/Shor-s-Factoring-Algorithm git https://github.com/D3vRandom/Shor-s-Factoring-Algorithm.git |
| octolytics-dimension-user_id | 26261784 |
| octolytics-dimension-user_login | D3vRandom |
| octolytics-dimension-repository_id | 249559477 |
| octolytics-dimension-repository_nwo | D3vRandom/Shor-s-Factoring-Algorithm |
| octolytics-dimension-repository_public | true |
| octolytics-dimension-repository_is_fork | false |
| octolytics-dimension-repository_network_root_id | 249559477 |
| octolytics-dimension-repository_network_root_nwo | D3vRandom/Shor-s-Factoring-Algorithm |
| turbo-body-classes | logged-out env-production page-responsive |
| disable-turbo | false |
| browser-stats-url | https://api.github.com/_private/browser/stats |
| browser-errors-url | https://api.github.com/_private/browser/errors |
| release | 3d444f0a47beeeac94cddbb51c91ab408befe8d4 |
| ui-target | full |
| theme-color | #1e2327 |
| color-scheme | light dark |
Links:
Viewport: width=device-width