This talk is about constructions of statistical zero-knowledge. This is joint work with Benoit, Alain, and Hotec. The focus of this work is on non-interactive zero-knowledge, or NISIX. In a NISIX proof system, a prover tries to convince the verifier that some MP statement X is indeed contained in the language. NISIX just satisfy three main properties, the first of which is completeness, which essentially says that the honest prover should be able to convince the honest verifier of a true statement. Then we have soundness, which says that no prover should be able to convince the verifier of a false statement, except perhaps with small, possibly negligible, probability. Here we can consider two possible notions, computational soundness, where this property only needs to hold for computationally bounded provers, in which case we have an argument system, or statistical soundness, where soundness should hold even against computationally unbounded provers, in which case we have a proof system. The third property of a NISIX is zero-knowledge, which intuitively says that no verifier should be able to learn anything more about the statement being proved other than the fact that the statement is true. Once more, we can consider two possible notions, a computational variant, where zero-knowledge only holds against computationally bounded verifiers, and a statistical variant, where zero-knowledge should hold even against computationally unbounded verifiers. In all of this work, we are going to focus in the common reference string model, where first there is a trusted setup algorithm that generates a common reference string that is known to both the prover and the verifier. In addition, we will oftentimes consider a relaxation of this model, called the designated verifier model, where in addition to the CRS, the verifier also has access to a secret verification key that is not known to the prover. For now, we will assume that the secret verification key is also sampled by the setup algorithm. Once this one-time setup is complete, the prover can then noninteractively prove arbitrary statements of its choosing to the verifier. And if we are in the designated verifier model, we require that the verification key should be reusable, namely, the verifier should be able to use the same key to verify arbitrarily many proofs from the prover, and soundness should hold even if the prover has oracle access to the verification function. Noninteractive zero-knowledge has received extensive study, and today we know of many constructions from a wide range of assumptions. Publicly verifiable physics in the CRS model are known, for example, from assumptions like factoring, from pairing-based assumptions, from lattice-based assumptions, as well as from indistinguishability obfuscation. So all of these constructions provide statistical soundness, others provide statistical zero-knowledge. Notably, the constructions of Grosso-Straussky-Sahai based on pairings, as well as the Piker-Seachian assumption construction based on the athleticists, provide what's called a dual-mode property, where there are essentially two ways of constructing the common reference string, one of which gives statistical soundness, the other gives statistical zero-knowledge. Moreover, if we could further consider the relaxation to the designated verifier model, we have more constructions from even weaker assumptions, for instance, from the computational Diffie-Hellman assumption over a pairing-free group, from the learning parity with noise assumption, and more. However, if we restrict our focus and only consider those constructions that provide statistical zero-knowledge, far less is known. In a publicly verifiable setting, we have constructions from pairings, NLWE, while in a designated verifier setting, the only construction we have, other than the ones in the publicly verifiable setting is from the Decisional Composite Residuosity Assumption. So in this work, our focus is on developing new techniques and new approaches for realizing statistical zero-knowledge. From an application's perspective, whenever zero-knowledge is used to realize some type of privacy, statistical zero-knowledge provides an everlasting notion of privacy, where zero-knowledge will hold not only for the duration of the online protocol where the proof system is conveyed, but also for all time thereafter. This is a very appealing notion for many privacy-preserving applications. So in this work, we provide a new way of compiling noninteractive zero-knowledge in something called the hidden bits model, which I will introduce shortly, to realize new constructions of statistical designated verifier musics. In particular, we give the first constructions of statistical designated verifier musics from the DDH assumption in a pairing free group, as well as from the quadratic residuosity assumption. We also recover an instantiation from the Decisional Composite Residuosity Assumption. And more precisely though, our constructions actually provide a dual-mode property, namely, they can be instantiated to either provide statistical zero-knowledge and computational soundness, or they can be instantiated to provide computational zero-knowledge and statistical soundness. As I will also describe later on, these notions also satisfy a concept called malicious security, where security holds or zero-knowledge holds, even if the verifier samples its verification key in a malicious manner. Moreover, we show how to construct a statistical music from a pairing-based assumption in a publicly verifiable setting. Notably, our construction can be based on a weaker assumption compared to the previous constructions of statistical musics by Gross, Ostrowski, and Sahay. Our construction only requires a computational assumption in one of the base groups and a search assumption in the other, while the previous construction by Gross, Ostrowski, Sahay relied on a computational assumption in both of the underlying groups. So with this, we provide, our work provides new constructions of statistical musics from qualitatively weaker assumptions in a publicly verifiable setting, as well as new constructions in the designated verifier settings. So now, I will give a brief overview of our main constructions. The starting point of all of our constructions is a non-interactive zero-knowledge proof in what's called an idealized model called the hidden bits model introduced in the work of Fayyay Labhidat and Shamir. In this model, we assume that the prover has access to a uniform random bit string of length n. And given this uniform random bit string, the prover can now do the following. It can choose a subset of the bits and produce a proof pi. Both the subset as well as the proof pi is then given to the verifier. Moreover, the verifier is additionally given the values of the bits in the subset chosen by the prover. The remaining bits that are not chosen by the prover are completely hidden, hence the name hidden bit string. The verifier sees the subset of bits as well as the proof pi and now needs to decide whether to accept or reject. The work of Fayyay Labhidat and Shamir show that there exists an unconditional construction of a perfect Nizhik proof for any general MP language in this particular model. However, this is an idealized model and does not translate to something that we consider cryptographically like the CRS model. So the second ingredient is a compiler that takes any Nizhik in this hidden bits model and compiles it into one in the CRS model. The cryptographic compiler roughly proceeds as follows. First, we have a comment reference string and this comment reference string, in addition to a commitment chosen by the prover, will be used to define a hidden bit string. In addition, the prover can subsequently open the commitment to bits of its choosing and reveal them to the verifier, thus mimicking the operation in the hidden bits model. We require several properties from this type of commitment scheme. First, we require that the commitment be binding, namely once the prover has chosen its commitment, it can only open up the hidden bit string to a single value in each of the positions. Next, we require hiding, which says that after the prover chooses to open up a few bits of the hidden bit string, the verifier should not learn anything about the unopened bits. And finally, we require a succinctness property, which essentially says for simplicity that the length of the commitment should be much, much smaller than the length of the hidden bit string. So once we have these three properties from this type of commitment scheme, it is now fairly straightforward to argue security of a NISIC in the CRS model. Namely, soundness will be reduced to the binding and succinctness properties and roughly proceeds as follows. If the commitment is very short, and moreover, the NISIC is statistically sound in a hidden bits model, then there cannot be that many hidden bit strings that is able to fool the verifier. And if the commitment is much, much shorter than the length of the hidden bit string, then essentially by a union bound argument, we can argue that the prover will not be able to find a bad commitment that corresponds to a hidden bit string that is able to fool the verifier and soundness then follows. Zero knowledge then follows from the fact that if the commitment is hiding, all of the unopened bits are still hidden from the perspective of the verifier. And so we have effectively simulated the view of the verifier in the idealized hidden bits model. So in the work of Feige-Lapidat and Shamir, they show how to instantiate this type of commitment scheme and this type of transformation through trapdoor permutations, thus yielding the first construction of a computational NISIC proof from the factoring assumption. Subsequently, the work of Canetti-Hellevian cats show how to realize the same compiler starting from the CDH assumption over a pairing group, again giving us a construction of a computational NISIC proof. And finally, very recently in Eurocrypto last year, a sequence of independent works shows how to do something very similar by starting from the CDH assumption in a pairing-free group. Here, they work in a designated verifier setting and obtain computational designated verifier NISIC proofs from the standard CDH assumption without relying on pairings. One thing that to note about all of these existing instantiations of the FLS compiler and the FLS framework is that they only provide computational zero knowledge and for reasons I will describe shortly. A natural question to ask is whether it might be possible to use this same type of compiler but to obtain statistical zero knowledge. This is what we achieve in this work. In fact, we show a way to realize this compiler in a dual-mode fashion. In particular, there are two ways that we can sample this common reference string. In one mode called the binding mode, the common reference string will be able to induce a hidden bits model where we achieve computational zero knowledge and statistical soundness. Alternatively, if we switch to a different mode or a different way of constructing this or sampling the common reference string, we get what's called the hiding mode where the resulting construction actually provides statistical zero knowledge and computational soundness. To highlight how this construction works, let's begin by recalling the construction or the instantiation from the computational Diffie-Hellman assumption. Here, we're going to work in a primordial group with generator G. The common reference string in this case is going to consist of the generator G together with n random group elements whose secret exponents are w1 up to wn. These n random group elements will be used to define the hidden bit string. So in particular, every possible choice of exponent y in the underlying field will define a different hidden bit string where the i-th bit in the corresponding hidden bit string is exactly h of hi raised to the y power. And here, the bit will be defined by computing a hardcore function of hi to the y. This will be a hardcore for the CDH function. So what does a commitment look like? Well, the prover is essentially just going to compute g to the y. This will uniquely define a sequence of hidden bits because the value g to the y information theoretically determines the exponent y and the exponent y completely determines the sequence of bits b1 up to bn given the components in the common reference string. In order to open up a commitment, the prover will provide hi to the y. So the term that will be used to derive the hidden bit. So now what remains to show is that the prover used a common exponent y here to construct both the commitment as well as its opening. This is exactly proving that this two pole here, this gg to the y, which is the commitment, this hi, which is the base for the i's bit and hi to the y, the opening, actually constitutes a ddh tuple. There are several ways of proving that a particular two pole is a valid ddh two pole. One way is to use a pairing. This is the approach taken by Canetti-Hellevian cuts, which gives a publicly verifiable construction. And in the Eurocrypt papers from last year, they used a Kramer-Schrupp hash proof system to prove that this two pole is indeed a ddh two pole and this gives a designated verifier instantiation. Moreover, this construction is statistically binding. To see this, notice that the choice of the commitment here, g to the y, completely determines y and therefore the entire sequence of hidden bits. And as a result, the resulting non-interactive zero-knowledge proof that we obtain also satisfies statistical soundness. On the other hand, if we consider zero knowledge, we notice that because we rely on a hardcore bit, then the unopened bits will be computationally hidden from any efficient verifier, assuming the hardness of the cdh assumption. So here is this is where we need to make a computational assumption to argue that the unopened bits are hidden. As a result, we only achieve computational zero-knowledge. The question is whether we can replace this final component here to achieve statistical zero-knowledge. So the key idea in our work is instead of using scalars in that common reference string, and so we're going to replace them with vectors. So just as a notation, whenever we have a vector v, I will write the bracket v to denote a vector of group elements where each group element is performed by taking g raised to the corresponding component of the vector. So in our construction, the common reference string will consist of a collection of encoded vectors where vectors have dimension m plus one. Here we're going to start by sampling a random vector v, and the encoding of v here is going to play the role of the generator g in the basic construction from cdh. Then we have a collection of encoded vectors w1 up to wn, and this will play the role of the hs, the g to the wi to g to the wn before. So now the question is, how do we sample these w's? We're going to define two distributions from which we can sample these w's. The first distribution, which we will call the binding distribution for the binding mode, we're going to sample w to be a scalar multiple of v. Alternatively, we can also instead sample the w's uniformly and random from the full space. This will be used to define what we call the hiding mode. So another way that you can think about it is in the binding mode, all of the vectors v, w1 up to wn are linearly dependent. They span a subspace of rank one, which is exactly the space span by the vector v. While in hiding mode, since we are sampling all of these vectors uniformly at random and independently of each other with overwhelming probability over their randomness, the collection of vectors in the CRS actually are full rank. The key first observation that we will make is that assuming the ddh assumption hold, these two distributions, when we encode the w's in the exponents, are actually computationally indistinguishable. Under ddh, it is hard to distinguish a rank one matrix in the exponent from a full rank matrix in the exponent. That is exactly what we have here. And if you're familiar with constructions of lossy public key encryption and related primitives, this is conceptually very, very similar. So now, much like in the original CDH construction, we have to have a way for the CRS to induce a particular hidden bit string. Here, every vector y in zp to dn plus one will define a hidden bit string. So before it was just every exponent y, here, we're going to consider the vector generalization. How does it define a hidden bit string? We're going to take the corresponding component in the CRS, in this case, wi, compute the inner product between the vector y and w sub i, and hash it. Here, we require a universal hash. So recall that before, we were using a hard core function for ddh. Now, we're using a universal hash function. How does the prover commit to a particular hidden bit string? Well, the commitment is not going to be g to the y. So the g to the y is going to be very long. That does not provide succinctness. Instead, what the prover is going to do is the prover is going to compute the inner product between y and its vector v. So the commitment is, again, a single group element which is independent of the length of the overall hidden bit string. This is important for succinctness. Now, let's consider the main properties we care about, binding and hiding. So first, the binding property holds because if we sample the w i's in the binding mode, namely the w i is a scalar multiple of the vector v, notice that the value of y transpose times v, namely the prover's commitment, fully defines the value of the hidden bit.  But y transpose times v is precisely the commitment. And so, once we have chosen y, we have completely defined the value of y transpose times w i and, thus, the value of the hidden bit. So this is why this particular construction provides statistical binding. Conversely, suppose instead that we had sampled the CRS in the hiding mode. In this case, the claim is that the value of y transpose w i is perfectly hidden or statistically hidden, even given the commitment as well as the openings to any other bit. And this again follows now by a linear independence argument. Namely, in the hiding mode, if all of the w's are uniformly random, then with overwhelming probability, all of these vectors in the CRS forms a full-rank collection of vectors. If we learn y transpose times any of these vectors, it does not reveal any information about y transpose times any of the other vectors just by the linear independence. So if we sample the w i's now in hiding mode, the values of the unopened bits are statistically hidden. So in particular, what this means is that if we now go through the standard FLS compiler with these two modes of sampling the CRS, if we use a binding mode, we get a sequence of hidden bits that are statistically binding. This provides statistical soundness for the resulting music. If instead we started with a sequence of vectors sampled in the hiding mode, we get a set of hidden bits that are statistically hidden from the perspective of the verifier and this provides us statistical zero knowledge. So the remaining ingredient that we need is a way for the prover to open up the commitments to each of these hidden bits. We can do something very similar to what was done in the CDH instantiation. The prover is going to first send the input to the universal hash that will allow the verifier to compute the corresponding hidden bit. And moreover, the prover needs to argue that it actually used something consistent to construct both the commitment as well as the opening, namely the same vector y was used in the both cases. This is an analog approving that something is a DDH tuple. We want to prove that the same vector was shared across two different quantities. This again, we can use the Kramer-Schup techniques to produce a designated verifier proof system to instantiate this. So with these constructions, we have now a fully specified construction where we have two different modes of generating a CRS. We have a way for the prover to commit to a particular choice of hidden bit string and a way for the prover to open up a hidden bit string to a particular value. To conclude then, by instantiating the hidden bit string in these two different modes, we essentially obtain a dual mode designated verifier music from the DDH assumption. In one mode, the binding mode, we get computational music proofs. In the hiding mode, we get statistical music arguments all in a designated verifier setting. There are several ways that we can extend this. So for instance, we can replace DDH with the general K-Lin family of assumptions for any K greater than or equal to one. So just recall, DDH is equivalent or the same as the one-lin assumptions. We can also replace the DDH assumption with subgroup indistinguishability type assumptions. This gives us dual mode designated verifier music starting from quadratic residuosity or the decisional composite residuosity assumptions. And we can also use a pairing to publicly implement this verification algorithm, much like the work of Kennedy, Hallevi and Katz. This allows us to obtain a statistical music argument, unfortunately, due to technical and algebraic details of the construction. This does not give us a full dual mode construction. So it does not give us the full expressivity of the construction of Grosso-Straussky-Sahai. But because we can now base hardness on a weaker assumption, this K-Colonel linear assumption in one of the subgroups, this gives an assumption that is qualitatively weaker than those previously used to construct statistical music in the publicly verifiable CRS model. So the one final extension that I want to mention is how we go from the standard designated verifier setting to what's called a malicious designated verifier setting introduced in the work of Quash-Ross Blumen Weeks. In this setting, there is only a single trusted setup that samples a common random string. Thereafter, any of the verifiers can come along and construct their own verification key. So in the previous, in the simple designated verifier model that I introduced at the beginning of this talk, we assume that a trusted setup also sampled the verification key. Here, we only require a common random string as the trusted setup. The verifiers can choose their verification key arbitrarily. And zero knowledge should hold in this model, even if the verification key is chosen maliciously. It turns out that all of our designated verifier music constructions are easily adapted to satisfy this notion of malicious security. In some cases, we actually have to replace the common random string with a structured string, but still the verifiers can later come along and sample their verification key independent of the trusted party. The techniques that we use is very similar to those used in Quash-Ross Blumen Weeks, but we can actually rely on a simpler information theoretic argument based on the near independence rather than a more complex rewinding argument. As a result, we are able to realize dual mode malicious designated verifier musics from the DDH assumption or more generally the K-Lin assumption, as well as from the subgroup indistinguishability assumptions like QR and DCR. This is in contrast to previous works which relied on the complex and rewinding argument and an interactive one more CDH assumption. So by generalizing everything to vectors and looking at the linear algebraic properties, we can actually get constructions from weaker assumptions and that are simpler to analyze. So just to summarize, in this work, we provide another way of leveraging the FLS compiler to for the first time realize statistical zero knowledge. And this has now yielded many new constructions. For instance, in the designated verifier setting, we can realize dual mode malicious secure designated verifier musics from the K-Lin assumption and pairing three groups, also from the QR and DCR assumptions. Even in a publicly verifiable setting, we can obtain a new pairing based construction from a qualitatively weaker assumption than those previously needed to achieve statistical zero knowledge. And now I'll conclude with a couple open questions. One open question is that throughout all of these constructions, we still do not know how to construct statistical zero knowledge from the factoring assumption. We know that FLS gives us computational music proofs from factoring and our work gives us constructions in the designated verifier model from factoring like assumptions like QR or DCR. But it is completely open how to realize statistical zero knowledge just from factoring. Another interesting open direction is to consider other assumptions and whether they might also be able to give us some notion of statistical zero knowledge. For instance, can we realize something from the learning parity with noise assumption, from the CDH assumption or other assumptions not currently known to provide statistical zero knowledge? I should note that both of these LPN and the CDH assumptions are known to provide computational zero knowledge in a designated verifier setting but not known to provide statistical zero knowledge. And with that, I'll conclude. Thank you for your attention.


