From a governor of Ugunstay to Bikulia, Mosul says a step down from running for the presidency for the unity and progress of the all-progressive Congress APC. Mosul was speaking at a welcome party organized for him by his supporters. If I wanted to be president of Nigeria, I cannot be president of all of us in Nigeria. Of all of us in the entire South, of all of us in South West. Now it goes to the point that we realize when our brother comes from the North, when they are even rooting to say we want presidency to go to the South. All of them, even our fathers, everybody calling on us to say that if we want presidency to come to the South. Yes, we must find a way, all of us, to unite. We must find a way to draw all this, our personal ambition in the interest of the overall interest of all of us in the entire South, and particularly of all of us in the South West. What I want you to do, all the love, all the support, all the prayer that you have been giving to me, I'm not saying you should stop, continue to give me that prayer. Let's please, extend that prayer to our party at the National Assembly. When you come to a good state, it's Ambulso all the way. He is the one in charge of this state. He has the controller, he has the massive support of the people. This is somebody that the people love exceptionally, so and that's why I'm part of parcel with him. It's all about service, it's all about it's all about doing for your people and you can see the response, the overwhelming love, sincere love they have for him. Any day, any time, he's a crowd puller. No matter how short the notice is, everybody will surely come out to welcome him, to praise him, to grace his education he appears. And of course, it's just after the hearts of so many people. Hello, hope you enjoyed the news. Please do subscribe to our YouTube channel and don't forget to hit the notification button so you get notified about fresh news updates.


Welcome to the 12th meeting of session 6 of the Delegated Powers and Law Reform Committee. Stuart McMillan has sent his apologies for the meeting. I welcome Jenny Minto, who is substituting for Stuart today. Before we move on to the first item on the agenda, I remind everyone present to switch mobile phones to silent. The first item of business is to consider an instrument made under the European Union Withdrawal Act 2018. The committee is considering if the appropriate scrutiny procedure and the appropriate categorisation has been applied to SSI 2022-90, the official controls, transitional staging period, miscellaneous amendments, Scotland regulations 2022. This instrument makes exemptions for some official controls for certain animal and plant products being imported into Scotland from Northern Ireland and the Republic of Ireland. The instrument has been laid under the negative procedure and is considered by the Scottish Government to be of low significance in correspondence with the Scottish Government. The committee asked whether it agreed that a choice of procedure was available and, if so, for further explanation as to their choice of a negative procedure. The Scottish Government confirmed that there was a choice of procedure and that the negative procedure was considered appropriate due to the limited impact of the amendments made by the instrument, which will apply for a limited time. I ask the committee content that the appropriate scrutiny procedure and categorisation have been applied to this instrument. Under agenda item 2, we are considering an instrument subject to the made affirmative procedure and no points have been raised on SSI 2022-123, as the committee content with this instrument. Under agenda item 3, we are considering an instrument subject to the negative procedure and issues have been raised on three of these instruments. The first is SSI 2022-90, the official controls, transitional staging period, miscellaneous amendments Scotland regulations 2022. As noted under item 1, those regulations make exemptions from some official controls for certain animal and plant products being imported into Scotland from Northern Ireland and the Republic of Ireland. The intended effect of regulation 2 of the instrument is to exempt imports of certain animal origin goods that are produced in Northern Ireland and the Republic of Ireland from a pre-notification requirement to the Border's Control Authority. In correspondence with the Scottish Government, the committee asked whether the absence of a reference in regulation 2 to the Republic of Ireland was intentional and where related provisions refer to both Northern Ireland and the Republic of Ireland. The Scottish Government confirmed that this was a drafting error and that reference to the Republic of Ireland should not have been included. It is committed to rectifying this error by making a further amendment in an SSI that will be laid in the Scottish Parliament at the next available opportunity. Does the committee wish to draw this instrument to the attention of the Parliament on reporting ground 1 that its drafting appears to be defective due to the error in regulation 2 of the instrument? No one is other minded, so the committee will draw that instrument to the attention of the Parliament. At the same time, does the committee wish to note the Scottish Government's commitment to rectify the error by making a further amendment in an SSI that will be laid in the Scottish Parliament at the next available opportunity? Issues have also been raised on two instruments made under Local Government Finance Act 1992 for failure to lay them in accordance with the requirements under section 282 of the Interpretation and Legislative Reform Scotland Act 2010. The 2010 act requires that instruments subject to the negative procedure be laid at least 28 days before they come into force, not counting recess periods of more than four days. The first of those is SSI 2022-124, the Council Tax Exempt Dwellings Scotland Amendment Order 2022. Those regulations amend the Council Tax Exempt Dwellings Scotland Order 1997, so the Council Tax is not charged on dwellings that are exclusively used as a sole or main residence of those who have left Ukraine in connection with the Russian invasion and who have to leave to remain or enter the UK on a right to abode in the UK. The second instrument is SSI 2022-125, the Council Tax Reduction and the Council Tax Discounts Miscellaneous Amendment Scotland Regulations 2022. The instrument amends specified Council Tax Regulations to provide that the entitlement to the single person discount from Council Tax liability and under the Council Tax Reduction scheme is not affected by offering accommodation to certain persons coming to the UK from Ukraine in connection with the Russian invasion. In correspondence with the Presiding Officer in relation to the two instruments, the Scottish Government explained that the Homes for Ukraine scheme was launched by the UK Government on 14 March 2022. Due to the nature of the scheme, it has the potential to increase the level of Council Tax liability of those who accommodate Ukrainian refugees and was not able to be fully assessed until the scheme was launched. The Scottish Government also stated that, given the urgent nature of the need to change the law on this occasion and the short timeframe from when the Homes for Ukraine scheme was launched and the beginning of the 2022-23 Council Tax year, it had not been possible to meet the 28-day requirement. Can I ask does the committee wish to draw SSI 2022-124 and SSI 2022-125 to the attention of Parliament under reporting ground JAI for failure to comply with requirements? At the same time, the committee content with the Scottish Government's explanation provided for the breaches of the laying requirements. Also under the agenda item, no points have been raised on SSI 2022-119 and is the committee content with that instrument. We are considering an instrument not subject to any parliamentary procedure. No points have been raised on SSI 2022-120. Is the committee content with this instrument? The next meeting of the committee will take place on Tuesday 26 April. I close this meeting. Thank you.


