bitcoin core – Multisig wallet issue – pair nodes (daemons) wallet.dat and pvt keys

Intro:
I am having an issue of accessing multisig wallet.
due to previous situation I have mixed up private keys and wallet.dat files

Multisig is 2 out of 3
Multisig works this way:
Synchronize multisig addresses between two running bitcoinds
Connects to both bitcoinds, figures out which one knows all the public keys for the mulitisig address, then tells the other about the address.

I have both seeds/sigs

First seed (sig) is a wallet.dat files (got 3 of those not sure which one I have to use)
Second seend (sig) are 6000 pvt keys (all mixed up)

Problem:

I want to pair first and second sig/seed – to pair wallet.dat on one daemon and pvt keys on other so it could generate access to a wallet where bitcoins are.

This would also generate public keys (3 of those) which will also gain me an access to wallet.

Has anyone had experience with this sort of issue?

algorithm – Assessing BigO/small o for forming a dynamic dictionary based on searched key and values pair

I am trying to create a dictionary with a file containing text based on a matched pattern. Lines containing key_str should become keys and subsequent lines not matching key_str should become values and get associated with keys in the dictionary. so i have below code working: But I need help and getting the Big O analysis. How could i say my logic is worth case, Best Case or good case? Also, which case is small o and which is big O

File: file2dict.result-soa1

ml1
/var
/home

cpuml2
/var
/home


Output

my_dict: {ml1: ('/var','/home'), cpuml2: ('/var','/home')}

Code:

import os
homedir = os.environ.get('HOME')

key_str = "ml"
my_dict = {}
val_list = ()
key = ''
with open(homedir + '/backup/file2dict.result-soa1') as file2dict:
    for line in file2dict:
        words = line.split()
        for aWord in words:
            if key_str in aWord:
                if key:
                    my_dict(key) = val_list
                    val_list = ()
                    key = aWord
                else:
                    key = aWord
            else:
                val_list.append(aWord)
    my_dict(key) = val_list
print(my_dict)

rsa – How do I take advantage of a specfic user’s attributes to generate an encryption key pair on the fly to encrypt a file?

Suppose I have the following 3 files with content:

file1.txt:

This is file1.txt.  It is labeled red. 

file2.txt:

This is file2.txt.  It is labeled green. 

file3.txt:

This is file3.txt.  It is labeled blue. 

Suppose these 3 files are stored on my linux file system at:

/home/shared

Finally, suppose I have 3 users who can login to this linux machine:

user1 (should only see files labeled red)
user2 (should only see files labeled green)
user3 (should only see files labeled blue)

How can I use the RSA encryption scheme to generate unique private keys for user1, user2, and user3 such that they can see the files they can decrypt the files they are supposed to see but not the ones they should not see?

Put another way, how can I generate a key pair (public/private) so that user1 can can encrypt red-labeled files and users 2 and 3 cannot decrypt file1.txt?

python 3.x – Calculating the Percentage of a Pair Occurring Across a Lot of Lists

