Block #3,462,329

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/5/2019, 9:43:47 AM · Difficulty 10.9786 · 3,378,189 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7b39b4dd0da006febce5423479868fcc2abdc175ccd93f7d65b75a352ed37607

Height

#3,462,329

Difficulty

10.978626

Transactions

2

Size

5.85 KB

Version

2

Bits

0afa8742

Nonce

889,843,000

Timestamp

12/5/2019, 9:43:47 AM

Confirmations

3,378,189

Merkle Root

eb115c9a486a6fa48eeeb304d99f52b0ba6b8c1a940889a3688b143bd7ade094
Transactions (2)
1 in → 1 out8.3400 XPM110 B
39 in → 1 out391.6173 XPM5.66 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.

2.184 × 10⁹⁵(96-digit number)
21843609821056166731…94191628681916824639
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.184 × 10⁹⁵(96-digit number)
21843609821056166731…94191628681916824639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.368 × 10⁹⁵(96-digit number)
43687219642112333463…88383257363833649279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.737 × 10⁹⁵(96-digit number)
87374439284224666927…76766514727667298559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.747 × 10⁹⁶(97-digit number)
17474887856844933385…53533029455334597119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.494 × 10⁹⁶(97-digit number)
34949775713689866771…07066058910669194239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.989 × 10⁹⁶(97-digit number)
69899551427379733542…14132117821338388479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.397 × 10⁹⁷(98-digit number)
13979910285475946708…28264235642676776959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.795 × 10⁹⁷(98-digit number)
27959820570951893416…56528471285353553919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.591 × 10⁹⁷(98-digit number)
55919641141903786833…13056942570707107839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.118 × 10⁹⁸(99-digit number)
11183928228380757366…26113885141414215679
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,968,472 XPM·at block #6,840,517 · 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