Block #2,668,473

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/19/2018, 1:59:01 PM · Difficulty 11.6767 · 4,163,230 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3a139238b5be9fed642ade163d5bd2ebba6b443bc325fa99389d4bb2af0bdfec

Height

#2,668,473

Difficulty

11.676713

Transactions

2

Size

426 B

Version

2

Bits

0bad3d08

Nonce

641,720,519

Timestamp

5/19/2018, 1:59:01 PM

Confirmations

4,163,230

Merkle Root

58ead0770e227a54423be3079e375627ced7653d139515dcc99dfb708549d94c
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.592 × 10⁹²(93-digit number)
15921558623903383004…57633712281971989919
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.592 × 10⁹²(93-digit number)
15921558623903383004…57633712281971989919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.184 × 10⁹²(93-digit number)
31843117247806766008…15267424563943979839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.368 × 10⁹²(93-digit number)
63686234495613532017…30534849127887959679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.273 × 10⁹³(94-digit number)
12737246899122706403…61069698255775919359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.547 × 10⁹³(94-digit number)
25474493798245412807…22139396511551838719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.094 × 10⁹³(94-digit number)
50948987596490825614…44278793023103677439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.018 × 10⁹⁴(95-digit number)
10189797519298165122…88557586046207354879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.037 × 10⁹⁴(95-digit number)
20379595038596330245…77115172092414709759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.075 × 10⁹⁴(95-digit number)
40759190077192660491…54230344184829419519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.151 × 10⁹⁴(95-digit number)
81518380154385320982…08460688369658839039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.630 × 10⁹⁵(96-digit number)
16303676030877064196…16921376739317678079
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,897,733 XPM·at block #6,831,702 · 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