Block #1,335,524

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/21/2015, 7:42:13 AM · Difficulty 10.8218 · 5,491,663 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0911fdbea7d10a77ac5625ac0d0e139c35e910c08c1040ba4551805d9c334be4

Height

#1,335,524

Difficulty

10.821825

Transactions

20

Size

6.16 KB

Version

2

Bits

0ad26318

Nonce

111,566,428

Timestamp

11/21/2015, 7:42:13 AM

Confirmations

5,491,663

Merkle Root

3d8adb5ee443a90f1633597d57cd2669e9f1a64aa667e9903064e70ea02f082e
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.049 × 10⁹⁵(96-digit number)
10497123800525279910…70007282646689651841
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.049 × 10⁹⁵(96-digit number)
10497123800525279910…70007282646689651841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.099 × 10⁹⁵(96-digit number)
20994247601050559820…40014565293379303681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.198 × 10⁹⁵(96-digit number)
41988495202101119640…80029130586758607361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.397 × 10⁹⁵(96-digit number)
83976990404202239280…60058261173517214721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.679 × 10⁹⁶(97-digit number)
16795398080840447856…20116522347034429441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.359 × 10⁹⁶(97-digit number)
33590796161680895712…40233044694068858881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.718 × 10⁹⁶(97-digit number)
67181592323361791424…80466089388137717761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.343 × 10⁹⁷(98-digit number)
13436318464672358284…60932178776275435521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.687 × 10⁹⁷(98-digit number)
26872636929344716569…21864357552550871041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.374 × 10⁹⁷(98-digit number)
53745273858689433139…43728715105101742081
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,861,593 XPM·at block #6,827,186 · 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