Hello and welcome to this session. In this session we are going to discuss the following question which says that simplify sine of 3 cos inverse of x and hence find the value of sine of 3 cos inverse of vanapal square root of 5, 3 cos inverse of x is equal to cos inverse of 4x cubed minus 3x. With this key idea let us proceed with the solution. We are given the expression sine of 3 cos inverse of x and we know that 3 cos inverse of x is given by cos inverse of 4x cubed minus 3x. Therefore we can replace 3 cos inverse of x with cos inverse of 4x cubed minus 3x in the given expression and we get sine of cos inverse of 4x cubed minus 3x let cos inverse of 4x cubed minus 3x be theta which implies that cos of theta is equal to 4x cubed minus 3x in a triangle p through r if theta is the angle between the lines p r and r cubed then cos of angle theta is given by base of the hypotenuse that is r cubed upon rp which is equal to 4x cubed minus 3x by 1 if we are given base r cubed as 4x cubed minus 3x and hypotenuse rp as 1 then we can find the value of the prependicular pq by using Pythagoras theorem. By Pythagoras theorem we have prependicular pq is equal to square root of hypotenuse rp square minus base rq square which is equal to square root of 1 square minus 4x cubed minus 3x the wave square which is equal to the square root of 1 minus rp 16 x raised to the power 6 plus 9x square minus 24 x raised to the power 4 which is equal to square root of 1 minus 16 x raised to the power 6 minus 9x square plus 24 x raised to the power 4 that is prependicular pq is given by square root of 1 minus 16 x raised to the power 6 minus 9x square plus 24 x raised to the power 4 and we know that sin of angle theta is equal to prependicular upon hypotenuse that is pq upon rp which is equal to square root of 1 minus 16 x raised to the power 6 minus 9x square plus 24 x raised to the power 4 pole upon 1 and we have assumed the value of theta as cos inverse of 4x cubed minus 3x therefore we can write sin of cos inverse of 4x cubed minus 3x is equal to square root of 1 minus 16 x raised to the power 6 minus 9x square plus 24 x raised to the power 4 and we know that cos inverse of 4x cubed minus 3x is equal to 3 cos inverse of x therefore the value of the expression sin of 3 cos inverse of x is equal to square root of 1 minus 16 x raised to the power 6 minus 9x square plus 24 x raised to the power 4 now we shall find the value of the expression sin of 3 cos inverse of 1 upon square root of 5 in the above equation we get sin of 3 cos inverse of 1 upon square root of 5 is equal to square root of 1 minus 16 into 1 upon square root of 5 raised to the power 6 minus 9 into 1 upon square root of 5 square plus 24 into 1 upon square root of 5 raised to the power 4 which is equal to square root of 1 minus 16 upon 125 minus 9 upon 5 plus 24 upon 25 taking the a sin of square root we get square root of 125 minus 16 minus 225 plus 120 upon 125 which is equal to square root of 4 upon 125 which is equal to 2 upon 5 into square root of 5 therefore the value of the expression sin of 3 cos inverse of 1 upon square root of 5 is equal to 2 upon 5 into square root of 5 which is the required answer this completes our session hope you enjoyed this session.


Zamfara State Police Command has refuted reports that armed bandits abducted 60 passengers along the Sokoto-Gusso Highway on Sunday. A statement by the Command's Public Relations Officer, Mohamed Shehu, only revealed the abduction of 11 passengers on the highway. The statement clarifies that two of the abducted passengers have been rescued, with efforts on to rescue the others.


Hello everyone, I am Vinit Thribune from WIT Solapur and today we shall see detection of Hamiltonian cycle in a graph by using backtracking approach. So at the end of this session you will be able to apply backtracking approach to find all Hamiltonian cycle in a given graph. So what exactly is this particular problem? We are given a graph which comprises of set V and E where V is the set of vertices, E is the set of edges and we have n vertices in this graph. A Hamiltonian cycle is a round trip path along all the n vertices where we are covering all the n vertices of the graph and we visit every vertex or every node exactly once. We cannot visit any of the vertices more than once. So this is the problem, in other words if the cycle begins at vertex V1 and the vertices are visited in the order V1, V2, V3 which are adjacent, then the edge that is the last edge I mean the Vi and the Vi plus 1 belongs to edge set E and Vi is equal to Vn plus 1. What that means is the cycle or the Hamiltonian tour will end at where the cycle started. So the first and the last node will be exactly same. So this is the sample graph it has five nodes and connected edges. So the possible Hamiltonian cycles in if we consider this graph is say for example if we start from 1 we will tour from 1 to 2, 2 to 3, 3 to 4, 4 to 5 and back from 5 to 1. So this is a possible Hamiltonian cycle in this graph. Similarly there is another cycle where we tour from 1 to 2, 2 to 4, 4 to 3, 3 to 5 and back from 5 to 1. So these are two of the possible Hamiltonian cycle if we consider the sample graph. If we consider this particular graph if you say for example we start from 1 we will tour from 1 to 2, 2 to 4 and if you go to any of the vertices that is either 5 or 6 you will not be able to cover the other vertices apart from coming back to 4. So this will not satisfy the constraint that this problem has given and 4 will be visited twice. So this is there is no Hamiltonian cycle in this graph and since it does not satisfy all the constraints. So how to apply backtracking approach to find the solution to the Hamiltonian cycle problem? We generate a n cross n adjacency matrix marking 1 for possible edge between two vertices and 0 if there is no possible edge. We start seeking for the cycle by setting the first vertex at the starting vertex because we want to set the starting point of the cycle. We continue checking by visiting adjacency vertices exactly once. If we reach at the last vertex we check whether edge from that last visited vertex to the first vertex is available if the edge is available the cycle is found. If all the vertices are visited and no cycle is found say for example no cycle is found we backtrack to the previous vertex to continue checking for other paths leading to the cycle. If there is no cycle that is the last vertex does not lead to the first vertex of the cycle we backtrack and then check for the cycles from the remaining adjacent vertices. All the paths that return back to the starting vertex by visiting every node exactly once are counted as Hamiltonian cycle. So we have to follow these three criteria we follow every vertex should be visited exactly once. There should be an edge between the current vertex and the previous visited vertex and the last vertex should have an edge joining to the first vertex to form a valid Hamiltonian cycle. So these these are the criteria that we follow to find the solution. Now let's go ahead and find the solution to this graph. So we have already seen this graph now I will show you how to apply backtracking approach to find a solution to this particular graph. Now as we have discussed I have generated an adjacency matrix where one states that there is a edge from the node say for example 1 to 4 if there is a edge I have marked it as 1 because 1 to 4 has a valid edge 1 to 3 does not have a valid edge. So I have marked it as 0 and likewise for all other pair of nodes. So we start our solution initially we mark all the the array or the vertices that we have visited as 0 because we have not yet started our solution. So first we fix the starting vertex of the cycle to 1 that is node 1 to avoid finding the same cycles again and again. So we start the we fix the starting vertex to 1. Now we start traversing the vertices from 1 to 5 to find the cycle. Now as we have discussed we cannot visit one single vertex twice in a cycle. So we have to move ahead we cannot stick to 1 or we cannot visit 1 again. So we have to go ahead okay so we can go from 1 to 2. Now again we start from 1 so we cannot visit 1 again. Similarly we cannot visit 2 again. So the next vertex that we can visit is 3 because 2 to 3 is a valid edge. Now again we start from 1, 1 cannot be visited again similarly 2 cannot be visited again. 3 also cannot be visited since it has been visited previously. So the next vertex that we can visit from 3 is 4 because it has a valid edge. So we write 4 here. Now the next vertex to find is we start from 1, 1 cannot be visited since it has been visited previously. 2 also has been visited previously. Similarly 3 and 4 also cannot be visited since both of them have been visited previously. So we come to 5 and 4 to 5 can be visited since there is a valid edge from 4 to 5. Now once all vertices have been visited exactly once we check whether there is an edge from the last vertex to the first vertex. In our case the last vertex is 5, the first vertex is 1. So we see whether an edge from the last vertex to the first vertex is available and yes since 5 to 1 is available or is 1 we have come to our first solution and the Hamiltonian cycle in this case is 1 to 2, 2 to 3, 3 to 4, 4 to 5 and back from 5 to 1. So this is a valid solution that we have found. We are going to find some more solutions to this same graph. So what we do is since we cannot go ahead that I cannot write 6 because there are only 5 nodes we backtrack from the last visited vertex and since no other vertex are available we bound the path by marking 0 and backtrack from the previous vertex. So I write 0 and now I will backtrack 4 to 4 to see for further available solutions for the same graph. So the next vertex from 3 to 4 is 3 to 5. So I will write 5 here since there is a valid vertex from 3 to 5. Now I will start again finding solutions from 1 here. So I cannot visit 1 because 1 is already been visited. I also cannot visit 2 again because 2 again has been previously visited in our solution. 3 also cannot be visited since it has been visited previously. Now if you see I can visit 4 but I have to check whether there is an edge from 5 to 4. Now it shows me that there is an edge from 5 to 4. So visiting 4 after 5 is completely possible and so the next vertex that I visit from 5 to 4 from after 5 is 4. I cannot visit 1, 2, 3 because they have been previously visited, 4 can be visited but the thing to check is whether there is an edge from 5 to 4. So there is an edge from 5 to 4. Now we have to see whether there is an edge from 4 to 1. So we see from the graph as well as from the matrix that 4 to 1 is available. So this is our second solution that we have found out that the cycle starts from 1 to 2 to 3 to 5, it goes to 4 and back from 4 to 1. So this is again a valid solution that we have found out. So again we continue further and check for other cycles. So we cannot visit 5 again since it has been previously visited, we backtrack to 0. Now again we cannot go ahead from 5 to 0, so from 5 to 6 so we make it as 0 and we backtrack. Now I can visit from 2 to 4. So 2 to 4 is a valid edge, so we can visit 4 after 2. Now I will continue further and check for other vertices for cycles starting from 1. One cannot be visited since it has been previously visited, similarly 2 cannot be visited again. We have to check for 3. Now 4 to 3 is a valid edge, so visiting 3 after 4 is completely possible and now we will check for other vertices after 3 so that we can complete the cycle and reach up till 1. So we start from 1, 1 cannot be visited, it has been previously visited. Similarly 2 and 3 also cannot be visited, 4 also has been previously visited. So we leave 4 also and now we see whether there is an edge from 3 to 5. So since there is an edge from 3 to 5, so we traverse from 3 to 5 and check whether 5 connects us back to the starting vertex 1. If 5 is connecting us to 1 since we have seen in the previous solution 5 is giving us a valid solution 5 to 1, so we come to our third solution that is cycle from 1 to 2 to 4, 4 to 3, 3 to 5 and back from 5 to 1. So these three solutions of course there are many other solutions also but we will stop here and we have come to three solutions by using backtracking approach. So at this point in time I want you to pause the video, draw the particular graph and find or identify whether the graph has a Hamiltonian cycle or not. Pause the video and answer the question. So if you carefully see the graph and try to trace the solution, the solution graph has a Hamiltonian cycle and it is as shown in the slide. So this is the reference that I have used for the video. Thank you.


