Block #672,063

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/10/2014, 4:39:26 PM · Difficulty 10.9645 · 6,166,757 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6a9b6f9fb982fe20651e62b011edc19c68fb10f1010f04b097d8de27c36fc67f

Height

#672,063

Difficulty

10.964510

Transactions

9

Size

16.17 KB

Version

2

Bits

0af6ea22

Nonce

376,699,294

Timestamp

8/10/2014, 4:39:26 PM

Confirmations

6,166,757

Merkle Root

cdd85c3691e56fef97942273411b014ba8a0a60d50b85d8ab9bcde9241ca6771
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.082 × 10⁹⁵(96-digit number)
10822311486242341602…92473153708375011539
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.082 × 10⁹⁵(96-digit number)
10822311486242341602…92473153708375011539
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.164 × 10⁹⁵(96-digit number)
21644622972484683204…84946307416750023079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.328 × 10⁹⁵(96-digit number)
43289245944969366408…69892614833500046159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.657 × 10⁹⁵(96-digit number)
86578491889938732817…39785229667000092319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.731 × 10⁹⁶(97-digit number)
17315698377987746563…79570459334000184639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.463 × 10⁹⁶(97-digit number)
34631396755975493126…59140918668000369279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.926 × 10⁹⁶(97-digit number)
69262793511950986253…18281837336000738559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.385 × 10⁹⁷(98-digit number)
13852558702390197250…36563674672001477119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.770 × 10⁹⁷(98-digit number)
27705117404780394501…73127349344002954239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.541 × 10⁹⁷(98-digit number)
55410234809560789003…46254698688005908479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.108 × 10⁹⁸(99-digit number)
11082046961912157800…92509397376011816959
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,954,825 XPM·at block #6,838,819 · 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