Created
September 29, 2015 16:00
-
-
Save nerdfiles/d06218d4bb53074d6884 to your computer and use it in GitHub Desktop.
#idea--beatnote.io
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # beatnote.io | |
| Beatnote is a virtual music marketplace that turns everyday music service urls | |
| into coupon and rewards urls. Share great talent, earn "beatworthies". | |
| Beatnote might functions as a module to mplifyr, the engagement platform, as it | |
| evolves toward a decentralized creative voting engine that rewards participants | |
| who promote modular contracts which reflect optimally efficient competitive-growth | |
| macroproperties of the network itself. The network should be able to predict its | |
| own growth and favorably reward miners who are better at discovering and | |
| supporting modular contracts through respect of escalation hook responsiveness, | |
| use of Web Agents to discovery economic frictions, reducing Blocksmell, and | |
| algorithmic predictive-heuristic modeling of bounded a-rational market | |
| simulations expressible using the conceptual machinery of the "science of | |
| the exception" or "of imaginary solutions". To avoid Godelian problems of | |
| "not being able to prove that you cannot prove that 2 + 2 = 5" or Kripkean | |
| "quus" rules, and the propositions or sentences implied by them, we employ | |
| a polynomial time bounded-error satisfiability construction as "a probability | |
| amplification technique applied to amplify the assignment which maximizes the | |
| number of satisfied clauses." Essentially, modular contracts whose settlements | |
| states, encoded within our Finite State Machine (FSM), "achieve(s) the maximum | |
| satisfaction to the set of clauses" are amplified the more they overlap with | |
| the solutions constrained to Boolean satisfiability which are encoded in the | |
| network itself as a merkle session finite state engine. | |
| ## Fully Distributed Clients with Private Key Signing | |
| ### No Federated Servers, Elastic General-purpose Network Architectures | |
| #### OSI Modeling | |
| #### E-R Diagrams | |
| #### Limits of Relational Query Languages | |
| #### Limits of NoSQL Query Languages | |
| #### djangorestframework Serializers and Lovefield | |
| 1. https://github.com/google/lovefield/blob/master/docs/dd_index.md | |
| 2. http://www.django-rest-framework.org/api-guide/serializers/ | |
| #### Modular Contracts, Offline Receipts as Off-chain Domain Voting Pools | |
| ### Asynchronous Module Definition | |
| ### Organic versus Degradable Generational Media Grammars | |
| ### Feature-detection as Services (Modernized AngularJS Hypermedia Directives)[0] | |
| ### Django Microservices in Token-based Authorization-clad AngularJS Directive API Controls | |
| ## Permissionless, Trustless, Anonymous[1] Event-Role Transactional HTTP/2 Streams[2] | |
| ### Hierarchical Event Emitter Microchannels | |
| ### Daisy-Chained Web Agents as Blocksmell Collectors | |
| ### Oracular Lamport Signing Escalation Hooks | |
| ### Elastic Blockchains and Scalability | |
| ### Connectionism and Network Category Theory | |
| ### WebSockets (engine.io) and Off-blockchain unitary fixtures, Domain Reflections as Open Transactional Web Form FSM | |
| ### Time Service Attributes | |
| ### Temporally Clustered Acyclical Binary Sort Algorithms for On-demand Liquidity Estimation | |
| ### Planned Economies, Radar Markets, Satellite Markets, Orbital Collapses ("Flash Crashes", March 18, 2015) | |
| 1. http://www.nanex.net/aqck2/4689.html | |
| #### Proof of Route as Exchange Routing Dispatch Agent | |
| 1. http://www.nanex.net/FlashCrashFinal/FlashCrashSummary_IV.html | |
| Use metadata from Security Information Processor in fair price normalization triage. | |
| ### Well-formed Periodic Collapse within Non-local Process Markets (Hyperliquid Markets) | |
| 1. Periodic Collapse within a given elementary identifies edge assets of process markets which | |
| may unpredictably make false quotes within brittle spread frameworks. Without the | |
| assumption of periodic collapse, the detection of quote stuffing is less feasible. | |
| ### Embodied Commodities | |
| ### Market Decoherence As Approximate Neural Correlate Activation Indemnity | |
| ### Productivity, Activity, Creativity as Modalities of Money/Wealth | |
| ### Cantorian Corlet Cognitive Models | |
| ### Real-time Creative Encounter Merkle Session Engine and Narratological Block Surfer | |
| ### Coinless Ecosystems | |
| ### Deferrable and Extensible Agency in Decentralized Systems of Many Associations | |
| ### The Genetic Age | |
| ### Quantum Luck | |
| ### Deflationary Theory of Computation | |
| ### Translationally Invariant Lattice-field Successor Plat-chains | |
| ### 'Patahashes and Basic Tensor Transformation Rules | |
| — | |
| [0]: http://www.timelessrepo.com/haters-gonna-hateoas | |
| [1]: http://blog.credits.vision/permissionless-vs-permissioned-consensus/ | |
| [2]: http://chimera.labs.oreilly.com/books/1230000000545/ch12.html#REQUEST_RESPONSE_MULTIPLEXING |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment