<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel>
    <title>DEV Community: Doit Follow</title>
    <description>The latest articles on DEV Community by Doit Follow (@jeitobr).</description>
    <link>https://dev.to/jeitobr</link>
    <image>
      <url>https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.us-east-2.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F4245131%2F1682074c-8239-468b-a45a-2083433b89eb.png</url>
      <title>DEV Community: Doit Follow</title>
      <link>https://dev.to/jeitobr</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://dev.to/feed/jeitobr"/>
    <language>en</language>
    <item>
      <title>Validar CPF e CNPJ em JavaScript: o módulo 11 explicado (e o CNPJ alfanumérico de 2026)</title>
      <dc:creator>Doit Follow</dc:creator>
      <pubDate>Sat, 14 Nov 2026 21:59:17 +0000</pubDate>
      <link>https://dev.to/jeitobr/validar-cpf-e-cnpj-em-javascript-o-modulo-11-explicado-e-o-cnpj-alfanumerico-de-2026-5282</link>
      <guid>https://dev.to/jeitobr/validar-cpf-e-cnpj-em-javascript-o-modulo-11-explicado-e-o-cnpj-alfanumerico-de-2026-5282</guid>
      <description>&lt;p&gt;Se você já montou um formulário de cadastro no Brasil, já precisou validar CPF e CNPJ no front-end antes de enviar os dados. A boa notícia: a regra é pública, determinística e cabe em poucas linhas de JavaScript — os dois documentos usam o &lt;strong&gt;módulo 11&lt;/strong&gt; para gerar os dígitos verificadores. Neste artigo eu explico a conta passo a passo, mostro a implementação e ainda cubro a mudança que chega em 2026: o &lt;strong&gt;CNPJ alfanumérico&lt;/strong&gt;.&lt;/p&gt;

&lt;h2&gt;
  
  
  CPF: 9 dígitos + 2 verificadores
&lt;/h2&gt;

&lt;p&gt;Um CPF tem 11 dígitos. Os 9 primeiros são a base; os 2 últimos são calculados assim:&lt;/p&gt;

&lt;ol&gt;
&lt;li&gt;
&lt;strong&gt;Primeiro verificador:&lt;/strong&gt; multiplique os 9 dígitos pelos pesos &lt;strong&gt;10, 9, 8 … 2&lt;/strong&gt;, some tudo e divida por 11. Se o resto for 0 ou 1, o dígito é &lt;strong&gt;0&lt;/strong&gt;; senão, é &lt;strong&gt;11 − resto&lt;/strong&gt;.&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Segundo verificador:&lt;/strong&gt; repita com os 10 primeiros dígitos (incluindo o verificador que você acabou de calcular) e os pesos &lt;strong&gt;11, 10, 9 … 2&lt;/strong&gt;, com a mesma regra.&lt;/li&gt;
&lt;/ol&gt;

