Block #2,772,565

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/31/2018, 1:24:43 AM · Difficulty 11.6623 · 4,069,812 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
aa9bad8243150b3c64529a11dbef485411dd1fbd14945e161a387eebe7210095

Height

#2,772,565

Difficulty

11.662309

Transactions

32

Size

9.20 KB

Version

2

Bits

0ba98d0d

Nonce

140,373,931

Timestamp

7/31/2018, 1:24:43 AM

Confirmations

4,069,812

Merkle Root

49c42c0f64a01114c65d88b95a01b9bce65209f174b110f71db59616024e8b63
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.

7.171 × 10⁹⁵(96-digit number)
71717439895623571003…68717879396273497599
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
7.171 × 10⁹⁵(96-digit number)
71717439895623571003…68717879396273497599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.434 × 10⁹⁶(97-digit number)
14343487979124714200…37435758792546995199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.868 × 10⁹⁶(97-digit number)
28686975958249428401…74871517585093990399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.737 × 10⁹⁶(97-digit number)
57373951916498856802…49743035170187980799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.147 × 10⁹⁷(98-digit number)
11474790383299771360…99486070340375961599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.294 × 10⁹⁷(98-digit number)
22949580766599542721…98972140680751923199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.589 × 10⁹⁷(98-digit number)
45899161533199085442…97944281361503846399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.179 × 10⁹⁷(98-digit number)
91798323066398170884…95888562723007692799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.835 × 10⁹⁸(99-digit number)
18359664613279634176…91777125446015385599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.671 × 10⁹⁸(99-digit number)
36719329226559268353…83554250892030771199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.343 × 10⁹⁸(99-digit number)
73438658453118536707…67108501784061542399
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:57,983,425 XPM·at block #6,842,376 · 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