This video is part one of discussing inverses.  For example, if you take your coat off a hanger and put it on, this can be undone. So let's do the steps to see what we can do when we have a function and it's inverse. So if we think about our function as putting on a coat, it's on a hanger. So the first thing that we have to do is take it off the hanger. And then the second thing that we're gonna do is that we are going to get your arms in the coat. And then the last step that you're gonna do, my son said, well, you check outside to see what the weather's gonna be like to side if you're gonna zip it up or not. But I always zip my nut because I'm always cold. So I would zip it.  Well, you unzip your coat because it's zipped. Then you take your arms out so you can take it off, out. And then, unless you're my children, you put it on the hanger. So what can you say about the order of the steps in the function F of C and the inverse function F inverse of C? You can say that the order is the opposite order. And you could also say, along with order, we could also say that it's the opposite actions. And I want you to notice here that it says that inverse function, F to the negative first C, doesn't mean F to the negative one power. It looks like F to the negative one. But you'll notice I was saying F inverse of C. That's the way that's read, F inverse of C. So let's do some math. If you add in each of your numbers, what is the inverse? You would subtract two. If you wanted to undo adding two, you would subtract two. If you divide any number by negative three, what is the inverse? Well, the inverse would be to multiply. And you would multiply by negative three. You undo with the same thing. Notice when we go back and think about the code in the hanger, I didn't put it on something else. I put it on the hanger, just like I had taken it off the hanger. So we keep the negative three, but we multiply instead of divide. So it's the operation that we need to be the opposite. What is the word of operations for this function? Remember, gemdust, you got your grouping symbols, exponents, multiply, divide, add, and subtract. So the first thing we do to this X is that we multiply by two. So we multiply by two. And then the second thing we do is to subtract the five. So let's the inverse order of operations for the inverse. Remember with the code in the hanger, we started with the last thing. I zipped my code up, the last thing in the function, but I unzipped it in the inverse function. So I'm going to add, do the opposite operation, my five. And then I'm going to not multiply by two, but divide by two. So that means that I start with my X and I add five to it. That's the first step. And then from there, I'm going to divide by two. And you have to divide everything you've done so far by two. So X plus five all over two would be my function, my inverse function. Let's do one more. Again, what's the order of operations? Let's list those operations. So I've got this X. The first thing I would do is inside the grouping symbol. So I would subtract six first. And then after I've subtracted the six, I would square or care it to by my shorthand. So the inverse operations, the opposite of squaring would be to take the square root. And then the opposite of six would be, or subtracting six would be to add six. So remember it's reverse order, reverse operation. Start with the last thing and make that your first, but do the opposite. And then work your way backward. So we start with X. And the first thing we have to do is take the square root of X. And then it says plus six. I've already taken the square root of six, so the plus six goes outside the radical. So the Fn versus equal to the square root of X plus six.


