text:
User talk:Superstoves

Hello and welcome to Wikipedia! Hope you like it here, and stick around.

Here are some tips to help you get started:

 * To sign your posts (on talk pages, for example) use the '~' symbol. To insert just your name, type ~~~ (3 tildes), or, to insert your name and timestamp, use ~~~~ (4 tildes).
 * Try the Tutorial, and feel free to experiment in the test area.
 * If you need help, post a question at the Help Desk
 * Follow the Simplified Ruleset
 * Eventually, you might want to read the Manual of Style and Policies and Guidelines.
 * Remember Neutral point of view
 * Explore, be bold in editing pages, and, most importantly, have fun!

Good luck!

cool
Thanks. yeah im in the process of doing the tutorial, it is really helpful

~

Helvetinjärvi National Park
Howdy. You modified the article on Helvetinjärvi National Park to indicate it's size was 44 square kilometers rather than the 38 stated in the park's own web site. I've changed it back to the 'official' figure for now - can you provide a reference for the source of your larger figure ? - TB 13:05, Aug 18, 2004 (UTC)

whoops
Ah. sorry about that, i was looking at http://www.guiadoscuriosos.com.br/lista.asp?id_cur=5596&id_cur_sub=3866, but upon further investigation it appears that that has no relevance whatsoever. i will try to avoid such mistakes in future.

Personal Attack
I have removed your "GAY" comment from User talk:Wile E. Heresiarch's talk page. Please read No personal attacks. func (talk) 06:55, 16 Nov 2004 (UTC)

yeh whatever mate. i think he got the idea.

Nomination of International Computer Games Association for deletion
A discussion is taking place as to whether the article International Computer Games Association is suitable for inclusion in Wikipedia according to Wikipedia's policies and guidelines or whether it should be deleted.

The article will be discussed at Articles for deletion/International Computer Games Association until a consensus is reached, and anyone, including you, is welcome to contribute to the discussion. The nomination will explain the policies and guidelines which are of concern. The discussion focuses on high-quality evidence and our policies and guidelines.

Users may edit the article during the discussion, including to improve the article to address concerns raised in the discussion. However, do not remove the article-for-deletion notice from the top of the article. – wallyfromdilbert (talk) 05:21, 2 December 2020 (UTC)

title: User talk:Superstoves


text:
User talk:Jadamus

Hello and welcome to Wikipedia! Hope you like it here, and stick around.

Here are some tips to help you get started:

 * To sign your posts (on talk pages, for example) use the '~' symbol. To insert just your name, type ~~~ (3 tildes), or, to insert your name and timestamp, use ~~~~ (4 tildes).
 * Try the Tutorial, and feel free to experiment in the test area.
 * If you need help, post a question at the Help Desk
 * Follow the Simplified Ruleset
 * Eventually, you might want to read the Manual of Style and Policies and Guidelines.
 * Remember Neutral point of view
 * Explore, be bold in editing pages, and, most importantly, have fun!

Good luck!

license: Creative Commons - Attribution Share-Alike - https://creativecommons.org/licenses/by-sa/4.0/

title: User talk:Jadamus


text:
User talk:TheHungryTiger

Hello and welcome to Wikipedia! Hope you like it here, and stick around.

Here are some tips to help you get started:

 * To sign your posts (on talk pages, for example) use the '~' symbol. To insert just your name, type ~~~ (3 tildes), or, to insert your name and timestamp, use ~~~~ (4 tildes).
 * Try the Tutorial, and feel free to experiment in the test area.
 * If you need help, post a question at the Help Desk
 * Follow the Simplified Ruleset
 * Eventually, you might want to read the Manual of Style and Policies and Guidelines.
 * Remember Neutral point of view
 * Explore, be bold in editing pages, and, most importantly, have fun!

Good luck!

Stanley Tedwick
I have added a "" template to the article Stanley Tedwick, suggesting that it be deleted according to the proposed deletion process. All contributions are appreciated, but I don't believe it satisfies Wikipedia's criteria for inclusion, and I've explained why in the deletion notice (see also "What Wikipedia is not" and Wikipedia's deletion policy). You may contest the proposed deletion by removing the  notice, but please explain why you disagree with the proposed deletion in your edit summary or on its talk page. Also, please consider improving the article to address the issues raised. Even though removing the deletion notice will prevent deletion through the proposed deletion process, the article may still be deleted if it matches any of the speedy deletion criteria or it can be sent to Articles for Deletion, where it may be deleted if consensus to delete is reached. Pascal.Tesson 12:51, 20 August 2006 (UTC)

File:Highwayman's hitch knot.jpg listed for deletion
An image or media file that you uploaded or altered, File:Highwayman's hitch knot.jpg, has been listed at Files for deletion. Please see the discussion to see why this is (you may have to search for the title of the image to find its entry), if you are interested in it not being deleted. Calliopejen1 (talk) 11:59, 20 April 2009 (UTC)

title: User talk:TheHungryTiger


text:
ICGA

ICGA may refer to:

 * Indian Coast Guard Academy
 * Imperial Continental Gas Association
 * Indocyanine green angiography
 * ICGA Journal – International Computer Games Association Journal

title: ICGA


text:
ICCA

ICCA may refer to:

Organizations

 * Indigenous and Community Conserved Area, areas in which there are close associations between indigenous people or a local community and a specific territory or natural resources
 * International Congress and Convention Association, organization in the meetings industry
 * International Correspondence Chess Association, now the International Correspondence Chess Federation
 * International Council of Chemical Associations
 * Inter-parliamentary Coalition for Combating Antisemitism, an international coalition

Other Uses

 * The International Conference on Clifford Algebras and Their Applications in Mathematical Physics, a triennial conference series in Clifford Algebras
 * International Championship of Collegiate A Cappella, an international competition for student-run and -directed a cappella singing groups
 * ICGA Journal, formerly ICCA Journal

title: ICCA


text:
Talk:ThunderCats (1985 TV series)/Archive 1

Voice of Lion-O
I strongly doubt that Larry Kenney supplied the voice of Lion-O in the latest episode of Robot Chicken. It sounds very much like Family Guy creator Seth MacFarlane... in fact, I'm almost certain that it's him, since he frequently uses that same irate monotone voice on both of his shows. Could someone confirm this? M.Neko
 * I have marked that statement in the article as requiring a citation. - Seinfreak37 15:44, 23 August 2006 (UTC)
 * It is Seth MacFarlane. Here's a link Bluesmanjay (talk) 15:58, 28 February 2008 (UTC)

Robear Berbils
It is truly a travesty that this page lacks any mention of the Robear Berbils.

Fixed. Jack Cain

In addition, the article says that it was due to the Ro-Bear Berbils that Tygra could build Cat's Lair so quickly, but Tygra wasn't the only ThunderCat to build it. The episode clearly states as such. The article should read that it was due to the help of the Ro-Bear Berbils that the ThunderCats were able to build Cat's Lair so quickly. --Bentonia School 13:26, 28 May 2007 (UTC)

Repopulation
How did the Thundercats intend to repopulate the planet with other thundercats wen there was only 1 female? Not very good planning. Chris H - UK.

Same goes for the Smurfs, really. Good lord! I theorize that some of the others (Smurfs, not Thundercats) were less-obvious females..
 * Actually, there are two females, Wily-kit is also female. Of course, she's also a little young ;) --Wilykit 15:15, August 10, 2005 (UTC)

 * The Smurfs are all males, actually. Smurfette is an artificial creation of Gargamel, not a real Smurf.  Why do I know things like that? - 67.191.254.83 18:27, 22 August 2006 (UTC)

--- Hey, one of the greatest cartoon series I have ever seen. Jorge, Mar del Plata,Argentina

 * With.. humans? *shrugs* It was just one of those little plot things they put it, most likely. Like most early cartoon shows. Disinclination 03:21, 8 September 2006 (UTC)

Original airings
Where did the series originally air in their respective countries? Timeslots? I mainly ask because the guitar in the theme song sounds very similar to guitars used on CBS Storybreak. Coincidence?

Profanity
Is it really necessary to have a strong profanity in this article? I replaced the word with f**k but this was reverted back. It's as if someone has gone out of their way to put a swear-word on this article. —Preceding unsigned comment added by Marky1981 (talk • contribs) 23:03, 26 February 2005 (UTC)

 * I've removed the reference that contained this profanity. Parodies on the internet that dub new dialog over the actual clips are not "Outtakes", and have nothing to do with the actual series. MrItty 17:14, 4 Apr 2005 (UTC)

 * Actually, Larry Kenney, the voice of Lion-O and Jackalman (among other characters), has gone on record as stating the "Outtakes" from Thundercats are, in fact, real. It's even confirmed in Matt Blank's interview.DrachenFyre 23:52, Apr 4, 2005 (UTC)

 * Whether the outtakes are real or not is besides the point - i.e it is unnecessary and irresponsible for a credible encyclopedia article to have strong (or any) profanity. The only exceptions to this would be articles about the etymology of such words for example, and then it should be objective and NPOV. This is clearly not the case for the ThunderCats article! Marky1981 09:14, 5 Apr 2005 (UTC)

 * Hmm. Very well then. DrachenFyre 14:32, Apr 5, 2005 (UTC)
 * If this comes up again, here's wikipedia's policy on profanity.--Starwed 18:32, 14 December 2005 (UTC)

Contrary to what Marky has said it would also be acceptable to give examples of profanity in popular culture where it is well known. A show such as South Park features heavy use of profanity and as such the article would be incomplete without examples and discussion on it. Its a little cloudy here but wiki is not censored for minors so theres nothing wrong with discussing profanity in a childrens cartoon but wiki is not out to offend so profanity should not be used unecessarily. I would not object to one quote of a profanity while discussing the outtakes here as i consider it important to that discussion, although I wont push for it as its not overly important to the article as a whole.

