Block #589,949

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/15/2014, 9:40:20 PM · Difficulty 10.9467 · 6,220,700 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
56f47c121f2bddc08b8273183744e228db580f1d47361a7f08ed1c073ed513f3

Height

#589,949

Difficulty

10.946659

Transactions

6

Size

1.31 KB

Version

2

Bits

0af2583d

Nonce

156,696,733

Timestamp

6/15/2014, 9:40:20 PM

Confirmations

6,220,700

Merkle Root

44b1cc11c5c84b156068278f964dc2cc62841c608e36b77423fe31c232f93dde
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.995 × 10⁹⁶(97-digit number)
69956141657332472993…85296027410408472059
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.995 × 10⁹⁶(97-digit number)
69956141657332472993…85296027410408472059
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.399 × 10⁹⁷(98-digit number)
13991228331466494598…70592054820816944119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.798 × 10⁹⁷(98-digit number)
27982456662932989197…41184109641633888239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.596 × 10⁹⁷(98-digit number)
55964913325865978394…82368219283267776479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.119 × 10⁹⁸(99-digit number)
11192982665173195678…64736438566535552959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.238 × 10⁹⁸(99-digit number)
22385965330346391357…29472877133071105919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.477 × 10⁹⁸(99-digit number)
44771930660692782715…58945754266142211839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.954 × 10⁹⁸(99-digit number)
89543861321385565431…17891508532284423679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.790 × 10⁹⁹(100-digit number)
17908772264277113086…35783017064568847359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.581 × 10⁹⁹(100-digit number)
35817544528554226172…71566034129137694719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.163 × 10⁹⁹(100-digit number)
71635089057108452345…43132068258275389439
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,729,281 XPM·at block #6,810,648 · 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.

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