Block #2,180,564

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/27/2017, 6:46:05 AM · Difficulty 10.9325 · 4,660,589 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
efd333e4317900083582ebe7ea68ba04f67833b92d3c49d8e4655b332fcf8f61

Height

#2,180,564

Difficulty

10.932477

Transactions

2

Size

1.03 KB

Version

2

Bits

0aeeb6d5

Nonce

207,901,997

Timestamp

6/27/2017, 6:46:05 AM

Confirmations

4,660,589

Merkle Root

de55d29d0b23351b1ce02903e93e280015e89435f9e12fd74108d5cb84e82903
Transactions (2)
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.

1.694 × 10⁹³(94-digit number)
16943355454374070879…82070629743215621119
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
1.694 × 10⁹³(94-digit number)
16943355454374070879…82070629743215621119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.388 × 10⁹³(94-digit number)
33886710908748141758…64141259486431242239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.777 × 10⁹³(94-digit number)
67773421817496283516…28282518972862484479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.355 × 10⁹⁴(95-digit number)
13554684363499256703…56565037945724968959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.710 × 10⁹⁴(95-digit number)
27109368726998513406…13130075891449937919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.421 × 10⁹⁴(95-digit number)
54218737453997026813…26260151782899875839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.084 × 10⁹⁵(96-digit number)
10843747490799405362…52520303565799751679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.168 × 10⁹⁵(96-digit number)
21687494981598810725…05040607131599503359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.337 × 10⁹⁵(96-digit number)
43374989963197621450…10081214263199006719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.674 × 10⁹⁵(96-digit number)
86749979926395242901…20162428526398013439
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,973,587 XPM·at block #6,841,152 · 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