Block #3,554,477

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/12/2020, 5:21:44 AM · Difficulty 10.9208 · 3,255,661 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a9bd3a976a1194a6b62f9401da448f009e430ff330b1954f6356370f0a997614

Height

#3,554,477

Difficulty

10.920828

Transactions

14

Size

4.68 KB

Version

2

Bits

0aebbb63

Nonce

696,282,782

Timestamp

2/12/2020, 5:21:44 AM

Confirmations

3,255,661

Merkle Root

538faf5cc867d01e6e1b73d2d8c280a1cf93e9a0741e532ffdb6c5f27626d0c7
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.297 × 10⁹⁵(96-digit number)
12975300612984300864…15914143646371488001
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.297 × 10⁹⁵(96-digit number)
12975300612984300864…15914143646371488001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.595 × 10⁹⁵(96-digit number)
25950601225968601729…31828287292742976001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.190 × 10⁹⁵(96-digit number)
51901202451937203459…63656574585485952001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.038 × 10⁹⁶(97-digit number)
10380240490387440691…27313149170971904001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.076 × 10⁹⁶(97-digit number)
20760480980774881383…54626298341943808001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.152 × 10⁹⁶(97-digit number)
41520961961549762767…09252596683887616001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.304 × 10⁹⁶(97-digit number)
83041923923099525535…18505193367775232001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.660 × 10⁹⁷(98-digit number)
16608384784619905107…37010386735550464001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.321 × 10⁹⁷(98-digit number)
33216769569239810214…74020773471100928001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.643 × 10⁹⁷(98-digit number)
66433539138479620428…48041546942201856001
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,725,172 XPM·at block #6,810,137 · 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.

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