Great. Do you guys see my slides? The transition. Changing too. Great. So this is a joint work with André Monsonari and Mark Selty, who's a fantastic graduate student in mathematics at Stanford. So we'll be talking about optimization of mean field spin classes. So the setting here is very similar to the talk from two days ago by Erion Zubak and we'll be interested in optimizing these things that are called spin-glass Hamiltonian. So let me define it. So here we have a Hamiltonian, which is a Gaussian process. This is the definition. It's centered and it has a covariance that when evaluated at two points, sigma and sigma prime, it depends only on the inner products between those two points. And the Gaussian process is indexed by the hypercube. So plus minus 1 to the n. And just to give you two examples that you have to keep in mind through the rest of the talk, you can look at the SK Hamiltonian or the two-spin model where you can have this explicit expression, which is just a quadratic in sigma i, sigma j. So it's like a two-body interaction. And in this case, you can compute the covariance and you'll find that this function c that dictates the covariance is just x squared or x squared over 2. Proper normalization there. And the second example that I want you to keep in mind is the three-spin, which is almost the same thing except you have a three-body interaction. And these Jij's, by the way, are all Gaussian independence random variables. And c here is x cubed. So the question here is I want to maximize this Hamiltonian, find the ground state energy or the ground state configuration approximately, over the hypercube. Okay, so what do I mean by optimize efficiently? So I'm here depending on the description that you're trying to choose for the Hamiltonian, this probably may or may not make sense. So let me put this on a more formal definition. So here I'm getting, I'm considering an algorithm that takes, that takes as inputs gradients from some oracle that computes gradients from you. So you just query your points and then the oracle computes the gradient of the Hamiltonian at that point and returns it to you. And you want to use all of those queries to form some valid configuration, sigma, such that you're at least one minus epsilon times the optimum with high probability. And you want the number of your queries, the number of conversation, the length of the conversation with the oracle to be polynomial in n and one over htm. And so like in the worst case, this is already NP-hard actually. So you can show that already for quadratic, except for the two-spin model, where the jij's are not Gaussian, but they're chosen in a certain adversarial way. This problem is extremely hard in the sense that's already, if you want to have an approximation that is very bad, that is close to zero at a logarithmic speed, then this problem is actually NP-hard. So as a, in a worst case scenario, this problem is, is, is not feasible, but for a random scenario like this one, we may expect to do a little bit better. So what is known about this problem? So if you look, you can look at convex relaxations, which is a general theme that you can try to replace a non-convex problem with a convex one. If you consider this, okay, so pure case-pin spherical model, which is a k-body interaction, like it's a monomial of size k. And you're, instead of, let's relax the constraints that say you're on the hypercube and just be on the sphere. So I just constrained them to norm of the vector sigma to b square root n. And you can consider this level k sum of squares relaxation. And you can try to analyze its behavior, or at least the value that it achieves. It turns out that it has a value that is larger than the optimum by a factor that diverges with n-pollinomial. So it's no good. You can look at Langevin-Glober dynamics. So there's a long, rich literature, but so in this, in a glass phase, these dynamics exhibit slow mixing and they get stuck at what's called the threshold energy. So thirdly, there is another approach that was, okay, presented by Ayaan-Suvak two days ago. So these are, I call them dual algorithms for a reason that will become clearer. So for the spherical model, we've seen an algorithm by Ayaan. So then next, Andrea Montanari tried to extend this approach to the easing case for the two-spin model. And these both achieve, you can show that they both achieve a global optimum or an approximate global optimum under this condition that is called no overlap gap. So we've seen from Suba Bacha's talk, the overlap gap, what that means. And if you assume that there is no overlap gap, that actually implies the existence of an algorithm. And so this is, this theme has been also investigated by many authors, co-authors of David Gamarnik that show impossibility results if this, if this condition is not satisfied. Okay. So let me dive into a little bit of the technicalities of the problem. So if you want to optimize something, you'd better know where you're looking for. So what is the ground state energy that you're trying to achieve? And this is called the Parisi formula or the zero temperature for Parisi formula. So if you, so, yeah, so we can try to define it. And so you can, you have to consider first a space U of functions gamma that are non-decreasing. And this, you have, in the definition, you have to consider this nonlinear PDE that is called the Parisi PDE that takes any gamma from the space, puts it here, and then solves this nonlinear PDE backwards from this terminal condition. Now, once you solve this function phi, you put it in this functional P of gamma, that is takes the value of the, of phi at zero, zero, and then subtracts this linear term. Okay. Now, there's a theorem that tells you that the maximum normalized by n will converge to the infimum of the Parisi formula over all of this class. So this is a variational problem that you get in the limits. So the first thing that you would, I mean, the first thing that you would think when seeing this, this kind of formula is how are these two things related? So this is a maximum, this is an infimum that they don't, they look like they come from two different planets, right? So we'll try to shed some lights on this, on this question. Okay. So behind this, this, this proof or behind this, this whole machinery that will lead to this proof is this thing called the ultrametric structure. So if you look at the clusters of near-optima in the hypercube, these are represented by the leaves of an infinitary tree. So that's the tree that you're looking at here. It has a root and then the leaves of that tree are the clusters of near-optima or near-optima themselves. And the ancestral states, the intermediate nodes in this tree, they correspond to actually points in the solid hypercube or the solid cube and at any level of this tree. So I'm indexing it by, by time here. And at any level, so if you take a point at that level, the two norm of that point is about square root, square root t times n. So lastly, if you take two points on the leaves of this tree, then their Euclidean distance is reflected by the tree distance between the nodes. So if you take this point and this point, then their Euclidean distance is reflected by going up the tree and coming back again. Okay. So the main algorithmic idea is to exploit this ultrametric structure. So what we're going to try to do is algorithmically start at the root and then try to navigate and explore a random path in this tree until we get to the leaf. And then in which case we'll get an approximate ground state. And geometrically, there's an equivalence picture geometrically for this, for this approach. It is, you start from the origin of Rn and then you try to do some kind of diffusion that kind of mimics this tree behavior. And then at some point, you'll, at the end, you would hope to reach one of the apexes, one of the extremal points of the cube. Okay. So the main results here is the following. So there exists an algorithm that outputs a feasible solution in C of epsilon iterations, such that if you evaluate the Hamiltonian at that point, so it's one minus epsilon times the infimum of P of gamma over a slightly larger class that I call L instead of U. So recall the ground state is given by the infimum over a class U. And here I have a class L that is slightly larger. And in particular, it contains monotone functions. So the functions that are in L do not have to be increasing, which was a requirement for the definition of U. Okay. So this algorithm is, of course, optimal if when you compare this infimum with the other one, then they're equal, right? So in particular, so if this infimum is equal to the granted energy, if the infimum is achieved at a non-decreasing function, obviously. And in particular, if this original ground state energy, which is optimized over U, is achieved at a strictly increasing function, then you get that this algorithm is optimal. So this is called an overlap gap. So that's the definition of an overlap gap or fold or continuous replic asymmetry breaking. It turns out that this algorithm is best possible among class of INP algorithms. So this is, there's an optimality, a guarantee aspect to this algorithm is that when you try to look at all INP algorithms, I'll define that in a second. When you try to look at all these algorithms, then the best value that is achieved by them is given by this, by this variational problem. Okay. So this is an algorithmic threshold for optimization in spin glasses. So you can try to discretize these problems and solve them numerically. So if you look at the two spin model, and you solve either one, if you solve these extended various formula or the ground state one, and you find that, sorry, excuse me, you'll find that the optimal gamma will be just strictly increasing, meaning that this non-decreasing constraint that you put in the original problem is not active. So if you solve either of one, you'll always find an increasing function. And this is a conjecture, this is a famous conjecture in mathematical physics, that there is no overlap gap for the SK model. That means that the ground state energy is the energy that is achieved by your algorithm, and which is given approximately by this value. This is in stark contrast with pre-spin model. So if you look at the ground state energy for this model and you're optimizing over non-decreasing functions, the function that you get looks like this. So it's constant up to a certain point and then starts to diverge. On the other hand, when you just remove these constraints, it turns out that you're very far from being monotone. So the optimal function goes down and goes up again. So if you try to evaluate these things, so the ground state energy is about 8.81, and the algorithmic value that you achieve is about 0.8. So it's very close, but it's strictly smaller. So the second thing that you can try to evaluate here is the threshold energy, which is the energy that is conjecturally the one that is achieved by glalbertide dynamics, at least for short times. And this has been evaluated by Riedzo in another paper, and it's about 0.788. So you see that the algorithm, this energy that is achieved by our algorithm, is strictly larger than the threshold energy. So this is an interesting finding. So this is, by the way, these numerics are preliminary, but we have to work on them to make them better. But it's still a very good observation to make here. Okay, so I can try to explain a little bit with the algorithm, how the algorithm is derived. So you can look at a, try to start from a stochastic formulation of the Parisi formula. So there is this SDE natural SDE that is related to the problem associated to this problem, which describes the evolution of the cavity field of the problem. So this is an SDE that you can write down and describes the evolution of the cavity field. And the cavity magnetization here is given by this formula, given by just the second, the first derivative evaluated at x t. So what are these two quantities? These two quantities just are, so if you're familiar with the SK model, you can look at the replica symmetric formula, where the overlaps concentrates at a value q. And it turns out that x t is just normal 0 q, and m q is just the hyperbolic tangent of this value here. So this is, this is what you would find in the replica symmetric case. In the full replica symmetric breaking case, this is the more general form of that. So the main algorithmic idea here is to discretize this SDE with driving noise. So you see there's a Brownian motion. So the main idea here is that the randomness that will form this Brownian motion will come from the Jij's in the right way. And the right way, by that I mean, we're going to use an algorithm that is a. So let me tell you what the algorithm is. So you start from zero. So first of all, you discretize time. So I'm going to consider that time evolves in discrete steps delta. And you start from the origin.  They depend on the entire history up to that point. And you evaluate them. And they give you this point that I called ML. And once you get ML, then you compute the next iterate CL plus one using this iteration. So you have a multiplication by J. And then you're subtracting a linear term for the previous ends with coefficients that are explicit. So they have a closed form formula. Then with this holiday, if you consider the behavior of this algorithm, then in the end goes to infinity limits, then when for any fixed l, this tuple will converge to a center Gaussian vector that has an explicit covariance that is given by f times f, the different times on which you evaluate it. Okay. So now basically I have a Gaussian process for which I can just tune the covariance. I can choose these f ls in order to get whatever covariance I want. So let me choose them in this way. So my f ls are chosen in this way, which is just basically mimics the SDE and the continuous time dynamics that I showed you before. Okay. So here I have a function V. It doesn't have to be the function that is given by the crazy formula. And here I have a function u. So these I have to search over these two functions in order to describe the whole class of algorithms that I have. Okay. So let me... I'm sorry to interrupt. You have like one minute or maybe two. Thank you. Yeah, we'll do that soon. So just for this algorithm to work, it turns out that this necessary condition is that this function u that showed up in the algorithm has to satisfy this condition. This is just because if you just assume that the algorithm works up to time l and you want to show that it works up to time l plus one, then there's an induction argument that'll actually require this condition to hold. So let me not dwell on that. And you can compute the energy that is given by this algorithm is just this integral. So this is a derivation that we can do. And so this is a necessary condition. And now you have to add another condition because we're in the easy in case, which is just that my magnetization at point at time one will have to be between minus one and one. This is just specific to the easy in case. Okay. So I can maximize over all my choices of functions of this energy given these two constraints. Turns out that I can slightly relax that. And I can just optimize over all stochastic processes that can have these constraints. And I don't have to worry about the v here. So I can just absorb this xt in you. Okay. So that value I'm going to call it e star. Turns out that you can relax this assumption. So this thing is the most difficult thing to deal with. I can put it upstairs here with a Lagrange multiplier. And that will give me a relaxation. And this relaxation has a Lagrange multiplier new that I suggestively written in this way and involves this thing called gamma. Turns out that this relaxation is the Parisi formula. And now so you'll get that's the energy that is achieved by your algorithm is smaller than the infimum over all gammas of this function, which is exactly this. So if you optimize over a large enough function space, you get actually the energy that is achieved by your algorithm. And turns out that okay, so the optimal control will be given exactly by what you expect, which are these, these formulas that are described and the effective field and the effects of magnetization. So the main message here is this duality. So we have on the other hand the Parisi formula. And on the other hand, this stochastic control problem. And these two things are equal actually. So these are two, two different exactly equivalence definition of the same number. And this is what the algorithm does. So here this is that's the description for the algorithm is doing. And this is just the dual formula. This is where you get an infimum instead of a supremum is just by taking the dual. Okay, so let me just conclude here. I want so interesting directions here aren't physical interpretation of this extended Parisi variational principle. And we don't have that yet. This is just what is achieved by the algorithm. And we don't know what that is in terms of the actual gives a measure. And we would like to explore this duality property. Excuse me. And then other models would be the perceptron case stats by protect models and etc. Sampling would be an interesting idea. And then we can try to extend this idea to sparse models and thank you. That's, that's all. All right. Thanks on it for


