Block #571,511

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/1/2014, 12:58:23 PM · Difficulty 10.9653 · 6,245,337 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3b48620b1a57a9f0b7c7ca4bdc759be4ce3018b28726d5d6c512c4c2b841213c

Height

#571,511

Difficulty

10.965289

Transactions

4

Size

884 B

Version

2

Bits

0af71d26

Nonce

78,237,427

Timestamp

6/1/2014, 12:58:23 PM

Confirmations

6,245,337

Merkle Root

fb67681c5c587df72c76519e445564b7ca09a2e986c3d068eabef5083dd9a1ce
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.

1.496 × 10⁹⁷(98-digit number)
14965190004340982636…00975246970211038659
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
1.496 × 10⁹⁷(98-digit number)
14965190004340982636…00975246970211038659
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.993 × 10⁹⁷(98-digit number)
29930380008681965273…01950493940422077319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.986 × 10⁹⁷(98-digit number)
59860760017363930547…03900987880844154639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.197 × 10⁹⁸(99-digit number)
11972152003472786109…07801975761688309279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.394 × 10⁹⁸(99-digit number)
23944304006945572218…15603951523376618559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.788 × 10⁹⁸(99-digit number)
47888608013891144437…31207903046753237119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.577 × 10⁹⁸(99-digit number)
95777216027782288875…62415806093506474239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.915 × 10⁹⁹(100-digit number)
19155443205556457775…24831612187012948479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.831 × 10⁹⁹(100-digit number)
38310886411112915550…49663224374025896959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.662 × 10⁹⁹(100-digit number)
76621772822225831100…99326448748051793919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.532 × 10¹⁰⁰(101-digit number)
15324354564445166220…98652897496103587839
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,778,826 XPM·at block #6,816,847 · 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