next write down thermodynamic equilibrium. Sir, yes. And graph is alleromical. No, no, what I was trying to explain here that if you are at point A and if you are coming to this point B, you can have many path possible like this. But when you are at this point B, your pressure will be P2B2 and T2 only irrespective of the path followed. So that is why a pressure volume temperature is a state function. It depends upon initial and final state, not the path followed in this state. But work if you see, suppose work example, if you take this path is small, right? So here if you come here to here by this path, work then will be less. But if you follow this path, work then will be more, right? So work then is what? Work then is path function. It depends upon the path we choose, right? So that's why the path function is what? Anything that is related to work, work or energy, that's what we have, right? Next slide on thermodynamic, thermodynamic equilibrium. What is thermodynamic equilibrium right now? When a system is at, when a system is at thermal, chemical and mechanical equilibrium, then it is said to be in thermodynamic equilibrium. All three equilibrium are there, then it is thermodynamic equilibrium, right? When the system is at thermal, chemical and mechanical equilibrium, it is said to be in thermodynamic equilibrium. Mechanical means when the pressure is same, two side if you are applying the same pressure, it's not moving. Suppose you have an object, you have the same pressure, okay? So it won't move, that is mechanical equilibrium. Chemical equilibrium is what? When concentration is same both side. So if you have a top spinning and it's a, if I have like a top that's spinning, but it's a chemical and thermodynamic equilibrium, then. No, that is see, when you have a top spinning, right? So there's no transliterary motion into this. There's a circular motion on its own axis, right? But the point is you have an object. I'm trying to explain what is mechanical equilibrium. You have an object like this, okay? If you apply some force from this direction, which is nothing but, okay, you're applying some force from this side and the same force from this side, right? And these two will cancel out each other, right? So this is in mechanical equilibrium. So is there any object that's moving is not in thermal equilibrium? Not in thermal equilibrium, yes. No, no, no, not in thermal equilibrium. Thermal equilibrium is when temperature is same both sides. Sir, velocity is constant. What? When the equal force is there, there's no movement into this. There's no net force. Sir, velocity is constant. Velocity is constant means what? There's no acceleration. And the constant acceleration motion we have now. Constant acceleration motion is possible, no? An object can move with a constant acceleration, but it's possible. So that is not thermal, and that's not mechanical equilibrium. When net force, simply one thing you'll keep in mind, when net force is zero, there's no net movement. Then it is mechanically. Constant velocity means access is zero, right? So when there's no acceleration, then you can say, yeah, it's fine. That's fine. Point is, mechanical equilibrium when net force is zero, F net is zero. Chemical equilibrium, when I say, it means, chemical equilibrium is when concentration, concentration is zero. There's no net concentration. And when we say, what is the next one? Mechanical, chemical is thermodynamic equilibrium. Thermal equilibrium is what? When temperature is constant, delta T is equals to zero. Temperature is not right. So when all these three types of equilibrium we have, then it is said to be thermodynamic equilibrium, right? One more thing you can say, thermodynamic equilibrium is defined, right down. Thermodynamic equilibrium is defined. What is T? What is C? Concentration. Concentration. Chemical equilibrium means what? Concentration. Concentration. So that's why, because concentration is zero both side, right? Concentration must be same both side, okay? Thermodynamic, right down, it is, what did you write? What is the first time? Thermodynamic. It is also defined as, as the state where all the state variable is fixed. There's no change in the state variable, right? In thermodynamics, we always deal with, we always deal with the system which is in thermodynamic equilibrium. Always deals with the system which is in thermodynamic equilibrium, okay? Next write down, thermodynamic process. We are just looking at the different terms now. Thermodynamic process. Write down into this. Write down, it is the path by which thermodynamic process. It is a path by which a system is, path by which a system is changing its state, okay? The various different process you write down. Isothermal, isothermal, in bracket this is short to write down, in bracket. Constant temperature. Constant temperature. Isobaric. Constant pressure. Isocodic. Constant volume. Isocodic, C-H-O-R-I-C. Isocodic. There is no exchange of heat. Delta Q is 0. For adiabatic, delta Q is equals to 0. No exchange of heat in this, okay? And we also call it as isocentric. Sorry, isoentropic. Isoentropic process. Entropy will also be constant in this. When delta Q is 0, entropy will also change. That we will discuss later. Entropy we will see after second law of thermodynamics, okay? Isoentropic we also call it as. Next write down adiabatic, okay? And then cyclic process. What is cyclic process? What is cyclic process? It starts and ends at the same state. Initial and final state will be same, okay? Initial and final state will be same. This is an isociclic process. We start from A, goes here, B, and then C, and then D, and then Q. Okay? So cyclic process, initial and final state is same. Is it also reversible? That depends. That depends. It's not necessary. That depends. So same as isoentropic. Say one of them must have an radioactive decay. It will give out another particle and change the rate of entropy. No, I'm talking about delta Q is equals to 0. Heat exchange will be 0. Then it is isoentropic. No, not delta T. So I said if one of the particles inside your system, another radioactive decay, it will give out another particle and change the entropy. What entropy will change? Entropy of system will change. So if the system entropy decreases, surroundings entropy will increase by the same value. Sir, the system entropy will increase. Whatever. If one changes system entropy if it is decreasing by the same amount, the surroundings entropy will increase. And radioactive decay we are not considering. That is a very rare case. So radioactivity we are not considering. So anyways we can write the system if you have isoentropic when delta Q is equals to 0. Radioactivity decay we are not considering. But again if you consider radioactivity decay, system entropy decreases by the same amount surrounding entropy increases. The delta S of the total system of the universe will be what? 0 in that case. One decreases, other increases. So delta S will be 0. So entropy we will discuss later. One very important thing here. In the process we have initial and final state is same. So if you find out the change in all the state function. What is the state function? Any example? Delta U. In internal energy state function, what do you have? Delta U. So what is delta U in a cyclic process? Delta U. Delta U is what? Change in C. If you have first A and B, if it goes to A and B like this, here the internal energy is UA and here it is UB. So what is delta U? Delta U will be UB minus UA or magnitude if you are considering. It is the difference we have. So since we have cyclic process, so all the state function, since it does not depend upon the path followed to gain that state. So that change in all the state function will be zero. So delta U will be zero. Delta G will be zero. Delta P will be zero. Delta T will be zero. Delta H will be zero. Delta S will be zero. All these things will be zero. Delta T will be zero. Delta B will also be zero. So change in state function in cyclic process will always be zero. Very important point. Okay? Since sometimes the conversion of graph is important and you need to do this while solving problem. Suppose you see this graph, we have pressure and volume. A, B and C. This is the graph we have. It is given. Now you need to convert this into PV graph. PV given. You need to convert this into Pt. And you need to convert this into Vt. Vt. Just a second. PV. PV. It is Pt. It is Pt and it is PV. So this graph is given. You need to convert this into PV graph. This graph, you need to convert into PV graph. Suppose it is given. How do we convert this into PV graph? And this into PV graph. Okay? It is similar. Work if you take the time pressure. We are already the same. See, first of all it is important QM. You know PV graph, you know, work done when calculating PV graph, you know area under the curve. You know work done in PV graph is work. Area under the curve. So sometimes if PV graph is given, you can find out the area that will be the work done. Magnitude you can get easily. But sometimes they will give you Pt graph and work done suppose you need to find out. So this area we cannot find out to get the work done. But work done part we will see later. But you see from this graph, can you tell me what is this process? A to B. What process is this? A to B. What is A to C? A to C. What is A to C? Constant pressure. Isoparic, right? It is isoparic. What is B to C? Isoparic. Isoparic. Can you tell you what is A to B? Isoparic. Isoparic because you see this graph is touching this origin. So it is a straight line like this. Which is the constant volume only? Pt graph has constant volume. Passes through origin. A to B is what? Isoparic. Now can you do this? Isoparic means volume constant? Right. Suppose A to B is this. Volume constant. So A to B. And then isoparic is A to C. A to C is this suppose. B to C is isothermal. So isothermal is what? Constant pressure. So temperature which is this? So this is A. This is C. And this is B. A to B. B to C. And C to B. And I guess it is... That is what I told you. See this is... Suppose B to C is isothermal. So how is isothermal graph? Pv graph. Constant temperature is this graph. This one? A to B to C. A to B is constant volume. Isoparic. C to A is constant pressure. Isoparic. Which way? This way. Okay. Because of magnetic field. A to B. Pressure is increasing. A to B. Pressure is increasing. If you do like this. That is B to A. Pressure is increasing. Can you do this VT graph? Try this VT graph once. VT graph you tell me. So isoporic is A to B. So this is suppose A to B graph here. B to C is isothermal. So B to C is isothermal. And C to A is isobaric. Isobaric is constant. Pressure, right? Sorry. Constant pressure will be this. Right? Yes. And will have this. B to C. Pressure decreases, right? Pressure decreases. B to C pressure decreases. And B to C is isothermal process. So B to C. Pressure decreases. Let me write this first. A to B is what? Isoporic. A to B is isoporic. So B will have this. I'll make some mistake. B C is isothermal. So this is B and this is C. And A B is isoporic. So A to B is this. Isoporic. C to C is isothermal. And C to A is. Isoporic. Sometimes they ask you this conversion in question also. If you want graph corresponding to this, what is VT graph? Because if it is VT graph you are drawing. So at constant pressure the line must pass through horizon. Why is it goes to MX? VT PV is equals to what? Minarity. VT graph if it draws a constant pressure we have supposed to pass through. Okay.


