Block #658,097

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/1/2014, 4:35:05 PM · Difficulty 10.9562 · 6,156,072 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1a1b370448d39eb865ec11e86adeb17ecefe3d222fe5459350fc94e81e87c6c1

Height

#658,097

Difficulty

10.956236

Transactions

2

Size

432 B

Version

2

Bits

0af4cbdf

Nonce

25,809,099

Timestamp

8/1/2014, 4:35:05 PM

Confirmations

6,156,072

Merkle Root

26c82d300f8320c5e165a5d9a6b04656e5d5a1d344ab5b65ee322d570064744b
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.438 × 10⁹⁶(97-digit number)
74381019581129617253…79306216498452613121
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.438 × 10⁹⁶(97-digit number)
74381019581129617253…79306216498452613121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.487 × 10⁹⁷(98-digit number)
14876203916225923450…58612432996905226241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.975 × 10⁹⁷(98-digit number)
29752407832451846901…17224865993810452481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.950 × 10⁹⁷(98-digit number)
59504815664903693803…34449731987620904961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.190 × 10⁹⁸(99-digit number)
11900963132980738760…68899463975241809921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.380 × 10⁹⁸(99-digit number)
23801926265961477521…37798927950483619841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.760 × 10⁹⁸(99-digit number)
47603852531922955042…75597855900967239681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.520 × 10⁹⁸(99-digit number)
95207705063845910085…51195711801934479361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.904 × 10⁹⁹(100-digit number)
19041541012769182017…02391423603868958721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.808 × 10⁹⁹(100-digit number)
38083082025538364034…04782847207737917441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.616 × 10⁹⁹(100-digit number)
76166164051076728068…09565694415475834881
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,757,422 XPM·at block #6,814,168 · 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