Right guys, I'm going to teach you how to stop lucid dreaming. I never thought I'd be saying that because obviously this channel is about how to lucid dream But there are times when you would like to stop, you know For example, if you're feeling overwhelmed, you're feeling like you don't want to have these experiences Or you feel like it's taxing on your mind. Some people are different and some people actually find this stuff, you know It's quite tiring to their mind. I Haven't really found any what come across anyone who's found this to be the case But I know you guys are out there and I know that some some of you find especially natural lucid dreamers find that Sometimes you just want a break, right? You just don't want to be conscious. You don't want to be doing things You just want to be passed out and completely unaware and you know sleeping, right? Unaware of your dreams There are a number of ways that you can stop lucid dreaming The first and most obvious one is that when you become lucid you just wake yourself up Okay, by either, you know killing yourself in the dream or closing your eyes and keeping them closed Or just you know strongly intending to wake up That's probably the least effective or least preferable way of stopping lucid dreaming because you interrupt your sleep as well And then you wake up feeling worse, you know say if you're having a lucid dream at 4 a.m. You don't want to wake up at 4 a.m. You know most of us don't want to wake up that early, so That's just an emergency one if you're really struggling and you don't want to lose a dream at all the second one is you can just Gradually tell yourself that you're gonna lose a dream less, you know instead of constantly saying Instead of constantly saying I will lose a dream tonight Constantly tell yourself I won't lose a dream tonight and you know you'll build up that negative reinforcement instead of the positive reinforcement You can also then try things like you know a lot of lucid dreaming is about building habits And once these habits are established in your mind, they're hard to break So one of the habits is self-awareness and you know being critical of the world around you That's not a bad habit by the way If you have that habit if you're constantly aware of the world and you're asking questions And that's why you're always lucid that's not a bad thing And I would if I were you think very carefully about whether you want to stop doing that Because that's one of the bait the building blocks of lucid dreaming. Yeah, it's gonna give you lucid dreams But it's also a really good habit to have we should be questioning our world. We shouldn't just accept what we're presented, okay? Great film to watch for that is the Truman Show by Jim Carrey We shouldn't accept what we presented we should have constantly questioned things so That is an option, you know, just tell yourself I won't lucid dream tonight and eventually you won't lucid dream Another thing is if you were writing your dreams down if you're writing in a dream journal Stop doing it because by writing in a dream journal.  I want to lose a dream And I want to be more involved in the dream process So if for some reason you don't want to lose a dream then just stop writing your dreams down altogether. Okay now This has been a bit of a difficult video to To sort of create because I always teach you guys how to lose a dream And it's weird to think that you wouldn't want to lose a dream Well, you know some of you out there wouldn't want to do this, but I completely understand, you know, if it's Tiring or if you feel like you just want to break that's absolutely fine. There's not a problem with that at all And I'm not gonna say, you know, you're gonna be a worse person for it or anything like that because you know It's completely absolutely perfectly acceptable To not lose a dream and to not want to lose a dream. That's absolutely fine So hopefully this has been helpful. Hopefully this is you know, helps you Work out how to stop lose a dreaming Leave a comment. Let me know how you got on or you know your struggles and experiences and yeah, that's it done