Does anyone know if the outtakes are subject to copyright? If not I'd like to link to them its a better solution than having them written on the page.

Heres the best summary of the history of the outtakes i found: http://claws2.nfshost.com/node/254 Discordance 19:02, 5 February 2006 (UTC)

Third Earth = our Earth?
Has Third Earth been confimed officially that it is our Earth (in the future)? If not, we should either delete "(which is our own planet earth in a distant future)" or change it to something like "(which is speculated to be planet Earth in a distant future)" Marky1981 11:34, 24 Jun 2005 (UTC)

I really dont know, you should go ahead and do it. Jack Cain

Aside from Egyptian architecture (like Mumm-Ra's and Mumm-Rana's pyramids with obelisks), the specific mentioning of "Egyptian" by Mumm-Ra himself in episode "Pumm-Ra", the Egyptian hieroglyphs, Wizz-Ra (and his Egyptian helmet), Hachiman and the code of Bushido, the legend of King Arthur and the appearance of Merlin, and the Berzerkers (just to name a few), all evidence points to Third Earth actually being a future Earth. Obviously, there must have been not one but TWO cataclysmic events in the planet's past which forces it through two "ages"... DrachenFyre 22:52, Jun 24, 2005 (UTC)

 * I've modified the line accordingly - feel free to modify Marky1981 23:59, 24 Jun 2005 (UTC)

This guy sure knows his cartoons. —Preceding unsigned comment added by 62.57.160.130 (talk • contribs) 20:47, 17 August 2005 (UTC)

The ThunderCats ship also passes jupiter on its way into the system in the first episode, you can clearly see the eye of jupiter on the planet. Then there is a shot of a red planet with earth in the distance. Less convincing than DrachenFyres evidence but another example nonetheless Discordance 18:26, 5 February 2006 (UTC)
 * Considering the date in which the cartoon series was created, it wouldn't be suprising that they took images from our own solar system to use. Disinclination 03:16, 8 September 2006 (UTC)

I reverted a change made by an unregistered user who stated that in one episode of the series, one of the main characters attempted to sort out a moment of confusion with an historical reference, saying "Back when this was still First Earth..." as no source was provided. Rather than leave clearly unsourced material in the article, I'll post this comment here. Can anyone back this up? Which episode was this, who stated this, etc. - Seinfreak37 20:19, 13 September 2006 (UTC)

 * OK, I already found a reference on another forum. A user stated that "in the early episode Unholy Alliance, when the Mutants first meet Mumm-ra, Mumm-ra makes mention of the time when the planet was still known as First Earth."  This is season 1, episode 2.  Can someone watch this episode and see if this is indeed stated, and in what context?  - Seinfreak37 20:26, 13 September 2006 (UTC)

 * Err... Given all the evidence provided during the series (ie. Egyptian culture, the existence of King Arthur in the past, references to and artifacts of our time being present everywhere, the fact that Earth is in the name of the planet, the identical solar system arrangement, mineral and metal presence being highly similar, and more) whether it is directly stated that Third Earth is our Earth, or not, seems to be irrelevant, since the material indicates that this is the case. The evidence may be circumstantial, but the overwhelming amount of it should be taken into consideration, and since the article already states more or less that Third Earth is our Earth, except for one line saying it isn't certain, there's no reason to revert back from what that other user had added in.

 * I don't recall Mumm-Ra ever saying "Back when this was First Earth" and I have all the episodes from Season 1 to Season 2 Volume 1 on DVD so far. I will check and see later today, though, just incase I am wrong (as I may well be, since my memory can be a bit shoddy at times).

 * Daishokaioshin 20:33, 13 September 2006 (UTC)

 * I reverted because a user stated that in "some episode" that "some character" stated "something along the lines of...." - not very encyclopediac in my opinion. It would be better to get all your ducks in a row, get the complete quote, then add this comment.  I have the episode and will watch when I can, get the appropriate information, and add to the article if necessary (unless someone beats me to it). -Seinfreak37 20:39, 13 September 2006 (UTC)

Admittedly that edit comes from something I remember from almost two decades ago, but the line I quoted was clearly stated in the series. I am 90% certain that the exact quote was "Back when this was still first earth..", and 100% certain about what the quote meant. Even if you were to ignore this reference, there are just far too many other references in the series to things that exist in our world today for it not to be Earth sometime in the future. Vanessaezekowitz 23:13, 13 September 2006 (UTC)

If anyone is interested: After Slythe asks: "You know of the Eye of Thundera, yes?", Mumm-Ra replies: "I have known of its power for a thousand years, from a time when this was still First Earth." 1:15 of http://www.youtube.com/watch?v=ifB2RjC26e4 Ragzouken 19:13, 29 December 2006 (UTC)

Re: First/Third Earth. I remember a UK strip (I'm pretty sure it was an annual, rather than a regular comic) where Lion-O was tricked into entering some cave of... mists.... thing... and was sent back in time to First Earth, where he witnessed Mumm-Ra constructing his pyramid. In fact, in a rather cliched time-travel paradox, it turns out it was Lion-O who gave him the idea for his sarcophagus or something like that, explaining that he knew he was evil and what he was going to do, and so Lion-O is inadvertently responsible for Mumm-Ra's presence on Third Earth. At that time, Mumm-Ra had tricked the people (who looked human) into thinking he was a good and benevolent ruler. He was also able to remain in his Ever-Living form indefinitely, not yet withered by the vast passage of time.

Cheetara was the only 'Cat with Lion-O, and she was also tricked into going through the portal, but she ended up in (I think) Fourth Earth, again helping human-alikes, this time wearing typical futuristic sci-fi shiny suits, defending a family from big flying insect things.

That's almost as much detail as I can remember, in case I've jogged someone's memory. I've no idea if it was considered canon, but if anyone has the annuals knocking around it would be a good place to look. Spiral Wave 01:26, 5 February 2007 (UTC)

There was never a statement in the series relating Third Earth to our Earth. Sure, there is the whole "First Earth" quote, but that doesn't relate it to our planet. The presance of humans doesn't make it our Earth. We can't whip out the forensic scientists to tell us if these were the same planet. The presence of any type of Egytian artifacts does not mean it's our planet. If Egyptians artifacts were a vaild argument, then you could use the logic "well Third Earth has unicorns, unicorns are fictional, therefore Third Earth existed in an alternate universe and has no relationship to our planet". The best that can be done is that we can speculate about what the author's did or did not intend. That being said, speculation is not fact and does not belong on Wikipedia. If there is an official statement from an author or producer about what the intention was, then we can state how our planet relates to Third Earth. I am removing reference to Third Earth being related to our Earth unless there is hard evidence, not speculation, that justifies it.Bridger.anderson (talk) 18:40, 23 March 2008 (UTC)

Question: Would a visual representation of Third Earth on a computer screen within the show itself, one showing the planet as having the same continental outlines as our planet, be sufficient evidence? If so, someone should check out the episode "The Last Day" (Season 3, episode 20). I believe I saw just such an image when I watched the episode on my DVDs a few hours ago. If so, it might be the hard evidence needed to put the issue to rest. —Preceding unsigned comment added by FlameStrike (talk • contribs) 13:58, 9 May 2008 (UTC)

Being an encyclopedic website, there should be a quote either directly from the series or from an author relating it to our planet. All of the similiarties between the cartoon and our planet are not hard evidence. There are more examples of dissimilarities in the series than of similiarites, however similarities and dissimilarites are irrelevant, there needs to be a quote from either one of the authors, or the series itself.153.90.192.96 (talk) 17:45, 3 July 2008 (UTC)

Also, factual statements such as "there are many similiarites to our Earth and Third Earth some of which include Egyption Artifacts, etc" would be acceptible in the main article. I would go so far as to say that it is appropriate to create a section "similarities of third earth to modern day earth" and list the similiarties.Bridger.anderson (talk) 21:01, 7 July 2008 (UTC)

first episode
I recently saw the first episode of thundercats again and it never mentions that lion-o's pod malfunctioned. —Preceding unsigned comment added by Duokenshin (talk • contribs) 20:21, 2 September 2005 (UTC)

However, it is generally accepted by the fanbase that his pod malfunctioned. How else could he have aged so rapidly yet none of the other ThunderCats did? - DrachenFyre 20:36, September 2, 2005 (UTC)

 * i jus saw it too, and the explanation given there is not that it malfunctioned, but that ageing did occured on the pods. —Preceding unsigned comment added by 200.113.116.135 (talk • contribs) 17:55, 5 February 2006 (UTC)

the exact quote from jaga is "although the suspension capsules slow down the aging process some aging does take place", he may be saying the capsules arnt 100% reliable and are pronce to malfunctions, in episode 82 they are disposing of the capsules because they are dangerous. Later in the second episode tygra says Lion-O spent 10 years in suspension, considering he appears to have grown from a youth to a young adult this implies the pods completely failed to have any effect on Lion-Os aging. This makes it fairly clear that the pod has in some way malfunctioned. Discordance 18:20, 5 February 2006 (UTC)

I remember the comics clearly stated that he aged more quickly due to pod malfunction, but I don't have a copy of anymore so can't add a reference.

Seasons?
I know there are webpages out there that say Season 2 was 1986-7, but I remember when seeing the episodes air a few years ago (2001 to be precise), the copyright date at the end of some of them was 1987 and for others 1988. I remember seeing somewhere that Thundercats went into a 1 season hiatus for the 1986-7 season while 65 episodes of the cartoon series Silverhawks were aired (a show which featured some of the same voice actors as Thundercats). The only Thundercats episode/s produced in that span was Thundercats! Ho!, a 5-parter which introduced the 3 other Thundercats. That may have been first released as a video before being broken up into episodes for syndication.

Episodes with 1987 in their credits span from "Mumm-Ra Lives! Part I" to "Vultureman's Revenge". Episodes with 1988 in their credits span from "Thundercubs Part I" to "The Book of Omens". I've seen some sources say from "Return to Thundera Part I" to "The Book of Omens" were aired in the 1989-1990 season. I'm not sure what that is about, though it might be possible they filled their remaining episode order in terms of production in 1988 and just held half the episodes over to make another season out of the episodes made (A 5th season of Futurama aired even though there were only 4 seasons of production. That "season" was made from several unaired episodes from previous seasons).

By the way, a lot of webpages out there operate on certain assumptions with cartoon series. They assume 65 episodes will be aired 5 episodes a week for 13 weeks without any mistakes in airing or delays in production of some episodes. These cannot be considered reliable because we don't know if the webpages actually confirmed the airdates or just looked for the first Monday of September and started counting off air dates from there on out. What I'm saying is we don't know for sure if the episode airdate list is correct and has been generated by looking at actual data or if it is just a theoretical list of when episodes most likely aired. In the case of Thundercats, it is known to be false.

And many series have 65 episode orders but don't air all 65 episodes over a single season. Transformers for example, aired 16 episodes in Season 1 and 49 episodes in Season 2 (16 + 49= 65) and G.I. Joe produced two 5 episode mini series in 1983 & 1984 before getting a first season and that season had 55 episodes (50 if you count the 1985 Mini-Series as separate from the 1985-6 Season).

I would ask for the 1986-7 data to be confirmed. If it cannot be, then the wiki page should state the lack of certainty regarding when the second half of the series aired. —Preceding unsigned comment added by 139.67.201.239 (talk • contribs) 21:35, 4 November 2005 (UTC)

I recently split the episode guide into 4 seasons and then back into 2 based on various information I found on the internet, although I would question the air dates I have put on the page now. Here is a scan of a script cover for episode 123: http://www.purrsiathunder.org/graphix/scripts/script123/Scan0002.jpg Labeled August 10th 1988... So i doubt it could have aired November 28th 1986 like my other source states. I'm at a loss of how to reliable find the correct dates. Discordance 19:11, 5 February 2006 (UTC)

From the script covers ive found season 2 seems to have been written by february 1987, season 3 febraury 1988 and season 4 august 1988, probably being shown 1987-88, 1988-89, and 1989-90 which are the rough dates I got from here http://tcats.shipunderground.com/episode.html

Perhaps I should self revert back to Discordance 19:26, 5 February 2006 (UTC)

I wonder if anyone knows someone who worked for a tv network in programming in the late '80s who had a good memory. Hmmm, would any records exist, like documents of orders to air what episodes when, like daily schedules for channels? I don't know enough about behind the scenes television to know how it precisely works.

 * Correct, the "original airdates" commonly listed online are untrue. ThunderCats HO! aired in '86, first showing one Friday night as a full-length movie, later split into 5 parts that were cycled into regular episode rotation. Then Silverhawks came to air in 1986-87, bumping ThunderCats by a half-hour. Mumm-Ra Lives (1-5) aired (again, first as a full-length movie) one weekend afternoon in 1987. (...I actually have that page from the old TV guide listing clipped out, somewhere. One couldn't help notice that the tone of the show had skewed younger/dumber from this point.) At the time, apart from recording all those original airings, I kept a personal calendar record of day-by-day episode listings (which I still have...somewhere) because in that age before such information was made available through the magical internet, I was trying to figure out for myself the official episode chronology (and also because I was cartoon obsessive :p) but soon discovered that station airings were inconsistently ordered in any event. Of the remaining Season Two episodes, Cat Fight up until Ravage Island came scattered between rerun episodes throughout 1987-88, and sometime later (after still more reruns of all of those) followed by the span from Time Switch to Vultureman's Revenge, as I recall.  The episodes from Thundercubs (1-5) onward didn't show up until the 89-90 season,  when the show had moved from weekday afternoons to an early morning timeslot. ~ 172.144.130.85 17:22, 17 January 2007 (UTC)

