Block #3,361,157

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/19/2019, 1:11:28 PM · Difficulty 10.9957 · 3,465,685 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
af3386a8ebcb68115c4f55b08a186c71252ccbbe1d0c8974f6d8cbfd87bc9ce9

Height

#3,361,157

Difficulty

10.995715

Transactions

2

Size

1.14 KB

Version

2

Bits

0afee72b

Nonce

646,983,749

Timestamp

9/19/2019, 1:11:28 PM

Confirmations

3,465,685

Merkle Root

1232187de742bba51a6ebd104a6689d14a39c33b588ca8385f621701f6456263
Transactions (2)
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.312 × 10⁹⁴(95-digit number)
73128692145174047750…26829780005665859541
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.312 × 10⁹⁴(95-digit number)
73128692145174047750…26829780005665859541
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.462 × 10⁹⁵(96-digit number)
14625738429034809550…53659560011331719081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.925 × 10⁹⁵(96-digit number)
29251476858069619100…07319120022663438161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.850 × 10⁹⁵(96-digit number)
58502953716139238200…14638240045326876321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.170 × 10⁹⁶(97-digit number)
11700590743227847640…29276480090653752641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.340 × 10⁹⁶(97-digit number)
23401181486455695280…58552960181307505281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.680 × 10⁹⁶(97-digit number)
46802362972911390560…17105920362615010561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.360 × 10⁹⁶(97-digit number)
93604725945822781120…34211840725230021121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.872 × 10⁹⁷(98-digit number)
18720945189164556224…68423681450460042241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.744 × 10⁹⁷(98-digit number)
37441890378329112448…36847362900920084481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.488 × 10⁹⁷(98-digit number)
74883780756658224896…73694725801840168961
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,858,901 XPM·at block #6,826,841 · 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