Thank you for staying with us. It's still the breakfast on the plus TV Africa and we're going to take our next hot topic in the short time that we have NLC TUC issue 14-day ultimatum to federal government over non-implementation of Agreements you remember that also this morning we saw the headlines that both the NLC and TUC and the federal government differ on Implementation of the agreement, but we have here to discuss this with us Comrade is male at Dejumon chairman Ratau Lagos and PR O NLC Lagos. Good morning, and welcome to the program comrade Good morning for having me this It's my pleasure to be here. Good morning. Thank you for joining us. Okay, so what's the update right now? All we know is that the NLC TUC has said that after 14 days. They may be a strike. What's the current development? Thank you very much. I was one in a station. I think two weeks ago where we discussed about this Delay in the inauguration of the trepidate committee That we live to the negotiation for the new minimum wage, but we call it a new Living wage not minimum wage anymore because the situation is getting out of hand, but be that as it may The medial liberal congress leadership and the trade union congress leadership TUC have been very very Petrotic and I've been working closely in line with the government in order to ensure that there is no crisis whatsoever that can the you know skyrockets across the nation as a result of this current economy actually You know arising from the subsidy remover another neoliberal economy policy of this current government, but As you can also read from the news yesterday the leadership met after careful consideration Of all the agreement initially signed with the government we realize that this agreement have not been fulfilled and That of the trepidate committee as they said to have been upgraded They've come yes work at this that one aside, but the initial agreement that has to do with the wage award That was signed to cushion the effect of the subsidy remover that has not been addressed By the government in a manner that would be post confidence in the leadership In fact as I speak majority of workers in some sectors have no even hand their salary for a month of January and it's becoming a You know an issue that the leadership have to you know, so into action And the only instrument that I told you earlier on that we deploy when you should get to this level is to reach one of the Maitrena doesn't add in a third without a pause of the people in the community We are one of us reside in the society at large things are not getting easy at all The inflation rate is is as a completely erudite Whatever anybody's earning at this moment so one government to be more proactive and to be Genuine and sincere in delivering or not this Nisha agreement miss especially that has to do with which award the issue of a binary And all other agreement that have been signed and all these things We are more concerned to to engage the government to ensure that all these things are delivered timely That is the essence of this a ultimate home to to let government be more, you know Active and deliver timely. So these were promises Revenue and doodling as according to them, but we want them to be more committed to the plight of the general workers and masses Okay, so here is my concern Over time you hear NLC if you're an ultimate home saying they are gonna go on strike and after a while Nothing is being done. So they don't go on strike the federal government never, you know Put in place all of the things that they said they will so the agreements are not being met And then it seems like it's a charade that happens to over and over again So NLC will threaten we're going on strike. We give you a 14-day ultimatum We give you a 21-day ultimatum whatever the case might be but then nothing is being done Don't you think the federal government sees through this Charade if it may if I can call it that and they know that nothing is going to be done So they still go ahead and not Not implement all of the things that have been stated in the agreement Thank you very much for that question We in the labor movement, we are bound by rules and regulation We are not just like civil society organization that can just enter streets or start protest at the short notice So we have to explore all the you know the framework Set out in our constitution before we embark on any protest or Industration so we have been very careful not to aggravate the very tense atmosphere in the country but With the situation of things at the moment the leadership felt the government need to do more and that is why this Ultimatum was issued previously We know government have not been you know the very very sincere with the labor movement in terms of You know fulfilling agreement and when we saw any time we observe this coming We swing it to action and then we deploy the instrument we have and which is to notify them that you are not Serenading on all the agreement you have signed with us So the masses are aware which we are aware they too. They are very much aware So it's not left for the masses and the government to know that they have not been really doing well with the labor leadership So we implored them to be more sincere and fulfill agreement because they are the one that should serve the pace For us if we violate the rules immediately you see they go to court to get an injunction to restrain us From going on strike and everybody's a living witness Oh, it's not that we enjoy going on strike But we always won't go mean to do the needful at the right time So strike is the last option that is available for us to down to you have only series of instrument we use but at the moment the government the federal and the state to domesticate and implement the Agreement with the labor leadership. These are these this issue of subsidiary mobile policies and all other Matters signed have been issued. So that is our position. We are not Anti-government and we are not Antagonist so to say we are pressure groups People messy pressure group. So we we implored the government to do the needful timely so that Nigeria can smile because the situation at the moment is not palatable at all Okay, you just confirmed that the trapezoid community has just been set up and you applaud the government for that What if the terms of reference also included how to make sure that these? Wage award is paid as well Are you doubly sure that they don't have this as part of their their terms of reference so that You can give them more time than the 14 days that you have given to the federal government No, these are with our dissent What we had from the honorable minister of labor was that there are a lot of a maybe Shortfall in the budget for the last year And I believe they have made necessary budgetary allocation to augment all the payments across the sector out of the Since September the face September and October for the wager what that of an October and November December with this January as I should be about four months Arias This February so it is a matter that has been set to they are They just have to clear the backlog no matter what It has been set to but when the challenges in pain In fulfilling it and it is this course and it is in the public space domain So we will be very very At least open with them let everybody justify why they cannot pay that with your world within the stipulated time Before we're not going to the issue of minimum wage issue of minimum wage is a matter It's a constitutional matter to the dealer that it is by April the minimum wage Currently relapsed and that is why the government quickly inaugurated our committee Few weeks back to commence the process of negotiation so that will come with an Agreement to what is the actual amount that would be the the benchmark for minimum wage in Nigeria and the respective state Can now go and domesticate because the government also have their representative in the committee the private sector have the representative there It is a robust committee. So Let them work seriously and come up with a living wage for us So what are your demands? What are your demands in case we get to the 14 days that you've given the federal government and They say okay We can only pay one month and keep paying little by little until we play the backlog Will you accept that or you're thinking that after the 14 days the four months that you're being owed must be paid Otherwise you're going on strike. What are some of the things that government can do and then you still give them some more time? We open for negotiation Discussion dialogue that is the the mechanism in industrial relation so if they call the leadership and put all parameters and indices on the table that okay These are the challenges we are facing at the moment. We are committed to paying this amount of this money But we are having some budgetary short for some other challenges. So give us more time then Give them the benefit of doubt, but if the everybody we know that they are the one that is defaulting from doing the needful We are open to that. We are not going to be Martin can say okay. We are not going to agree with them The economy we are all partners in building this economy. We create the work of this mission as they are the workers We are doing a creative weapon. So we are also entitled to the part of this a National resources because some of them are any fabulously the national assembly can see their budget allocation Yeah, the the percentage in the increment the also for the executive and judiciary. So why are we the public service? in the Government and the private sector will not be bearing the brunt of Patient which will be patient patient for how long most so many people have died in this course of this struggle But we implore the government and believe in our president is back now fully And he has been given a lot of matching order to all the critical sector that are consigned I want to give him that the benefit of that before now and the ending of this month He should be able to clear this backlog of a Wage award and then we'll be focused and looking Very very open into the new living wage that is coming on stream hopefully by God grace in April All right. Thank you so much comrades is male at Digimo for coming on the program We hope that the government will do the needful. We don't want another strike. We have never wanted a strike We we we want a situation where the workers will always be satisfied and our country will move on The way it should but good luck to you. We are rooting for you That's what thank you very much. Thank you very much. We are part nine progress Yes, I will continue to be a part nine place who coblost TV plus For your TV say this one plus TV. Thank you. Thank you very much We're talking to come ready smell at Digimo chairman Rata Lagos and PR o NLC Lagos state We're hoping that when the 14 days come we will not experience a strike action from NLC and TUC we're hoping that the lives of Nigerians will be better not just the members of NLC or TUC and In the coming days God help us. This is where we'll draw the curtain on today's brought on today's Program, and we hope that you're going to join us again on Monday. Yeah, until then. My name is Nyam Ghul at Gadji Happy weekend. My name is Roman Paul. So you have a good weekend