So this mission is called Falcon Defender. It's a concept that was originally thought up about five years ago. We have implemented it for the second year in a row in Bulgaria with our state partnership program. We're trying to take things that we've learned and things we've been successful with and pass them on to the Bulgarian Air Forces. We really seem to love their initiative. They want to learn and that makes us eager to want to teach. The partners really have been official to both sides, both the United States and to Bulgaria, building additional alliances around the world in case we're needed and called upon. It's really the integration piece that the U.S. brings to that. It has been truly amazing to watch one of their culminating events today shoot, communicate, exercise as well as the TCCC, self-made buddy care, what a capstone exercise for those airmen. As an integrated force, U.S. and Bulgarian force.


What is up everybody Jason here for jazby's case race calm We just sold out this spectra random number block here that helps sell it out guys For Pikachu number one this features the Texans the bills the Eagles the bangles the Cowboys Raiders Broncos Jaguars Commanders You get a piece of these teams via the serial number guys and again guys I'll we're getting away two free spots if it sold out tonight, which it did so we'll be doing that as well guys So the randomizer here will be for the free spots will give away two Pacing the two names and we'll randomize the names and the numbers and see what you guys match up with I remember any number of dimensions go to spot zero and of course if there's any non numbered cars Which there is a chance there will be you'll either be randomized in one lot or Randomized separately to you guys back in the R&B. So you'll still get a one in ten shot at them So here we go, let's roll it and we got a five and a four nine times Five four nine one two three four five six seven eight nine Boom nine times five four nine John and Douglas free spots for both of you guys Let me go five and a four nine times one Two three four five six seven eight John Deniz act we're gonna go nine times here one two three four five six seven eight nine nine times nine nine One down to two so John you have the spot one there and Then of course Douglas with spot nine John with five Douglas with three Michael zero with any in all redemptions John with eight four and seven Douglas with six and then Zach with two. So there you go guys So now coming up next guys in a separate video is going to be the break Good luck guys. Hopefully it's a big monster case


