Block #1,702,460

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/4/2016, 12:39:52 PM · Difficulty 10.6660 · 5,130,574 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
38b4b3cfe4cbfa7599a766c88a865d41d59ff0cdd6fcab54373a9546cf724699

Height

#1,702,460

Difficulty

10.665978

Transactions

2

Size

4.03 KB

Version

2

Bits

0aaa7d8e

Nonce

2,018,563,696

Timestamp

8/4/2016, 12:39:52 PM

Confirmations

5,130,574

Merkle Root

2c8a01f8deaa663aa0d9faf543894c34bc02fdfa58ae304e6da443c3c82cf1da
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.

1.948 × 10⁹⁵(96-digit number)
19482120946965983436…59732058765447883519
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.948 × 10⁹⁵(96-digit number)
19482120946965983436…59732058765447883519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.896 × 10⁹⁵(96-digit number)
38964241893931966873…19464117530895767039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.792 × 10⁹⁵(96-digit number)
77928483787863933747…38928235061791534079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.558 × 10⁹⁶(97-digit number)
15585696757572786749…77856470123583068159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.117 × 10⁹⁶(97-digit number)
31171393515145573498…55712940247166136319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.234 × 10⁹⁶(97-digit number)
62342787030291146997…11425880494332272639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.246 × 10⁹⁷(98-digit number)
12468557406058229399…22851760988664545279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.493 × 10⁹⁷(98-digit number)
24937114812116458799…45703521977329090559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.987 × 10⁹⁷(98-digit number)
49874229624232917598…91407043954658181119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.974 × 10⁹⁷(98-digit number)
99748459248465835196…82814087909316362239
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,908,449 XPM·at block #6,833,033 · 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