Hi everyone, so this is the announcement of the giveaway. I'm so excited to see this. So I'm just gonna log onto my laptop and I do an auto generator that automatically picks the comments or the winner of the giveaway from my YouTube channel. Does it all fool me? I don't need to worry about writing everyone's names down anymore. But yeah, I'm gonna screen record it so you know that it's legit and you know that whoever's won has won. Legit, I mean, literally, I've seen it here. You know what I mean. Okay guys, so, oh God, look at these bags. Bad angle, I think. So yes, I've got the screen in front of me. I've got my YouTube up. So this is a website that you can use. You have to copy the URL to go in and share your video, copy, and then go back and then this will pick the winner. Filter duplicates because one entry per person, you know. And that is it. So are you ready? Get your YouTube comments. How many? 143 that aren't duplicates. That's good. So now we've got those. Oh, start, sorry. I could see it here on the left. That's been really blind. Start, here we go. And the winner is Rehan Mohammed. So congratulations, Rehan Mohammed. I hope I've said your name right. That is the winner. If you could just inbox me, your details, don't put it publicly on YouTube, obviously, but send me an inbox to my email, my social media accounts with your name and address, and I will get all of these prizes sent to you. But yay! So that is it. Thank you so, so much everyone who entered. Thank you for your amazing comments. They're so lovely to read. Thank you so, so much. And it's really nice to see that other people are reading for other people as well. So just a massive thanks, everybody. And watch this space for future giveaways. I absolutely door, door, door, door, giving away freebies to people. I think it's amazing and we all need it. We're poor nurses or students at the end of the day. So yeah, have a great day, everyone.