One thing that really needs to be emphasised at university is that time flies and you've only got three years here, so you may as well make the most of it. You see a club you like, join it. If you see an event that looks interesting to you, you've got to participate in it. Back in first year I was wondering, should I join this medical and health sciences orchestra? I was worried about the workload back at that time, but I joined it anyway. And now three years later I've made a whole family of new lifelong friends. I've helped raise thousands of dollars for charity and I've been part of its amazing legacy. And that to me is just an ultimate privilege.


What's going on everyone? This is Jasper'scasebrakes.com. Doing a little mixer, doing a little filler here for our NBA finals mixer. This is NBA Mosaic random team number 46, one hobby pack. We are giving away six spots into this break right now. So here's our dice and here are our players, our 24 names from Justin down to Michael. Top six spots, so one to six will get the last six spots into this break. We'll take those 30 names, randomize it to our fresh list right here, get to breaking and then give away six finals mixer spots all the way at the very end. So we'll get to it but thanks again everyone. These 24 right here, Justin all the way down to Michael. We will roll our dice right now. For just this first roll, this first randomizer, four and two is six. Top six spots here, we'll get six free spots into this mixer, this filler. So one, two, three, four, five, four and two is six. Our last one, six times. So Michael on the outside looking in down to Justin, but our top six, so six, Grant, five. Michael, I'll dig it in there, congrats Michael. Justin at four, Justin at three. Michael with the last spot mojo gets in at two and the top spot Justin. So Justin with three spots Michael, our and Michael L with Grant getting in. So congrats y'all. Appreciate you getting in here. So we'll put these right here. Now that we have our 30 players, we have a fresh dice, a fresh list. So do double right here. Of course we put these mixer spots. So these are our players now from one to 30 and our teams from the Hawks down to the Wizards and a fresh dice roll for that. So good luck to you all 30 now. Five and a four is nine. Nine times. One, two, three, four, five, six, seven, eight and our last one nine. Down here. So Michael L down to Michael L. Grand opening, grand closing. So we take this towards the sheet. Go. And then for our teams, nine times again. One, two, three, four, five, six, seven, eight and number nine. So the pelicans and thunder. There we go. That's much better. So let's do this in order. Michael R with the Hawks, Mike T with the Celtics, Michael L with the Nets, Mike T with the Hornets, Justin with the Bulls and Cavs, Nika with the Mavs, Grant with the Nuttets. For the mixer. And just print it. Print it and rip it. Let's get it. I forget that people can just do that, you know? Just pause it, watch it. Yeah, it's different from Instagram where they can't. So I'm just going to be a little more quick. There we go. Our players and our teams. So thanks to everyone who bought a spot straight up and then the six spots given away. Congrats to y'all. Good luck. We'll do one more randomizer at the end to give away six spots straight up into our mixer. Here's our pack. Good work. Here's some Nurkitsch. And straight fire Devin Booker. But there's our pack. But let's get to the fun stuff. So we'll grab all 30 names one more time. Our fresh dice and our fresh list. So top six spots once again. We'll get six finals mixer spots. Our two dice. A six and a one seven times. Good luck everyone. One, two, three, four, five, six, and our last one seven. Six and one. There it is. So top six spots. So seven to 30. Thank you for getting into this break. Some not so happy times for Mike down to Mike Tina Michael L. But we will see. Good luck. Grant gets in. Grant back to back gets in. Justin B with a giveaway spot. Corey. Nice Corey congrats. Sean A and Mike T. So Mike on the outside looking in sad puppy dog eyes but we'll get into that final mixer spot. Nice. Congrats you six. Thanks again for coming into this break with any giveaways or any spot spot straight up but we'll be back soon. Pack number 47 should be on the site right now. We get those packs done.  Give away some break credit. jaspyscasebreaks.com


