Block #527,239

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/5/2014, 9:35:39 PM · Difficulty 10.8844 · 6,297,717 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cf47ada85828bd0bc50f43c28af3692167d20c3acefbfd8b50c99c5069c00256

Height

#527,239

Difficulty

10.884401

Transactions

1

Size

835 B

Version

2

Bits

0ae2681b

Nonce

23,358

Timestamp

5/5/2014, 9:35:39 PM

Confirmations

6,297,717

Merkle Root

41ef559fd910c2ec8d20037989ec232bbb4b2f275ddad5612f1ef7abd86c0f88
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.

2.933 × 10⁹⁹(100-digit number)
29334310340475985681…31037100005921932479
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
2.933 × 10⁹⁹(100-digit number)
29334310340475985681…31037100005921932479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.866 × 10⁹⁹(100-digit number)
58668620680951971362…62074200011843864959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.173 × 10¹⁰⁰(101-digit number)
11733724136190394272…24148400023687729919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.346 × 10¹⁰⁰(101-digit number)
23467448272380788544…48296800047375459839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.693 × 10¹⁰⁰(101-digit number)
46934896544761577089…96593600094750919679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.386 × 10¹⁰⁰(101-digit number)
93869793089523154179…93187200189501839359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.877 × 10¹⁰¹(102-digit number)
18773958617904630835…86374400379003678719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.754 × 10¹⁰¹(102-digit number)
37547917235809261671…72748800758007357439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.509 × 10¹⁰¹(102-digit number)
75095834471618523343…45497601516014714879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.501 × 10¹⁰²(103-digit number)
15019166894323704668…90995203032029429759
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,843,727 XPM·at block #6,824,955 · 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