Block #572,596

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/2/2014, 5:02:59 AM · Difficulty 10.9661 · 6,242,353 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f5434c60c8a54cb67e39bddb8eabf80a43609a5c9063a2d14a4fb5fb9aadf9a3

Height

#572,596

Difficulty

10.966149

Transactions

7

Size

1.96 KB

Version

2

Bits

0af7558b

Nonce

1,530,125,489

Timestamp

6/2/2014, 5:02:59 AM

Confirmations

6,242,353

Merkle Root

e795f20f64e036bbc7ccf9c1fa2e9afd451f6e7e18e3a95a69ae7b8dc2891f1f
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.971 × 10⁹⁹(100-digit number)
39715862286002079585…73733579713640898559
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.971 × 10⁹⁹(100-digit number)
39715862286002079585…73733579713640898559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.943 × 10⁹⁹(100-digit number)
79431724572004159170…47467159427281797119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.588 × 10¹⁰⁰(101-digit number)
15886344914400831834…94934318854563594239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.177 × 10¹⁰⁰(101-digit number)
31772689828801663668…89868637709127188479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.354 × 10¹⁰⁰(101-digit number)
63545379657603327336…79737275418254376959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.270 × 10¹⁰¹(102-digit number)
12709075931520665467…59474550836508753919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.541 × 10¹⁰¹(102-digit number)
25418151863041330934…18949101673017507839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.083 × 10¹⁰¹(102-digit number)
50836303726082661869…37898203346035015679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.016 × 10¹⁰²(103-digit number)
10167260745216532373…75796406692070031359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.033 × 10¹⁰²(103-digit number)
20334521490433064747…51592813384140062719
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,763,689 XPM·at block #6,814,948 · 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