Block #1,409,476

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/12/2016, 12:39:11 AM · Difficulty 10.8062 · 5,405,376 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
57c73528d64f1b6096b3c0a8d6bdde1cf427b41874ed4349e539b9e1bbf0be68

Height

#1,409,476

Difficulty

10.806171

Transactions

54

Size

18.72 KB

Version

2

Bits

0ace613a

Nonce

108,839,610

Timestamp

1/12/2016, 12:39:11 AM

Confirmations

5,405,376

Merkle Root

d6a322797a9890fd4823433e3dfe559cc98899ade424a683b4b563e1b0fa8880
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.157 × 10⁹⁷(98-digit number)
11579291878885201222…22473219086101084159
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.157 × 10⁹⁷(98-digit number)
11579291878885201222…22473219086101084159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.315 × 10⁹⁷(98-digit number)
23158583757770402445…44946438172202168319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.631 × 10⁹⁷(98-digit number)
46317167515540804891…89892876344404336639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.263 × 10⁹⁷(98-digit number)
92634335031081609782…79785752688808673279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.852 × 10⁹⁸(99-digit number)
18526867006216321956…59571505377617346559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.705 × 10⁹⁸(99-digit number)
37053734012432643912…19143010755234693119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.410 × 10⁹⁸(99-digit number)
74107468024865287825…38286021510469386239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.482 × 10⁹⁹(100-digit number)
14821493604973057565…76572043020938772479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.964 × 10⁹⁹(100-digit number)
29642987209946115130…53144086041877544959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.928 × 10⁹⁹(100-digit number)
59285974419892230260…06288172083755089919
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,762,899 XPM·at block #6,814,851 · 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