Hey everybody, this is Gartner IT Symposium in Orlando, Florida, Disneyland. ClickUp is here exhibiting, we're also presenting. Come check us out at booth 1011.  So if you're in Florida, come to this conference. If you're in IT, Project Management, you're a CIO. You manage anything to do with large infrastructure processes, you need to be at this conference and come check out, click up at booth 1011.


Hey, what's up guys? Welcome to our trending reviews. So with everyone doing a lot of remote working nowadays given the current climate, a lot of people are taking business meetings in their offices at home. So I've received this new product today. It's the Anker PowerConf Bluetooth and USB speakerphone. So if you hold a lot of business meetings, you want to have the best quality calls, especially if there's a group of you and you want to gather around and take meetings remotely, then this is a perfect device for you. So today, I'm going to give you an unboxing of the features that come with this and show you a little bit about the design, cover a bit of the specs and give you an audio review of how this sounds as well. Now the one thing I really like about this is that it's USB-C and it's got a very long, huge battery life and it's got a massive 24 hours of talk time. I've used a lot of speakerphones in the past specifically like the Jabra ones and they have about 10 to 15 hours of talk time but this one lasts very long. It charges very quick and it's just got some really cool, simple, straightforward capabilities with excellent audio quality. But the one thing I really like about it is that it's very slim. It's easy to take with you anywhere and it's perfect for remote working. So I'm going to cover everything you need to know about this. So let's just get straight into it. Alright guys, so let's have a look. So this is the box that it comes with. A quick highlight of all of the main different specifications on this. Now it comes with six different mics for superior voice pickups. So that gives you a 360 degree voice coverage. Now it does have a 5 meter range but that is way more than enough and if you're in a small meeting room or a board room that's plenty of range. Now it comes with a DSP ambient noise reduction as well. So that gives you very clear audio coming through and it has smart voice enhancement technology as well. Now what this means is that it gives you real-time echo cancellation of up to 70 decibels and it reduces the background noise of up to 20 decibels as well. Now as I mentioned it gives you 24 hours of talk time which is amazing. It gives you an indicator light which I'll show you when I turn it on and you can also connect it to your computer or your phone as well through bluetooth or by the provided USB cable and it's very lightweight and compact. So let's go ahead and open this up. There you go, a very nice design there. Now look how slim this is. A lot of these speaker phones are quite bulky and this one is just so lightweight it's easy to carry. Before I open that let's just see what else is in there. You've got a little thank you guide there. You also have a user guide and some instruction manuals there. So a user manual just to get up and running in multiple different languages. Just put that there. You also have the box which will have the USB cable in it. So here as you can see this is the USB-C cable and you can also charge this using your USB port on your computer. If you have a separate USB-C charger maybe for your laptop then you can also use that to charge the actual device. Got a nice carry case there. Let's take a look inside. There we have a look at the design. Nothing else in the case so I'll just leave that on the side. Now take a look at how slim this is. You've got nice rubber grip there as well to keep it solid on the desk. Then you also have a few buttons here. You have the answer the phone call button. You have the microphone mute and unmute button. The plus and minus are the volume controls and you also have a play button as well. Now you have this nice microphone design there around there so you have a 360 degree field of audio coming through. On this end you have a few ports. So you've got the traditional USB port there. You have the auxiliary out if you wanted to connect this maybe to a TV or a monitor and play back the audio from a external device. And you also have the USB-C power port there to charge the device. On the front side you have two buttons. You have the Bluetooth button there to pair it and obviously the power button to turn the device on. So let me go ahead and turn this on. You just hold it down. There you have the indication. You've got some lights there on the front. Now you have this blue indicator light there. It's flashing to show that it's now pairing so you can search for a device. So I have my MacBook and I'll be connecting it with this. Let me just bring that in. So it shows up as anchor power conf and it is now connected. So before I make a phone call I just want to give you an idea of playing some music from my laptop on this device just to show you how loud it can get and actually how clear the audio is. So I have a song loaded here. So let me go ahead and play this. You also have the volume buttons. This is the max. Now the touch sensitivity on these buttons are actually quite nice as well. I don't feel like I have to try a couple of times to get it to react and respond. So that's really cool there. Now the volume is actually pretty loud and I really like the punch in the audio there. It's not very high-pitched and it doesn't have a lot of background noise or anything like that. It's just crystal clear. So I can actually play and pause using the play button here as well. So I have the song loaded on my laptop and if I just press the play button it should pause it. There you go. About a second delay there to pause the music. So if I go back and play it. Pretty convenient. It's very easy to do. So I think that is a very big win. Now what I'm going to do is use it for the main purpose which is making phone calls. So I'm going to go ahead and make a phone call using my phone. So before I do that I'm just going to connect the Bluetooth to my phone first. Okay so let me go ahead and call one of my friends using my phone and get their opinion. Hello. Hey can you hear me? Hi if I can hear you. How is my audio coming up? Yeah it's quite clear actually. Yeah so I'm just calling you just because I got this new speaker phone and I was just testing the audio on this as well to see if it's quite clear as if I'm still using my phone. So what do you reckon? Yeah it seems like you're using your actual phone to be honest. Okay I'm just going to adjust the volume check to see if it makes a difference. So what are you up to today? Nothing much to doing bit of shopping. Okay cool. I'm just going to test one button if you give me a second. Sure. Now I've just hit the mute button there so as you can see this is just lit up red and it's they can't hear me on the other end of the call. Now if I continue I just want to test one thing I'm going to step back about two meters and if you can let me know if you can still hear me that'd be great all right. Okay. Okay I'm about two meters away can you still hear me quite clearly? Yeah I can hear you quite clearly it's only slightly quieter but still very clear. Okay and there's no like distortion or echo that you can hear in the background? No it seems very clear. Okay cool because I can hear some cars out of the window but can you hear that as well? No I can only hear your voice. Okay cool that's pretty clear then let me just come back here and I will try to hang up using the speakerphone as well so if that works then I'll speak to you later. Okay have a nice day. Okay and there we go guys so as you saw pretty cool clear audio quality there and I moved around a little bit further back and it was still crystal clear to my friend there on the phone so for me this is the perfect device to take for meetings with you even if you wanted to go to the park and have a meeting outdoors given the current climate then I think you would get a very good job done there as well making some very crystal clear phone calls and reducing a lot of the background ambient noise there as well so for me that is a big win. Alright so thanks for watching guys I hope that was useful for you if there's any questions you have about this speakerphone then do drop a comment below otherwise I'll leave a link on where you can purchase this on Amazon it does come under just under 130 dollars but for that price and the capabilities that you get it's probably one of the best speakerphones I have and it's in the 21st century now a lot of them don't use USB-C to charge so this one is perfect for that and if there's anything else you'd like to know then let me know otherwise I hope you subscribe I hope you like this video and I'll catch you guys at the next one take care