Good morning and welcome back to the NPTEL lecture series on classics in total synthesis sub part 1. So in the last lecture we talked about the various methods for the preparation of beta lactams and also the first total synthesis of penicillins. So we continue our discussion on the total synthesis of the forenumbered lactams and this time we will talk about total synthesis of another closely related natural product called thynomicin. And if you look at thynomicin and it has a lot of similarities with penicillin, both have this forenumbered lactam and in the five-umbered ring there is a change, you can see that earlier in the five-umbered ring you would have noticed this is the five-umbered ring. Now that S has come here, the S has come outside the five-umbered ring and also in the side chain earlier in penicillin you used to have NH2 and that NH2 is acylite. But here what you have is CH3, CHOH. So these are the major changes one can easily notice when you look at the thynomicin core structure with and compare it with penicillin. So as I mentioned while discussing about penicillin, penicillin actually created real major effect on the applications of penicillin type natural products for the treatment of bacterial infection. And after some time the bacteria started developing resistance to the penicillins that is why the second level of antibiotics were really required to tackle all types of bacterial infection. So that is how in 1970s milk group, so they disclose the structure of thynomicin which showed significant antibacterial activities and also it was isolated from the fermentation broths of the soil microorganism called streptomyces catalya and it showed very good activity against pseudomonas and beta-lactamase producing species. So this was second major breakthrough in the antibiotic history and let us see how thynomicin was synthesized by Merck. Initially they did a enantioselective synthesis and later they also reported a bulk scale resemic synthesis of thynomicin. First let us look at the enantioselective synthesis of thynomicin and their idea was first they want to construct the carbobinum framework at a later stage that carbobinum framework is the bicyclic framework that they wanted to construct at a later stage and then they wanted to you know append cystiamine and hydroxy ethyl side chains at preformed ring system. Once the rings are formed then they can attach these two and initially they wanted to do the enantiosespecific synthesis start with enantiomerically pure starting material. So let us see how they proposed the retro synthesis for thynomicin and how they went ahead and completed the thynomicin. So thynomicin so if you look at this structure the first retro synthesis involved the cleavage of this mod CS mod the idea is this can be introduced through an addition elimination reaction. See for example if you have a beta keto ester okay if you have a beta keto ester so then one can make the corresponding enol ether one can make corresponding enol ether or you can make the corresponding vinyl chloride. So then if you treat with this corresponding thiol it can undergo a 1, 4 addition a conjugate addition followed by elimination. So that way it is easy to introduce this thiol group. Next that is a key reaction where he wanted to introduce the CN bond and make the five number ring through the carbene insertion okay CN bond formation through carbene insertion okay. So if you talk about carbene insertion obviously the precursor is the corresponding diacyl compound. The diacyl compound can be easily prepared from the beta keto ester, beta keto ester if you have and then treat with base and then tosyl acide you can easily introduce the diacyl compound okay. So that is a precursor for this. So now this is a monocyclic compound and one can easily do it through first you can see here this aldol reaction you generate anion and then do an aldol with acetaldehyde you will introduce the CH3, CHOH side check and here this can be made by simple alkylation that is if you have TMS13 diethion and treat with butyl lithium you can generate anion in that can attack and in ascent to substitution you can introduce this. And this can be obtained the four ombre lactam can be obtained from the corresponding ester and simple lactamization between these two protected amino acids can lead to the lactam and this is nothing but L aspartic acid which is commercially available okay this can be easily made from the commercially available L aspartic acid. Now let us see how they have accomplished the total synthesis of tiramacy L aspartic acid the both carboxylic acids were protected as benzyl ether okay. Then the NH2 was protected with the transient protecting group like TMS chloride why I am saying transient protecting group is you know there are different types of protecting group the transient means it is used for one or two steps okay label protecting group just use it for one or two steps and then cleave it. So the TMS is one such transient protecting group now after that you treat with base here now base is tercibutyl magnesium chloride so it generates anion and then attacks intramolecularly the carbonate group of the benzyl ester to form the four ombre lactam okay. Then once it is done that the TMS group can be easily cleaved by treatment with two normal HCl. So the four ombre lactam is formed then the ester group should be reduced selectively in the presence of four ombre lactam okay so that is selectively done by reducing with sodium orythinol to get the primary alcohol. The primary alcohol should be converted into the iodide okay this was done in two steps first convert the primary hydroxyl group into mesalate and followed by Fingalstein reaction you treat this mesalate with sodium iodide in acetone you get the corresponding iodide. Now this NH the amide NH was protected as TBDMS by treating with TBDMS chloride then you take this two litheo two trimethylsilyl13 diethane you get the corresponding alkylated combo okay it is a simple SN2 reaction. Then you can generate anion with LDA quench with acetaldehyde so get the aldol product you get a mixture one is to one okay one is to one and in this case you see this stereo center is fixed okay whereas the hydroxy carbon the hydroxyl group attached to carbon there you got mixture one is to one okay. So what you did you took this mixture and then oxidized okay you took this mixture and oxidized and same thing the same ketone what he did he also got it in one step instead of doing aldol followed by oxidation he took this lactum and then treated with LDA and N acetyl imidazole okay you treat with LDA and treat with N acetyl imidazole he got the same product okay. Now when you reduce this ketone with K-selectride you got 9 is to 1 ratio of the expected product and one is the unwanted product unwanted isomer okay. So then you took the major one and then treated with mercury chloride and mercury oxide so that is to remove this ketone okay the ketone group was removed to get the corresponding ketone as you want acid the TMS group was treated with hydrogen peroxide to get the carboxylic acid okay. So once you have the carboxylic acid convert into the corresponding imidazole okay then you remove this or do a SN2 reaction with para-nitrobenzyl CO2 CH2 that CH-attacks this carbonyl and this imidazole comes out so what you get is this compound. So basically what they have done is to prepare the precursor for making or introducing the diosocombo for the introduction of diosocombo you need a beta-keto ester okay so that is what they have done and here R is still the TBDMS group. So once you have this treat with HCl methanol and treat with para-tolamine sulfonyl oxide pyethylamine. So HCl methanol removes the TBDMS group then the tosyl oxide as I said introduces the diosoglue the tosyl oxide introduces the diosoglue. Now you treat with dirodium tetracetate and it forms the carbene and NH insertion immediately takes place to get the firmum bird ring okay this is a very very interesting method to make the firmum bird ring but the stereo center is it important no because if you look at the natural product dynamosine you have a double bond here is not it. So that chiral center is not important so what you do take the beta-keto ester and treat with phosphoryl okay diphenyl phosphoryl chloride okay that forms the enol phosphate if you have beta-keto ester and then treat with diphenyl phosphoryl chloride it forms the corresponding beta-keto. So corresponding enol phosphate okay this enol phosphate again as I said it can undergo a 1, 4 addition followed by elimination that addition elimination reaction with this thiol will give you the expected products okay. So now what is required in the total synthesis of thiomysine you have to remove the para-nitro benzyl group without touching the double bond okay hydrogen analysis gives the corresponding carboxylic acid and you can see there are 2 para-nitro benzyl one here and one there. So this will lead to carboxylic acid and here this will also remove the carbon dioxide because that is a protecting group NH2 is protected as NHCOOPNB so when you remove the para-nitro benzyl group the carbon dioxide also will go and you will get NH3. So then that will be in the citroenic form so that is how they completed the MNCO specific total synthesis of thiomysine. And then they wanted to develop a scalable method for thiomysine and for that they first they develop a scalamic method that is resemic method for the synthesis of thiomysine. So what did they do and how did they do? So they started with this commercially available beta keto ester I can see. So this one has 2 esters isn't it? This one treatment with benzyl amine okay so it can form enamine isn't it? So in the presence of molecular sieves it forms enamine that enamine when you treat with key team when you treat with key team it can undergo at this position okay so it can undergo at this position basically you introduce a CO CS3 okay N acylation take place okay. So I have written the other way other side okay so 180 degree auto rotate so you will get this compound or you can I can write that structure so that you know you will not get confused because both are same. So this is NBN then CO CH3 you can see that.  So you get the exactly opposite isomer also. Now if you treat with concentrated HCl if you treat with concentrated HCl so this bond rotates okay this bond rotates so what you will get is what you will get is this one and that will undergo intramolecular cyclization to give this lacto. So what you got is 6-mombard lacto of course the ester also will be hydrolyzed to carboxylic acid okay. Next the benzyl group you do not want it has served its purpose so you cleave it under hydrogenalysis condition to get the corresponding amine then you open it up open the lacto with benzyl alcohol okay then you open the benzyl alcohol this is what you get okay. Now what you need to do you have to make the beta-lactam so that is normally done with DCC that is dicyclic acyl carbadimide you get the beta-lactam then protect both secondary hydroxyl group as well as the beta-lactam in which with TBS okay then you remove the benzyl group of the ester under hydrogenalysis condition then treat with CDI that is carbonyl diimidazole okay you get this compound then you treat with meldron sassid okay. So the meldron sassid what it does it generates anion here and then attacks is carbonyl and this comes out okay. So now it is like tri ketone okay ketone here you have ketone and then you have two ester so because of stability the ketone will be in the form of enol okay once you have this then you treat with para-nitrobenzyl alcohol. So the para-nitrobenzyl alcohol okay it attacks here okay then this acetone which is a stable group it will come out okay and this is in the ketone form then this carbonyl group attacks so what you get is this beta-keto ester okay basically what you get is beta-keto ester. So once you have this then you remove the TBDMS group okay both O protected N protected TBDMS group you remove then you take this hydroxyl group you can see this hydroxyl group which is alpha but in thynomycin it should be beta. So how one can do either you can oxidize and then reduce it or one can also think about mitzvinova reaction because by this time this synthesis was started mitzvinova reaction came into came into place so one can use mitzvinova reaction which is nothing but it will invert the stereocenter. So the acid which he used was formic acid so he got OCHO then if you do hydrolysis OCHO gets hydrolyzed and then you get OH. So now you can see this is the key intermediate is not it this is the key intermediate in the total synthesis of thynomycin reported by the same group but that was synapsia specific this they wanted to do in large quantity. So what is left is you have to generate the carbene here and then Cn bond formation okay then the enol ether and then addition of thiol will complete the total synthesis.  Now this OH will attack the triphenylposphine and you get this intermediate it is OPPH3 and then the carboxylic acid will intramolecularly attack and in a stentu fashion you get this copper okay this upon hydrolysis you get you have inverted the stereocenter here okay. So then you can follow the same process okay one can follow the same process to get this intermediate once you have this intermediate then diacetatization carbene insertion okay and then enol ether formation and then thiol addition will give thiolomacy. So standard you have alcohol diacetatization you introduce the nitrogen then treat with dirodium tetracetate to generate the carbene and that undergoes intramolecular MH insertion and then followed by treatment with diphenylposporyl chloride in the presence of unix base gives the enol phosphate and one for addition followed by elimination and removal of this benzyl para-nitrobenzyl group gives thiolomacy. So this they have done in a racemic method but this can be done in large quantity compared to the earlier method. To summarize so what metxindist have done is they have reported two total synthesis of thiolomacy. The first one is an inertia specific one and the second one is a racemic synthesis in both cases they have used intramolecular carbene insertion reaction as the key reaction to make the phymome budding. In the inertia specific synthesis they started with commercially available aspartic acid as the chiral amino acid so that they ended up with optically active thiolomacy. In the second case that is a racemic one so they used intramolecular as well as intermolecular mitzvonov reaction as one of the key reactions and overall yield also was much better compared to the first one. Nevertheless the second method is a racemic one. So thank you I will stop here and I will talk about one more total synthesis in this before we move to other natural products. Thank you.


What's up everybody, Jason here for jazzymeasecasebrakes.com, just running the $1,000 right there. Break credit giveaway that was guaranteed to run tonight guys, it was pretty simple. Just make a purchase on the website by $10.45, it's now $10.48 and you'll get an entry. Now every break, all spots, all breaks on the website count as at least one, but if you bought spots in these breaks here, Bowman Chrome HGA, Pick Your Teams, Hobby, Pick Your Teams, Phantasy, Sports, and High End Football Mixer plus the Fillers, that means you've got five times the entries and if you bought into Spectra Basketball Pick Your Teams plus any R&Bs, you got ten times the entries. So as you can see here, I was keeping track of it, it took me some time and like I said, started with Mark and we're just going to copy and paste all the way down to just like 800 and 800 plus entries, all the way down here, there you go, 881 to be exact actually, there you go, I'm going to copy and paste it and again, to give away the thousand bucks, it was going to be the top four names win 250 guys, alright, so let's click roll dice and it is a three to one four times, good luck, one, wait we'll have it right there, hold on, I feel like it was empty, why are we missing something right here, alright hold on a second, one second guys, I think there might be like a space in between one of them, so I'm afraid that that's probably why, I just want to double check though, alright here it is, one, two, that should be it right there I think actually, alright let's try that again guys sorry, I actually know DY too, maybe that's why, I don't know, it feels like everything else is fine, oh there's a space right here, weird, actually hold on, maybe make sure that Brian Crouch is not supposed to have it too, maybe we got deleted, no it's supposed to be just once, I mean he has more spots but just once, okay, why is this all missing spaces, that's so weird, I just don't want to mess this up guys, so I want to fix this, alright whatever, sorry guys, sorry if you're watching this you could have just fast forwarded this, alright four times guys, here we go, one, there we go, two, three, and four, four, there we go guys, eight hundreds, seven hundreds, five hundreds, four hundreds, three hundreds, two hundreds, one hundreds, eighties, seventies, sixties, fifties, forties, thirties, twenties, and just missing out guys, looks like Coverman and David B but at top four we got Frank, Coverman, Alan, and Jonathan, congratulations top four right there, so Jonathan, Alan, Adam, and Frank, there you go guys, so I'll paste your guys names here, and there you go congratulations guys, so I'll send you guys that break credit promo codes after this video is over and you have an extra $250 to spend each of you guys in breaks tomorrow guys, thank you guys so much, again hopefully we do some more of these again, I think these moves are fun because like I said a house moves breaks, and if you're already going to buy into a break, maybe it ties you to get a little bit more, and like I said very simple promo guys, don't need the breaks to sell out, just need to buy spots, thank you guys, JaspysCaseBrace.com guys, thank you.


