Block #3,415,008

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/1/2019, 5:50:29 AM · Difficulty 10.9842 · 3,428,083 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d59e6f04406524a025b8cbb290030d3c5462e20e8ab74430f547ff179aa0c620

Height

#3,415,008

Difficulty

10.984169

Transactions

2

Size

13.86 KB

Version

2

Bits

0afbf27a

Nonce

745,158,078

Timestamp

11/1/2019, 5:50:29 AM

Confirmations

3,428,083

Merkle Root

e8b54268c84ed6657c854819ebd68c8751e008ab4f01008e5747e0993a86c8a7
Transactions (2)
1 in → 1 out8.4200 XPM109 B
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.182 × 10⁹⁵(96-digit number)
11821952026915810627…96453356757787442879
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.182 × 10⁹⁵(96-digit number)
11821952026915810627…96453356757787442879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.364 × 10⁹⁵(96-digit number)
23643904053831621254…92906713515574885759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.728 × 10⁹⁵(96-digit number)
47287808107663242509…85813427031149771519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.457 × 10⁹⁵(96-digit number)
94575616215326485019…71626854062299543039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.891 × 10⁹⁶(97-digit number)
18915123243065297003…43253708124599086079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.783 × 10⁹⁶(97-digit number)
37830246486130594007…86507416249198172159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.566 × 10⁹⁶(97-digit number)
75660492972261188015…73014832498396344319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.513 × 10⁹⁷(98-digit number)
15132098594452237603…46029664996792688639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.026 × 10⁹⁷(98-digit number)
30264197188904475206…92059329993585377279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.052 × 10⁹⁷(98-digit number)
60528394377808950412…84118659987170754559
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,989,090 XPM·at block #6,843,090 · 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