Block #1,534,487

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/10/2016, 6:48:56 AM · Difficulty 10.6171 · 5,290,261 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5e91223c8d59b594f907e2b522d2ea900914c9b384b87c194b9959962ed9fdc9

Height

#1,534,487

Difficulty

10.617142

Transactions

3

Size

15.03 KB

Version

2

Bits

0a9dfcfe

Nonce

240,742,882

Timestamp

4/10/2016, 6:48:56 AM

Confirmations

5,290,261

Merkle Root

8b8faa5059997f431d66eccd4670567ad93427b7b308bd03a819f491fc8309ac
Transactions (3)
1 in → 1 out9.0200 XPM110 B
51 in → 1 out2750.7988 XPM7.41 KB
51 in → 1 out1120.9374 XPM7.42 KB
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.

6.478 × 10⁹³(94-digit number)
64780494738781256058…97340075337351156479
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
6.478 × 10⁹³(94-digit number)
64780494738781256058…97340075337351156479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.295 × 10⁹⁴(95-digit number)
12956098947756251211…94680150674702312959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.591 × 10⁹⁴(95-digit number)
25912197895512502423…89360301349404625919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.182 × 10⁹⁴(95-digit number)
51824395791025004846…78720602698809251839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.036 × 10⁹⁵(96-digit number)
10364879158205000969…57441205397618503679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.072 × 10⁹⁵(96-digit number)
20729758316410001938…14882410795237007359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.145 × 10⁹⁵(96-digit number)
41459516632820003877…29764821590474014719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.291 × 10⁹⁵(96-digit number)
82919033265640007755…59529643180948029439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.658 × 10⁹⁶(97-digit number)
16583806653128001551…19059286361896058879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.316 × 10⁹⁶(97-digit number)
33167613306256003102…38118572723792117759
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,842,055 XPM·at block #6,824,747 · 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