I’m looking for a way to speed this code up. It took about 4.5 hours to run on ~20k decks. I’m open to restructuring my SQL query, but feel adjusting the python would be more effective. The goal of this code is to see how many times a pair of cards occurs in all the decks. For example if `(“card”, “name”) appears in 27/100 decks, it returns .27.

This code takes every deck in a format, and returns the cards in those decks. This gives me a list of a lot of cards ((cardId, "card name", deckId), ... (cardId "card name", deckId)). I use the deckId to make a bunch of lists representing each deck (newList). Using those lists I get each unique card and put it into a separate list (superSet).

From there I loop through superSet twice to get each possible pair. Then loop through newList to see if a pair is in a deck.

I know it’s somewhat complicated and I probably didn’t explain it the best. I’ll gladly update this post to clarify anything I can.

from classes.general import Database

def main():
    dbm = Database()
    with dbm.con:
        dbm.cur.execute("""SELECT c.id, c.name, ctd.deckId FROM cards c 
        JOIN cardToDeck ctd ON ctd.cardId = c.id 
        JOIN deckToEvent dte ON dte.deckId = ctd.deckId 
        JOIN eventToFormat etf ON etf.eventId = dte.eventId 
        WHERE etf.formatId = 5
        ORDER BY ctd.deckId""")
        decks = dbm.cur.fetchall()
        
        #print(decks)

        #I'm not entirely sure how this works
        #Somehow it takes everything with the same deckId (index:2) and puts them into one list
        values = set(map(lambda x:x(2), decks))
        newlist = ((y(1) for y in decks if y(2) == x) for x in values)

        #print(newlist(0))
        
        superSet = ()
        for l in newlist:
            for c in l:
                if c not in superSet:
                    superSet.append(c)

        #print(superSet)
        
        count = 0
        for x in superSet:
            for y in superSet:
                if x is y:
                    continue
                #print(x)
                #print(y)
                for d in newlist:
                    #print(d)
                    if x in d and y in d:
                        count += 1
                deckPerc = count / len(newlist)
                if deckPerc != 0.0:
                    print(count / len(newlist)) #needs to go into the db
                count = 0           

if __name__== "__main__":
    main()

Is it possible to obtain the historical exchange rate time series of trading pair such as BTC-USD on exchanges that do not provide this trading pair?

On exchanges such as Poloniex and Binance, BTC-USD is not offered as trading pair. However, one can buy BTC with USD on some of such platforms (e.g. one can buy BTC with USD on Poloniex and Binance). Are there some ways of obtaining the historical exchange rate time series between BTC and USD on such exchanges?

Formal Binary String Regular Expression (each pair of 00 must have 11 before it)

I’m trying to construct a formal regex for the language of binary strings in which every 00 must have at least two 1s before it.

I realize this can be done informally with lookbehinds using the following: ^(?:(?<=11)00(?!0)|(?<=1)0|1+)+$ , however I am now trying to construct this formally, without them.

I currently have (0|)(11*0)*1* (or informally (0+ε)(11*0)*1* – I believe these both describe the language mentioned) which gives me the language of binary strings without consecutive 0s, but am not quite sure how to get the ‘conditional’ part in without actually using a conditional.

Accepted:

0

1

10

11100

1100

Rejected:

100

1000

11000

graph theory – Increasing the Hadwiger number by making any pair of non-adjacent points adjacent

Let $G=(V,E)$ be a finite, simple, undirected graph. The Hadwiger number $eta(G)$ of $G$ is defined to be the largest positive integer $ninmathbb{N}$ such that the complete graph $K_n$ is a minor of $G$.

We say that a graph is vertex-critical if removing any vertex reduces the chromatic number.

Question. What is an example of a connected, non-complete vertex-critical graph $G=(V,E)$ with the following property?

Adding any edge increases the Hadwiger number — or more formally: for $vneq w in V$ with ${v,w}notin E$ we get $$etabig((V,Ecupbig{{v,w}big})big) > etabig((V,E)big).$$

Motivation. Any minimal counterexample to Hadwiger’s conjecture has the properties given in the question.

How can I pair my Godox AD200 with my two Godox TT685s speed lights using a X2Ts godox trigger?

I did my research and found out in order to get my TT685 flashes to work with my trigger I had to not only set the channel and group but also set them on an “ID” located in the menus.

They both worked fine, and I could fire both speed-lights.

Here is my problem. I went now to my Godox AD200 and there is no menu where I can change the “ID” and the only way I could fire all 3 lights (two tt685 speed-lights and AD200) is if i put my AD200 on slave mode. I really would like to trigger all 3 lights through the remote.

how can i pair my Godox AD200 with my two Godox TT685s (speed lights) using a X2Ts godox trigger?

I did my research and found out in order to get my TT685 flashes to work with my trigger I had to not only set the channel and group but also set them on an “ID” located in the menus. They both worked fine, and I could fire both speed-lights. Here is my problem. I went now to my Godox AD200 and there is no menu where I can change the “ID” and the only way I could fire all 3 lights (two tt685 speed-lights and AD200)is if i were to put my AD200 on slave mode. i really would like to trigger all 3 lights through the remote.

please ans thanks

Is there a pair of tuples N, M of prime numbers which (a) have the same product, and (b) whose partial products have the same sum?

If N is a finite list of numbers, let $p(N)$ be the product of the numbers in N, that is, $$p(N)=Pi_{i=1}^{|N|}N_i$$ and let $s(N)$ be the sum of the partial products of the numbers in N, that is $$s(N)=Sigma_{k=1}^{|N|}left(Pi_{i=1}^kN_iright)$$

Is there a pair of lists $Nneq M$ for which $p(N)=p(M)$ and $s(N)=s(M)$?

What if they only contain odd numbers 3 or higher?

What if $N$ and $M$ only contain prime numbers? Only odd primes?

What if they only contain elements of ${3,7,19}$? (This is the case I’m most interested in)

It seems possible that there’s no such (distinct) $N$ and $M$ for the last case, but I’ve no idea how to prove that.