Block #561,299

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/25/2014, 11:14:35 AM · Difficulty 10.9648 · 6,256,071 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b1f0c33120b9888e355af6dbf1c0a80f47b4f371ea639826994facbba6946cfb

Height

#561,299

Difficulty

10.964770

Transactions

7

Size

3.26 KB

Version

2

Bits

0af6fb24

Nonce

93,226

Timestamp

5/25/2014, 11:14:35 AM

Confirmations

6,256,071

Merkle Root

212d109f597996de170b353fc7d807ef2ac2a8109e18cd459e971c4ba4604553
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.

4.715 × 10⁹⁶(97-digit number)
47151166349742922224…48106417120961003039
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
4.715 × 10⁹⁶(97-digit number)
47151166349742922224…48106417120961003039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.430 × 10⁹⁶(97-digit number)
94302332699485844448…96212834241922006079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.886 × 10⁹⁷(98-digit number)
18860466539897168889…92425668483844012159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.772 × 10⁹⁷(98-digit number)
37720933079794337779…84851336967688024319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.544 × 10⁹⁷(98-digit number)
75441866159588675559…69702673935376048639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.508 × 10⁹⁸(99-digit number)
15088373231917735111…39405347870752097279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.017 × 10⁹⁸(99-digit number)
30176746463835470223…78810695741504194559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.035 × 10⁹⁸(99-digit number)
60353492927670940447…57621391483008389119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.207 × 10⁹⁹(100-digit number)
12070698585534188089…15242782966016778239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.414 × 10⁹⁹(100-digit number)
24141397171068376178…30485565932033556479
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 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
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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,783,000 XPM·at block #6,817,369 · 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