22,069 Matching Annotations
  1. Sep 2023
    1. Customization

      customize.dist folder

    2. customize.dist

      customize.dist

    3. CryptPad applications is based on

      collaboration between different users

    4. CryptPad sends some unencrypted data in order to recognize each user:

      CryptPad sends some unencrypted data - in order to recognize each user: the - "Public signing key", - generated automatically by CryptPad for each user account.

      This is the only link between a user's data and - their CryptPad account, however - this is a short random string - that does not contain any identifiable information.

    5. Zero-knowledge¶ All user data must be encrypted before being sent to the server.

    1. Alan Kay's tribute to Ted Nelson at "Intertwingled" Festival - YouTube

      )

    Annotators

    URL

    1. docdrop

      )

      Alan Kay Tribute to Ted Nelson at Intertwingled

    2. hypermedia as the engine of application state with the sense that you actually navigate through an application by means of the responses

      4 Can Programming be Liberated from the von Neumann Style | IndyWeb navigate through the application state

    1. With programming in the large, program changes can become difficult.[2] If a change operates across module boundaries, the work of many people may need re-doing.

      not if the boundaries rely on self-composing interfaces based on universal mechanisms

    2. Programming in the large and programming in the small

      what a misnomer

      programming by definition is creating software artifacts in the small. /This is already a mistake to think that our task is adequately called programming

      software is all about articulating intent in the large or in the small it should not be different if you let the problem the task guide the way the system grows

    1. A unique feature on Dedicated Gateways is the ability to set a file as the gateway root. It's a simple redirect of a gateway root url to a specific CID you have designated. For instance, if you visit https://pinata-media.mypinata.cloud you would be redirected to https://pinata-media.mypinata.cloud/ipfs/QmVLwvmGehsrNEvhcCnnsw5RQNseohgEkFNN1848zNzdng. This is create for websites hosted on Pinata or smaller projects (like this cool photo zine).

      setting gateway root

    2. Gateways

    3. A unique feature on Dedicated Gateways is the ability to set a file as the gateway root. It's a simple redirect of a gateway root url to a specific CID you have designated. For instance, if you visit https://pinata-media.mypinata.cloud you would be redirected to https://pinata-media.mypinata.cloud/ipfs/QmVLwvmGehsrNEvhcCnnsw5RQNseohgEkFNN1848zNzdng. This is create for websites hosted on Pinata or smaller projects (like this cool photo zine).
    1. We’re now in servitude to the fiefdoms of our new global masters, Lord Zuckerberg of Facelandia and Sir Musk of the rotten borough of X. Imagine the following scene straight out of the science fiction storybook.

    1. Replicating a database across peers

      from : https://hyp.is/XP7OlluoEe64GDvACJGxHA/github.com/orbitdb/orbit-db-nextgen/pull/62

      for : orbit-db-nextgen

      for : orbit-db-nextgen

    2. To learn more, check out OrbitDB's sychronization protocol and the OrbitDB replication documentation.
    3. The power of OrbitDB lies in its ability to replicate databases across distributed systems that may not always be connected. A simple way to replicate a database between peers can be accomplished by opening a database, listening for updates and iterating over the records as those updates occur.

      the missing piece

    1. feat: Add support for Helia.

      for : orbit-db-nextgen

    2. You're correct, only the heads are replicated. To complete the replication process, you explicitly iterate over the recordset which will replicate all records. See https://github.com/orbitdb/orbit-db-nextgen/blob/main/docs/DATABASES.md#replicating-a-database-across-peers for an example.
    3. In orbit-db-nextgen adding events to a log is blazing fast at the beginning and starts to slow down rapidly, is this something that can be improved?

    4. ETA on when we can expect this integrated upstream

      ETA on odbitdb nextgen

    5. since I use OrbitDB as an integral part of my application I am kind of waiting on this.

    6. Looking forward to Helia integration with orbit-db-nextgen

    1. They are in the process or rewriting it for Helia in this pr for in the nextgen repo: orbitdb/orbit-db-nextgen#62

      for : orbit-db-nextgen

    2. How to use Orbit DB with Helia?

      for : orbit-db-nextgen

    1. Update landing page to show to a non-node how to start #269

    1. Helia

      A lean, modular, and modern implementation of IPFS for the JS and browser environments that supersedes js-ipfs. Learn more at https://github.com/ipfs/helia

    1. Even simple technology stacks like static site generators (e.g., Jekyll) require a workflow and will stop working at some point.

      stop working at some point

    2. complex

      is it complex or we just made it complicated

    3. Yet every platform with irreplaceable content dies off some day

      platforms die of

    4. the increasing complexity of keeping alive indie content on the web, leading to a reliance on platforms and time-sorted publication formats (blogs, feeds, tweets).

      keeping alive indie content

      for : value.prop - IndyWeb

    5. Bookmark after bookmark led to dead link after dead link. What's vanished: unique pieces of writing on kuro5hin about tech culture;

      disappear

    6. A Manifesto for Preserving Content on the Web This Page is Designed to Last

    1. Unicode Character “㊔” (U+3294)

      Circled Ideograph Name

      for : utf8 icons used as a utf8 icon for trailmark dev

    1. WORDPRESS WEBSITE DEVELOPMENT

    2. Indyweb.net can assist your business with everything from logo design, a simple presence on the web or a full-blown e-commerce website.

    1. Indy In Depth – an e-book covering both Indy 9 and 10.

    2. Atozed Software

    Annotators

    URL

  2. www.indyproject.org www.indyproject.org
    1. Indy

      Indy is an open source client/server communications library that supports TCP/UDP/RAW sockets, as well as over 100 higher level protocols including SMTP, POP3, IMAP, NNTP, HTTP, FTP, and many more. Indy is written in Delphi but is also available for C++Builder and FreePascal.

    1. challenges the giants

      there is a growing need for a - privacy-first option,”

      said Brendan Eich, CEO and co-founder of Brave.

      • “Big tech

      has a firm grip on the market as it exists today, and

      Brave is determined to offer users - an alternative that challenges the giants and -puts the power back in the hands of the user.

      With over 36 million monthly active users on our browser, - we are reshaping the industry with our - privacy-by-default ecosystem.”

    2. privacy-first approach

      slogan - privacy-first approach

    3. a private and user-first alternative to big tech solutions

    1. VGG Image Annotator (VIA)

      http://launch-indy0-net.ipns.localhost:48084/tools/Via%20Subtitle%20Annotator/VIA%20Subtitle%20Annotator.html

    2. VIA is an open source project based solely on HTML, Javascript and CSS (no dependency on external libraries).

      WebNative , self-contained. no server please we wish to be autonomous

      it is open source

      and ready to be plugged out to as an Openb Ambient Capability

      in the Long Tail of the Autnonomous IndyWeb

    3. The complete VIA software fits in a single self-contained HTML page of size less than 400 Kilobyte that runs as an offline application in most modern web browsers.

      It is a PWA

    1. WORLD FUTURES STUDIES FEDERATION - WFSF is a UNESCO and UN consultative partner and global NGO with members in over 60 countries

    1. there is no sense that their actions actually worsened the crisis. But that seems to have been the case.

      true

    2. It ain’t what you don’t know that gets you into trouble. It’s what you know for sure that just ain’t so. – Mark Twain

      missatribution

    3. a little Twain misattribution wouldn’t bug me but the quote is literally about the dangers of thinking you know something that actually isn’t true. What delicious irony!

      delicious irony

    1. nodes have some kind of indexing service running, which could be an entirely separate executable (and you could have multiple different ones running if you wanted)

      nodes have their own indexing

    2. Getting documents archived on IPFS is one thing, but we also need to be able to search through them.

    3. jbenet commented Sep 4, 2015 @nbingham1 @davidar indeed. very much indeed.

    4. Search engine

      finger tree

    1. Ph.D. candidate Alan Kay envisions the concept of the DynaBook in 1968.

      That future was invented by Alan Kay in 1968

      then it was stolen from us for the best part of half a century

    1. A Beginning is a Delicate Time

      by tomibgtJuly 18, 2017

      “A beginning is the time for taking the most delicate care that the balances are correct”, said Frank Herbert as the writings of the Princess Irulan of his science fiction book Dune.[1]

    2. “A beginning is the time for taking the most delicate care that the balances are correct”, said Frank Herbert as the writings of the Princess Irulan of his science fiction book Dune.[1]

      A beginning is the time for taking the most delicate care that the balances are correct

      in the balance even the smallest details matter

      https://www.linkedin.com/posts/activity-6322423794371780608-VXiS

      https://www.linkedin.com/feed/update/urn:li:ugcPost:6322423494692966400?commentUrn=urn%3Ali%3Acomment%3A%28ugcPost%3A6322423494692966400%2C6324758947676897280%29

      Description The main point at the end is missing... she takes the feather and everything collapse.... in the balance even the smallest details matter

    1. John Backus turing Award Lecture 1978

      Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs

    1. Consistency, Availability, and Partition tolerance

      Description

      CAP stands for Consistency, Availability, and Partition tolerance. The theorem states that you cannot have all three, as there are natural tradeoffs between the items. Similar to “fast, cheap, and easy, pick two,” people say about CAP: “consistency, availability, or partition tolerance, choose two.”

    1. Intuitive Thinking As a Spiritual Path (The Philosophy of Freedom) By Rudolf Steiner

    1. community or neighborhood clouds.

      neighbourhood clouds

      //

      who is doing the job of providing capabilities across the internet of internets acros decent(ralized) ecosystems

    2. a network of thousands of interconnected Internets

      //

      over web people centered indy.nets too

    3. people have been relegated to Internet “users,” or “clients”

      people users clients

      slaves

    4. the Internet of Internets

      internet of internets

    5. turning us all into products.

      us products

    6. Welcome to the Internet of Internets

  3. threefold.io threefold.io
    1. Decentralized Autonomous.Internet Infrastructure.

      ThreeFold is a globally-distributed grid of storage, compute, and network capacity, acting as “no middleman” Internet resources between independent capacity providers and users.

    1. Fundamentally, STOs are a pattern copied from the centralised world — the network may be decentralised internally, but ultimately, it’s a centralised entity for end users. The only way to have true decentralisation is by having the users themselves comprise the distributed system community.

      security token offering

      //

      This is a call for the interpersonal indy.net where people are autonomous actors in their ow(ed) local first, private first, offline first, evergreen, interpersonal trust networks

    1. Presearch is a DecentralizedSearch Engine

      Search privately, receive better results and get rewarded with the Presearch decentralized search engine, powered by blockchain technology.

    1. collective wisdom

      surely not

      co-emergent, co-evolving through mutual learning and co-laboration

      commons yes "Collective"

      problematic

      only in name

    2. kumbaya

      too bad

      it is not about

      it is not about competing but paying attention and mmutual learning from the dual other

      for mutual completing benefit

      new synthesis

      The more dual a position that is cultivated with deep care and attention to your own the more attention and care should be taken to learn from that view point

      Also consider, just because you agree on a question

      Like accepting the validity of Gödelás incompletness zou maz ground worked views that are duals of each other

    3. disagreements will ripple out, shaping the theories and practices they believe are needed to see wisdom becoming more common

      disagreements ripple out

    4. “The Liminal Web” called “The Wisdom Web,”
    5. Approach the wisdom commons as a work of art.

      work of art

    6. It is wiser to become less foolish instead of more wise, which avoids “wisdom signaling.

      less foolish?

      wisdom signalling

      // Stay foolish stay hungry - honour the complexity of the situation - pay attention and CARE - wide boungary thinking - awake - responsibility to dream

    7. Multiple wisdom commons will compete against each other.

      Plurality

      not competition but completion -

    8. A wisdom commons is found in relationships, not propositions.

      wisdom is in the connections

      not the propositions

      // "The key to quality is in the quality of the connections"

    9. I define a “wisdom commons” simply as “a place that makes wisdom more common.”

      a place that makes wisdom more common.

      // before reading my partisan biased loaded response is How are we to gain wisdom if we are not able to share and collaborate in depth at scale about our mutual learnings.

      Should not we need to to advance the cause of "Open Learning Commons"

      Description

    1. preserve social media with links

      try to preserve social media with links in

    2. think a link

      Think a Link

    3. we have the most amazing visions of hypertext links in those days

      had the most amazing visions of hypertext links in those days

    4. how we preserve this stuff when it's also deepening to twinkle

      how we preserve this stuff - when it is also deeply intertwingled

    1. Space and time advantages

      Description

    2. Bloom filter

      test whether an element is a member of a set

    3. test whether an element is a member of a set

      Bloom Filter

    1. The word filter is a Bloom filter made up of the words in the text of the entry
    2. Rationale

      A log structure that you can append to, and search through can be useful for many things. Some properties we want these structures to have are:

      • Cheap append
      • Cheap random access
      • References to old versions of the structure stay valid
      • Full text-search through the entries
      • Keeping only the parts of the structure in memory that you need to look at
    3. An append only log on IPFS with indexing.

      with indexing

    4. a Finger Tree, the tree nodes being annotaded with counts and word-filters.
    5. Append only log

    1. Indexing and storing content locally is an interesting implication of the content addressable and linked web in that the indexes can also be content addressable and are 1st citizen data types.

      1st citizen datatypes

    2. Indexing content addressable and linked data

    1. IPFS keyword search based on double-layer index

      Distributed storage plays an increasingly important role in the context of big data. interplanetary file system (IPFS) is a distributed file system, which can form a network of all heterogeneous devices in the same way. Different from traditional HTTP protocol based on physical location, IPFS distributed network is based on content addressing and obtains files through file hash. However, this precise file search method cannot obtain files without file content hash which greatly reduces file utilization and liquidity. Therefore, this paper proposes a two-layer index scheme. After receiving the uploaded file, the node parses the file and establishes the index. The nodes are replicated using a CRDT data structure based on optimistic replication for indexing operations. IPFS pub-sub is used as the CRDT message delivery method between nodes. The first-layer index is the inverted index file corresponding to each keyword. The second-layer index is the CID of the inverted index file for each keyword. Each node maintains full index rather than through a distributed hash table stores dispersion index can ensure complete data search, at the same time greatly reduce search response time. Inverted index files are stored in IPFS network to reduce storage space and facilitate state-based replication of newly added nodes or nodes that have been offline for a long time. Finally, through the analysis of experimental data, it is proved that the scheme can greatly reduce the search response time while occupying acceptable storage space.

    1. Distributed wiki search Search engine for https://github.com/ipfs/distributed-wikipedia-mirror

      wiki search titles only

    1. Keyword Search in Decentralized Storage Systems

      The emerging decentralized storage systems (DSSs), such as InterPlanetary File System (IPFS), Storj, and Sia, provide people with a new storage model. Instead of being centrally managed, the data are sliced up and distributed across the nodes of the network. Furthermore, each data object is uniquely identified by a cryptographic hash (ObjectId) and can only be retrieved by ObjectId. Compared with the search functions provided by the existing centralized storage systems, the application scenarios of the DSSs are subject to certain restrictions. In this paper, we first apply decentralized B+Tree and HashMap to the DSSs to provide keyword search. Both indexes are kept in blocks. Since these blocks may be scattered on multiple nodes, we ensure that all operations involve as few blocks as possible to reduce network cost and response time. In addition, the version control and version merging algorithms are designed to effectively organize the indexes and facilitate data integration. The experimental results prove that our indexes have excellent availability and scalability. Keywords: decentralized storage systems; keyword search; decentralized B+Tree; decentralized HashMap 1. Introduction With the rapid development of internet technology, centralized storage has become an important business model in our daily life. Centralized storage not only provides a variety of storage services for both individuals and businesses but also supports different kinds of queries, thus meeting the needs of users. However, centralized storage systems depend on a trusted third party, which inevitably inherits the single point of failure drawback. Even if centralized storage systems are backed up for data availability, they still suffer from certain factors of force Majeure (such as political censorship), which can cause users to be unable to access their own data. From the above point of view, data storage requires a more secure and free environment. The emerging DSSs, such as InterPlanetary File System (IPFS) [ 1 ], Storj [2 ], and Sia [ 3], can provide people with a new storage model. They are built on a peer-to-peer (p2p) network, so there is no need to rely on third-party platforms. In these systems, data are not managed by a central node but divided into blocks and distributed through the network. A data object can be accessed as long as it exists on any node. Each node in the network can share its free disk space, thus reducing the cost of decentralized storage. Users do not have to worry that they will not be able to access their own data because DSSs can be combined with blockchain to ensure data availability [4,5]. One of the key reasons why the traditional centralized storage systems can be applied to various fields is that they provide rich query services, which is exactly the defect of DSSs. In the DSSs, each node or data object is assigned a unique identifier (NodeId or ObjectId) by a cryptographic hash

    1. Index Provider

      This repo provides a reference index provider implementation that can be used to advertise content to indexer nodes and serve retrieval requests over graphsync both as a standalone service or embedded into an existing Golang application via a reusable library.

    1. EU's Digital Marketing Act requires "gatekeepers" - to interoperate with third party messaging - remove preinstalled app - shop alternative app stores

    2. keep gatekeepers “from imposing unfair conditions”

      “ensure the openness of important digital services.”

      Beyond dictating that - messaging apps must interoperate,

      the DMA requires that gatekeepers, among other things, - let users remove pre-installed apps or - shop alternative app stores.

    3. WhatsApp is working on cross-platform messaging

      A new WhatsApp beta contains a clue about how Meta is preparing to comply with the EU’s Digital Markets Act that will require chat interoperability with other services.

    1. part of : https://decentralized.blog/catching-the-blockchain-train.html

    2. original : https://decentralized.blog/ten-terrible-attempts-to-make-ipfs-human-friendly.html

      https://docdrop.org/pdf/ten-terrible-attempts-to-make-IPFS-human-friendly-tmx0v_ocr.pdf/?src=ocr

    3. IPFS human-friendly naming; is it possible?

      Not very easy to highlight and annotte for sure

    1. Human Friendly Names Candidate Open Problem #286 opened Mar 12, 2018 by olizilla

      open problems

    1. CID as a Subdomain ipfs/in-web-browsers#89 Open Add support for inlinling via the id-hash ipfs/kubo#5281
    2. jbenet added the Candidate Open Problem label

      to : candidate Description

    3. POC to have ipfs generate and resolve addresses in mnemonic base.

      menmonic base

    4. On announcing the idea, we were introduced to the already built in support for proquint encoding for IPNS

      to : proquint

    5. Human Friendly Names

      Human friendly Names

    1. DKG ExplorerDive deeper into Knowledge Assets

      Find humanity's most important assets whether digital collectibles, history logs, consumer goods, supply chain data, and more.

  4. bafybeidaramefqyqktbumslhamntgjf6yphx5uj5arseq34a4wkq4cc52u.ipfs.w3s.link bafybeidaramefqyqktbumslhamntgjf6yphx5uj5arseq34a4wkq4cc52u.ipfs.w3s.link
    1. Knowledge is power, knowledgeshared is power multiplied.
      • Knowledge is power,
      • knowledge shared is power multiplied
    2. AI-ready Knowledge Assets. Datasupercharged

      From supply chains to metaverse, supercharge any data with ownership, discoverability and trust in the Decentralized Knowledge Graph

    3. OriginTrail - trusted knowledgeinfrastructure

      OriginTrail Decentralized Knowledge Graph combines knowledge graph and blockchain technologies to enable a universe of AI-ready Knowledge Assets, allowing anyone to take part in

      trusted knowledge sharing.

      Get started

      Trusted Mutual Learning Networks

      forget blockchain

      knowledge assets

    4. Power ofknowledge tothe people

      Power of knowledge to the people - In an overflow of misinformation,

      trusted data becomes - the cornerstone of humanity’s - security and prosperity.

      Start making a diference with OriginTrail.

    1. We're building encrypted software to amplify the efforts of activists, journalists, & nonprofits -- anyone fighting for social change.

      twitter account suspened>

    1. secure chat, and task management.

      secure chat

      and task mnagement

    1. IPFS for Developers

      Pinata makes it simple to upload content to IPFS with developer tools and fetch it at blazing speeds with Dedicated Gateways

    1. Why IPFS is the Storage Solution For Web3 Developers

      Unlock the potential of Web3 development with IPFS, the decentralized storage solution that empowers developers to create resilient, secure, and scalable applications for the future of the internet.

      Description

    1. The Knowledge Graph Workbench

      Bring new knowledge graphs to life with ease, and generate lightbulb moments for your teams, using your own data.

      Data Graphs is the essential no-code Knowledge Graph Workbench that helps you get started quickly, and avoid the common graph database problems that slow people down.

  5. bafybeiaxvdutiarkmrdyhmtcx75rpmuh2h3uoukg27mbfym2gfqxzacz5a.ipfs.w3s.link bafybeiaxvdutiarkmrdyhmtcx75rpmuh2h3uoukg27mbfym2gfqxzacz5a.ipfs.w3s.link
    1. This is an unpublished technical report

      that introduces a mapping between -linguistics and mathematical graph theory.

      • Linguistics and graph theory will be broken down to study
      • the overlap of constituentparts
    1. ipfs://bafybeigdyrzt5sfp7udm7hu76uh7y26nf3efuylqabf3oclgtqy55fbzdi

      ipfs://bafybeigdyrzt5sfp7udm7hu76uh7y26nf3efuylqabf3oclgtqy55fbzdi

    1. Coarse-graining as a downward causation mechanism Jessica C. Flack Jessica C. Flack http://orcid.org/0000-0001-6808-9695 jflack@santafe.edu Google Scholar Find this author on PubMed Search for more papers by this author Jessica C. Flack

    1. Semantic Web

    2. Quantized

    3. share portions of your tree to private teams and/or share them publicly, or have collaborative discussion threads branching off from paragraphs right in the body of the text.

      collaborative discussions right off the text

    4. it lets you break up chunks of content into smaller pieces (similar to a Jupyter Notebook) and organize them on a tree.

      organize as a tree

    5. Quanta Collaborative Documents, Wikis, Social Media, ChatGPT, Fediverse, Semantic Web

    1. It’s here: https://quanta.wiki 19 source here: https://github.com/Clay-Ferguson/quantizr 8 BTW, if you’re into the Fediverse it has ActivityPub implementation also (only the second Java ActivityPub to ever be created, according to my research)
    1. Datasets allow users to upload and work with large files. This article will describe how to create, interact with, or manage datasets.

    1. noteable Work With Data The Way You Want

    1. Barrett Brown and Steve Phillips - Pursuance Project (Under The Hood)

      eco system of people

    1. Dynamic imports

      <svg xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" width="70" height="60" viewBox="0 0 70 60"><style>a { cursor: pointer; }</style><g id="Logo" fill="none" fill-rule="evenodd"><g id="Logo-Header-Beta-Abbr"><g id="BODY"><path d="M35.463 35.037c1.177 1.66 2.93 2.24 4.417 2.24 3.716 0 5.016-2.2 5.016-4.855V23.5h-8.298v2.552h5.264v6.12c0 1.87-.702 2.47-2.085 2.47-.887 0-1.775-.518-2.56-1.493l-1.754 1.886zm11.295.177c1.42 1.263 3.243 1.916 5.027 1.916 3.283 0 5.128-1.916 5.128-4.117 0-1.875-1.095-2.956-2.838-3.608l-1.6-.693c-1.278-.47-2.17-.754-2.17-1.57 0-.753.67-1.202 1.824-1.202 1.133 0 1.964.388 2.876 1.06l1.52-1.895c-1.195-1.142-2.796-1.753-4.398-1.753-2.86 0-4.845 1.753-4.845 3.954 0 1.936 1.338 3.077 2.817 3.628l1.703.733c1.277.49 2.047.755 2.047 1.59 0 .795-.608 1.284-1.986 1.284-1.156 0-2.392-.57-3.385-1.384l-1.723 2.06z" id="JAV-3" fill="#333"/><g id="Layer_2" fill="#BE1622"><path d="M20.487 33.932l.714 1.446 5.395-2.662-.713-1.446-5.393 2.662zM21.67 30.1l3.746 1.85.714-1.446-3.746-1.85-.714 1.447z" id="Shape"/><path d="M20.126 35.49l7.486 2.18.45-1.546-7.484-2.183-.452 1.55z" id="Shape"/></g><path d="M23.968 18.694c-1.73 0-3.13 1.402-3.13 3.13 0 1.73 1.4 3.13 3.13 3.13 1.728 0 3.13-1.4 3.13-3.13 0-1.728-1.402-3.13-3.13-3.13zm0 4.113c-.543 0-.983-.44-.983-.983 0-.543.44-.982.983-.982.543 0 .982.44.982.982 0 .543-.44.983-.982.983z" id="Shape" fill="#BE1622"/><path d="M25.87 24.393c-.19-.593-.864-1.073-1.5-1.073h-.743c-.637 0-1.307.483-1.497 1.073l-4.68 14.625c-.19.594.168 1.074.814 1.074h.923c.318 0 .648-.24.737-.545l2.394-8.186c.574-1.944.965-3.583 1.59-5.504h.105c.598 1.92.99 3.56 1.563 5.506l2.42 8.187c.088.3.416.544.733.544h1.033c.638 0 1-.483.81-1.074l-4.705-14.625z" id="V_1_" fill="#BE1622"/></g><g id="FLASHES" fill="#BE1622"><path d="M17.713 15.088l-.456.367 3.898 2.74.09-.094-1.39-1.893.726.043-1.545-1.78.4-.486-4.783-3.617-.09.094 1.86 2.555-.587-.002 1.88 2.076" id="Fill-19_3_"><animate attributeName="opacity" from="1" to="0" dur="1s" begin="overlay.mouseover" end="overlay.mouseout" repeatCount="indefinite"/><animateMotion from="0,0" to="-10,-10" dur="1s" begin="overlay.mouseover" end="overlay.mouseout" repeatCount="indefinite"/></path><path d="M17.51 20.994l.544-.39-2.488-.962.422-.596-5.555-.482-.043.13 2.263.89-.263.486 2.997.735-.46.578 4.145.56.057-.113-1.62-.836" id="Fill-20_3_"><animate attributeName="opacity" from="1" to="0" dur="1s" begin="overlay.mouseover" end="overlay.mouseout" repeatCount="indefinite"/><animateMotion from="0,0" to="-10,-6" dur="1s" begin="overlay.mouseover" end="overlay.mouseout" repeatCount="indefinite"/></path><path d="M30.297 15.088l.456.367-3.898 2.74-.09-.094 1.39-1.893-.726.043 1.545-1.78-.4-.486 4.782-3.617.092.094-1.86 2.555.586-.002-1.88 2.076" id="Fill-19_2_"><animate attributeName="opacity" from="1" to="0" dur="1s" begin="overlay.mouseover" end="overlay.mouseout" repeatCount="indefinite"/><animateMotion from="0,0" to="10,-10" dur="1s" begin="overlay.mouseover" end="overlay.mouseout" repeatCount="indefinite"/></path><path d="M30.502 20.994l-.545-.39 2.488-.962-.422-.596 5.555-.482.043.13-2.26.89.262.486-2.996.735.46.578-4.145.56-.057-.113 1.62-.836" id="Fill-20_2_"><animate attributeName="opacity" from="1" to="0" dur="1s" begin="overlay.mouseover" end="overlay.mouseout" repeatCount="indefinite"/><animateMotion from="0,0" to="10,-6" dur="1s" begin="overlay.mouseover" end="overlay.mouseout" repeatCount="indefinite"/></path></g></g></g><path id="overlay" pointer-events="all" fill="none" d="M0 0h80v60H0z"/></svg>

    1. DNSLink is the specification of a format for DNSopen in new window TXT recordsopen in new window that allows the association of arbitrary content paths and identifiers with a domainopen in new window.