Block #3,555,844

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/13/2020, 7:14:33 AM · Difficulty 10.9179 · 3,250,726 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8d9578c62339a5f7d0ce43e497d8d2d68aff49b3060e027c3fdbdbe23b764a5f

Height

#3,555,844

Difficulty

10.917893

Transactions

6

Size

1.20 KB

Version

2

Bits

0aeafb01

Nonce

1,078,966,871

Timestamp

2/13/2020, 7:14:33 AM

Confirmations

3,250,726

Merkle Root

94c633f954da736d36946d0801b24cc00891511e8715eb1b808e1410fa487e16
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.656 × 10⁹⁷(98-digit number)
16562176666643361461…25043240761998730239
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.656 × 10⁹⁷(98-digit number)
16562176666643361461…25043240761998730239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.312 × 10⁹⁷(98-digit number)
33124353333286722923…50086481523997460479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.624 × 10⁹⁷(98-digit number)
66248706666573445847…00172963047994920959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.324 × 10⁹⁸(99-digit number)
13249741333314689169…00345926095989841919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.649 × 10⁹⁸(99-digit number)
26499482666629378339…00691852191979683839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.299 × 10⁹⁸(99-digit number)
52998965333258756678…01383704383959367679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.059 × 10⁹⁹(100-digit number)
10599793066651751335…02767408767918735359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.119 × 10⁹⁹(100-digit number)
21199586133303502671…05534817535837470719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.239 × 10⁹⁹(100-digit number)
42399172266607005342…11069635071674941439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.479 × 10⁹⁹(100-digit number)
84798344533214010685…22139270143349882879
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 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
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 1CC formula:

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