Hey, this is Brett and this 2018 Dodge Challenger SRT Hellcat is stock number 13018Z. I'm here at Summit Automotive in Fond du Lac, Wisconsin, you're new and use sports car and Dodge Challenger headquarters. This 2018 Dodge Challenger has the 6.2 liter supercharged V8 engine which puts out 707 horsepower with the red key. This car has been fully safety and inspected by our service shop has a fresh oil and filter change all the fluids have been checked and topped off and this car is 100% ready to go. I'm going to go all the way around inside in the trunk under the hood started up in this video. Tor red is the color and I shoot all my videos in 4K so if you have HD capabilities on your computer tablet smartphone or television I highly recommend turning them on right now because it is your best way to check out the quality, condition, options and cleanliness of the vehicle before seeing it in person. And if you like the video and how I do things here at Summit Automotive consider clicking the subscribe button in the lower right hand part of the screen and then click the bell notifications and you'll get updates every time I do videos of our new news inventory here at Summit Automotive. So it comes with the 20 inch painted alloy rims there in fantastic condition. It has the Brembo brakes on here with the slotted rotors and it has Pirelli 275 40 ZR20 tires. These tires have a good amount of tread left I'd say probably 70-80% of the tread left on those front tires. Front fender is in excellent condition it does have a 3M wrap that kind of starts right here goes on to the hood and is on the front of the vehicle protected from rock chips and everything has the HID headlamps and the front bumper and lower valance are in very nice shape. I didn't see any dents or dings or cracks. The only thing I saw on the lower valance just a little bit of a scuff but I think those are pretty easy to replace and don't have any paint on them. Anyways you get my favorite hood on the Challengers the heat extractors and the coel induction hood on there. I didn't see any major dents or dings and the passenger side front fender is in fantastic condition as well. Passenger side rim no major scuffs or scrapes on there and as you go down this side of this 2018 Dodge Challenger take note of how clean that body is how reflective and mirror like that paint is. I take these HD videos so if you are far away or even if you're close by and you just cannot make the trip down but you're still interested in purchasing the vehicle you can see the car hear the car and have confidence in the vehicle that you're looking at before you even get here so when you do get here there's absolutely no surprises and you can make a smart and informed buying decision from wherever you're at and if this video helps you make that decision let your salesman know that you saw the video that it was helpful and that Brett sent you. Back rim is in excellent shape, Rambo brakes back here as well and you can see just how much tread is left on those tires. I don't know if we can get a good view of the underbody but very clean under there as well. If you like the video and how I do things here at Summit Auto consider subscribing to my YouTube channel the upper right hand part of the screen. Coming around to the back the rear bumper is in fantastic condition I didn't see any dents, dings or scuffs back here it does have the rear bumper parking sensors and you also have the kind of like black chromed exhaust tips, LED tail lamps, decklid spoilers in nice shape and the trunk lid is in fantastic condition I didn't see any dents or dings on there. The trunk area is very clean, has the Harman Kardon sound system with the factory subwoofers back here, tire inflator kit and that's where your battery is at.  Coming down to the driver side, just as clean as that passenger side I didn't see any dents or dings on the rear quarter and for full disclosure this back rim is in fantastic condition as well. Down the rest of the side of the vehicle, doors look really good and it does have heated power mirrors built in blind spot monitoring, enter and go system inside the Hellcat package gives you the Laguna leather, red leather interior it's really it's a soft touch leather very very cool you get the SRT Hellcat logo embossed in the backrest no major wear or rips or tears and power driver seat SRT factory floor mats auto headlamps power tilt and telescopic steering wheel power windows power locks and power mirrors. As long as we're standing up here we'll take a look at the back seats get that Laguna leather back there as well the latch child safety system and no rips or tears back there. We'll hop inside check out the miles radio and then we'll start it up and take a look under the hood see that this one has 10,698 miles you get the digital speedometer on there the seven inch LCD display very clean has the heated leather wrapped steering wheel with the flat bottom there cruise controls on the right Bluetooth and information center controls on the left and audio controls on the back of the steering wheel this one has the 8.4 I think it's the 4C radio you get the factory navigation system on it and it has all your different apps on here including projection manager we can project your cell phone to the screen we actually did demo on Android Auto with an 8.4 if you want to check that out that's in the upper right hand part of the screen but you do get your nav system here AM FM and Sirius XM radio capabilities and you can do your climate controls here as well you're heated in cooled seats and heated steering wheel down here are more tactile climate controls you also have a launch mode you have your SRT pages on here as well you have your performance pages your track your sport your custom you can set this up in a whole bunch of different ways and just a lot of cool stuff that you can do with this radio this is also where your backup camera shows up and that is working nicely and you get the machine metal finish center console and dash trim around the radio passenger side dash or mat and seat are in fantastic condition no rips or tears I don't think this car has ever been smoked in and you do get the power sunroof up there map lights and home link buttons for your garage doors security systems and lighting systems and assist in SOS buttons in the rear view mirror we'll start it up and take a look under the hood starts right up no check engine lights or anything like that these Hellcats sound great I would personally like thank you for checking out the video today and hopefully from this HD video you will have been able to verify the quality condition options and cleanliness of this car all the way around inside now you get the Hellcat air intakes there and under the hood we have the 6.2 liter supercharged V8 engine 700 and 7 horsepower with the red Jeep and the hemi orange headers once again this car has been fully safe and inspected by our service shop has a fresh oil and filter change all the fluid tab and checked and topped off and this car is 100% ready to go there is your emissions sticker and I would highly recommend this car from a quality and condition standpoint I didn't see a denting scuff on it other than that lower front valence this thing is pretty much perfect and to see more pictures of this car one or other 450 new and used cars trucks SUVs minivans Wranglers half tons three quarter tons one tons you name it we got it go to that website right there is summit auto.com full pictures and descriptions of every single vehicle from two locations all at summit auto.com and if you like to check out more HD videos you can go to youtube.com slash summit auto remember to like subscribe and share on this video and all the videos that you see there click the bell notifications you'll get updates on the videos we do each and every day here at summit auto in fact in a second you will see a link to subscribe to our YouTube channel in the upper left a link to more Dodge Challenger videos like this one the upper right a link to his vehicle on our website in the lower left and a link to one of our latest YouTube videos in the lower right click those check us out and we're super excited to help you with this ultra clean 2018 Dodge Challenger Hellcat SRT in Tor Red Clearcoat thanks again for checking out the video remember to like subscribe and share