The infobox had the series running from 1985 to 1987, contrary to the prose (the final season being 1989 to 1990). I've changed the infobox accordingly, but we could do with a reference, especially since IMDb states it as running from 1985 to 1987. - Dudesleeper / Talk  19:13, 16 October 2008 (UTC)

New series?
I have heard a bunch of rumors about a new Thundercats series being developed for Toonami? Does anybody know if this is true? —Preceding unsigned comment added by 216.101.81.251 (talk • contribs) 01:00, 3 March 2006 (UTC)

I haven't heard anything. Can you provide sources where you heard this? - Seinfreak37 16:56, 3 March 2006 (UTC)

Edit: Found a mention on a fan-forum, still no source provided however: "Warner Bros. Animation is working on a new Thundercats series. The initial info says they are planning for a late 2006 release but that probably will be pushed back. Yes a T-Cats revival it's not all that surprising given TMNT, Transformers, He-Man and GI-Joe all have had revivals within the past 5 years and only more revivals will be on the way it seems." -Seinfreak37 16:59, 3 March 2006 (UTC)

Here is confirmation: http://news.toonzone.net/article.php?ID=5390 --Atomic Duck! 22:58, 13 July 2006 (UTC)

 * Note: "Confirmation" in quotes: the story is nearly a year old (dates to 8-24-2005) -Seinfreak37 15:22, 14 July 2006 (UTC)

Here's a link (third paragraph) which states that a new series is in the works, as well as new collectibles and more stuff. It has been rumored before, yet there was no vaild information. Now it's confirmed and it's only a matter of time, so be alert! —Preceding unsigned comment added by MJBFitzgerald (talk • contribs) 18:55, 17 August 2006 (UTC)

 * copied relevant section: "Warner Bros. is also working on securing new licensees to re-launch the ‘80s animated series, The Thundercats. Warner Bros. has the classic as well as new licensee to develop product for children, including an updated Thundercats look and collectibles for early fans."

This does state nowhere that a new series is in the works, it states that WB wants the liscencees (which it may not get). It mentions collectibles and new look, but not a TV series. A relaunch might be just a comic book series. --Anibas 19:00, 17 August 2006 (UTC)

I read recently on a message board that a new series is in development from the same company that did Teen Titans, if anyone can documented info on this it would be a great addition to the page. —Preceding unsigned comment added by 66.109.248.114 (talk • contribs) 23:28, 24 August 2006 (UTC)

Natives of Third Earth
This section needs expanding, I dont have time to do it right now, but mafetet appears briefly for one episode and gets half the section, whereas the warrior women havnt even been mentioned, their queen and another warrior woman are among the major supporting characters in the series. Discordance 11:12, 17 March 2006 (UTC)

Bengali and Tygra...brothers?
I recall in Part 5 of Thundercats Ho! The Movie, Tygra grasps Bengali's hand and shoulder, saying "Brother". Now, after that, it was NEVER MENTIONED AGAIN during the remainder of the run of the show. I don't believe that it was ever intended to have Tygra and Bengali as "brothers" in the blood sense. Rather, it was probably meant to mean Tygra and Bengali as "brothers" in the sense of being from the same "tiger clan", for lack of a better term. I reiterate...it was NEVER MENTIONED AGAIN in the show. Does that constitute them being blood brothers or clan brothers? - The One and Only 23:51, 26 March 2006 (UTC)

I think "brother" was meant as a fellow Thunderian.But you're right about them being of the "tiger clan" as the two of them bear a striking resemblense.The only significant differences between their appearnces are their colours. I actually mistook them for the same person until I saw Bengali appear in the cartoons.Nadirali 17:21, 8 December 2006 (UTC)Nadirali

Spoiler Warnings
I took the liberty of adding spoiler warnings on this article. There are various plot details revealed and I feel a notice is necessary.

I'm confused
I just purchased Season 2, part I as a gift. It contains 34 episodes. Yet, this article states that seasons 2-4 contain 20 episodes each. Am I missing something?

You purchased "Season 1, Part 2". Season 1 had 65 episodes and was broken into 2 parts for release since 65 episodes is *a lot* of DVDs to bundle in one box. Many other cartoons that released DVDs which had seasons of 40 or more episodes broke those seasons into 2.

 * _;

Well, the article itself remarks that the Season 2 DVDs come in two boxes, totaling 65 episodes, so the introduction is probably wrong.

Unsourced material
Do we have citations for any of this? - brenneman  {L} 08:56, 3 July 2006 (UTC)
 * Material added

Insignia
Both the insignia and the jewel embedded in the Sword of Omens were referenced as the "Eye of Thundera". Check the episodes "Snarf Takes Up The Challenge" and "The Ghost Warrior". In "Snarf Takes Up The Challenge", Tygra comes upon a crystal labyrinth with carved Tygra heads. As he looks at the door, emblazoned with the ThunderCats insignia, he goes..."The Eye of Thundera?". In the episode "The Ghost Warrior", when Grune is attacking Cat's Lair, Lion-O takes out the Sword of Omens and proclaims "Your fate will be sealed by the symbol you betrayed, Grune...the Eye of Thundera!" Two on-screen and canonical pieces of information for ya! - DrachenFyre > YOU! 22:48, 17 August 2006 (UTC)
 * Hey I don't have the DVD's so I can't check the episodes, but I'll take your word for it. Technically though "The Eye of Thundera" is the jewel embedded in the Sword of Omens, and the Insignia is really just exactly that, an insignia which identifies Thundercats. --NeilEvans 22:54, 17 August