There we go. OK, thanks for your patience. Thanks for attending the session. This talk is essentially about black box constructions and about secure computation, as is the entire session. So I'll spend the first couple of minutes talking a little bit about those concepts. So a black box reduction. So basically, all of computer science is about reductions in some sense. So a reduction is just an if-then statement. If this thing has an algorithm, then this other task has an algorithm. That's your basic reduction. A black box reduction is one, so you're making an algorithm for the task y, and you're using an algorithm for the task x as a subroutine. So in a black box way, you only use the input output behavior of the algorithm for x. A non-black box reduction would be one that somehow uses the code of an algorithm for x. So since in Pategazzo and Rudich, their famous paper in 89, this was identified as a really fundamental abstraction boundary in computer science and cryptography in general. So since then, the main question has been, when do black box constructions exist? And this is an interesting question in its own right from a theoretical perspective. But the main motivation is that black box constructions are, they tend to be more practical. Did you lose me again? No, OK. Both in their efficiency and their obvious modularity. So this talk is also about secure computation. I won't give too many low-level details. They're not quite relevant for the purposes of this talk. So this is your basic compulsory one-slide introduction to secure computation. So you have multiple parties. They have inputs. They agree upon a computation that they want carried out. And everyone gets a particular output from that computation. And no one trusts anyone else. And there might be cheaters who are malicious. Despite that, we want to guarantee certain properties for all of the parties. Namely that you don't learn anything more than your prescribed output. That's the important one. But then also subtle ones like you choose your inputs independently and that the outputs are consistent among the parties. So we want to talk about both of these concepts together. And we want to talk about black box reductions in the field of secure computation. So in the world of secure computation, there a typical theorem statement will look something like this. So if there's some fundamental primitive like trapdoor functions, then in some security model, for every function that you want to compute, there is a secure protocol for evaluating that function. So if you think about how the quantifiers are arranged here, the final output of this theorem statement is a protocol. That protocol depends on the underlying cryptographic primitive. And it also depends on the functionality that you want to compute. So those are the ingredients that go into the protocol. So we want to see how the protocol uses its ingredients, whether that's in a black box way or non-black box way. Well, for the first arrow there, we know about how secure computation protocols can use their underlying cryptographic primitives in a black box way. There's been a long line of results. So we have some pretty good protocols finally that are really great. They use, say, trapdoor functions in a black box manner. But if we look at how most of these protocols go in terms of their usage of the functionality, the typical approach is you represent the function as a circuit, and then you evaluate the circuit gate by gate. At some level, that's how most of these things go. That's a fundamentally non-black box usage of the functionality F. So that's the question that this paper is trying to address. Can we make secure computation protocols that are black box in their usage of the functionality? Some of you may know there's another sense in which a protocol can be black box, and that's in its security reduction. That's not quite, that's neither here or there for this talk, but this is not the whole picture about black box reductions. OK, so let's try to define this a little bit more formally. This is the model introduced in the paper. So can we securely compute something without knowing the code of that thing? The paper presents a more general definition, and I'm only going to have time to talk about the special case of two-party secure function evaluation. That's maybe what most people think of anyway with secure computation.  I'll use the acronym FBB. I'll try to avoid acronyms, but this is kind of a mouthful to say without an acronym. So a secure protocol that uses its functionality in a black box way is a pair of Oracle machines, such that when you instantiate those two Oracle machines, the protocol you get is a secure protocol for evaluating the function that Oracle realizes. OK, I'll have more to say about this. But one thing I want to make clear is that we can talk about secure protocols that use a trusted setup. And if we do, it really only makes sense to talk about a setup that's the same for every F in this class. If the setup can depend on the functionality that you're trying to evaluate, then why don't you just offload everything to the trusted setup? It becomes kind of a trivial question. So one important thing here that might look strange is that this is defined for an entire class of functions. So the cursive C here is a class of functions. We usually think of just securely evaluating a single function. But if we have a class that's just a single function, then these Oracle machines can have that function hard coded. So it doesn't really, I mean, they can satisfy this definition, but it's not really, you know, it's not meaningful because these Oracle machines could have the code of F sort of hard coded into them. So that's kind of not the interesting case. So it really only becomes interesting when we consider a large class of functionalities. And more generally, if, say, Alice and Bob can learn the code of a function just by querying it locally with their oracles, then why don't they just query their oracles, come up with the code of it, and then just run gmw, you know, compile it as a circuit. So those cases, they satisfy this definition, but they're not so interesting. We're interested in cases where the class is not learnable from Oracle queries. OK. So I just want to take a little detour and talk about a concept from complexity theory called auto-reducibility. And it's a way of measuring the structure, how much structure is in a set or a function. So there's a million different variants of the definition of auto-reducibility, but they all kind of look like this. So a set or a function is auto-reducible if you have an Oracle machine that computes the same function as its Oracle. That's kind of goofy. And to make things difficult, the Oracle machine can't simply query the Oracle on its input. So this is kind of a general template for auto-reducibility. You can think of this as an indicator of the structure of a set, because this means that, OK, I get an input x, and I have to output L of x, but I'm not allowed to query the L Oracle on x. So that information about the correct answer has to be encoded somewhere else in L. So that means there's some structure there. So just as an example, the discrete logarithm problem is auto-reducible. So here's an Oracle machine. This recursive call is kind of a call to its Oracle. So if you want to know the discrete log of x, you ask for the discrete log of x times the generator to the a. You should fact off a. In particular, this Oracle machine asks a query that's distributed independently of its input. That's a special kind of auto-reducibility. It's called instance-hiding auto-reducibility. This is kind of the flavor of things that we'll need in this talk. So just looking ahead, when can you evaluate a securely compute a function without knowing its code? Well, the answer is whenever there is a sufficient amount of structure, and the structure is something like this. OK? So let's do exactly that. So I'm going to describe a result from the paper. It's a characterization for security against semi-honest adversaries. So I'm going to define a newfangled kind of auto-reducibility that turns out to be the correct one for this problem. So it's called two-hiding auto-reducible because I'm not good at coming up with clever definition names. So we have an Oracle machine that computes the same function as its Oracle. That's kind of the same here. You may think this is weird. I've given this machine M2 oracles, which is only just kind of a convenience. So I can make a distinction between left Oracle queries and right Oracle queries. So I want to say that queries to the left Oracle don't depend on y, and queries to the right Oracle don't depend on x. So that's what these two left and right oracles mean. The don't depend on is in quotes, and I'm trying to give a high-level overview. It's kind of a natural notion of independence of distributions that's natural for a secure computation. Maybe you can figure out what it has to be as you go through the talk. So that's our definition. I'll just note that it's different than this plain instance hiding definition that I mentioned earlier. We define it for an entire class of functions, again. So you can see this is similar to this black box notion. It's defined for a class of functions. This auto-reducibility notion is defined for an entire class of functions. You have to have the same M that works for every F in that class. And we make a fundamental distinction between the input as a pair, the left and right input. So the main theorem here is that you can get secure computation without knowing the code of a function for an entire class of functions if and only if that class has this exact auto-reducibility property. So you can only avoid knowing the code of the function if there's enough structure. And what do I mean by structure? I mean exactly this. This is the kind of structure you need. And this is for security against semi-honest adversaries. And let me just point out that there's this OT hybrid. So if you don't know what that means, that's fine. This is OT is the most powerful trusted setup that you can give to a protocol. And so this says that arbitrarily powerful trusted setups don't really help for this problem. There's a lot of problems in secure computation where it's like, well, just throw a really powerful trusted setup at the problem. And everything becomes pretty easy. This is not one of those problems. So I find that kind of interesting. So when we use this theorem to prove impossibility results, they're going to be very strong impossibility results. They're going to rule out secure protocols no matter what the trusted setup is. OK, so I can actually, well, I thought I would be able to show the proof. We'll see how far I can get. So proof by pictures. So here's one direction. I'm given a secure protocol that has this functionality blackbox property. So what does that mean? Alice and Bob get inputs. They talk to each other. They talk to their local oracles. They might talk to the trusted setup, which I haven't drawn. And then at the end, they should output f of x, y, where f was the oracle that they were instantiated with. I want to use that protocol to construct this oracle machine from the auto-reducibility definition. How do I do that? Well, I'm going to define the oracle machine to just take in inputs x, y. It gives x to Alice, y to Bob. It runs their protocol internally. It simulates their protocol. And whenever Alice asks a query, m asks it as a left query. And whenever Bob locally asks the query, then m will ask it as a right query. And let's say we take the output of Alice to be the output of m. So the correctness of the protocol says that when you instantiate m with f oracles, you get f of x, y. That's one of the properties I need. The security of the protocol says that Alice's entire view, in particular, her queries to her oracle should be independent of y. And if you know secure computation, you know what doesn't depend on y has to mean at this point. Similarly, Bob's oracle queries, because they're part of his view, they can't depend on Alice's input more than on f of x, y, for instance. So that's one direction of the proof. That didn't take very long. That's good. Let's try the other direction. See how far we get. So I'm given an oracle machine from the definition of auto-reduceability. What does that mean? It takes in x, y. It queries its oracle. It makes left queries and right queries. And at the end, it outputs f of x, y. I want to use this oracle machine to construct a protocol that uses f as a black box. So Alice has x and Bob has y. And this is what they should do. So this is where I use the fact that I have a powerful trusted setup. OK? Using the trusted setup, Alice and Bob can achieve the effect of having a trusted third party who does this. I'll draw the trusted third party in here. So Alice and Bob give their inputs to the trusted third party, and he starts running m. At some point, m is going to make, let's say, a left oracle query. So the trusted party is going to say, hey, Alice, here's a query. Can you, you know, the trusted party doesn't have this f, but the Alice and Bob have f, because that's part of the setup here. So a left query, we ask Alice what it is. Alice is semi-honest. So we're talking about semi-honest security. So Alice will just respond, and that will take that as the response to the left oracle query. And yeah, the symmetric thing happens for Bob. The important thing is that this entire protocol, including the trusted third party, are the same for every f in the class. So the protocol treats f as a black box. It might not treat m as a black box. This protocol might use the code of m in a very non-trivial way. But it's the same m for every function in the class. So that's OK under this definition. Since Alice and, oh, OK, so yeah, m gives output. The trusted third party gives it to both Alice and Bob. That's what they output, finally. So as long as Alice and Bob are correct, we're feeding in the right things to m, so the output is going to be correct. The only thing Alice sees, so let's look at Alice's view in this interaction. Alice sees the final output. She sees the left oracle queries. Well, the left oracle queries don't depend on Bob's input. So they can be simulated. So we can have a simulator for a corrupt Alice and for a corrupt Bob symmetrically. So I have not very much time. So that's basically our characterization. We can use this characterization to show a positive result. So there's a class of functions that has this auto-reducibility property, which means you can evaluate these functions without knowing the code. And in fact, this class of function is not learnable from oracle queries. So it's infeasible to even know the code of these functions if you're just querying them. So this is one of those non-trivial examples. Unfortunately, it's a slightly contrived example. So this is a good opportunity for some interesting follow-up research. As a negative example, we'd like to do this for all functionalities, like a universal Turing machine compiler that somehow doesn't use the code of the Turing machine. That's not possible. In particular, you can't do this even with the class of pseudo-random functions. So think of Alice having the seed and Bob having the input. And because it's a negative example, it's even against semi-honest adversaries. You can't do this. Even if you have oblivious transfer, you can't do this. So I'm out of time. There's a characterization for malicious adversaries. It's not a complete characterization. But look in the paper for that. There's a more general definition than what I've given. There's an impossibility result for zero knowledge. So you can't prove something in zero knowledge where the statement is related to one-way functions if you want that to be not using the code of the one-way function. So just as a summary, so I'm done now. So I gave a definition for secure computation that doesn't use the code of the functionality that it's realizing. There's a complete characterization based on auto-reducibility. So the title of the talk was a question. The answer is, well, no in general. But yes, in some interesting cases, you can evaluate F without knowing the code of F. And I've gone past my time. So thanks for your attention. Thank you. Great. Yeah.