This presentation is about a paper entitled Transparent Snarks from Dark Compilers which is joint work between Benedict Boons, Ben Fish and myself, Alan Schopenetz. The best way to illustrate this work is to situate it exactly in the landscape of general purpose your knowledge proves. In this landscape you have proofs with succinct verification. These are what you typically associate with snarks where the verifier runs a lot faster than naively evaluating the circuit or running the program would take. On the other hand, in this landscape you have proofs with transparent setup where you don't have to trust any person, you just have to trust in the hardness of mathematically hard problems. The intersection of these two properties was until recently populated only by a couple of theoretical results. This changed with the advent of the Stark proof system and with proof systems that rely on similar mechanics which in this case boils down to the Frye low degree test. This intersection is also where our contribution lives, which we call darks. It stands for the authentic arguments of knowledge. Another picture in which our work can be situated is that of the compilation pipeline for snarks where you start with a computation at the start and transform it in various stages until you get a concrete snark for that computation at the end. In recent years, focus by the community has been on the cryptographic compilation phase and in particular by instantiating it with a polynomial commitment scheme as the only cryptographic tool involved. Since it's the only cryptographic tool involved, all trust assumptions are restricted to the polynomial commitment scheme and in particular this automatically gives you a universal snark. If you need to trust the polynomial commitment scheme, you only need to trust the setup once and then you can reuse the public parameters to generate snarks for any circuit and that's the definition of universality. On the other hand, if you don't have to trust the polynomial commitment scheme at all, then you have a transparent polynomial commitment scheme and this property carries over to the concrete snark as well. Let's focus on the bottom end of this compilation pipeline because this allows us to illustrate where our contributions are situated. For starters, we propose a new polynomial commitment scheme based on groups of unknown order. We propose an information theoretic formalism for abstract protocols that are amenable to instantiation with a polynomial commitment scheme. We call this abstract protocol a polynomial IOP and we propose a compiler to transform polynomial IOPs using our dark polynomial commitment scheme into concrete snarks. When you read the paper, you may notice that we ask and answer questions related to these points and also provide a couple of extended evaluation protocols. But in the interest of time, my presentation will focus only on the colored blocks, starting with a polynomial commitment scheme based on groups of unknown order. In a polynomial commitment scheme, the prover possesses a polynomial consisting of lots of coefficients. I think a million coefficients or more and obviously he can't send all those coefficients to the verifier because that would make the proof large and the verifier slow if the verifier has to read all of those coefficients. So instead of sending all of those coefficients, he will send a short commitment and it's a special kind of commitment because it allows the prover at a later point in time to prove that the polynomial evaluates to a given value y in the point z. We require this commitment to be binding so after sending the commitment the prover cannot change which polynomial it commits to and we require the proof to be extractable. Meaning that there is an extractor machine that can engage with the prover to extract this polynomial by running the prover multiple times on the same randomness and so on. So what does the evaluation protocol look like? We're going to build this evaluation protocol and by the way since the verifier is sending only public coins we can turn this protocol into a non-interactive proof using the Fiat-Chemere heuristic. We're going to build this protocol from a special homomorphic commitment scheme tailored to polynomials that's itself simpler than a polynomial commitment scheme. So the prover possesses a bunch of coefficients and the verifier possesses a short commitment to this polynomial in addition to a point z and the evaluation point y. In the first step the prover splits this polynomial into two parts the left half and the right half and he commits to both halves independently. In addition to that he evaluates each half in z thereby giving y left and y right. The verifier needs to be able to check that this concatenation matches. This is a special check performed on the commitments but it pertains to the concatenation of the polynomial coefficient lists. If the concatenation check matches then he produces a random scalar alpha which he sends to the prover and the prover uses this random scalar to combine the two halves into a new polynomial. And on the verifier side this scalar is used to combine the two evaluation points into a new evaluation point and the two commitments into a new commitment. And if you look carefully what's claimed about the blue polynomial the commitment and the value is mirrored exactly by what's claimed about the brown polynomial the commitment and its value in z. Except the difference is that the number of coefficients has been decreased by a factor of two. This screams recursion which you can indeed apply and after a logarithmic number of rounds you end up with a constant polynomial which you can send over to the verifier in the clear and you can check the requisite relations there. Of course this commitment scheme does need to provide the verifier with certain capabilities. Firstly the commitment needs to be able to commit to elements from an infinite set. We're dealing with arbitrary polynomials but we want to send only short messages to the verifier. Secondly the verifier needs to be able to compute linear relations on commitments that carry over to the polynomials they commit to. And thirdly the verifier needs to be able to verify this concatenation of coefficient lists which boils down to multiplying the red polynomial by a monomial and then adding the two to check it against the blue polynomial. So this is in essence verifying a monomial relation and how do we do that? The answer we came up with is based on the groups of unknown order. We know two such groups and it really doesn't matter too much how they work because you can use groups abstractly. In the RSA group you need to sample two large prime numbers and multiply them and then forget those large prime numbers. And unfortunately you do have to trust whoever produced those prime numbers to forget them and that's why the RSA group comes with a trusted setup. On the other hand in the class group you just need to sample one large prime minus delta and that defines your class group and you don't need any secret coins to sample such a class group. Unfortunately neither of these groups are post quantum because there is a quantum algorithm due to Peter Schor for finding the order of a group. In terms of hardness assumptions we require the strong RSA assumption and the adaptive root assumption. The strong RSA assumption has been around since forever whereas the adaptive root assumption is very new, slightly more than a year. But despite its young age it's the complete opposite of the strong RSA assumption. The strong RSA assumption asks the adversary to compute any root of a given random group element whereas the adaptive root assumption asks the adversary to compute a given random root of any group element. The cool thing about these hardness assumptions is that they are falsifiable. So what are groups of unknown order good for? In a phrase they're good for deophantine arguments of knowledge. Deophantine refers to the fact that we consider equations where all coefficients and all variables are integers. For instance Fermat's last theorem pertains to a deophantine equation. Pell's equation is deophantine but your average trigonometric identity is not deophantine. Fortunately there is a way around that. Arguments of knowledge refers to the fact that we're going to represent our computations as a system of polynomials over the integers and then prove that we know the remaining variables such that this polynomial evaluates to zero. Now if you've been paying attention carefully you'll notice that there is a slight discrepancy between what deophantine arguments provide which is arguments pertaining to integers and what we need from the commitment scheme which is arguments pertaining to polynomials. So we need to find some way to represent polynomials as integers in a way that makes sense for linear and monomial arguments. And the solution we came up with is best illustrated with an example. So let's consider the polynomial whose coefficients are 2, 3, 4 and 1 living in the field with 5 elements. The first step is to choose an integer q larger than p preferably much larger than p. So let's choose q equals 10 for our example. In the second step you lift the polynomial to the ring of integers or rather you lift the polynomials coefficients to the ring of integers. This doesn't change the coefficients of the polynomial but it does change how you evaluate and multiply the polynomial because you never reduce modulo 5 or modulo anything anymore. And in the last step you evaluate this integer polynomial in q applied to our example that gives you exactly the coefficients 2, 3, 4 and 1. But notice that this is an integer even though we started from a polynomial over a finite field. This encoding has interesting homomorphic properties. For instance a linear relation applied to encodings of polynomials is the encoding of the same linearly transformed polynomial. And there's a similar homomorphic property for multiplying polynomials. Multiplying encodings gives you the encoding of a product of polynomials. Unfortunately these homomorphic properties only hold as long as there is no overflow in every digit base q. So in particular if q is large enough then there is no overflow and these homomorphic properties will hold. So how do we build that abstract commitment scheme by using groups of unknown order? Well the commitment function is just raising a given group element to the encoding of your polynomial.  However verifying monomial relations is still difficult. In particular in order to verify this concatenation the verifier needs to raise the commitment to the right half of the polynomial to a very large power in order to simulate multiplication by the appropriate monomial. The solution we came up with is for the prover to send both the input and the output of this computation. So he sends a commitment to the right half of the polynomial and a commitment to that right half shifted. And then the verifier just checks this exponentiation relation which is not expensive actually because this is exactly the problem that Wieselowski already solved a year ago with his proof of exponentiation. This completes the picture of the polynomial commitment scheme based on groups of unknown order. Let's move on to the theoretical formalism and the compiler. The theoretical formalism we came up with we call a polynomial IOP where IOP stands for interactive oracle proof, which is a type of information theoretic abstraction of a proof system where the prover can send oracles to the verifier. And the oracles in our abstraction are exactly the polynomials. So the prover sends polynomials to the verifier and the verifier doesn't read these as sequences of coefficients, but rather the verifier has oracle access to these polynomials, meaning that he can query them in points z and he will get the response f of z in return. The verifier also gets to challenge the prover with random scalars and this interaction can be repeated any number of times before the verifier outputs accept or reject. Any abstract protocol that is captured by this formalism we call a polynomial IOP and in fact it's quite surprising that there are snarks that can be captured as such. Now in order to compile a polynomial IOP down to a cryptographic proof system you have to get rid of the oracles somehow. So let's exchange the polynomials with commitments to those polynomials. And whenever the verifier makes a query to one of the oracles the query is forwarded to the compiled prover and then answers with the appropriate values which consist of the evaluation in the point z, what the verifier asked for, as well as a proof of correct evaluation pi. The compiled verifier verifies this proof and forwards the evaluation point to the IOP verifier. And whenever the verifier produces a challenge alpha it's just sent to the prover without interception. Now this proceeds as it would for the polynomial IOP protocol and when that verifier outputs accept or reject the compiled verifier make sure that all the polynomial evaluation proofs check out and if they do and the IOP verifier output accept then the compiled verifier output accept as well. That's all fine and dandy but how do we demonstrate that this compilation is sound? In order to make that argument you have to show that there exists a compiled protocol extractor with access to the same interface that is available to the verifier and in addition with the capacity to reset the prover to an earlier point in time. With this information the extractor should be able to extract the witness of this protocol of this proof system in polynomial time. And that's a bit of a daunting task but you are allowed to assume the existence of an IOP extractor with access to the verifier's view of the polynomial IOP protocol and with the capacity to reset the IOP prover to an earlier point in time. But even that doesn't complete the picture because the IOP extractor expects to see polynomials whereas the compiled extractor only has access to commitments evaluation points and evaluation proofs. There is no way for the compiled extractor to simulate the IOP extractor unless he knows those polynomials and that's exactly why we require from the evaluation proofs that there is another extractor that can extract the polynomials from those evaluation proofs and that completes the picture and argument for sadness. So much for the theoretical background let's consider the last step in our compilation pipeline where we get concrete snark constructions. When we started working on this project there was this interesting result called sonic which is a snark which has a one time trusted setup whose public parameters you can then reuse for any circuit that property is called universal. And it already separates to some degree the information theoretic protocol underpinning the actual protocol and the polynomial commitment scheme and they instantiate the polynomial commitment scheme with the KZG scheme. And so obviously switching out the polynomial commitment scheme for our polynomial commitment scheme gets us from trusted setup snark to trustless setup snark which is really cool. At the same time that we were working on our improvement to sonic other groups were working on their own improvements to sonic giving Planck and Marlin which also feature the same separation and therefore are also amenable to the same switch. So you can obviously also apply the dark polynomial commitment scheme to the Planck IOP and to the Marlin IOP and still get a trustless setup snark or if you insist on using the RSA group you get a structured reference string of constant size as opposed to the linear size structured reference string associated with the KZG polynomial commitment scheme. In terms of numbers for around a million gates and security level 120 bits depending on which IOP you use you get between 10 and 15 kilobytes of proof sizes but the more interesting point is how it compares how does our scheme compare to alternative schemes. So compared to Planck and Groth 16 the proofs are larger but our proof system can be transparent. In comparison to bullet proofs the proofs are larger but our verifier is a lot faster. And in compared to the Fry based protocols Stark and Virgo well they're all transparent and the asymptotics are the same but the concrete size is much better in the case of supersonic. We're at 10 kilobytes whereas they are in the hundreds of kilobytes. This brings us to the conclusion of this presentation. In this work we study the generation of transparent snarks from class groups and we provide a theoretical framework in which such a construction fits. As a result of studying this framework we come to the conclusion that essentially all snarks have a dark analog and can therefore be made transparent if you are willing to trust the security of class groups. Open questions raised by this work have to do mostly with the exact security of class groups. If there are other ways to generate groups of unknown order preferably in a trustless way that would be very interesting to read about. Furthermore by separating out the cryptographic tools we have a polynomial IOP that we can optimize without regards to the cryptographic compilation process. Lastly there's a theoretical question surrounding the security proof in the random oracle model versus a security proof in the standard model that arises from applying Fiat-Chemir heuristic for multiple round proofs. In future work we're going to look at improving the protocol even further and we're looking to have implementation statistics. Thank you.


