Transient Hyperlogic Circuit: An Ultrafast and Metastability Self-Loopback Solver for NP-Hard Problems

Transient Hyperlogic Circuit: An Ultrafast and Metastability Self-Loopback Solver for NP-Hard Problems | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Physical Sciences - Article Transient Hyperlogic Circuit: An Ultrafast and Metastability Self-Loopback Solver for NP-Hard Problems Jiacheng Ye, Shiyu Su, Deming Meng, Qiaochu Zhang, Zerui Liu, and 7 more This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-6419602/v1 This work is licensed under a CC BY 4.0 License Status: Posted Version 1 posted You are reading this latest preprint version Abstract Realizing the large-scale hyperlogic operation and signal processing in the real-world system paves the way for the next generation of the artificial intelligence architecture. Over the decades, the most widely applied personal computing resource is composed by the classical logic, which is benefit from using the transistor as the all-purpose computing unit with compact size and obvious on-off status difference. However, in the advanced reasoning model, it is intractable for the traditional logical system that makes a brute judgement in black and white to process the conflicts and the ambiguations from the information. Here, we put forward the new concept of hyerlogic operation computing system, which has an extra ‘paradoxical’ state to handle the massive conflicts efficiently. And we also verify our concept by implementing the stochastic local search algorithm for the Boolean constraint satisfiability problem in the logic gate-based circuit and observe the conflict competition mechanism of the variables for getting truth assignment. The ‘paradoxical’ state of the variable is realized by a pair of back-to-back inverters, and the conflict information is passed by the crossbar structure among the unsatisfied clause and the unsettled variables. Interestingly, we find out this self-loop circuit overperforms the most advanced parallel classical logical reasoning circuit systems and achieves 3.5µs average solution time and 8.6nJ average power consumption for the 1000 SAT instance with 20 variables and 91 clauses, which is over 10 times faster than the current state-of-the-art 3SAT solver in application specific integrated circuit (ASIC) track while keeping the same magnitude of power efficiency. Physical sciences/Mathematics and computing/Information technology Physical sciences/Mathematics and computing/Computer science Physical sciences/Engineering/Electrical and electronic engineering Physical sciences/Mathematics and computing/Applied mathematics Transient Hyperlogic NP-hard Problem Solver Self-Loopback System Stochastic Local Search Parallel in Memory Computing Full Text Additional Declarations There is NO Competing Interest. Cite Share Download PDF Status: Posted Version 1 posted You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-6419602","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Physical Sciences - Article","associatedPublications":[],"authors":[{"id":441507492,"identity":"fe92ae82-e359-46f0-9cb6-b43c2adb2d87","order_by":0,"name":"Jiacheng Ye","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAAy0lEQVRIie3PsQqCUBTG8SMXbsvJ23jl+hA3hGgQfJAWJ6caIogGByGwV7DH8A2EA7ZIrY6BL+DYmNDS5nULuv/5/OB8ADbbDyaY6LrXKcXolhkS74I8gKb2oakMiX4gKCdnIbSxKaF5Fexzjs61K1tIw834Y+TGXXH3kanksIY62WVjxCXQGo8cudqupJPROIGBSOQM0WsMyYJQK8wZSomGxDvzZFk0NWoctsQmW4QgevanNNIzKts+DQ22fKVlPOX8Q6YKm81m+4/eE6o6mO33t3oAAAAASUVORK5CYII=","orcid":"","institution":"University of Southern California","correspondingAuthor":true,"prefix":"","firstName":"Jiacheng","middleName":"","lastName":"Ye","suffix":""},{"id":441507493,"identity":"5f20f71d-a4e1-4afb-bac9-777c26bc1813","order_by":1,"name":"Shiyu Su","email":"","orcid":"","institution":"University of Waterloo","correspondingAuthor":false,"prefix":"","firstName":"Shiyu","middleName":"","lastName":"Su","suffix":""},{"id":441507494,"identity":"541ee04d-caac-489b-9049-8645215ffbbd","order_by":2,"name":"Deming Meng","email":"","orcid":"","institution":"University of Southern California","correspondingAuthor":false,"prefix":"","firstName":"Deming","middleName":"","lastName":"Meng","suffix":""},{"id":441507495,"identity":"e720b808-6ec1-43ce-971d-26db67885a8f","order_by":3,"name":"Qiaochu Zhang","email":"","orcid":"","institution":"University of Virginia","correspondingAuthor":false,"prefix":"","firstName":"Qiaochu","middleName":"","lastName":"Zhang","suffix":""},{"id":441507496,"identity":"ace50382-fa05-4406-be5e-b1fc4bd3ee80","order_by":4,"name":"Zerui Liu","email":"","orcid":"","institution":"University of Southern California","correspondingAuthor":false,"prefix":"","firstName":"Zerui","middleName":"","lastName":"Liu","suffix":""},{"id":441507497,"identity":"66eee8e0-9e27-4eca-9252-ef56cb6edb91","order_by":5,"name":"Hsiang-Chun Cheng","email":"","orcid":"","institution":"University of Southern California","correspondingAuthor":false,"prefix":"","firstName":"Hsiang-Chun","middleName":"","lastName":"Cheng","suffix":""},{"id":441507498,"identity":"85fc9abd-e751-45e5-af37-0a6e87d93696","order_by":6,"name":"Ting-Hao Hsu","email":"","orcid":"","institution":"University of Southern California","correspondingAuthor":false,"prefix":"","firstName":"Ting-Hao","middleName":"","lastName":"Hsu","suffix":""},{"id":441507499,"identity":"2ae6eaf9-1c99-4967-a53a-cf4e327449b1","order_by":7,"name":"Buyun Chen","email":"","orcid":"","institution":"University of Southern California","correspondingAuthor":false,"prefix":"","firstName":"Buyun","middleName":"","lastName":"Chen","suffix":""},{"id":441507500,"identity":"3eefefe9-c6d7-40a2-b5d7-aa5c2202b909","order_by":8,"name":"Zhengyi Qiu","email":"","orcid":"","institution":"University of Southern California","correspondingAuthor":false,"prefix":"","firstName":"Zhengyi","middleName":"","lastName":"Qiu","suffix":""},{"id":441507501,"identity":"68a31933-b43a-420e-9b6c-f5f2435caa7f","order_by":9,"name":"Sushmit Hossain","email":"","orcid":"","institution":"University of Southern California","correspondingAuthor":false,"prefix":"","firstName":"Sushmit","middleName":"","lastName":"Hossain","suffix":""},{"id":441507502,"identity":"5698558d-220e-484b-bf4e-80eca528dcf5","order_by":10,"name":"Mike Shuo-Wei Chen","email":"","orcid":"","institution":"University of Southern California","correspondingAuthor":false,"prefix":"","firstName":"Mike","middleName":"Shuo-Wei","lastName":"Chen","suffix":""},{"id":441507503,"identity":"7d9e45c3-c3b9-439f-b488-6b8b573ef8e0","order_by":11,"name":"Wei Wu","email":"","orcid":"","institution":"University of Southern California","correspondingAuthor":false,"prefix":"","firstName":"Wei","middleName":"","lastName":"Wu","suffix":""}],"badges":[],"createdAt":"2025-04-10 11:15:52","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-6419602/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-6419602/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":81555154,"identity":"ad1a5340-3183-4134-bbb7-e3ce35e630a2","added_by":"auto","created_at":"2025-04-28 13:25:09","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":1458065,"visible":true,"origin":"","legend":"","description":"","filename":"HyperlocgicCircuitrevised.pdf","url":"https://assets-eu.researchsquare.com/files/rs-6419602/v1_covered_ff6b8fc0-d8cf-481a-a28a-ac0e769bf374.pdf"}],"financialInterests":"There is \u003cb\u003eNO\u003c/b\u003e Competing Interest.","formattedTitle":"Transient Hyperlogic Circuit: An Ultrafast and Metastability Self-Loopback Solver for NP-Hard Problems","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":true,"hideJournal":true,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"Transient Hyperlogic, NP-hard Problem Solver, Self-Loopback System, Stochastic Local Search, Parallel in Memory Computing","lastPublishedDoi":"10.21203/rs.3.rs-6419602/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-6419602/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"Realizing the large-scale hyperlogic operation and signal processing in the real-world system paves the way for the next generation of the artificial intelligence architecture. Over the decades, the most widely applied personal computing resource is composed by the classical logic, which is benefit from using the transistor as the all-purpose computing unit with compact size and obvious on-off status difference. However, in the advanced reasoning model, it is intractable for the traditional logical system that makes a brute judgement in black and white to process the conflicts and the ambiguations from the information. Here, we put forward the new concept of hyerlogic operation computing system, which has an extra ‘paradoxical’ state to handle the massive conflicts efficiently. And we also verify our concept by implementing the stochastic local search algorithm for the Boolean constraint satisfiability problem in the logic gate-based circuit and observe the conflict competition mechanism of the variables for getting truth assignment. The ‘paradoxical’ state of the variable is realized by a pair of back-to-back inverters, and the conflict information is passed by the crossbar structure among the unsatisfied clause and the unsettled variables. Interestingly, we find out this self-loop circuit overperforms the most advanced parallel classical logical reasoning circuit systems and achieves 3.5µs average solution time and 8.6nJ average power consumption for the 1000 SAT instance with 20 variables and 91 clauses, which is over 10 times faster than the current state-of-the-art 3SAT solver in application specific integrated circuit (ASIC) track while keeping the same magnitude of power efficiency.","manuscriptTitle":"Transient Hyperlogic Circuit: An Ultrafast and Metastability Self-Loopback Solver for NP-Hard Problems","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-04-17 17:44:21","doi":"10.21203/rs.3.rs-6419602/v1","editorialEvents":[],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"244744db-b075-418b-a6a4-ae2e1e5df44c","owner":[],"postedDate":"April 17th, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[{"id":47010900,"name":"Physical sciences/Mathematics and computing/Information technology"},{"id":47010901,"name":"Physical sciences/Mathematics and computing/Computer science"},{"id":47010902,"name":"Physical sciences/Engineering/Electrical and electronic engineering"},{"id":47010903,"name":"Physical sciences/Mathematics and computing/Applied mathematics"}],"tags":[],"updatedAt":"2025-05-02T23:15:09+00:00","versionOfRecord":[],"versionCreatedAt":"2025-04-17 17:44:21","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-6419602","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-6419602","identity":"rs-6419602","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}