Block #3,113,572

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 3/28/2019, 5:57:04 AM · Difficulty 11.2398 · 3,727,851 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5267a43c826d0c5476ddd0cbb6308ecf92e349bb5ea55e75c30857c0e2a2f6d2

Height

#3,113,572

Difficulty

11.239780

Transactions

20

Size

6.65 KB

Version

2

Bits

0b3d6240

Nonce

230,967,304

Timestamp

3/28/2019, 5:57:04 AM

Confirmations

3,727,851

Merkle Root

0a78a02c5ae6c09587d07c1e44e8e0f1b240f20351aedee65bcbd37499061a13
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.231 × 10⁹⁶(97-digit number)
12318511740123243102…38375192087315929599
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.231 × 10⁹⁶(97-digit number)
12318511740123243102…38375192087315929599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.463 × 10⁹⁶(97-digit number)
24637023480246486205…76750384174631859199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.927 × 10⁹⁶(97-digit number)
49274046960492972410…53500768349263718399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.854 × 10⁹⁶(97-digit number)
98548093920985944820…07001536698527436799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.970 × 10⁹⁷(98-digit number)
19709618784197188964…14003073397054873599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.941 × 10⁹⁷(98-digit number)
39419237568394377928…28006146794109747199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.883 × 10⁹⁷(98-digit number)
78838475136788755856…56012293588219494399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.576 × 10⁹⁸(99-digit number)
15767695027357751171…12024587176438988799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.153 × 10⁹⁸(99-digit number)
31535390054715502342…24049174352877977599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.307 × 10⁹⁸(99-digit number)
63070780109431004685…48098348705755955199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.261 × 10⁹⁹(100-digit number)
12614156021886200937…96196697411511910399
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 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
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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,975,760 XPM·at block #6,841,422 · 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