as far as im concerned red channels mean Inactive on the raspiblitz, furthermore you can always check on the cli with lnlci listchannels
and see the info it prints for certain kind of channels.
Trouble understanding Channels
when i list my open channels i see channels, but don't understand the color coding and icons.
2 channels are red, and one of those has a blue dot by it. The other two are white.
I tried looking for documentation on this but nothing.. please help me understand the display and what any potential problems/ fixes there are.
该提问来源于开源项目：rootzoll/raspiblitz
 点赞
 写回答
 关注问题
 收藏
 复制链接分享
 邀请回答
4条回答

采纳
点赞 评论 复制链接分享

采纳
Yeah i gathered that, but does inactive mean the channel is dead, or just that there is no activity..
点赞 评论 复制链接分享 
采纳
Yeah i gathered that, but does inactive mean the channel is dead, or just that there is no activity..
if not yours.. maybe the other node's offline. Some nodes go offline from times to times due to public ip changes or some other minor issue, that can cause innactivity on that channel for a period of time. Im talking here from empiric experience not an actual reason.
点赞 评论 复制链接分享 
采纳
fair and good to know.. thanks..
点赞 评论 复制链接分享
相关推荐
 4年前回答 1 已采纳 Description Alice Catherine Morris and her sister Irene Barbara frequently send each other emails. Ever wary of interceptions and wishing to keep their correspondence private, they encrypt their messages in two steps. After removing all nonalphabetic characters and converting all letters to upper case, they: 1)replace each letter by the letter s positions after it in the alphabet (1 <= s <= 25)we call this a shift by sand then, 2) divide the result of step 1 into groups of m letters and reverse the letters in each group (5 <= m <= 20). If the length of the message is not divisible by m, then the last k (less than m) letters are reversed. For example, suppose s = 2 and m = 6. If the plaintext were Meet me in St. Louis, Louis. after removing unwanted characters and changing to upper case we get MEETMEINSTLOUISLOUIS We will call this the modified plaintext. We then shift each letter by 2 (Y would be replaced with A and Z would be replaced by B, here), getting the intermediate result: OGGVOGKPUVNQWKUNQWKU And finally reverse every group of 6 letters: GOVGGOQNVUPKWQNUKWUK Note the last two letters made up the last reversed group. As is customary, we write the result in groups of 5 letters. So the ciphertext would be: GOVGG OQNVU PKWQN UKWUK Alas, it's not so hard to find the values for s and m when the ciphertext is intercepted. In fact it's even easier if you know a crib, which is a word in the modified plaintext. In the above example, LOUIS would be a crib. Your job here is to find s and m when presented with a ciphertext and a crib. Input Input will consist of multiple problem instances. The first line of input will contain a positive integer indicating the number of problem instances. The input for each problem will consist of multiple lines. The first line of input for a problem will contain the integer n (20 <= n <= 500) which is equal to the number of characters in the ciphertext. The following lines will contain the ciphertext, all upper case in groups of 5 letters separated by a single space. (The last group of letters may contain fewer than 5 letters.) There will be 10 groups of letters per line, except possibly for the last line of ciphertext. The input line following the last line of ciphertext will contain the crib; a single word consisting of between 4 and 10 (inclusive) upper case characters. Output Output will be two integers, s and m on a line, separated by a single space, indicating the encryption key that produces the crib, where s is the shift and m is the reversed group size. If there is more than one solution, output the one with smallest s. If there is more than one with the same s, output the one with smallest m. If no such s and m exist, output the message Crib is not encrypted. Sample Input 4 83 FIQMF IISFN QMFIB EOPFH FNQMV PSFIU IZNGP UPEUS BFPEP PEPPE PPEPN QMFIP EOPIS FIQMF IBSFN QMFBE OPI RHONDA 105 VDBMN DQDGS LNQEM ZLZRZ RNGVX ZALNA TERZV CZDGD MZQHZ GENKK KONSC DJHKC KKZAD RZAXZ SNMRH GBHGV RZVDG XZRNS XZKOS ZCNNF SHFMH BOMBAY 50 QFNWX YQFNW YSAQX FYNWY XQFNW SXYQF FXNYS AXYQF NASXY QFNAX HEAVEN 20 GOVGG OQNVU PKWQN UKWUK LOUIS Sample Output 1 6 25 6 Crib is not encrypted. 2 6
 4年前回答 1 已采纳 Problem Description Bob is a journalist, nowadays,he has a trouble. You know ,the Olympic Games is around the corner, as a fan of athletic sports, he certainly wants to see the Olympic Games, but as a journalist, the Olympic Games seems to be the busiest time,because Bob needs to report so many games.Fortunately , he has a kind boss.He gives Bob a target, as long as Bob meets the requirement, he can go home to see the Olympic Games. Now,the boss gives every competition a value, which represents the importance of the competition.As long as the sum of the competitions' value that Bob reported is not less than the target, he can go home.Although there are a lot of competitions every day,some competitions may take at the same time, so Bob can only choose some competitions to report.Now the problem is what's the earliest time that Bob can go home? To finish his work more easily, Bob gets some information about the competition.He finds every day is divided into 24 parts and every competition takes up at most 2 parts.There are 3 kinds of competitions:the first one only takes up 1 part of a day;the second one takes up two successional parts of a day,it means the competition will hold at the p day's q and (q+1) part;the third one is special,it is held at two successional days,it means the competition will hold at the p and p+1 days' q part(ie.If a competition is held at the 2 day's 3 part, it will also take up the 3 day's 3 part.) Meanwhile Bob finds two competitions' first parts will not coincide,and two competitions' second parts will not coincide . Input The first line contains the number of cases. For each case, there are several lines represent the information of the competitions (The number of competitions will not exceed 1150).Each line includes p : the start day of the competition (0 <= p <50); q : the start part of the competition (0 <= q <23) ; a string s represents the form of the competition ( "first" or "second" or "third" as recorded above ) ) the last one is the value of the competition m (0 <m <1000). Separate line with 1 means the end of the competition. Then a line with a num, need (0 <= need <2000000), means the boss's target. Output For every case ,output the earliest day that Bob can go home.If it is impossible,output "what a pity!" Sample Input 2 0 17 third 999 1 990 0 1 second 90 0 2 first 900 1 990 Sample Output 1 what a pity!
 回答 2 已采纳 Lazy Genius recently received a detailed map of a tomb. He believed that there should be some rare relics in the tomb. As known to all, there are many lethal traps in the tomb, certainly, including the entrance door. If you break into the tomb, you might be killed. Well, don't worry since you have a computer to help you. The door has N locks. Beside the door, there are M switches. Each switch controls several locks. When you press one switch, the corresponding locks will change their status (locked>unlocked, unlocked>locked). If any lock changes its status more than three times, all the locks will lock up and can't be unlocked forever. Lazy wants to open the door as soon as possible. Because of your excellent accomplishment in the previous missions, Lazy turned to you, believing that you could help him. Input The input contains several test cases, separately by a blank line inbetween. The first line of each case contains two integers, N (0 <~~~~". Sample Input 4 3 3 1 2 3 2 3 4 1 4 Sample Output 2
 回答 1 已采纳 Problem Description Taman and his friends are going to arrange an election for their club. The rule of this election is simple. Every member of the club can cast a single vote for one person. Even one can vote for himself too. If A casts his vote for B and B casts his vote for C then it means that C gets both the votes of A and B. It means if a man casts his vote for someone then the votes he got will also be added to the person he votes for. Now there is a problem if A’s vote goes for B and B’s vote for A. In this case, both of them have the same number of votes and it is a tie! So a tiebreaker will be needed. In this situation, all the votes of A and B and their supporters will be cancelled. If one’s vote goes for another then one is considered as the supporter of another. Now you are elected as the election commissioner for the election of the club. It is your duty to publish the result of the election. If you find no possible winner or if two or more members have same number of votes then you should declare the situation as “Trouble”, print the name of the winner otherwise. Instead of name, a unique number for each member identifies the members of this club and the number should always be nonnegative and less than the total number of members of the club. Input There will be multiple test cases. Every test case starts with a single integer N on a line. 0<N<= 100000. N denotes the number of members of the club. N lines following. Each I’th line will be consisting of a single integer J; denoting I’th member casts his vote for J’th member. 0<=I, J<N. Output The output for every case consists of a single integer, which denotes that the M’th member is the winner or a single word, “Trouble”, if a unique winner can not be determined. Here quotes are for clarity. Sample Input 3 1 2 2 4 1 2 0 3 2 1 0 5 1 2 0 2 3 10 7 6 1 8 9 2 7 9 5 4 Sample Output 2 3 Trouble Trouble Trouble
 sarahxia618的博客 In the long history of mankind, it is full of the scourge of hyperinflation against ordinary people. Some governments have used banks to spam banknotes, create hyperinflation, and madly plunder the ...
 OmniSpace的博客 This article covers the second Hinton’s capsule network paper Matrix capsules with EM Routing, both authored by Geoffrey E Hinton, Sara Sabour and Nicholas Frosst. We will first cover the matrix capsu...
 亓官劼的博客 大学英语综合教程四 Unit 6 课文内容英译中 中英翻译 大家好，我叫亓官劼（qí guān jié ），在CSDN中记录学习的点滴历程，时光荏苒，未来可期，加油~博客地址为：亓官劼的博客 本文原创为亓官劼，请大家支持原创，部分平台一直在盗取博主的文章！！！ 博主目前仅在CSDN中写博客，唯一博客更新的地址为：亓官劼的博客 文本为博主整理翻译所得，送给有需要的小伙伴，...
 zhangrelay的博客 Ubuntu 意外死机 （Linux Crash/Hang）解决以Intel Bay Trail/J1900/N2940 为例，通常是由于linux kernel和硬件兼容性问题导致：查询网址：https://bugzilla.kernel.org/点开对应问题，就可以看到问题，和一些解决方案。 Bug List: (5 of 5) First Last Prev Ne
 5年前SoldierJazz2021的博客 Contents1 The Router 1.1 Getting started 1.1.1 Installation 1.1.2 Initial configuration 1.1.3 Failsafe mode 1.2 Configuring OpenWrt 1.2.1 Network 1.2.2 Wireless 1.3 Advanced configur
 太阳火神的美丽人生的博客 Java Secure Socket Extension (JSSE) Reference Guide
 9年前dbLenis的博客 Magic Quadrant for Business Intelligence Platforms 6 February 2012 ID:G00225500 Analyst(s): John Hagerty, Rita L. Sallam, James Richardson VIEW SUMMARY In 2011, business
 4年前zx249388847的博客 https://developer.mozilla.org/enUS/docs/Mozilla/IPDL/Tutorial In This Article IPDL, short for "Interprocesscommunication Protocol Definition Language", is a Mozillaspecific languag
 weixin_30468137的博客 Before starting with best practices tobe followed, it is good to have clear understanding of how memory is managed (allocation, deallocation). So, let us start with memory management first. Managed ...
 亓官劼的博客 大学英语综合教程四 Unit 1至Unit 8课文内容英译中 中英翻译 大家好，我叫亓官劼（qí guān jié ），在CSDN中记录学习的点滴历程，时光荏苒，未来可期，加油~博客地址为：亓官劼的博客 本文原创为亓官劼，请大家支持原创，部分平台一直在盗取博主的文章！！！ 博主目前仅在CSDN中写博客，唯一博客更新的地址为：亓官劼的博客 文本为博主整理翻译所得，送给有...
 weixin_30410999的博客 What is Dark Social & Dark Traffic? ByIaroslav Kudritskiy Google Analytics is supposed to speak the truth about website traffic. However, looking into you're traffic channels,...
 深渊号角的博客 ai眼底图像分类预处理Have you ever wondered if you could classify images without any knowledge about deep learning? Nowadays great free libraries exist such as Keras and fastai in Python, or the Intelec AI soft...
 JA的博客 What have you tried? Dec 8th, 2008 development 9 min read Foreword: This is one of the most popular articles I’ve ever written,...
 4年前查理曼大帝的博客 “六边形架构”是 Cockburn大牛在2005年 提出的。该架构提供了一种将业务逻辑和具体输入输出技术分离的模式。我在《实现领域驱动设计》一书中看到该书作者将六边形架构应用于DDD（领域驱动设计），觉得很有启发，因此尝试将该架构的原文译出，供大家参考。本文中的业务逻辑相当于DDD中的domain和application两层，用户界面和 数据库 访问等相当于DDD中的Interface和Infra
 m0_37759590的博客 article: Your actions speak louder A peace corps staff member is hurriedly called to a town in Ethiopia to deal with reports that one of the volunteers is treating Ethiopians like dogs.What could the ...
 weixin_34148508的博客 2019独角兽企业重金招聘Python工程师标准>>> ...