&lt;p&gt;Exemplo real, com o CPF fictício &lt;strong&gt;111.444.777-35&lt;/strong&gt;:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;1×10 + 1×9 + 1×8 + 4×7 + 4×6 + 4×5 + 7×4 + 7×3 + 7×2 = &lt;strong&gt;162&lt;/strong&gt; → 162 ÷ 11 tem resto &lt;strong&gt;8&lt;/strong&gt; → dígito = 11 − 8 = &lt;strong&gt;3&lt;/strong&gt; ✓&lt;/li&gt;
&lt;li&gt;1×11 + 1×10 + 1×9 + 4×8 + 4×7 + 4×6 + 7×5 + 7×4 + 7×3 + 3×2 = &lt;strong&gt;204&lt;/strong&gt; → resto &lt;strong&gt;6&lt;/strong&gt; → dígito = 11 − 6 = &lt;strong&gt;5&lt;/strong&gt; ✓&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;Os dois dígitos conferem: o CPF é válido &lt;em&gt;pela regra matemática&lt;/em&gt;.&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight javascript"&gt;&lt;code&gt;&lt;span class="kd"&gt;function&lt;/span&gt; &lt;span class="nf"&gt;validarCPF&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;cpf&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
  &lt;span class="kd"&gt;const&lt;/span&gt; &lt;span class="n"&gt;d&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;cpf&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;replace&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="o"&gt;/&lt;/span&gt;\&lt;span class="no"&gt;D&lt;/span&gt;&lt;span class="o"&gt;/&lt;/span&gt;&lt;span class="n"&gt;g&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="s2"&gt;""&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
  &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;d&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="n"&gt;length&lt;/span&gt; &lt;span class="o"&gt;!==&lt;/span&gt; &lt;span class="mi"&gt;11&lt;/span&gt; &lt;span class="o"&gt;||&lt;/span&gt; &lt;span class="o"&gt;/^&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;\&lt;span class="n"&gt;d&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;\&lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;{&lt;/span&gt;&lt;span class="mi"&gt;10&lt;/span&gt;&lt;span class="p"&gt;}&lt;/span&gt;$&lt;span class="o"&gt;/&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;test&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;d&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="kc"&gt;false&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;

  &lt;span class="kd"&gt;const&lt;/span&gt; &lt;span class="n"&gt;digito&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;base&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;pesoInicial&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="o"&gt;=&amp;gt;&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
    &lt;span class="kd"&gt;let&lt;/span&gt; &lt;span class="n"&gt;soma&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
    &lt;span class="k"&gt;for&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="kd"&gt;let&lt;/span&gt; &lt;span class="n"&gt;i&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt; &lt;span class="n"&gt;i&lt;/span&gt; &lt;span class="o"&gt;&amp;lt;&lt;/span&gt; &lt;span class="n"&gt;base&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="n"&gt;length&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt; &lt;span class="n"&gt;i&lt;/span&gt;&lt;span class="o"&gt;++&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="n"&gt;soma&lt;/span&gt; &lt;span class="o"&gt;+=&lt;/span&gt; &lt;span class="nb"&gt;Number&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;base&lt;/span&gt;&lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="n"&gt;i&lt;/span&gt;&lt;span class="p"&gt;]&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="o"&gt;*&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;pesoInicial&lt;/span&gt; &lt;span class="o"&gt;-&lt;/span&gt; &lt;span class="n"&gt;i&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
    &lt;span class="kd"&gt;const&lt;/span&gt; &lt;span class="n"&gt;resto&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;soma&lt;/span&gt; &lt;span class="o"&gt;*&lt;/span&gt; &lt;span class="mi"&gt;10&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="o"&gt;%&lt;/span&gt; &lt;span class="mi"&gt;11&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
    &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="n"&gt;resto&lt;/span&gt; &lt;span class="o"&gt;===&lt;/span&gt; &lt;span class="mi"&gt;10&lt;/span&gt; &lt;span class="o"&gt;||&lt;/span&gt; &lt;span class="n"&gt;resto&lt;/span&gt; &lt;span class="o"&gt;===&lt;/span&gt; &lt;span class="mi"&gt;11&lt;/span&gt; &lt;span class="o"&gt;?&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt; &lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="n"&gt;resto&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
  &lt;span class="p"&gt;}&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;

  &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="nf"&gt;digito&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;d&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;slice&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;9&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;10&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="o"&gt;===&lt;/span&gt; &lt;span class="nb"&gt;Number&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;d&lt;/span&gt;&lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="mi"&gt;9&lt;/span&gt;&lt;span class="p"&gt;]&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="o"&gt;&amp;amp;&amp;amp;&lt;/span&gt;
         &lt;span class="nf"&gt;digito&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;d&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;slice&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;10&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;11&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="o"&gt;===&lt;/span&gt; &lt;span class="nb"&gt;Number&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;d&lt;/span&gt;&lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="mi"&gt;10&lt;/span&gt;&lt;span class="p"&gt;]&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
&lt;span class="p"&gt;}&lt;/span&gt;

&lt;span class="nf"&gt;validarCPF&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="s2"&gt;"111.444.777-35"&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt; &lt;span class="c1"&gt;// true&lt;/span&gt;
&lt;span class="nf"&gt;validarCPF&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="s2"&gt;"111.444.777-34"&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt; &lt;span class="c1"&gt;// false — trocou um dígito, quebrou a conta&lt;/span&gt;
&lt;span class="nf"&gt;validarCPF&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="s2"&gt;"111.111.111-11"&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt; &lt;span class="c1"&gt;// false — sequência repetida (ver abaixo)&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;h2&gt;
  
  
  A pegadinha: dígitos repetidos "passam" na conta
&lt;/h2&gt;

&lt;p&gt;Sequências como &lt;code&gt;111.111.111-11&lt;/code&gt; e &lt;code&gt;000.000.000-00&lt;/code&gt; satisfazem o módulo 11, mas nenhum CPF real é assim — por isso a validação precisa rejeitá-las explicitamente (é o regex &lt;code&gt;/^(\d)\1{10}$/&lt;/code&gt; no código acima). Esquecer esse passo é o erro mais comum que vejo em implementações por aí.&lt;/p&gt;