2006 (UTC) Well as the jewel embedded in the sword of omens changes its appearence from the cats eye to the insignia when ever Lion-O uses it to call the Thundercats I would say it was reasonable to refer to both images as the Eye of Thundera. Elaverick 14:56, 16 February 2007 (UTC)

Was Ted Wolf British?
Just read this review on IGN's Website about Season 2, Volume 2's DVD box set and it claims that Ted Wolf was British, not American.

IGN REVIEW HERE

Does anyone know if this is true or a mistake?

He may be mixed up with the series "Natural Born Kittens" which is another animated anthropromprohic cat show breated by a Brit, Funded in America and animated in Japan out soon.

Any help?


text:
Talk:Dawes Rolls

Untitled
This article needs some research and rewriting. Including these areas:
 * The Dawes Rolls were created by the Dawes Commission, not the Dawes Act.
 * The Dawes Rolls do not include all Indians, generally only memebers of the Five Civilized Tribes.
 * John Ross, Cherokee chief, was only 1/8th "blood".
 * There are several legal cases recorded of non-Indians bribing Indian officials in order to acquire an Indian allotment.
 * At least one of the Nations enrolled their former black slaves, who may or may not have had Indian "blood".

— Dan, 16 Aug 2004

Original Article moved here from Main Page

Dawes Rolls are registered enrollments of Native American people in the United States under the Dawes Act of 1884.

The Dawes Act requirment for enrollment was not generally actually accomplished until well after the passage of the Act, in the early 20th century. The prevailing legal theory of the time was that one needed to have Native American blood in excess of 25% ("quarter blood") in order to be considered a Native ("American Indian").

These enrollments have important legal ramifications today. For most tribal groups they represented the first written records of membership. Generally one can prove Native American status sufficient for participation in programs limited to Natives by showing lineal descent from a person listed on the Dawes Rolls.

It should be noted that at the time of the Dawes enrollment, there would be little incentive, and considerable disincentives, for being enrolled if one's status were questionable. Considerable disabilities, both legal and social, were inherent in being considered a Native American in that era. Social stigmitization of being considered racially mixed was considerable, especially so in some areas, and Native Americans were additionally in an inferior legal position in many jurisdictions.

As unfortunate as this seems to modern sensibilites, these circumstances have led to one valuable attribute of the Dawes Rolls. At the time, very few real benefits accrued to one simply because of Native status. There were few petroleum royalties, no casino shares, or other pecuniary motives for wishing to be considered Native American. Thus, persons listed in the Dawes Rolls are almost certainly to be genuine Native Americans, not simply persons wishing to "pass" as Natives. This is important for establishing relationships in the modern era, where many people desire to be considered as Natives for the considerable benefits that can accrue, especially to members of certain groups, due to the factors listed above, and others.

Another unfortunate aspect of these circumstances is that many persons who were largely or almost entirely of Native blood did not desire to be considered such due to the tremendous stigmatization that existed in some circles, meaning that hundreds of thousands of Americans today are of largely Native ancestry but unable to document it through use of the Dawes Rolls, and must find another means of documentation should they desire it.

There’s a couple of things I’d like to say. First of all, many people of Non Indian ancestry applied to the Dawes Rolls because they wanted allotments. There were even shady lawyers traveling around the country at the time coercing white people to try and enroll for the allotments. This is part of the reasons that over 150,000 applications were denied. Only about 100,000 were accepted while over 250,000 applied.

Second, while some American Indians such as Redbird Smith “initially” didn’t enroll, he as many others were coerced into enrolling later. Other American Indians that refused enrollment were forced to enroll by the local authorities, and also, many more were enrolled against their will by people in their communities. There were probably only handfuls that didn’t enroll either because they didn’t want to or because of the residency requirements. Allotments were an incentive to enroll, so most choose to. You also say that there are hundreds of thousands of Americans today of largely Native Ancestry who can’t document it through Dawes. This is also a myth. We’re probably only talking about a few thousand in regards to the Dawes Roll. And even that’s pushing it. If we’re talking about the entire geographical United States in regards to people with Native ancestry and not documented, then of course it would be more. But with that said, having Native ancestry is no more then a legend for many. In regards to the Dawes Roll, most of the people rejected were rejected because they were deemed not to be Cherokee, Choctaw,etc, by blood, and they could not prove it. Since many Cherokees at the time had blood quantums of 1/8 or 1/16, it would be hard to tell a white person from a Cherokee, thus these people who tried to enroll tried to pass themselves off as mixed blood Cherokees. There probably are a small number of people today with at least some Native blood who are descended from the few people that didn’t enroll. Many people claim to be these people yet they cannot document themselves to many of the other Rolls and censuses of the 1800's before Dawes such as the Drennan Roll taken after the Trail of Tears. Many descendants of rejectees falsely assume they have Native blood when in fact they are the descendants of white people trying to get allotments. I suggest you study the history of the Dawes Roll more in debt. LightingBug (talk) —Preceding undated comment added 06:35, 17 January 2010 (UTC).

This is really unfair. I wont sit here and pretend to know everything about this subject, but one thing I do know is, the people who did not register, be it by any reason, not everything is effectively documented. Only one requirement is needed to verify native blood, and that one requirement is very narrow and utilizing one register which is not 100% accurate at all. How is that process fair in any way regarding one's native blood? Yes, there is a "main" sense of lineage that may be registered, some of it may even be false. But, to deny any one who is obviously (by sight) native american, is not what I had anticipated as a young man wanting to honor my heritage but "officialy" cannot due to this. — Preceding unsigned comment added by Emmettray81 (talk • contribs) 12:11, 15 July 2011 (UTC)

title: Talk:Dawes Rolls


text:
The Naked Civil Servant

The Naked Civil Servant is the title of two biographical works, both based on the life of Quentin Crisp:

 * The Naked Civil Servant (book) is Crisp's 1968 autobiographical book
 * The Naked Civil Servant (film) is a 1975 television film based on the book

title: The Naked Civil Servant


text:
Wikipedia:Articles for deletion/Musical Interpretation

Spotted this on cleanup and don't think it's salvageable. It reads like an essay or a magazine article; I think it'd be better to delete and start from scratch than to shoehorn it into something encyclopedic. Mindspillage 14:47, 16 Aug 2004 (UTC)
 * Delete: Original research. The topic is worthy, but anyone writing on the subject would be dissuaded from it by seeing this article, rather than encouraged.  Further, "musical interpretation" is a term not for "how to understand music," but "how to musically interpret a composer."  I.e. Elvis Costello has become a "musical interpreter" since he began crooning Burt Bacharach songs.  Liza Minelli is an interpreter.  On the other hand, music criticism is usually called musical criticism or "musical appreciation."  Geogre 16:49, 16 Aug 2004 (UTC)

 * Keep: However the written matter is very much from a personal view point, but there are few decent ideas. The article in its current personal narrative form is not worthy for an encyclopaedia even by any liberal standards. It has to be thoroughly rewritten. The subject could be discussed in a more rigorous and objective manner. Like say the aesthetic interpretation of music (orchestral) or the appeal of instrumental music or the like. However just as George said it should not be confused with the technical interpretation of written music, and may be one could also write another article dealing exclusively with the rigours and techniques of the interpretation of a complex orchestral score. Water Fish 19:16, 16 Aug 2004 (UTC)

 * Keep, or move this to a /temp page and replace with a stub and pointer to the temp page. There is, in fact, valuable information in the essay that may be of help to someone who wishes to write a proper article.  The text also becomes somewhat less autobiographical towards the end.  Smerdis of Tlön 19:31, 16 Aug 2004 (UTC)

 * Delete. Definitely an essay, and written from the first person and, as such, that implies heavily that it's original research. An article on this subject IS desired, but not the existing one. I don't think this much original research can be easily cleaned up. Sorry, whoever wrote it. Hope it got a good grade. --Golbez 21:24, 16 Aug 2004 (UTC)
 * Personal essay that's had almost two years to be fixed up. Delete. -- Cyrius|✎ 01:50, 17 Aug 2004 (UTC)
 * Delete. Personal essay.  Postdlf 03:18, 17 Aug 2004 (UTC)

 * Delete. Fire Star 20:56, 17 Aug 2004 (UTC)

 * Keep stubbed to basic defintion, will expand when I get the chance, it is an important topic, which is probably why it survived this long Stirling Newberry 01:58, 19 Aug 2004 (UTC)

 * Keep now that Stirling has stubbed it. An extremely important topic for an article, and it has potential to be a very fine one; the original essay obviously did not belong, but now it's toast.  Antandrus 01:38, 20 Aug 2004 (UTC)
 * Keep. This is a Wikipedia, it is possible to start from scratch without listing things on vfd and deleting them first.--Dittaeva 11:46, 21 Aug 2004 (UTC)

 * Delete. Much of this is no more than the sum of the terms ("music" and "interpretation"). Else, should be merged into music. - Centrx 23:19, 21 Aug 2004 (UTC)


text:
Duramax V8 engine

The Duramax V8 engine is a family of 6.6-liter diesel V8 engines produced by DMAX, a wholly owned subsidiary of General Motors in Moraine, Ohio. The Duramax block and heads are supplied from reliable vendors of General Motors. This engine was initially installed in 2001 Chevrolet and GMC trucks, and has since become an option in pickups, vans, and medium-duty trucks. In 2006, production at Moraine was reportedly limited to approximately 200,000 engines per year. On May 9, 2007, DMAX announced the production of the 1,000,000th Duramax V8 at its Moraine facility, followed by the 2,000,000th on March 24, 2017.

