Block #492,536

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/15/2014, 5:10:41 AM · Difficulty 10.6879 · 6,314,315 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ce1814158b1add65c81b1dff52a06ccf26248bd3f99d0a16bf06b74adce524c2

Height

#492,536

Difficulty

10.687893

Transactions

10

Size

31.97 KB

Version

2

Bits

0ab019c4

Nonce

538,451,156

Timestamp

4/15/2014, 5:10:41 AM

Confirmations

6,314,315

Merkle Root

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

4.732 × 10⁹⁹(100-digit number)
47321741332482592529…20025286326366207999
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
4.732 × 10⁹⁹(100-digit number)
47321741332482592529…20025286326366207999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.464 × 10⁹⁹(100-digit number)
94643482664965185059…40050572652732415999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.892 × 10¹⁰⁰(101-digit number)
18928696532993037011…80101145305464831999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.785 × 10¹⁰⁰(101-digit number)
37857393065986074023…60202290610929663999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.571 × 10¹⁰⁰(101-digit number)
75714786131972148047…20404581221859327999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.514 × 10¹⁰¹(102-digit number)
15142957226394429609…40809162443718655999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.028 × 10¹⁰¹(102-digit number)
30285914452788859219…81618324887437311999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.057 × 10¹⁰¹(102-digit number)
60571828905577718438…63236649774874623999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.211 × 10¹⁰²(103-digit number)
12114365781115543687…26473299549749247999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.422 × 10¹⁰²(103-digit number)
24228731562231087375…52946599099498495999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.845 × 10¹⁰²(103-digit number)
48457463124462174750…05893198198996991999
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,698,913 XPM·at block #6,806,850 · 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