Block #345,112

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/5/2014, 5:20:05 PM · Difficulty 10.2085 · 6,479,908 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7a5c8920d161acc5c0f6a080aca02f7be77a0a4e1c95d1a9c7f27813a3dfb2e0

Height

#345,112

Difficulty

10.208517

Transactions

4

Size

1.15 KB

Version

2

Bits

0a35615d

Nonce

126,343

Timestamp

1/5/2014, 5:20:05 PM

Confirmations

6,479,908

Merkle Root

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

9.303 × 10⁹⁹(100-digit number)
93034784399623863146…20663772287052669441
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
9.303 × 10⁹⁹(100-digit number)
93034784399623863146…20663772287052669441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.860 × 10¹⁰⁰(101-digit number)
18606956879924772629…41327544574105338881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.721 × 10¹⁰⁰(101-digit number)
37213913759849545258…82655089148210677761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.442 × 10¹⁰⁰(101-digit number)
74427827519699090516…65310178296421355521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.488 × 10¹⁰¹(102-digit number)
14885565503939818103…30620356592842711041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.977 × 10¹⁰¹(102-digit number)
29771131007879636206…61240713185685422081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.954 × 10¹⁰¹(102-digit number)
59542262015759272413…22481426371370844161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.190 × 10¹⁰²(103-digit number)
11908452403151854482…44962852742741688321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.381 × 10¹⁰²(103-digit number)
23816904806303708965…89925705485483376641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.763 × 10¹⁰²(103-digit number)
47633809612607417930…79851410970966753281
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,844,243 XPM·at block #6,825,019 · 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