Block #3,493,831

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/30/2019, 8:13:37 AM · Difficulty 10.9508 · 3,347,541 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a936933049726cfd5943373e5abf01bcb48c7cc124509616ce12d953b261221f

Height

#3,493,831

Difficulty

10.950830

Transactions

4

Size

1003 B

Version

2

Bits

0af36994

Nonce

1,738,559,874

Timestamp

12/30/2019, 8:13:37 AM

Confirmations

3,347,541

Merkle Root

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

7.807 × 10⁹⁴(95-digit number)
78075357366440725910…58072551637044894681
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
7.807 × 10⁹⁴(95-digit number)
78075357366440725910…58072551637044894681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.561 × 10⁹⁵(96-digit number)
15615071473288145182…16145103274089789361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.123 × 10⁹⁵(96-digit number)
31230142946576290364…32290206548179578721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.246 × 10⁹⁵(96-digit number)
62460285893152580728…64580413096359157441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.249 × 10⁹⁶(97-digit number)
12492057178630516145…29160826192718314881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.498 × 10⁹⁶(97-digit number)
24984114357261032291…58321652385436629761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.996 × 10⁹⁶(97-digit number)
49968228714522064582…16643304770873259521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.993 × 10⁹⁶(97-digit number)
99936457429044129164…33286609541746519041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.998 × 10⁹⁷(98-digit number)
19987291485808825832…66573219083493038081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.997 × 10⁹⁷(98-digit number)
39974582971617651665…33146438166986076161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.994 × 10⁹⁷(98-digit number)
79949165943235303331…66292876333972152321
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,975,346 XPM·at block #6,841,371 · 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