time of the year to make a video, I'm overwhelmed. So I'm recording this a little bit early, meaning I'm recording it on Tuesday. John, your video just came out, and so here I am. And I'm gonna do a question Tuesday because I'm making a video on Tuesday, which never happens. Also because doing anything more complicated than a question Tuesday would destroy me. But I'm fine, I'm good. So let's go on to Twitter. Hey, it's question Tuesday, the day that I answer real questions from you, Netflix. I got partway through and then I gave up. Opinions on gerrymandering, that's not really a question, though you did put a question mark at the end of it. I think you should watch CGP Grey video about it. SportsWithJohn asks, why aren't you watching the USMNT? Don't know what that is. Danny makes a great point that the USMNT is almost certainly the United States Mutant Ninja Turtles. Izzy might be adopting two kittens tomorrow. What should she name them? Asiago and Cheddar. Patrick wants to know if I have any tricks for conquering insomnia. I react to stress with sleep. I'm like one of those sheep that gets scared and falls over or those goats. Most of the times I have suffered from insomnia, it has been because I drank caffeine. So I just don't do that. I know that seems very extreme to a lot of people, but I don't have that much of a problem with it. Favorite kind of M&M, peanut. If you could have a fictional person be a guest at VidCon, who would it be? I like this question. Luna Lovegood, Galadriel, Huck Finn. That's a hard one, that's a hard one. I'm gonna have to write a fanfic. Describe your feelings about VidCon being this week. I don't get to think a lot about it. It just happens. I form very few memories because it goes straight from one thing to the other and I never have time to think about anything, but this one's going to be particularly intense I think because we are launching, announcing three things. We are launching membership for the Internet Creators Guild. You can go and become a member of the Guild if you are a creator on the internet. The ICG is basically just a thing that promotes the interests of internet creators. We're also announcing that there will be two new VidCons, which is huge and kind of shocking that it's finally happening. We're doing a VidCon in Melbourne, Australia and a VidCon in Amsterdam. And also, I forgot about this because I can't tell you about it. We're announcing another thing on Saturday, which is tomorrow when this video comes out and I can't tell you about it yet. I'm sorry about that, but we're going to announce it during the Nerdfighter meetup. So you have to be there or be somewhere else slightly afterward because I'm sure people will be tweeting about it. It's the kind of thing that you might want to pay attention to if you live near or in Boston. That's all I'm going to say. On a scale of one to 10, what's your favorite color of the alphabet? I'm going to have to say therapy. How do you feel about avocados? That's an easy one. Also, the multiverse is the addition to that. There's the two-parter. Okay, well, I love avocados. I also love the multiverse. If the multiverse theory is true, there is a universe in which I am an avocado. What color are your socks? It's a good color. And also these colors as well. And that's how we're going to end it. Thank you so much to everybody who took my homework assignment and did it. There were so many letters that I got on Snapchat and Facebook and Tumblr and Twitter. Things like this remind me that we are still doing things with people and not just at people. And also it reminds me that we are a part of how the world creates itself. And I'm very thankful to all the people who took the time to write to someone in their government about something that they were passionate about. John, I would say that I would see you on Tuesday, but I'm going to see you before then. So I will see you very shortly. Good video, by the way, this week.


