Block #342,599

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/4/2014, 4:41:05 AM · Difficulty 10.1563 · 6,471,327 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d721fe4b0dc4cd8985a29f70cda396c7c8ae0bf99b3ffcf7def573019302131a

Height

#342,599

Difficulty

10.156314

Transactions

3

Size

826 B

Version

2

Bits

0a28042d

Nonce

7,473

Timestamp

1/4/2014, 4:41:05 AM

Confirmations

6,471,327

Merkle Root

abd975e947dd420c33357a8abf450b353c59e4a3d2ea1d5f4f0a82f63f8abe62
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.

2.170 × 10⁹⁴(95-digit number)
21702436709745615214…21508808051397683199
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
2.170 × 10⁹⁴(95-digit number)
21702436709745615214…21508808051397683199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.340 × 10⁹⁴(95-digit number)
43404873419491230429…43017616102795366399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.680 × 10⁹⁴(95-digit number)
86809746838982460859…86035232205590732799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.736 × 10⁹⁵(96-digit number)
17361949367796492171…72070464411181465599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.472 × 10⁹⁵(96-digit number)
34723898735592984343…44140928822362931199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.944 × 10⁹⁵(96-digit number)
69447797471185968687…88281857644725862399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.388 × 10⁹⁶(97-digit number)
13889559494237193737…76563715289451724799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.777 × 10⁹⁶(97-digit number)
27779118988474387475…53127430578903449599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.555 × 10⁹⁶(97-digit number)
55558237976948774950…06254861157806899199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.111 × 10⁹⁷(98-digit number)
11111647595389754990…12509722315613798399
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,755,483 XPM·at block #6,813,925 · 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