LB7
RPO LB7 (engine code "1") was first introduced in 2001 and continued until early 2004. It is a 32-valve design with high-pressure common-rail direct injection and an experimental composite design cylinder head.

The following trucks use the LB7:
 * Chevrolet Kodiak/GMC TopKick
 * Chevrolet Silverado/GMC Sierra HD

Specifications
The LLY was introduced in 2004 and completely replaced the LB7 by mid-year.
 * Block / Head: Cast Iron / Aluminum
 * Compression: 17.5:1
 * Injection: Direct; Bosch high-pressure common-rail
 * Power / Torque: 300 hp at 3,100 rpm / 520 lb.ft at 1,800 rpm

LLY
The LLY (internally called the 8GF1) (engine code "2") is a 6619 cc turbocharged engine which debuted in mid-2004 and continued until the end of 2005 (except the Hummer H1 in 2006). It is a 32-valve design with high-pressure common-rail direct injection and aluminum cylinder heads. The LLY was GM's first attempt to implement emissions requirements on their diesel trucks. To meet this goal, they turned to a newly developed Garrett turbocharger with a variable geometry vane system and installed an EGR valve. Learning from problems with injectors in the previous LB7, GM changed the valve covers to allow access to the injectors without having to remove the valve covers, saving significant labor costs if injector replacement became necessary.

The following trucks used the LLY engine:
 * 2006-only Hummer H1 Alpha
 * Chevrolet Silverado/GMC Sierra 2500HD/3500

Specifications

 * Block / Head: Cast gray iron / Cast aluminum
 * Compression: 17.5:1
 * Injection: Bosch high-pressure common-rail
 * Power / Torque: 310 bhp at 3000 rpm / 605 lbft at 1600 rpm
 * Head casting is 8GF1
 * Block casting is #22351021213

LLY/LBZ
There are two VIN codes for the LBZ. The first is VIN 2 produced in late 2005 and early 2006. The VIN 2 engine is mechanically and physically the same as the VIN D engine but utilizes LLY engine tuning due to the LBZ tuning taking longer to be EPA certified and placed into production.

The second is VIN D. This was introduced in 2006 and continued into 2007 sold only in the "classic" body style. It has an improved engine computer tune that produces increased power and torque over the 2005 LLY version of the engine. This also marked the first appearance of the Duramax in the Express/Savana vans. The LBZ is one of the more sought-after Duramax engines because of its strength, reliability, and being pre-emissions (DPF appeared on the next generation LMM in 2007).

Changes include:
 * Cylinder block casting and machining changes strengthen the bottom of the cylinder bores to support increased power and torque
 * Upgraded main bearing material increases durability
 * Revised piston design lowers compression ratio to 16.8:1 from 17.5:1
 * Piston pin bore diameter increased for added strength
 * Connecting rod "I" section is thicker for added strength
 * Cylinder heads revised to accommodate lower compression and reduced cylinder firing pressure
 * Maximum injection pressure increased from 23000 psi to more than 26000 psi
 * Fuel delivered via higher-pressure pump, fuel rails, distribution lines and all-new, seven-hole fuel injectors
 * Fuel injectors spray directly onto glow plugs, providing faster, better-quality starts and more complete cold-start combustion for reduced emissions
 * Improved glow plugs heat up faster through an independent controller
 * Revised variable-geometry turbocharger is aerodynamically more efficient to help deliver smooth and immediate response and lower emissions
 * Air induction system re-tuned to enhance quietness
 * EGR has larger cooler to bring more exhaust into the system
 * First application of new, 32-bit E35 controller, which adjusts and compensates for the fuel flow to bolster efficiency and reduce emissions

LBZ applications:

LLY applications:
 * Chevrolet Silverado 2500HD/3500
 * Chevrolet Kodiak
 * GMC Sierra 2500HD/3500
 * GMC TopKick
 * Chevrolet Silverado/GMC Sierra 2500HD/3500 Classic
 * Chevrolet Silverado 2500HD/3500
 * Chevrolet Kodiak
 * GMC Sierra 2500HD/3500
 * Chevrolet Express full-size (reduced power output mated to a 4L85E transmission)
 * GMC Savana full-size (reduced power output mated to a 4L85E transmission)

Specifications

 * Block / Head: Cast gray iron / Cast aluminum
 * Compression: 16.8:1
 * Injection: Bosch high-pressure common-rail
 * Power / Torque: 360 bhp @3200 rpm / 650 lb-ft @1600 rpm

LMM
The LMM (engine code "6") debuted part way through 2007 and ended production with the start of the 2011 calendar year and is mated to the 6-speed Allison transmission. The LMM was the only Duramax offered for model years 2007–2010. A version was used in the Trident Iceni.

Specifications

 * Block / Head: Cast gray iron / Cast aluminum
 * Compression: 16.8:1
 * Injection: Bosch high-pressure common-rail with CP3.3 injection pump
 * Power / Torque: 365 bhp at 3200 rpm / 660 lbft at 1600 rpm

Emission controls:
 * Additional combustion control, including an even more efficient variable-geometry turbocharging system, cooled (enhanced) exhaust gas recirculation (EGR), and closed crankcase ventilation to reduce nitrogen oxides (NOx)
 * Additional exhaust control, including oxidizing catalyst and new diesel particulate filter (DPF) to reduce soot and particulate matter
 * Increased-capacity cooling system
 * New engine control software
 * Use of low-ash engine oil (CJ-4)

Applications:
 * 2007–2010 Chevrolet Silverado HD
 * 2007–2010 GMC Sierra HD
 * 2007–2010 Chevrolet Kodiak
 * 2007–2010 GMC TopKick
 * 2007–2010 Chevrolet Express/GMC Savana

LGH
The 6.6L Duramax diesel engine (VIN code "L") is used on 2010 interim and 2011 Chevrolet Express and GMC Savana vans and 2011 Chevrolet Silverado/GMC Sierra HD trucks with RPO ZW9 (chassis cabs or trucks with pickup box delete). The LGH engine is rated at 335 bhp at 3,100 rpm and 685 lbft at 1,600 rpm. Similar to the LML, this engine also uses a DPF and DEF system to meet emissions standards.

LML
The 6.6L RPO LML (VIN code "8") is the 2011–2016 version of the Isuzu/GM Duramax V8 diesel engine. It is a further advanced version of the LMM engine with the majority of the changes addressing a required drastic reduction in engine emissions. Some mechanical aspects of the engine, such as piston oil flow design for improved temperature control and oil pump design, were also improved to enhance durability even further.

The LML engine was significantly updated for 2011 to comply with the new federal emissions standards for diesel engines, provide better engine rigidity, and further noise reduction. The engine gained new 29,000 PSI piezo injectors as well as a completely reworked fuel system which was now powered by the Bosch CP4 pump, that also now supports up to 20% biodiesel mixtures and a urea injection (to reduce nitrogen oxides) with a 5.3 gallon DEF tank. This engine has a fuel injector in the exhaust tract, to allow raw fuel injection during the particulate filter recycling routine. The RPO LML engine is rated at 397 hp at 3,000 rpm and 765 lbft of torque at 1,600 rpm.

L5P
The L5P Duramax is the latest version of the Duramax V8 diesel engine.(engine code Y). Introduced in the 2017 model year, it was the most powerful diesel engine GM had produced, with 445 hp at 2,800 rpm and 910 lbft at 1,600 rpm. Design specification performance can exceed 550 bhp at 3,050 rpm and 1050 lbft at 1,975 rpm.

L5P Gen2
The L5P Duramax received an increase in horsepower and torque for the 2024 model year; 470 hp at 2,800 rpm and 975 lbft at 1,600 rpm. Design specification performance can exceed 550 bhp at 3050 rpm and 1050 lbft at 1975 rpm.

L5D
The L5D Duramax is a downrated version of the L5P for the Chevrolet Silverado MD and International CV trucks (Class 4, 5, and 6). The L5D was downrated to increase reliability and reduce downtime. The L5D was introduced in 2018 for the 2019 Chevrolet Silverado MD and International CV trucks. Specifications for the L5D are 350 hp at 2,600 rpm and 700 lbft at 1,600 rpm.

title: Duramax V8 engine


text:
Because

Because may refer to:
 * Because, a subordinating grammatical conjunction
 * Causality, the process of making something happen; a relationship between events
 * ∵, a logical symbol meaning because
 * Because (film), a British film directed by Sidney Morgan
 * Because, a 1990 film written and directed by Tom Tykwer
 * BECAUSE (Conference), a conference for bisexual and bi+ people

In music:
 * "Because" (1902 song), a popular song by Guy d'Hardelot and Edward Teschemacher, recorded by many artists
 * "Because" (The Beatles song)
 * "Because" (Boyzone song)
 * "Because" (The Dave Clark Five song)
 * "Because" (Demis Roussos song)
 * "Because" (Jessica Mauboy song)
 * Because, an album by The Nylons
 * "BEcause", a song by Dreamcatcher from Summer Holiday

title: Because


text:
Talk:Ludics