For me, it's once you meet Anthony, that you realise that he's not just some young kid. He's definitely a guy who does have that strong level of attention to detail, maturity that's needed to organise an event like that. And it's refreshing. It's nice to know that he isn't just somebody who's thrown a bunch of college kids together, he really is somebody who's got a dream and ambition to really make something of the event. And as long as he keeps doing that, then I think people are going to keep turning up.


Russell Fork Pharmacy is your locally owned pharmacy offering fast, friendly service with competitive prices and free delivery. Call<PHONE_NUMBER>. Visit RussellForkPharmacy.com and download our free mobile app for refill requests and more. When the votes are counted on election night next week, many Eastern Kentuckians will have their eyes on a pair of state senate races. In the 31st district, Republican incumbent Phillip Wheeler is seeking his first full term in office but faces a stiff challenge from Democrat Glenn Martin Hammond. Meanwhile voters in the 29th district may do a double take when viewing the ballot as they will be selecting between two Johnny Turners. Democratic incumbent Johnny Ray Turner of Prestonsburg and former Republican state representative Johnny L. Turner of Harlan. In both races, candidates have tried to make the race about national issues, at least on the Republican side. If you're looking at the 29th district and the 31st district and those are the ones that affect our areas the most, both of the Republican candidates Johnny L. Turner and Phillip Wheeler have run ads to say they are Trump conservatives. And I think in the case of Phillip Wheeler, one of his ads actually says you know he's going to continue to keep illegal aliens from coming in here and taking our jobs like President Trump. But I don't really know a lot of illegal aliens that are headed to Kentucky generally and very few are headed to Eastern Kentucky taking anybody's jobs. On the one hand, you know, I suppose it's a strategy as in a down ballot race that you want to align yourself with a popular president or at least a popular president in your area. On the other hand, those issues are not really issues that you handle in the General Assembly. In the 29th district, Majestic believes the power of incumbency will mean the difference in the race. I think Johnny Ray Turner is going to win in the 29th and that has nothing to do with the quality of Johnny L. Turner who if I'm not mistaken had been in the legislature earlier in his life. Certainly Johnny Ray Turner is going to do really well in Floyd County. And Johnny L. Turner, because he's from Harlan County, has probably got some hometown support there. I would look for Knot County to go solidly for Johnny Ray Turner, probably Split Letcher County. So I look for Johnny Ray Turner to win that. But in the 31st district where the two candidates have combined to spend nearly $300,000, Majestic is predicting a much closer finish. That should be a real tight race. Usually you give the edge to the incumbent. Certainly the reason I'm giving the edge in the 29th is because Johnny Ray Turner has been around a while and been pretty successful. That race is really very, very close in the 31st. Stay with Mountain Top News for coverage of the election before and after the vote. Tuesday night you can get real-time election updates by visiting the Mountain Top News Facebook page, as well as by tuning in to Mountain Top TV, WDHR and WXCC for breaking news alerts. And get a complete wrap up of election results by visiting our website, mountain-topmedia.com.


The Federal Reserve is faced with many decisions. Some are made in Washington, where the Federal Open Market Committee meets, others are made at the Federal Reserve banks around the country. Computers help in the process, but in the end, the decisions about monetary policy, the banking system, and many other issues are made by real people. The following are a few hypothetical situations that could occur sometime in the future. The question is, what should the Fed do? Throughout the economy, prices are relatively stable. However, the price of sneakers has doubled in the past month. The reason? A worldwide shortage of rubber. What should the Fed do? The Fed should do nothing because the Fed's responsibility for price stability and the maintenance of the purchasing power of money has to do with a general level of prices, the average level of prices. And we should never confuse that with relative prices, or prices of specific things relative to other things. It's extremely important that we allow relative price changes to occur. We have no power or no intention to try to control relative price changes. And actually, the rise in the cost of rubber reflected in the increased price of sneakers is for people who will stop buying sneakers, which is what you want them to do until the supply of rubber and the sneakers recoup. Prices are going up on everything. CDs up 12% in the past year. Food up 14%. Gasoline up 8%. Overall inflation is at 9% and seems to be rising. What should the Fed do? If it's 9% already, you probably have been sitting on your fanny too long. You should have done something sooner. But if it's 9% rising in the context of the United States and given our history and the importance of the dollar, the indications are, I don't know what else is going on in your scenario, but you would want to restrict the growth in the money supply. That implies that people are spending money on things faster than we're able to produce things. That spending needs to be slowed down to match the capacity of the economy to produce. And the way the Fed would do that would be to make the money supply grow a little bit slower over time so that people's balance of money and goods will be corrected, and that would happen over time. The economy is in the dumps, growing less than 1% a year and seems on the verge of a recession. At the same time, inflation is extremely low. Overall prices are rising at less than 2% a year. What should the Fed do? The indications are, the Federal Reserve could relax a bit and perhaps the money supply might go up a little more rapidly than normally and certainly you would expect relatively low interest rates in that scenario.  Inflation is on the rise. Prices are going up at an annual rate of 7%. At the same time, unemployment is also high. 8% of Americans are out of work. High inflation and high unemployment. What should the Fed do? Well, that situation is a Federal Reserve official's nightmare because of both high inflation and high unemployment. But I think on the basis of both practical experience and theory, the thing for the Federal Reserve to do is to bring the rate of inflation down by adopting a more restrictive policy, which would mean in the short run at least that money growth would slow and short-term interest rates would probably rise. But if we succeeded in reducing inflation, I think improved economic performance would follow and as that occurred, of course, the unemployment rate would come down. Citizens are protesting against Main Street Bank and Trust. They say the bank is closing too many branches and not lending in certain areas of town. What should the Fed do? Very much in the Fed tradition in this area is to be a mediator. The Fed has access to a great deal of information about potential solutions, about models that can be invoked to resolve the difficulty. So we will bring that information before the banks. The banks have to be the change agents here. Not the Fed, not the community groups certainly. The banks have to. The Fed's obligation is to provide that information to the banks. Broad Street Bank is in serious financial trouble. The bank has made hundreds of loans that may not be paid back. Bank examiners from the Federal Reserve discover the problems during their annual inspection. What should the Fed do? As an examiner, it would be my responsibility to bring problem credits to the attention of the bank's management if problems are not properly dealt with. It could result into financial strain on the bank. It may ultimately result in closure of the bank. But we really don't want to get to that point where you actually shut down and close the bank. Because the banks are very valuable to the community. First County Bank is about to go broke. The tiny bank has already borrowed millions from the Federal Reserve. Now it's asking for more. If the Fed says no, the bank will shut its doors. What should the Fed do? This institution isn't healthy. It's failing. It's insolvent. And so it seems to me that it's time to stop lending and if the bank closes, it closes. We should bear in mind that because of deposit insurance, of course most, if not all, depositors will be protected. And so they won't lose any money at all. And there's always the possibility that some other organization will come along and purchase this bank. But it seems to me that in any event we have fulfilled our role and there's nothing further to be gained by extending additional credit to the institution. A tornado has hit the town of Great Plains. The entire county is without power. Many local businesses won't accept checks or credit cards. And local banks are running short of cash. What should the Fed do? The Fed can and has on many occasions made arrangements to make that cash available at night and on weekends. And we will send it out and make sure that the public has plenty of cash to do business with. And we will do whatever we have to do to do that. Well the Fed would immediately get that cash there as fast as possible. That's an unambiguous response. No reserve bank would think of doing anything other than to supply that cash. Those are just some of the decisions the Fed has to make. Some are routine, others extremely complex. And there's not always one answer. Making policy means making choices. Choices that can often affect the entire national economy and the standard of living of all of us.


