Block #533,034

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/9/2014, 11:09:31 AM · Difficulty 10.8988 · 6,293,803 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5845b7a12f36a94a85e33ba706709c54d945d9433a51daf139e7ca11ffaec92e

Height

#533,034

Difficulty

10.898829

Transactions

1

Size

765 B

Version

2

Bits

0ae619a2

Nonce

92,940

Timestamp

5/9/2014, 11:09:31 AM

Confirmations

6,293,803

Merkle Root

6105540a6ddeff9e06b797c1cc4141ae891792a947b4406d60f364519b838cbd
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.848 × 10⁹⁴(95-digit number)
18489395174499181853…19327794293003198959
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.848 × 10⁹⁴(95-digit number)
18489395174499181853…19327794293003198959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.697 × 10⁹⁴(95-digit number)
36978790348998363706…38655588586006397919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.395 × 10⁹⁴(95-digit number)
73957580697996727412…77311177172012795839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.479 × 10⁹⁵(96-digit number)
14791516139599345482…54622354344025591679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.958 × 10⁹⁵(96-digit number)
29583032279198690965…09244708688051183359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.916 × 10⁹⁵(96-digit number)
59166064558397381930…18489417376102366719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.183 × 10⁹⁶(97-digit number)
11833212911679476386…36978834752204733439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.366 × 10⁹⁶(97-digit number)
23666425823358952772…73957669504409466879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.733 × 10⁹⁶(97-digit number)
47332851646717905544…47915339008818933759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.466 × 10⁹⁶(97-digit number)
94665703293435811088…95830678017637867519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.893 × 10⁹⁷(98-digit number)
18933140658687162217…91661356035275735039
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,858,863 XPM·at block #6,826,836 · 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