rise as well, so we want to make sure we save special attention to those. They tell you to report a bit domestic in progress. The 3,600 block up right away. There's a male punching a female. Can't work. We didn't know what to do. We're always told to protect ourselves. But nobody shows us how. Here we had all these women. We kept hearing these stories and attending calls one after another. They needed help. They didn't know how to protect themselves from violent encounters, partners, intimate relationships that they were having, stranger attacks. Someone had to step in and teach. And that's how it all began. That's how the women's personal safety team started. Our first workshop was in 2013. And the goal was to educate, inspire, and empower women to take ownership of their personal safety. The WPSC workshops were done and meant for all women. We teach specifically designed and simple tactics. That can be learned and remembered with no prior training, regardless of physical abilities. What started as only a handful of volunteer police women is now over 30 sworn female police officers. These women all volunteer their time. Find your voice. Find your fight. Find it with us at the women's personal safety team.


Hi, good morning and welcome to today's products and focus so following on from the Greek deal yesterday We now have a deal with Iran Iran and other global powers over their nuclear The nuclear deal and lifting up potential sanctions So that's going to be adding a little bit of positive momentum today real strong day yesterday on the US 30 And the same across many other markets well with the Germany 30 album with 3% You came on hundred up 1.7% But Greece still needs to get this deal through Parliament But already there's been some resignations There's been people leaving the Theresa party to clear the way to make this actually happen It does look unfortunately that Greece has been squeezed quite hard in this deal And we jury still out to see how the great people deal with it, but nevertheless Markets are reacting quite strongly look to be capped on the US 30 by that 55 period SMA Bullish cross on the MacD the other technical still relatively neutral indicating there could be further room from maneuver UK 100 is actually is making up lost lost ground from its move yesterday And as you can see we actually reached 67 71 Yes, the only to get pushed right back down again. In fact, my apologies. I'm not actually up So much further today on the other UK 100 But we are Slight spinning top formation right here And we are not able to Push on that little bit higher. So 67 71 as the potential resistance We've obviously got pushed right back down towards the end of the session there And we have not really done a huge amount. So again across over on the MacD other technicals are neutral So looking at Japan 225 However, it is actually pushing on a little bit higher Managing to eke out a little bit of positive momentum Beyond both moving averages and above 2087 with 2868 being the next potential resistance Now tomorrow is the FOMC Okay, so Janet Yellen's going to be giving a statement people will be looking at that for any hawkish Comments about US interest rates, which obviously take the massive back seat when Greece was imploding and China was failing and The Iran deal was hanging on by a thread Um, it'd be interesting to see how that pans out and dollar yen is going to be keenly in focus for that uh dollar yen Has got a good possibility here should Yellen statement be particularly bullish for the green back. We could see some decent gains here Um, but that's seven seven o'clock UK time tomorrow 124 42 remains to be the short term potential resistance That's a level that needs to get broken if we're going to challenge 126 And obviously that happens japan 225 somebody out of relationship. It will continue to push on higher Crude is dumping as we speak as the Iranian deal looks to be getting solidified right now I can actually see it across A number of news channels As we record in this video So we're looking at 49 40 has been the next potential support level almost Texas crude as it looks like Iranian Crude supply could be entering the market at some point in the future Now moving on to uh onto gold, uh, as ever that giant yellen's statement tomorrow fymc What could have a profound effect on gold? It does seem to be the point that she has double. She doesn't seem to have that much of a positive effect But if she's hawkish, maybe it'll have a bigger bigger impact 1137 is the next potential support level on gold If we have a look at euro dollar And recently it's kind of flip-flopped and reversed Tweezer top here trading below one spot 11 now as one spot 07 86 being the next tech max potential support I'm kind of interesting to see the impact that that the next greek Parliament session has on the euro because obviously if they project it maybe things get a little bit more dicey And if we finish up with gbp usd, so we drew this kind of downtrend line on here Seems to be holding currently Gbp on the back yet again Kind of close to potential support one spot 54 20 for trading below both moving averages And the technical indicators RSI still got further to go Slow stochastic just about to go oversold but not quite there yet So economic data wise already been bunch of german data came out pretty much as expected out of cpi Later on this morning 9 30 am uk time. We've got cpi ppi and rpi Then we've got euros on industrial production german zdw business support that one's always important And us retail sales that will be keenly watched today So make sure you don't forget that make sure you've got your alert set for that And if you look on wednesday, remember fomc at 7 p.m uk time unemployment claims ppi for the us and your crude oil inventory data release which will Probably not be as big as the Iranian deal, but still it could add extra weight onto a text with crude So as ever guys keep you on the chart forum make insights part of your leg going forward and join me again tomorrow to find out what happened next


