Block #472,885

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/3/2014, 1:19:18 PM · Difficulty 10.4420 · 6,368,316 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
83aa83cd3f0aa05972732a6f40ba1df874b1e863e220b4c766924a6502b8e064

Height

#472,885

Difficulty

10.442012

Transactions

1

Size

970 B

Version

2

Bits

0a7127ae

Nonce

5,597

Timestamp

4/3/2014, 1:19:18 PM

Confirmations

6,368,316

Merkle Root

1eba6d80d2a770f69eda91dfd8cb8f2a78958dbe34c7d5ec18955d8579589a14
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.545 × 10⁹⁶(97-digit number)
15452542114966903423…28958506493065840279
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.545 × 10⁹⁶(97-digit number)
15452542114966903423…28958506493065840279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.090 × 10⁹⁶(97-digit number)
30905084229933806847…57917012986131680559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.181 × 10⁹⁶(97-digit number)
61810168459867613694…15834025972263361119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.236 × 10⁹⁷(98-digit number)
12362033691973522738…31668051944526722239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.472 × 10⁹⁷(98-digit number)
24724067383947045477…63336103889053444479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.944 × 10⁹⁷(98-digit number)
49448134767894090955…26672207778106888959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.889 × 10⁹⁷(98-digit number)
98896269535788181910…53344415556213777919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.977 × 10⁹⁸(99-digit number)
19779253907157636382…06688831112427555839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.955 × 10⁹⁸(99-digit number)
39558507814315272764…13377662224855111679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.911 × 10⁹⁸(99-digit number)
79117015628630545528…26755324449710223359
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,973,969 XPM·at block #6,841,200 · 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