Block #585,569

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/12/2014, 8:35:39 AM · Difficulty 10.9537 · 6,239,068 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a0f59b42cba82859ae206a2717549648fed436a9c29424b4d91fc2982eae2a83

Height

#585,569

Difficulty

10.953672

Transactions

11

Size

22.68 KB

Version

2

Bits

0af423db

Nonce

1,169,684,169

Timestamp

6/12/2014, 8:35:39 AM

Confirmations

6,239,068

Merkle Root

52173db59a14dc2669493a165d7b75f8a0fe75fe50e10f93694540715db0b509
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.

6.090 × 10⁹⁸(99-digit number)
60906854712517509719…19951540631381276161
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
6.090 × 10⁹⁸(99-digit number)
60906854712517509719…19951540631381276161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.218 × 10⁹⁹(100-digit number)
12181370942503501943…39903081262762552321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.436 × 10⁹⁹(100-digit number)
24362741885007003887…79806162525525104641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.872 × 10⁹⁹(100-digit number)
48725483770014007775…59612325051050209281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.745 × 10⁹⁹(100-digit number)
97450967540028015550…19224650102100418561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.949 × 10¹⁰⁰(101-digit number)
19490193508005603110…38449300204200837121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.898 × 10¹⁰⁰(101-digit number)
38980387016011206220…76898600408401674241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.796 × 10¹⁰⁰(101-digit number)
77960774032022412440…53797200816803348481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.559 × 10¹⁰¹(102-digit number)
15592154806404482488…07594401633606696961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.118 × 10¹⁰¹(102-digit number)
31184309612808964976…15188803267213393921
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 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
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 2CC formula:

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