Often, one of the biggest risks in an electrical storm isn't to your home, but to your major appliances. Because a sudden power surge can damage their motors. So think about how much it would cost to replace them. Now consider Surge Defender from Georgia Power. For just $9.95 a month, you get added protection to limit replacement costs. And that's something to smile about.


Hi, I'm Ryan Baxter, a faculty member in Penn State's Department of Geography and online GIS programs. I live in State College, Pennsylvania, with my amazing wife and two boys, not too far from Penn State's main campus. Right now I'm standing at one of the university's agricultural research fields, which has some examples of the kinds of research I like to do in land use change and how we utilize our land resources and impact our land resources. I'm very curious about how we can use biomass like corn or forest products or more peculiar things like switchgrass and miscanthus to produce renewable energy. And for many years I've also had the privilege of being a technical developer for some large data management projects, most notably Pennsylvania's Spatial Data Clearinghouse, where I've been able to get my hands dirty with programming, database management and system administration. And this combination of research GIS applications and technical experience has given me the opportunity to teach some really fun courses in topics ranging from energy and environment to cloud and server GIS technologies. So I appreciate you taking this time with me and I really look forward to working with you down the road.


Many times expanding our workforce and making sure Vermonters have the skills they need for the good jobs We know are available today is incredibly important to our economic future We know we have a good education system here in Vermont And I believe we can make it the very best by moving to a cradle to career system. It creates a path to opportunity for all Vermonters If we can it'll be the best economic development tool we could ask for To get there We must continue to make investments in early care and learning as well as higher in continuing education This is why I propose increase investments in both areas, and I'm very thankful for the legislature's partnership on many of these initiatives Together we focus on trades training and apprenticeships Returnships and non-degree programs Even focus each each and every one of them focus on providing tools to pursue a good job and greater career opportunities But today I'd like to highlight what some of Vermont businesses and our higher education community are doing To provide much needed training and educational opportunities with the unemployment unemployment rate at the Historic low in fact the lowest in the country at 2.1 percent Vermont companies are seeking new ways to recruit and train employees Vermont tech and CCV partner with businesses and organizations across the state to develop and offer training program programs tailored to the needs of the employers that you'll hear from today Workers have an unprecedented opportunity to take advantage of these training programs and access great jobs with quality employers Jobs that don't only pay well, but also offer benefits such as paid time off health insurance and a pathway to progress CCV works with employers to understand their needs and workforce training that's available to them They've developed nearly a dozen new programs in recent years With offerings from a single course for employers at at a work site and or to a group of employers and Community organizations all working together to identify find and train new workers VTC has partnerships with many employers across Vermont, New Hampshire and upstate New York And they have that had success with employer specific customized training VTC also oversees the electrical and plumbing apprenticeship program in partnership with our Department of Labor In fact this year's class just kicked off on Saturday, and I understand it's the largest class ever Which is great to hear because as someone who's spent much of my life in the trades I know we're in desperate need with the average age of a construction worker at about 56 years old I want to thank Joyce Judy president of CCV and Pat Moulton president of VTC for joining us today And we'll hear more from them in just a bit The bottom line is we have many great companies with good jobs available and Are partnering with training providers like CCV and VTC to offer real opportunities for Vermonters I'm hoping we can learn a little bit more about these opportunities today Share this news and help someone looking for the right training program or a new career We have a few guests here as well and some students with us from global foundries GW plastics Center Vermont Medical Center and McDonald's to talk about these training and educational opportunities and how they're Impacting our state, so I'm pleased to welcome everyone here today with that I'd like to turn it over to dr. Judy and president Moulton to talk a little bit more about their role in this important process Joyce Pat Thank You governor, and I want to just begin by acknowledging and thanking the governor for his Tremendous support of the Vermont State Colleges. He has really taken The initiative to really help begin to increase appropriation what makes it That much higher education that much more affordable to Vermonters, so thank you so much for your leadership in that You know as governor Scott was talking You know I was reflecting on all of the programs and certificates and apprenticeships and customized trainings that CCV offers in our 12 locations and our online programs throughout the state and In addition to that we are doing more and more on-site with businesses Where stoop where employees can actually take courses? Well, they are at their place of employment but I want to begin by saying we couldn't do this work alone and I want to thank our and acknowledge our incredible partners the Vermont Department of Labor the agency of education vocational rehabilitation creative workforce solutions Vsac the technical centers to high schools And Vermont Technical College because without all of us working together on this on really trying to create Workforce programs. We couldn't do this as well So I think together we offer Vermonters and Vermont businesses the space to think of what's possible And then how to get there and get it done So I just want to highlight a couple programs that really illustrate our work That we're doing so this past summer we partnered with workforce opportunity solutions And they had contracted with Blue Cross Blue Shield of Vermont to really help them build a pipeline of Workers and so workforce opportunity solutions has a track record and a mission to provide training and Employment opportunities to underserved youth and veterans and through their efforts and classes taken at CCV this summer There are nine new employees at Blue Cross Blue Shield in jobs from medical claims to project management in just a view few short months and then Where we've just launched a couple weeks ago a pharmacy technician apprenticeship program so a few months ago CVS came to us and said we have a huge need in the state of Vermont for pharmacy techs and Can't you help us provide that training? So as a result of conversations we were able to launch a pharmacy tech Apprenticeship program. We started that program 10 days ago We have 14 participants statewide and what's nice about apprenticeships is it's a model where people get to earn and learn at The same time so we have a number of pharmacies from smiling steves pharmacy Which has three locations in Rutland-Ledlo and Springfield to CVS to Walgreens and Shaw's throughout the state of Vermont all Employing these individuals as they are going to school. So it's a huge. It's a win-win It's a win for first for the participants It's a win for the businesses and it's a win for CCV So these are just a couple of examples of the things that we're doing And it's a pretty exciting time in terms of really thinking about all the possibilities We can do with In our work with Vermont businesses. So Pat, I know you have a couple of programs to highlight as well Thank you Joyce and thank you Governor Scott and I too want to take this moment to thank you for your continued support of the state colleges But also the work you mentioned earlier in bolstering funding for workforce education and training programs because we couldn't do What we do for employers without that assistance. So thank you for your leadership there And I think we all know that Vermont Technical College is well known for providing great degrees in technical education our 99% placement rate of graduates But what folks may not know is that we are leading along with CCV in the area of customized training for employers and We provide solutions that bring workforce education solutions to the employer as well as on our campuses Companies employers like Global Foundry's who you'll hear from W that GW plastics who you'll hear from GS precision Fujifilm GE Aviation Center Vermont Medical Center Dartmouth Hitchcock Medical Center numerous other healthcare facilities Manufacturing energy and many many other firms are engaged with us in customized training We provide apprenticeship programs as well as specific customized to their needs and these employers are investing in their talent pipeline By bringing training and education on to their shop floor or into their workplace And we customize these solutions to meet their specific needs and these solutions can carry college credit So that these students these incumbent workers and new hires can earn a degree Through this work starting with their employer whether they already have certain credits or already have a degree They can augment that and these employers recognize that their employees are their number one asset and they are investing in them And it is a real win-win for these employees and employers and the Vermont workforce when employers are investing in their talent pipeline Many times programs such as the Vermont training program from the agency of commerce or the workforce education and training fund Or other federal funds from the Department of Labor are utilized to help offset these costs for employers But by employers putting skin in the game and investing in their talent It's really critical for them to do that as we continue through the workforce challenges We have here in Vermont and that Vermont tech and CCV We are uniquely situated to develop those workforce education and training solutions that we can bring to employers throughout the state of Vermont And we can literally do almost any configuration. You wish we work very closely through our continuing ed and workforce Development division Maureen Hebert is our director. She's here today She and Tiffany Cunin from CCV partner all the time to figure how we can collaborate Together to serve the workforce needs So it's my pleasure to be here today and thank you for the opportunity to highlight this It's now my distinct pleasure to introduce Dale Miller Who is the senior location executive for global foundries and Essex Junction? And I would note a Vermont technical college graduate Dale, please come to the podium Well, thank you President Molten and President Judy At global foundries, we're proud to continue and further our relationship with Vermont technical college We are grateful to Governor Scott for his support of public resources including the state college system This technician training program with Vermont technical college allows global foundries to further its talent pipeline and continue to thrive in the state of Vermont As the leading specialty foundry and innovation hub for mobile and consumer products We are excited to bring this program to our community to help support building a Vermont based technical workforce our first class of 15 students started August 28th They're earning a full-time wage and attending college based courses while being trained internally at our global foundries complex and technical applications such as vacuum and radio frequency systems along with basic maintenance skills I'm happy to report that we are beginning the recruiting process for our second class starting in the fall of 2020 I'll also like to recognize a couple colleagues here with me today Ken McCabe and John the friend here Which really spearheaded this process and made it happen for us in Vermont working with Vermont technical college. I Would now like to introduce Kevin Locke from GW plastic as Dale said my name is Kevin Locke I'm a manufacturer and quality engineer from GW plastics My story is six years ago I chose to make a career change in a field that I had zero experience and minimal knowledge That's very intimidating and by being able to enroll in this program. I was able to get the education that Helped me every single day with what I do and it enhanced the learning every single day my job performance increased I was able to get a promotion raises and it opened up the opportunity for career growth Throughout this four-year program like Dale said we go to school. We go to work every day. You have your family it makes it reasonable to obtain a Certificate and you're able to you know have confidence in your job performance at work throughout the four years you learn a lot and at the end you have to put together projects or you have to use everything that you learned and We were able to put a project together where we created cost savings for the company a yearly cost savings and that's those are the things that it opened up for me and Having zero experience now. I'm confident every single day with what I do where I'm at and when I'm communicating with people at work Thank you. So now Jesse Anderson from McDonald's Hi, everyone. My name is Jesse Anderson and I moved to sovereigns in Vermont in 2014 from my home country, Liberia My family moved to the US specifically to provide a better education platform For my siblings and I and to be closer to family. I graduated from South Burlington High School in 2017 and decided to further pursue my higher education at St. Michael's College as the first generation college student Education means a lot to my family and I because it provides an opportunity to be independent and grow But paying for education is difficult. I Receive aid from the state of Vermont to attend college through the Vermont student assistant cooperation grant Vsac But attendance in my it's still expensive So I still have to work almost full-time on and off campus But on campus I work as a resident assistant in the international housing and off campus I work at McDonald's as a certified manager Advancing my leadership skills at McDonald's has not only helped me gain a significant pay raise But I've also received six thousand dollars in the archway to opportunity to wish an assistant program. I Anticipate getting twelve thousand dollars in total by the time I graduate college Getting this much help through the archway opportunities program has made a significant difference in my life And not only taking some financial burdens off my shoulders But but also allowing me to grow towards my career goals. I Aspire to be a clinical psychologist someday and I'm currently a junior Psychology major with minus in philosophy and religious studies The help I get from the archways program at McDonald's has allowed me to not have to work all the time But also give back to my college community By being the president of a club that creates a safe space on campus for women to connect and talk to each other I plan on staying in Vermont after I graduate to pursue my career in psychology And I know that my McDonald's family will always have my back. Thank you. I Would not like to I would not like to introduce Sydney Konepka Who is a current nursing student at the Central Vermont Medical Center? So, hello everyone, I'm Sydney I'm currently an employee at Central Vermont Medical Center at Woodbridge, and I'm also in the LNA to LPN program with CVMC and CCV and Vermont Tech. I Actually moved here from New Jersey five years ago after visiting family and received my LNA license in the Northeast Kingdom where I live now Still getting used to the winners Through a friend of mine who also works for CVMC I learned about Woodbridge rehabilitation and nursing and she told me all about their great benefits and opportunities Plus I'd be able to use more of my LNA skills. I Have now been an employee at CVMC's Woodridge for almost three years at Woodridge Rehab I see a lot of people come in at their worst and I'm able to provide them with the help and Stronger to get stronger and independent again to go home. It is really truly a rewarding job So when I heard about CVMC offering the LNA to LPN program from our director of nursing last year I was truly excited Myself and 17 others who are also in this program started taking two classes the beginning of this month So we're just started CVMC has also made the classes very convenient for us by having our classes at the hospital and Woodridge has really been great with our schedule As an LNA wanting to grow and provide more care to the patients I take care of and further my career This program really helps me to do so by providing financial support and that's what's most important to me With that being said I'd like to thank CVMC and Woodridge For this great opportunity and all the support that they provide me. Thank you so much and thank you governor Scott So at this point we can open up for questions maybe on topic questions at the first Joints or Pat when a company I come to you and says hey We have these jobs Curriculum to fill them are they contributing any Money to you to help you get that going it all now I'm going to sound like a lawyer and I'm not a lawyer it all depends You know and oftentimes like I will use an example of the central Mont hospital It's a combination of we were able to get we have a federal grant with the Department of Labor a federal Apprenticeship grant and so some of the funding is picked up by the apprenticeship program Central Mont hospital is contracting for a couple of the courses and Students are also eligible for for financial aid So it's oftentimes a combination of or from the Vermont training program There's sometimes state sort of resources sometimes there's federal resources Sometimes it's straight financial aid and sometimes we also if a company contracts with us for a course We oftentimes will give them a discount for that course So it's usually we try to pull all the resources we can together to make it as inexpensive as we possibly can for the well and same with us, it's going to depend on the program, but Usually there is skin in the game if you will from the employer I'm just looking as an example that the GW plastics program that Kevin graduated from it's a leadership program Four years as he stated where students are going to school in the in at their workplace and GW releases them a little early Still paid to go to classes then GW is covering the full cost of our faculty going down to teach that class They also provide scholarship opportunities for our students enrolled in our degree programs and provide paid internships in the summer And so that kind of participation and assistance that we have when the number of employer partners is critical Then we have other programs that might blend some Vermont training program money We also have access and are a partner with VDAL on the federal apprenticeship program Grant so it's a mixture depending on what the circumstances, but more and more GS precision in Brattleboro as well as GW Have set up their own training center on their own nickel They're paying the full cost of the apprenticeship program that's happening there same with GE So it depends and similarly with the hospitals They're picking up the cost to train their employees and giving release time many times and Providing scholarship for those students to continue on to a degree. So it's quite an investment, but it's an investment That's paying off. I will I will quote Ben real CEO at GW plastics the other day that said but for Vermont technical college They probably wouldn't be growing in Vermont if they were still here because they need to know There's a pipeline of students coming out of these of our colleges to support their needs Well, obviously they just won tool in the toolbox We have to we have to attack this at many different levels With many different initiatives and we've done that Through the legislative process the good news is it appears We all understand that we have a demographic crisis on our hands So it it's great that the legislature as well as the administration and in our business partners and the in the Educational community are all working towards the same goal and trying to bring more people into Vermont As well as giving them the the tools they need to succeed. So One one of the tools this one doesn't do it alone, but it certainly is a big help In moving us towards and moving Those who who want to progress towards prosperity how Many are involved you think Workforce improvement training programs through How many individuals Did people come to CCB for two reasons one they come either to start their education and transfer to another school Or they come to CCB to get a job. We have over 5,000 students enrolled this semester So, you know how you split that out and the individual programs. It's you know, we have Well between Pat and I and with in the nursing pipeline We probably have a couple hundred students. It really depends so much on the program and on But I would say, you know the 5,000 students that are at VTC this I mean at CCB this year are all here or primarily here to get a job or a better job And we serve 95% from honors. So they're here and they're going to be here But just to piggyback on what the governor said We're very pleased to have the biggest apprenticeship plumbing and electrical apprenticeship class in a long time ever I guess at this point and they're part of over 3,000 students We serve annually through our continuing ed and workforce development division and then we have enrolled roughly 1,400 students in our degree program. So there's a lot, but it's not meeting the entire need So we're delighted at the volume, but what I hear from employers. They love our graduates They love the product for the training. There just aren't enough people going through it So if you want a good job and you want to make good wages You need to come and look at some degree be it certificate associate or otherwise And then you can launch your career through CCB or Vermont Tech. So so that's the path if you're a high school graduate You don't know what you want to do or what your Options are you come to VTC first or you proceed for it first. What's your counsel to Waiver in Well, that's a that's a really good question Stuart and it really depends on where you're at If you can afford to come to college that would be recommended But more and more students are getting a job and having the employer help them pay for their education as Illustrated here today, and I think that's becoming more and more a trend for the younger generations We're a little more a dead adverse But it really depends on where you mean what your means are and where you are at Personally to your point what 18 year old really knows for sure and sometimes you got to get out in the workforce a little bit and find out Where your niche is and then you can come back and get a more focused degree and we have multiple adult learners J. Fayette the president of PC construction was he tells a great story about Got out of high school got a job in construction loved it But here we go until he got laid off two winters in a row and said I can't do this anymore and came back as I Believe 22 or 23 year old student got his degree and the rest as they say is history So each person has to decide what's right for them. I don't know if you want to add no I would just say that I think that's right and oftentimes we have people who come in and out They get a degree. They get a certificate. They go to work. They get a job change. They get an upgrade. We did a program with oh The manufacturer and in Colchester and trying a complete line No, it'll never Is I mean the president of the company has a has a theme the more you learn the more you earn Right, and so I think you know we are finding what we're finding with adult Students as they come they get a few courses. They get a job Then they want something more or they want a promotion then they come back they get more they get that promotion So it's it's an in-and-out Right, yeah, I think that's that's the underlying message in many ways. It's never too late And what I've seen I've had the opportunity to speak and attend the graduation at CCV in particular and you can see the the wide range of students who are graduating from there anywhere from 19 to 81 And so and you can see how hard they've worked to get to where they are and the same with the apprenticeship Program with the plumbing and electrical down at VTC I've been I've been part of that for a number of years and they don't just you know, they don't go and and And take these classes during the day. They come at night I mean they work all day and then they come at night to further their career So they have skin in the game each and every one of them and it's meaningful to them But there's light at the end of the tunnel and they're able to to you know further themselves And make more money to be perfectly honest other questions on topic Well, this is the point where I asked Jesse to come up and Sidney to come up and take all the rest of questions But there'll be some other questions that you may or may not want to be in the background Thank you Thanks After the United States attorney dismissed a couple of Attorney general Donovan has refiled first-degree murder charges Well, none of the above in some respects, I'm very grateful the attorney general took another look We obviously have some opportunities to do things differently. I think we're going to have discussions about this In the future in the legislature and in terms of you know, how we go through the judicial process so I'm I'm just grateful that he is taking a look at these three cases and And what I didn't know that there was anything public at that on this issue in particular But I'm just thankful that he was able to to move forward and look forward to the other two cases as well And you what his response will be you define what the reform would look like. Well, no, I mean I think that there's and again, I'm not I'm not a lawyer But I think that we have to determine What it is, you know, I've made this statement before in the past And I and it was something that I borrowed from Governor Shulman and one of his state of the state addresses And he said we have to figure out, you know, who were who were mad at and who were afraid of And then this thing was between the two in their cases. I believe where we're afraid of people who should be either brought to to justice and if there's If there's an opportunity of where they may be able to work around Justice in some some way then we need to close that loophole. So again, I think that the using an insanity Defense is becoming more prevalent. It appears and we need to figure out How do we close that and and how do we make sure that we're truly seeking Justice fair for those the victims and and their families That's probably a better question for her obviously she had determined she was doing everything she could And and we'll see what the the Attorney General Uses his defense and and where he goes from here Have you spoken to him about the recent Farmer lawsuit? I have not You planted I just read about that myself So I yeah, I would like to see what he thinks This is going to be much like the tobacco settlements that we've seen in the past This will be I believe we'll see in many states that will seek restitution and rightfully so Yeah, there's there is a difference again between the cap and The amount of revenue that they can derive in the rates and there are two separate issues So I think it's it's important to to make sure that we separate those two because In some respects Increasing the cap Doesn't necessarily mean There's there's it costs more for the rates. So the rates were I believe the Greenmont care board Had come to the conclusion. They should not go any further than 3.5 percent for the rates so Again, I'm concerned about health care costs in general and what we need to do Long term is to change our demographics. I mean we're we're hearing it. We're seeing it We have an aging demographic which usually Leads to more utilization and I think we're seeing that in real time so the more we can The more we can do to bring more families younger healthier population into the state I think will be beneficial for health care costs and as well going, you know, we're we're moving Away from a fee for service and going to a more holistic approach and Trying to to make sure that we contain costs and and work on prevention in other areas where we believe will have the the most Opportunity to lower costs in the future, but it's a long-term approach System reform dollars Right, I did respond to their to their letter I disagree with some of their contentions And I stated why in the letter and I believe that you know, we have made a lot of commitments and we've done a lot in terms of increasing Medicaid reimbursement, so It's not as though we've we've been you know cutting back. We've actually made some gains and we're seeing The utilization rate of the caseload has dropped in Medicaid as well. So some of you know In the letter I showed why I believe That we're doing doing a lot in that area and why I'm not sure that their argument was correct So we'll see where they go from here, but we're willing to talk about this work with you know This isn't a unilateral decision on my part This is a legislative process as well We'll work together with agreement on care board the legislative leaders my administration to do whatever we can to make sure that We're reimbursing as much as we can and by and keeping health care costs overall confined Private health insurance premiums on the exchange going up 10 to 15 percent You've got hospital budgets going up 5.5 percent in the case of you Well that I okay, but that's that's the revenue right that's the cap on the revenue And then you've got annual increases in Medicaid states share of Medicaid going up point So how can you reconcile the disconnect between those rates of increase well again? we've we've been working on this new approach the all-payer model trying to to curb the the usage the utilization in that it's going to take some time, but But again, my contention is that we've been doing a lot in that area In fact the caseload has decreased over over the last few years. So I think that's positive news on demographics a new GFO report just came out saying that On the wealthy folks are not moving away from Vermont Because maybe tax policy, but it's actually lower income middle income folks who are migrating away from the state Does that surprise you at all? Well, the data is the data Obviously, this is doesn't surprise me anecdotally. I know a number of folks That that I've been close to that have moved away from the state blue collar workers Those with low and moderate incomes that have decided to move away from Vermont mainly what I hear This property taxes. That's what I hear most And and so it's not a surprise the affordability of Vermont is in question And that's why we're doing everything we can to make Vermont more affordable and to bring about filling those those work those openings in our Workforce that that would help obviously in some of our revenue Issues that we have in the affordability of the state President Trump called his Republican challengers of which I guess there are three Laughing stock this week Do you think they're a laughing stock are you looking at any of them? Well, I wouldn't I wouldn't characterize any of them as laughing stocks. They've There's at least two governors former governors that have moved forward who were Popular one time in their states enough so that they were elected So I I think it's unfortunate that that we don't have the at least the dialogue About and primaries are not easy. I I get that I've had a couple of myself And but it's it's important for the people to hear different perspectives and different points of view And it makes you a better candidate in the end. Is it important for Republicans to have that dialogue? I think it's important for All the electorate to to hear different points of view. I think it's really important You've reached out to Senators McConnell and Graham regarding guns. I guess, uh, what are you hoping to accomplish with that? I think it was important for us to share our story and me in particular coming from a I'm a republican and a fairly blue state And I had a change of heart as we well know And I thought that in this time and place Sharing my thoughts sharing our story Was important to share with fellow republicans. So I thought it was important for me to add my voice And speaking about the senator's office this morning, it seems like he's kind of waiting to see what the president will or will not sign Do you think that's a good approach or do you think they should get started on their end? Well, obviously, I think there's some common sense solutions Here that we've implemented red flag legislation. I believe Increased background checks. I think those are two areas where I think we can make significant gains in terms of safety For for americans and for vermoners. So I I think we should move forward and and I I think it's unfortunate that we haven't done so already Just on the Medicaid issue And we hear a lot of a conversation on the other side about medicare for all Here again tonight wouldn't in some ways medicare for all solve A lot of problems for governors like you. Yeah, well, it may solve some problems, but I'm not sure that it's the answer And and I I don't believe that I think we have to be realistic about this So it sounds good free health care sounds good, but somebody's got to pay. I mean, there's obviously Areas where We can improve that's what we're trying to do The all-payer model is something that we've been working with the federal government on And and we're proving that that we can make some gains in that area And I think we'll see some long-term gains as a result. So I would I would much rather continue to work the way we have in vermont But but again, that's these primaries or opportunities for people to to Talk about different perspectives and and flush those out and see who's going to pay and how much what do they think It's going to look like in the future Any response to hearing the trump administration's plans to push for vanna Labor at least Well, as you probably know In my state of the state address As well as the budget address we I took a position on this and I think that this is Something that's very concerning to me as we've seen the escalation Of our youth using vaping products Throughout our state and country It's time for us to take action. We took action in a different way And I applaud the president for at least talking about this. We'll see where he goes with this at this point But I think he's uh, he's moving in the right direction I hope to be sure I look forward to the f-35s arriving in vermont and and uh, as soon as I get a firm date I'll I'm in hopes of being there Over the last couple of months, I think more patrol than maybe three checkpoints in san furo another one down Junction Should more patrol be able to be detaining vermonters and other residents Miles upon miles waiting for Yeah, you know, there's been some talk about I think congressman welch has talked about Tightening that maybe it's senator lehi. I'm not sure. Well, the congressional delegation has talked about Uh, confining that to 25 miles from the border. I would like to see us, uh, you know tighten that up a bit myself 100 miles seems a bit excessive But at the same time, uh, you know, they have a job to do. Uh, they're working within their limits But but I wouldn't mind seeing the congressional delegation Work forward. I look forward to Changing that that Number of miles Have you ever gone through one of those I have I was down I went through one on 91 Outside of Hartford No, it was very quick actually, uh, this was something a few years ago. Actually, this wasn't recent So this is shows you how long it's been around. It's not just this administration. Uh, this was probably Five or six years ago And uh, and I just thought I was surprised to see it I saw the signs and I didn't know what it was and I came up to it and they stopped me and asked me if I was a U. S citizen I said I was and they said have a good day And moved on but it was right in the middle of the interstate and I thought it was Just so it was odd Yes Thank you very much. Appreciate you coming in


