Block #3,007,670

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/13/2019, 9:14:45 AM · Difficulty 11.2072 · 3,837,706 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
91bfb26fcaf56747fd5f6cfe226e530290c1545de3215e0fb458f1d6c51a263a

Height

#3,007,670

Difficulty

11.207200

Transactions

9

Size

2.88 KB

Version

2

Bits

0b350b0f

Nonce

166,675,730

Timestamp

1/13/2019, 9:14:45 AM

Confirmations

3,837,706

Merkle Root

1b0245da65951f667cf87fc63f5cc20a6cc52a189842df0432f2148dcbb4cc2d
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.164 × 10⁹⁴(95-digit number)
11643817386741351503…42864348855520974399
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.164 × 10⁹⁴(95-digit number)
11643817386741351503…42864348855520974399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.328 × 10⁹⁴(95-digit number)
23287634773482703006…85728697711041948799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.657 × 10⁹⁴(95-digit number)
46575269546965406013…71457395422083897599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.315 × 10⁹⁴(95-digit number)
93150539093930812026…42914790844167795199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.863 × 10⁹⁵(96-digit number)
18630107818786162405…85829581688335590399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.726 × 10⁹⁵(96-digit number)
37260215637572324810…71659163376671180799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.452 × 10⁹⁵(96-digit number)
74520431275144649621…43318326753342361599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.490 × 10⁹⁶(97-digit number)
14904086255028929924…86636653506684723199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.980 × 10⁹⁶(97-digit number)
29808172510057859848…73273307013369446399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.961 × 10⁹⁶(97-digit number)
59616345020115719696…46546614026738892799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.192 × 10⁹⁷(98-digit number)
11923269004023143939…93093228053477785599
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:58,007,452 XPM·at block #6,845,375 · 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