[{"data":1,"prerenderedAt":1867},["ShallowReactive",2],{"navigation":3,"\u002Fsnt-2nde\u002Fsa-internet\u002Fpair-a-pair":585,"\u002Fsnt-2nde\u002Fsa-internet\u002Fpair-a-pair__counterpart":984,"\u002Fsnt-2nde\u002Fsa-internet\u002Fpair-a-pair__slides":1274,"annexes-memo:\u002Fsnt-2nde\u002Fsa-internet\u002Fpair-a-pair":1503,"annexes-slides:\u002Fsnt-2nde\u002Fsa-internet\u002Fpair-a-pair":1708},[4,224,440],{"title":5,"path":6,"stem":7,"children":8},"SNT — Seconde","\u002Fsnt-2nde","0.snt-2nde\u002F0.index",[9,10,14,36,66,92,118,144,162,184,206],{"title":5,"path":6,"stem":7},{"title":11,"path":12,"stem":13},"REVIEW pédagogique — SNT 2nde","\u002Fsnt-2nde\u002Freview","0.snt-2nde\u002FREVIEW",{"title":15,"path":16,"stem":17,"children":18},"Internet","\u002Fsnt-2nde\u002Fsa-internet","0.snt-2nde\u002Fsa-internet\u002F0.index",[19,20,24,28,32],{"title":15,"path":16,"stem":17},{"title":21,"path":22,"stem":23},"Adresses symboliques et DNS","\u002Fsnt-2nde\u002Fsa-internet\u002Fadresses-dns","0.snt-2nde\u002Fsa-internet\u002F1.adresses-dns",{"title":25,"path":26,"stem":27},"Internet et les réseaux physiques","\u002Fsnt-2nde\u002Fsa-internet\u002Freseaux-physiques","0.snt-2nde\u002Fsa-internet\u002F2.reseaux-physiques",{"title":29,"path":30,"stem":31},"Protocoles TCP\u002FIP et routage des paquets","\u002Fsnt-2nde\u002Fsa-internet\u002Ftcp-ip-routage","0.snt-2nde\u002Fsa-internet\u002F3.tcp-ip-routage",{"title":33,"path":34,"stem":35},"Réseaux pair-à-pair","\u002Fsnt-2nde\u002Fsa-internet\u002Fpair-a-pair","0.snt-2nde\u002Fsa-internet\u002F4.pair-a-pair",{"title":37,"path":38,"stem":39,"children":40},"Le Web","\u002Fsnt-2nde\u002Fsb-web","0.snt-2nde\u002Fsb-web\u002F0.index",[41,42,46,50,54,58,62],{"title":37,"path":38,"stem":39},{"title":43,"path":44,"stem":45},"Histoire du Web","\u002Fsnt-2nde\u002Fsb-web\u002Fhistoire-web","0.snt-2nde\u002Fsb-web\u002F1.histoire-web",{"title":47,"path":48,"stem":49},"URL et hypertexte","\u002Fsnt-2nde\u002Fsb-web\u002Furl-hypertexte","0.snt-2nde\u002Fsb-web\u002F2.url-hypertexte",{"title":51,"path":52,"stem":53},"HTML et CSS — le contenu et la présentation","\u002Fsnt-2nde\u002Fsb-web\u002Fhtml-css","0.snt-2nde\u002Fsb-web\u002F3.html-css",{"title":55,"path":56,"stem":57},"Client-serveur et requêtes HTTP","\u002Fsnt-2nde\u002Fsb-web\u002Fclient-serveur-http","0.snt-2nde\u002Fsb-web\u002F4.client-serveur-http",{"title":59,"path":60,"stem":61},"Moteurs de recherche","\u002Fsnt-2nde\u002Fsb-web\u002Fmoteurs-recherche","0.snt-2nde\u002Fsb-web\u002F5.moteurs-recherche",{"title":63,"path":64,"stem":65},"Sécurité du navigateur et notions juridiques","\u002Fsnt-2nde\u002Fsb-web\u002Fsecurite-droits","0.snt-2nde\u002Fsb-web\u002F6.securite-droits",{"title":67,"path":68,"stem":69,"children":70},"Les réseaux sociaux","\u002Fsnt-2nde\u002Fsc-reseaux-sociaux","0.snt-2nde\u002Fsc-reseaux-sociaux\u002F0.index",[71,72,76,80,84,88],{"title":67,"path":68,"stem":69},{"title":73,"path":74,"stem":75},"Panorama des réseaux sociaux","\u002Fsnt-2nde\u002Fsc-reseaux-sociaux\u002Fpanorama-rs","0.snt-2nde\u002Fsc-reseaux-sociaux\u002F1.panorama-rs",{"title":77,"path":78,"stem":79},"Identité numérique et authentification","\u002Fsnt-2nde\u002Fsc-reseaux-sociaux\u002Fidentite-numerique","0.snt-2nde\u002Fsc-reseaux-sociaux\u002F2.identite-numerique",{"title":81,"path":82,"stem":83},"Le modèle économique des réseaux sociaux","\u002Fsnt-2nde\u002Fsc-reseaux-sociaux\u002Fmodele-economique","0.snt-2nde\u002Fsc-reseaux-sociaux\u002F3.modele-economique",{"title":85,"path":86,"stem":87},"Petit monde et graphes","\u002Fsnt-2nde\u002Fsc-reseaux-sociaux\u002Fpetit-monde-graphes","0.snt-2nde\u002Fsc-reseaux-sociaux\u002F4.petit-monde-graphes",{"title":89,"path":90,"stem":91},"La cyberviolence","\u002Fsnt-2nde\u002Fsc-reseaux-sociaux\u002Fcyberviolence","0.snt-2nde\u002Fsc-reseaux-sociaux\u002F5.cyberviolence",{"title":93,"path":94,"stem":95,"children":96},"Les données structurées et leur traitement","\u002Fsnt-2nde\u002Fsd-donnees-structurees","0.snt-2nde\u002Fsd-donnees-structurees\u002F0.index",[97,98,102,106,110,114],{"title":93,"path":94,"stem":95},{"title":99,"path":100,"stem":101},"Données et formats","\u002Fsnt-2nde\u002Fsd-donnees-structurees\u002Fdonnees-formats","0.snt-2nde\u002Fsd-donnees-structurees\u002F1.donnees-formats",{"title":103,"path":104,"stem":105},"Données structurées","\u002Fsnt-2nde\u002Fsd-donnees-structurees\u002Fdonnees-structurees","0.snt-2nde\u002Fsd-donnees-structurees\u002F2.donnees-structurees",{"title":107,"path":108,"stem":109},"Métadonnées","\u002Fsnt-2nde\u002Fsd-donnees-structurees\u002Fmetadonnees","0.snt-2nde\u002Fsd-donnees-structurees\u002F3.metadonnees",{"title":111,"path":112,"stem":113},"Traitement de tables","\u002Fsnt-2nde\u002Fsd-donnees-structurees\u002Ftraitement-tables","0.snt-2nde\u002Fsd-donnees-structurees\u002F4.traitement-tables",{"title":115,"path":116,"stem":117},"Le cloud","\u002Fsnt-2nde\u002Fsd-donnees-structurees\u002Fcloud","0.snt-2nde\u002Fsd-donnees-structurees\u002F5.cloud",{"title":119,"path":120,"stem":121,"children":122},"Localisation, cartographie et mobilité","\u002Fsnt-2nde\u002Fse-localisation-cartographie","0.snt-2nde\u002Fse-localisation-cartographie\u002F0.index",[123,124,128,132,136,140],{"title":119,"path":120,"stem":121},{"title":125,"path":126,"stem":127},"GPS et Galileo — se situer grâce aux satellites","\u002Fsnt-2nde\u002Fse-localisation-cartographie\u002Fgps-galileo","0.snt-2nde\u002Fse-localisation-cartographie\u002F1.gps-galileo",{"title":129,"path":130,"stem":131},"Décoder une trame NMEA","\u002Fsnt-2nde\u002Fse-localisation-cartographie\u002Ftrame-nmea","0.snt-2nde\u002Fse-localisation-cartographie\u002F2.trame-nmea",{"title":133,"path":134,"stem":135},"Cartes numériques — GeoPortail et OpenStreetMap","\u002Fsnt-2nde\u002Fse-localisation-cartographie\u002Fcartes-numeriques","0.snt-2nde\u002Fse-localisation-cartographie\u002F3.cartes-numeriques",{"title":137,"path":138,"stem":139},"Itinéraires et graphes","\u002Fsnt-2nde\u002Fse-localisation-cartographie\u002Fitineraires-graphes","0.snt-2nde\u002Fse-localisation-cartographie\u002F4.itineraires-graphes",{"title":141,"path":142,"stem":143},"Confidentialité de la position","\u002Fsnt-2nde\u002Fse-localisation-cartographie\u002Fconfidentialite-position","0.snt-2nde\u002Fse-localisation-cartographie\u002F5.confidentialite-position",{"title":145,"path":146,"stem":147,"children":148},"Informatique embarquée et objets connectés","\u002Fsnt-2nde\u002Fsf-info-embarquee","0.snt-2nde\u002Fsf-info-embarquee\u002F0.index",[149,150,154,158],{"title":145,"path":146,"stem":147},{"title":151,"path":152,"stem":153},"Systèmes informatiques embarqués","\u002Fsnt-2nde\u002Fsf-info-embarquee\u002Fsystemes-embarques","0.snt-2nde\u002Fsf-info-embarquee\u002F1.systemes-embarques",{"title":155,"path":156,"stem":157},"Capteurs et actionneurs","\u002Fsnt-2nde\u002Fsf-info-embarquee\u002Fcapteurs-actionneurs","0.snt-2nde\u002Fsf-info-embarquee\u002F2.capteurs-actionneurs",{"title":159,"path":160,"stem":161},"IHM et objets connectés","\u002Fsnt-2nde\u002Fsf-info-embarquee\u002Fihm-objet-connecte","0.snt-2nde\u002Fsf-info-embarquee\u002F3.ihm-objet-connecte",{"title":163,"path":164,"stem":165,"children":166},"Photographie numérique","\u002Fsnt-2nde\u002Fsg-photo-numerique","0.snt-2nde\u002Fsg-photo-numerique\u002F0.index",[167,168,172,176,180],{"title":163,"path":164,"stem":165},{"title":169,"path":170,"stem":171},"Photosites, pixels et résolution","\u002Fsnt-2nde\u002Fsg-photo-numerique\u002Fpixels-resolution","0.snt-2nde\u002Fsg-photo-numerique\u002F1.pixels-resolution",{"title":173,"path":174,"stem":175},"Les algorithmes de l'appareil photo","\u002Fsnt-2nde\u002Fsg-photo-numerique\u002Falgorithmes-photo","0.snt-2nde\u002Fsg-photo-numerique\u002F2.algorithmes-photo",{"title":177,"path":178,"stem":179},"Les métadonnées EXIF","\u002Fsnt-2nde\u002Fsg-photo-numerique\u002Fmetadonnees-exif","0.snt-2nde\u002Fsg-photo-numerique\u002F3.metadonnees-exif",{"title":181,"path":182,"stem":183},"Traiter une image en Python","\u002Fsnt-2nde\u002Fsg-photo-numerique\u002Ftraitement-rgb","0.snt-2nde\u002Fsg-photo-numerique\u002F4.traitement-rgb",{"title":185,"path":186,"stem":187,"children":188},"Notions transversales de programmation","\u002Fsnt-2nde\u002Fsh-prog-notions","0.snt-2nde\u002Fsh-prog-notions\u002F0.index",[189,190,194,198,202],{"title":185,"path":186,"stem":187},{"title":191,"path":192,"stem":193},"Séquences d'instructions et variables","\u002Fsnt-2nde\u002Fsh-prog-notions\u002Fsequences-affectations","0.snt-2nde\u002Fsh-prog-notions\u002F1.sequences-affectations",{"title":195,"path":196,"stem":197},"Instructions conditionnelles","\u002Fsnt-2nde\u002Fsh-prog-notions\u002Fconditionnelles","0.snt-2nde\u002Fsh-prog-notions\u002F2.conditionnelles",{"title":199,"path":200,"stem":201},"Boucles bornées et non bornées","\u002Fsnt-2nde\u002Fsh-prog-notions\u002Fboucles","0.snt-2nde\u002Fsh-prog-notions\u002F3.boucles",{"title":203,"path":204,"stem":205},"Définitions et appels de fonctions","\u002Fsnt-2nde\u002Fsh-prog-notions\u002Ffonctions","0.snt-2nde\u002Fsh-prog-notions\u002F4.fonctions",{"title":207,"path":208,"stem":209,"children":210},"Démo des widgets MDC","\u002Fsnt-2nde\u002Fzz-demo-widgets","0.snt-2nde\u002Fzz-demo-widgets\u002F0.index",[211,212,216,220],{"title":207,"path":208,"stem":209},{"title":213,"path":214,"stem":215},"Démo statique — callouts, code, BO, illustration","\u002Fsnt-2nde\u002Fzz-demo-widgets\u002Fstatique","0.snt-2nde\u002Fzz-demo-widgets\u002F1.statique",{"title":217,"path":218,"stem":219},"Démo interactive — self-eval et python-snippet","\u002Fsnt-2nde\u002Fzz-demo-widgets\u002Finteractif","0.snt-2nde\u002Fzz-demo-widgets\u002F2.interactif",{"title":221,"path":222,"stem":223},"Démo · 14 widgets de manipulation NSI","\u002Fsnt-2nde\u002Fzz-demo-widgets\u002Fwidgets-manipulation","0.snt-2nde\u002Fzz-demo-widgets\u002F3.widgets-manipulation",{"title":225,"path":226,"stem":227,"children":228},"NSI — Première","\u002Fnsi-1ere","1.nsi-1ere\u002F0.index",[229,230,234,256,282,304,328,354,380,410],{"title":225,"path":226,"stem":227},{"title":231,"path":232,"stem":233},"Relecture pédagogique — 8 chapitres NSI 1ère (PA → PH)","\u002Fnsi-1ere\u002Freview","1.nsi-1ere\u002FREVIEW",{"title":235,"path":236,"stem":237,"children":238},"Histoire de l'informatique","\u002Fnsi-1ere\u002Fpa-histoire-info","1.nsi-1ere\u002Fpa-histoire-info\u002F0.index",[239,240,244,248,252],{"title":235,"path":236,"stem":237},{"title":241,"path":242,"stem":243},"De la préantiquité aux machines à calculer","\u002Fnsi-1ere\u002Fpa-histoire-info\u002Fpreantiquite-aux-machines","1.nsi-1ere\u002Fpa-histoire-info\u002F1.preantiquite-aux-machines",{"title":245,"path":246,"stem":247},"La machine universelle (1930-1950)","\u002Fnsi-1ere\u002Fpa-histoire-info\u002Fmachine-universelle","1.nsi-1ere\u002Fpa-histoire-info\u002F2.machine-universelle",{"title":249,"path":250,"stem":251},"Les ordinateurs modernes (1947-1990)","\u002Fnsi-1ere\u002Fpa-histoire-info\u002Fordinateurs-modernes","1.nsi-1ere\u002Fpa-histoire-info\u002F3.ordinateurs-modernes",{"title":253,"path":254,"stem":255},"Réseaux, Web et IA (1969 à aujourd'hui)","\u002Fnsi-1ere\u002Fpa-histoire-info\u002Freseaux-et-web","1.nsi-1ere\u002Fpa-histoire-info\u002F4.reseaux-et-web",{"title":257,"path":258,"stem":259,"children":260},"Représentation des données — types et valeurs","\u002Fnsi-1ere\u002Fpb-types-valeurs","1.nsi-1ere\u002Fpb-types-valeurs\u002F0.index",[261,262,266,270,274,278],{"title":257,"path":258,"stem":259},{"title":263,"path":264,"stem":265},"Bases de numération et entiers positifs","\u002Fnsi-1ere\u002Fpb-types-valeurs\u002Fbases-entiers-positifs","1.nsi-1ere\u002Fpb-types-valeurs\u002F1.bases-entiers-positifs",{"title":267,"path":268,"stem":269},"Entiers relatifs et complément à deux","\u002Fnsi-1ere\u002Fpb-types-valeurs\u002Fentiers-relatifs","1.nsi-1ere\u002Fpb-types-valeurs\u002F2.entiers-relatifs",{"title":271,"path":272,"stem":273},"Nombres flottants et virgule flottante","\u002Fnsi-1ere\u002Fpb-types-valeurs\u002Fflottants","1.nsi-1ere\u002Fpb-types-valeurs\u002F3.flottants",{"title":275,"path":276,"stem":277},"Textes et encodages — ASCII, ISO-8859-1, Unicode","\u002Fnsi-1ere\u002Fpb-types-valeurs\u002Ftextes-encodages","1.nsi-1ere\u002Fpb-types-valeurs\u002F4.textes-encodages",{"title":279,"path":280,"stem":281},"Valeurs booléennes et opérateurs logiques","\u002Fnsi-1ere\u002Fpb-types-valeurs\u002Fbooleens","1.nsi-1ere\u002Fpb-types-valeurs\u002F5.booleens",{"title":283,"path":284,"stem":285,"children":286},"Représentation des données : types construits","\u002Fnsi-1ere\u002Fpc-types-construits","1.nsi-1ere\u002Fpc-types-construits\u002F0.index",[287,288,292,296,300],{"title":283,"path":284,"stem":285},{"title":289,"path":290,"stem":291},"Tableaux et listes","\u002Fnsi-1ere\u002Fpc-types-construits\u002Ftableaux-listes","1.nsi-1ere\u002Fpc-types-construits\u002F1.tableaux-listes",{"title":293,"path":294,"stem":295},"Listes en compréhension","\u002Fnsi-1ere\u002Fpc-types-construits\u002Fcomprehension","1.nsi-1ere\u002Fpc-types-construits\u002F2.comprehension",{"title":297,"path":298,"stem":299},"Tuples et p-uplets nommés","\u002Fnsi-1ere\u002Fpc-types-construits\u002Ftuples","1.nsi-1ere\u002Fpc-types-construits\u002F3.tuples",{"title":301,"path":302,"stem":303},"Dictionnaires","\u002Fnsi-1ere\u002Fpc-types-construits\u002Fdictionnaires","1.nsi-1ere\u002Fpc-types-construits\u002F4.dictionnaires",{"title":305,"path":306,"stem":307,"children":308},"Traitement de données en tables","\u002Fnsi-1ere\u002Fpd-tables-donnees","1.nsi-1ere\u002Fpd-tables-donnees\u002F0.index",[309,310,314,318,322],{"title":305,"path":306,"stem":307},{"title":311,"path":312,"stem":313},"Tables et CSV","\u002Fnsi-1ere\u002Fpd-tables-donnees\u002Ftables-csv","1.nsi-1ere\u002Fpd-tables-donnees\u002F1.tables-csv",{"title":315,"path":316,"stem":317},"Recherche et filtrage","\u002Fnsi-1ere\u002Fpd-tables-donnees\u002Frecherche","1.nsi-1ere\u002Fpd-tables-donnees\u002F2.recherche",{"title":319,"path":320,"stem":321},"Trier une table","\u002Fnsi-1ere\u002Fpd-tables-donnees\u002Ftri","1.nsi-1ere\u002Fpd-tables-donnees\u002F3.tri",{"title":323,"path":324,"stem":325,"children":326},"Fusion et indexation","\u002Fnsi-1ere\u002Fpd-tables-donnees\u002Ffusion-indexation","1.nsi-1ere\u002Fpd-tables-donnees\u002F4.fusion-indexation",[327],{"title":323,"path":324,"stem":325},{"title":329,"path":330,"stem":331,"children":332},"IHM sur le Web","\u002Fnsi-1ere\u002Fpe-ihm-web","1.nsi-1ere\u002Fpe-ihm-web\u002F0.index",[333,334,338,342,346,350],{"title":329,"path":330,"stem":331},{"title":335,"path":336,"stem":337},"HTML et CSS — rappel de structure","\u002Fnsi-1ere\u002Fpe-ihm-web\u002Fhtml-css-bases","1.nsi-1ere\u002Fpe-ihm-web\u002F1.html-css-bases",{"title":339,"path":340,"stem":341},"Formulaires HTML","\u002Fnsi-1ere\u002Fpe-ihm-web\u002Fformulaires","1.nsi-1ere\u002Fpe-ihm-web\u002F2.formulaires",{"title":343,"path":344,"stem":345},"Événements JavaScript","\u002Fnsi-1ere\u002Fpe-ihm-web\u002Fevenements-js","1.nsi-1ere\u002Fpe-ihm-web\u002F3.evenements-js",{"title":347,"path":348,"stem":349},"Manipulation du DOM","\u002Fnsi-1ere\u002Fpe-ihm-web\u002Fdom-interaction","1.nsi-1ere\u002Fpe-ihm-web\u002F4.dom-interaction",{"title":351,"path":352,"stem":353},"Client, serveur et HTTP","\u002Fnsi-1ere\u002Fpe-ihm-web\u002Fclient-serveur-http","1.nsi-1ere\u002Fpe-ihm-web\u002F5.client-serveur-http",{"title":355,"path":356,"stem":357,"children":358},"Architectures matérielles et systèmes d'exploitation","\u002Fnsi-1ere\u002Fpf-archi-os","1.nsi-1ere\u002Fpf-archi-os\u002F0.index",[359,360,364,368,372,376],{"title":355,"path":356,"stem":357},{"title":361,"path":362,"stem":363},"Le modèle de von Neumann","\u002Fnsi-1ere\u002Fpf-archi-os\u002Fvon-neumann","1.nsi-1ere\u002Fpf-archi-os\u002F1.von-neumann",{"title":365,"path":366,"stem":367},"Périphériques et interface homme-machine","\u002Fnsi-1ere\u002Fpf-archi-os\u002Fperipheriques-ihm","1.nsi-1ere\u002Fpf-archi-os\u002F2.peripheriques-ihm",{"title":369,"path":370,"stem":371},"Les systèmes d'exploitation","\u002Fnsi-1ere\u002Fpf-archi-os\u002Fsystemes-exploitation","1.nsi-1ere\u002Fpf-archi-os\u002F3.systemes-exploitation",{"title":373,"path":374,"stem":375},"Linux et le shell","\u002Fnsi-1ere\u002Fpf-archi-os\u002Flinux-shell","1.nsi-1ere\u002Fpf-archi-os\u002F4.linux-shell",{"title":377,"path":378,"stem":379},"Réseaux et protocoles","\u002Fnsi-1ere\u002Fpf-archi-os\u002Freseaux","1.nsi-1ere\u002Fpf-archi-os\u002F5.reseaux",{"title":381,"path":382,"stem":383,"children":384},"Langages et programmation","\u002Fnsi-1ere\u002Fpg-langages-prog","1.nsi-1ere\u002Fpg-langages-prog\u002F0.index",[385,386,390,394,398,402,406],{"title":381,"path":382,"stem":383},{"title":387,"path":388,"stem":389},"Diversité et unité des langages de programmation","\u002Fnsi-1ere\u002Fpg-langages-prog\u002Fdiversite-langages","1.nsi-1ere\u002Fpg-langages-prog\u002F1.diversite-langages",{"title":391,"path":392,"stem":393},"Constructions élémentaires","\u002Fnsi-1ere\u002Fpg-langages-prog\u002Fconstructions-elementaires","1.nsi-1ere\u002Fpg-langages-prog\u002F2.constructions-elementaires",{"title":395,"path":396,"stem":397},"Fonctions","\u002Fnsi-1ere\u002Fpg-langages-prog\u002Ffonctions","1.nsi-1ere\u002Fpg-langages-prog\u002F3.fonctions",{"title":399,"path":400,"stem":401},"Spécification d'une fonction","\u002Fnsi-1ere\u002Fpg-langages-prog\u002Fspecification","1.nsi-1ere\u002Fpg-langages-prog\u002F4.specification",{"title":403,"path":404,"stem":405},"Mise au point des programmes","\u002Fnsi-1ere\u002Fpg-langages-prog\u002Fmise-au-point","1.nsi-1ere\u002Fpg-langages-prog\u002F5.mise-au-point",{"title":407,"path":408,"stem":409},"Utilisation de bibliothèques","\u002Fnsi-1ere\u002Fpg-langages-prog\u002Fbibliotheques","1.nsi-1ere\u002Fpg-langages-prog\u002F6.bibliotheques",{"title":411,"path":412,"stem":413,"children":414},"Algorithmique","\u002Fnsi-1ere\u002Fph-algorithmique","1.nsi-1ere\u002Fph-algorithmique\u002F0.index",[415,416,420,424,428,432,436],{"title":411,"path":412,"stem":413},{"title":417,"path":418,"stem":419},"Parcours séquentiel d'un tableau","\u002Fnsi-1ere\u002Fph-algorithmique\u002Fparcours-sequentiel","1.nsi-1ere\u002Fph-algorithmique\u002F1.parcours-sequentiel",{"title":421,"path":422,"stem":423},"Bases de la complexité","\u002Fnsi-1ere\u002Fph-algorithmique\u002Fcomplexite-bases","1.nsi-1ere\u002Fph-algorithmique\u002F2.complexite-bases",{"title":425,"path":426,"stem":427},"Tris par sélection et par insertion","\u002Fnsi-1ere\u002Fph-algorithmique\u002Ftris","1.nsi-1ere\u002Fph-algorithmique\u002F3.tris",{"title":429,"path":430,"stem":431},"Recherche dichotomique","\u002Fnsi-1ere\u002Fph-algorithmique\u002Fdichotomie","1.nsi-1ere\u002Fph-algorithmique\u002F4.dichotomie",{"title":433,"path":434,"stem":435},"Algorithmes gloutons","\u002Fnsi-1ere\u002Fph-algorithmique\u002Fgloutons","1.nsi-1ere\u002Fph-algorithmique\u002F5.gloutons",{"title":437,"path":438,"stem":439},"Les k plus proches voisins (k-NN)","\u002Fnsi-1ere\u002Fph-algorithmique\u002Fknn","1.nsi-1ere\u002Fph-algorithmique\u002F6.knn",{"title":441,"path":442,"stem":443,"children":444},"NSI — Terminale","\u002Fnsi-tale","2.nsi-tale\u002F0.index",[445,446,450,476,498,536,560],{"title":441,"path":442,"stem":443},{"title":447,"path":448,"stem":449},"Review pédagogique — chapitres NSI Terminale (TA, TB, TC, TD, TE)","\u002Fnsi-tale\u002Freview","2.nsi-tale\u002FREVIEW",{"title":451,"path":452,"stem":453,"children":454},"Structures de données","\u002Fnsi-tale\u002Fta-structures-donnees","2.nsi-tale\u002Fta-structures-donnees\u002F0.index",[455,456,460,464,468,472],{"title":451,"path":452,"stem":453},{"title":457,"path":458,"stem":459},"Objet, classe, interface","\u002Fnsi-tale\u002Fta-structures-donnees\u002Finterface-implementation","2.nsi-tale\u002Fta-structures-donnees\u002F1.interface-implementation",{"title":461,"path":462,"stem":463},"Implémenter une structure — l'exemple de la file FIFO","\u002Fnsi-tale\u002Fta-structures-donnees\u002Fimplementer-une-structure","2.nsi-tale\u002Fta-structures-donnees\u002F2.implementer-une-structure",{"title":465,"path":466,"stem":467},"Listes, piles, files, dictionnaires","\u002Fnsi-tale\u002Fta-structures-donnees\u002Flistes-piles-files-dict","2.nsi-tale\u002Fta-structures-donnees\u002F3.listes-piles-files-dict",{"title":469,"path":470,"stem":471},"Arbres binaires","\u002Fnsi-tale\u002Fta-structures-donnees\u002Farbres-binaires","2.nsi-tale\u002Fta-structures-donnees\u002F4.arbres-binaires",{"title":473,"path":474,"stem":475},"Graphes","\u002Fnsi-tale\u002Fta-structures-donnees\u002Fgraphes","2.nsi-tale\u002Fta-structures-donnees\u002F5.graphes",{"title":477,"path":478,"stem":479,"children":480},"Bases de données","\u002Fnsi-tale\u002Ftb-bases-de-donnees","2.nsi-tale\u002Ftb-bases-de-donnees\u002F0.index",[481,482,486,490,494],{"title":477,"path":478,"stem":479},{"title":483,"path":484,"stem":485},"Le modèle relationnel","\u002Fnsi-tale\u002Ftb-bases-de-donnees\u002Fmodele-relationnel","2.nsi-tale\u002Ftb-bases-de-donnees\u002F1.modele-relationnel",{"title":487,"path":488,"stem":489},"Bases de données relationnelles et anomalies de schéma","\u002Fnsi-tale\u002Ftb-bases-de-donnees\u002Fbase-relationnelle","2.nsi-tale\u002Ftb-bases-de-donnees\u002F2.base-relationnelle",{"title":491,"path":492,"stem":493},"Le langage SQL","\u002Fnsi-tale\u002Ftb-bases-de-donnees\u002Fsql","2.nsi-tale\u002Ftb-bases-de-donnees\u002F3.sql",{"title":495,"path":496,"stem":497},"Les systèmes de gestion de bases de données","\u002Fnsi-tale\u002Ftb-bases-de-donnees\u002Fsgbd","2.nsi-tale\u002Ftb-bases-de-donnees\u002F4.sgbd",{"title":499,"path":500,"stem":501,"children":502},"Architectures matérielles, systèmes d'exploitation et réseaux","\u002Fnsi-tale\u002Ftc-archi-os-reseaux","2.nsi-tale\u002Ftc-archi-os-reseaux\u002F0.index",[503,504,508,512,516,520,524,528,532],{"title":499,"path":500,"stem":501},{"title":505,"path":506,"stem":507},"Le système sur puce (SoC)","\u002Fnsi-tale\u002Ftc-archi-os-reseaux\u002Fsysteme-sur-puce","2.nsi-tale\u002Ftc-archi-os-reseaux\u002F1.systeme-sur-puce",{"title":509,"path":510,"stem":511},"Processus et ordonnancement par l'OS","\u002Fnsi-tale\u002Ftc-archi-os-reseaux\u002Fprocessus-os","2.nsi-tale\u002Ftc-archi-os-reseaux\u002F2.processus-os",{"title":513,"path":514,"stem":515},"L'interblocage (deadlock)","\u002Fnsi-tale\u002Ftc-archi-os-reseaux\u002Finterblocage","2.nsi-tale\u002Ftc-archi-os-reseaux\u002F3.interblocage",{"title":517,"path":518,"stem":519},"Principes du routage","\u002Fnsi-tale\u002Ftc-archi-os-reseaux\u002Froutage-principes","2.nsi-tale\u002Ftc-archi-os-reseaux\u002F4.routage-principes",{"title":521,"path":522,"stem":523},"Protocoles de routage RIP et OSPF","\u002Fnsi-tale\u002Ftc-archi-os-reseaux\u002Fprotocoles-rip-ospf","2.nsi-tale\u002Ftc-archi-os-reseaux\u002F5.protocoles-rip-ospf",{"title":525,"path":526,"stem":527},"Chiffrement symétrique","\u002Fnsi-tale\u002Ftc-archi-os-reseaux\u002Fchiffrement-symetrique","2.nsi-tale\u002Ftc-archi-os-reseaux\u002F6.chiffrement-symetrique",{"title":529,"path":530,"stem":531},"Chiffrement asymétrique","\u002Fnsi-tale\u002Ftc-archi-os-reseaux\u002Fchiffrement-asymetrique","2.nsi-tale\u002Ftc-archi-os-reseaux\u002F7.chiffrement-asymetrique",{"title":533,"path":534,"stem":535},"HTTPS — l'échange de clé symétrique","\u002Fnsi-tale\u002Ftc-archi-os-reseaux\u002Fhttps-tls","2.nsi-tale\u002Ftc-archi-os-reseaux\u002F8.https-tls",{"title":381,"path":537,"stem":538,"children":539},"\u002Fnsi-tale\u002Ftd-langages-prog","2.nsi-tale\u002Ftd-langages-prog\u002F0.index",[540,541,544,548,552,556],{"title":381,"path":537,"stem":538},{"title":403,"path":542,"stem":543},"\u002Fnsi-tale\u002Ftd-langages-prog\u002Fmise-au-point","2.nsi-tale\u002Ftd-langages-prog\u002F1.mise-au-point",{"title":545,"path":546,"stem":547},"Modularité","\u002Fnsi-tale\u002Ftd-langages-prog\u002Fmodularite","2.nsi-tale\u002Ftd-langages-prog\u002F2.modularite",{"title":549,"path":550,"stem":551},"Récursivité","\u002Fnsi-tale\u002Ftd-langages-prog\u002Frecursivite","2.nsi-tale\u002Ftd-langages-prog\u002F3.recursivite",{"title":553,"path":554,"stem":555},"Paradigmes de programmation","\u002Fnsi-tale\u002Ftd-langages-prog\u002Fparadigmes","2.nsi-tale\u002Ftd-langages-prog\u002F4.paradigmes",{"title":557,"path":558,"stem":559},"Programme comme donnée — calculabilité et indécidabilité","\u002Fnsi-tale\u002Ftd-langages-prog\u002Fprogramme-comme-donnee","2.nsi-tale\u002Ftd-langages-prog\u002F5.programme-comme-donnee",{"title":411,"path":561,"stem":562,"children":563},"\u002Fnsi-tale\u002Fte-algorithmique","2.nsi-tale\u002Fte-algorithmique\u002F0.index",[564,565,569,573,577,581],{"title":411,"path":561,"stem":562},{"title":566,"path":567,"stem":568},"Algorithmes sur les arbres binaires","\u002Fnsi-tale\u002Fte-algorithmique\u002Farbres-binaires-algos","2.nsi-tale\u002Fte-algorithmique\u002F1.arbres-binaires-algos",{"title":570,"path":571,"stem":572},"Parcours de graphes — DFS, BFS, cycles, chemins","\u002Fnsi-tale\u002Fte-algorithmique\u002Fgraphes-parcours","2.nsi-tale\u002Fte-algorithmique\u002F2.graphes-parcours",{"title":574,"path":575,"stem":576},"Diviser pour régner","\u002Fnsi-tale\u002Fte-algorithmique\u002Fdiviser-pour-regner","2.nsi-tale\u002Fte-algorithmique\u002F3.diviser-pour-regner",{"title":578,"path":579,"stem":580},"Programmation dynamique","\u002Fnsi-tale\u002Fte-algorithmique\u002Fprogrammation-dynamique","2.nsi-tale\u002Fte-algorithmique\u002F4.programmation-dynamique",{"title":582,"path":583,"stem":584},"Recherche textuelle — l'algorithme de Boyer-Moore","\u002Fnsi-tale\u002Fte-algorithmique\u002Frecherche-textuelle","2.nsi-tale\u002Fte-algorithmique\u002F5.recherche-textuelle",{"id":586,"title":33,"bo":587,"body":589,"description":969,"eval":970,"extension":971,"labo":970,"meta":972,"navigation":973,"path":34,"quizzes":974,"readingTime":981,"seo":982,"stem":35,"tp":970,"__hash__":983},"cours\u002F0.snt-2nde\u002Fsa-internet\u002F4.pair-a-pair.md",[588],"SA04",{"type":590,"value":591,"toc":959},"minimark",[592,597,632,635,639,646,668,678,685,689,708,715,718,745,749,752,812,822,826,829,860,884,898,923,927,934,948,952],[593,594,596],"h2",{"id":595},"introduction","Introduction",[598,599,600,601,605,606,609,610,614,615,618,619,622,623,627,628,631],"p",{},"La plupart de vos usages quotidiens d'Internet reposent sur un modèle simple :\nvotre ordinateur est un ",[602,603,604],"strong",{},"client"," qui demande, et il s'adresse à un ",[602,607,608],{},"serveur","\nqui répond. Vous ouvrez ",[611,612,613],"code",{},"nsi.rocks",", le serveur vous renvoie la page. Mais il\nexiste une autre organisation, plus égalitaire, dans laquelle chaque machine\njoue ",[602,616,617],{},"les deux rôles"," simultanément : ce modèle est appelé réseau\n",[602,620,621],{},"pair-à-pair"," (en anglais, ",[624,625,626],"em",{},"peer-to-peer",", ou ",[602,629,630],{},"P2P",").",[633,634],"bo-ref",{"code":588},[593,636,638],{"id":637},"le-modèle-client-serveur-pour-mémoire","Le modèle client-serveur, pour mémoire",[598,640,641,642,645],{},"Dans le modèle ",[602,643,644],{},"client-serveur"," :",[647,648,649,656,661],"ul",{},[650,651,652,653,655],"li",{},"Le ",[602,654,608],{}," est une machine puissante, allumée en permanence, qui héberge\nun service (un site, un jeu, une messagerie).",[650,657,652,658,660],{},[602,659,604],{}," est votre appareil personnel, qui se connecte au serveur pour\nconsommer le service.",[650,662,663,664,667],{},"La communication est ",[602,665,666],{},"asymétrique"," : le client demande, le serveur répond.",[669,670,676],"pre",{"className":671,"code":673,"language":674,"meta":675},[672],"language-text","[Client A]──┐\n[Client B]──┼──▶ [Serveur unique]\n[Client C]──┘\n","text","",[611,677,673],{"__ignoreMap":675},[598,679,680,681,684],{},"C'est efficace, simple à administrer, et c'est le modèle dominant du web. Mais\nil a une faiblesse : ",[602,682,683],{},"si le serveur tombe, plus personne n'a accès au service",".",[593,686,688],{"id":687},"le-modèle-pair-à-pair","Le modèle pair-à-pair",[598,690,691,692,695,696,699,700,703,704,707],{},"Dans un ",[602,693,694],{},"réseau pair-à-pair",", il n'y a ",[602,697,698],{},"pas"," de serveur central. Chaque\nmachine connectée — appelée ",[602,701,702],{},"pair"," ou ",[624,705,706],{},"peer"," — est à la fois cliente et\nserveuse : elle demande des ressources aux autres pairs, et elle en fournit à\nceux qui en demandent.",[709,710],"illustration",{"alt":711,"kind":712,"src":713,"svg":714},"Client-serveur vs pair-à-pair","mermaid","\u002Fillustrations\u002F0.snt-2nde\u002Fsa-internet\u002Fclient-serveur-vs-p2p.svg","\u003Csvg class=\"illustration-svg\" xmlns=\"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg\" viewBox=\"0 0 480 250\" role=\"img\" aria-label=\"Comparaison : à gauche le modèle client-serveur (quatre clients autour d'un serveur central), à droite le modèle pair-à-pair (quatre pairs reliés en maille, sans centre)\">\n  \u003Ctitle>Client-serveur vs pair-à-pair\u003C\u002Ftitle>\n  \u003Cstyle>\n    .cp-title { fill: var(--diagram-text); font-family: Geist, Inter, system-ui, sans-serif; font-size: 13px; font-weight: 600; }\n    .cp-node  { fill: var(--diagram-node-bg); stroke: var(--diagram-node-border); stroke-width: 1.5; }\n    .cp-label { fill: var(--diagram-text); font-family: Geist, Inter, system-ui, sans-serif; font-size: 12px; font-weight: 500; }\n    .cp-edge  { stroke: var(--diagram-line); stroke-width: 1.5; fill: none; }\n    .cp-arrow { fill: var(--diagram-line); }\n    .cp-divider { stroke: var(--diagram-border); stroke-width: 1.5; stroke-dasharray: 4 4; }\n  \u003C\u002Fstyle>\n\n  \u003Cline class=\"cp-divider\" x1=\"240\" y1=\"40\" x2=\"240\" y2=\"230\"\u002F>\n\n  \u003C!-- ░░ Client-serveur (gauche) ░░ -->\n  \u003Ctext x=\"120\" y=\"26\" text-anchor=\"middle\" class=\"cp-title\">Client-serveur\u003C\u002Ftext>\n\n  \u003C!-- arêtes client → serveur (sous les nœuds) -->\n  \u003Cpath class=\"cp-edge\" d=\"M 60 92 L 100 132\"\u002F>\n  \u003Cpath class=\"cp-edge\" d=\"M 180 92 L 140 132\"\u002F>\n  \u003Cpath class=\"cp-edge\" d=\"M 60 200 L 100 160\"\u002F>\n  \u003Cpath class=\"cp-edge\" d=\"M 180 200 L 140 160\"\u002F>\n  \u003Cpolygon class=\"cp-arrow\" points=\"103,135 92,133 99,124\"\u002F>\n  \u003Cpolygon class=\"cp-arrow\" points=\"137,135 141,124 148,133\"\u002F>\n  \u003Cpolygon class=\"cp-arrow\" points=\"103,157 99,168 92,159\"\u002F>\n  \u003Cpolygon class=\"cp-arrow\" points=\"137,157 148,159 141,168\"\u002F>\n\n  \u003C!-- serveur central -->\n  \u003Ccircle cx=\"120\" cy=\"146\" r=\"26\" class=\"cp-node\"\u002F>\n  \u003Ctext x=\"120\" y=\"150\" text-anchor=\"middle\" class=\"cp-label\">Serveur\u003C\u002Ftext>\n\n  \u003C!-- clients -->\n  \u003Cg>\n    \u003Crect x=\"22\"  y=\"62\"  width=\"64\" height=\"30\" rx=\"4\" class=\"cp-node\"\u002F>\u003Ctext x=\"54\"  y=\"81\"  text-anchor=\"middle\" class=\"cp-label\">Client\u003C\u002Ftext>\n    \u003Crect x=\"154\" y=\"62\"  width=\"64\" height=\"30\" rx=\"4\" class=\"cp-node\"\u002F>\u003Ctext x=\"186\" y=\"81\"  text-anchor=\"middle\" class=\"cp-label\">Client\u003C\u002Ftext>\n    \u003Crect x=\"22\"  y=\"200\" width=\"64\" height=\"30\" rx=\"4\" class=\"cp-node\"\u002F>\u003Ctext x=\"54\"  y=\"219\" text-anchor=\"middle\" class=\"cp-label\">Client\u003C\u002Ftext>\n    \u003Crect x=\"154\" y=\"200\" width=\"64\" height=\"30\" rx=\"4\" class=\"cp-node\"\u002F>\u003Ctext x=\"186\" y=\"219\" text-anchor=\"middle\" class=\"cp-label\">Client\u003C\u002Ftext>\n  \u003C\u002Fg>\n\n  \u003C!-- ░░ Pair-à-pair (droite) ░░ -->\n  \u003Ctext x=\"360\" y=\"26\" text-anchor=\"middle\" class=\"cp-title\">Pair-à-pair\u003C\u002Ftext>\n\n  \u003C!-- maille : 4 pairs tous reliés (6 arêtes, sans centre) -->\n  \u003Cpath class=\"cp-edge\" d=\"M 300 77 L 420 77\"\u002F>\n  \u003Cpath class=\"cp-edge\" d=\"M 300 215 L 420 215\"\u002F>\n  \u003Cpath class=\"cp-edge\" d=\"M 300 77 L 300 215\"\u002F>\n  \u003Cpath class=\"cp-edge\" d=\"M 420 77 L 420 215\"\u002F>\n  \u003Cpath class=\"cp-edge\" d=\"M 300 77 L 420 215\"\u002F>\n  \u003Cpath class=\"cp-edge\" d=\"M 420 77 L 300 215\"\u002F>\n\n  \u003Cg>\n    \u003Crect x=\"268\" y=\"62\"  width=\"64\" height=\"30\" rx=\"4\" class=\"cp-node\"\u002F>\u003Ctext x=\"300\" y=\"81\"  text-anchor=\"middle\" class=\"cp-label\">Pair\u003C\u002Ftext>\n    \u003Crect x=\"388\" y=\"62\"  width=\"64\" height=\"30\" rx=\"4\" class=\"cp-node\"\u002F>\u003Ctext x=\"420\" y=\"81\"  text-anchor=\"middle\" class=\"cp-label\">Pair\u003C\u002Ftext>\n    \u003Crect x=\"268\" y=\"200\" width=\"64\" height=\"30\" rx=\"4\" class=\"cp-node\"\u002F>\u003Ctext x=\"300\" y=\"219\" text-anchor=\"middle\" class=\"cp-label\">Pair\u003C\u002Ftext>\n    \u003Crect x=\"388\" y=\"200\" width=\"64\" height=\"30\" rx=\"4\" class=\"cp-node\"\u002F>\u003Ctext x=\"420\" y=\"219\" text-anchor=\"middle\" class=\"cp-label\">Pair\u003C\u002Ftext>\n  \u003C\u002Fg>\n\u003C\u002Fsvg>\n",[598,716,717],{},"Une analogie : un repas partagé en colocation. Plutôt qu'un seul cuisinier\nservant tout le monde (client-serveur), chaque colocataire apporte un plat et\nsert les autres tout en se servant lui-même (pair-à-pair). Personne n'est\nindispensable, et la table reste garnie même si l'un se désiste.",[719,720,723,729],"self-eval-qcm",{"correct":721,"slug":722},"2","pair-a-pair-c1",[724,725,726],"template",{"v-slot:question":675},[598,727,728],{},"Dans un réseau pair-à-pair, quel rôle joue chaque machine ?",[724,730,731],{"v-slot:choices":675},[647,732,733,736,739,742],{},[650,734,735],{},"uniquement cliente",[650,737,738],{},"uniquement serveuse",[650,740,741],{},"à la fois cliente et serveuse",[650,743,744],{},"aucun rôle particulier",[593,746,748],{"id":747},"pourquoi-cest-intéressant","Pourquoi c'est intéressant",[598,750,751],{},"Le pair-à-pair présente plusieurs avantages structurels :",[753,754,755,768],"table",{},[756,757,758],"thead",{},[759,760,761,765],"tr",{},[762,763,764],"th",{},"Avantage",[762,766,767],{},"Explication",[769,770,771,782,792,802],"tbody",{},[759,772,773,779],{},[774,775,776],"td",{},[602,777,778],{},"Résilience",[774,780,781],{},"Pas de point central à faire tomber. Si un pair se déconnecte, les autres continuent.",[759,783,784,789],{},[774,785,786],{},[602,787,788],{},"Passage à l'échelle",[774,790,791],{},"Plus il y a de pairs, plus il y a de ressources disponibles dans le réseau.",[759,793,794,799],{},[774,795,796],{},[602,797,798],{},"Pas d'infrastructure coûteuse",[774,800,801],{},"Pas besoin d'investir dans des serveurs surpuissants.",[759,803,804,809],{},[774,805,806],{},[602,807,808],{},"Distribution équitable de la charge",[774,810,811],{},"Le téléchargement d'un fichier puise des morceaux chez plusieurs pairs à la fois.",[813,814,815],"tip",{},[598,816,817,818,821],{},"Quand vous téléchargez un fichier volumineux via un réseau P2P, vous ne le\nrécupérez pas auprès d'une seule machine : vous en obtenez des ",[602,819,820],{},"morceaux"," de\nplusieurs pairs simultanément, ce qui peut accélérer considérablement le\ntéléchargement par rapport à un serveur unique.",[593,823,825],{"id":824},"quelques-exemples-dusages","Quelques exemples d'usages",[598,827,828],{},"Le pair-à-pair n'est pas une curiosité : il sous-tend des services bien réels,\nlégitimes ou contestés.",[830,831,834],"card",{"icon":832,"title":833},"i-lucide-check","Usages légitimes",[647,835,836,842,848,854],{},[650,837,838,841],{},[602,839,840],{},"BitTorrent"," pour distribuer de gros fichiers libres : images de\ndistributions Linux, archives de l'Internet Archive, jeux libres.",[650,843,844,847],{},[602,845,846],{},"Mises à jour de logiciels"," : certains systèmes (Windows, Blizzard) utilisent\nle P2P pour répartir la charge des téléchargements massifs.",[650,849,850,853],{},[602,851,852],{},"Réseaux décentralisés"," : Bitcoin, IPFS, Mastodon (en partie). Pas de\nserveur central qui pourrait imposer une censure.",[650,855,856,859],{},[602,857,858],{},"Visioconférence"," : certains outils utilisent du P2P pour relier\ndirectement deux participants sans passer par un serveur intermédiaire.",[830,861,864],{"icon":862,"title":863},"i-lucide-alert-triangle","Usages illicites",[647,865,866,872,878],{},[650,867,868,871],{},[602,869,870],{},"Partage de fichiers protégés par le droit d'auteur"," : films, séries,\nmusique, logiciels piratés. C'est l'usage historique qui a popularisé le\nP2P (Napster en 1999, eMule, BitTorrent…).",[650,873,874,877],{},[602,875,876],{},"Distribution de contenus illégaux"," : la décentralisation rend la lutte\ncontre les contenus interdits plus difficile.",[650,879,880,883],{},[602,881,882],{},"Marchés noirs en ligne"," : certains services illégaux s'appuient sur des\nréseaux pair-à-pair pour échapper aux autorités.",[885,886,887],"warning",{},[598,888,889,890,893,894,897],{},"Le partage de fichiers protégés par le droit d'auteur via un réseau P2P est\n",[602,891,892],{},"illégal"," en France. La loi ",[602,895,896],{},"Hadopi"," (2009) permet de sanctionner les\nutilisateurs identifiés. Au-delà de la sanction, c'est aussi une atteinte au\ntravail des auteurs et des artistes qui produisent ces œuvres.",[719,899,902,907],{"correct":900,"slug":901},"1","pair-a-pair-c2",[724,903,904],{"v-slot:question":675},[598,905,906],{},"Lequel de ces usages du P2P est légitime ?",[724,908,909],{"v-slot:choices":675},[647,910,911,914,917,920],{},[650,912,913],{},"télécharger un film en streaming illégal",[650,915,916],{},"distribuer une distribution Linux libre",[650,918,919],{},"pirater un jeu vidéo récent",[650,921,922],{},"partager illégalement une chanson protégée",[593,924,926],{"id":925},"difficulté-du-contrôle","Difficulté du contrôle",[598,928,929,930,933],{},"Avec un service centralisé, il suffit d'éteindre le serveur pour interrompre\nle service — ou de le saisir pour bloquer la diffusion d'un contenu. Dans un\nréseau pair-à-pair, ",[602,931,932],{},"chaque utilisateur"," est en partie hébergeur : il\nfaudrait éteindre toutes les machines participantes pour faire disparaître le\ncontenu. C'est cette propriété qui rend le P2P précieux pour les usages\ndécentralisés, et difficile à contrôler quand il est utilisé pour des activités\nillicites.",[935,936,937],"caution",{},[598,938,939,940,943,944,947],{},"La décentralisation n'est ni un bien ni un mal en soi : c'est une ",[602,941,942],{},"propriété\ntechnique"," qui sert l'usage qui en est fait. Un réseau pair-à-pair peut servir à\ndistribuer une encyclopédie libre comme à diffuser un contenu illégal — c'est\nl'",[602,945,946],{},"usage"," qui qualifie l'action, pas la technologie.",[593,949,951],{"id":950},"pour-aller-plus-loin","Pour aller plus loin",[598,953,954,955,958],{},"L'idée pair-à-pair est aussi au cœur des ",[602,956,957],{},"blockchains"," (Bitcoin, Ethereum) :\ndes milliers de machines partagent une copie commune d'un registre, qu'elles\nmettent à jour ensemble selon des règles précises, sans qu'aucune autorité\ncentrale ne valide les transactions. C'est une extension du principe P2P :\nchaque pair contribue, et la cohérence émerge de l'accord collectif.",{"title":675,"searchDepth":960,"depth":960,"links":961},2,[962,963,964,965,966,967,968],{"id":595,"depth":960,"text":596},{"id":637,"depth":960,"text":638},{"id":687,"depth":960,"text":688},{"id":747,"depth":960,"text":748},{"id":824,"depth":960,"text":825},{"id":925,"depth":960,"text":926},{"id":950,"depth":960,"text":951},"Quand chaque machine devient à la fois cliente et serveuse — usages légitimes et dérives.",null,"md",{},true,[975,979],{"slug":722,"kind":976,"question":728,"choices":977,"correct":721,"multi":978,"explanation":675},"qcm",[735,738,741,744],false,{"slug":901,"kind":976,"question":906,"choices":980,"correct":900,"multi":978,"explanation":675},[913,916,919,922],1,{"title":33,"description":969},"Uw0f4jwJIjkTS4fdMA7eRUpphgEsLy0r179XavU1bQc",{"id":985,"title":986,"bo":987,"body":988,"description":1267,"eval":970,"extension":971,"labo":970,"meta":1268,"navigation":978,"path":1269,"quizzes":1270,"readingTime":981,"seo":1271,"stem":1272,"tp":970,"__hash__":1273},"coursMemo\u002F0.snt-2nde\u002Fsa-internet\u002F4.pair-a-pair.memo.md","Réseaux pair-à-pair — l'essentiel",[588],{"type":590,"value":989,"toc":1260},[990,994,1005,1009,1044,1048,1102,1106,1150,1154],[593,991,993],{"id":992},"en-une-phrase","En une phrase",[598,995,996,997,1000,1001,1004],{},"Dans un réseau ",[602,998,999],{},"pair-à-pair (P2P)",", chaque machine est ",[602,1002,1003],{},"à la fois cliente\net serveuse"," ; il n'y a pas de serveur central.",[593,1006,1008],{"id":1007},"à-mémoriser","À mémoriser",[647,1010,1011,1017,1023,1032,1038],{},[650,1012,1013,1016],{},[602,1014,1015],{},"Modèle client-serveur"," : un serveur central, plusieurs clients. Si le\nserveur tombe, le service est interrompu.",[650,1018,1019,1022],{},[602,1020,1021],{},"Modèle pair-à-pair (P2P)"," : pas de serveur central, chaque pair partage et\nreçoit. Résilient et décentralisé.",[650,1024,1025,1026,1028,1029,684],{},"Un fichier téléchargé en P2P est récupéré par ",[602,1027,820],{},", chez ",[602,1030,1031],{},"plusieurs\npairs simultanément",[650,1033,1034,1037],{},[602,1035,1036],{},"Avantages"," : résilience, passage à l'échelle, pas d'infrastructure lourde.",[650,1039,1040,1043],{},[602,1041,1042],{},"Inconvénients"," : contrôle difficile, propice aux usages illicites.",[593,1045,1047],{"id":1046},"usages-typiques","Usages typiques",[753,1049,1050,1060],{},[756,1051,1052],{},[759,1053,1054,1057],{},[762,1055,1056],{},"Usage",[762,1058,1059],{},"Légitimité",[769,1061,1062,1070,1077,1084,1095],{},[759,1063,1064,1067],{},[774,1065,1066],{},"Distribuer des images Linux libres (BitTorrent)",[774,1068,1069],{},"Légitime",[759,1071,1072,1075],{},[774,1073,1074],{},"Mises à jour distribuées (Blizzard, Windows)",[774,1076,1069],{},[759,1078,1079,1082],{},[774,1080,1081],{},"Bitcoin, blockchains",[774,1083,1069],{},[759,1085,1086,1089],{},[774,1087,1088],{},"Partage de films, séries, musique protégés",[774,1090,1091,1094],{},[602,1092,1093],{},"Illégal"," (loi Hadopi)",[759,1096,1097,1100],{},[774,1098,1099],{},"Distribution de contenus interdits",[774,1101,1093],{},[593,1103,1105],{"id":1104},"à-savoir-reconnaître","À savoir reconnaître",[753,1107,1108,1118],{},[756,1109,1110],{},[759,1111,1112,1115],{},[762,1113,1114],{},"Indice",[762,1116,1117],{},"Modèle",[769,1119,1120,1128,1136,1143],{},[759,1121,1122,1125],{},[774,1123,1124],{},"« Un serveur central reçoit les requêtes »",[774,1126,1127],{},"Client-serveur",[759,1129,1130,1133],{},[774,1131,1132],{},"« Chaque machine partage à toutes les autres »",[774,1134,1135],{},"Pair-à-pair",[759,1137,1138,1141],{},[774,1139,1140],{},"« Si le serveur tombe, plus de service »",[774,1142,1127],{},[759,1144,1145,1148],{},[774,1146,1147],{},"« Pas d'autorité centrale »",[774,1149,1135],{},[593,1151,1153],{"id":1152},"pièges-courants","Pièges courants",[647,1155,1156,1163,1166],{},[650,1157,1158,1159,1162],{},"Le P2P n'est ",[602,1160,1161],{},"pas illégal en soi"," — c'est l'usage qui l'est.",[650,1164,1165],{},"Télécharger via P2P un contenu protégé est répréhensible (Hadopi).",[650,1167,1168,1169,1259],{},"Décentralisation ",[1170,1171,1174,1198],"span",{"className":1172},[1173],"katex",[1170,1175,1178],{"className":1176},[1177],"katex-mathml",[1179,1180,1182],"math",{"xmlns":1181},"http:\u002F\u002Fwww.w3.org\u002F1998\u002FMath\u002FMathML",[1183,1184,1185,1193],"semantics",{},[1186,1187,1188],"mrow",{},[1189,1190,1192],"mo",{"mathvariant":1191},"normal","≠",[1194,1195,1197],"annotation",{"encoding":1196},"application\u002Fx-tex","\\neq",[1170,1199,1203],{"className":1200,"ariaHidden":1202},[1201],"katex-html","true",[1170,1204,1207,1212],{"className":1205},[1206],"base",[1170,1208],{"className":1209,"style":1211},[1210],"strut","height:0.8889em;vertical-align:-0.1944em;",[1170,1213,1216,1250,1255],{"className":1214},[1215],"mrel",[1170,1217,1219],{"className":1218},[1215],[1170,1220,1224],{"className":1221},[1222,1223],"mord","vbox",[1170,1225,1228],{"className":1226},[1227],"thinbox",[1170,1229,1232,1235,1246],{"className":1230},[1231],"rlap",[1170,1233],{"className":1234,"style":1211},[1210],[1170,1236,1239],{"className":1237},[1238],"inner",[1170,1240,1242],{"className":1241},[1222],[1170,1243,1245],{"className":1244},[1215],"",[1170,1247],{"className":1248},[1249],"fix",[1170,1251],{"className":1252},[1253,1254],"mspace","nobreak",[1170,1256,1258],{"className":1257},[1215],"="," anonymat : votre IP est visible des autres pairs.",{"title":675,"searchDepth":960,"depth":960,"links":1261},[1262,1263,1264,1265,1266],{"id":992,"depth":960,"text":993},{"id":1007,"depth":960,"text":1008},{"id":1046,"depth":960,"text":1047},{"id":1104,"depth":960,"text":1105},{"id":1152,"depth":960,"text":1153},"Mémo de révision sur le P2P, ses usages et ses dérives.",{},"\u002Fsnt-2nde\u002Fsa-internet\u002Fpair-a-pair.memo",[],{"title":986,"description":1267},"0.snt-2nde\u002Fsa-internet\u002F4.pair-a-pair.memo","aGT5S41asmDmFJrq5A7798vacNekTEinfsf0V-SGLVc",{"id":1275,"title":1276,"body":1277,"description":1497,"extension":971,"meta":1498,"navigation":978,"path":1499,"seo":1500,"stem":1501,"__hash__":1502},"coursSlides\u002F0.snt-2nde\u002Fsa-internet\u002F4.pair-a-pair.slides.md","Réseaux pair-à-pair — diapositives",{"type":590,"value":1278,"toc":1495},[1279,1283,1290,1295,1298,1301,1321,1327,1329,1333,1351,1354,1356,1360,1363,1366,1369,1371,1375,1397,1399,1402,1426,1428,1431,1451,1457,1459,1463,1466,1469,1472,1474,1478],[1280,1281,33],"h1",{"id":1282},"réseaux-pair-à-pair",[598,1284,1285,1286,1289],{},"Quand chaque machine devient cliente ",[602,1287,1288],{},"et"," serveuse.",[598,1291,1292,1293],{},"SNT Seconde — chapitre Internet — ",[633,1294],{"code":588},[1296,1297],"hr",{},[1280,1299,1015],{"id":1300},"modèle-client-serveur",[647,1302,1303,1309,1316],{},[650,1304,1305,1306,1308],{},"Un ",[602,1307,608],{}," central, allumé en permanence.",[650,1310,1311,1312,1315],{},"Plusieurs ",[602,1313,1314],{},"clients"," qui demandent.",[650,1317,1318,1319,684],{},"Communication ",[602,1320,666],{},[598,1322,1323,1324,684],{},"Faiblesse : si le serveur tombe, ",[602,1325,1326],{},"plus de service",[1296,1328],{},[1280,1330,1332],{"id":1331},"modèle-pair-à-pair","Modèle pair-à-pair",[647,1334,1335,1340,1346],{},[650,1336,1337],{},[602,1338,1339],{},"Pas de serveur central.",[650,1341,1342,1343,1345],{},"Chaque ",[602,1344,702],{}," est cliente et serveuse.",[650,1347,1318,1348,684],{},[602,1349,1350],{},"symétrique",[598,1352,1353],{},"Force : aucune machine indispensable.",[1296,1355],{},[1280,1357,1359],{"id":1358},"comparaison-visuelle","Comparaison visuelle",[709,1361],{"alt":1362,"kind":712,"src":713,"svg":714},"Client-serveur vs P2P",[598,1364,1365],{},"À gauche : étoile autour du serveur.",[598,1367,1368],{},"À droite : maille entre pairs.",[1296,1370],{},[1280,1372,1374],{"id":1373},"avantages-du-p2p","Avantages du P2P",[647,1376,1377,1382,1387,1391],{},[650,1378,1379,1381],{},[602,1380,778],{}," : pas de point central.",[650,1383,1384,1386],{},[602,1385,788],{}," : plus de pairs = plus de capacité.",[650,1388,1389,684],{},[602,1390,798],{},[650,1392,1393,1396],{},[602,1394,1395],{},"Téléchargement en morceaux"," depuis plusieurs pairs.",[1296,1398],{},[1280,1400,833],{"id":1401},"usages-légitimes",[647,1403,1404,1409,1415,1421],{},[650,1405,1406,1408],{},[602,1407,840],{}," pour distributions Linux, archives libres.",[650,1410,1411,1414],{},[602,1412,1413],{},"Mises à jour logicielles"," (Blizzard, certains éditeurs).",[650,1416,1417,1420],{},[602,1418,1419],{},"Bitcoin"," et blockchains.",[650,1422,1423,1425],{},[602,1424,858],{}," directe entre participants.",[1296,1427],{},[1280,1429,863],{"id":1430},"usages-illicites",[647,1432,1433,1439,1445],{},[650,1434,1435,1436,684],{},"Partage de ",[602,1437,1438],{},"films, séries, musique protégés",[650,1440,1441,1442,684],{},"Distribution de ",[602,1443,1444],{},"contenus interdits",[650,1446,1447,1450],{},[602,1448,1449],{},"Loi Hadopi"," (2009) : sanction des utilisateurs identifiés.",[598,1452,1453,1454,947],{},"C'est ",[602,1455,1456],{},"l'usage",[1296,1458],{},[1280,1460,1462],{"id":1461},"pourquoi-cest-difficile-à-contrôler","Pourquoi c'est difficile à contrôler",[598,1464,1465],{},"Pas de serveur unique à éteindre ou saisir.",[598,1467,1468],{},"Chaque utilisateur est en partie hébergeur.",[598,1470,1471],{},"Propriété précieuse pour la décentralisation, mais qui complique la lutte contre les usages illicites.",[1296,1473],{},[1280,1475,1477],{"id":1476},"à-retenir","À retenir",[598,1479,652,1480,1482,1483,1486,1487,1490,1491,1494],{},[602,1481,621],{}," est une organisation ",[602,1484,1485],{},"égalitaire"," où chaque machine\nparticipe. C'est une ",[602,1488,1489],{},"propriété technique"," au service d'usages divers, dont\ncertains sont ",[602,1492,1493],{},"illégaux"," : à vous de connaître la loi.",{"title":675,"searchDepth":960,"depth":960,"links":1496},[],"Deck projetable sur le P2P.",{},"\u002Fsnt-2nde\u002Fsa-internet\u002Fpair-a-pair.slides",{"title":1276,"description":1497},"0.snt-2nde\u002Fsa-internet\u002F4.pair-a-pair.slides","hDDwdqxdWZEHwt5ro6dbGBVsQOjXTqMoK25SVCSA6YE",{"id":985,"title":986,"bo":1504,"body":1505,"description":1267,"eval":970,"extension":971,"labo":970,"meta":1705,"navigation":978,"path":1269,"quizzes":1706,"readingTime":981,"seo":1707,"stem":1272,"tp":970,"__hash__":1273},[588],{"type":590,"value":1506,"toc":1698},[1507,1509,1515,1517,1541,1543,1587,1589,1625,1627],[593,1508,993],{"id":992},[598,1510,996,1511,1000,1513,1004],{},[602,1512,999],{},[602,1514,1003],{},[593,1516,1008],{"id":1007},[647,1518,1519,1523,1527,1533,1537],{},[650,1520,1521,1016],{},[602,1522,1015],{},[650,1524,1525,1022],{},[602,1526,1021],{},[650,1528,1025,1529,1028,1531,684],{},[602,1530,820],{},[602,1532,1031],{},[650,1534,1535,1037],{},[602,1536,1036],{},[650,1538,1539,1043],{},[602,1540,1042],{},[593,1542,1047],{"id":1046},[753,1544,1545,1553],{},[756,1546,1547],{},[759,1548,1549,1551],{},[762,1550,1056],{},[762,1552,1059],{},[769,1554,1555,1561,1567,1573,1581],{},[759,1556,1557,1559],{},[774,1558,1066],{},[774,1560,1069],{},[759,1562,1563,1565],{},[774,1564,1074],{},[774,1566,1069],{},[759,1568,1569,1571],{},[774,1570,1081],{},[774,1572,1069],{},[759,1574,1575,1577],{},[774,1576,1088],{},[774,1578,1579,1094],{},[602,1580,1093],{},[759,1582,1583,1585],{},[774,1584,1099],{},[774,1586,1093],{},[593,1588,1105],{"id":1104},[753,1590,1591,1599],{},[756,1592,1593],{},[759,1594,1595,1597],{},[762,1596,1114],{},[762,1598,1117],{},[769,1600,1601,1607,1613,1619],{},[759,1602,1603,1605],{},[774,1604,1124],{},[774,1606,1127],{},[759,1608,1609,1611],{},[774,1610,1132],{},[774,1612,1135],{},[759,1614,1615,1617],{},[774,1616,1140],{},[774,1618,1127],{},[759,1620,1621,1623],{},[774,1622,1147],{},[774,1624,1135],{},[593,1626,1153],{"id":1152},[647,1628,1629,1633,1635],{},[650,1630,1158,1631,1162],{},[602,1632,1161],{},[650,1634,1165],{},[650,1636,1168,1637,1259],{},[1170,1638,1640,1653],{"className":1639},[1173],[1170,1641,1643],{"className":1642},[1177],[1179,1644,1645],{"xmlns":1181},[1183,1646,1647,1651],{},[1186,1648,1649],{},[1189,1650,1192],{"mathvariant":1191},[1194,1652,1197],{"encoding":1196},[1170,1654,1656],{"className":1655,"ariaHidden":1202},[1201],[1170,1657,1659,1662],{"className":1658},[1206],[1170,1660],{"className":1661,"style":1211},[1210],[1170,1663,1665,1692,1695],{"className":1664},[1215],[1170,1666,1668],{"className":1667},[1215],[1170,1669,1671],{"className":1670},[1222,1223],[1170,1672,1674],{"className":1673},[1227],[1170,1675,1677,1680,1689],{"className":1676},[1231],[1170,1678],{"className":1679,"style":1211},[1210],[1170,1681,1683],{"className":1682},[1238],[1170,1684,1686],{"className":1685},[1222],[1170,1687,1245],{"className":1688},[1215],[1170,1690],{"className":1691},[1249],[1170,1693],{"className":1694},[1253,1254],[1170,1696,1258],{"className":1697},[1215],{"title":675,"searchDepth":960,"depth":960,"links":1699},[1700,1701,1702,1703,1704],{"id":992,"depth":960,"text":993},{"id":1007,"depth":960,"text":1008},{"id":1046,"depth":960,"text":1047},{"id":1104,"depth":960,"text":1105},{"id":1152,"depth":960,"text":1153},{},[],{"title":986,"description":1267},{"id":1275,"title":1276,"body":1709,"description":1497,"extension":971,"meta":1865,"navigation":978,"path":1499,"seo":1866,"stem":1501,"__hash__":1502},{"type":590,"value":1710,"toc":1863},[1711,1713,1717,1721,1723,1725,1739,1743,1745,1747,1761,1763,1765,1767,1769,1771,1773,1775,1777,1795,1797,1799,1817,1819,1821,1835,1839,1841,1843,1845,1847,1849,1851,1853],[1280,1712,33],{"id":1282},[598,1714,1285,1715,1289],{},[602,1716,1288],{},[598,1718,1292,1719],{},[633,1720],{"code":588},[1296,1722],{},[1280,1724,1015],{"id":1300},[647,1726,1727,1731,1735],{},[650,1728,1305,1729,1308],{},[602,1730,608],{},[650,1732,1311,1733,1315],{},[602,1734,1314],{},[650,1736,1318,1737,684],{},[602,1738,666],{},[598,1740,1323,1741,684],{},[602,1742,1326],{},[1296,1744],{},[1280,1746,1332],{"id":1331},[647,1748,1749,1753,1757],{},[650,1750,1751],{},[602,1752,1339],{},[650,1754,1342,1755,1345],{},[602,1756,702],{},[650,1758,1318,1759,684],{},[602,1760,1350],{},[598,1762,1353],{},[1296,1764],{},[1280,1766,1359],{"id":1358},[709,1768],{"alt":1362,"kind":712,"src":713,"svg":714},[598,1770,1365],{},[598,1772,1368],{},[1296,1774],{},[1280,1776,1374],{"id":1373},[647,1778,1779,1783,1787,1791],{},[650,1780,1781,1381],{},[602,1782,778],{},[650,1784,1785,1386],{},[602,1786,788],{},[650,1788,1789,684],{},[602,1790,798],{},[650,1792,1793,1396],{},[602,1794,1395],{},[1296,1796],{},[1280,1798,833],{"id":1401},[647,1800,1801,1805,1809,1813],{},[650,1802,1803,1408],{},[602,1804,840],{},[650,1806,1807,1414],{},[602,1808,1413],{},[650,1810,1811,1420],{},[602,1812,1419],{},[650,1814,1815,1425],{},[602,1816,858],{},[1296,1818],{},[1280,1820,863],{"id":1430},[647,1822,1823,1827,1831],{},[650,1824,1435,1825,684],{},[602,1826,1438],{},[650,1828,1441,1829,684],{},[602,1830,1444],{},[650,1832,1833,1450],{},[602,1834,1449],{},[598,1836,1453,1837,947],{},[602,1838,1456],{},[1296,1840],{},[1280,1842,1462],{"id":1461},[598,1844,1465],{},[598,1846,1468],{},[598,1848,1471],{},[1296,1850],{},[1280,1852,1477],{"id":1476},[598,1854,652,1855,1482,1857,1486,1859,1490,1861,1494],{},[602,1856,621],{},[602,1858,1485],{},[602,1860,1489],{},[602,1862,1493],{},{"title":675,"searchDepth":960,"depth":960,"links":1864},[],{},{"title":1276,"description":1497},1788035572522]