Girard's paper introducing Ludics, Locus solum: from the logic of rules to the rules of logic, has some features that may be seen as eccentric for a publication in mathematical logic (such as illustrations of Positive Skunks). — what is the purpose of this comment, and why does it belong in Wikipedia? Perhaps you would prefer his Bulletin of Symbolic Logic paper, which is slightly less confrontational? — Kaustuv 14:52, 2004 Aug 16 (UTC)

 * It has to be said that illustrations of postivie skunks *are* rather unusual and eccentric. That is not a criticism, it is an observation surely? Francis Davey 18:50, 27 May 2006 (UTC)

 * Yeah, I'd suggest that communicating the color and flavor of Girard's work is actually a quite valuable addition. One of the many reasons his work is exceptional is that he gives exposition of his his unconventional conclusions by unconventional (which is not to say unconvincing) means. I'd wager that his his unorthodox discoveries in logic are not entirely separable from his unorthodox rhetoric. Shonfeder (talk) 18:18, 1 March 2022 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified one external link on Ludics. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added archive https://web.archive.org/web/20090107051353/http://locuspocus.hyperkind.org/wiki/Main_Page to http://locuspocus.hyperkind.org/wiki/Main_Page

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

Cheers.— InternetArchiveBot  (Report bug) 10:19, 8 January 2018 (UTC)

title: Talk:Ludics


text:
Yasmeen Ghauri

Yasmeen Ghauri is a Canadian former fashion model. Ghauri is known for her walk also quoted as the "walk of life" by Tyra Banks. She is one of the first women of South Asian descent to appear on the cover of Vogue.

Early life and career
Ghauri was born in Montreal, Quebec, Canada to a German mother and a Pakistani father who was born in Hyderabad, India and emigrated to Karachi when he was young. According to Ghauri, her paternal family ultimately has origins in Ghor, Afghanistan, and she has identified as being "half South [and] Central Asian. Raised Muslim, Ghauri had a difficult childhood and was bullied by her classmates at school for her Pakistani heritage. She did her Hajj with her parents at age 12.

Career
At age 17, Ghauri was discovered after walking out of a hair salon and being approached in Montreal by artistic director of Platine Coiffure, Edward Zaccaria. Despite her parents' disapproval, she actively pursued a modelling career, debuting in Milan and Paris before moving to New York City in 1990. Here, she was noticed by fashion critics and labels alike. The New York Times described her runway walk as a "ball-bearing swivel of her hips". Her appearance prompted part of what is now termed in fashion the "Canadian invasion".

Ghauri's first major cover was for Elle Magazine in 1991 and was later booked to walk for high fashion brands. Ghauri did her own makeup because there weren't enough shades for her skin tone. In 1992 Yasmeen also walked the infamous Versace ‘Bondage’ show and became the face of Hermès and Lanvin. She also signed with Victoria's Secret becoming one of the angels.

Ghauri enjoyed fame in the early 1990s after her first major cover with Elle in January 1991. She was also seen in Elton John's music video for the song "Sacrifice", in which she starred opposite Chris Isaak. Soon after, she became the face of both Chanel and Jil Sander. By the end of 1990, Ghauri appeared on the cover of French Elle in July and December. In September, she graced the catwalk for Gianni Versace's show in Milan and by the next month, she was walking for Chanel, Helmut Lang, Jean Paul Gaultier and Lanvin in Paris. She became the face of Christian Dior and Anne Klein in 1991. In January, she was photographed by Steven Meisel for the cover of Italian Vogue and toward the end of the year, she appeared in British and Italian Vogue editorials. Photographer Patrick Demarchelier, who photographed her for the Italian issue, called her his favorite subject.

In 1992, Ghauri became the face of Valentino couture and Versace. According to an NYMag.com online model profile, Ghauri walked the controversial Gianni Versace "Bondage" show in Milan in February 1992. Ghauri became the face of Hermès and Lanvin in 1993 and was photographed by Gilles Bensimon for Elle. She appeared in the 1995 documentary Unzipped by Isaac Mizrahi. Yasmeen became a frequent face in Victoria’s Secret catalogs and the iconic swimsuit issues, this served to further heighten her success. In 1996 she began to walk in the annual Victoria's Secret Fashion Show.

Ghauri retired in 1997, confirming speculations that arose after she stepped out of the Yves Saint Laurent show at the last minute.

Personal life
Ghauri is married to lawyer Ralph Bernstein, with whom she has a daughter and a son. The family live in Bedford, New York.

References in other media
Ghauri was the inspiration for the character Jasmine in the comic book series Jonathan Steele.

title: Yasmeen Ghauri


text:
T. C. Hammond

Thomas Chatterton Hammond (20 February 1877 – 16 November 1961) was an Irish Anglican cleric whose work on reformed theology and Protestant apologetics has been influential among evangelicals, especially in Ireland, Australia and South Africa. He was also Grand Master of the Grand Orange Lodge of New South Wales.

Biography
Born in Cork to Colman Mark Hammond a farmer and his second wife, Elizabeth (née Sergeant). After his father died in 1883 he lived for some time with a Roman Catholic aunt. He was educated at Cork Model School and at age 13 he went to work as a railway clerk. He became a member of the Church of Ireland in 1892. He also joined the newly formed YMCA in Cork and studied with John McNay (his future brother in law) the YMCA librarian.

At the age of 18 he entered the Irish Church Missions Training School in Dublin. Hammond was ordained as a deacon in the Church of Ireland in 1903 and priest in 1905. He was appointed curate of St. Kevin's Church, Camden Row, Dublin, and the Hammond family lived on nearby Synge Street. He received a BA in 1903 and subsequently an MA from Trinity College Dublin. Later in life he was awarded a Th.D. from the Australian College of Theology (ACT). He married Margaret McNay from Cork (of Scottish extraction but born in County Tipperary) in 1906, they had three sons; John Colman, Thomas Chatterton ('Chat'), Charles Kimble ('Carl') and a daughter, Doris.

He was superintendent of the Irish Church Missions to the Roman Catholics from 1919 to 1936, where he engaged in evangelistic missions in Dublin and often in controversies with Roman Catholic apologists. A lively intellectual, his expertise in doctrinal difficulty was often sought by the bishops of the Church of Ireland, but not always publicly acknowledged. Hammond also helped draw up the constitution of the Anglican Church of Australia (at that time called the Church of England in Australia) and safe-guarded the independence of the Anglican Diocese of Sydney. He was also helpful in drawing up a constitution for the Church of England in South Africa, a denomination which was created separately from the largely Anglo-Catholicism dominated Church of the Province of South Africa.

In 1936, Hammond left Ireland to take up position as Principal of Moore Theological College, Sydney. In addition, he was made the rector of St Philip's, York Street. He was made an archdeacon in 1949. His best-known books are In Understanding be Men (a handbook of Christian doctrine) and The One Hundred Texts, with Bible verses explaining Reformed teaching. He continued to debate Catholics, with his program on radio 2CH competing with that of the Catholic apologist Dr Rumble on 2SM

Hammond was a controversial figure both in Ireland and Australia as a member of the Orange Order in Dublin and Sydney, eventually rising to the position of Grand Master of the Orange Institution of New South Wales in 1961. In recent times, his involvement in the establishment and running of the Bethany Home, a home for orphans, unmarried mothers and their children, and petty criminals, has also been raised for questioning, particularly due to the high mortality rate. The home is subject to ongoing calls to be added to the State redress scheme for victims of child, neglect, sexual and physical abuse. Hammond sat on the board of trustees of the Bethany Home from 1922 until 1935, as other members of the Church of Ireland clergy did throughout its existence.

Hammond died on 16 November 1961 in Sydney. A biography, T C Hammond - Irish Christian, by Rev. Warren Nelson (founder of the Irish Bible Institute) was published in 1994.

Publications

 * Authority in the church: Being an examination into the position and jurisdiction of bishops in the Anglican Communion, Figgis & Co, Dublin, 1921.
 * "The Evangelical Revival and the Oxford Movement", Churchman 47(2), 1933.
 * In Understanding Be Men, Inter-Varsity Press, 1936.
 * Perfect Freedom, 1939.
 * Fading Light, The Tragedy of Spiritual Decline in Germany, Marshall, Morgan & Scott, 1942.
 * Age-Long Questions, Marshall, 1942.
 * Reasoning Faith: An Introduction to Christian Apologetics, Inter-Varsity Fellowship, 1943.
 * The One Hundred Texts - A Manual of Theology, 1952.
 * The New Creation, Marshall, Morgan & Scott, London, 1953.

title: T. C. Hammond


text:
List of presidents of Angola

The following is a list of presidents of Angola since the establishment of the office of President in 1975.

The current president is João Lourenço. He assumed the office on 26 September 2017.

Presidents of Angola (1975–present)
Note: For details of the post of President of Angola, see President of Angola.

title: List of presidents of Angola


text:
Montgomery modular multiplication

In modular arithmetic computation, Montgomery modular multiplication, more commonly referred to as Montgomery multiplication, is a method for performing fast modular multiplication. It was introduced in 1985 by the American mathematician Peter L. Montgomery.

Montgomery modular multiplication relies on a special representation of numbers called Montgomery form. The algorithm uses the Montgomery forms of $a$ and $b$ to efficiently compute the Montgomery form of $ab mod N$. The efficiency comes from avoiding expensive division operations. Classical modular multiplication reduces the double-width product $ab$ using division by $N$ and keeping only the remainder. This division requires quotient digit estimation and correction. The Montgomery form, in contrast, depends on a constant $R > N$ which is coprime to $N$, and the only division necessary in Montgomery multiplication is division by $R$. The constant $R$ can be chosen so that division by $R$ is easy, significantly improving the speed of the algorithm. In practice, $R$ is always a power of two, since division by powers of two can be implemented by bit shifting.