I have a surprise for you take this wait okay take this come on all right okay yeah let's go and see how it works he's gone he's gone and I don't know how you Come down to see me.  What do I do? Do you ever cut that? Yeah, that's what you want. You want the big guy Oh, see I See that This is the first one. What's your name? I didn't call you. What's your name? I didn't call you. What's your name?


All right. OK. So the main contribution of this next work is a definitional framework for reasoning about key reuse in a very broad way. So key reuse occurs when the same secret is used in multiple ways, either within a crypto system or among different applications. This practice is risky, as we all know, and it's usually discouraged. But key reuse can crop up in some unexpected ways that make it difficult to enforce key separation all the time. So recognizing this fact, oops, I'm not advancing. OK. Hold on. OK. I have to sync my laptop and this thing, so OK. Recognizing this fact, prior works have looked at particular settings where key reuse is safe. So one of the most important and influential papers in this space was one from Haber and Pinkus, where they introduced the notion of joint security for signing and encryption. So they formalized conditions under which it's safe to use the same key pair for both of these primitives. So they start with the standard notions of security for these and augment them to account for certain forms of key reuse. So let's take a look at how they defined security for signature schemes. So the usual experiment starts by running the key generator and handing the public key to the adversary. You'll notice here that I've drawn the signing algorithm as an object that the game makes queries to for performing computations that involve the secret key. OK, so once the adversary has the public key, we execute it with access to the oracles defined by the game. So one of these oracles allows the adversary to sign a message if it's choosing. And so the game just relays these queries and then relays the response back to the adversary. So the black arrows here represent oracles that objects have access to in the experiment. So eventually, the adversary halts and outputs a forgery attempt, and it wins if the ford signature is valid. So now suppose there's an encryption algorithm that uses the same key generator. So what we ask is what happens to the security of the signature algorithm when the adversary has access to this decryption oracle that uses the same key? Well, depending on the particular algorithms in question, this capability can lead to attacks that break the intended security of the signature algorithm. On the other hand, many combinations are provably safe in the setting. So Haber and Pinkus proved, for example, that in the random oracle model, it's safe to use RSA PSS and RSA OAP with the same key pair. So this type of key reuse is pretty common, signing and encryption. For example, a TLS server might use the same RSA key pair for both key encapsulation and signing Diffie-Hellman key exchanges. But the scope of key reuse potentially is much larger in modern systems where applications interact in very complex ways that can be hard to, that prior work just hasn't envisioned. So it's natural to consider how we might generalize the setting of Haber and Pinkus. For example, what about UFC CMA security in the presence of other key operations? Of course, we can consider security properties other than UFC MA. And we can, of course, generalize this more by thinking of what's the secure, just replacing the signature scheme with a generic primitive or protocol. OK, so suppose that pi is defined in terms of calls to some underlying object that defines a set of key operations that can be performed. So we'll call this object the interface, and it's going to define what the set of key operations that can be performed in an experiment. So in an exposed interface attack, the adversary is given access to this interface and may use it in its attack against the game. So this model's key reuse attacks at various levels of abstraction. So for example, if the game is UFC MA and the scheme is the signing algorithm, the interface might expose lower level key operations used by the signing and algorithm and possibly other systems. So for example, if pi is RSA PSS, then the interface might expose textbook RSA or something. So on the other hand, the interface might expose higher level primitive operations, such as signing and or decryption. The scheme might be a protocol that uses these in some way, and the game might capture the security property intended by this higher level protocol. So the model captures a very broad class of key reuse attacks. So let me now illustrate this with a couple of concrete examples. The first is TPM. So TPM is a specification for on-chip crypto processors that provide a variety of security features used in trusted computing applications. One such feature is remote attestation of a host state, which is useful for things like digital rights management. So TPM supports several protocols for remote attestation, many of which use the same key pair. Thus, this of course raises the question of whether these protocols are jointly secure. So suppose we want to study this security of a particular protocol when the adversary can simultaneously execute other protocols all using the same key. As it turns out, each of these protocols is implemented by making calls to the TPM's API. So the API exposes low-level key operations that are common to all of the protocols that TPM intends to support. When a remote server requests attestation of a host state, the host makes calls to this API in order to execute the protocol with the server. This means that when we're analyzing this scheme, we might conservatively model these protocols' execution by giving the adversary direct access to the TPM. So this is what we call an exposed interface attack. And here it's modeling something very realistic. The purpose of the TPM is to provide a hardware boundary for cryptographic keys so that if the adversary has control of the host, it still doesn't have direct access to the keys. So when we're modeling the security of these protocols, we want to consider what happens when the adversary has compromised the host. While in 2013, Asar had all pointed out that this API can be used as a static Diffie-Hellman oracle for the secret key. This significantly reduces the concrete security of TPM's application and it also violates some important privacy properties of these protocols. So our second example of an exposed interface attack involves TLS. So version 1.2 and below, in version 1.2 below, it's possible to negotiate custom parameters for both classic Diffie-Hellman and elliptic curve Diffie-Hellman key exchanges. Which mode will be negotiated and which parameters will be used depends on how the client and server are configured. Different configurations lead to different protocol variants, all of which might use the same long-term secrets. So let's explicitly model the interface that exposes, say, the server's secret key for use in TLS. So the key is used for signing in some variants and decryption in others, but the protocol variants we're interested in both use signing for authentication. So here's where things get a little interesting. In TLS 1.2, the signature doesn't cover the name of the negotiated cipher suite. The cipher suite, by the way, is a string that's meant to indicate what type of key exchange is being performed and what primitives are being used, et cetera. So in particular, the cipher suite, it covers, it indicates whether a classic DH or elliptic curve DH group has been negotiated. These leads to an interesting cross-protocol attack discovered by Mavro-Giannopoulos at all in 2012. What makes their attack possible is this lack of binding of the signed key exchange message to the cipher suite that was negotiated, meaning an ECDH key exchange message might be misinterpreted by the client as pertaining to a classic Diffie-Hellman key exchange. Under the right conditions, this can lead the client to leaking bits of the shared secret. In general, key reuse can lead to cross-protocol attacks when secret key operations performed in the context of one protocol can be consumed in another context. So as before, we might model cross-protocol attacks against TLS by giving the adversary direct access to the underlying interface. In this case, one that exposes signing and decryption operations on the server's secret key. But this attack model is much too strong and because the adversary can use it to trivially impersonate the server. So we'll need some way of excluding these trivial attacks. So jumping ahead just a little bit, our syntax for interfaces will take as input a context string that is meant to uniquely identify the calling application. And in our security experiment, we'll require that none of the adversary's interface queries use the same context as the application under attack. I'll return to this idea shortly. But first, let me return to an earlier slide and fill out some of the details of our main security notion. So first of all, secret key operations in this experiment are specified by an interface. And we model key reuse attacks against the scheme by giving the adversary direct access to this interface. Now, notice that the only purpose that the scheme serves in this experiment is to define how the game interacts with the interface. So for our purposes, it'll be simpler to drop the scheme from the formal definition and allow it to be defined by the game itself. So the new experiment now just involves three objects, the adversary, an interface, and a game. So to reiterate, the interface specifies how keys are generated and how they might be used. And the game specifies how the keys are used, how the interface is used in a particular application, as well as what is the intended goal of that application. We call this setting security under exposed interface attack. Proving security in this setting will often require a property that we call context separability. Loosely, an interface is context separable if key operations can be bound to the context in which they're used. So our syntax for interfaces makes this explicit. Among other things, it takes as input a context string that's meant to uniquely identify the calling application. Our security experiment involves a distinguished context string, which we call the game context. And we require that the adversary's interface queries never use the game context. We'll call this requirement in the experiment context separation. Now in our experiment, we allow the game context to be chosen by the adversary. So here's the main point. For context separable interfaces, we can design applications so that as long as context separation is enforced, the adversary can't use the interface to attack the application. So I should remark that we didn't invent this idea. Context separability is actually a design pattern that's apparent in a number of cryptographic standards. Let me just give one example to illustrate. So one of the systems that we looked at in our paper is the edDSA signature algorithm. EdDSA is a variant of Schnorr that offers several advantages, one being that it's deterministic. And I won't belabor the details of the scheme, but the point I want to make is that, like most digital signatures, edDSA isn't context separable on its own. And this is simply because the syntax doesn't surface an explicit context string. However, the RFC standard for edDSA specifies variants of the algorithm that do just this. For these, a context string is provided as input to the signing and verifying operations so that the input of each hash computation is prefixed by the context. So for certain classes of games, enforcing context separation ensures that signatures obtained by the adversary by interacting with the interface can't be used in an attack against the application. So for example, suppose the application is some key exchange protocol that uses edDSA for authentication. As long as the protocol signing and verifying operations always use the game context, context separation prevents the adversary from being able to trivially impersonate the server. So codifying context separation into our experiment allows us to prove security under exposed interface attack for large classes of applications. Let me now show you how. So our main technical contribution is a composition theorem that relates security under exposed interface attack to security in the usual setting in which the adversary has no direct access to the interface. And the interface is basically only used for the intended application. So our key insight is fairly simple. If the adversary's interaction with the interface can be simulated given only knowledge of the public key, then interacting with the interface doesn't assist it in its attack against the application. So we formalized this idea by the GapOne experiment which asks an adversary d to distinguish between two worlds. In the real world, d is given access to the interface and oracles defined by the game as usual. And in the fake world, the adversary's interface queries are answered instead by the simulator. So intuitively, if there's an efficient simulator such that no reasonable adversary can distinguish the output of the interface from the simulator when being able to play the game as usual, then any computation that involves the interface can be performed without it. So here's the informal statement of our main result. If an interface i and game g are GapOne secure, oops, I have not advanced this for a while, I apologize. If an interface i and game are GapOne secure and g is a secure in the usual setting, then g is also secure under exposed interface attack. So basically, so to rule out exposed interface attacks, it suffices to prove the interface and game are GapOne secure. Okay, returning to edDSA, we prove that the context separable variants of this signature algorithm are secure for any game whose signing and verification operations always use the game context. This generality is the key advantage of context separability. Our theorem precisely specifies conditions for applications under which enforcing context separation is sufficient to rule out exposed interface attacks. So besides context separability, what we need to prove GapOne security is a way to efficiently simulate signatures output by the interface using only the public key. And in fact, there's a well-known technique for doing just that when we modeled had a hash function as a random oracle, but I'll leave the paper, I'll leave it to the details to the paper. So edDSA is an example of an operation exposed by what we call a discrete logarithm interface. The public key of a discrete logarithm interface is some point in a finite cyclic group and the security of this such an interface's application is predicated upon the hardness of computing discrete logarithms in that group. So in our paper, we looked at various operations that a discrete logarithm interface might expose, some lower level and some higher level. Fortunately, I don't have much time to, ooh, not very much time at all, to talk about these, but so I'll just quickly go through our main application, which was to the noise protocol framework. So for those who don't know, the noise protocol framework is used for designing and specifying authenticated key exchange protocols using just three primitives, a Diffie-Hellman function, an AEAD scheme and a hash function. So noise can be thought of as a large set of partially specified protocols called handshake patterns and each handshake pattern has its own security properties and each is useful in a different context. So rather than explicitly define each handshake pattern, noise specifies how messages are processed in valid noise protocols, which in turn determines the set of valid patterns. This makes it, so this manner of specifying protocols makes it possible to reason about key reuse in noise in a very general way. So static Diffie-Hellman is the primary means of authentication in noise. So what we did in our paper was model the message processing rules as a discrete logarithm interface that exposes a host static secret for use in handshake protocols. So the interface specifies how to consume inbound messages as well as how to produce outbound messages. And it also specifies how to update the host state as a side effect. So the interface is also context separable. Noise uses a context string that is meant to bind protocol messages to the handshake pattern in which they're being either produced or consumed. So this allows us to prove gap one security of the interface with respect to a large class of games. This implies joint security of all handshake patterns, i.e. protocols that are interface supports. Our proof required tweaking the processing rule slightly in order to provide context separability under a wider set of applications. In particular, those that meet the restrictions of imposed by the game by the theorem. As for NDSA, we need only to restrict the game's use of the interface so that key operations are always bound to the game's context. So our interface doesn't support all noise protocols because some would give rise to gap one attacks. But in light of this, so our work leaves security of the security of key reuse and noise in open question. Still, I think if you're interested in key reuse and noise, I think you should still read our papers because I think we found some interesting stuff. And that's all I got, so my time's up. Thank you very much. Any questions? I have time for questions. So you applied your result to the discreet log base schemes, right? Is there any problem using? We didn't look, we looked at, so we, you know, we started looking at, I eventually landed on noise as an application because it seemed like perfect for this setting. It seemed like the way noise specifies protocols lets you reason about these kinds of properties in a very simple generic way. I think you could of course apply this to, you could apply this to any other, you know, set of primitives who would, you know, it would apply to RSA or lattice based schemes and stuff like that, so. And in the standard model too, it would be applicable, yeah? Oh yeah, yeah. Thank you. If there are no more questions, then let's thank the speaker again. And see you at dinner.


