Block #1,429,315

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/26/2016, 8:11:08 PM · Difficulty 10.7400 · 5,407,258 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
73c83dcf5d55966bf3a422530e4be275deaa8233e6c9bd9e26a7b3cfd9921339

Height

#1,429,315

Difficulty

10.739993

Transactions

2

Size

427 B

Version

2

Bits

0abd702a

Nonce

1,029,662,690

Timestamp

1/26/2016, 8:11:08 PM

Confirmations

5,407,258

Merkle Root

8ea0b20b5ebb0e9704f902a0f94d884a6a6d1648531dcdd59964c9f6ba07f72b
Transactions (2)
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.

7.671 × 10⁹⁶(97-digit number)
76712757696156686882…25549457564021422079
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
7.671 × 10⁹⁶(97-digit number)
76712757696156686882…25549457564021422079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.534 × 10⁹⁷(98-digit number)
15342551539231337376…51098915128042844159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.068 × 10⁹⁷(98-digit number)
30685103078462674753…02197830256085688319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.137 × 10⁹⁷(98-digit number)
61370206156925349506…04395660512171376639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.227 × 10⁹⁸(99-digit number)
12274041231385069901…08791321024342753279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.454 × 10⁹⁸(99-digit number)
24548082462770139802…17582642048685506559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.909 × 10⁹⁸(99-digit number)
49096164925540279604…35165284097371013119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.819 × 10⁹⁸(99-digit number)
98192329851080559209…70330568194742026239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.963 × 10⁹⁹(100-digit number)
19638465970216111841…40661136389484052479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.927 × 10⁹⁹(100-digit number)
39276931940432223683…81322272778968104959
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,936,849 XPM·at block #6,836,572 · 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