He lying jay lying. Oh my god. They didn't work down the quiz. I worked down the kitchen He didn't work. Hold on So let me ask you a question. So walo had digging nuggets, too Now for me, I didn't eat. I'm pescatarian. I didn't eat chicken. So wasn't me


Yeah, I'm not in love with Ray Lewis, really.  Ray Lewis. Woo-hoo-hoo! Oh, a spec catch? Never mind. I never doubted you. And a little stop-and-go. And a journal. I never doubted him. I never doubted him. And Debbie is your maddened boy. What is up with these guys?  Thank you, Murray. I shade it. I pass-committed, pass-committed, pass-committed. Beautiful, man. Dog, this dude is a beast. I'mma be honest, can't even say nothing bad about him. Like, Murray is actually a monster. He's a monster. You know who I don't think is that good? You know who I don't think is that good? Ray Lewis. Is that who Skimbo talking about, Ray Lewis? Dog, yeah. I don't think he's good at all. I don't know why.    Yeah, I don't like- I don't think Ray Lewis- I really don't think Ray Lewis is that. He's zero AP. I just feel like it's tough to get rid of. I just like- Cause I feel like it now allows me to like- Like it allows me to put another lurk artist in that position. It's just like, it's so- it's tough. So I gotta sell my two limiteds. I gotta sell my two limiteds tonight, boys. Ray's going up in price. I listen to what my man Ed says. I'll be honest, I don't like Ray Lewis like that. I love this dude Murray, though. I was making plays with Murray, and I watched back my games in the tournament, boys.  That dude was everywhere.  Yeah, I'm not in love with Ray Lewis, really.  Ray Lewis. Woo-hoo-hoo! Oh, ain't spec catch? Never mind. I never doubted you. And a little stop-and-go. And a journal. I never doubted him. I never doubted him. I mean, am I just putting curse there? I should just put curse there. Yo, he's not wrong, bro. Ray might go up crazy. I mean, he's two million coins. But you don't need any 10 cards. But by the time... Listen, by the time the tournament happens, the next one, there won't even be 10 cards out. 2-2-2, like, it won't be 10. Like, you know what I'm saying? Damn, the boys benched Ray Lewis already. It's nuts. Flip! No, Flip is a good player.  Bro, he's so...   Michael Vick? Oh, my God, dude. Dude, that ability is actually godly though. It really is.  Toughness.   I used it. Oh, that's why I used Michael Vick so long at last year because of playmaker. Whatever. See, I'm not quick, bro. This is not any game, boys. Alert, alert, alert, alert, alert.  I just... I just dropped the perfect pass. Oh, I did a devote spin. Does it really have to shine, Jax? I haven't even noticed. Should I have noticed that? Like, I haven't even noticed that. Is that bad, Madden, if I'm not noticing that? I don't know. This just shows you how much I never look... When their user go this way, my eyes go the other way. That's my whole... That's my whole plan on offense. There is zero chance of me looking at their user. Oh, I see where it goes. I look the other way. I really like alert artists at my linebacker here. I'm actually in love with it. Oh, I shouldn't have hit him, dude. Dubby.    Oh, he did a devote spin. Let's go, good swat, Dubby. Thanks, Chad. I appreciate you guys, bro. It's just real clicks right there. That's just real clicks. Not a lot of people got that, but you know. Sometimes not so much, sometimes a lot.  The Duke. What a play. What a play by the Duke. I mean, now I'm about to take him out. I'm really about to take him out because of that.   Freeform is going back on one. Low-key bail. Yeah, Harlow, it's definitely low-key bail. Honestly, you're the reason we show up every day. Low-key bail. Goddamn, dude. Fuck. Dog, I'm just like never putting... Someone give me a reason why I have a cloud flat ever on my field like ever. I'll tell you one thing, I want someone back because I feel like I'm getting zero pressure on people. I don't know how you guys feel, but... I feel like my pressure is non-existent today. Dubby, like, God.  Come on, man.     Goddamn it, I should have kicked my field while making 17-nothing.  Oh, my God. I could have went crib. Oh, my God. Like, let that ball go through, please. The real life. Married with children. The real... I am the Al Bundy of Madden. Am I not the Al Bundy of Madden? I think that's me, dude.  Now, the bunch just didn't work. We're done with the bunch.  Right, boys? Look, here it comes.    Because, you know, that's what people do.  Like, am I the only person that can't do the fucking...  I can't scissor.   Swear to God.   All right.   Let me do it. Can we, like, block a soul a little bit here? Just a little bit of blocking.  Freeform really about to go back on one.  Jesus Christ.  Wow. It's just that... Oh, like... Fuck, man. Like, really? Man, it always dies when 99 come out.  I was close.  Dude, this dude Branch...  Is it really Branch?   Oh, my God. Ha-ha! That caught her out. Branch, dude. Like, be better, dude. Just be better. Just be better. That was a dot.  All over it. Like, we're all over it. Like, we're literally all over these players. All over them. Come on. Tillman makes that tackle, Branch.   You get to juke off and get a first down on it. Dog, this is why you get third and 20. You cannot play Cloudflats ever.  You just can't do it.  Dude, press your boys. Ready?    Oh, my God, dude. Oh. And the hook curl for the win.     I don't know if Tillman does that. I don't know if he does that. Look at me. Like, I just am so unlucky. We got the running back manned up, but don't I clip him right there? I just clip this guy. Both of them dudes were open. That was a good game though.


