Block #566,458

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/28/2014, 10:37:43 PM · Difficulty 10.9660 · 6,249,601 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e7a2e410579f58e8012438174ad1266bcc10efef85d865719386cfe1849d45d7

Height

#566,458

Difficulty

10.965995

Transactions

5

Size

1.37 KB

Version

2

Bits

0af74b70

Nonce

660,608,305

Timestamp

5/28/2014, 10:37:43 PM

Confirmations

6,249,601

Merkle Root

82957f496b645589230a90804f535644b98413958c5969f026c87b4b1d6991eb
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.663 × 10⁹⁹(100-digit number)
36634810907280394710…75740909871785246719
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.663 × 10⁹⁹(100-digit number)
36634810907280394710…75740909871785246719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.326 × 10⁹⁹(100-digit number)
73269621814560789421…51481819743570493439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.465 × 10¹⁰⁰(101-digit number)
14653924362912157884…02963639487140986879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.930 × 10¹⁰⁰(101-digit number)
29307848725824315768…05927278974281973759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.861 × 10¹⁰⁰(101-digit number)
58615697451648631537…11854557948563947519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.172 × 10¹⁰¹(102-digit number)
11723139490329726307…23709115897127895039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.344 × 10¹⁰¹(102-digit number)
23446278980659452615…47418231794255790079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.689 × 10¹⁰¹(102-digit number)
46892557961318905230…94836463588511580159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.378 × 10¹⁰¹(102-digit number)
93785115922637810460…89672927177023160319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.875 × 10¹⁰²(103-digit number)
18757023184527562092…79345854354046320639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.751 × 10¹⁰²(103-digit number)
37514046369055124184…58691708708092641279
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,772,588 XPM·at block #6,816,058 · 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