Table of Contents
1. First deposit address category of LRT protocol
2. Total number of LRT deposit addresses and deposit strategy
3. Deposit amount of re-pledge address
4. Number of addresses in each deposit amount range
5. ENS word cloud of re-staking address
6. Research on addresses ranked by deposit amount
7.Protocol Loyalty
8. Contribution of giant whales
9. Relevance matrix of LRT protocols
10. LRT protocol correlation matrix for different deposit addresses
Home web3.0 10 pictures to help you gain insight into the current situation of the LRT track

10 pictures to help you gain insight into the current situation of the LRT track

Feb 21, 2024 am 09:06 AM
picture lrt

Author: Crypto Koryo

Compiled by: Frank, Foresight News

The TVL of Liquidity Recollateralized Token (LRT) has reached $3.6 billion, which is undoubtedly the most promising in 2024 one of the narratives.

So, what exactly are the re-staking addresses doing? How do they allocate funds? Where Farming? Which LRT protocols are most commonly used?

In order to solve these problems, this article will use 10 exclusive charts to introduce and analyze the behavior of re-pledged addresses from a comprehensive perspective (Note: All data comes from the "LRT whales" dashboard on Dune) .

10 pictures to help you gain insight into the current situation of the LRT track

1. First deposit address category of LRT protocol

View the LRT deposit addresses in all related protocols, as well as their first LRT deposit, We will find a clear trend, that is, there are three main groups among them.

  • Visionaries - December 2023;
  • Early Majority - late January 2024;
  • Late Majority - Early January 2024;

BTW, this is a very common pattern that can be seen early in the development of many protocols/narratives .

10 pictures to help you gain insight into the current situation of the LRT track

2. Total number of LRT deposit addresses and deposit strategy

So far, about 140,000 wallet addresses have deposited funds into the LRT protocol.

How many protocols do they deposit, and how much do they deposit on average (median)? The vast majority of people have made deposits in more than 1 protocol, and the deposit amount is less than 1 ETH.

10 pictures to help you gain insight into the current situation of the LRT track

Some ambushing airdrop farmers are depositing as much as they can into the LRT protocol - although this is only a minority and not the most popular farming strategy.

Among them, a certain address starting with 0xd6d3 has been deposited in all 11 LRT protocols.

3. Deposit amount of re-pledge address

How much money is deposited in the re-pledge address?

If we exclude the top 5% of whales by deposit amount, we will find that the vast majority of wallet addresses have deposit amounts of less than 2 ETH - these wallets are ambushing EigenLayer related airdrops and maximizing their promotion number of points.

10 pictures to help you gain insight into the current situation of the LRT track

4. Number of addresses in each deposit amount range

Among them, there are 147 wallet addresses that have deposited more than 1,000 ETH into the LRT protocol. Some of these are wallets associated with individual protocols, and there are addresses like analytico.eth that split funds into multiple LRT protocols.

10 pictures to help you gain insight into the current situation of the LRT track

5. ENS word cloud of re-staking address

If you pay attention to the LRT narrative, you should be familiar with the ENS names of some of the LRT whales (size and Proportional to the total deposit amount):

  • analytico.eth
  • vladilena2.eth
  • Christian2022
  • luggis.eth
  • czsamsunsb.eth
  • 58bro.eth

10 pictures to help you gain insight into the current situation of the LRT track

6. Research on addresses ranked by deposit amount

We can rank the addresses according to the total deposit amount Rank the LRT deposit addresses and then define different groups based on the rankings.

We observe that wallet addresses ranked >1000 generally deposit into more protocols, while 94% of wallet addresses ranked

10 pictures to help you gain insight into the current situation of the LRT track

7.Protocol Loyalty

On average, users who deposited to ether.fi and Puffer only rescheduled on 1.41 protocols (on average) staking, which shows their confidence in both protocols.

However, users depositing into smaller protocols like Bedrock, Genesis, and Inception are indeed decentralized farming and diversifying their bets.

10 pictures to help you gain insight into the current situation of the LRT track

8. Contribution of giant whales