Hello, good afternoon. Welcome to the talk titled get in 10 minutes alternative title was mission impossible as you've already seen But let's try so I want to start by saying that for me personally the concept of version control is just amazing It is very simple. You make some changes. You store them. You make some more changes. You store them You make some more changes. You store them. It's really that simple But it opens a whole new world of possibilities like for example the WordPress project itself It just couldn't exist without version control tools that enable developers to collaborate on this project another great example is Wikipedia Like if you have a good way to compare revisions and undo stupid stuff You can open this encyclopedia to the entire world and create something very new from what used to be Available in the past so really simple concept very great consequences So let's look an example from WordPress itself This is actually the first time commits ever created for WordPress tracked by subversion So it's been over 14 years ago that guys called Matt and Mike little created these 10 commits It's an actual history. You can still diff what was going on there So here's a changing a link to support forums for example You can see that in subversion all commits are versioned by natural numbers like 1 2 3 4 etc that is because When you work with subversion it uses a centralized model. There is Somewhere on the internet. There is a subversion Repository and when you make some changes when Matt did some change or Mike did some change They send it over the internet to the central server and it maintained the history. It is very different with git You have the entire repository available locally for you. That means that if you today clone The WordPress git repository you will get all 14 years worth of commits available locally So you can inspect the history locally create commits Work offline in a train something like that. So it's a really powerful concept You can see that the server is missing from this light usually in practice You have some sort of central location because it's just easier to coordinate work if you have a Central location but as far as git is concerned. This is just another copy of the repository. They are technically the same So let's quickly go through the core commands. I'll be using this amazing web application I'll share the slides if you're starting with git. I encourage you to visit this website It is really lovely on the left side. Do you have a simplified console? It is not the full commands You need to write but it's pretty close and on the right you see visual representation of what's going on inside And I personally find it very helpful to to have a visual image of what is going on. So Probably the very basic command is just to commit some work You edit some file for example on on on file system and then call git commit to create commits So I've created three of those and it's just three bubbles Ah, you can notice that git doesn't use nice numbers like 1 2 3 4 it is for a good reason This is actually a hash of the change itself So later when git will synchronize the repositories it will know that when it sees two same hashes It's the same change and it doesn't need to transfer the data when it sees a new hash a new number It will need to synchronize. So this is quite important. It is getting some You need to get used to this some people don't like it about git at first but After some time, it's very natural concept. Like why should it be numbered 1 2 3? It's just random numbers, you know So if you view WordPress history on github, you will see these hashes So another powerful concept is branching and merging. This is probably what made git Popular or the other way around git popularized this workflow. It was possible before but it was quite hard Git makes it really simple and mainstream. So whenever you are going to do some work You should create a branch for the task. You can break things there. You can clean up later or whatever so It is like your place to to make work and later when you're happy with the changes you merge them back So so the merging is what git made really simple So it's just git merge Another useful command is git reset which enables you to go to any point of history You can go back like in this case if the merge didn't work You simply reset to previous state. You can also go forward. So whatever was tracked in git You can jump to you can jump to 14 years ago, for example or to yesterday to any state really And the last important concept is synchronizing repositories So in this case, we will have like much repository will be the local one we will be looking at the problem from much point of view and Let's say that the remote repository is Mike's It would in practice probably be something like github, but let's stay with a friendly face So if we compare the hashes like the first commit has the same hash So git has sees no needs to synchronize those those are the same However, the other one has different hash. So it will need to synchronize this So first much tries to push to the remote repository, but it is rejected because there is something incompatible something new on the remote repository. So what what needs to do is to pull first and This will this will bring this single comment from the remote repository is local repository And the second step is combining the local work with whatever came from the remote So it's basically a git pull is fetching commits from remote and merging them with the local work and I think after this you can push and you have basically the same state locally and in the remote repository So everything is synchronized With this I believe you have covered like 80 percent of what you need to know to start with git So you commit to Store the state in a git repository you push and pull to synchronize your work with remote repository Whether it's your colleague or github or bit bucket or git lab or your own server, whatever And then you branch and emerge and this is I believe like 80 percent of what you use in practice This site is amazing. So please try it if you're starting. It's very good introduction So let's spend how how much time do we have? Okay, so let's spend some time talking about git plus WordPress So if you do any sort of plug-in or film development You should definitely be using version control like there is probably no excuse not to do yourself a service Invest like a half a day a day to learn the basics and start using version control It will it will be greatly beneficial for you. But what about the full site? I mean both the files and possibly the database sometimes you need to change options Sometimes you need to create new content in the database Databases are very unfriendly to version control. So really it's complicated You have basically two options today The first one is reviser What revise it does is it supports the database to a dump and it commits the dump to the database So it's sort of like a backup But instead of packing everything into a zip file you commit it to the git repository It is very useful. You can push to github for example to have a remote backup What it cannot really do is branching and merging because the dumps are a huge pile of some data And when you try to merge those two dumps, it will end up you will end up with a lot of conflict So good backup solution, but not really merging solution What we are working on is something called version press Version press watch works by observing every change to a site So if you add a post it will create a commit behind the scenes if you delete the user It will create a commit if you update a plug-in It will create a commit and for every such action you have the undo button So you can see version presses the undo button for WordPress, but it's powered by git behind the scenes It's a true git so you can use all the git clients, you know The other important point about this is it can do actually branching and merging So for example when you do staging Creating staging environment is easy you just copy the website But what it's usually hard you do some changes in staging and the production environment also Receive some new comments or post something like that So you cannot easily replace the production database with the staging one So with version press you can just merge those together. It can do database merging I'll be available at the expert bar after this So or at the real bar in the evening. So if you want to come chat about this a little bit more I'll be available. There's not enough time to do more. So with this a quick summary If you don't use version control really start at least for your plug-in and screams git and github is the simplest start today And if you want to do full WordPress versioning you have two options basically reviser and version press So that's it. Thank you


Hello and welcome to MIPS TV and with me is Carrie White who's going to be presenting at the Manchester Institute for Psychotherapy Conference, which is going to be held in October 2017. So thank you for joining us Carrie and you're going to be presenting a workshop on accounting and I guess you're not going to be being in a calculator with you are you? No, I'm not. What I'm doing is talking about a model that I developed some years ago, which I've called the accounting model, basically because it's the opposite to discounting. It's about taking account of what's going on in the world. And I developed it when I was running groups for women who met the criteria for borderline personality disorder. I'm a specialist in that area. And I think as any therapist knows, and I think Gregor in his keynote speech is going to be talking about emotional regulation. And one of the difficulties for people who meet the criteria for borderline personality disorder is actually regulating their emotions. There's a kind of real sense of getting stuck in their feelings. And obviously in that process they switch off their thinking. There's a lot of dissociation that goes on. So what I did was brought together some key pieces of theory from transactional analysis to create this model that has helped people to really switch off the feeling and get into the thinking or at least to kind of reduce the feeling to a manageable level that they can actually switch their thinking back on and process information. Step out of game, step off the drama triangle and hopefully engage in relationships in a more fulfilling way and a much less destructive way. Does that make sense? Yes, it does. It sounds very much like the idea in transactional analysis of discounting is where you're ignoring people and not taking them seriously or discounting them. You've come to the opposite of that. You're talking about accounting and in particular helping to people to cognitively account for themselves to the point where they can manage and regulate their emotions. Absolutely. That's beautifully put. Thank you very much. And I mean, I know that we've got Camilla's model of discounting. Personally, I've always found that I've struggled with that model and I found that with people with the personality disorder that it was too complicated. I wanted something that was simplified, which is why I created this model. And I'm looking forward to presenting. I presented it at the Vern Institute and got a very good response. So I'm looking forward to actually delivering it at the conference. And as I said earlier, I think that thinking about what Gregor is presenting in the keynote speech on Saturday, on the Saturday, that it would be, I think it follows on quite nicely from that kind of talking about the emotional regulation. And there was something else that I was going to say that I can't remember what it was. Well, I for one, I'm super excited about seeing someone who's developed their own theory. This isn't just a theory that's being reinterpreted or revision. This is someone who's developed their own theory. I'm really looking forward to seeing that at the conference. And colleagues who deal with clients with borderline personality disorder. I just think this is something that cannot be missed. So I'll certainly be sat attending your conference. Well, thank you. I mean, I suppose it's just important to say it's new in the sense that it pulls together some other pieces of transactional analysis theory. I don't want people to kind of get the idea that I've created something incredibly new. But it's a way of I've pulled some other pieces together that I personally find work really well. Okay. Well, okay. Well, thank you for that clarification. For those of you watching this and thinking, well, what conference are we talking about? And where is it held? If you go into the comments bar below in that section, we'll put a link to the website and the link where you can see all the other presenters and venue and be able to book tickets to come to this just wonderful event. So Carrie White, thank you very much. Thank you.