You know when I first embarked on my quest to become more successful like holistically in my life There was one domain that I constantly hated when people brought up You know, I was hearing all these interviews and all these success stories on podcasts And I was trying to emulate their success and so many entrepreneurs said the same thing You have to do the mindset work and they would give these like generic pieces of advice like that And I'm trying to figure out how to get fit how to attract girls how to build a business how to be happier They're like you have to do your mindset work And I thought it was the most annoying and irritating thing I'd ever heard But in this video, I want to share five practical changes you can make in your mindset Because it is true on some level you have to make these inner shifts for the outer shifts to occur So I want to share these five mindsets with you now What's up guys Alex Hein author of the book master of the day FYI half this book is on some of those mindset Secrets now one of the best ways to get started with changing your mindset setting your goals Changing your life is to actually plan out your year So the first link in the description is a free goal-setting worksheet to help you plan out your year and do just that You also get an email every few days on how to set goals that can radically change your life So go ahead check it out down there below So let's talk about the first mindset shift that can really change your life You can change All right, and I know that might seem a bit trite and a bit kind of sarcastic But if you don't believe you can change you'll never try When I was a young kid, I was super introverted. I never spoke my family was even worried about how little I spoke and interacted with other people and I was just nicknamed invisible boy by a girl I just never talked. I was like the cut the classic silent judgy introvert and for 25 years I believe that I was the quiet introvert who never spoke which was just a story But guess what because I believe that I never tried to be anything other than that quiet introvert Because I believed I could not change.  You won the reincarnation lottery Because you can change you should to improve your life You can change aspects of your physical appearance. You can lose our gain weight You can change your hairstyle. You can change your bad habits and behaviors You can change the things that are good about you or the things that are bad about you So if you believe you can change you're gonna try The second big mindset shift that is really important in this era is that no knowledge is hidden Okay, guys when I was a kid, there was no friggin internet. There was no social media So there was no example for me of the kinds of people building these incredible lives I wanted to have there was no evidence of that because all I saw was what was around me The fact that you're here now watching this video and I'm telling you you could be whatever you want to be Jimmy That's insane. That's awesome. And that's an advantage When I wanted to build my business when I was 24, I Didn't know how the hell to build a business. I didn't know what I was doing But the amazing thing is with the internet you can find almost anyone almost anything you want to do unless you're like The first in history someone's done what you're trying to do and you can just figure that out by modeling them and emulating them You know when I was a kid again, I couldn't go to medium or Cora or YouTube or listen to a podcast I figured I don't know if this is possible. I guess not. I mean, maybe I'll just have to be the first then There was no self-confidence there So you can figure out almost anything The third mindset shift that helped me a lot was that it only takes an hour a day to improve your life to change your life Now when I was first first first in a personal development It was 17 or 18 and like so many young men. It was because I wasn't getting any girls I was perpetually single. I was like a nerdy friendly nice guy I was a good guy, but I wasn't exactly like the first pick for women You know, I was the guy where women are like, oh my god. I'm gonna marry your son. Mrs. Hine they'd say that to my mom. I'm gonna marry your son and yet none of them would even date me So it's like look, I'm just being honest with my young guy But I'd rather you want to sleep with me then say you want to marry me because this is weird what are these mixed signals and that pain is what got me into personal development and There were a lot of things I wanted to work on. I wanted to be more attractive I wanted to improve myself be more fit have better style have better conversational skills be more interesting have a cooler life go after my own dream But I don't know how to do it Like that's a lot of stuff to want to change about yourself That's a lot of stuff to have to work on and it wasn't until later in life where I found Earl Nightingale And he said it just takes an hour a day and Guess what? You can get off work or get off school at four five six Just spend one hour improving your life and have all night to freakin watch Netflix or do whatever you want to do play World of Warcraft If you just dedicate that one guilt-free hour per night You can spend the rest of the day doing whatever you want and still make amazing progress The fourth mindset shift and this is a juicy one is that you deserve it You deserve to be happy.  I waited until 29 to grow up to my biggest passion Which is studying integrative medicine and doing my doctorate in Chinese medicine because it really cured my lifelong GI problems I Waded 29 years to do a dream that I knew over 10 years ago Because I was too afraid I wouldn't be able to make a financial living and that people would not take me seriously all fear Guess what? It was not until I was 29 where I realized that you know what number one I'd become an entrepreneur who could finally support himself financially But I knew that life was what you make it and I'd lived it I built a company from scratch and I wasn't rich, but I could support myself So I knew okay if this is my dream my passion and it's gonna cost four years and it's a hundred twenty thousand dollars Before my living expenses How can I so you know what I did? I I promise myself Alex? I'm gonna work 20 hours a week my whole doctorate now one student in the whole damn school of 600 people is doing that I Promise I would and the first year. I lived in a $500 a month apartment That was almost one-third the rent I was paying back in Connecticut and I chose to suffer and Downgrade and not be happy where I live so that I could have a better future four years from now I would work 20 hours a week the whole time I would live in this the cheapest apartment I could find and I would grit and bare my teeth and continue to build my business and if my business failed I'd work in a friggin coffee shop or be a bartender and That just that shift from how can I? That shift to how can I?  Tell me how they work out for you Now before you go the first link in the description is for a yearly goal-setting worksheet to help you plan out Not only the mindset shifts, but the tactical habit shifts to improve your life So you can click the first link below to download that free guide You'll also get an email every three days Which is a goal-setting email course on how you can set and achieve your wildest goals this year After you check those out come on over check my last two videos right there and


Hello everyone, this is Melissa Armo with the stop swashin' and reviewing here IBM. This was a option trade that I called last week. Actually it was, yeah it was last week. I called the 150 puts and I called them out for a good solid month so they don't expire to June 16th. This chart looks great. I mean this looks amazing. Here's IBM, let me show you something, and here's the market. The market is making highs, almost brand new, all two highs once again, very, very close. Within 40 cents or 30 cents this morning and IBM looks like it's going to break down and fall off a cliff again. So this looks amazing. What you're waiting for now, if you're in this trade, is the break through here of the last low, which was 149.79, which will be through the strike. But really the targets for this are, I mean this is a lot of targets, 146, 145, 140 would be a dream target in this, it just depends how soon it takes to break. The sooner this breaks, the deeper this will go and the bigger the move this will have in the couple weeks left in this. So nice move here for the IBM and looks like another good call that's playing out. For the market to be this strong and IBM to be this weak, this chart has been lower ever since this gap down that happened here in the earnings back on May 5th, I've been watching it, had called already one put that went and was a huge trade in here. This was the 155 calls, it dropped $5 into the money on this one, now there's a second one in play and it looks amazing. So we'll say good luck everyone, good luck everyone in IBM and have a fabulous Memorial Day weekend. If you're interested in more information to sign up for the gap options letter, email me at balissa at thestockswish.com.