Block #2,472,688

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/14/2018, 12:48:19 PM · Difficulty 10.9629 · 4,370,613 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
44611dd076e3f485cf7606e1abbd8721153eee0be22c5d05afc896a710a1f6fc

Height

#2,472,688

Difficulty

10.962923

Transactions

20

Size

4.09 KB

Version

2

Bits

0af68219

Nonce

1,377,280,993

Timestamp

1/14/2018, 12:48:19 PM

Confirmations

4,370,613

Merkle Root

3a0a9b310fa777547691b6a1f7f3c928b7764f86019a8a7d28436fc48a7480eb
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.

3.516 × 10⁹²(93-digit number)
35164497343302726688…79515293713187328839
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
3.516 × 10⁹²(93-digit number)
35164497343302726688…79515293713187328839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.032 × 10⁹²(93-digit number)
70328994686605453376…59030587426374657679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.406 × 10⁹³(94-digit number)
14065798937321090675…18061174852749315359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.813 × 10⁹³(94-digit number)
28131597874642181350…36122349705498630719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.626 × 10⁹³(94-digit number)
56263195749284362701…72244699410997261439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.125 × 10⁹⁴(95-digit number)
11252639149856872540…44489398821994522879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.250 × 10⁹⁴(95-digit number)
22505278299713745080…88978797643989045759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.501 × 10⁹⁴(95-digit number)
45010556599427490160…77957595287978091519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.002 × 10⁹⁴(95-digit number)
90021113198854980321…55915190575956183039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.800 × 10⁹⁵(96-digit number)
18004222639770996064…11830381151912366079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.600 × 10⁹⁵(96-digit number)
36008445279541992128…23660762303824732159
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,990,773 XPM·at block #6,843,300 · 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