The environmental movements is so fascinating to me because it's increasingly this coalition of, I guess, techno-optimists like yourself, but also basically anti-capitalist greens. And you've even penned a piece I'm gonna pull up here, speaking to that audience, it's in the Atlantic, what many progressives misunderstand about climate change. What is your message to that side of the environmentalist coalition? Yeah, I think it's really just about keeping our eye on the ball. And so I wrote that piece for the Atlantic based on what an environmental activist said in a Rolling Stone article that they didn't like certain climate solutions because certain large corporations like Exxon might benefit from carbon capture technology, or yeah, like Elon Musk with Tesla might benefit if we switched to electric vehicles. And the point of that piece I wrote in the Atlantic was really just taking the idea of climate change seriously as an emergency. And not even, it's not even debate like whether it is or isn't. Just like, if you assume it is, if you're the person in the environmental community who, activism community who says all the time that climate change is an emergency, then I wanna take that seriously. So what would that mean? What would that entail to treat it as an emergency? And in my experience, in my opinion, treating something like an emergency means keeping a laser focus on a mission that would actually solve that emergency and end the crisis. And so for global climate change, this is an emissions problem. And so we should be pretty agnostic about who we partner with, as long as that is something that actually benefits the climate and actually works towards solving the problem.  And I don't think they're really fake or real solutions. They're just our solutions or there aren't. So it's like a, is this a kind of return to the like the more technocratic idea of actually we're gonna literally like measure or create some sort of proxy or something to measure how much carbon is being put out and then do, I don't know, cap and trade or carbon credits or something like that because that's more of a agnostic, energy agnostic solution, something like nuclear under the right regulatory conditions might be able to compete on in that world versus the world we're in now where it's much more tax break and subsidy based. Yeah, so I think that's like, that's one version of this. That's definitely the one that vast majority of economists would endorse is some kind of, first best is carbon tax, a very close second best is cap and trade because there's basically economically equivalent depending on how they're designed. And then second and third best are things like subsidies. We also try to be quite politically pragmatic in our work at IFP in Washington, where we're working in Washington DC. And so as of now, and has been the case in recent decades, carbon taxes and similar programs are extremely politically unpopular and most elected officials are aware of this fact. And so anything that increases the cost of energy we saw over the last few years, the crisis over gas prices and how much that hurt the popularity of the incumbent president. And I think actually implementing those seems extremely unlikely. And I think that's the case where second best solutions like some of the subsidies we see for clean energy technologies make a lot of sense. And then Zach, you and I can talk more about like how we can implement those subsidies in a more efficient way that limits the downsides of picking winners and losers. But I think we're working within that bucket and we're probably not in a carbon tax world, unfortunately. I wanted to ask a slightly nerdy question from your Atlantic article. In the Atlantic, you write, some environmentalists are skeptical of geothermal energy which requires extensive drilling. Yet it has high potential as a source of clean baseload power with a small geographical footprint that can in theory be deployed anywhere in the world if you drill deep enough. One way to accelerate investment in geothermal energy would be to give this clean technology the same expedited permitting that oil and gas companies already receive for leases on federal land. Where is the opposition to that coming from? Like for my little libertarian heart clearing the path of regulations and treating a geothermal drilling company the same way he would treat other people in that space or other companies in that space. That's an obvious thing. Why do people oppose this? Yeah, so it says there's opposition on both sides and I wouldn't say that the majority of each party or each part of the coalition, but they're loud enough and this is a neglected under the radar issue of like how is geothermal versus oil and gas permitted under the National Environmental Policy Act? It's a very wonky question that doesn't get a lot of attention. But there's enough opposition to keep us in the current status quo and not let reform happen yet. And so on the left, the similarities and fracturing so even though geothermal is about capturing natural heat resources, using that to heat up water, turn it into steam, spin a turbine is that there's no fossil fuels in this process. The fact that involves fracturing into the earth makes a lot of more conservationists than I would say climate folks concerned. And so they're opposed often to things in terms of geothermal and I would add that the advantage that oil and gas has is they have a categorical exclusion for exploration projects on federal land, categorically excluded from NEPA, the National Environmental Policy Act. And a lot of the environmental communities just like they are across the board opposed to categorical exclusions. They just think any kind of carving out of the process, whether it's clean, is there solar, wind, geothermal, fossil fuels, obviously, like they just don't want to be carving out from that law because they view it as kind of sacrosanct. That's the left opposition. And the right opposition, I would say it's more just like oil and gas has the current advantage. And so they don't want to give subsidies to a new industry. And there's a lot of, on the right wing of the spectrum, there's skepticism around clean technology in general. And so they prefer to maintain the current status quo that favors oil and gas. Just really fast to follow up. You've written a little bit about how NEPA very much empowers people to stymie these different projects. It reminds me a little bit of our colleague, Chris Timbertsky, who's reporting on CEQA, which is weaponized by the NIMBs of California to stop all kinds of developments, but NEPA's much broader. And you write about how it gives enormous power to people to block innovative new projects. Could you just give us a sense of a few of the problems with that really fast? Yeah, so I think the key thing is for any large or medium-sized project, there are going to be some losers. Even if a project benefits 99% of the community, maybe one person who lives near a transmission line doesn't want the transmission line right next to their backyard. And like, I'm actually kind of somewhat sympathetic to that claim of like, that is a nuisance. That is a cost can be an eyesore for big infrastructure projects. But the key is these things need to be built somewhere. And we need to be doing projects that we can get as much consensus on as possible. We can't wait for 100% perfect consensus because you almost will never get that. And so when you have a tool like NEPA, and the key thing is that it allows people to sue the government if the environmental review was incomplete in any measure. By incomplete we mean, has it considered every potential environmental impact? And the way this law has evolved over the last 50 years is the term environment and impact have just been defined more and more and more broadly. And it's kind of this impossible problem to solve where like the documents are currently, you know, often more than a thousand pages long, but they can always be longer. There's always one more thing you didn't consider, right? And so it's a very low bar to clear in your lawsuit. You don't need to say that this harms the environment. You don't need to say that it's, you know, violates the Clean Water Act or the Clean Air Act, those substantive standards. You just need to say, you didn't consider this one potential impact. And then if you can prove that case in court, the court can issue an injunction against the project and stop it. They send the review back to the agency for another multi-year, you know, addendum to the original review. And that just stops it dead in the tracks. And then often the tactic here is delay, delay, delay. To just keep challenging it in court until the developer is like, I'm broke or the bank pulled my funding, I can't do this project anymore. That's funny. These are these like wonky environmentalist heckler speedos, essentially. You see this with Nipah, you see this with Nipah, and it's a story, you know, time and time again. And it seems like it's getting worse over time, not better. Yeah, it's absolutely reached a crisis point. And that's why you hear more and more about permitting reform in Washington DC. And like your colleague, it's also a state level issue because many states have their own environmental procedure laws. But I think the key thing for the audience to know is that we should be pretty positive about environmental substance laws like the Clean Air Act and Clean Water. They're not perfect, but when you have an objective standard of like, this is what your product is allowed to, you know, affect the air, affect the water. That's a much better standard than these procedural rules that say you have to comprehensively consider every potential impact. I think that's the kind of thing we need to get back towards and like this proceduralism has run amok at this point. Hey, thanks for watching that excerpt from our conversation with Alex Stapp of the Institute for Progress about Operation Warp Speed, the Trump administration plan to accelerate development of COVID-19 vaccines. If you liked it, you can watch the full interview right here or another clip right here.