Block #2,216,302

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/21/2017, 1:43:39 PM · Difficulty 10.9431 · 4,628,868 confirmations

1CC
Cunningham Chain of the First Kind

A sequence where each prime is double the previous prime plus one.

Block Header
Block Hash
a3e967d5a5bcbe102fb20ee0c5f460d7dce15c63ae8cb93c98c89c9f53e5b76a

Height

#2,216,302

Difficulty

10.943140

Transactions

17

Size

5.48 KB

Version

2

Bits

0af17199

Nonce

807,433,608

Timestamp

7/21/2017, 1:43:39 PM

Confirmations

4,628,868

Merkle Root

1b4606bfda2f7765feb7d4ea9e4a4ce7c8db10af5ec932f14b686710d3a17ee9
Prime Chain Origin

This is the prime chain origin stored in the block header. It is a composite number (not prime itself) — it equals the first prime in the chain multiplied by a primorial. The origin anchors the entire chain to this specific block.

2.743 × 10⁹⁴(95-digit number)
27437005711989915890…17525195860487504639
Discovered Prime Numbers
p_k = 2^k × origin − 1

These are the actual prime numbers discovered by this block, computed using the verified Primecoin formula. Each number has been independently confirmed to pass the Fermat primality test. Use the FactorDB links to verify any number independently.

1
origin − 1
2.743 × 10⁹⁴(95-digit number)
27437005711989915890…17525195860487504639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.487 × 10⁹⁴(95-digit number)
54874011423979831780…35050391720975009279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.097 × 10⁹⁵(96-digit number)
10974802284795966356…70100783441950018559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.194 × 10⁹⁵(96-digit number)
21949604569591932712…40201566883900037119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.389 × 10⁹⁵(96-digit number)
43899209139183865424…80403133767800074239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.779 × 10⁹⁵(96-digit number)
87798418278367730849…60806267535600148479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.755 × 10⁹⁶(97-digit number)
17559683655673546169…21612535071200296959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.511 × 10⁹⁶(97-digit number)
35119367311347092339…43225070142400593919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.023 × 10⁹⁶(97-digit number)
70238734622694184679…86450140284801187839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.404 × 10⁹⁷(98-digit number)
14047746924538836935…72900280569602375679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.809 × 10⁹⁷(98-digit number)
28095493849077673871…45800561139204751359
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 consecutive prime numbers forming a Cunningham Chain of the First Kind. The prime chain origin — the large number shown above — anchors the chain and is divisible by a primorial (the product of small primes), cryptographically tying these prime numbers to this specific block.

★★★☆☆
Rarity
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

How Primecoin's Proof-of-Work Constructs These Primes

Primecoin stores a value called the prime chain origin in each block. The miner found a large integer such that when divided by a primorial (the product of small primes: 2 × 3 × 5 × 7 × …), the result is the first prime in the chain. The origin is deliberately divisible by this primorial — that divisibility is part of the proof.

Prime Chain Origin = First Prime × Primorial (2·3·5·7·11·…)
Source: Primecoin prime.cpp — CheckPrimeProofOfWork()

This is why the origin has many small prime factors — those factors are the primorial divisor. The chain then extends from the first prime using the 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:58,005,791 XPM·at block #6,845,169 · updates every 60s
xpmprime.info is a work in progress. If you enjoy using this service you can support this project with a Primecoin donation.
Privacy Policy·

Cookie Preferences

We use cookies to enhance your experience. Some are essential for the site to function, while others help us understand how you use the site.

·Privacy Policy