This is a very interesting place, we can study how much of the total TVL of each LST protocol comes from the top 30 Name deposit address - the lower this ratio, the healthier and more decentralized the liquidity of the corresponding LST protocol.

And TVL’s largest LRT protocol, ether.fi, ranks first in the degree of decentralization measured by this data!

10 pictures to help you gain insight into the current situation of the LRT track

9. Relevance matrix of LRT protocols

What other LST protocols are commonly used by depositors of a certain LST protocol?

The data shows that ether.fi depositors also tend to deposit to Kelp and Puffer (and vice versa), so there are some interesting correlations here.

10 pictures to help you gain insight into the current situation of the LRT track

10. LRT protocol correlation matrix for different deposit addresses

We can define different groups and conduct a deeper analysis.

For the Shrimp queue (total deposit amount less than 2 ETH), the most popular LRT associated protocols are ether.fi and Puffer, but for the Dolphin queue (between 20 and 100 ETH) Generally speaking, the most popular LRT associated protocols are ether.fi and Kelp.

10 pictures to help you gain insight into the current situation of the LRT track

The above is the detailed content of 10 pictures to help you gain insight into the current situation of the LRT track. For more information, please follow other related articles on the PHP Chinese website!

Statement of this Website
The content of this article is voluntarily contributed by netizens, and the copyright belongs to the original author. This site does not assume corresponding legal responsibility. If you find any content suspected of plagiarism or infringement, please contact admin@php.cn

Hot AI Tools

Undresser.AI Undress

Undresser.AI Undress

AI-powered app for creating realistic nude photos

AI Clothes Remover

AI Clothes Remover

Online AI tool for removing clothes from photos.

Undress AI Tool

Undress AI Tool

Undress images for free

Clothoff.io

Clothoff.io

AI clothes remover

Video Face Swap

Video Face Swap

Swap faces in any video effortlessly with our completely free AI face swap tool!

Hot Article

Roblox: Bubble Gum Simulator Infinity - How To Get And Use Royal Keys
3 weeks ago By 尊渡假赌尊渡假赌尊渡假赌
Nordhold: Fusion System, Explained
3 weeks ago By 尊渡假赌尊渡假赌尊渡假赌
Mandragora: Whispers Of The Witch Tree - How To Unlock The Grappling Hook
3 weeks ago By 尊渡假赌尊渡假赌尊渡假赌

Hot Tools

Notepad++7.3.1

Notepad++7.3.1

Easy-to-use and free code editor

SublimeText3 Chinese version

SublimeText3 Chinese version

Chinese version, very easy to use

Zend Studio 13.0.1

Zend Studio 13.0.1

Powerful PHP integrated development environment

Dreamweaver CS6

Dreamweaver CS6

Visual web development tools

SublimeText3 Mac version

SublimeText3 Mac version

God-level code editing software (SublimeText3)

Hot Topics

Java Tutorial
1666
14
PHP Tutorial
1273
29
C# Tutorial
1252
24
How to use Prim's algorithm in C++ How to use Prim's algorithm in C++ Sep 20, 2023 pm 12:31 PM

Title: Use of Prim algorithm and code examples in C++ Introduction: Prim algorithm is a commonly used minimum spanning tree algorithm, mainly used to solve the minimum spanning tree problem in graph theory. In C++, Prim's algorithm can be used effectively through reasonable data structures and algorithm implementation. This article will introduce how to use Prim's algorithm in C++ and provide specific code examples. 1. Introduction to Prim algorithm Prim algorithm is a greedy algorithm. It starts from a vertex and gradually expands the vertex set of the minimum spanning tree until it contains

How to write a depth-first search algorithm for graphs using PHP How to write a depth-first search algorithm for graphs using PHP Jul 09, 2023 pm 08:45 PM