The need to convert $a$ and $b$ into Montgomery form and their product out of Montgomery form means that computing a single product by Montgomery multiplication is slower than the conventional or Barrett reduction algorithms. However, when performing many multiplications in a row, as in modular exponentiation, intermediate results can be left in Montgomery form. Then the initial and final conversions become a negligible fraction of the overall computation. Many important cryptosystems such as RSA and Diffie–Hellman key exchange are based on arithmetic operations modulo a large odd number, and for these cryptosystems, computations using Montgomery multiplication with $R$ a power of two are faster than the available alternatives.

Modular arithmetic
Let $N$ denote a positive integer modulus. The quotient ring $Z/NZ$ consists of residue classes modulo $N$, that is, its elements are sets of the form
 * $$\{ a + kN \colon k \in \mathbf{Z} \},$$

where $a$ ranges across the integers. Each residue class is a set of integers such that the difference of any two integers in the set is divisible by $N$ (and the residue class is maximal with respect to that property; integers aren't left out of the residue class unless they would violate the divisibility condition). The residue class corresponding to $a$ is denoted $\overline{a}$. Equality of residue classes is called congruence and is denoted
 * $$\bar a \equiv \bar b \pmod{N}.$$

Storing an entire residue class on a computer is impossible because the residue class has infinitely many elements. Instead, residue classes are stored as representatives. Conventionally, these representatives are the integers $a$ for which $0 ≤ a ≤ N − 1$. If $a$ is an integer, then the representative of $\overline{a}$ is written $a mod N$. When writing congruences, it is common to identify an integer with the residue class it represents. With this convention, the above equality is written $a ≡ b mod N$.

Arithmetic on residue classes is done by first performing integer arithmetic on their representatives. The output of the integer operation determines a residue class, and the output of the modular operation is determined by computing the residue class's representative. For example, if $N = 17$, then the sum of the residue classes $\overline{7}$ and $\overline{15}$ is computed by finding the integer sum $7 + 15 = 22$, then determining $22 mod 17$, the integer between 0 and 16 whose difference with 22 is a multiple of 17. In this case, that integer is 5, so $\overline{7} + \overline{15} ≡ \overline{5} mod 17$.

Montgomery form
If $a$ and $b$ are integers in the range $[0, N − 1]$, then their sum is in the range $[0, 2N − 2]$ and their difference is in the range $[−N + 1, N − 1]$, so determining the representative in $[0, N − 1]$ requires at most one subtraction or addition (respectively) of $N$. However, the product $ab$ is in the range $[0, N^{2} − 2N + 1]$. Storing the intermediate integer product $ab$ requires twice as many bits as either $a$ or $b$, and efficiently determining the representative in $[0, N − 1]$ requires division. Mathematically, the integer between 0 and $N − 1$ that is congruent to $ab$ can be expressed by applying the Euclidean division theorem:
 * $$ab = qN + r,$$

where $q$ is the quotient $$\lfloor ab / N \rfloor$$ and $r$, the remainder, is in the interval $[0, N − 1]$. The remainder $r$ is $ab mod N$. Determining $r$ can be done by computing $q$, then subtracting $qN$ from $ab$. For example, again with $$N=17$$, the product $\overline{7} ⋅ \overline{15}$ is determined by computing $$7 \cdot 15 = 105$$, dividing $$\lfloor 105 / 17 \rfloor = 6$$, and subtracting $$105 - 6 \cdot 17 = 105 - 102 = 3$$.

Because the computation of $q$ requires division, it is undesirably expensive on most computer hardware. Montgomery form is a different way of expressing the elements of the ring in which modular products can be computed without expensive divisions. While divisions are still necessary, they can be done with respect to a different divisor $R$. This divisor can be chosen to be a power of two, for which division can be replaced by shifting, or a whole number of machine words, for which division can be replaced by omitting words. These divisions are fast, so most of the cost of computing modular products using Montgomery form is the cost of computing ordinary products.

The auxiliary modulus $R$ must be a positive integer such that $gcd(R, N) = 1$. For computational purposes it is also necessary that division and reduction modulo $R$ are inexpensive, and the modulus is not useful for modular multiplication unless $R > N$. The Montgomery form of the residue class $\overline{a}$ with respect to $R$ is $aR mod N$, that is, it is the representative of the residue class $\overline{aR}$. For example, suppose that $N = 17$ and that $R = 100$. The Montgomery forms of 3, 5, 7, and 15 are $300 mod 17 = 11$, $500 mod 17 = 7$, $700 mod 17 = 3$, and $1500 mod 17 = 4$.

Addition and subtraction in Montgomery form are the same as ordinary modular addition and subtraction because of the distributive law:
 * $$aR + bR = (a + b)R,$$
 * $$aR - bR = (a - b)R.$$

Note that doing the operation in Montgomery form does not lose information compared to doing it in the quotient ring $Z/NZ$. This is a consequence of the fact that, because $gcd(R, N) = 1$, multiplication by $R$ is an isomorphism on the additive group $Z/NZ$. For example, $(7 + 15) mod 17 = 5$, which in Montgomery form becomes $(3 + 4) mod 17 = 7$.

Multiplication in Montgomery form, however, is seemingly more complicated. The usual product of $aR$ and $bR$ does not represent the product of $a$ and $b$ because it has an extra factor of $R$:
 * $$(aR \bmod N)(bR \bmod N) \bmod N = (abR)R \bmod N.$$

Computing products in Montgomery form requires removing the extra factor of $R$. While division by $R$ is cheap, the intermediate product $(aR mod N)(bR mod N)$ is not divisible by $R$ because the modulo operation has destroyed that property. So for instance, the product of the Montgomery forms of 7 and 15 modulo 17, with $R = 100$, is the product of 3 and 4, which is 12. Since 12 is not divisible by 100, additional effort is required to remove the extra factor of $R$.

Removing the extra factor of $R$ can be done by multiplying by an integer $R′$ such that $RR′ ≡ 1 (mod N)$, that is, by an $R′$ whose residue class is the modular inverse of $R$ mod $N$. Then, working modulo $N$,
 * $$(aR \bmod N)(bR \bmod N)R' \equiv (aR)(bR)R^{-1} \equiv (ab)R \pmod{N}.$$

The integer $R′$ exists because of the assumption that $R$ and $N$ are coprime. It can be constructed using the extended Euclidean algorithm. The extended Euclidean algorithm efficiently determines integers $R′$ and $N′$ that satisfy Bézout's identity: $0 < R′ < N$, $0 < N′ < R$, and:
 * $$RR' - NN' = 1.$$

This shows that it is possible to do multiplication in Montgomery form. A straightforward algorithm to multiply numbers in Montgomery form is therefore to multiply $aR mod N$, $bR mod N$, and $R′$ as integers and reduce modulo $N$.

For example, to multiply 7 and 15 modulo 17 in Montgomery form, again with $R = 100$, compute the product of 3 and 4 to get 12 as above. The extended Euclidean algorithm implies that $8⋅100 − 47⋅17 = 1$, so $R′ = 8$. Multiply 12 by 8 to get 96 and reduce modulo 17 to get 11. This is the Montgomery form of 3, as expected.

The REDC algorithm
While the above algorithm is correct, it is slower than multiplication in the standard representation because of the need to multiply by $R′$ and divide by $N$. Montgomery reduction, also known as REDC, is an algorithm that simultaneously computes the product by $R′$ and reduces modulo $N$ more quickly than the naïve method. Unlike conventional modular reduction, which focuses on making the number smaller than $N$, Montgomery reduction focuses on making the number more divisible by $R$. It does this by adding a small multiple of $N$ which is sophisticatedly chosen to cancel the residue modulo $R$. Dividing the result by $R$ yields a much smaller number. This number is so much smaller that it is nearly the reduction modulo $N$, and computing the reduction modulo $N$ requires only a final conditional subtraction. Because all computations are done using only reduction and divisions with respect to $R$, not $N$, the algorithm runs faster than a straightforward modular reduction by division. function REDC is input: Integers R and N with gcd(R, N) = 1, Integer N′ in [0, R − 1] such that NN′ ≡ −1 mod R,           Integer T in the range [0, RN − 1]. output: Integer S in the range [0, N − 1] such that S ≡ TR−1 mod N    m ← ((T mod R)N′) mod R t ← (T + mN) / R if t ≥ N then return t − N    else return t end if end function

To see that this algorithm is correct, first observe that $m$ is chosen precisely so that $T + mN$ is divisible by $R$. A number is divisible by $R$ if and only if it is congruent to zero mod $R$, and we have:
 * $$T + mN \equiv T + (((T \bmod R)N') \bmod R)N \equiv T + T N' N \equiv T - T \equiv 0 \pmod{R}.$$

Therefore, $t$ is an integer. Second, the output is either $t$ or $t − N$, both of which are congruent to $t mod N$, so to prove that the output is congruent to $TR^{−1} mod N$, it suffices to prove that $t$ is $TR^{−1} mod N$, $t$ satisfies:
 * $$t \equiv (T + mN)R^{-1} \equiv TR^{-1} + (mR^{-1})N \equiv TR^{-1} \pmod{N}.$$

Therefore, the output has the correct residue class. Third, $m$ is in $[0, R − 1]$, and therefore $T + mN$ is between 0 and $(RN − 1) + (R − 1)N < 2RN$. Hence $t$ is less than $2N$, and because it's an integer, this puts $t$ in the range $[0, 2N − 1]$. Therefore, reducing $t$ into the desired range requires at most a single subtraction, so the algorithm's output lies in the correct range.

To use REDC to compute the product of 7 and 15 modulo 17, first convert to Montgomery form and multiply as integers to get 12 as above. Then apply REDC with $R = 100$, $N = 17$, $N′ = 47$, and $T = 12$. The first step sets $m$ to $12 ⋅ 47 mod 100 = 64$. The second step sets $t$ to $(12 + 64 ⋅ 17) / 100$. Notice that $12 + 64 ⋅ 17$ is 1100, a multiple of 100 as expected. $t$ is set to 11, which is less than 17, so the final result is 11, which agrees with the computation of the previous section.

As another example, consider the product $7 ⋅ 15 mod 17$ but with $R = 10$. Using the extended Euclidean algorithm, compute $−5 ⋅ 10 + 3 ⋅ 17 = 1$, so $N′$ will be $−3 mod 10 = 7$. The Montgomery forms of 7 and 15 are $70 mod 17 = 2$ and $150 mod 17 = 14$, respectively. Their product 28 is the input $T$ to REDC, and since $28 < RN = 170$, the assumptions of REDC are satisfied. To run REDC, set $m$ to $1=(28 mod 10) ⋅ 7 mod 10 = 196 mod 10 = 6$. Then $28 + 6 ⋅ 17 = 130$, so $t = 13$. Because $30 mod 17 = 13$, this is the Montgomery form of $3 = 7 ⋅ 15 mod 17$.

Arithmetic in Montgomery form
Many operations of interest modulo $N$ can be expressed equally well in Montgomery form. Addition, subtraction, negation, comparison for equality, multiplication by an integer not in Montgomery form, and greatest common divisors with $N$ may all be done with the standard algorithms. The Jacobi symbol can be calculated as $$\big(\tfrac{a}{N}\big) = \big(\tfrac{aR}{N}\big) / \big(\tfrac{R}{N}\big)$$ as long as $$\big(\tfrac{R}{N}\big)$$ is stored.

When $R > N$, most other arithmetic operations can be expressed in terms of REDC. This assumption implies that the product of two representatives mod $N$ is less than $RN$, the exact hypothesis necessary for REDC to generate correct output. In particular, the product of $aR mod N$ and $bR mod N$ is $REDC((aR mod N)(bR mod N))$. The combined operation of multiplication and REDC is often called Montgomery multiplication.

Conversion into Montgomery form is done by computing $REDC((a mod N)(R^{2} mod N))$. Conversion out of Montgomery form is done by computing $REDC(aR mod N)$. The modular inverse of $aR mod N$ is $REDC((aR mod N)^{−1}(R^{3} mod N))$. Modular exponentiation can be done using exponentiation by squaring by initializing the initial product to the Montgomery representation of 1, that is, to $R mod N$, and by replacing the multiply and square steps by Montgomery multiplies.

Performing these operations requires knowing at least $N′$ and $R^{2} mod N$. When $R$ is a power of a small positive integer $b$, $N′$ can be computed by Hensel's lemma: The inverse of $N$ modulo $b$ is computed by a naïve algorithm (for instance, if $b = 2$ then the inverse is 1), and Hensel's lemma is used repeatedly to find the inverse modulo higher and higher powers of $b$, stopping when the inverse modulo $R$ is known; $N′$ is the negation of this inverse. The constants $R mod N$ and $R^{3} mod N$ can be generated as $REDC(R^{2} mod N)$ and as $REDC((R^{2} mod N)(R^{2} mod N))$. The fundamental operation is to compute REDC of a product. When standalone REDC is needed, it can be computed as REDC of a product with $1 mod N$. The only place where a direct reduction modulo $N$ is necessary is in the precomputation of $R^{2} mod N$.

Montgomery arithmetic on multiprecision integers
Most cryptographic applications require numbers that are hundreds or even thousands of bits long. Such numbers are too large to be stored in a single machine word. Typically, the hardware performs multiplication mod some base $B$, so performing larger multiplications requires combining several small multiplications. The base $B$ is typically 2 for microelectronic applications, 28 for 8-bit firmware, or 232 or 264 for software applications.

The REDC algorithm requires products modulo $R$, and typically $R > N$ so that REDC can be used to compute products. However, when $R$ is a power of $B$, there is a variant of REDC which requires products only of machine word sized integers. Suppose that positive multi-precision integers are stored little endian, that is, $x$ is stored as an array $x[0], ..., x[ℓ - 1]$ such that $0 ≤ x[i] < B$ for all $i$ and $x = ∑ x[i] B^{i}$. The algorithm begins with a multiprecision integer $T$ and reduces it one word at a time. First an appropriate multiple of $N$ is added to make $T$ divisible by $B$. Then a multiple of $N$ is added to make $T$ divisible by $B^{2}$, and so on. Eventually $T$ is divisible by $R$, and after division by $R$ the algorithm is in the same place as REDC was after the computation of $t$.

function MultiPrecisionREDC is Input: Integer N with gcd(B, N) = 1, stored as an array of p words, Integer R = Br,    --thus, r = logB R Integer N′ in [0, B − 1] such that NN′ ≡ −1 (mod B), Integer T in the range 0 ≤ T < RN, stored as an array of r + p words. Output: Integer S in [0, N − 1] such that TR−1 ≡ S (mod N), stored as an array of p words. Set T[r + p] = 0 (extra carry word) for 0 ≤ i < r do --loop1- Make T divisible by Bi+1 c ← 0 m ← T[i] ⋅ N′ mod B        for 0 ≤ j < p do --loop2- Add the m ⋅ N[j] and the carry from earlier, and find the new carry x ← T[i + j] + m ⋅ N[j] + c            T[i + j] ← x mod B             c ← ⌊x / B⌋         end for for p ≤ j ≤ r + p − i do --loop3- Continue carrying x ← T[i + j] + c            T[i + j] ← x mod B             c ← ⌊x / B⌋         end for end for for 0 ≤ i ≤ p do S[i] ← T[i + r] end for if S ≥ N then return S − N    else return S    end if end function The final comparison and subtraction is done by the standard algorithms.

The above algorithm is correct for essentially the same reasons that REDC is correct. Each time through the $i$ loop, $m$ is chosen so that $T[i] + mN[0]$ is divisible by $B$. Then $mNB^{i}$ is added to $T$. Because this quantity is zero mod $N$, adding it does not affect the value of $T mod N$. If $m_{i}$ denotes the value of $m$ computed in the $i$th iteration of the loop, then the algorithm sets $S$ to $T + (∑ m_{i} B^{i})N$. Because MultiPrecisionREDC and REDC produce the same output, this sum is the same as the choice of $m$ that the REDC algorithm would make.

The last word of $T$, $T[r + p]$ (and consequently $S[p]$), is used only to hold a carry, as the initial reduction result is bound to a result in the range of $0 ≤ S < 2N$. It follows that this extra carry word can be avoided completely if it is known in advance that $R ≥ 2N$. On a typical binary implementation, this is equivalent to saying that this carry word can be avoided if the number of bits of $N$ is smaller than the number of bits of $R$. Otherwise, the carry will be either zero or one. Depending upon the processor, it may be possible to store this word as a carry flag instead of a full-sized word.

It is possible to combine multiprecision multiplication and REDC into a single algorithm. This combined algorithm is usually called Montgomery multiplication. Several different implementations are described by Koç, Acar, and Kaliski. The algorithm may use as little as $p + 2$ words of storage (plus a carry bit).

As an example, let $B = 10$, $N = 997$, and $R = 1000$. Suppose that $a = 314$ and $b = 271$. The Montgomery representations of $a$ and $b$ are $314000 mod 997 = 942$ and $271000 mod 997 = 813$. Compute $942 ⋅ 813 = 765846$. The initial input $T$ to MultiPrecisionREDC will be [6, 4, 8, 5, 6, 7]. The number $N$ will be represented as [7, 9, 9]. The extended Euclidean algorithm says that $−299 ⋅ 10 + 3 ⋅ 997 = 1$, so $N′$ will be 7.

i ← 0 m ← 6 ⋅ 7 mod 10 = 2 j T      c - --- - 0 0485670 2   (After first iteration of first loop) 1 0485670 2 2 0485670 2 3 0487670 0   (After first iteration of second loop) 4 0487670 0 5 0487670 0 6 0487670 0 i ← 1 m ← 4 ⋅ 7 mod 10 = 8 j T      c - --- - 0 0087670 6   (After first iteration of first loop) 1 0067670 8 2 0067670 8 3 0067470 1   (After first iteration of second loop) 4 0067480 0 5 0067480 0 i ← 2 m ← 6 ⋅ 7 mod 10 = 2 j T      c - --- - 0 0007480 2   (After first iteration of first loop) 1 0007480 2 2 0007480 2 3 0007400 1   (After first iteration of second loop) 4 0007401 0

Therefore, before the final comparison and subtraction, $S = 1047$. The final subtraction yields the number 50. Since the Montgomery representation of $314 ⋅ 271 mod 997 = 349$ is $349000 mod 997 = 50$, this is the expected result.

When working in base 2, determining the correct $m$ at each stage is particularly easy: If the current working bit is even, then $m$ is zero and if it's odd, then $m$ is one. Furthermore, because each step of MultiPrecisionREDC requires knowing only the lowest bit, Montgomery multiplication can be easily combined with a carry-save adder.

Side-channel attacks
Because Montgomery reduction avoids the correction steps required in conventional division when quotient digit estimates are inaccurate, it is mostly free of the conditional branches which are the primary targets of timing and power side-channel attacks; the sequence of instructions executed is independent of the input operand values. The only exception is the final conditional subtraction of the modulus, but it is easily modified (to always subtract something, either the modulus or zero) to make it resistant. It is of course necessary to ensure that the exponentiation algorithm built around the multiplication primitive is also resistant.

title: Montgomery modular multiplication