&lt;h2&gt;
  
  
  CNPJ: os pesos "andam" de 2 a 9
&lt;/h2&gt;

&lt;p&gt;O CNPJ tem 14 dígitos (12 de base + 2 verificadores). A lógica é a mesma, mas os pesos &lt;strong&gt;não&lt;/strong&gt; descem de 13 e 12: eles ciclam de &lt;strong&gt;2 a 9&lt;/strong&gt;, da direita para a esquerda. Para o primeiro verificador, os pesos sobre os 12 dígitos são &lt;code&gt;5 4 3 2 9 8 7 6 5 4 3 2&lt;/code&gt;; para o segundo, sobre 13 dígitos, &lt;code&gt;6 5 4 3 2 9 8 7 6 5 4 3 2&lt;/code&gt;. A regra do resto muda um pouco: se &lt;code&gt;soma % 11 &amp;lt; 2&lt;/code&gt;, o dígito é 0; senão, é &lt;code&gt;11 − (soma % 11)&lt;/code&gt;.&lt;/p&gt;

&lt;h2&gt;
  
  
  2026: o CNPJ alfanumérico
&lt;/h2&gt;

&lt;p&gt;A partir de &lt;strong&gt;julho de 2026&lt;/strong&gt;, novos CNPJs poderão ter &lt;strong&gt;letras&lt;/strong&gt; nas 12 primeiras posições (os 2 verificadores continuam numéricos). A validação quase não muda: cada caractere vira um valor numérico pelo &lt;strong&gt;código ASCII menos 48&lt;/strong&gt; — dígitos valem o próprio valor (&lt;code&gt;0&lt;/code&gt;–&lt;code&gt;9&lt;/code&gt;) e letras valem de 17 em diante (&lt;code&gt;A&lt;/code&gt; = 65 − 48 = 17, &lt;code&gt;B&lt;/code&gt; = 18, …). Depois disso, é o mesmo módulo 11 com os mesmos pesos.&lt;/p&gt;

&lt;p&gt;Exemplo calculado com essa regra: a base &lt;strong&gt;12.ABC.345/01DE&lt;/strong&gt; vira os valores &lt;code&gt;1, 2, 17, 18, 19, 3, 4, 5, 0, 1, 20, 21&lt;/code&gt;, e os verificadores resultantes são &lt;strong&gt;3&lt;/strong&gt; e &lt;strong&gt;5&lt;/strong&gt; — ou seja, o CNPJ completo &lt;strong&gt;12.ABC.345/01DE-35&lt;/strong&gt; é válido pela nova regra. Se o seu sistema valida CNPJ, vale adaptar o código agora: basta trocar o &lt;code&gt;Number(d[i])&lt;/code&gt; por &lt;code&gt;d.charCodeAt(i) - 48&lt;/code&gt; e parar de rejeitar letras na máscara.&lt;/p&gt;

&lt;h2&gt;
  
  
  Validar não é consultar
&lt;/h2&gt;

&lt;p&gt;Um último cuidado, que confunde muita gente: passar no módulo 11 só prova que o número &lt;strong&gt;respeita a regra matemática&lt;/strong&gt;. Não prova que o documento existe, pertence a alguém ou está regular na Receita Federal — isso só a consulta oficial confirma. Validação client-side serve para pegar erro de digitação cedo e melhorar a experiência do formulário; situação cadastral é outra camada.&lt;/p&gt;




&lt;p&gt;Quer testar sem escrever código? No &lt;a href="https://jeitobr.com/" rel="noopener noreferrer"&gt;JeitoBR&lt;/a&gt; — um site de ferramentas gratuitas que eu mantenho — o &lt;a href="https://jeitobr.com/validador-de-cpf/" rel="noopener noreferrer"&gt;validador de CPF&lt;/a&gt; e o &lt;a href="https://jeitobr.com/validador-e-consulta-de-cnpj/" rel="noopener noreferrer"&gt;validador e consulta de CNPJ&lt;/a&gt; rodam 100% no navegador, com a mesma lógica deste artigo (o de CNPJ já consulta a situação na Receita). Se você encontrar algum caso em que a sua implementação discorda da minha, me conta nos comentários — adoro um edge case novo.&lt;/p&gt;

</description>
      <category>javascript</category>
      <category>webdev</category>
      <category>brasil</category>
      <category>tutorial</category>
    </item>
  </channel>
</rss>