How to write a depth-first search algorithm for a graph using PHP Depth-first search (DFS) is a graph traversal algorithm that explores as deeply as possible along a branch in the graph until it is no longer possible to continue. Then backtrack to the previous node and continue exploring other branches until all nodes have been visited. In this article, we will learn how to write a depth-first search algorithm for graphs using PHP. First, we create a node class to represent the nodes in the graph: classNode{public$value;

How to implement graph topological sorting algorithm using java How to implement graph topological sorting algorithm using java Sep 19, 2023 pm 03:19 PM

How to use Java to implement a topological sorting algorithm for graphs Introduction: Graph is a very common data structure and has a wide range of applications in the field of computer science. The topological sorting algorithm is a classic algorithm in graph theory that can sort a directed acyclic graph (DAG) to determine the dependencies between nodes in the graph. This article will introduce how to use the Java programming language to implement the topological sorting algorithm of the graph, and come with specific Java code examples. 1. Define the data structure of the graph. Before implementing the topological sorting algorithm, we first need to define

How to use java to implement the strongly connected component algorithm of graphs How to use java to implement the strongly connected component algorithm of graphs Sep 21, 2023 am 11:09 AM

How to use Java to implement the strongly connected component algorithm of graphs Introduction: Graph is a commonly used data structure in computer science, and it can help us solve many practical problems. In a graph, a connected component refers to a set of vertices in the graph that have mutually reachable paths. A strongly connected component means that there is a bidirectional path between any two vertices in a directed graph. This article will introduce how to use Java to implement the strongly connected component algorithm of graphs to help readers better understand the connectivity of graphs. 1. Graph representation In Java, we can use adjacency matrix or adjacency

How to set up two pictures to animate at the same time in PPT How to set up two pictures to animate at the same time in PPT Mar 26, 2024 pm 08:40 PM

1. Double-click to open the test document. 2. After clicking the job to create the first ppt document, click Insert--Picture--From File in the menu. 3. Select the file we inserted and click Insert. 4. Insert another one in the same way, and drag and adjust the two pictures to the appropriate position. 5. Select two pictures at the same time, right-click - Group - Group, so that the two pictures become one. 6. Select the merged graphic, right-click - Customize animation. 7. Click Add Effect, select an effect, and click OK. When you look at the PPT, you will find that the two pictures are moving together.

How to implement graph cut point algorithm using java How to implement graph cut point algorithm using java Sep 20, 2023 pm 12:07 PM

How to use Java to implement the cut-point algorithm of graphs requires specific code examples. Graphs are one of the important concepts in discrete mathematics. Through the representation of graphs, relationships and connections that appear in various real-life problems can be described. In graph-related algorithms, finding the cut points of a graph is a challenging problem. The cut point of a graph is also called a joint point or a cut top. It means that in an undirected connected graph, if a vertex and all the edges associated with the vertex are removed, the original graph is no longer connected. This vertex is called a cut point. This article will introduce how to program using Java

How to use java to implement the Hamiltonian cycle algorithm of graphs How to use java to implement the Hamiltonian cycle algorithm of graphs Sep 21, 2023 am 09:03 AM

How to use Java to implement the Hamiltonian cycle algorithm for graphs. A Hamiltonian cycle is a computational problem in graph theory, which is to find a closed path containing all vertices in a given graph. In this article, we will introduce in detail how to implement the Hamiltonian cycle algorithm using the Java programming language and provide corresponding code examples. Graph Representation First, we need to represent the graph using an appropriate data structure. In Java, we can represent graphs using adjacency matrices or adjacency linked lists. Here we choose to use an adjacency matrix to represent the graph. Define a file called

Find the number of sink nodes in a graph using C++ Find the number of sink nodes in a graph using C++ Sep 01, 2023 pm 07:25 PM

In this article, we describe important information for solving the number of sink nodes in a graph. In this problem, we have a directed acyclic graph with N nodes (1 to N) and M edges. The goal is to find out how many sink nodes there are in a given graph. A sink node is a node that does not generate any outgoing edges. Here is a simple example - Input:n=4,m=2Edges[]={{2,3},{4,3}}Output:2 Simple way to find the solution In this method we will iterate The edges of the graph, push the different elements from the set pointed to by the edge into it, and then subtract the size of the set from the total number of nodes that exist. Example#include<bits/stdc++.h>usingnamespa