Wow. You know, not so long ago, I used to work for a commercial open source content management software company, and those conferences had like hundreds of people. Now look at this. It is so great to be back amongst this community. Again, the diversity like we heard from the panel this morning, and the innovation is always so welcoming and inspiring. These days, I had a product and solutions marketing at Veritas, and for those of you who know a bit about us and what we do, you might be thinking, why is someone from the data management space here speaking at Kubicon? Well, as you know, data is the lifeblood, not just of your apps, but really your organization these days, and it's under attack in a way that it's never been before. And it's not just legacy infrastructure that bad actors are going after. We're seeing more and more vulnerabilities that are being attacked by bad actors in cloud native infrastructure. They may not always target that cloud native apps themselves, but they're finding vulnerabilities and using those to land, and then move laterally to infect your infrastructure and your data. And hence all the focus on shift left that we've been talking about already at the show, or maybe better, as Emily Fox said, expand left. I like that a lot better. And hence all the CNCF projects that are focused on enhancing cloud native security, and all the great vendors out there on the show floor with awesome solutions that you should try to prevent bad things from happening. And yet, they still do, as we see from the headlines. But I'm guessing that these days I don't really need to scare anyone in this room about things like ransomware, right? We're all living with it now. But there are also more mundane ways to lose your data. So here are five pro tips, if you will, on how to do just that while you're building applications if you're not thinking about it. Anybody here ever have to deal with a persistent volume claim that didn't quite work out as you expected it to, particularly between regions, right? Or anybody over here ever have an issue where somebody else's code commit clobbered a database, maybe in production even? My point is clearly ransomware isn't the only type of data disaster out there. And as 451 research has found, 22% of the time, data loss is caused by software failure. Back in 2012, Microsoft's Bill Baker came up with this famous and somewhat controversial analogy focused on describing the life cycle of legacy application versus modern containerized apps. Developers traditionally take care of their legacy apps and sickness and in health like pets versus thinking of them as more replaceable livestock. And of course, stateless apps were all the rage then and this analogy gave us a good way to think about systems and infrastructure. But this largely left out thinking about the related data that apps rely upon. And so let's refresh this a bit. In 2013, particularly as containers support more stateful mission-critical apps than ever, I'd actually think about adding in starfish. And now you're like, where's this guy going with his starfish? What is he talking about? Well, fun fact about starfish that you may know, even if you're not a marine biologist, is that unlike dogs or cows, if a starfish loses a limb, it can grow it back from its central body. In other words, they're more resilient to harm in a way that many other creatures are not. And data and data infrastructure needs to be thought of the same way. Can we make it more resilient to keep apps up and running even when some of it disappears, whether that's through malicious encryption or maybe just fat fingers or a configuration mistake? DevOps changed the way we think about apps and infrastructure, bringing together developers and operations teams and their processes and tools, primarily in support of velocity of innovation, right? Stay ahead of the competition through continuing iteration and learning and being agile. I would posit that we need to do the same thing for data and its life cycle, bringing together people, culture, processes and tools to ensure, in this case, resilience. We can do better than 22% of the time software failure being responsible for data loss. We can do better about knowing how to bring back data to power applications when it's attacked by things like ransomware, and we can make the operational aspects of our applications more resilient. So, if you're wondering how to stay out of the negative headlines these days, I think it's through planning for a combination of velocity and, of course, security, right, but also resilience for your Kubernetes apps. And if you'd like to understand how Veritas can help you with getting this right, please come visit us after today's keynotes down on the show floor. And with that, thank you and enjoy the rest of the show. Thank you. Thank you.