Welcome to GLS at news or Dan for short. My name is Rob and today we've got a lot of things to go over. So just the thumbnail and title suggests it looks like contagion is moving along quite rapidly. And the thing that doesn't concern me isn't the amount that's happening that we know about. It's the contagion that we don't know about. So we're going to take a look at exactly what's going on. Also I'm going to talk to you about we're going to do a ledger stonebook giveaway and talk about how to how to view centralized exchanges. And I want us to want to go over something that I thought was very interesting as far as what Kevin O'Leary said, Mr. Wonderful. And we'll talk about the contagion issues and things like that. And then I want to show you pretty much where all the action is happening right now for the crypto and digital assets space and the very end we'll do a little Q&A. So first things first, the giveaway.  And it's tough for a lot of people to do much of anything when they've lost everything. And if you have anything that's on the exchanges moving forward, I don't want you to have the same issue. So what we did is there's a tweet that just came out. And we take a look here. Here's the ledger and shield folio giveaway tweet itself. And very simply, here's all you got to do. Watch today's video. What you're doing right now. Congratulations. Like this video if you would be so kind. And then go to this. There's a link in the description for the tweet itself and then like, comment and share this tweet. I'll choose the winner live in tomorrow's video. I don't usually do a lot of giveaways, but I thought it was appropriate right now. And then your question might be as well, Rob, I know what a ledger is. What's a what's a stone book or a shield folio? And this is what it is. So shield folio, it's a it's a waterproof book tear resistant. It's not fire resistant, but it's it helps to put everything in just one simple place. I don't want you to be like me where I put my mnemonic phrase of my old cardano wallet on a piece of paper somewhere and it's gone at 20,000 cardano just gone. Who knows what that could be worth in the future. But that is all out of here. So we'll be doing the giveaway. I get one of these and the ledger. If you win very simple, also, we're going to be doing more of the shield folio giveaways throughout this whole week. So just tune up. You might be a big winner. Also if you're looking to find out like where do I figure out how to use this thing? Because I don't really understand. Again, Dante just crypto. It's my website. It's 100% free. I made it free. It'll always will be free. Just sign up. I'm just going to ask you for your email. I don't even spam you. I just tell you when I upload a new video, go to module to safety, scroll down. I talk about what's a crypto wallets, what's a seed phrase, what's how to set up your nano ledger, ledger live app and all this good stuff. So you can do that. And also I just learned something new about ledger, which I'd like to share with you right now. I think an ounce of prevention is worth a pound of cure. So what I'm talking about is there's this thing on ledger. I don't know if you guys know this thing. It's called the recovery check. And this is a way that you can check to make sure that your mnemonic phrase in ledger is actually correct and you can get your funds back. And very simply, I'll link the video in the description, but it's super simple. I'm just going to let me stop my screen real quick. Let me share. This is my ledger life that you can see right here.  And you take this, you install, and you're able to put in your mnemonic phrase. Don't worry. This is through ledger. I mean, hopefully you got it through the right place and you use the links in the description and not went to some crazy website that offers a 50% discount or something crazy so they can steal all your funds. If you have an official ledger, it's okay. Ledger live app. This is the official one. Again, links in the description. And you can put in your mnemonic phrase just to make sure that it's correct and it'll tell you if it is or not so you can rest peacefully at night. So that's something I learned today. I just want to share with everybody that they can double check and make sure how it all works. So on top of that, the recovery check, which I thought was pretty good, is there's something I just had a question or a comment about. I thought it was pretty good to let everybody know. This is Darth Boomer, interesting person. And he says it like this, and it's very true, treat a centralized exchange like a filthy public toilet.  And I gotta tell you, for everything that's been happening, I totally agree with Darth Boomer. So Darth Boomer, shout out to you, excellent posts. I will be using this gratuitously moving forward. Also, I just wanted to bring this everybody's attention about the craziness that is going on right here. That's Aaron Bennett, friend of the show. He does a lot of great things with Celsius and giving everybody an update does a fantastic job. This is Ran Neuner, I think, from Crypto Bantry. Yeah, and it's a YouTube channel you can check it out if you want to. But he had Mr. Wonderful on, and he asked him a very simple question. This is 45 seconds. And there's been a lot of back and forth about what was said. So this is what was said, and Ran's gonna ask him, would you take back SBF and hire him? So just take a listen to this. Knocked on your door again and said, look, I failed in my last venture, I have a new crypto venture, I need money. Would you back him? That's a great question, no one's asked me yet. I think we can all admit, you can love him or hate him, given what's happened. But he was one of the most brilliant traders in the crypto universe. He also built one of the most robust platforms. We used FTX actively, it was a very robust platform that allowed us to get information on a compliant basis. So I really like what he built. Would you back him? The answer would be, yeah. Okay, so before everybody freaks out, like, oh, but he said something afterwards. I know he said something afterwards. He did. He said, I would hire him back. I would let him go, but I would put guard rails up to make sure he doesn't do anything, nothing but shenanigans or whatever else. But I'm just thinking to myself, I'm like, does greed, no, no bounds? I mean, honestly, you're going to let something like that, SPF come in, and even Mr. Arnold was grinning throughout the whole question, which to me is amazing. So I'm like, whatever. I just thought it was fascinating that someone would let him back in. But let me know your thoughts on this one. Maybe I'm seeing it wrong here, but I would not let SPF anywhere around any kind of company that has to do with crypto and digital assets. And that's just me. Maybe I'm crazy. Now, that's what's going on. Let's move into contagion rearing its ugly head. I know there's been some rumors about maybe SPF and FTX were a part of a grand conspiracy to bring down crypto. And there's a reason why he hasn't faced any charges yet. Well, the news is closing. And I'm not going to dismiss any type of thought process about what could potentially be happening. However, there was a report today. The U.S. is reportedly considering Bankman Fried extradition for questioning. I got to tell you, the wheels of justice sure do move slow. And it looks like the wheel of justice are the people that's behind the scenes are really dragging their feet. Here's what's happening. U.S. and Bahamian authorities are reportedly discussing the possibility of extraditing Sam Bacon-Feeder SPF. Just thinking about it, OK? Since the incident, the former FTX CEO co-founder Gary Wang and the director of engineering, Nishit Singh, are known to be at the Bahamas, where they are under supervision. Initially, rumors had surfaced of Bankman potentially looking to flee to Dubai, which is what I had heard. I had heard that he was actually on a plane, but that's been debunked so far. However, due to an agreement between the U.S. and the United Arab Emirates, U.S.-based fugitives attempting to relocate to Dubai have a high chance of being detained in return. I did not know that. So apparently, when people say, oh, this will go to Dubai, well, apparently, there's some type of communication between Dubai and the U.S. for where they detained people and send them back. So it's something to be said that maybe the news is tightening and things are going to actually happen. But that's not what we're here for. We're here because what's going to happen in the market, Rob? Great question. Well, there is this great chart. And I can tell you that, remember when Luna collapsed? And then, of course, we figured out it was some of the hindstings as far as 3AC, 3ROS capital. And then, of course, then Celsius collapsed and Voyager collapsed, and we're like, well, dodge the bullet. That's it, huh? And now, of course, we're hearing some things about SBF and FTX. It's all unrelated. And I don't think we're going to know the extent of it, obviously. This has been shown many a time. And I will just tell you that there's a lot of companies, individuals, and projects on here that make me quite nervous. Does that mean they're all going to fold? No. But it's something to be said. And here's the first casualty. Not that it's a big thing. It's really not on this one. But it makes you think. And I need to bring it to your attention so you're aware. So Circle, which, of course, founders and creators of USDC, reveals FTX exposure, says the conversion of Binance have hurt projections. That's not so bad when it says we've hurt projections as far as our profits for the quarter. It's another thing when they say, hey, this is toy destroyer of business. And this is not what's happening. Circle disclosed that the tiny FTX equity that Circle CEO Jeremy Allaire alluded to on Twitter last week and looks like they lost or 10.6 million investments the company made in the FTX group. And that's probably gone according to regulatory findings. So because of that, their earnings may not be as popping as they may have said. And then it goes over some other information, but it's really not too much. So 10.6 million maybe in the future we figure out, oh, no, no, wait, it was 10 billion. Sorry. We miscalculated. It's enough for me to say, I'm out of stables. I'm not, I don't have any desire to stay in them. And they're here for me. They work for me. And if I don't want them to work for me, that's it. So here is my diversification portfolio updated today because things have shifted. And of course, I'm heavy cash now, heavy cash, not as much into the stables. I've got some on my DGen plays, which we've talked about extensively on this channel because I am biased. Also, I've got 5% roughly more or less in masterworks, 5% of land, but we sold sold a big couple of lots a month ago. But most of my diversification is in, of course, real estates, short term and long term rentals, the Amazon business outside of my crypto also for staking. I do have some equities, which is really not five. It's really like two to four, two to five percent just depends on the fluctuations and of course, crypto IRA with I trust. And that's my diversification concentration leads to wealth and diversification helps to maintain that wealth. So I will lead that up to your own devices of what you'd do with that. Moving forward, here's the problem. Here's the more contagion. People under salt halts withdrawals after FTX collapse. You may have remembered that I talk about salt every so often and as far as like dollar cost averaging into products that will never come back. And I always say a dash of salt and that's the same one salt. You can see right here is worth a whopping 3 cents as far as their crypto, but mostly it's for loans and it came out pretty hot and heavy in the 2017 era, 13 bucks. That's pretty good. And of course, just flat line and hasn't done squat ever since. So I just say that pick your projects wisely because a lot of them are going to fail and that's okay. That's just how it is. But I would say a dash of salt and of course dash is that's doing okay, but come on dash. Who knows. So crypto and assault halts withdrawals. And this is going to warm our way into a friend of the show, Simon Dixon bank the future. So the collapse of FTX has impacted our business. This is the salt CEO, Sean Owen said a message sent to consumers until we are able to determine the extent of this impact with specific details that we feel competent are factually accurate. We have paused the positive withdrawals on the salt platform effective immediately. So remember, we're talking about contagion and in the effects of these companies, you understand if they're doing investments and they're loaning things out, well, I don't know how far it could actually go. But there's steps beyond steps beyond steps because it just starts to grow and grow and grow. This is also Tiffany Fong follow her as well does a great job of aggravating the machine skis, I will say. So that is what's happening. And then also for this one, because the salt lending platform was due to be absorbed or be bought out by Simon Dixon and bank the future, because of what happened with FTX and their issue, they're going to forego that acquisition online investing platform bank the future drops the plan to acquire crypto owner salt due to FTX exposure. So again, we're talking about contagion, it's not just like, well, this kind of affected us. Well, now FTX, which was having, I believe, financial problems already, now they're not going to get bailed out by bank of the future as they absorb, this is just here say I don't know the specific details. But again, you see what I'm where I'm going with this. One domino falls and a second domino falls and other domino falls. And that's that. So I know that there's been some some talk about especially Celsius protagonists were like, well, you know, Simon just did that so he could do his own thing. Well, he's not going forward with that. So that's that piece. And also, let's let us not forget of a new piece, Genesis, crypto lending unit is halting customer withdrawals and wake of FTX collapse. So here we go, folks, Genesis, global capital serves an institutional client base and $2.8 billion in active loans. That's a lot as the end of the third quarter of 2022. Genesis lending are a crypto investment bank. Genesis global trading is temporarily suspending redemptions. Genesis trading is different. It acts as Genesis global capital's broker dealer is independently capitalized and operated separately from that lending unit. Well, let's see how long that statement lasts and we'll go from there. Genesis on our digital currency group is also the parent company of Coindesk. Uh-oh. So last week, Genesis to close at its derivatives unit had about $125 million of locked funds in the FTX trading account. That's gone. The digital currency group opted to strengthen Genesis balance a sheet with an equity infusion of $140 million. Hopefully it works out. Announcement was noted by Gemini. Ah, one more to go down. Wait, just wait. The crypto exchange and custodian that has a partnership with Genesis. And what are they using for? That earn program. Gemini, the crypto centralized exchange by the Winklevye twins. State of this, we are working with the Genesis team to help customers redeem their funds from the earn program as quickly as possible. Now, I have to make a distinction here. This is just the earn program. Hopefully they're talking about the rewards for the earn program and not the entire crypto that has been placed when people sign up for Gemini and say, I'd like to go in that program. I'm not 100% for sure. We are disappointed that the earn program will not be met. We're encouraged by Genesis and its parent company digital currency groups commitment to doing everything in their power to fulfill their obligations to customers under the earn program. That sounds nice. Also, stablecoin issuer, Tether also confirmed in the blog post Wednesday that it had no exposure to either Genesis or Gemini earn. Tether is operating business as usual, the company wrote. Now, I will say one thing about Tether. I'm not a big fan of Tether, never have been. However, everybody who's thrown things against the wall against Tether, still here. There's something to be said about that. And also, a lot of things been said about crypto.com. Yet, it's still here so far. So I got to tell you the companies, the projects, the exchanges actually make out of this one will be that much stronger moving forward. And they will probably rule the roost as far as the crypto and digital asset space. But let me let you think about that in the comment section. And lastly, I just want to talk to you guys about where the action is happening here in YouTube world. I can bring you some pretty good information pretty relatively quickly. But if you have the time and I'm talking about like hours, sometimes even like five, six, seven hours, there's this thing called Twitter. I don't know if you've heard of it. And Elon Musk, of course, bought it out. But before Elon Musk, there was this thing called Twitter Spaces. In Twitter Spaces, I dismissed it as not a big deal. But right now, everybody in the crypto space is using Twitter Spaces as a place to just disseminate information, get people's opinions, and at times, spread a little rumors in here and there. And I got to tell you, if you don't want to be addicted, don't start this. But there's a, you know, you can just go to your Twitter account, find actually the best person to probably follow is Mario Naufel. I met this guy one time, actually, seemed like a nice guy. And he's been putting on some fantastic Twitter Spaces.  You've had, gosh, everybody you can think of in this. Let's see who's here, actually, right now. It's less than life. Alex Fausel from, from Swissborg. Hussain, crypto immersion, and there's, and then Richard Hart was on today and just pretty much blasting everybody. You had Brian Armstrong in there not too long ago. You had a gentleman from MicroStrategy.  So if you're looking for like the update about what's happening, there's a link in the description. You can follow Mario. He does these, these Twitter Spaces. And that's the ones that actually watch to get all the best information about what's going on right now. And that's it. So look, that takes care of the news today. If you liked today's video and you want to win a Shield Folio or a Stonebook and a Ledger, give the video a like. Also consider subscribing. Good luck with YouTube, you know, actually letting you know. Sometimes it does, sometimes it doesn't. And that's it for today. So look, if you want to stick around, we'll do a little Q&A. I'll answer all your questions, the best of my abilities from the thing that I've learned along the way and what's going on. But that is it. So thanks so much for stopping by. I appreciate you. I'll see you on the next one. Now let's get into a little


Hi, in this video we'll demonstrate how to read barcodes with our locally hosted API server. First of all, let's build an API endpoint request URL. Normally, this request is of type post only, but for this demo purpose we'll do a get request so that we can see output in the browser itself. Base endpoint URL for barcode reading is barcode slash read slash from slash URL. We need to provide additional parameters such as input URL, type of barcode to read, etc. Let's put the request URL to PDF.co base URL. Now, since it's done, let's put the type of barcode we intend to read. Please note that PDF.co supports various types of barcodes to read from. We can also specify more than one type by comma separated. In this demo we'll be using code 128. And finally, let's add the source URL. This can be any URL pointing to either image or PDF. For this demo purpose, we'll be using a local barcode URL. With this we're done building API endpoint making. Let's execute it in the browser and check the response. Output should read barcode text as holo 12345. And it is. As you have noticed, the output also contains watermark text as we're using an evaluation license. Thank you.