What's up everybody Jason for jazby's case first calm 2021 flawless collegiate football 1 box picker team number 8 sells out with this random number Lock here that contains the Jaguars 49ers bucks and cartels you get a piece of these teams for a fraction of the price And again, you get a random number from 0 39 and we go by the first number on the left side of the serial number dash So those are your examples there or any one of ones go to spot 1 any redemptions go to spot 0 Dish really here customer names from Donald down to Brittany who gifted this to Steve. So there you go And I've got Donald there as well because what we're gonna do here guys is we only sold nine spots Instead of selling ten out. We're gonna give away one free spot. So here's the dice roller when we roll the dice We're gonna give away one free spot customers here number one gets a free spot We'll paste you in right here in this list and we're randomized customer names and numbers with the same dice roller So good luck roll it We got ourselves a six and a four ten times. Good luck Customer name number one gets free spot one two three four five six seven eight nine ten Boom ten times Gail congratulations free spot for you put a little character sign right there and Six times or sorry not six times ten times six and a four Cuz my names and teams now are numbers one two three four five six seven eight nine Ten come on ten load Sorry guys, it's loading still for like round door has been very slow as the last few weeks Donald down to mark Ten times down the numbers one two three four five six seven eight nine Ten seven down to four So Donald with seven as well as three mark with two Bernie with six Steve you have number eight CJ last Bombo on our last one module any one of ones Gail your free spots of five chat with any redemptions Gail with nine and mark with four So there you go guys And again, I just got to do one more R&B randomizer for the 12 teams that were remaining that also sold out And then we could do the break after that. So appreciate you guys. Good luck


This is a statement from the CBA 9 Youth Conference, and I'm going to read it, and I hope we get some lessons from it and some recommendations, and I go. With the participants of the Youth Conference on Community Disadaptation, working under the theme of youth as a catalyst for enhancing effective community-based adaptation, having deliberated on various things in the conference which do the following things. First, I want to thank the government of the people of the Republic of Kenya for hosting the Youth Conference on Community-Based Adaptation and for their hospitality and well-being. We commend the Ministry of Environment, water and natural resources of the Republic of Kenya for officially opening our conference and expressing satisfaction with the fact that young people are being incorporated into climate change negotiation processes. We are grateful also for all the partners that we had who came in partnering with us to make it a success. We also wish to recognize that climate change not only presents huge challenges, but as well presents opportunities for young people which come in through technological innovation and green jobs. We wish to note that the UNHC COP21 will be held in December 2015 in France, Paris. We'd like to acknowledge that the activities of the UN and intergovernment organizations addressing the climate challenge are supposed to incorporate our efforts as young people as well. We acknowledge the value of intellectual and practical contributions by policy makers and technical experts in community-based adaptation. Informed by following challenges that climate change poses on the macro and microeconomies of our countries and opportunities and challenges faced by both youth organizations involved in CBA including resource constraints, limited capacities and inadequate space for youth representation in policy and decision-making processes, inadequate institutional mechanisms for youth engagement and inadequate technology for support in terms of innovation for young people. We chose to consider that the success of youth engagement in enhancing adaptation actions to climate change in several countries, the need of staking out success stories such as the due collection technology developed by young person in Manila and presented at the youth conference at Hyde and the commitment of youth organizations to significantly contribute to building climate resilience communities by strengthening group entrepreneurship and to share experiences and based on all of the challenges and considerations, this is what we resolve as young people to do it. That we also, as we present this, I wish to take note because it's really important for us, it's from our hearts, I mean, we have youth CBA at every upcoming CBA conferences. We get to present the outcomes of this for to our governments, of these programs to our governments, communities, private sector and other stakeholders and at upcoming national and regional climate change and environmental consultation meetings. We are taking this to all the meetings, there's no stop here. Hold, follow up meetings with youth organizations in public CBA to build youth national alliances on CBA. It's not a one of being, it's a process and that is what we are setting out to us young people. How youth representatives are engaging meaningfully and supported as government dedications to all conference of parties and other regional negotiation platforms on climate change. We are asking for space and we are getting the space I trust. To realize the state of these organizations, we the youth seek that. The youth CBA conference be convened parallel to the main CBA, but have a day designated during the main conference for Europe. We had parallel processes, we didn't have time to come over this other side as hand people and this is what we say that we need to come and engage with you as well. Additional resources be mobilized for youth, let the CBA initiatives and mechanisms be reviewed to increase access to already available financial resources. For instance, established CBA youth climate fund. And I mean we have young people who are engaging in CBA, but the issue is the ease to access financial resources. So how do we go about this, how do we review our mechanisms to get to see to it that young people who are taking practical solutions on the ground are able to get this out of the way. Our capacity in CBA be enhanced through training, mentorship, programs and mainstream climate change and environmental education in national education character. And promote for active youth-sensitive artistic order planning. I know in our planning session for CBA maybe it's artistic order, but our space, we were informed yesterday in a presentation that there was a presentation for an African application for talking about young people, but there was no young people in our meeting. So I wish to be informed or I seek to, for justification of that, how do you discuss young people and we are not there. So we need that space, right? And actually we seek that participatory youth inclusive approaches be used to develop effective community-based climate information systems, technologies and innovations. And in this we promise that we can play a key role in technology transfer. We have so much technology in our institutions, but we have a gap between institutions and the community. So how do we come in as young people to transfer technology? Thank you very much.